diff --git a/dev/CODE_OF_CONDUCT.html b/dev/CODE_OF_CONDUCT.html index e6be0996a..65a75e6fd 100644 --- a/dev/CODE_OF_CONDUCT.html +++ b/dev/CODE_OF_CONDUCT.html @@ -1,109 +1,59 @@ -Contributor Code of Conduct • TreeDist - - -
-
-
-
+
  • Changelog
    • +
      • +
    + + +
    +
    +
    +
    +

    Contributor Code of Conduct

    + Source: CODE_OF_CONDUCT.md
    @@ -116,40 +66,22 @@

    Contributor Code of Conduct

    This Code of Conduct is adapted from the Contributor Covenant (https://www.contributor-covenant.org), version 1.0.0, available at https://contributor-covenant.org/version/1/0/0/.

    -
    +
    - +
    + -
    - - - + diff --git a/dev/CONTRIBUTING.html b/dev/CONTRIBUTING.html index b3953fc2b..88c83ac36 100644 --- a/dev/CONTRIBUTING.html +++ b/dev/CONTRIBUTING.html @@ -1,109 +1,59 @@ -CONTRIBUTING • TreeDist - - -
    -
    -
    -
    +
  • Changelog
    • +
      • +
    + + +
    +
    +
    +
    +

    CONTRIBUTING

    + Source: CONTRIBUTING.md
    @@ -149,40 +99,23 @@

    Thanks for contributing!

    -
    +
    + - +
    + -
    - - - + diff --git a/dev/articles/Generalized-RF.html b/dev/articles/Generalized-RF.html index 25dd2fee9..44da0e0f0 100644 --- a/dev/articles/Generalized-RF.html +++ b/dev/articles/Generalized-RF.html @@ -4,22 +4,15 @@ - + Generalized Robinson-Foulds distances • TreeDist - - - - - - - - - + + + + + - - - + + Skip to contents -
    -
    -
    -
    -

    Generalized Robinson-Foulds distances

    + + +
    +
    + +

    Generalized Robinson-Foulds distances

    Martin R. Smith

    - Source: vignettes/Generalized-RF.Rmd - - + Source: vignettes/Generalized-RF.Rmd +
    Generalized-RF.Rmd
    @@ -227,20 +168,28 @@

    Nye et al. tree similarity m

    The first pair of subsets, ABCDEF and ABCDEIJ, have five elements in common (ABCDE), and together encompass eight elements (ABCDEFIJ). Their -subset score is thus \(\frac{5}{8}\).

    +subset score is thus +58\frac{5}{8}.

    The second pair of subsets, GHIJ and FGH, have two elements (GH) in common, of the five total -(FGHIJ), and hence receive a subset score of \(\frac{2}{5}\).

    +(FGHIJ), and hence receive a subset score of +25\frac{2}{5}.

    This split alignment then receives an alignment score -corresponding to the lower of the two subset scores, \(\frac{2}{5}\).

    +corresponding to the lower of the two subset scores, +25\frac{2}{5}.

    We must now consider the other alignment of this pair of splits,

    ABCDEF  |     GHIJ
      FGH|ABCDE  IJ
    -

    This yields subset scores of \(\frac{1}{8}\) and \(\frac{2}{9}\), and thus has an alignment -score of \(\frac{1}{8}\). This -alignment gives a lower score than the other, so is disregarded. The -pair of splits is allocated a similarity score corresponding to the -better alignment: \(\frac{2}{5}\).

    +

    This yields subset scores of +18\frac{1}{8} +and +29\frac{2}{9}, +and thus has an alignment score of +18\frac{1}{8}. +This alignment gives a lower score than the other, so is disregarded. +The pair of splits is allocated a similarity score corresponding to the +better alignment: +25\frac{2}{5}.

    As such, splits that match exactly will receive a similarity score of 1, in a manner analogous to the Robinson–Foulds distance. (This is despite the fact that some splits are more likely to match than others.) @@ -336,13 +285,20 @@

    Matching Split Distancethree leaves (‘F’, ‘I’ and ‘J’) must be moved before the splits are identical; as such, the pair of splits are assigned a difference score of three.
    -Formally, where \(S_i\) splits \(n\) leaves into bipartitions \(A_i\) and \(B_i\), the difference score is calculated -by

    -

    \(n - m\)

    -

    where \(m\) counts the number of -leaves that already match, and is defined as

    -

    \(m = \max\{|A_1 \cap A_2| + |B_1 \cap -B_2|, |A_1 \cap B_2| + |B_1 \cap A_2|\}\)

    +Formally, where +SiS_i +splits +nn +leaves into bipartitions +AiA_i +and +BiB_i, +the difference score is calculated by

    +

    n−mn - m

    +

    where +mm +counts the number of leaves that already match, and is defined as

    +

    m=max{|A1∩A2|+|B1∩B2|,|A1∩B2|+|B1∩A2|}m = \max\{|A_1 \cap A_2| + |B_1 \cap B_2|, |A_1 \cap B_2| + |B_1 \cap A_2|\}

     MatchingSplitDistance(read.tree(text='((a, b, c, d, e, f), (g, h, i, j));'),
                       read.tree(text='((a, b, c, d, e, i, j), (g, h, f));'))
    @@ -352,11 +308,15 @@

    Matching Split Distance

    Information theoretic alternative

    -

    In the matching split distance, \(m\) represents a simple count of the number -of shared taxa. An alternative is to measure the phylogenetic -information content of the largest split consistent with \(S_1\) and \(S_2\):

    -

    \(m = \max\{h(A_1 \cap A_2 | B_1 \cap B_2), -h(A_1 \cap B_2 | B_1 \cap A_2)\}\)

    +

    In the matching split distance, +mm +represents a simple count of the number of shared taxa. An alternative +is to measure the phylogenetic information content of the largest split +consistent with +S1S_1 +and +S2S_2:

    +

    m=max{h(A1∩A2|B1∩B2),h(A1∩B2|B1∩A2)}m = \max\{h(A_1 \cap A_2 | B_1 \cap B_2), h(A_1 \cap B_2 | B_1 \cap A_2)\}

    The most information-rich split consistent with

    ABCDEF  | GHIJ
 ABCDE IJ|FGH
    @@ -423,46 +383,26 @@

    References +

    - - -
    - - - + diff --git a/dev/articles/Robinson-Foulds.html b/dev/articles/Robinson-Foulds.html index 127c30ac9..6c99a3597 100644 --- a/dev/articles/Robinson-Foulds.html +++ b/dev/articles/Robinson-Foulds.html @@ -4,22 +4,15 @@ - + Extending the Robinson-Foulds metric • TreeDist - - - - - - - - - + + + + + - - - + + Skip to contents -
    -
    -
    -
    -

    Extending the Robinson-Foulds metric

    +
    +
    + +

    Extending the Robinson-Foulds metric

    Martin R. Smith

    - Source: vignettes/Robinson-Foulds.Rmd - - + Source: vignettes/Robinson-Foulds.Rmd +
    Robinson-Foulds.Rmd
    @@ -164,12 +105,15 @@

    The Robinson–Foulds distance\(\frac{1}{35}\) chance of being compatible -with the reference tree. In contrast, a split that separates two leaves -from the other six has a \(\frac{1}{7}\) chance of matching the -reference tree: the similarity observed is five times more likely to -have arisen by chance. In other words, failure to match an even split is -less noteworthy than failure to match an uneven one.

    +four (as in the right-hand tree above) has a +135\frac{1}{35} +chance of being compatible with the reference tree. In contrast, a split +that separates two leaves from the other six has a +17\frac{1}{7} +chance of matching the reference tree: the similarity observed is five +times more likely to have arisen by chance. In other words, failure to +match an even split is less noteworthy than failure to match an uneven +one.

    As a consequence, trees whose splits are less even will, on average, exhibit higher Robinson–Foulds distances with comparison trees. Compare a balanced and an unbalanced eight-taxon tree:

    @@ -178,7 +122,8 @@

    The Robinson–Foulds distance\(-\log_2(\textrm{probability})\).) +as +−log2(probability)-\log_2(\textrm{probability}).) This, in turn, is a function of the evenness of the split:

    @@ -439,46 +384,26 @@

    References + - - - - - - + diff --git a/dev/articles/Using-TreeDist.html b/dev/articles/Using-TreeDist.html index d47bb21a8..ef2fffde6 100644 --- a/dev/articles/Using-TreeDist.html +++ b/dev/articles/Using-TreeDist.html @@ -4,22 +4,15 @@ - + Calculate tree similarity with 'TreeDist' • TreeDist - - - - - - - - - + + + + + - - - - -
    -
    -
    -
    -

    Calculate tree similarity with ‘TreeDist’

    + + +
    +
    + +

    Calculate tree similarity with 'TreeDist'

    Martin R. Smith

    - Source: vignettes/Using-TreeDist.Rmd - - + Source: vignettes/Using-TreeDist.Rmd +
    Using-TreeDist.Rmd
    @@ -289,46 +230,26 @@

    What next? +

    + - - -
    - - - + diff --git a/dev/articles/compare-treesets.html b/dev/articles/compare-treesets.html index 828bc2476..a6199c1d0 100644 --- a/dev/articles/compare-treesets.html +++ b/dev/articles/compare-treesets.html @@ -4,22 +4,15 @@ - + Comparing sets of trees from different analyses • TreeDist - - - - - - - - - + + + + + - - - + + Skip to contents -
    -
    -
    -
    -

    Comparing sets of trees from different -analyses

    + + +
    +
    + +

    Comparing sets of trees from different analyses

    Martin R. Smith

    - Source: vignettes/compare-treesets.Rmd - - + Source: vignettes/compare-treesets.Rmd +
    compare-treesets.Rmd
    @@ -192,16 +132,12 @@

    Scripting at the R command linetreeStyle <- rep(styles, c(length(batch1), length(batch2))) # Calculate distances -library("TreeDist")

    -
    ## Registered S3 method overwritten by 'phangorn':
-##   method   from     
-##   [.phyDat TreeTools
    -
    -distances <- ClusteringInfoDistance(c(batch1, batch2))
+library("TreeDist")
+distances <- ClusteringInfoDistance(c(batch1, batch2))
 
 # Construct over-simple 2D PCoA mapping
 mapping <- cmdscale(distances, k = 2)
    -
    +
     # Plot mapping
 par(mar = rep(0, 4))
 plot(mapping,
@@ -233,7 +169,7 @@ 
    Comparing trees’ dispersal / hy
 
    Distances from median
 
    
 
    One approach is to plot distances from a median tree:
    
-
    +
     # Calculate median trees
 median1 <- median(batch1)
 median2 <- median(batch2)
@@ -277,7 +213,7 @@ 
    Consensus resolution(Smith, 2022b). Detecting and removing
 rogue taxa can provide a more meaningful point of comparison.
    
-
    +
+
 
-  
 
 
-      
-
    
 
-  
-
-
+  
 
diff --git a/dev/articles/different-leaves.html b/dev/articles/different-leaves.html
index cde597899..e3b1a3eb2 100644
--- a/dev/articles/different-leaves.html
+++ b/dev/articles/different-leaves.html
@@ -4,22 +4,15 @@
 
 
 
-
+
 Trees with different leaves • TreeDist
-
-
-
-
-
-
-
-
-
+
+
+
+
+
 
-
 
-
-    
-
-    
    
-      
    
-  
    
-    
    
-      
    Trees with different leaves
    
+
+
+
    
+  
    
+
+      
    Trees with different leaves
    
                         
    Martin R. Smith
    
             
       
-      Source: vignettes/different-leaves.Rmd
-      
-
+      Source: vignettes/different-leaves.Rmd
+      
    different-leaves.Rmd
    
     
    
 
     
@@ -189,21 +130,17 @@ 
    
 
-
    ## Registered S3 method overwritten by 'phangorn':
-##   method   from     
-##   [.phyDat TreeTools
    
-
    -commonTips <- intersect(TipLabels(balAL), TipLabels(balCL))
+library("TreeDist")
+commonTips <- intersect(TipLabels(balAL), TipLabels(balCL))
 
 # How much information is in tree balCL?
 ClusteringEntropy(balCL)
    
 
    ## [1] 5.780608
    
-
    +
     # All the information in balCL is also present in balAL
 MutualClusteringInfo(balCL, balAL)
    
 
    ## [1] 5.780608
    
-
    
 
    
 
 
 
-      
 
    
 
-  
-
-
+
+
+
+
+  
 
diff --git a/dev/articles/index.html b/dev/articles/index.html
index 1bbf7be19..937b7d467 100644
--- a/dev/articles/index.html
+++ b/dev/articles/index.html
@@ -1,114 +1,63 @@
 
-Articles • TreeDist
-    
-
-    
    
-      
    
-  
    
-    
    
+
  • Changelog
    • 
+      
      • 
+      
    
+
+
+  
    
+
    
+
    
+  
    
+
       
    Articles
    
     
    
 
     
    
       
    Getting started
    
-      
    
+      
    
 
       
    Calculate tree similarity with 'TreeDist'
    
         
    
@@ -119,7 +68,7 @@ 
    Getting started
    
       
    
     
    
       
    Tree space analysis
    
-      
    
+      
    
 
       
    Tree space analysis
    
         
    
@@ -130,7 +79,7 @@ 
    Tree space analysis
    
       
    
     
    
       
    Tree distance introductions
    
-      
    
+      
    
 
       
    Comparing splits using information theory
    
         
    
@@ -139,34 +88,23 @@ 
    Tree distance introductions
    
         
    Generalized Robinson-Foulds distances
    
         
    
       
    
-  
    
-
    
+  
    
 
 
-      
    
-  
    Developed by Martin R. Smith.
    
+    
    
-
-  
-
+    
    
+
+
+
+
+
+  
 
diff --git a/dev/articles/information.html b/dev/articles/information.html
index e3085c614..fde31c5b3 100644
--- a/dev/articles/information.html
+++ b/dev/articles/information.html
@@ -4,22 +4,15 @@
 
 
 
-
+
 Comparing splits using information theory • TreeDist
-
-
-
-
-
-
-
-
-
+
+
+
+
+
 
-
 
-
-    
+
+    Skip to contents
 
-    
    
-      
    
-  
    
-    
    
-      
    Comparing splits using information theory
    
+
    
+  
    
+
+      
    Comparing splits using information theory
    
                         
    Martin R. Smith
    
             
       
-      Source: vignettes/information.Rmd
-      
-
+      Source: vignettes/information.Rmd
+      
    information.Rmd
    
     
    
 
     
@@ -175,76 +116,102 @@ 
    Quantifying informationT, and with each of the two symbols equally likely, there
 is no way to compress the results of multiple tosses.
    
 
    The Shannon (1948) information content
-of an outcome \(x\) is defined to be
-\(h(x) = -\log_2{P(x)}\), which
-simplifies to \(\log_2{n}\) when all
-\(n\) outcomes are equally likely.
-Thus, the outcome of a fair coin toss delivers \(\log_2{2} = 1\textrm{ bit}\) of
-information; the outcome of rolling a fair six-sided die contains \(\log_2{6} \approx 2.58\textrm{ bits}\) of
-information; and the outcome of selecting at random one of the 105
-unrooted binary six-leaf trees is \(\log_2{105} \approx 6.71\textrm{
-bits}\).
    
+of an outcome
+xx
+is defined to be
+h(x)=−log2P(x)h(x) = -\log_2{P(x)},
+which simplifies to
+log2n\log_2{n}
+when all
+nn
+outcomes are equally likely. Thus, the outcome of a fair coin toss
+delivers
+log22=1 bit\log_2{2} = 1\textrm{ bit}
+of information; the outcome of rolling a fair six-sided die contains
+log26≈2.58 bits\log_2{6} \approx 2.58\textrm{ bits}
+of information; and the outcome of selecting at random one of the 105
+unrooted binary six-leaf trees is
+log2105≈6.71 bits\log_2{105} \approx 6.71\textrm{ bits}.
    
 
    Unlikely outcomes are more surprising, and thus contain more
 information than likely outcomes. The information content of rolling a
-twelve on two fair six-sided dice is \(-\log_2{\frac{1}{36}} \approx 5.16\textrm{
-bits}\), whereas a seven, which could be produced by six of the
-36 possible rolls (1 & 6, 2 & 5, …),
-is less surprising, and thus contains less information: \(-\log_2{\frac{6}{36}} \approx 2.58\textrm{
-bits}\). An additional 2.58 bits of information would be required
-to establish which of the six possible rolls produced the seven.
    
+twelve on two fair six-sided dice is
+−log2136≈5.16 bits-\log_2{\frac{1}{36}} \approx 5.16\textrm{ bits},
+whereas a seven, which could be produced by six of the 36 possible rolls
+(1 & 6, 2 & 5, …), is less surprising,
+and thus contains less information:
+−log2636≈2.58 bits-\log_2{\frac{6}{36}} \approx 2.58\textrm{ bits}.
+An additional 2.58 bits of information would be required to establish
+which of the six possible rolls produced the seven.
    
 
    
 
    Application to splits
 
    
-
    The split \(S_1 =\)
-AB|CDEF is found in 15 of the 105 six-leaf trees; as such,
-the probability that a randomly drawn tree contains \(S_1\) is \(P(S_1)
-= \frac{15}{105}\), and the information content \(h(S_1) =
--\log_2{\frac{15}{105}} \approx 2.81\textrm{ bits}\). Steel & Penny (2006) dub this quantity the
-phylogenetic information content.
    
-
    Likewise, the split \(S_2 =\)
-ABC|DEF occurs in nine of the 105 six-leaf trees, so \(h(S_2) = -\log_2{\frac{9}{105}} \approx
-3.54\textrm{ bits}\). Three six-leaf trees contain both splits,
-so in combination the splits deliver \(h(S_1,S_2) = -\log_2{\frac{3}{105}} \approx
-5.13\textrm{ bits}\) of information.
    
-
    Because \(h(S_1,S_2) < h(S_1) +
-h(S_2)\), some of the information in \(S_1\) is also present in \(S_2\). The information in common between
-\(S_1\) and \(S_2\) is \(h_{shared}(S_1, S_2) =
-h(S_1) + h(S_2) - h(S_1,S_2) \approx 1.22\textrm{ bits}\). The
-information unique to \(S_1\) and \(S_2\) is \(h_{different}(S_1,S_2) =
-2h(S_1,S_2) - h(S_1) - h(S_2) \approx 3.91\textrm{ bits}\).
    
+
    The split
+S1=S_1 =AB|CDEF is found in 15 of the 105 six-leaf trees; as such,
+the probability that a randomly drawn tree contains
+S1S_1
+is
+P(S1)=15105P(S_1) = \frac{15}{105},
+and the information content
+h(S1)=−log215105≈2.81 bitsh(S_1) =
+-\log_2{\frac{15}{105}} \approx 2.81\textrm{ bits}.
+Steel & Penny (2006) dub this quantity
+the phylogenetic information content.
    
+
    Likewise, the split
+S2=S_2 =ABC|DEF occurs in nine of the 105 six-leaf trees, so
+h(S2)=−log29105≈3.54 bitsh(S_2) = -\log_2{\frac{9}{105}} \approx 3.54\textrm{ bits}.
+Three six-leaf trees contain both splits, so in combination the splits
+deliver
+h(S1,S2)=−log23105≈5.13 bitsh(S_1,S_2) = -\log_2{\frac{3}{105}} \approx 5.13\textrm{ bits}
+of information.
    
+
    Because
+h(S1,S2)<h(S1)+h(S2)h(S_1,S_2) < h(S_1) + h(S_2),
+some of the information in
+S1S_1
+is also present in
+S2S_2.
+The information in common between
+S1S_1
+and
+S2S_2
+is
+hshared(S1,S2)=h(S1)+h(S2)−h(S1,S2)≈1.22 bitsh_{shared}(S_1, S_2) =
+h(S_1) + h(S_2) - h(S_1,S_2) \approx 1.22\textrm{ bits}.
+The information unique to
+S1S_1
+and
+S2S_2
+is
+hdifferent(S1,S2)=2h(S1,S2)−h(S1)−h(S2)≈3.91 bitsh_{different}(S_1,S_2) =
+2h(S_1,S_2) - h(S_1) - h(S_2) \approx 3.91\textrm{ bits}.
    
 
    These quantities can be calculated using functions in the ‘TreeTools’ package.
    
 
-
    ## Registered S3 method overwritten by 'phangorn':
-##   method   from     
-##   [.phyDat TreeTools
    
-
    -treesMatchingSplit <- c(
+library("TreeDist")
+treesMatchingSplit <- c(
   AB.CDEF = TreesMatchingSplit(2, 4),
   ABC.DEF = TreesMatchingSplit(3, 3)
 )
 treesMatchingSplit
    
 
    ## AB.CDEF ABC.DEF 
 ##      15       9
    
-
    +
     proportionMatchingSplit <- treesMatchingSplit / NUnrooted(6)
 proportionMatchingSplit
    
 
    ##    AB.CDEF    ABC.DEF 
 ## 0.14285714 0.08571429
    
-
    +
     splitInformation <- -log2(proportionMatchingSplit)
 splitInformation
    
 
    ##  AB.CDEF  ABC.DEF 
 ## 2.807355 3.544321
    
-
    +
     treesMatchingBoth <- TreesConsistentWithTwoSplits(6, 2, 3)
 combinedInformation <- -log2(treesMatchingBoth / NUnrooted(6))
 
 sharedInformation <- sum(splitInformation) - combinedInformation
 sharedInformation
    
 
    ## [1] 1.222392
    
-
    +
     # Or more concisely:
 SplitSharedInformation(n = 6, 2, 3)
    
 
    ## [1] 1.222392
    
@@ -258,27 +225,35 @@ 
    Application to splitsEntropy
 
    
 
    Entropy is the average information content of each outcome, weighted
-by its probability: \(\sum{-p
-\log_2(p)}\). Where all \(n\)
-outcomes are equiprobable, this simplifies to \(\log_2{n}\).
    
+by its probability:
+∑−plog2(p)\sum{-p \log_2(p)}.
+Where all
+nn
+outcomes are equiprobable, this simplifies to
+log2n\log_2{n}.
    
 
    Consider a case in which Jane rolls a dice, and makes two true
-statements about the outcome \(x\):
    
-
    \(S_1\): “Is the roll even?”.
    
+statements about the outcome
+xx:
    
+
    S1S_1:
+“Is the roll even?”.
    
 
      
 
    • Two equally-possible outcomes: yes or no
      • 
-
    • Entropy: \(H(S_1) = \log_2{2} = 1\textrm{
-bit}\).
      • 
+
    • Entropy:
+H(S1)=log22=1 bitH(S_1) = \log_2{2} = 1\textrm{ bit}.
      • 
 
    
-
    \(S_2\): “Is the roll greater than
-3?”
    
+
    S2S_2:
+“Is the roll greater than 3?”
    
 
      
 
    • Two equally-possible outcomes: yes or no
      • 
-
    • Entropy: \(H(S_2) = \log_2{2} = 1\textrm{
-bit}\).
      • 
+
    • Entropy:
+H(S2)=log22=1 bitH(S_2) = \log_2{2} = 1\textrm{ bit}.
      • 
 
    
-
    The joint entropy of \(S_1\) and
-\(S_2\) is the entropy of the
-association matrix that considers each possible outcome:
    
+
    The joint entropy of
+S1S_1
+and
+S2S_2
+is the entropy of the association matrix that considers each possible
+outcome:

    @@ -288,58 +263,69 @@

    Entropy

     +S1:xS_1: x +odd +S1:xS_1: x +even - - - + + + - - - + + +
      -\(S_1: x\) odd -\(S_1: x\) even
    \(S_2: x \le 3\)\(x \in {1, 3}; p = -\frac{2}{6}\)\(x = 2; p = \frac{1}{6}\)S2:x≤3S_2: x \le 3x∈1,3;p=26x \in {1, 3}; p = \frac{2}{6}x=2;p=16x = 2; p = \frac{1}{6}
    \(S_2: x > 3\)\(x = 5; p = \frac{1}{6}\)\(x \in {4, 6}; p = -\frac{2}{6}\)S2:x>3S_2: x > 3x=5;p=16x = 5; p = \frac{1}{6}x∈4,6;p=26x \in {4, 6}; p = \frac{2}{6}
    -

    \(\begin{aligned} -H(S_1, S_2) = \frac{2}{3}\log_2{\frac{2}{3}} + -\frac{1}{3}\log_2{\frac{1}{3}} + \frac{1}{3}\log_2{\frac{1}{3}} + -\frac{2}{3}\log_2{\frac{2}{3}} \approx +

    H(S1,S2)=23log223+13log213+13log213+23log223≈1.84 bits\begin{aligned} +H(S_1, S_2) = \frac{2}{3}\log_2{\frac{2}{3}} + \frac{1}{3}\log_2{\frac{1}{3}} + \frac{1}{3}\log_2{\frac{1}{3}} + \frac{2}{3}\log_2{\frac{2}{3}} \approx 1.84 \textrm{ bits} -\end{aligned}\)

    -

    Note that this less than the \(\log_2{6} -\approx 2.58\textrm{ bits}\) we require to determine the exact -value of the roll: knowledge of \(S_1\) -and \(S_2\) is not guaranteed to be -sufficient to unambiguously identify \(x\).

    -

    The mutual information between \(S_1\) and \(S_2\) describes how much knowledge of \(S_1\) reduces our uncertainty in \(S_2\) (or vice versa). So if we -learn that \(S_1\) is ‘even’, we become -a little more confident that \(S_2\) is -‘greater than three’.

    -

    The mutual information \(I(S_1;S_2)\), denoted in blue below, -corresponds to the sum of the individual entropies, minus the joint -entropy:

    -\[\begin{aligned} +\end{aligned}

    +

    Note that this less than the +log26≈2.58 bits\log_2{6} \approx 2.58\textrm{ bits} +we require to determine the exact value of the roll: knowledge of +S1S_1 +and +S2S_2 +is not guaranteed to be sufficient to unambiguously identify +xx.

    +

    The mutual information between +S1S_1 +and +S2S_2 +describes how much knowledge of +S1S_1 +reduces our uncertainty in +S2S_2 +(or vice versa). So if we learn that +S1S_1 +is ‘even’, we become a little more confident that +S2S_2 +is ‘greater than three’.

    +

    The mutual information +I(S1;S2)I(S_1;S_2), +denoted in blue below, corresponds to the sum of the individual +entropies, minus the joint entropy:

    +I(S1;S2)=H(S1)+H(S2)−H(S1,S2)\begin{aligned} I(S_1;S_2) = H(S_1) + H(S_2) - H(S_1, S_2) -\end{aligned}\]     -

    If two statements have high mutual information, then once you have +\end{aligned}

    If two statements have high mutual information, then once you have heard one statement, you already have a good idea what the outcome of the other statement will be, and thus learn little new on hearing it.

    The entropy distance, also termed the variation of information (Meila, 2007), corresponds to the information -that \(S_1\) and \(S_2\) do not have in common -(denoted below in yellow):

    -\[\begin{aligned} -H_D(S_1, S_2) = H(S_1, S_2) - I(S_1;S_2) = 2H(S_1, S_2) - H(S_1) - -H(S_2) -\end{aligned}\] -

    The higher the entropy distance, the harder it is to predict the +that +S1S_1 +and +S2S_2 +do not have in common (denoted below in yellow):

    +HD(S1,S2)=H(S1,S2)−I(S1;S2)=2H(S1,S2)−H(S1)−H(S2)\begin{aligned} +H_D(S_1, S_2) = H(S_1, S_2) - I(S_1;S_2) = 2H(S_1, S_2) - H(S_1) - H(S_2) +\end{aligned}

    The higher the entropy distance, the harder it is to predict the outcome of one statement from the other; the maximum entropy distance occurs when the two statements are entirely independent.

    @@ -350,13 +336,14 @@

    Application to splits\(-\frac{60}{100}\log_2{\frac{60}{100}}-\frac{40}{100}\log_2{\frac{40}{100}} -\approx 0.97\textrm{ bits}\).

    +40% chance of bearing the label ‘A’; the split has an entropy of +−60100log260100−40100log240100≈0.97 bits-\frac{60}{100}\log_2{\frac{60}{100}}-\frac{40}{100}\log_2{\frac{40}{100}} \approx 0.97\textrm{ bits}.

    Now consider a different split, perhaps in a different tree, that assigns 50 leaves from ‘A’ to a partition ‘C’, leaving the remaining 10 leaves from ‘A’, along with the 40 from ‘B’, in partition ‘D’. This -split has \(-\frac{50}{100}\log_2{\frac{50}{100}}-\frac{50}{100}\log_2{\frac{50}{100}} -= 1\textrm{ bit}\) of entropy.
    +split has +−50100log250100−50100log250100=1 bit-\frac{50}{100}\log_2{\frac{50}{100}}-\frac{50}{100}\log_2{\frac{50}{100}} = 1\textrm{ bit} +of entropy.
    Put these together, and a randomly selected leaf may now bear one of three possible labellings:

     -

    The two splits thus have a joint entropy of \(-\frac{50}{100}\log_2{\frac{50}{100}} +

    The two splits thus have a joint entropy of +−50100log250100−10100log210100−40100log240100≈1.36 bits<0.97+1-\frac{50}{100}\log_2{\frac{50}{100}} -\frac{10}{100}\log_2{\frac{10}{100}} --\frac{40}{100}\log_2{\frac{40}{100}} \approx 1.36\textrm{ bits} < -0.97 + 1\).

    +-\frac{40}{100}\log_2{\frac{40}{100}} \approx 1.36\textrm{ bits} < 0.97 + 1.

    The joint entropy is less than the sum of the individual entropies because the two splits contain some mutual information: for instance, if a leaf bears the label ‘B’, we can be certain that it will also bear the @@ -376,16 +363,29 @@

    Application to splitsclustering information, in contradistinction to the concept of phylogenetic information discussed above.

    -

    More formally, let split \(S\) -divides \(n\) leaves into two -partitions \(A\) and \(B\). The probability that a randomly chosen -leaf \(x\) is in partition \(k\) is \(P(x \in -k) = \frac{|k|}{n}\). \(S\) thus -corresponds to a random variable with entropy \(H(S) = -\frac{|A|}{n} \log_2{\frac{|A|}{n}} - -\frac{|B|}{n}\log_2{\frac{|B|}{n}}\) (Meila, 2007). The joint entropy of two splits, -\(S_1\) and \(S_2\), corresponds to the entropy of the -association matrix of probabilities that a randomly selected leaf -belongs to each pair of partitions:

    +

    More formally, let split +SS +divides +nn +leaves into two partitions +AA +and +BB. +The probability that a randomly chosen leaf +xx +is in partition +kk +is +P(x∈k)=|k|nP(x \in k) = \frac{|k|}{n}. +SS +thus corresponds to a random variable with entropy +H(S)=−|A|nlog2|A|n−|B|nlog2|B|nH(S) = -\frac{|A|}{n} \log_2{\frac{|A|}{n}} - +\frac{|B|}{n}\log_2{\frac{|B|}{n}}(Meila, 2007). The joint entropy of two splits, +S1S_1 +and +S2S_2, +corresponds to the entropy of the association matrix of probabilities +that a randomly selected leaf belongs to each pair of partitions:

    @@ -394,37 +394,40 @@

    Application to splits

    - - + + - - - + + + - - - + + +
     \(S_1: x \in A_1\)\(S_1: x \in B_1\)S1:x∈A1S_1: x \in A_1S1:x∈B1S_1: x \in B_1
    \(S_2: x \in A_2\)\(P(A_1,A_2) = -\frac{|A_1 \cap A_2|}{n}\)\(P(B_1,A_2) = \frac{|B_1 \cap -A_2|}{n}\)S2:x∈A2S_2: x \in A_2P(A1,A2)=|A1∩A2|nP(A_1,A_2) = +\frac{|A_1 \cap A_2|}{n}P(B1,A2)=|B1∩A2|nP(B_1,A_2) = \frac{|B_1 \cap A_2|}{n}
    \(S_2: x \in B_2\)\(P(A_1,B_2) = -\frac{|A_1 \cap B_2|}{n}\)\(P(B_1,B_2) = \frac{|B_1 \cap -B_2|}{n}\)S2:x∈B2S_2: x \in B_2P(A1,B2)=|A1∩B2|nP(A_1,B_2) = +\frac{|A_1 \cap B_2|}{n}P(B1,B2)=|B1∩B2|nP(B_1,B_2) = \frac{|B_1 \cap B_2|}{n}
    -

    \(H(S_1, S_2) = +

    H(S1,S2)=P(A1,A2)log2P(A1,A2)+P(B1,A2)log2P(B1,A2)H(S_1, S_2) = P(A_1,A_2) \log_2 {P(A_1,A_2)} + -P(B_1,A_2) \log_2 {P(B_1,A_2)}\)

    -

    \(+ P(A_1,B_2)\log_2{P(A_1,B_2)} + -P(B_1,B_2)\log_2{P(B_1,B_2)}\)

    +P(B_1,A_2) \log_2 {P(B_1,A_2)}

    +

    +P(A1,B2)log2P(A1,B2)+P(B1,B2)log2P(B1,B2)+ P(A_1,B_2)\log_2{P(A_1,B_2)} + +P(B_1,B_2)\log_2{P(B_1,B_2)}

    These values can then be substituted into the definitions of mutual information and entropy distance given above.

    -

    As \(S_1\) and \(S_2\) become more different, the -disposition of \(S_1\) gives less -information about the configuration of \(S_2\), and the mutual information decreases -accordingly.

    +

    As +S1S_1 +and +S2S_2 +become more different, the disposition of +S1S_1 +gives less information about the configuration of +S2S_2, +and the mutual information decreases accordingly.

    @@ -453,46 +456,26 @@

    References +

    + - - -
    - - - + diff --git a/dev/articles/landscapes.html b/dev/articles/landscapes.html index a36a3bbdd..aeeb37288 100644 --- a/dev/articles/landscapes.html +++ b/dev/articles/landscapes.html @@ -4,22 +4,15 @@ - + Analysing landscapes of phylogenetic trees • TreeDist - - - - - - - - - + + + + + - - - + + Skip to contents -
    -
    +
    -
    -
    -

    Analysing landscapes of phylogenetic trees

    +
    + +

    Analysing landscapes of phylogenetic trees

    Martin R. Smith

    - Source: vignettes/landscapes.Rmd - - + Source: vignettes/landscapes.Rmd +
    landscapes.Rmd
    @@ -167,12 +107,9 @@ 

     # Load required libraries
 library("TreeTools", quietly = TRUE)
-library("TreeDist")

    -
    ## Registered S3 method overwritten by 'phangorn':
-##   method   from     
-##   [.phyDat TreeTools
    -
    -# Generate a set of trees
+library("TreeDist")
+
+# Generate a set of trees
 trees <- as.phylo(as.TreeNumber(BalancedTree(16)) + 0:100 - 15, 16)
 
 # Create a 2D mapping
@@ -216,7 +153,7 @@ 
    kriging
 or (in continuous tree spaces) the use of geodesics (Khodaei, Owen, & Beerli, 2022) can produce
 even better results.
    
-
    +
     # Use an inverse distance weighting to interpolate between measured points
 Predict <- function (x, y) {
   Distance <- function (a, b) {
@@ -249,7 +186,7 @@ 
    
 
    A variety of R add-on packages facilitate three-dimensional
 plots.
    
-
    +
     if (requireNamespace("plotly", quietly = TRUE)) {
   library("plotly", quietly = TRUE)
   fig <- plot_ly(x = x, y = y, z = z)
@@ -259,7 +196,7 @@ 
      print("Run `install.packages('plotly')` to view this output")
 }
    
 
    
-
    (Use the mouse to reorient)
    
+
    (Use the mouse to reorient)
    
 
    
 
    References
 
    
@@ -271,7 +208,9 @@ 
    References
 Khodaei, M., Owen, M., & Beerli, P. (2022). Geodesics to
-characterize the phylogenetic landscape. bioR\(\chi\)iv. doi: 10.1101/2022.05.11.491507
+characterize the phylogenetic landscape.
+bioRχ\chiiv.
+doi: 10.1101/2022.05.11.491507
 
    
 
    
 Maddison, D. R. (1991). The discovery and importance of multiple islands
@@ -294,46 +233,26 @@ 
    References
+
    
 
-  
 
 
-      
-
    
 
-  
-
-
+  
 
diff --git a/dev/articles/treespace.html b/dev/articles/treespace.html
index a1fb5bfe0..05c107feb 100644
--- a/dev/articles/treespace.html
+++ b/dev/articles/treespace.html
@@ -4,22 +4,15 @@
 
 
 
-
+
 Tree space analysis • TreeDist
-
-
-
-
-
-
-
-
-
+
+
+
+
+
 
-
 
-
-    
+
+    Skip to contents
 
-    
    
-      
    
-  
    
-    
    
-      
    Tree space analysis
    
+
    
+  
    
+
+      
    Tree space analysis
    
                         
    Martin R. Smith
    
             
       
-      Source: vignettes/treespace.Rmd
-      
-
+      Source: vignettes/treespace.Rmd
+      
    treespace.Rmd
    
     
    
 
     
@@ -315,11 +256,51 @@ 
    Identifying clusters= col1, edge.width = 2, tip.color = col1)
 plot(consensus(trees[cluster == 2], p = 0.5),
      edge.color = col2, edge.width = 2, tip.color = col2)
    
-
    
+
    
 
    Here, we learn that the two clusters are distinguished by the
 position of t7.
    
 
    
 
    
+
    Identifying islands
+
    
+
    Besides clustering, we can also define ‘islands’ in tree space that
+are separated by a ‘moat’, such that all trees on one island are
+separated from all trees on another by at least a certain distance (Silva & Wilkinson, 2021).
    
+
    +par(mar = rep(0, 4))
+# set a threshold corresponding to the width of the "moat" between islands
+threshold <- 1.8
+island <- Islands(distances, threshold)
+
+# See how many trees are on each island
+table(island)
    
+
    ## island
+##  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 
+## 89  3  3  3  3  3  3  3  3  3  3 57  1  1  3  2  1  1  3  1  1  3  1  3  3  3 
+## 27 28 29 30 31 32 33 34 35 36 
+##  3  3  1  1  1  1  2  3  1  1
    
+
    +# Let's ignore the small islands for now
+largeIsle <- Islands(distances, threshold, smallest = 5)
+
+# Colour trees according to their island
+plot(mapping,
+     asp = 1, # Preserve aspect ratio - do not distort distances
+     ann = FALSE, axes = FALSE, # Don't label axes: dimensions are meaningless
+     col = ifelse(is.na(largeIsle), "grey", largeIsle + 1),
+     pch = 16
+     )
    
+
    
+
    Let’s view the consensus of each large island cluster:
    
+
    +par(mfrow = c(1, 2), mar = rep(0.2, 4))
+plot(consensus(trees[!is.na(largeIsle) & largeIsle == 1], p = 0.5),
+     edge.color = 2, edge.width = 2, tip.color = 2)
+plot(consensus(trees[!is.na(largeIsle) & largeIsle == 2], p = 0.5),
+     edge.color = 3, edge.width = 2, tip.color = 3)
    
+
    
+
    
+
    
 
    Validating a mapping
 
    
 
    Now let’s evaluate whether our map of tree space is representative.
@@ -327,7 +308,7 @@ 
    Validating a mapping
    +
     txc <- vapply(seq_len(ncol(mapping)), function(k) {
   newDist <- dist(mapping[, seq_len(k)])
   MappingQuality(distances, newDist, 10)["TxC"]
@@ -339,11 +320,11 @@ 
    Validating a mapping
    +
 
    Let’s plot the first five dimensions of our tree space, highlighting
 the convex hulls of our clusters:
    
-
    +
     nDim <- which.max(txc > 0.9)
 plotSeq <- matrix(0, nDim, nDim)
 plotSeq[upper.tri(plotSeq)] <- seq_len(nDim * (nDim - 1) / 2)
@@ -406,7 +387,7 @@ 
    Comparing cluster size(Blonder et al., 2018). Interpretation of
 overlap statistics is detailed in Mammola
 (2019).
    
-
    +
     hypervolumeInstalled <- requireNamespace("hypervolume", quietly = TRUE)
 if (hypervolumeInstalled) {
   library("hypervolume")
@@ -433,27 +414,27 @@ 
    Comparing cluster size).
    
 
    The divergence of outlying points can be measures using the sum of
 ranges:
    
-
    +
     SumOfRanges(pid_mapping, pid_cluster)
    
 
    ## [1] 132.0758 127.3610
    
 
    The overall size of a cluster can be measured using the sum of
 variances, or the mean distance from the centroid or median:
    
-
    +
     SumOfVariances(pid_mapping, pid_cluster)
    
 
    ## [1] 173.0981 176.8212
    
-
    +
     MeanCentroidDistance(pid_mapping, pid_cluster)
    
 
    ## [1] 12.58064 12.80727
    
-
    +
     DistanceFromMedian(pid_mapping, pid_cluster)
    
 
    ## [1] 13.42931 13.48348
    
 
    The density of points within a cluster can be measured using the mean
 nearest-neighbour distance or the mean minimum spanning tree edge
 length:
    
-
    +
     MeanNN(pid_mapping, pid_cluster)
    
 
    ## [1] 4.676416 5.274230
    
-
    +
     MeanMSTEdge(pid_mapping, pid_cluster)
    
 
    ## [1] 5.558778 5.804829
    
 
    
@@ -468,7 +449,7 @@ 
    Self-organizing maps
    +
     umatrixInstalled <- requireNamespace("Umatrix", quietly = TRUE)
 if (umatrixInstalled) {
   map <- Umatrix::esomTrain(as.matrix(distances), Key = seq_along(trees),
@@ -561,6 +542,11 @@ 
    References10.1109/T-C.1969.222678
 
    
+
    
+Silva, A. S., & Wilkinson, M. (2021). On defining and finding
+islands of trees and mitigating large island bias. Systematic
+Biology, 70(6), 1282–1294. doi: 10.1093/sysbio/syab015
+
    
 
    
 Smith, M. R. (2020). Information theoretic Generalized
 Robinson-Foulds metrics for comparing phylogenetic trees.
@@ -590,46 +576,26 @@ 
    References
+
    
 
-  
 
 
-      
-
    
 
-  
-
-
+  
 
diff --git a/dev/articles/treespace_files/figure-html/consensus-1.png b/dev/articles/treespace_files/figure-html/cluster-consensus-1.png
similarity index 100%
rename from dev/articles/treespace_files/figure-html/consensus-1.png
rename to dev/articles/treespace_files/figure-html/cluster-consensus-1.png
diff --git a/dev/articles/treespace_files/figure-html/island-consensus-1.png b/dev/articles/treespace_files/figure-html/island-consensus-1.png
new file mode 100644
index 000000000..e9991b243
Binary files /dev/null and b/dev/articles/treespace_files/figure-html/island-consensus-1.png differ
diff --git a/dev/articles/treespace_files/figure-html/island-id-1.png b/dev/articles/treespace_files/figure-html/island-id-1.png
new file mode 100644
index 000000000..b888c54ec
Binary files /dev/null and b/dev/articles/treespace_files/figure-html/island-id-1.png differ
diff --git a/dev/articles/using-distances.html b/dev/articles/using-distances.html
index 37912a2f1..2b334be2f 100644
--- a/dev/articles/using-distances.html
+++ b/dev/articles/using-distances.html
@@ -4,22 +4,15 @@
 
 
 
-
+
 Contextualizing tree distances • TreeDist
-
-
-
-
-
-
-
-
-
+
+
+
+
+
 
-
 
-
-    
+
+    Skip to contents
 
-    
    
-      
    
-  
    
-    
    
-      
    Contextualizing tree distances
    
+
+
    
+  
    
+
+      
    Contextualizing tree distances
    
                         
    Martin R. Smith
    
             
       
-      Source: vignettes/using-distances.Rmd
-      
-
+      Source: vignettes/using-distances.Rmd
+      
    using-distances.Rmd
    
     
    
 
     
@@ -170,12 +111,8 @@ 
    Nye et al. tree similarity(2006) similarity metric to compare two
 imperfectly-resolved trees.
    
     
-
    ## Registered S3 method overwritten by 'phangorn':
-##   method   from     
-##   [.phyDat TreeTools
    
-
    -tree1 <- ape::read.tree(text = '(A, ((B, ((C, D), (E, F))), (G, (H, (I, J, K)))));')
+library("TreeDist")
+tree1 <- ape::read.tree(text = '(A, ((B, ((C, D), (E, F))), (G, (H, (I, J, K)))));')
 tree2 <- ape::read.tree(text = '(A, (B, (C, D, E, (J, K)), (F, (G, H, I))));')
 VisualizeMatching(NyeSimilarity, tree1, tree2,
                   Plot = TreeDistPlot, matchZeros = FALSE)
    
@@ -189,10 +126,10 @@ 
    Nye et al. tree similarity
 
    Normalizing against this value tells us how similar the two trees
 are, compared to two identical eleven-leaf binary trees.
    
-
    +
     NyeSimilarity(tree1, tree2, normalize = FALSE) / 8
    
 
    ## [1] 0.2744048
    
-
    +
     NyeSimilarity(tree1, tree2, normalize = 8)
    
 
    ## [1] 0.2744048
    
 
    This approach will result in a similarity score less than one if two
@@ -201,12 +138,12 @@ 
    Nye et al. tree similarity
-
    +
     NyeSimilarity(tree1, tree2,
                   normalize = min(TreeTools::NSplits(list(tree1, tree2))))
    
 
    ## [1] 0.5488095
    
 
    More concisely, we can provide a normalizing function:
    
-
    +
     NyeSimilarity(tree1, tree2, normalize = min)
    
 
    ## [1] 0.2744048
    
 
    This approach will produce a similarity of one if one tree is a
@@ -215,7 +152,7 @@ 
    Nye et al. tree similaritypmin() to select the less resolved of each pair of
 trees:
    
-
    +
     NyeSimilarity(list(tree1, tree2), list(tree1, tree2), normalize = pmin)
    
 
    ##           [,1]      [,2]
 ## [1,] 0.8750000 0.2744048
@@ -223,7 +160,7 @@ 
    Nye et al. tree similarityTo avoid these limitations, we may instead opt to normalize against
 the average number of splits in the two trees. This is the default
 normalization method for NyeSimilarity():
    
-
    +
     NyeSimilarity(tree1, tree2, normalize = TRUE)
    
 
    ## [1] 0.3991342
    
 
    Finally, if tree1 is a “target” tree – perhaps one that
@@ -231,11 +168,11 @@ 
    Nye et al. tree similarity
 
    In that case, the best possible score is
    
-
    +
 
    ## [1] 7
    
 
    and our normalized score will be
    
-
    +
     NyeSimilarity(tree1, tree2, normalize = TreeTools::NSplits(tree1))
    
 
    ## [1] 0.3136054
    
 
    
@@ -260,7 +197,7 @@ 
    Normalizing to random similarityWith the quartet divergence, the expected tree distance is readily
 calculated: any given quartet has a one in three chance of matching by
 chance.
    
-
    +
     library("Quartet", exclude = "RobinsonFoulds")
 expectedQD <- 2 / 3
 normalizedQD <- QuartetDivergence(QuartetStatus(tree1, tree2),
@@ -270,7 +207,7 @@ 
    Normalizing to random similarityTreeDistData’. We can
 view (normalized) distances for a selection of methods:
    
-
    +
     if (requireNamespace("TreeDistData", quietly = TRUE)) {
   library("TreeDistData", exclude = "PairwiseDistances")
   data("randomTreeDistances", package = "TreeDistData")
@@ -304,7 +241,7 @@ 
    Normalizing to random similarity}
    
 
    
 
    or use these calculated values to normalize our tree distance:
    
-    
@@ -327,7 +264,7 @@ 
    Testing similarity to a known tree
 
    Ternary diagrams allow us to visualise the quality of a reconstructed
 tree with reference to a known “true” tree:
    
-
    +
     testTrees <- list(
   trueTree = ape::read.tree(text = '(a, (b, (c, (d, (e, (f, (g, h)))))));'),
   lackRes = ape::read.tree(text = '(a, (b, c, (d, e, (f, g, h))));'),
@@ -335,21 +272,21 @@ 
    Testing similarity to a known tree  bigErr = ape::read.tree(text = '(a, (c, (((b, d), (f, h)), (e, g))));')
 )
 VisualizeMatching(MutualClusteringInfo, testTrees$trueTree, testTrees$lackRes)
-points(4, 7.5, pch = 2, cex = 3, col = "#E69F00")
    
+points(4, 7.5, pch = 2, cex = 3, col = "#E69F00", xpd = NA)
    
 
    
-
    +
     VisualizeMatching(MutualClusteringInfo, testTrees$trueTree, testTrees$smallErr)
-points(4, 7.5, pch = 3, cex = 3, col = "#56B4E9")
    
+points(4, 7.5, pch = 3, cex = 3, col = "#56B4E9", xpd = NA)
    
 
    
-
    +
     VisualizeMatching(MutualClusteringInfo, testTrees$trueTree, testTrees$bigErr)
-points(4, 7.5, pch = 4, cex = 3, col = "#009E73")
    
+points(4, 7.5, pch = 4, cex = 3, col = "#009E73", xpd = NA)
    
 
    
 
    Better trees plot vertically towards the “100% shared information”
 vertex. Resolution of trees increases towards the right; trees that are
 more resolved may be no better than less-resolved trees if the addition
 of resolution introduces error.
    
-
    +
     if (requireNamespace("Ternary", quietly = TRUE)) {
   library("Ternary")
   oldPar <- par(mar = rep(0.1, 4))
@@ -377,14 +314,14 @@ 
    Example
 
    First, let’s generate a starting tree, which will represent our
 reference topology:
    
-
    +
     set.seed(0)
 trueTree <- TreeTools::RandomTree(20, root = TRUE)
    
 
    Then, let’s generate 200 degraded trees. We’ll move away from the
 true tree by making a TBR move, then reduce resolution by taking the
 consensus of this tree and three trees from its immediate neighbourhood
 (one NNI move away).
    
-
    +
     treeSearchInstalled <- requireNamespace("TreeSearch", quietly = TRUE)
 if (treeSearchInstalled) {
   library("TreeSearch", quietly = TRUE) # for TBR, NNI
@@ -402,7 +339,7 @@ 
    Example
-
    +
     if (treeSearchInstalled) {
   threeAway <- structure(lapply(seq_len(200), function(x) {
     tbrTree <- TBR(TBR(TBR(trueTree)))
@@ -415,33 +352,33 @@ 
    ExampleNow let’s calculate their tree similarity scores. We need to
 calculate the amount of information each tree has in common with the
 true tree:
    
-
    +
     if (treeSearchInstalled) {
   correct1 <- MutualClusteringInfo(trueTree, oneAway)
   correct3 <- MutualClusteringInfo(trueTree, threeAway)
 }
    
 
    The amount of information in each degraded tree:
    
-
    +
     if (treeSearchInstalled) {
   infoInTree1 <- ClusteringEntropy(oneAway)
   infoInTree3 <- ClusteringEntropy(threeAway)
 }
    
 
    The amount of information that could have been resolved, but was
 not:
    
-
    +
     if (treeSearchInstalled) {
   unresolved1 <- ClusteringEntropy(trueTree) - infoInTree1
   unresolved3 <- ClusteringEntropy(trueTree) - infoInTree3
 }
    
 
    And the amount of information incorrectly resolved:
    
-
    +
     if (treeSearchInstalled) {
   incorrect1 <- infoInTree1 - correct1
   incorrect3 <- infoInTree3 - correct3
 }
    
 
    In preparation for our plot, let’s colour our one-away trees  orange , and our three-away
 trees  blue :
    
-
    +
     col1 <- hcl(200, alpha = 0.9)
 col3 <- hcl(40, alpha = 0.9)
 spec1 <- matrix(col2rgb(col1, alpha = TRUE), nrow = 4, ncol = 181)
@@ -451,7 +388,7 @@ 
    Examplespec1 <- apply(spec1, 2, ColToHex)
 spec3 <- apply(spec3, 2, ColToHex)
    
 
    Now we can plot this information on a ternary diagram.
    
-
    +
     if (treeSearchInstalled && requireNamespace("Ternary", quietly = TRUE)) {
   layout(matrix(c(1, 2), ncol = 2), widths = c(5, 2))
   oldPar <- par(mar = rep(0, 4))
@@ -547,46 +484,26 @@ 
    References
+
    
+
 
-  
 
 
-      
-
    
 
-  
-
-
+  
 
diff --git a/dev/articles/using-distances_files/figure-html/unnamed-chunk-12-1.png b/dev/articles/using-distances_files/figure-html/unnamed-chunk-12-1.png
index 94d98d4a5..4646c5a2e 100644
Binary files a/dev/articles/using-distances_files/figure-html/unnamed-chunk-12-1.png and b/dev/articles/using-distances_files/figure-html/unnamed-chunk-12-1.png differ
diff --git a/dev/articles/using-distances_files/figure-html/unnamed-chunk-12-2.png b/dev/articles/using-distances_files/figure-html/unnamed-chunk-12-2.png
index 931f64319..a80d55c4a 100644
Binary files a/dev/articles/using-distances_files/figure-html/unnamed-chunk-12-2.png and b/dev/articles/using-distances_files/figure-html/unnamed-chunk-12-2.png differ
diff --git a/dev/articles/using-distances_files/figure-html/unnamed-chunk-12-3.png b/dev/articles/using-distances_files/figure-html/unnamed-chunk-12-3.png
index 0577832f7..251843c00 100644
Binary files a/dev/articles/using-distances_files/figure-html/unnamed-chunk-12-3.png and b/dev/articles/using-distances_files/figure-html/unnamed-chunk-12-3.png differ
diff --git a/dev/authors.html b/dev/authors.html
index 6ba59c1ad..e5fbf9d1c 100644
--- a/dev/authors.html
+++ b/dev/authors.html
@@ -1,140 +1,87 @@
 
-Authors and Citation • TreeDist
-    
-
-    
    
-      
    
-  
    
-    
    
-      
    
-        
    Authors and Citation
    
-      
    
-
-      
+    
    
+      
    Authors
    
+
       
    • 
           
      Martin R. Smith. Author, maintainer, copyright holder, programmer. 
           
      
         
      • 
         
    • 
-          
      Roy Jonker. Programmer, copyright holder. 
+          
      Roy Jonker. Programmer, copyright holder.
           
      
         
      • 
         
    • 
-          
      Yong Yang. Contributor, copyright holder. 
+          
      Yong Yang. Contributor, copyright holder.
           
      
         
      • 
         
    • 
-          
      Yi Cao. Contributor, copyright holder. 
+          
      Yi Cao. Contributor, copyright holder.
           
      
         
      • 
       
    
-    
    
-    
    
-      
    Citation
    
-      Source: inst/CITATION
-    
    
-    
    
 
+    
    
+      
    Citation
    
+      
    Source: inst/CITATION
    
 
-    
    Smith, M.R. (2020a). Information theoretic Generalized Robinson-Foulds metrics for comparing phylogenetic trees. Bioinformatics 36: 5007–5013. doi: 10.1093/bioinformatics/btaa614
    
-    
    @Article{Smith2020,
+      
    Smith, M.R. (2020a). Information theoretic Generalized Robinson-Foulds metrics for comparing phylogenetic trees. Bioinformatics 36: 5007–5013. doi: 10.1093/bioinformatics/btaa614
    
+      
    @Article{Smith2020,
   doi = {10.1093/bioinformatics/btaa614},
   title = {Information theoretic Generalized Robinson-Foulds metrics for comparing phylogenetic trees},
   author = {Martin R. Smith},
@@ -144,8 +91,8 @@ 
    Citation
    
   pages = {5007–5013},
   year = {2020},
 }
    
-    
    Smith, M.R. (2022). Robust analysis of phylogenetic tree space. Systematic Biology 71: 1255–1270. doi: 10.1093/sysbio/syab100
    
-    
    @Article{Smith2022,
+      
    Smith, M.R. (2022). Robust analysis of phylogenetic tree space. Systematic Biology 71: 1255–1270. doi: 10.1093/sysbio/syab100
    
+      
    @Article{Smith2022,
   doi = {10.1093/sysbio/syab100},
   title = {Robust analysis of phylogenetic tree space},
   author = {Martin R. Smith},
@@ -155,45 +102,33 @@ 
    Citation
    
   pages = {1255-1270},
   year = {2022},
 }
    
-    
    Smith, M.R. (2020b). TreeDist: Distances between Phylogenetic Trees. R package version 2.7.1.9002. Comprehensive R Archive Network. doi:10.5281/zenodo.3528124
    
-    
    @Manual{TreeDist,
-  title = {TreeDist: Distances between Phylogenetic Trees. R package version 2.7.1.9002},
+      
    Smith, M.R. (2020b). TreeDist: Distances between Phylogenetic Trees. R package version 2.8.0.9000. Comprehensive R Archive Network. doi:10.5281/zenodo.3528124
    
+      
    @Manual{TreeDist,
+  title = {TreeDist: Distances between Phylogenetic Trees. R package version 2.8.0.9000},
   author = {Martin R. Smith},
   doi = {10.5281/zenodo.3528124},
   journal = {Comprehensive R Archive Network},
   year = {2020},
 }
    
+    
    
 
-  
    
+  
    
 
+
+    
    
+
 
 
-      
    
-
-  
-
+  
 
diff --git a/dev/bootstrap-toc.css b/dev/bootstrap-toc.css
deleted file mode 100644
index 5a859415c..000000000
--- a/dev/bootstrap-toc.css
+++ /dev/null
@@ -1,60 +0,0 @@
-/*!
- * Bootstrap Table of Contents v0.4.1 (http://afeld.github.io/bootstrap-toc/)
- * Copyright 2015 Aidan Feldman
- * Licensed under MIT (https://github.com/afeld/bootstrap-toc/blob/gh-pages/LICENSE.md) */
-
-/* modified from https://github.com/twbs/bootstrap/blob/94b4076dd2efba9af71f0b18d4ee4b163aa9e0dd/docs/assets/css/src/docs.css#L548-L601 */
-
-/* All levels of nav */
-nav[data-toggle='toc'] .nav > li > a {
-  display: block;
-  padding: 4px 20px;
-  font-size: 13px;
-  font-weight: 500;
-  color: #767676;
-}
-nav[data-toggle='toc'] .nav > li > a:hover,
-nav[data-toggle='toc'] .nav > li > a:focus {
-  padding-left: 19px;
-  color: #563d7c;
-  text-decoration: none;
-  background-color: transparent;
-  border-left: 1px solid #563d7c;
-}
-nav[data-toggle='toc'] .nav > .active > a,
-nav[data-toggle='toc'] .nav > .active:hover > a,
-nav[data-toggle='toc'] .nav > .active:focus > a {
-  padding-left: 18px;
-  font-weight: bold;
-  color: #563d7c;
-  background-color: transparent;
-  border-left: 2px solid #563d7c;
-}
-
-/* Nav: second level (shown on .active) */
-nav[data-toggle='toc'] .nav .nav {
-  display: none; /* Hide by default, but at >768px, show it */
-  padding-bottom: 10px;
-}
-nav[data-toggle='toc'] .nav .nav > li > a {
-  padding-top: 1px;
-  padding-bottom: 1px;
-  padding-left: 30px;
-  font-size: 12px;
-  font-weight: normal;
-}
-nav[data-toggle='toc'] .nav .nav > li > a:hover,
-nav[data-toggle='toc'] .nav .nav > li > a:focus {
-  padding-left: 29px;
-}
-nav[data-toggle='toc'] .nav .nav > .active > a,
-nav[data-toggle='toc'] .nav .nav > .active:hover > a,
-nav[data-toggle='toc'] .nav .nav > .active:focus > a {
-  padding-left: 28px;
-  font-weight: 500;
-}
-
-/* from https://github.com/twbs/bootstrap/blob/e38f066d8c203c3e032da0ff23cd2d6098ee2dd6/docs/assets/css/src/docs.css#L631-L634 */
-nav[data-toggle='toc'] .nav > .active > ul {
-  display: block;
-}
diff --git a/dev/bootstrap-toc.js b/dev/bootstrap-toc.js
deleted file mode 100644
index 1cdd573b2..000000000
--- a/dev/bootstrap-toc.js
+++ /dev/null
@@ -1,159 +0,0 @@
-/*!
- * Bootstrap Table of Contents v0.4.1 (http://afeld.github.io/bootstrap-toc/)
- * Copyright 2015 Aidan Feldman
- * Licensed under MIT (https://github.com/afeld/bootstrap-toc/blob/gh-pages/LICENSE.md) */
-(function() {
-  'use strict';
-
-  window.Toc = {
-    helpers: {
-      // return all matching elements in the set, or their descendants
-      findOrFilter: function($el, selector) {
-        // http://danielnouri.org/notes/2011/03/14/a-jquery-find-that-also-finds-the-root-element/
-        // http://stackoverflow.com/a/12731439/358804
-        var $descendants = $el.find(selector);
-        return $el.filter(selector).add($descendants).filter(':not([data-toc-skip])');
-      },
-
-      generateUniqueIdBase: function(el) {
-        var text = $(el).text();
-        var anchor = text.trim().toLowerCase().replace(/[^A-Za-z0-9]+/g, '-');
-        return anchor || el.tagName.toLowerCase();
-      },
-
-      generateUniqueId: function(el) {
-        var anchorBase = this.generateUniqueIdBase(el);
-        for (var i = 0; ; i++) {
-          var anchor = anchorBase;
-          if (i > 0) {
-            // add suffix
-            anchor += '-' + i;
-          }
-          // check if ID already exists
-          if (!document.getElementById(anchor)) {
-            return anchor;
-          }
-        }
-      },
-
-      generateAnchor: function(el) {
-        if (el.id) {
-          return el.id;
-        } else {
-          var anchor = this.generateUniqueId(el);
-          el.id = anchor;
-          return anchor;
-        }
-      },
-
-      createNavList: function() {
-        return $('
      ');
-      },
-
-      createChildNavList: function($parent) {
-        var $childList = this.createNavList();
-        $parent.append($childList);
-        return $childList;
-      },
-
-      generateNavEl: function(anchor, text) {
-        var $a = $('');
-        $a.attr('href', '#' + anchor);
-        $a.text(text);
-        var $li = $('
    • ');
-        $li.append($a);
-        return $li;
-      },
-
-      generateNavItem: function(headingEl) {
-        var anchor = this.generateAnchor(headingEl);
-        var $heading = $(headingEl);
-        var text = $heading.data('toc-text') || $heading.text();
-        return this.generateNavEl(anchor, text);
-      },
-
-      // Find the first heading level (`
      `, then `
      `, etc.) that has more than one element. Defaults to 1 (for `
      `).
-      getTopLevel: function($scope) {
-        for (var i = 1; i <= 6; i++) {
-          var $headings = this.findOrFilter($scope, 'h' + i);
-          if ($headings.length > 1) {
-            return i;
-          }
-        }
-
-        return 1;
-      },
-
-      // returns the elements for the top level, and the next below it
-      getHeadings: function($scope, topLevel) {
-        var topSelector = 'h' + topLevel;
-
-        var secondaryLevel = topLevel + 1;
-        var secondarySelector = 'h' + secondaryLevel;
-
-        return this.findOrFilter($scope, topSelector + ',' + secondarySelector);
-      },
-
-      getNavLevel: function(el) {
-        return parseInt(el.tagName.charAt(1), 10);
-      },
-
-      populateNav: function($topContext, topLevel, $headings) {
-        var $context = $topContext;
-        var $prevNav;
-
-        var helpers = this;
-        $headings.each(function(i, el) {
-          var $newNav = helpers.generateNavItem(el);
-          var navLevel = helpers.getNavLevel(el);
-
-          // determine the proper $context
-          if (navLevel === topLevel) {
-            // use top level
-            $context = $topContext;
-          } else if ($prevNav && $context === $topContext) {
-            // create a new level of the tree and switch to it
-            $context = helpers.createChildNavList($prevNav);
-          } // else use the current $context
-
-          $context.append($newNav);
-
-          $prevNav = $newNav;
-        });
-      },
-
-      parseOps: function(arg) {
-        var opts;
-        if (arg.jquery) {
-          opts = {
-            $nav: arg
-          };
-        } else {
-          opts = arg;
-        }
-        opts.$scope = opts.$scope || $(document.body);
-        return opts;
-      }
-    },
-
-    // accepts a jQuery object, or an options object
-    init: function(opts) {
-      opts = this.helpers.parseOps(opts);
-
-      // ensure that the data attribute is in place for styling
-      opts.$nav.attr('data-toggle', 'toc');
-
-      var $topContext = this.helpers.createChildNavList(opts.$nav);
-      var topLevel = this.helpers.getTopLevel(opts.$scope);
-      var $headings = this.helpers.getHeadings(opts.$scope, topLevel);
-      this.helpers.populateNav($topContext, topLevel, $headings);
-    }
-  };
-
-  $(function() {
-    $('nav[data-toggle="toc"]').each(function(i, el) {
-      var $nav = $(el);
-      Toc.init($nav);
-    });
-  });
-})();
diff --git a/dev/deps/bootstrap-5.3.1/bootstrap.bundle.min.js b/dev/deps/bootstrap-5.3.1/bootstrap.bundle.min.js
new file mode 100644
index 000000000..e8f21f703
--- /dev/null
+++ b/dev/deps/bootstrap-5.3.1/bootstrap.bundle.min.js
@@ -0,0 +1,7 @@
+/*!
+  * Bootstrap v5.3.1 (https://getbootstrap.com/)
+  * Copyright 2011-2023 The Bootstrap Authors (https://github.com/twbs/bootstrap/graphs/contributors)
+  * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)
+  */
+!function(t,e){"object"==typeof exports&&"undefined"!=typeof module?module.exports=e():"function"==typeof define&&define.amd?define(e):(t="undefined"!=typeof globalThis?globalThis:t||self).bootstrap=e()}(this,(function(){"use strict";const t=new Map,e={set(e,i,n){t.has(e)||t.set(e,new Map);const s=t.get(e);s.has(i)||0===s.size?s.set(i,n):console.error(`Bootstrap doesn't allow more than one instance per element. Bound instance: ${Array.from(s.keys())[0]}.`)},get:(e,i)=>t.has(e)&&t.get(e).get(i)||null,remove(e,i){if(!t.has(e))return;const n=t.get(e);n.delete(i),0===n.size&&t.delete(e)}},i="transitionend",n=t=>(t&&window.CSS&&window.CSS.escape&&(t=t.replace(/#([^\s"#']+)/g,((t,e)=>`#${CSS.escape(e)}`))),t),s=t=>{t.dispatchEvent(new Event(i))},o=t=>!(!t||"object"!=typeof t)&&(void 0!==t.jquery&&(t=t[0]),void 0!==t.nodeType),r=t=>o(t)?t.jquery?t[0]:t:"string"==typeof t&&t.length>0?document.querySelector(n(t)):null,a=t=>{if(!o(t)||0===t.getClientRects().length)return!1;const e="visible"===getComputedStyle(t).getPropertyValue("visibility"),i=t.closest("details:not([open])");if(!i)return e;if(i!==t){const e=t.closest("summary");if(e&&e.parentNode!==i)return!1;if(null===e)return!1}return e},l=t=>!t||t.nodeType!==Node.ELEMENT_NODE||!!t.classList.contains("disabled")||(void 0!==t.disabled?t.disabled:t.hasAttribute("disabled")&&"false"!==t.getAttribute("disabled")),c=t=>{if(!document.documentElement.attachShadow)return null;if("function"==typeof t.getRootNode){const e=t.getRootNode();return e instanceof ShadowRoot?e:null}return t instanceof ShadowRoot?t:t.parentNode?c(t.parentNode):null},h=()=>{},d=t=>{t.offsetHeight},u=()=>window.jQuery&&!document.body.hasAttribute("data-bs-no-jquery")?window.jQuery:null,f=[],p=()=>"rtl"===document.documentElement.dir,m=t=>{var e;e=()=>{const e=u();if(e){const i=t.NAME,n=e.fn[i];e.fn[i]=t.jQueryInterface,e.fn[i].Constructor=t,e.fn[i].noConflict=()=>(e.fn[i]=n,t.jQueryInterface)}},"loading"===document.readyState?(f.length||document.addEventListener("DOMContentLoaded",(()=>{for(const t of f)t()})),f.push(e)):e()},g=(t,e=[],i=t)=>"function"==typeof t?t(...e):i,_=(t,e,n=!0)=>{if(!n)return void g(t);const o=(t=>{if(!t)return 0;let{transitionDuration:e,transitionDelay:i}=window.getComputedStyle(t);const n=Number.parseFloat(e),s=Number.parseFloat(i);return n||s?(e=e.split(",")[0],i=i.split(",")[0],1e3*(Number.parseFloat(e)+Number.parseFloat(i))):0})(e)+5;let r=!1;const a=({target:n})=>{n===e&&(r=!0,e.removeEventListener(i,a),g(t))};e.addEventListener(i,a),setTimeout((()=>{r||s(e)}),o)},b=(t,e,i,n)=>{const s=t.length;let o=t.indexOf(e);return-1===o?!i&&n?t[s-1]:t[0]:(o+=i?1:-1,n&&(o=(o+s)%s),t[Math.max(0,Math.min(o,s-1))])},v=/[^.]*(?=\..*)\.|.*/,y=/\..*/,w=/::\d+$/,A={};let E=1;const T={mouseenter:"mouseover",mouseleave:"mouseout"},C=new Set(["click","dblclick","mouseup","mousedown","contextmenu","mousewheel","DOMMouseScroll","mouseover","mouseout","mousemove","selectstart","selectend","keydown","keypress","keyup","orientationchange","touchstart","touchmove","touchend","touchcancel","pointerdown","pointermove","pointerup","pointerleave","pointercancel","gesturestart","gesturechange","gestureend","focus","blur","change","reset","select","submit","focusin","focusout","load","unload","beforeunload","resize","move","DOMContentLoaded","readystatechange","error","abort","scroll"]);function O(t,e){return e&&`${e}::${E++}`||t.uidEvent||E++}function x(t){const e=O(t);return t.uidEvent=e,A[e]=A[e]||{},A[e]}function k(t,e,i=null){return Object.values(t).find((t=>t.callable===e&&t.delegationSelector===i))}function L(t,e,i){const n="string"==typeof e,s=n?i:e||i;let o=I(t);return C.has(o)||(o=t),[n,s,o]}function S(t,e,i,n,s){if("string"!=typeof e||!t)return;let[o,r,a]=L(e,i,n);if(e in T){const t=t=>function(e){if(!e.relatedTarget||e.relatedTarget!==e.delegateTarget&&!e.delegateTarget.contains(e.relatedTarget))return t.call(this,e)};r=t(r)}const l=x(t),c=l[a]||(l[a]={}),h=k(c,r,o?i:null);if(h)return void(h.oneOff=h.oneOff&&s);const d=O(r,e.replace(v,"")),u=o?function(t,e,i){return function n(s){const o=t.querySelectorAll(e);for(let{target:r}=s;r&&r!==this;r=r.parentNode)for(const a of o)if(a===r)return P(s,{delegateTarget:r}),n.oneOff&&N.off(t,s.type,e,i),i.apply(r,[s])}}(t,i,r):function(t,e){return function i(n){return P(n,{delegateTarget:t}),i.oneOff&&N.off(t,n.type,e),e.apply(t,[n])}}(t,r);u.delegationSelector=o?i:null,u.callable=r,u.oneOff=s,u.uidEvent=d,c[d]=u,t.addEventListener(a,u,o)}function D(t,e,i,n,s){const o=k(e[i],n,s);o&&(t.removeEventListener(i,o,Boolean(s)),delete e[i][o.uidEvent])}function $(t,e,i,n){const s=e[i]||{};for(const[o,r]of Object.entries(s))o.includes(n)&&D(t,e,i,r.callable,r.delegationSelector)}function I(t){return t=t.replace(y,""),T[t]||t}const N={on(t,e,i,n){S(t,e,i,n,!1)},one(t,e,i,n){S(t,e,i,n,!0)},off(t,e,i,n){if("string"!=typeof e||!t)return;const[s,o,r]=L(e,i,n),a=r!==e,l=x(t),c=l[r]||{},h=e.startsWith(".");if(void 0===o){if(h)for(const i of Object.keys(l))$(t,l,i,e.slice(1));for(const[i,n]of Object.entries(c)){const s=i.replace(w,"");a&&!e.includes(s)||D(t,l,r,n.callable,n.delegationSelector)}}else{if(!Object.keys(c).length)return;D(t,l,r,o,s?i:null)}},trigger(t,e,i){if("string"!=typeof e||!t)return null;const n=u();let s=null,o=!0,r=!0,a=!1;e!==I(e)&&n&&(s=n.Event(e,i),n(t).trigger(s),o=!s.isPropagationStopped(),r=!s.isImmediatePropagationStopped(),a=s.isDefaultPrevented());const l=P(new Event(e,{bubbles:o,cancelable:!0}),i);return a&&l.preventDefault(),r&&t.dispatchEvent(l),l.defaultPrevented&&s&&s.preventDefault(),l}};function P(t,e={}){for(const[i,n]of Object.entries(e))try{t[i]=n}catch(e){Object.defineProperty(t,i,{configurable:!0,get:()=>n})}return t}function M(t){if("true"===t)return!0;if("false"===t)return!1;if(t===Number(t).toString())return Number(t);if(""===t||"null"===t)return null;if("string"!=typeof t)return t;try{return JSON.parse(decodeURIComponent(t))}catch(e){return t}}function j(t){return t.replace(/[A-Z]/g,(t=>`-${t.toLowerCase()}`))}const F={setDataAttribute(t,e,i){t.setAttribute(`data-bs-${j(e)}`,i)},removeDataAttribute(t,e){t.removeAttribute(`data-bs-${j(e)}`)},getDataAttributes(t){if(!t)return{};const e={},i=Object.keys(t.dataset).filter((t=>t.startsWith("bs")&&!t.startsWith("bsConfig")));for(const n of i){let i=n.replace(/^bs/,"");i=i.charAt(0).toLowerCase()+i.slice(1,i.length),e[i]=M(t.dataset[n])}return e},getDataAttribute:(t,e)=>M(t.getAttribute(`data-bs-${j(e)}`))};class H{static get Default(){return{}}static get DefaultType(){return{}}static get NAME(){throw new Error('You have to implement the static method "NAME", for each component!')}_getConfig(t){return t=this._mergeConfigObj(t),t=this._configAfterMerge(t),this._typeCheckConfig(t),t}_configAfterMerge(t){return t}_mergeConfigObj(t,e){const i=o(e)?F.getDataAttribute(e,"config"):{};return{...this.constructor.Default,..."object"==typeof i?i:{},...o(e)?F.getDataAttributes(e):{},..."object"==typeof t?t:{}}}_typeCheckConfig(t,e=this.constructor.DefaultType){for(const[n,s]of Object.entries(e)){const e=t[n],r=o(e)?"element":null==(i=e)?`${i}`:Object.prototype.toString.call(i).match(/\s([a-z]+)/i)[1].toLowerCase();if(!new RegExp(s).test(r))throw new TypeError(`${this.constructor.NAME.toUpperCase()}: Option "${n}" provided type "${r}" but expected type "${s}".`)}var i}}class W extends H{constructor(t,i){super(),(t=r(t))&&(this._element=t,this._config=this._getConfig(i),e.set(this._element,this.constructor.DATA_KEY,this))}dispose(){e.remove(this._element,this.constructor.DATA_KEY),N.off(this._element,this.constructor.EVENT_KEY);for(const t of Object.getOwnPropertyNames(this))this[t]=null}_queueCallback(t,e,i=!0){_(t,e,i)}_getConfig(t){return t=this._mergeConfigObj(t,this._element),t=this._configAfterMerge(t),this._typeCheckConfig(t),t}static getInstance(t){return e.get(r(t),this.DATA_KEY)}static getOrCreateInstance(t,e={}){return this.getInstance(t)||new this(t,"object"==typeof e?e:null)}static get VERSION(){return"5.3.1"}static get DATA_KEY(){return`bs.${this.NAME}`}static get EVENT_KEY(){return`.${this.DATA_KEY}`}static eventName(t){return`${t}${this.EVENT_KEY}`}}const B=t=>{let e=t.getAttribute("data-bs-target");if(!e||"#"===e){let i=t.getAttribute("href");if(!i||!i.includes("#")&&!i.startsWith("."))return null;i.includes("#")&&!i.startsWith("#")&&(i=`#${i.split("#")[1]}`),e=i&&"#"!==i?i.trim():null}return n(e)},z={find:(t,e=document.documentElement)=>[].concat(...Element.prototype.querySelectorAll.call(e,t)),findOne:(t,e=document.documentElement)=>Element.prototype.querySelector.call(e,t),children:(t,e)=>[].concat(...t.children).filter((t=>t.matches(e))),parents(t,e){const i=[];let n=t.parentNode.closest(e);for(;n;)i.push(n),n=n.parentNode.closest(e);return i},prev(t,e){let i=t.previousElementSibling;for(;i;){if(i.matches(e))return[i];i=i.previousElementSibling}return[]},next(t,e){let i=t.nextElementSibling;for(;i;){if(i.matches(e))return[i];i=i.nextElementSibling}return[]},focusableChildren(t){const e=["a","button","input","textarea","select","details","[tabindex]",'[contenteditable="true"]'].map((t=>`${t}:not([tabindex^="-"])`)).join(",");return this.find(e,t).filter((t=>!l(t)&&a(t)))},getSelectorFromElement(t){const e=B(t);return e&&z.findOne(e)?e:null},getElementFromSelector(t){const e=B(t);return e?z.findOne(e):null},getMultipleElementsFromSelector(t){const e=B(t);return e?z.find(e):[]}},R=(t,e="hide")=>{const i=`click.dismiss${t.EVENT_KEY}`,n=t.NAME;N.on(document,i,`[data-bs-dismiss="${n}"]`,(function(i){if(["A","AREA"].includes(this.tagName)&&i.preventDefault(),l(this))return;const s=z.getElementFromSelector(this)||this.closest(`.${n}`);t.getOrCreateInstance(s)[e]()}))},q=".bs.alert",V=`close${q}`,K=`closed${q}`;class Q extends W{static get NAME(){return"alert"}close(){if(N.trigger(this._element,V).defaultPrevented)return;this._element.classList.remove("show");const t=this._element.classList.contains("fade");this._queueCallback((()=>this._destroyElement()),this._element,t)}_destroyElement(){this._element.remove(),N.trigger(this._element,K),this.dispose()}static jQueryInterface(t){return this.each((function(){const e=Q.getOrCreateInstance(this);if("string"==typeof t){if(void 0===e[t]||t.startsWith("_")||"constructor"===t)throw new TypeError(`No method named "${t}"`);e[t](this)}}))}}R(Q,"close"),m(Q);const X='[data-bs-toggle="button"]';class Y extends W{static get NAME(){return"button"}toggle(){this._element.setAttribute("aria-pressed",this._element.classList.toggle("active"))}static jQueryInterface(t){return this.each((function(){const e=Y.getOrCreateInstance(this);"toggle"===t&&e[t]()}))}}N.on(document,"click.bs.button.data-api",X,(t=>{t.preventDefault();const e=t.target.closest(X);Y.getOrCreateInstance(e).toggle()})),m(Y);const U=".bs.swipe",G=`touchstart${U}`,J=`touchmove${U}`,Z=`touchend${U}`,tt=`pointerdown${U}`,et=`pointerup${U}`,it={endCallback:null,leftCallback:null,rightCallback:null},nt={endCallback:"(function|null)",leftCallback:"(function|null)",rightCallback:"(function|null)"};class st extends H{constructor(t,e){super(),this._element=t,t&&st.isSupported()&&(this._config=this._getConfig(e),this._deltaX=0,this._supportPointerEvents=Boolean(window.PointerEvent),this._initEvents())}static get Default(){return it}static get DefaultType(){return nt}static get NAME(){return"swipe"}dispose(){N.off(this._element,U)}_start(t){this._supportPointerEvents?this._eventIsPointerPenTouch(t)&&(this._deltaX=t.clientX):this._deltaX=t.touches[0].clientX}_end(t){this._eventIsPointerPenTouch(t)&&(this._deltaX=t.clientX-this._deltaX),this._handleSwipe(),g(this._config.endCallback)}_move(t){this._deltaX=t.touches&&t.touches.length>1?0:t.touches[0].clientX-this._deltaX}_handleSwipe(){const t=Math.abs(this._deltaX);if(t<=40)return;const e=t/this._deltaX;this._deltaX=0,e&&g(e>0?this._config.rightCallback:this._config.leftCallback)}_initEvents(){this._supportPointerEvents?(N.on(this._element,tt,(t=>this._start(t))),N.on(this._element,et,(t=>this._end(t))),this._element.classList.add("pointer-event")):(N.on(this._element,G,(t=>this._start(t))),N.on(this._element,J,(t=>this._move(t))),N.on(this._element,Z,(t=>this._end(t))))}_eventIsPointerPenTouch(t){return this._supportPointerEvents&&("pen"===t.pointerType||"touch"===t.pointerType)}static isSupported(){return"ontouchstart"in document.documentElement||navigator.maxTouchPoints>0}}const ot=".bs.carousel",rt=".data-api",at="next",lt="prev",ct="left",ht="right",dt=`slide${ot}`,ut=`slid${ot}`,ft=`keydown${ot}`,pt=`mouseenter${ot}`,mt=`mouseleave${ot}`,gt=`dragstart${ot}`,_t=`load${ot}${rt}`,bt=`click${ot}${rt}`,vt="carousel",yt="active",wt=".active",At=".carousel-item",Et=wt+At,Tt={ArrowLeft:ht,ArrowRight:ct},Ct={interval:5e3,keyboard:!0,pause:"hover",ride:!1,touch:!0,wrap:!0},Ot={interval:"(number|boolean)",keyboard:"boolean",pause:"(string|boolean)",ride:"(boolean|string)",touch:"boolean",wrap:"boolean"};class xt extends W{constructor(t,e){super(t,e),this._interval=null,this._activeElement=null,this._isSliding=!1,this.touchTimeout=null,this._swipeHelper=null,this._indicatorsElement=z.findOne(".carousel-indicators",this._element),this._addEventListeners(),this._config.ride===vt&&this.cycle()}static get Default(){return Ct}static get DefaultType(){return Ot}static get NAME(){return"carousel"}next(){this._slide(at)}nextWhenVisible(){!document.hidden&&a(this._element)&&this.next()}prev(){this._slide(lt)}pause(){this._isSliding&&s(this._element),this._clearInterval()}cycle(){this._clearInterval(),this._updateInterval(),this._interval=setInterval((()=>this.nextWhenVisible()),this._config.interval)}_maybeEnableCycle(){this._config.ride&&(this._isSliding?N.one(this._element,ut,(()=>this.cycle())):this.cycle())}to(t){const e=this._getItems();if(t>e.length-1||t<0)return;if(this._isSliding)return void N.one(this._element,ut,(()=>this.to(t)));const i=this._getItemIndex(this._getActive());if(i===t)return;const n=t>i?at:lt;this._slide(n,e[t])}dispose(){this._swipeHelper&&this._swipeHelper.dispose(),super.dispose()}_configAfterMerge(t){return t.defaultInterval=t.interval,t}_addEventListeners(){this._config.keyboard&&N.on(this._element,ft,(t=>this._keydown(t))),"hover"===this._config.pause&&(N.on(this._element,pt,(()=>this.pause())),N.on(this._element,mt,(()=>this._maybeEnableCycle()))),this._config.touch&&st.isSupported()&&this._addTouchEventListeners()}_addTouchEventListeners(){for(const t of z.find(".carousel-item img",this._element))N.on(t,gt,(t=>t.preventDefault()));const t={leftCallback:()=>this._slide(this._directionToOrder(ct)),rightCallback:()=>this._slide(this._directionToOrder(ht)),endCallback:()=>{"hover"===this._config.pause&&(this.pause(),this.touchTimeout&&clearTimeout(this.touchTimeout),this.touchTimeout=setTimeout((()=>this._maybeEnableCycle()),500+this._config.interval))}};this._swipeHelper=new st(this._element,t)}_keydown(t){if(/input|textarea/i.test(t.target.tagName))return;const e=Tt[t.key];e&&(t.preventDefault(),this._slide(this._directionToOrder(e)))}_getItemIndex(t){return this._getItems().indexOf(t)}_setActiveIndicatorElement(t){if(!this._indicatorsElement)return;const e=z.findOne(wt,this._indicatorsElement);e.classList.remove(yt),e.removeAttribute("aria-current");const i=z.findOne(`[data-bs-slide-to="${t}"]`,this._indicatorsElement);i&&(i.classList.add(yt),i.setAttribute("aria-current","true"))}_updateInterval(){const t=this._activeElement||this._getActive();if(!t)return;const e=Number.parseInt(t.getAttribute("data-bs-interval"),10);this._config.interval=e||this._config.defaultInterval}_slide(t,e=null){if(this._isSliding)return;const i=this._getActive(),n=t===at,s=e||b(this._getItems(),i,n,this._config.wrap);if(s===i)return;const o=this._getItemIndex(s),r=e=>N.trigger(this._element,e,{relatedTarget:s,direction:this._orderToDirection(t),from:this._getItemIndex(i),to:o});if(r(dt).defaultPrevented)return;if(!i||!s)return;const a=Boolean(this._interval);this.pause(),this._isSliding=!0,this._setActiveIndicatorElement(o),this._activeElement=s;const l=n?"carousel-item-start":"carousel-item-end",c=n?"carousel-item-next":"carousel-item-prev";s.classList.add(c),d(s),i.classList.add(l),s.classList.add(l),this._queueCallback((()=>{s.classList.remove(l,c),s.classList.add(yt),i.classList.remove(yt,c,l),this._isSliding=!1,r(ut)}),i,this._isAnimated()),a&&this.cycle()}_isAnimated(){return this._element.classList.contains("slide")}_getActive(){return z.findOne(Et,this._element)}_getItems(){return z.find(At,this._element)}_clearInterval(){this._interval&&(clearInterval(this._interval),this._interval=null)}_directionToOrder(t){return p()?t===ct?lt:at:t===ct?at:lt}_orderToDirection(t){return p()?t===lt?ct:ht:t===lt?ht:ct}static jQueryInterface(t){return this.each((function(){const e=xt.getOrCreateInstance(this,t);if("number"!=typeof t){if("string"==typeof t){if(void 0===e[t]||t.startsWith("_")||"constructor"===t)throw new TypeError(`No method named "${t}"`);e[t]()}}else e.to(t)}))}}N.on(document,bt,"[data-bs-slide], [data-bs-slide-to]",(function(t){const e=z.getElementFromSelector(this);if(!e||!e.classList.contains(vt))return;t.preventDefault();const i=xt.getOrCreateInstance(e),n=this.getAttribute("data-bs-slide-to");return n?(i.to(n),void i._maybeEnableCycle()):"next"===F.getDataAttribute(this,"slide")?(i.next(),void i._maybeEnableCycle()):(i.prev(),void i._maybeEnableCycle())})),N.on(window,_t,(()=>{const t=z.find('[data-bs-ride="carousel"]');for(const e of t)xt.getOrCreateInstance(e)})),m(xt);const kt=".bs.collapse",Lt=`show${kt}`,St=`shown${kt}`,Dt=`hide${kt}`,$t=`hidden${kt}`,It=`click${kt}.data-api`,Nt="show",Pt="collapse",Mt="collapsing",jt=`:scope .${Pt} .${Pt}`,Ft='[data-bs-toggle="collapse"]',Ht={parent:null,toggle:!0},Wt={parent:"(null|element)",toggle:"boolean"};class Bt extends W{constructor(t,e){super(t,e),this._isTransitioning=!1,this._triggerArray=[];const i=z.find(Ft);for(const t of i){const e=z.getSelectorFromElement(t),i=z.find(e).filter((t=>t===this._element));null!==e&&i.length&&this._triggerArray.push(t)}this._initializeChildren(),this._config.parent||this._addAriaAndCollapsedClass(this._triggerArray,this._isShown()),this._config.toggle&&this.toggle()}static get Default(){return Ht}static get DefaultType(){return Wt}static get NAME(){return"collapse"}toggle(){this._isShown()?this.hide():this.show()}show(){if(this._isTransitioning||this._isShown())return;let t=[];if(this._config.parent&&(t=this._getFirstLevelChildren(".collapse.show, .collapse.collapsing").filter((t=>t!==this._element)).map((t=>Bt.getOrCreateInstance(t,{toggle:!1})))),t.length&&t[0]._isTransitioning)return;if(N.trigger(this._element,Lt).defaultPrevented)return;for(const e of t)e.hide();const e=this._getDimension();this._element.classList.remove(Pt),this._element.classList.add(Mt),this._element.style[e]=0,this._addAriaAndCollapsedClass(this._triggerArray,!0),this._isTransitioning=!0;const i=`scroll${e[0].toUpperCase()+e.slice(1)}`;this._queueCallback((()=>{this._isTransitioning=!1,this._element.classList.remove(Mt),this._element.classList.add(Pt,Nt),this._element.style[e]="",N.trigger(this._element,St)}),this._element,!0),this._element.style[e]=`${this._element[i]}px`}hide(){if(this._isTransitioning||!this._isShown())return;if(N.trigger(this._element,Dt).defaultPrevented)return;const t=this._getDimension();this._element.style[t]=`${this._element.getBoundingClientRect()[t]}px`,d(this._element),this._element.classList.add(Mt),this._element.classList.remove(Pt,Nt);for(const t of this._triggerArray){const e=z.getElementFromSelector(t);e&&!this._isShown(e)&&this._addAriaAndCollapsedClass([t],!1)}this._isTransitioning=!0,this._element.style[t]="",this._queueCallback((()=>{this._isTransitioning=!1,this._element.classList.remove(Mt),this._element.classList.add(Pt),N.trigger(this._element,$t)}),this._element,!0)}_isShown(t=this._element){return t.classList.contains(Nt)}_configAfterMerge(t){return t.toggle=Boolean(t.toggle),t.parent=r(t.parent),t}_getDimension(){return this._element.classList.contains("collapse-horizontal")?"width":"height"}_initializeChildren(){if(!this._config.parent)return;const t=this._getFirstLevelChildren(Ft);for(const e of t){const t=z.getElementFromSelector(e);t&&this._addAriaAndCollapsedClass([e],this._isShown(t))}}_getFirstLevelChildren(t){const e=z.find(jt,this._config.parent);return z.find(t,this._config.parent).filter((t=>!e.includes(t)))}_addAriaAndCollapsedClass(t,e){if(t.length)for(const i of t)i.classList.toggle("collapsed",!e),i.setAttribute("aria-expanded",e)}static jQueryInterface(t){const e={};return"string"==typeof t&&/show|hide/.test(t)&&(e.toggle=!1),this.each((function(){const i=Bt.getOrCreateInstance(this,e);if("string"==typeof t){if(void 0===i[t])throw new TypeError(`No method named "${t}"`);i[t]()}}))}}N.on(document,It,Ft,(function(t){("A"===t.target.tagName||t.delegateTarget&&"A"===t.delegateTarget.tagName)&&t.preventDefault();for(const t of z.getMultipleElementsFromSelector(this))Bt.getOrCreateInstance(t,{toggle:!1}).toggle()})),m(Bt);var zt="top",Rt="bottom",qt="right",Vt="left",Kt="auto",Qt=[zt,Rt,qt,Vt],Xt="start",Yt="end",Ut="clippingParents",Gt="viewport",Jt="popper",Zt="reference",te=Qt.reduce((function(t,e){return t.concat([e+"-"+Xt,e+"-"+Yt])}),[]),ee=[].concat(Qt,[Kt]).reduce((function(t,e){return t.concat([e,e+"-"+Xt,e+"-"+Yt])}),[]),ie="beforeRead",ne="read",se="afterRead",oe="beforeMain",re="main",ae="afterMain",le="beforeWrite",ce="write",he="afterWrite",de=[ie,ne,se,oe,re,ae,le,ce,he];function ue(t){return t?(t.nodeName||"").toLowerCase():null}function fe(t){if(null==t)return window;if("[object Window]"!==t.toString()){var e=t.ownerDocument;return e&&e.defaultView||window}return t}function pe(t){return t instanceof fe(t).Element||t instanceof Element}function me(t){return t instanceof fe(t).HTMLElement||t instanceof HTMLElement}function ge(t){return"undefined"!=typeof ShadowRoot&&(t instanceof fe(t).ShadowRoot||t instanceof ShadowRoot)}const _e={name:"applyStyles",enabled:!0,phase:"write",fn:function(t){var e=t.state;Object.keys(e.elements).forEach((function(t){var i=e.styles[t]||{},n=e.attributes[t]||{},s=e.elements[t];me(s)&&ue(s)&&(Object.assign(s.style,i),Object.keys(n).forEach((function(t){var e=n[t];!1===e?s.removeAttribute(t):s.setAttribute(t,!0===e?"":e)})))}))},effect:function(t){var e=t.state,i={popper:{position:e.options.strategy,left:"0",top:"0",margin:"0"},arrow:{position:"absolute"},reference:{}};return Object.assign(e.elements.popper.style,i.popper),e.styles=i,e.elements.arrow&&Object.assign(e.elements.arrow.style,i.arrow),function(){Object.keys(e.elements).forEach((function(t){var n=e.elements[t],s=e.attributes[t]||{},o=Object.keys(e.styles.hasOwnProperty(t)?e.styles[t]:i[t]).reduce((function(t,e){return t[e]="",t}),{});me(n)&&ue(n)&&(Object.assign(n.style,o),Object.keys(s).forEach((function(t){n.removeAttribute(t)})))}))}},requires:["computeStyles"]};function be(t){return t.split("-")[0]}var ve=Math.max,ye=Math.min,we=Math.round;function Ae(){var t=navigator.userAgentData;return null!=t&&t.brands&&Array.isArray(t.brands)?t.brands.map((function(t){return t.brand+"/"+t.version})).join(" "):navigator.userAgent}function Ee(){return!/^((?!chrome|android).)*safari/i.test(Ae())}function Te(t,e,i){void 0===e&&(e=!1),void 0===i&&(i=!1);var n=t.getBoundingClientRect(),s=1,o=1;e&&me(t)&&(s=t.offsetWidth>0&&we(n.width)/t.offsetWidth||1,o=t.offsetHeight>0&&we(n.height)/t.offsetHeight||1);var r=(pe(t)?fe(t):window).visualViewport,a=!Ee()&&i,l=(n.left+(a&&r?r.offsetLeft:0))/s,c=(n.top+(a&&r?r.offsetTop:0))/o,h=n.width/s,d=n.height/o;return{width:h,height:d,top:c,right:l+h,bottom:c+d,left:l,x:l,y:c}}function Ce(t){var e=Te(t),i=t.offsetWidth,n=t.offsetHeight;return Math.abs(e.width-i)<=1&&(i=e.width),Math.abs(e.height-n)<=1&&(n=e.height),{x:t.offsetLeft,y:t.offsetTop,width:i,height:n}}function Oe(t,e){var i=e.getRootNode&&e.getRootNode();if(t.contains(e))return!0;if(i&&ge(i)){var n=e;do{if(n&&t.isSameNode(n))return!0;n=n.parentNode||n.host}while(n)}return!1}function xe(t){return fe(t).getComputedStyle(t)}function ke(t){return["table","td","th"].indexOf(ue(t))>=0}function Le(t){return((pe(t)?t.ownerDocument:t.document)||window.document).documentElement}function Se(t){return"html"===ue(t)?t:t.assignedSlot||t.parentNode||(ge(t)?t.host:null)||Le(t)}function De(t){return me(t)&&"fixed"!==xe(t).position?t.offsetParent:null}function $e(t){for(var e=fe(t),i=De(t);i&&ke(i)&&"static"===xe(i).position;)i=De(i);return i&&("html"===ue(i)||"body"===ue(i)&&"static"===xe(i).position)?e:i||function(t){var e=/firefox/i.test(Ae());if(/Trident/i.test(Ae())&&me(t)&&"fixed"===xe(t).position)return null;var i=Se(t);for(ge(i)&&(i=i.host);me(i)&&["html","body"].indexOf(ue(i))<0;){var n=xe(i);if("none"!==n.transform||"none"!==n.perspective||"paint"===n.contain||-1!==["transform","perspective"].indexOf(n.willChange)||e&&"filter"===n.willChange||e&&n.filter&&"none"!==n.filter)return i;i=i.parentNode}return null}(t)||e}function Ie(t){return["top","bottom"].indexOf(t)>=0?"x":"y"}function Ne(t,e,i){return ve(t,ye(e,i))}function Pe(t){return Object.assign({},{top:0,right:0,bottom:0,left:0},t)}function Me(t,e){return e.reduce((function(e,i){return e[i]=t,e}),{})}const je={name:"arrow",enabled:!0,phase:"main",fn:function(t){var e,i=t.state,n=t.name,s=t.options,o=i.elements.arrow,r=i.modifiersData.popperOffsets,a=be(i.placement),l=Ie(a),c=[Vt,qt].indexOf(a)>=0?"height":"width";if(o&&r){var h=function(t,e){return Pe("number"!=typeof(t="function"==typeof t?t(Object.assign({},e.rects,{placement:e.placement})):t)?t:Me(t,Qt))}(s.padding,i),d=Ce(o),u="y"===l?zt:Vt,f="y"===l?Rt:qt,p=i.rects.reference[c]+i.rects.reference[l]-r[l]-i.rects.popper[c],m=r[l]-i.rects.reference[l],g=$e(o),_=g?"y"===l?g.clientHeight||0:g.clientWidth||0:0,b=p/2-m/2,v=h[u],y=_-d[c]-h[f],w=_/2-d[c]/2+b,A=Ne(v,w,y),E=l;i.modifiersData[n]=((e={})[E]=A,e.centerOffset=A-w,e)}},effect:function(t){var e=t.state,i=t.options.element,n=void 0===i?"[data-popper-arrow]":i;null!=n&&("string"!=typeof n||(n=e.elements.popper.querySelector(n)))&&Oe(e.elements.popper,n)&&(e.elements.arrow=n)},requires:["popperOffsets"],requiresIfExists:["preventOverflow"]};function Fe(t){return t.split("-")[1]}var He={top:"auto",right:"auto",bottom:"auto",left:"auto"};function We(t){var e,i=t.popper,n=t.popperRect,s=t.placement,o=t.variation,r=t.offsets,a=t.position,l=t.gpuAcceleration,c=t.adaptive,h=t.roundOffsets,d=t.isFixed,u=r.x,f=void 0===u?0:u,p=r.y,m=void 0===p?0:p,g="function"==typeof h?h({x:f,y:m}):{x:f,y:m};f=g.x,m=g.y;var _=r.hasOwnProperty("x"),b=r.hasOwnProperty("y"),v=Vt,y=zt,w=window;if(c){var A=$e(i),E="clientHeight",T="clientWidth";A===fe(i)&&"static"!==xe(A=Le(i)).position&&"absolute"===a&&(E="scrollHeight",T="scrollWidth"),(s===zt||(s===Vt||s===qt)&&o===Yt)&&(y=Rt,m-=(d&&A===w&&w.visualViewport?w.visualViewport.height:A[E])-n.height,m*=l?1:-1),s!==Vt&&(s!==zt&&s!==Rt||o!==Yt)||(v=qt,f-=(d&&A===w&&w.visualViewport?w.visualViewport.width:A[T])-n.width,f*=l?1:-1)}var C,O=Object.assign({position:a},c&&He),x=!0===h?function(t,e){var i=t.x,n=t.y,s=e.devicePixelRatio||1;return{x:we(i*s)/s||0,y:we(n*s)/s||0}}({x:f,y:m},fe(i)):{x:f,y:m};return f=x.x,m=x.y,l?Object.assign({},O,((C={})[y]=b?"0":"",C[v]=_?"0":"",C.transform=(w.devicePixelRatio||1)<=1?"translate("+f+"px, "+m+"px)":"translate3d("+f+"px, "+m+"px, 0)",C)):Object.assign({},O,((e={})[y]=b?m+"px":"",e[v]=_?f+"px":"",e.transform="",e))}const Be={name:"computeStyles",enabled:!0,phase:"beforeWrite",fn:function(t){var e=t.state,i=t.options,n=i.gpuAcceleration,s=void 0===n||n,o=i.adaptive,r=void 0===o||o,a=i.roundOffsets,l=void 0===a||a,c={placement:be(e.placement),variation:Fe(e.placement),popper:e.elements.popper,popperRect:e.rects.popper,gpuAcceleration:s,isFixed:"fixed"===e.options.strategy};null!=e.modifiersData.popperOffsets&&(e.styles.popper=Object.assign({},e.styles.popper,We(Object.assign({},c,{offsets:e.modifiersData.popperOffsets,position:e.options.strategy,adaptive:r,roundOffsets:l})))),null!=e.modifiersData.arrow&&(e.styles.arrow=Object.assign({},e.styles.arrow,We(Object.assign({},c,{offsets:e.modifiersData.arrow,position:"absolute",adaptive:!1,roundOffsets:l})))),e.attributes.popper=Object.assign({},e.attributes.popper,{"data-popper-placement":e.placement})},data:{}};var ze={passive:!0};const Re={name:"eventListeners",enabled:!0,phase:"write",fn:function(){},effect:function(t){var e=t.state,i=t.instance,n=t.options,s=n.scroll,o=void 0===s||s,r=n.resize,a=void 0===r||r,l=fe(e.elements.popper),c=[].concat(e.scrollParents.reference,e.scrollParents.popper);return o&&c.forEach((function(t){t.addEventListener("scroll",i.update,ze)})),a&&l.addEventListener("resize",i.update,ze),function(){o&&c.forEach((function(t){t.removeEventListener("scroll",i.update,ze)})),a&&l.removeEventListener("resize",i.update,ze)}},data:{}};var qe={left:"right",right:"left",bottom:"top",top:"bottom"};function Ve(t){return t.replace(/left|right|bottom|top/g,(function(t){return qe[t]}))}var Ke={start:"end",end:"start"};function Qe(t){return t.replace(/start|end/g,(function(t){return Ke[t]}))}function Xe(t){var e=fe(t);return{scrollLeft:e.pageXOffset,scrollTop:e.pageYOffset}}function Ye(t){return Te(Le(t)).left+Xe(t).scrollLeft}function Ue(t){var e=xe(t),i=e.overflow,n=e.overflowX,s=e.overflowY;return/auto|scroll|overlay|hidden/.test(i+s+n)}function Ge(t){return["html","body","#document"].indexOf(ue(t))>=0?t.ownerDocument.body:me(t)&&Ue(t)?t:Ge(Se(t))}function Je(t,e){var i;void 0===e&&(e=[]);var n=Ge(t),s=n===(null==(i=t.ownerDocument)?void 0:i.body),o=fe(n),r=s?[o].concat(o.visualViewport||[],Ue(n)?n:[]):n,a=e.concat(r);return s?a:a.concat(Je(Se(r)))}function Ze(t){return Object.assign({},t,{left:t.x,top:t.y,right:t.x+t.width,bottom:t.y+t.height})}function ti(t,e,i){return e===Gt?Ze(function(t,e){var i=fe(t),n=Le(t),s=i.visualViewport,o=n.clientWidth,r=n.clientHeight,a=0,l=0;if(s){o=s.width,r=s.height;var c=Ee();(c||!c&&"fixed"===e)&&(a=s.offsetLeft,l=s.offsetTop)}return{width:o,height:r,x:a+Ye(t),y:l}}(t,i)):pe(e)?function(t,e){var i=Te(t,!1,"fixed"===e);return i.top=i.top+t.clientTop,i.left=i.left+t.clientLeft,i.bottom=i.top+t.clientHeight,i.right=i.left+t.clientWidth,i.width=t.clientWidth,i.height=t.clientHeight,i.x=i.left,i.y=i.top,i}(e,i):Ze(function(t){var e,i=Le(t),n=Xe(t),s=null==(e=t.ownerDocument)?void 0:e.body,o=ve(i.scrollWidth,i.clientWidth,s?s.scrollWidth:0,s?s.clientWidth:0),r=ve(i.scrollHeight,i.clientHeight,s?s.scrollHeight:0,s?s.clientHeight:0),a=-n.scrollLeft+Ye(t),l=-n.scrollTop;return"rtl"===xe(s||i).direction&&(a+=ve(i.clientWidth,s?s.clientWidth:0)-o),{width:o,height:r,x:a,y:l}}(Le(t)))}function ei(t){var e,i=t.reference,n=t.element,s=t.placement,o=s?be(s):null,r=s?Fe(s):null,a=i.x+i.width/2-n.width/2,l=i.y+i.height/2-n.height/2;switch(o){case zt:e={x:a,y:i.y-n.height};break;case Rt:e={x:a,y:i.y+i.height};break;case qt:e={x:i.x+i.width,y:l};break;case Vt:e={x:i.x-n.width,y:l};break;default:e={x:i.x,y:i.y}}var c=o?Ie(o):null;if(null!=c){var h="y"===c?"height":"width";switch(r){case Xt:e[c]=e[c]-(i[h]/2-n[h]/2);break;case Yt:e[c]=e[c]+(i[h]/2-n[h]/2)}}return e}function ii(t,e){void 0===e&&(e={});var i=e,n=i.placement,s=void 0===n?t.placement:n,o=i.strategy,r=void 0===o?t.strategy:o,a=i.boundary,l=void 0===a?Ut:a,c=i.rootBoundary,h=void 0===c?Gt:c,d=i.elementContext,u=void 0===d?Jt:d,f=i.altBoundary,p=void 0!==f&&f,m=i.padding,g=void 0===m?0:m,_=Pe("number"!=typeof g?g:Me(g,Qt)),b=u===Jt?Zt:Jt,v=t.rects.popper,y=t.elements[p?b:u],w=function(t,e,i,n){var s="clippingParents"===e?function(t){var e=Je(Se(t)),i=["absolute","fixed"].indexOf(xe(t).position)>=0&&me(t)?$e(t):t;return pe(i)?e.filter((function(t){return pe(t)&&Oe(t,i)&&"body"!==ue(t)})):[]}(t):[].concat(e),o=[].concat(s,[i]),r=o[0],a=o.reduce((function(e,i){var s=ti(t,i,n);return e.top=ve(s.top,e.top),e.right=ye(s.right,e.right),e.bottom=ye(s.bottom,e.bottom),e.left=ve(s.left,e.left),e}),ti(t,r,n));return a.width=a.right-a.left,a.height=a.bottom-a.top,a.x=a.left,a.y=a.top,a}(pe(y)?y:y.contextElement||Le(t.elements.popper),l,h,r),A=Te(t.elements.reference),E=ei({reference:A,element:v,strategy:"absolute",placement:s}),T=Ze(Object.assign({},v,E)),C=u===Jt?T:A,O={top:w.top-C.top+_.top,bottom:C.bottom-w.bottom+_.bottom,left:w.left-C.left+_.left,right:C.right-w.right+_.right},x=t.modifiersData.offset;if(u===Jt&&x){var k=x[s];Object.keys(O).forEach((function(t){var e=[qt,Rt].indexOf(t)>=0?1:-1,i=[zt,Rt].indexOf(t)>=0?"y":"x";O[t]+=k[i]*e}))}return O}function ni(t,e){void 0===e&&(e={});var i=e,n=i.placement,s=i.boundary,o=i.rootBoundary,r=i.padding,a=i.flipVariations,l=i.allowedAutoPlacements,c=void 0===l?ee:l,h=Fe(n),d=h?a?te:te.filter((function(t){return Fe(t)===h})):Qt,u=d.filter((function(t){return c.indexOf(t)>=0}));0===u.length&&(u=d);var f=u.reduce((function(e,i){return e[i]=ii(t,{placement:i,boundary:s,rootBoundary:o,padding:r})[be(i)],e}),{});return Object.keys(f).sort((function(t,e){return f[t]-f[e]}))}const si={name:"flip",enabled:!0,phase:"main",fn:function(t){var e=t.state,i=t.options,n=t.name;if(!e.modifiersData[n]._skip){for(var s=i.mainAxis,o=void 0===s||s,r=i.altAxis,a=void 0===r||r,l=i.fallbackPlacements,c=i.padding,h=i.boundary,d=i.rootBoundary,u=i.altBoundary,f=i.flipVariations,p=void 0===f||f,m=i.allowedAutoPlacements,g=e.options.placement,_=be(g),b=l||(_!==g&&p?function(t){if(be(t)===Kt)return[];var e=Ve(t);return[Qe(t),e,Qe(e)]}(g):[Ve(g)]),v=[g].concat(b).reduce((function(t,i){return t.concat(be(i)===Kt?ni(e,{placement:i,boundary:h,rootBoundary:d,padding:c,flipVariations:p,allowedAutoPlacements:m}):i)}),[]),y=e.rects.reference,w=e.rects.popper,A=new Map,E=!0,T=v[0],C=0;C=0,S=L?"width":"height",D=ii(e,{placement:O,boundary:h,rootBoundary:d,altBoundary:u,padding:c}),$=L?k?qt:Vt:k?Rt:zt;y[S]>w[S]&&($=Ve($));var I=Ve($),N=[];if(o&&N.push(D[x]<=0),a&&N.push(D[$]<=0,D[I]<=0),N.every((function(t){return t}))){T=O,E=!1;break}A.set(O,N)}if(E)for(var P=function(t){var e=v.find((function(e){var i=A.get(e);if(i)return i.slice(0,t).every((function(t){return t}))}));if(e)return T=e,"break"},M=p?3:1;M>0&&"break"!==P(M);M--);e.placement!==T&&(e.modifiersData[n]._skip=!0,e.placement=T,e.reset=!0)}},requiresIfExists:["offset"],data:{_skip:!1}};function oi(t,e,i){return void 0===i&&(i={x:0,y:0}),{top:t.top-e.height-i.y,right:t.right-e.width+i.x,bottom:t.bottom-e.height+i.y,left:t.left-e.width-i.x}}function ri(t){return[zt,qt,Rt,Vt].some((function(e){return t[e]>=0}))}const ai={name:"hide",enabled:!0,phase:"main",requiresIfExists:["preventOverflow"],fn:function(t){var e=t.state,i=t.name,n=e.rects.reference,s=e.rects.popper,o=e.modifiersData.preventOverflow,r=ii(e,{elementContext:"reference"}),a=ii(e,{altBoundary:!0}),l=oi(r,n),c=oi(a,s,o),h=ri(l),d=ri(c);e.modifiersData[i]={referenceClippingOffsets:l,popperEscapeOffsets:c,isReferenceHidden:h,hasPopperEscaped:d},e.attributes.popper=Object.assign({},e.attributes.popper,{"data-popper-reference-hidden":h,"data-popper-escaped":d})}},li={name:"offset",enabled:!0,phase:"main",requires:["popperOffsets"],fn:function(t){var e=t.state,i=t.options,n=t.name,s=i.offset,o=void 0===s?[0,0]:s,r=ee.reduce((function(t,i){return t[i]=function(t,e,i){var n=be(t),s=[Vt,zt].indexOf(n)>=0?-1:1,o="function"==typeof i?i(Object.assign({},e,{placement:t})):i,r=o[0],a=o[1];return r=r||0,a=(a||0)*s,[Vt,qt].indexOf(n)>=0?{x:a,y:r}:{x:r,y:a}}(i,e.rects,o),t}),{}),a=r[e.placement],l=a.x,c=a.y;null!=e.modifiersData.popperOffsets&&(e.modifiersData.popperOffsets.x+=l,e.modifiersData.popperOffsets.y+=c),e.modifiersData[n]=r}},ci={name:"popperOffsets",enabled:!0,phase:"read",fn:function(t){var e=t.state,i=t.name;e.modifiersData[i]=ei({reference:e.rects.reference,element:e.rects.popper,strategy:"absolute",placement:e.placement})},data:{}},hi={name:"preventOverflow",enabled:!0,phase:"main",fn:function(t){var e=t.state,i=t.options,n=t.name,s=i.mainAxis,o=void 0===s||s,r=i.altAxis,a=void 0!==r&&r,l=i.boundary,c=i.rootBoundary,h=i.altBoundary,d=i.padding,u=i.tether,f=void 0===u||u,p=i.tetherOffset,m=void 0===p?0:p,g=ii(e,{boundary:l,rootBoundary:c,padding:d,altBoundary:h}),_=be(e.placement),b=Fe(e.placement),v=!b,y=Ie(_),w="x"===y?"y":"x",A=e.modifiersData.popperOffsets,E=e.rects.reference,T=e.rects.popper,C="function"==typeof m?m(Object.assign({},e.rects,{placement:e.placement})):m,O="number"==typeof C?{mainAxis:C,altAxis:C}:Object.assign({mainAxis:0,altAxis:0},C),x=e.modifiersData.offset?e.modifiersData.offset[e.placement]:null,k={x:0,y:0};if(A){if(o){var L,S="y"===y?zt:Vt,D="y"===y?Rt:qt,$="y"===y?"height":"width",I=A[y],N=I+g[S],P=I-g[D],M=f?-T[$]/2:0,j=b===Xt?E[$]:T[$],F=b===Xt?-T[$]:-E[$],H=e.elements.arrow,W=f&&H?Ce(H):{width:0,height:0},B=e.modifiersData["arrow#persistent"]?e.modifiersData["arrow#persistent"].padding:{top:0,right:0,bottom:0,left:0},z=B[S],R=B[D],q=Ne(0,E[$],W[$]),V=v?E[$]/2-M-q-z-O.mainAxis:j-q-z-O.mainAxis,K=v?-E[$]/2+M+q+R+O.mainAxis:F+q+R+O.mainAxis,Q=e.elements.arrow&&$e(e.elements.arrow),X=Q?"y"===y?Q.clientTop||0:Q.clientLeft||0:0,Y=null!=(L=null==x?void 0:x[y])?L:0,U=I+K-Y,G=Ne(f?ye(N,I+V-Y-X):N,I,f?ve(P,U):P);A[y]=G,k[y]=G-I}if(a){var J,Z="x"===y?zt:Vt,tt="x"===y?Rt:qt,et=A[w],it="y"===w?"height":"width",nt=et+g[Z],st=et-g[tt],ot=-1!==[zt,Vt].indexOf(_),rt=null!=(J=null==x?void 0:x[w])?J:0,at=ot?nt:et-E[it]-T[it]-rt+O.altAxis,lt=ot?et+E[it]+T[it]-rt-O.altAxis:st,ct=f&&ot?function(t,e,i){var n=Ne(t,e,i);return n>i?i:n}(at,et,lt):Ne(f?at:nt,et,f?lt:st);A[w]=ct,k[w]=ct-et}e.modifiersData[n]=k}},requiresIfExists:["offset"]};function di(t,e,i){void 0===i&&(i=!1);var n,s,o=me(e),r=me(e)&&function(t){var e=t.getBoundingClientRect(),i=we(e.width)/t.offsetWidth||1,n=we(e.height)/t.offsetHeight||1;return 1!==i||1!==n}(e),a=Le(e),l=Te(t,r,i),c={scrollLeft:0,scrollTop:0},h={x:0,y:0};return(o||!o&&!i)&&(("body"!==ue(e)||Ue(a))&&(c=(n=e)!==fe(n)&&me(n)?{scrollLeft:(s=n).scrollLeft,scrollTop:s.scrollTop}:Xe(n)),me(e)?((h=Te(e,!0)).x+=e.clientLeft,h.y+=e.clientTop):a&&(h.x=Ye(a))),{x:l.left+c.scrollLeft-h.x,y:l.top+c.scrollTop-h.y,width:l.width,height:l.height}}function ui(t){var e=new Map,i=new Set,n=[];function s(t){i.add(t.name),[].concat(t.requires||[],t.requiresIfExists||[]).forEach((function(t){if(!i.has(t)){var n=e.get(t);n&&s(n)}})),n.push(t)}return t.forEach((function(t){e.set(t.name,t)})),t.forEach((function(t){i.has(t.name)||s(t)})),n}var fi={placement:"bottom",modifiers:[],strategy:"absolute"};function pi(){for(var t=arguments.length,e=new Array(t),i=0;iNumber.parseInt(t,10))):"function"==typeof t?e=>t(e,this._element):t}_getPopperConfig(){const t={placement:this._getPlacement(),modifiers:[{name:"preventOverflow",options:{boundary:this._config.boundary}},{name:"offset",options:{offset:this._getOffset()}}]};return(this._inNavbar||"static"===this._config.display)&&(F.setDataAttribute(this._menu,"popper","static"),t.modifiers=[{name:"applyStyles",enabled:!1}]),{...t,...g(this._config.popperConfig,[t])}}_selectMenuItem({key:t,target:e}){const i=z.find(".dropdown-menu .dropdown-item:not(.disabled):not(:disabled)",this._menu).filter((t=>a(t)));i.length&&b(i,e,t===Ti,!i.includes(e)).focus()}static jQueryInterface(t){return this.each((function(){const e=qi.getOrCreateInstance(this,t);if("string"==typeof t){if(void 0===e[t])throw new TypeError(`No method named "${t}"`);e[t]()}}))}static clearMenus(t){if(2===t.button||"keyup"===t.type&&"Tab"!==t.key)return;const e=z.find(Ni);for(const i of e){const e=qi.getInstance(i);if(!e||!1===e._config.autoClose)continue;const n=t.composedPath(),s=n.includes(e._menu);if(n.includes(e._element)||"inside"===e._config.autoClose&&!s||"outside"===e._config.autoClose&&s)continue;if(e._menu.contains(t.target)&&("keyup"===t.type&&"Tab"===t.key||/input|select|option|textarea|form/i.test(t.target.tagName)))continue;const o={relatedTarget:e._element};"click"===t.type&&(o.clickEvent=t),e._completeHide(o)}}static dataApiKeydownHandler(t){const e=/input|textarea/i.test(t.target.tagName),i="Escape"===t.key,n=[Ei,Ti].includes(t.key);if(!n&&!i)return;if(e&&!i)return;t.preventDefault();const s=this.matches(Ii)?this:z.prev(this,Ii)[0]||z.next(this,Ii)[0]||z.findOne(Ii,t.delegateTarget.parentNode),o=qi.getOrCreateInstance(s);if(n)return t.stopPropagation(),o.show(),void o._selectMenuItem(t);o._isShown()&&(t.stopPropagation(),o.hide(),s.focus())}}N.on(document,Si,Ii,qi.dataApiKeydownHandler),N.on(document,Si,Pi,qi.dataApiKeydownHandler),N.on(document,Li,qi.clearMenus),N.on(document,Di,qi.clearMenus),N.on(document,Li,Ii,(function(t){t.preventDefault(),qi.getOrCreateInstance(this).toggle()})),m(qi);const Vi="backdrop",Ki="show",Qi=`mousedown.bs.${Vi}`,Xi={className:"modal-backdrop",clickCallback:null,isAnimated:!1,isVisible:!0,rootElement:"body"},Yi={className:"string",clickCallback:"(function|null)",isAnimated:"boolean",isVisible:"boolean",rootElement:"(element|string)"};class Ui extends H{constructor(t){super(),this._config=this._getConfig(t),this._isAppended=!1,this._element=null}static get Default(){return Xi}static get DefaultType(){return Yi}static get NAME(){return Vi}show(t){if(!this._config.isVisible)return void g(t);this._append();const e=this._getElement();this._config.isAnimated&&d(e),e.classList.add(Ki),this._emulateAnimation((()=>{g(t)}))}hide(t){this._config.isVisible?(this._getElement().classList.remove(Ki),this._emulateAnimation((()=>{this.dispose(),g(t)}))):g(t)}dispose(){this._isAppended&&(N.off(this._element,Qi),this._element.remove(),this._isAppended=!1)}_getElement(){if(!this._element){const t=document.createElement("div");t.className=this._config.className,this._config.isAnimated&&t.classList.add("fade"),this._element=t}return this._element}_configAfterMerge(t){return t.rootElement=r(t.rootElement),t}_append(){if(this._isAppended)return;const t=this._getElement();this._config.rootElement.append(t),N.on(t,Qi,(()=>{g(this._config.clickCallback)})),this._isAppended=!0}_emulateAnimation(t){_(t,this._getElement(),this._config.isAnimated)}}const Gi=".bs.focustrap",Ji=`focusin${Gi}`,Zi=`keydown.tab${Gi}`,tn="backward",en={autofocus:!0,trapElement:null},nn={autofocus:"boolean",trapElement:"element"};class sn extends H{constructor(t){super(),this._config=this._getConfig(t),this._isActive=!1,this._lastTabNavDirection=null}static get Default(){return en}static get DefaultType(){return nn}static get NAME(){return"focustrap"}activate(){this._isActive||(this._config.autofocus&&this._config.trapElement.focus(),N.off(document,Gi),N.on(document,Ji,(t=>this._handleFocusin(t))),N.on(document,Zi,(t=>this._handleKeydown(t))),this._isActive=!0)}deactivate(){this._isActive&&(this._isActive=!1,N.off(document,Gi))}_handleFocusin(t){const{trapElement:e}=this._config;if(t.target===document||t.target===e||e.contains(t.target))return;const i=z.focusableChildren(e);0===i.length?e.focus():this._lastTabNavDirection===tn?i[i.length-1].focus():i[0].focus()}_handleKeydown(t){"Tab"===t.key&&(this._lastTabNavDirection=t.shiftKey?tn:"forward")}}const on=".fixed-top, .fixed-bottom, .is-fixed, .sticky-top",rn=".sticky-top",an="padding-right",ln="margin-right";class cn{constructor(){this._element=document.body}getWidth(){const t=document.documentElement.clientWidth;return Math.abs(window.innerWidth-t)}hide(){const t=this.getWidth();this._disableOverFlow(),this._setElementAttributes(this._element,an,(e=>e+t)),this._setElementAttributes(on,an,(e=>e+t)),this._setElementAttributes(rn,ln,(e=>e-t))}reset(){this._resetElementAttributes(this._element,"overflow"),this._resetElementAttributes(this._element,an),this._resetElementAttributes(on,an),this._resetElementAttributes(rn,ln)}isOverflowing(){return this.getWidth()>0}_disableOverFlow(){this._saveInitialAttribute(this._element,"overflow"),this._element.style.overflow="hidden"}_setElementAttributes(t,e,i){const n=this.getWidth();this._applyManipulationCallback(t,(t=>{if(t!==this._element&&window.innerWidth>t.clientWidth+n)return;this._saveInitialAttribute(t,e);const s=window.getComputedStyle(t).getPropertyValue(e);t.style.setProperty(e,`${i(Number.parseFloat(s))}px`)}))}_saveInitialAttribute(t,e){const i=t.style.getPropertyValue(e);i&&F.setDataAttribute(t,e,i)}_resetElementAttributes(t,e){this._applyManipulationCallback(t,(t=>{const i=F.getDataAttribute(t,e);null!==i?(F.removeDataAttribute(t,e),t.style.setProperty(e,i)):t.style.removeProperty(e)}))}_applyManipulationCallback(t,e){if(o(t))e(t);else for(const i of z.find(t,this._element))e(i)}}const hn=".bs.modal",dn=`hide${hn}`,un=`hidePrevented${hn}`,fn=`hidden${hn}`,pn=`show${hn}`,mn=`shown${hn}`,gn=`resize${hn}`,_n=`click.dismiss${hn}`,bn=`mousedown.dismiss${hn}`,vn=`keydown.dismiss${hn}`,yn=`click${hn}.data-api`,wn="modal-open",An="show",En="modal-static",Tn={backdrop:!0,focus:!0,keyboard:!0},Cn={backdrop:"(boolean|string)",focus:"boolean",keyboard:"boolean"};class On extends W{constructor(t,e){super(t,e),this._dialog=z.findOne(".modal-dialog",this._element),this._backdrop=this._initializeBackDrop(),this._focustrap=this._initializeFocusTrap(),this._isShown=!1,this._isTransitioning=!1,this._scrollBar=new cn,this._addEventListeners()}static get Default(){return Tn}static get DefaultType(){return Cn}static get NAME(){return"modal"}toggle(t){return this._isShown?this.hide():this.show(t)}show(t){this._isShown||this._isTransitioning||N.trigger(this._element,pn,{relatedTarget:t}).defaultPrevented||(this._isShown=!0,this._isTransitioning=!0,this._scrollBar.hide(),document.body.classList.add(wn),this._adjustDialog(),this._backdrop.show((()=>this._showElement(t))))}hide(){this._isShown&&!this._isTransitioning&&(N.trigger(this._element,dn).defaultPrevented||(this._isShown=!1,this._isTransitioning=!0,this._focustrap.deactivate(),this._element.classList.remove(An),this._queueCallback((()=>this._hideModal()),this._element,this._isAnimated())))}dispose(){N.off(window,hn),N.off(this._dialog,hn),this._backdrop.dispose(),this._focustrap.deactivate(),super.dispose()}handleUpdate(){this._adjustDialog()}_initializeBackDrop(){return new Ui({isVisible:Boolean(this._config.backdrop),isAnimated:this._isAnimated()})}_initializeFocusTrap(){return new sn({trapElement:this._element})}_showElement(t){document.body.contains(this._element)||document.body.append(this._element),this._element.style.display="block",this._element.removeAttribute("aria-hidden"),this._element.setAttribute("aria-modal",!0),this._element.setAttribute("role","dialog"),this._element.scrollTop=0;const e=z.findOne(".modal-body",this._dialog);e&&(e.scrollTop=0),d(this._element),this._element.classList.add(An),this._queueCallback((()=>{this._config.focus&&this._focustrap.activate(),this._isTransitioning=!1,N.trigger(this._element,mn,{relatedTarget:t})}),this._dialog,this._isAnimated())}_addEventListeners(){N.on(this._element,vn,(t=>{"Escape"===t.key&&(this._config.keyboard?this.hide():this._triggerBackdropTransition())})),N.on(window,gn,(()=>{this._isShown&&!this._isTransitioning&&this._adjustDialog()})),N.on(this._element,bn,(t=>{N.one(this._element,_n,(e=>{this._element===t.target&&this._element===e.target&&("static"!==this._config.backdrop?this._config.backdrop&&this.hide():this._triggerBackdropTransition())}))}))}_hideModal(){this._element.style.display="none",this._element.setAttribute("aria-hidden",!0),this._element.removeAttribute("aria-modal"),this._element.removeAttribute("role"),this._isTransitioning=!1,this._backdrop.hide((()=>{document.body.classList.remove(wn),this._resetAdjustments(),this._scrollBar.reset(),N.trigger(this._element,fn)}))}_isAnimated(){return this._element.classList.contains("fade")}_triggerBackdropTransition(){if(N.trigger(this._element,un).defaultPrevented)return;const t=this._element.scrollHeight>document.documentElement.clientHeight,e=this._element.style.overflowY;"hidden"===e||this._element.classList.contains(En)||(t||(this._element.style.overflowY="hidden"),this._element.classList.add(En),this._queueCallback((()=>{this._element.classList.remove(En),this._queueCallback((()=>{this._element.style.overflowY=e}),this._dialog)}),this._dialog),this._element.focus())}_adjustDialog(){const t=this._element.scrollHeight>document.documentElement.clientHeight,e=this._scrollBar.getWidth(),i=e>0;if(i&&!t){const t=p()?"paddingLeft":"paddingRight";this._element.style[t]=`${e}px`}if(!i&&t){const t=p()?"paddingRight":"paddingLeft";this._element.style[t]=`${e}px`}}_resetAdjustments(){this._element.style.paddingLeft="",this._element.style.paddingRight=""}static jQueryInterface(t,e){return this.each((function(){const i=On.getOrCreateInstance(this,t);if("string"==typeof t){if(void 0===i[t])throw new TypeError(`No method named "${t}"`);i[t](e)}}))}}N.on(document,yn,'[data-bs-toggle="modal"]',(function(t){const e=z.getElementFromSelector(this);["A","AREA"].includes(this.tagName)&&t.preventDefault(),N.one(e,pn,(t=>{t.defaultPrevented||N.one(e,fn,(()=>{a(this)&&this.focus()}))}));const i=z.findOne(".modal.show");i&&On.getInstance(i).hide(),On.getOrCreateInstance(e).toggle(this)})),R(On),m(On);const xn=".bs.offcanvas",kn=".data-api",Ln=`load${xn}${kn}`,Sn="show",Dn="showing",$n="hiding",In=".offcanvas.show",Nn=`show${xn}`,Pn=`shown${xn}`,Mn=`hide${xn}`,jn=`hidePrevented${xn}`,Fn=`hidden${xn}`,Hn=`resize${xn}`,Wn=`click${xn}${kn}`,Bn=`keydown.dismiss${xn}`,zn={backdrop:!0,keyboard:!0,scroll:!1},Rn={backdrop:"(boolean|string)",keyboard:"boolean",scroll:"boolean"};class qn extends W{constructor(t,e){super(t,e),this._isShown=!1,this._backdrop=this._initializeBackDrop(),this._focustrap=this._initializeFocusTrap(),this._addEventListeners()}static get Default(){return zn}static get DefaultType(){return Rn}static get NAME(){return"offcanvas"}toggle(t){return this._isShown?this.hide():this.show(t)}show(t){this._isShown||N.trigger(this._element,Nn,{relatedTarget:t}).defaultPrevented||(this._isShown=!0,this._backdrop.show(),this._config.scroll||(new cn).hide(),this._element.setAttribute("aria-modal",!0),this._element.setAttribute("role","dialog"),this._element.classList.add(Dn),this._queueCallback((()=>{this._config.scroll&&!this._config.backdrop||this._focustrap.activate(),this._element.classList.add(Sn),this._element.classList.remove(Dn),N.trigger(this._element,Pn,{relatedTarget:t})}),this._element,!0))}hide(){this._isShown&&(N.trigger(this._element,Mn).defaultPrevented||(this._focustrap.deactivate(),this._element.blur(),this._isShown=!1,this._element.classList.add($n),this._backdrop.hide(),this._queueCallback((()=>{this._element.classList.remove(Sn,$n),this._element.removeAttribute("aria-modal"),this._element.removeAttribute("role"),this._config.scroll||(new cn).reset(),N.trigger(this._element,Fn)}),this._element,!0)))}dispose(){this._backdrop.dispose(),this._focustrap.deactivate(),super.dispose()}_initializeBackDrop(){const t=Boolean(this._config.backdrop);return new Ui({className:"offcanvas-backdrop",isVisible:t,isAnimated:!0,rootElement:this._element.parentNode,clickCallback:t?()=>{"static"!==this._config.backdrop?this.hide():N.trigger(this._element,jn)}:null})}_initializeFocusTrap(){return new sn({trapElement:this._element})}_addEventListeners(){N.on(this._element,Bn,(t=>{"Escape"===t.key&&(this._config.keyboard?this.hide():N.trigger(this._element,jn))}))}static jQueryInterface(t){return this.each((function(){const e=qn.getOrCreateInstance(this,t);if("string"==typeof t){if(void 0===e[t]||t.startsWith("_")||"constructor"===t)throw new TypeError(`No method named "${t}"`);e[t](this)}}))}}N.on(document,Wn,'[data-bs-toggle="offcanvas"]',(function(t){const e=z.getElementFromSelector(this);if(["A","AREA"].includes(this.tagName)&&t.preventDefault(),l(this))return;N.one(e,Fn,(()=>{a(this)&&this.focus()}));const i=z.findOne(In);i&&i!==e&&qn.getInstance(i).hide(),qn.getOrCreateInstance(e).toggle(this)})),N.on(window,Ln,(()=>{for(const t of z.find(In))qn.getOrCreateInstance(t).show()})),N.on(window,Hn,(()=>{for(const t of z.find("[aria-modal][class*=show][class*=offcanvas-]"))"fixed"!==getComputedStyle(t).position&&qn.getOrCreateInstance(t).hide()})),R(qn),m(qn);const Vn={"*":["class","dir","id","lang","role",/^aria-[\w-]*$/i],a:["target","href","title","rel"],area:[],b:[],br:[],col:[],code:[],div:[],em:[],hr:[],h1:[],h2:[],h3:[],h4:[],h5:[],h6:[],i:[],img:["src","srcset","alt","title","width","height"],li:[],ol:[],p:[],pre:[],s:[],small:[],span:[],sub:[],sup:[],strong:[],u:[],ul:[]},Kn=new Set(["background","cite","href","itemtype","longdesc","poster","src","xlink:href"]),Qn=/^(?!javascript:)(?:[a-z0-9+.-]+:|[^&:/?#]*(?:[/?#]|$))/i,Xn=(t,e)=>{const i=t.nodeName.toLowerCase();return e.includes(i)?!Kn.has(i)||Boolean(Qn.test(t.nodeValue)):e.filter((t=>t instanceof RegExp)).some((t=>t.test(i)))},Yn={allowList:Vn,content:{},extraClass:"",html:!1,sanitize:!0,sanitizeFn:null,template:"
      "},Un={allowList:"object",content:"object",extraClass:"(string|function)",html:"boolean",sanitize:"boolean",sanitizeFn:"(null|function)",template:"string"},Gn={entry:"(string|element|function|null)",selector:"(string|element)"};class Jn extends H{constructor(t){super(),this._config=this._getConfig(t)}static get Default(){return Yn}static get DefaultType(){return Un}static get NAME(){return"TemplateFactory"}getContent(){return Object.values(this._config.content).map((t=>this._resolvePossibleFunction(t))).filter(Boolean)}hasContent(){return this.getContent().length>0}changeContent(t){return this._checkContent(t),this._config.content={...this._config.content,...t},this}toHtml(){const t=document.createElement("div");t.innerHTML=this._maybeSanitize(this._config.template);for(const[e,i]of Object.entries(this._config.content))this._setContent(t,i,e);const e=t.children[0],i=this._resolvePossibleFunction(this._config.extraClass);return i&&e.classList.add(...i.split(" ")),e}_typeCheckConfig(t){super._typeCheckConfig(t),this._checkContent(t.content)}_checkContent(t){for(const[e,i]of Object.entries(t))super._typeCheckConfig({selector:e,entry:i},Gn)}_setContent(t,e,i){const n=z.findOne(i,t);n&&((e=this._resolvePossibleFunction(e))?o(e)?this._putElementInTemplate(r(e),n):this._config.html?n.innerHTML=this._maybeSanitize(e):n.textContent=e:n.remove())}_maybeSanitize(t){return this._config.sanitize?function(t,e,i){if(!t.length)return t;if(i&&"function"==typeof i)return i(t);const n=(new window.DOMParser).parseFromString(t,"text/html"),s=[].concat(...n.body.querySelectorAll("*"));for(const t of s){const i=t.nodeName.toLowerCase();if(!Object.keys(e).includes(i)){t.remove();continue}const n=[].concat(...t.attributes),s=[].concat(e["*"]||[],e[i]||[]);for(const e of n)Xn(e,s)||t.removeAttribute(e.nodeName)}return n.body.innerHTML}(t,this._config.allowList,this._config.sanitizeFn):t}_resolvePossibleFunction(t){return g(t,[this])}_putElementInTemplate(t,e){if(this._config.html)return e.innerHTML="",void e.append(t);e.textContent=t.textContent}}const Zn=new Set(["sanitize","allowList","sanitizeFn"]),ts="fade",es="show",is=".modal",ns="hide.bs.modal",ss="hover",os="focus",rs={AUTO:"auto",TOP:"top",RIGHT:p()?"left":"right",BOTTOM:"bottom",LEFT:p()?"right":"left"},as={allowList:Vn,animation:!0,boundary:"clippingParents",container:!1,customClass:"",delay:0,fallbackPlacements:["top","right","bottom","left"],html:!1,offset:[0,6],placement:"top",popperConfig:null,sanitize:!0,sanitizeFn:null,selector:!1,template:'',title:"",trigger:"hover focus"},ls={allowList:"object",animation:"boolean",boundary:"(string|element)",container:"(string|element|boolean)",customClass:"(string|function)",delay:"(number|object)",fallbackPlacements:"array",html:"boolean",offset:"(array|string|function)",placement:"(string|function)",popperConfig:"(null|object|function)",sanitize:"boolean",sanitizeFn:"(null|function)",selector:"(string|boolean)",template:"string",title:"(string|element|function)",trigger:"string"};class cs extends W{constructor(t,e){if(void 0===vi)throw new TypeError("Bootstrap's tooltips require Popper (https://popper.js.org)");super(t,e),this._isEnabled=!0,this._timeout=0,this._isHovered=null,this._activeTrigger={},this._popper=null,this._templateFactory=null,this._newContent=null,this.tip=null,this._setListeners(),this._config.selector||this._fixTitle()}static get Default(){return as}static get DefaultType(){return ls}static get NAME(){return"tooltip"}enable(){this._isEnabled=!0}disable(){this._isEnabled=!1}toggleEnabled(){this._isEnabled=!this._isEnabled}toggle(){this._isEnabled&&(this._activeTrigger.click=!this._activeTrigger.click,this._isShown()?this._leave():this._enter())}dispose(){clearTimeout(this._timeout),N.off(this._element.closest(is),ns,this._hideModalHandler),this._element.getAttribute("data-bs-original-title")&&this._element.setAttribute("title",this._element.getAttribute("data-bs-original-title")),this._disposePopper(),super.dispose()}show(){if("none"===this._element.style.display)throw new Error("Please use show on visible elements");if(!this._isWithContent()||!this._isEnabled)return;const t=N.trigger(this._element,this.constructor.eventName("show")),e=(c(this._element)||this._element.ownerDocument.documentElement).contains(this._element);if(t.defaultPrevented||!e)return;this._disposePopper();const i=this._getTipElement();this._element.setAttribute("aria-describedby",i.getAttribute("id"));const{container:n}=this._config;if(this._element.ownerDocument.documentElement.contains(this.tip)||(n.append(i),N.trigger(this._element,this.constructor.eventName("inserted"))),this._popper=this._createPopper(i),i.classList.add(es),"ontouchstart"in document.documentElement)for(const t of[].concat(...document.body.children))N.on(t,"mouseover",h);this._queueCallback((()=>{N.trigger(this._element,this.constructor.eventName("shown")),!1===this._isHovered&&this._leave(),this._isHovered=!1}),this.tip,this._isAnimated())}hide(){if(this._isShown()&&!N.trigger(this._element,this.constructor.eventName("hide")).defaultPrevented){if(this._getTipElement().classList.remove(es),"ontouchstart"in document.documentElement)for(const t of[].concat(...document.body.children))N.off(t,"mouseover",h);this._activeTrigger.click=!1,this._activeTrigger[os]=!1,this._activeTrigger[ss]=!1,this._isHovered=null,this._queueCallback((()=>{this._isWithActiveTrigger()||(this._isHovered||this._disposePopper(),this._element.removeAttribute("aria-describedby"),N.trigger(this._element,this.constructor.eventName("hidden")))}),this.tip,this._isAnimated())}}update(){this._popper&&this._popper.update()}_isWithContent(){return Boolean(this._getTitle())}_getTipElement(){return this.tip||(this.tip=this._createTipElement(this._newContent||this._getContentForTemplate())),this.tip}_createTipElement(t){const e=this._getTemplateFactory(t).toHtml();if(!e)return null;e.classList.remove(ts,es),e.classList.add(`bs-${this.constructor.NAME}-auto`);const i=(t=>{do{t+=Math.floor(1e6*Math.random())}while(document.getElementById(t));return t})(this.constructor.NAME).toString();return e.setAttribute("id",i),this._isAnimated()&&e.classList.add(ts),e}setContent(t){this._newContent=t,this._isShown()&&(this._disposePopper(),this.show())}_getTemplateFactory(t){return this._templateFactory?this._templateFactory.changeContent(t):this._templateFactory=new Jn({...this._config,content:t,extraClass:this._resolvePossibleFunction(this._config.customClass)}),this._templateFactory}_getContentForTemplate(){return{".tooltip-inner":this._getTitle()}}_getTitle(){return this._resolvePossibleFunction(this._config.title)||this._element.getAttribute("data-bs-original-title")}_initializeOnDelegatedTarget(t){return this.constructor.getOrCreateInstance(t.delegateTarget,this._getDelegateConfig())}_isAnimated(){return this._config.animation||this.tip&&this.tip.classList.contains(ts)}_isShown(){return this.tip&&this.tip.classList.contains(es)}_createPopper(t){const e=g(this._config.placement,[this,t,this._element]),i=rs[e.toUpperCase()];return bi(this._element,t,this._getPopperConfig(i))}_getOffset(){const{offset:t}=this._config;return"string"==typeof t?t.split(",").map((t=>Number.parseInt(t,10))):"function"==typeof t?e=>t(e,this._element):t}_resolvePossibleFunction(t){return g(t,[this._element])}_getPopperConfig(t){const e={placement:t,modifiers:[{name:"flip",options:{fallbackPlacements:this._config.fallbackPlacements}},{name:"offset",options:{offset:this._getOffset()}},{name:"preventOverflow",options:{boundary:this._config.boundary}},{name:"arrow",options:{element:`.${this.constructor.NAME}-arrow`}},{name:"preSetPlacement",enabled:!0,phase:"beforeMain",fn:t=>{this._getTipElement().setAttribute("data-popper-placement",t.state.placement)}}]};return{...e,...g(this._config.popperConfig,[e])}}_setListeners(){const t=this._config.trigger.split(" ");for(const e of t)if("click"===e)N.on(this._element,this.constructor.eventName("click"),this._config.selector,(t=>{this._initializeOnDelegatedTarget(t).toggle()}));else if("manual"!==e){const t=e===ss?this.constructor.eventName("mouseenter"):this.constructor.eventName("focusin"),i=e===ss?this.constructor.eventName("mouseleave"):this.constructor.eventName("focusout");N.on(this._element,t,this._config.selector,(t=>{const e=this._initializeOnDelegatedTarget(t);e._activeTrigger["focusin"===t.type?os:ss]=!0,e._enter()})),N.on(this._element,i,this._config.selector,(t=>{const e=this._initializeOnDelegatedTarget(t);e._activeTrigger["focusout"===t.type?os:ss]=e._element.contains(t.relatedTarget),e._leave()}))}this._hideModalHandler=()=>{this._element&&this.hide()},N.on(this._element.closest(is),ns,this._hideModalHandler)}_fixTitle(){const t=this._element.getAttribute("title");t&&(this._element.getAttribute("aria-label")||this._element.textContent.trim()||this._element.setAttribute("aria-label",t),this._element.setAttribute("data-bs-original-title",t),this._element.removeAttribute("title"))}_enter(){this._isShown()||this._isHovered?this._isHovered=!0:(this._isHovered=!0,this._setTimeout((()=>{this._isHovered&&this.show()}),this._config.delay.show))}_leave(){this._isWithActiveTrigger()||(this._isHovered=!1,this._setTimeout((()=>{this._isHovered||this.hide()}),this._config.delay.hide))}_setTimeout(t,e){clearTimeout(this._timeout),this._timeout=setTimeout(t,e)}_isWithActiveTrigger(){return Object.values(this._activeTrigger).includes(!0)}_getConfig(t){const e=F.getDataAttributes(this._element);for(const t of Object.keys(e))Zn.has(t)&&delete e[t];return t={...e,..."object"==typeof t&&t?t:{}},t=this._mergeConfigObj(t),t=this._configAfterMerge(t),this._typeCheckConfig(t),t}_configAfterMerge(t){return t.container=!1===t.container?document.body:r(t.container),"number"==typeof t.delay&&(t.delay={show:t.delay,hide:t.delay}),"number"==typeof t.title&&(t.title=t.title.toString()),"number"==typeof t.content&&(t.content=t.content.toString()),t}_getDelegateConfig(){const t={};for(const[e,i]of Object.entries(this._config))this.constructor.Default[e]!==i&&(t[e]=i);return t.selector=!1,t.trigger="manual",t}_disposePopper(){this._popper&&(this._popper.destroy(),this._popper=null),this.tip&&(this.tip.remove(),this.tip=null)}static jQueryInterface(t){return this.each((function(){const e=cs.getOrCreateInstance(this,t);if("string"==typeof t){if(void 0===e[t])throw new TypeError(`No method named "${t}"`);e[t]()}}))}}m(cs);const hs={...cs.Default,content:"",offset:[0,8],placement:"right",template:'',trigger:"click"},ds={...cs.DefaultType,content:"(null|string|element|function)"};class us extends cs{static get Default(){return hs}static get DefaultType(){return ds}static get NAME(){return"popover"}_isWithContent(){return this._getTitle()||this._getContent()}_getContentForTemplate(){return{".popover-header":this._getTitle(),".popover-body":this._getContent()}}_getContent(){return this._resolvePossibleFunction(this._config.content)}static jQueryInterface(t){return this.each((function(){const e=us.getOrCreateInstance(this,t);if("string"==typeof t){if(void 0===e[t])throw new TypeError(`No method named "${t}"`);e[t]()}}))}}m(us);const fs=".bs.scrollspy",ps=`activate${fs}`,ms=`click${fs}`,gs=`load${fs}.data-api`,_s="active",bs="[href]",vs=".nav-link",ys=`${vs}, .nav-item > ${vs}, .list-group-item`,ws={offset:null,rootMargin:"0px 0px -25%",smoothScroll:!1,target:null,threshold:[.1,.5,1]},As={offset:"(number|null)",rootMargin:"string",smoothScroll:"boolean",target:"element",threshold:"array"};class Es extends W{constructor(t,e){super(t,e),this._targetLinks=new Map,this._observableSections=new Map,this._rootElement="visible"===getComputedStyle(this._element).overflowY?null:this._element,this._activeTarget=null,this._observer=null,this._previousScrollData={visibleEntryTop:0,parentScrollTop:0},this.refresh()}static get Default(){return ws}static get DefaultType(){return As}static get NAME(){return"scrollspy"}refresh(){this._initializeTargetsAndObservables(),this._maybeEnableSmoothScroll(),this._observer?this._observer.disconnect():this._observer=this._getNewObserver();for(const t of this._observableSections.values())this._observer.observe(t)}dispose(){this._observer.disconnect(),super.dispose()}_configAfterMerge(t){return t.target=r(t.target)||document.body,t.rootMargin=t.offset?`${t.offset}px 0px -30%`:t.rootMargin,"string"==typeof t.threshold&&(t.threshold=t.threshold.split(",").map((t=>Number.parseFloat(t)))),t}_maybeEnableSmoothScroll(){this._config.smoothScroll&&(N.off(this._config.target,ms),N.on(this._config.target,ms,bs,(t=>{const e=this._observableSections.get(t.target.hash);if(e){t.preventDefault();const i=this._rootElement||window,n=e.offsetTop-this._element.offsetTop;if(i.scrollTo)return void i.scrollTo({top:n,behavior:"smooth"});i.scrollTop=n}})))}_getNewObserver(){const t={root:this._rootElement,threshold:this._config.threshold,rootMargin:this._config.rootMargin};return new IntersectionObserver((t=>this._observerCallback(t)),t)}_observerCallback(t){const e=t=>this._targetLinks.get(`#${t.target.id}`),i=t=>{this._previousScrollData.visibleEntryTop=t.target.offsetTop,this._process(e(t))},n=(this._rootElement||document.documentElement).scrollTop,s=n>=this._previousScrollData.parentScrollTop;this._previousScrollData.parentScrollTop=n;for(const o of t){if(!o.isIntersecting){this._activeTarget=null,this._clearActiveClass(e(o));continue}const t=o.target.offsetTop>=this._previousScrollData.visibleEntryTop;if(s&&t){if(i(o),!n)return}else s||t||i(o)}}_initializeTargetsAndObservables(){this._targetLinks=new Map,this._observableSections=new Map;const t=z.find(bs,this._config.target);for(const e of t){if(!e.hash||l(e))continue;const t=z.findOne(decodeURI(e.hash),this._element);a(t)&&(this._targetLinks.set(decodeURI(e.hash),e),this._observableSections.set(e.hash,t))}}_process(t){this._activeTarget!==t&&(this._clearActiveClass(this._config.target),this._activeTarget=t,t.classList.add(_s),this._activateParents(t),N.trigger(this._element,ps,{relatedTarget:t}))}_activateParents(t){if(t.classList.contains("dropdown-item"))z.findOne(".dropdown-toggle",t.closest(".dropdown")).classList.add(_s);else for(const e of z.parents(t,".nav, .list-group"))for(const t of z.prev(e,ys))t.classList.add(_s)}_clearActiveClass(t){t.classList.remove(_s);const e=z.find(`${bs}.${_s}`,t);for(const t of e)t.classList.remove(_s)}static jQueryInterface(t){return this.each((function(){const e=Es.getOrCreateInstance(this,t);if("string"==typeof t){if(void 0===e[t]||t.startsWith("_")||"constructor"===t)throw new TypeError(`No method named "${t}"`);e[t]()}}))}}N.on(window,gs,(()=>{for(const t of z.find('[data-bs-spy="scroll"]'))Es.getOrCreateInstance(t)})),m(Es);const Ts=".bs.tab",Cs=`hide${Ts}`,Os=`hidden${Ts}`,xs=`show${Ts}`,ks=`shown${Ts}`,Ls=`click${Ts}`,Ss=`keydown${Ts}`,Ds=`load${Ts}`,$s="ArrowLeft",Is="ArrowRight",Ns="ArrowUp",Ps="ArrowDown",Ms="Home",js="End",Fs="active",Hs="fade",Ws="show",Bs=":not(.dropdown-toggle)",zs='[data-bs-toggle="tab"], [data-bs-toggle="pill"], [data-bs-toggle="list"]',Rs=`.nav-link${Bs}, .list-group-item${Bs}, [role="tab"]${Bs}, ${zs}`,qs=`.${Fs}[data-bs-toggle="tab"], .${Fs}[data-bs-toggle="pill"], .${Fs}[data-bs-toggle="list"]`;class Vs extends W{constructor(t){super(t),this._parent=this._element.closest('.list-group, .nav, [role="tablist"]'),this._parent&&(this._setInitialAttributes(this._parent,this._getChildren()),N.on(this._element,Ss,(t=>this._keydown(t))))}static get NAME(){return"tab"}show(){const t=this._element;if(this._elemIsActive(t))return;const e=this._getActiveElem(),i=e?N.trigger(e,Cs,{relatedTarget:t}):null;N.trigger(t,xs,{relatedTarget:e}).defaultPrevented||i&&i.defaultPrevented||(this._deactivate(e,t),this._activate(t,e))}_activate(t,e){t&&(t.classList.add(Fs),this._activate(z.getElementFromSelector(t)),this._queueCallback((()=>{"tab"===t.getAttribute("role")?(t.removeAttribute("tabindex"),t.setAttribute("aria-selected",!0),this._toggleDropDown(t,!0),N.trigger(t,ks,{relatedTarget:e})):t.classList.add(Ws)}),t,t.classList.contains(Hs)))}_deactivate(t,e){t&&(t.classList.remove(Fs),t.blur(),this._deactivate(z.getElementFromSelector(t)),this._queueCallback((()=>{"tab"===t.getAttribute("role")?(t.setAttribute("aria-selected",!1),t.setAttribute("tabindex","-1"),this._toggleDropDown(t,!1),N.trigger(t,Os,{relatedTarget:e})):t.classList.remove(Ws)}),t,t.classList.contains(Hs)))}_keydown(t){if(![$s,Is,Ns,Ps,Ms,js].includes(t.key))return;t.stopPropagation(),t.preventDefault();const e=this._getChildren().filter((t=>!l(t)));let i;if([Ms,js].includes(t.key))i=e[t.key===Ms?0:e.length-1];else{const n=[Is,Ps].includes(t.key);i=b(e,t.target,n,!0)}i&&(i.focus({preventScroll:!0}),Vs.getOrCreateInstance(i).show())}_getChildren(){return z.find(Rs,this._parent)}_getActiveElem(){return this._getChildren().find((t=>this._elemIsActive(t)))||null}_setInitialAttributes(t,e){this._setAttributeIfNotExists(t,"role","tablist");for(const t of e)this._setInitialAttributesOnChild(t)}_setInitialAttributesOnChild(t){t=this._getInnerElement(t);const e=this._elemIsActive(t),i=this._getOuterElement(t);t.setAttribute("aria-selected",e),i!==t&&this._setAttributeIfNotExists(i,"role","presentation"),e||t.setAttribute("tabindex","-1"),this._setAttributeIfNotExists(t,"role","tab"),this._setInitialAttributesOnTargetPanel(t)}_setInitialAttributesOnTargetPanel(t){const e=z.getElementFromSelector(t);e&&(this._setAttributeIfNotExists(e,"role","tabpanel"),t.id&&this._setAttributeIfNotExists(e,"aria-labelledby",`${t.id}`))}_toggleDropDown(t,e){const i=this._getOuterElement(t);if(!i.classList.contains("dropdown"))return;const n=(t,n)=>{const s=z.findOne(t,i);s&&s.classList.toggle(n,e)};n(".dropdown-toggle",Fs),n(".dropdown-menu",Ws),i.setAttribute("aria-expanded",e)}_setAttributeIfNotExists(t,e,i){t.hasAttribute(e)||t.setAttribute(e,i)}_elemIsActive(t){return t.classList.contains(Fs)}_getInnerElement(t){return t.matches(Rs)?t:z.findOne(Rs,t)}_getOuterElement(t){return t.closest(".nav-item, .list-group-item")||t}static jQueryInterface(t){return this.each((function(){const e=Vs.getOrCreateInstance(this);if("string"==typeof t){if(void 0===e[t]||t.startsWith("_")||"constructor"===t)throw new TypeError(`No method named "${t}"`);e[t]()}}))}}N.on(document,Ls,zs,(function(t){["A","AREA"].includes(this.tagName)&&t.preventDefault(),l(this)||Vs.getOrCreateInstance(this).show()})),N.on(window,Ds,(()=>{for(const t of z.find(qs))Vs.getOrCreateInstance(t)})),m(Vs);const Ks=".bs.toast",Qs=`mouseover${Ks}`,Xs=`mouseout${Ks}`,Ys=`focusin${Ks}`,Us=`focusout${Ks}`,Gs=`hide${Ks}`,Js=`hidden${Ks}`,Zs=`show${Ks}`,to=`shown${Ks}`,eo="hide",io="show",no="showing",so={animation:"boolean",autohide:"boolean",delay:"number"},oo={animation:!0,autohide:!0,delay:5e3};class ro extends W{constructor(t,e){super(t,e),this._timeout=null,this._hasMouseInteraction=!1,this._hasKeyboardInteraction=!1,this._setListeners()}static get Default(){return oo}static get DefaultType(){return so}static get NAME(){return"toast"}show(){N.trigger(this._element,Zs).defaultPrevented||(this._clearTimeout(),this._config.animation&&this._element.classList.add("fade"),this._element.classList.remove(eo),d(this._element),this._element.classList.add(io,no),this._queueCallback((()=>{this._element.classList.remove(no),N.trigger(this._element,to),this._maybeScheduleHide()}),this._element,this._config.animation))}hide(){this.isShown()&&(N.trigger(this._element,Gs).defaultPrevented||(this._element.classList.add(no),this._queueCallback((()=>{this._element.classList.add(eo),this._element.classList.remove(no,io),N.trigger(this._element,Js)}),this._element,this._config.animation)))}dispose(){this._clearTimeout(),this.isShown()&&this._element.classList.remove(io),super.dispose()}isShown(){return this._element.classList.contains(io)}_maybeScheduleHide(){this._config.autohide&&(this._hasMouseInteraction||this._hasKeyboardInteraction||(this._timeout=setTimeout((()=>{this.hide()}),this._config.delay)))}_onInteraction(t,e){switch(t.type){case"mouseover":case"mouseout":this._hasMouseInteraction=e;break;case"focusin":case"focusout":this._hasKeyboardInteraction=e}if(e)return void this._clearTimeout();const i=t.relatedTarget;this._element===i||this._element.contains(i)||this._maybeScheduleHide()}_setListeners(){N.on(this._element,Qs,(t=>this._onInteraction(t,!0))),N.on(this._element,Xs,(t=>this._onInteraction(t,!1))),N.on(this._element,Ys,(t=>this._onInteraction(t,!0))),N.on(this._element,Us,(t=>this._onInteraction(t,!1)))}_clearTimeout(){clearTimeout(this._timeout),this._timeout=null}static jQueryInterface(t){return this.each((function(){const e=ro.getOrCreateInstance(this,t);if("string"==typeof t){if(void 0===e[t])throw new TypeError(`No method named "${t}"`);e[t](this)}}))}}return R(ro),m(ro),{Alert:Q,Button:Y,Carousel:xt,Collapse:Bt,Dropdown:qi,Modal:On,Offcanvas:qn,Popover:us,ScrollSpy:Es,Tab:Vs,Toast:ro,Tooltip:cs}}));
+//# sourceMappingURL=bootstrap.bundle.min.js.map
\ No newline at end of file
diff --git a/dev/deps/bootstrap-5.3.1/bootstrap.bundle.min.js.map b/dev/deps/bootstrap-5.3.1/bootstrap.bundle.min.js.map
new file mode 100644
index 000000000..3863da8b7
--- /dev/null
+++ b/dev/deps/bootstrap-5.3.1/bootstrap.bundle.min.js.map
@@ -0,0 +1 @@
+{"version":3,"names":["elementMap","Map","Data","set","element","key","instance","has","instanceMap","get","size","console","error","Array","from","keys","remove","delete","TRANSITION_END","parseSelector","selector","window","CSS","escape","replace","match","id","triggerTransitionEnd","dispatchEvent","Event","isElement","object","jquery","nodeType","getElement","length","document","querySelector","isVisible","getClientRects","elementIsVisible","getComputedStyle","getPropertyValue","closedDetails","closest","summary","parentNode","isDisabled","Node","ELEMENT_NODE","classList","contains","disabled","hasAttribute","getAttribute","findShadowRoot","documentElement","attachShadow","getRootNode","root","ShadowRoot","noop","reflow","offsetHeight","getjQuery","jQuery","body","DOMContentLoadedCallbacks","isRTL","dir","defineJQueryPlugin","plugin","callback","$","name","NAME","JQUERY_NO_CONFLICT","fn","jQueryInterface","Constructor","noConflict","readyState","addEventListener","push","execute","possibleCallback","args","defaultValue","executeAfterTransition","transitionElement","waitForTransition","emulatedDuration","transitionDuration","transitionDelay","floatTransitionDuration","Number","parseFloat","floatTransitionDelay","split","getTransitionDurationFromElement","called","handler","target","removeEventListener","setTimeout","getNextActiveElement","list","activeElement","shouldGetNext","isCycleAllowed","listLength","index","indexOf","Math","max","min","namespaceRegex","stripNameRegex","stripUidRegex","eventRegistry","uidEvent","customEvents","mouseenter","mouseleave","nativeEvents","Set","makeEventUid","uid","getElementEvents","findHandler","events","callable","delegationSelector","Object","values","find","event","normalizeParameters","originalTypeEvent","delegationFunction","isDelegated","typeEvent","getTypeEvent","addHandler","oneOff","wrapFunction","relatedTarget","delegateTarget","call","this","handlers","previousFunction","domElements","querySelectorAll","domElement","hydrateObj","EventHandler","off","type","apply","bootstrapDelegationHandler","bootstrapHandler","removeHandler","Boolean","removeNamespacedHandlers","namespace","storeElementEvent","handlerKey","entries","includes","on","one","inNamespace","isNamespace","startsWith","elementEvent","slice","keyHandlers","trigger","jQueryEvent","bubbles","nativeDispatch","defaultPrevented","isPropagationStopped","isImmediatePropagationStopped","isDefaultPrevented","evt","cancelable","preventDefault","obj","meta","value","_unused","defineProperty","configurable","normalizeData","toString","JSON","parse","decodeURIComponent","normalizeDataKey","chr","toLowerCase","Manipulator","setDataAttribute","setAttribute","removeDataAttribute","removeAttribute","getDataAttributes","attributes","bsKeys","dataset","filter","pureKey","charAt","getDataAttribute","Config","Default","DefaultType","Error","_getConfig","config","_mergeConfigObj","_configAfterMerge","_typeCheckConfig","jsonConfig","constructor","configTypes","property","expectedTypes","valueType","prototype","RegExp","test","TypeError","toUpperCase","BaseComponent","super","_element","_config","DATA_KEY","dispose","EVENT_KEY","propertyName","getOwnPropertyNames","_queueCallback","isAnimated","getInstance","getOrCreateInstance","VERSION","eventName","getSelector","hrefAttribute","trim","SelectorEngine","concat","Element","findOne","children","child","matches","parents","ancestor","prev","previous","previousElementSibling","next","nextElementSibling","focusableChildren","focusables","map","join","el","getSelectorFromElement","getElementFromSelector","getMultipleElementsFromSelector","enableDismissTrigger","component","method","clickEvent","tagName","EVENT_CLOSE","EVENT_CLOSED","Alert","close","_destroyElement","each","data","undefined","SELECTOR_DATA_TOGGLE","Button","toggle","button","EVENT_TOUCHSTART","EVENT_TOUCHMOVE","EVENT_TOUCHEND","EVENT_POINTERDOWN","EVENT_POINTERUP","endCallback","leftCallback","rightCallback","Swipe","isSupported","_deltaX","_supportPointerEvents","PointerEvent","_initEvents","_start","_eventIsPointerPenTouch","clientX","touches","_end","_handleSwipe","_move","absDeltaX","abs","direction","add","pointerType","navigator","maxTouchPoints","DATA_API_KEY","ORDER_NEXT","ORDER_PREV","DIRECTION_LEFT","DIRECTION_RIGHT","EVENT_SLIDE","EVENT_SLID","EVENT_KEYDOWN","EVENT_MOUSEENTER","EVENT_MOUSELEAVE","EVENT_DRAG_START","EVENT_LOAD_DATA_API","EVENT_CLICK_DATA_API","CLASS_NAME_CAROUSEL","CLASS_NAME_ACTIVE","SELECTOR_ACTIVE","SELECTOR_ITEM","SELECTOR_ACTIVE_ITEM","KEY_TO_DIRECTION","ArrowLeft","ArrowRight","interval","keyboard","pause","ride","touch","wrap","Carousel","_interval","_activeElement","_isSliding","touchTimeout","_swipeHelper","_indicatorsElement","_addEventListeners","cycle","_slide","nextWhenVisible","hidden","_clearInterval","_updateInterval","setInterval","_maybeEnableCycle","to","items","_getItems","activeIndex","_getItemIndex","_getActive","order","defaultInterval","_keydown","_addTouchEventListeners","img","swipeConfig","_directionToOrder","endCallBack","clearTimeout","_setActiveIndicatorElement","activeIndicator","newActiveIndicator","elementInterval","parseInt","isNext","nextElement","nextElementIndex","triggerEvent","_orderToDirection","isCycling","directionalClassName","orderClassName","completeCallBack","_isAnimated","clearInterval","carousel","slideIndex","carousels","EVENT_SHOW","EVENT_SHOWN","EVENT_HIDE","EVENT_HIDDEN","CLASS_NAME_SHOW","CLASS_NAME_COLLAPSE","CLASS_NAME_COLLAPSING","CLASS_NAME_DEEPER_CHILDREN","parent","Collapse","_isTransitioning","_triggerArray","toggleList","elem","filterElement","foundElement","_initializeChildren","_addAriaAndCollapsedClass","_isShown","hide","show","activeChildren","_getFirstLevelChildren","activeInstance","dimension","_getDimension","style","scrollSize","complete","getBoundingClientRect","selected","triggerArray","isOpen","top","bottom","right","left","auto","basePlacements","start","end","clippingParents","viewport","popper","reference","variationPlacements","reduce","acc","placement","placements","beforeRead","read","afterRead","beforeMain","main","afterMain","beforeWrite","write","afterWrite","modifierPhases","getNodeName","nodeName","getWindow","node","ownerDocument","defaultView","isHTMLElement","HTMLElement","isShadowRoot","applyStyles$1","enabled","phase","_ref","state","elements","forEach","styles","assign","effect","_ref2","initialStyles","position","options","strategy","margin","arrow","hasOwnProperty","attribute","requires","getBasePlacement","round","getUAString","uaData","userAgentData","brands","isArray","item","brand","version","userAgent","isLayoutViewport","includeScale","isFixedStrategy","clientRect","scaleX","scaleY","offsetWidth","width","height","visualViewport","addVisualOffsets","x","offsetLeft","y","offsetTop","getLayoutRect","rootNode","isSameNode","host","isTableElement","getDocumentElement","getParentNode","assignedSlot","getTrueOffsetParent","offsetParent","getOffsetParent","isFirefox","currentNode","css","transform","perspective","contain","willChange","getContainingBlock","getMainAxisFromPlacement","within","mathMax","mathMin","mergePaddingObject","paddingObject","expandToHashMap","hashMap","arrow$1","_state$modifiersData$","arrowElement","popperOffsets","modifiersData","basePlacement","axis","len","padding","rects","toPaddingObject","arrowRect","minProp","maxProp","endDiff","startDiff","arrowOffsetParent","clientSize","clientHeight","clientWidth","centerToReference","center","offset","axisProp","centerOffset","_options$element","requiresIfExists","getVariation","unsetSides","mapToStyles","_Object$assign2","popperRect","variation","offsets","gpuAcceleration","adaptive","roundOffsets","isFixed","_offsets$x","_offsets$y","_ref3","hasX","hasY","sideX","sideY","win","heightProp","widthProp","_Object$assign","commonStyles","_ref4","dpr","devicePixelRatio","roundOffsetsByDPR","computeStyles$1","_ref5","_options$gpuAccelerat","_options$adaptive","_options$roundOffsets","passive","eventListeners","_options$scroll","scroll","_options$resize","resize","scrollParents","scrollParent","update","hash","getOppositePlacement","matched","getOppositeVariationPlacement","getWindowScroll","scrollLeft","pageXOffset","scrollTop","pageYOffset","getWindowScrollBarX","isScrollParent","_getComputedStyle","overflow","overflowX","overflowY","getScrollParent","listScrollParents","_element$ownerDocumen","isBody","updatedList","rectToClientRect","rect","getClientRectFromMixedType","clippingParent","html","layoutViewport","getViewportRect","clientTop","clientLeft","getInnerBoundingClientRect","winScroll","scrollWidth","scrollHeight","getDocumentRect","computeOffsets","commonX","commonY","mainAxis","detectOverflow","_options","_options$placement","_options$strategy","_options$boundary","boundary","_options$rootBoundary","rootBoundary","_options$elementConte","elementContext","_options$altBoundary","altBoundary","_options$padding","altContext","clippingClientRect","mainClippingParents","clipperElement","getClippingParents","firstClippingParent","clippingRect","accRect","getClippingRect","contextElement","referenceClientRect","popperClientRect","elementClientRect","overflowOffsets","offsetData","multiply","computeAutoPlacement","flipVariations","_options$allowedAutoP","allowedAutoPlacements","allPlacements","allowedPlacements","overflows","sort","a","b","flip$1","_skip","_options$mainAxis","checkMainAxis","_options$altAxis","altAxis","checkAltAxis","specifiedFallbackPlacements","fallbackPlacements","_options$flipVariatio","preferredPlacement","oppositePlacement","getExpandedFallbackPlacements","referenceRect","checksMap","makeFallbackChecks","firstFittingPlacement","i","_basePlacement","isStartVariation","isVertical","mainVariationSide","altVariationSide","checks","every","check","_loop","_i","fittingPlacement","reset","getSideOffsets","preventedOffsets","isAnySideFullyClipped","some","side","hide$1","preventOverflow","referenceOverflow","popperAltOverflow","referenceClippingOffsets","popperEscapeOffsets","isReferenceHidden","hasPopperEscaped","offset$1","_options$offset","invertDistance","skidding","distance","distanceAndSkiddingToXY","_data$state$placement","popperOffsets$1","preventOverflow$1","_options$tether","tether","_options$tetherOffset","tetherOffset","isBasePlacement","tetherOffsetValue","normalizedTetherOffsetValue","offsetModifierState","_offsetModifierState$","mainSide","altSide","additive","minLen","maxLen","arrowPaddingObject","arrowPaddingMin","arrowPaddingMax","arrowLen","minOffset","maxOffset","clientOffset","offsetModifierValue","tetherMax","preventedOffset","_offsetModifierState$2","_mainSide","_altSide","_offset","_len","_min","_max","isOriginSide","_offsetModifierValue","_tetherMin","_tetherMax","_preventedOffset","v","withinMaxClamp","getCompositeRect","elementOrVirtualElement","isOffsetParentAnElement","offsetParentIsScaled","isElementScaled","modifiers","visited","result","modifier","dep","depModifier","DEFAULT_OPTIONS","areValidElements","arguments","_key","popperGenerator","generatorOptions","_generatorOptions","_generatorOptions$def","defaultModifiers","_generatorOptions$def2","defaultOptions","pending","orderedModifiers","effectCleanupFns","isDestroyed","setOptions","setOptionsAction","cleanupModifierEffects","merged","orderModifiers","current","existing","m","_ref$options","cleanupFn","forceUpdate","_state$elements","_state$orderedModifie","_state$orderedModifie2","Promise","resolve","then","destroy","onFirstUpdate","createPopper","computeStyles","applyStyles","flip","ARROW_UP_KEY","ARROW_DOWN_KEY","EVENT_KEYDOWN_DATA_API","EVENT_KEYUP_DATA_API","SELECTOR_DATA_TOGGLE_SHOWN","SELECTOR_MENU","PLACEMENT_TOP","PLACEMENT_TOPEND","PLACEMENT_BOTTOM","PLACEMENT_BOTTOMEND","PLACEMENT_RIGHT","PLACEMENT_LEFT","autoClose","display","popperConfig","Dropdown","_popper","_parent","_menu","_inNavbar","_detectNavbar","_createPopper","focus","_completeHide","Popper","referenceElement","_getPopperConfig","_getPlacement","parentDropdown","isEnd","_getOffset","popperData","defaultBsPopperConfig","_selectMenuItem","clearMenus","openToggles","context","composedPath","isMenuTarget","dataApiKeydownHandler","isInput","isEscapeEvent","isUpOrDownEvent","getToggleButton","stopPropagation","EVENT_MOUSEDOWN","className","clickCallback","rootElement","Backdrop","_isAppended","_append","_getElement","_emulateAnimation","backdrop","createElement","append","EVENT_FOCUSIN","EVENT_KEYDOWN_TAB","TAB_NAV_BACKWARD","autofocus","trapElement","FocusTrap","_isActive","_lastTabNavDirection","activate","_handleFocusin","_handleKeydown","deactivate","shiftKey","SELECTOR_FIXED_CONTENT","SELECTOR_STICKY_CONTENT","PROPERTY_PADDING","PROPERTY_MARGIN","ScrollBarHelper","getWidth","documentWidth","innerWidth","_disableOverFlow","_setElementAttributes","calculatedValue","_resetElementAttributes","isOverflowing","_saveInitialAttribute","styleProperty","scrollbarWidth","_applyManipulationCallback","setProperty","actualValue","removeProperty","callBack","sel","EVENT_HIDE_PREVENTED","EVENT_RESIZE","EVENT_CLICK_DISMISS","EVENT_MOUSEDOWN_DISMISS","EVENT_KEYDOWN_DISMISS","CLASS_NAME_OPEN","CLASS_NAME_STATIC","Modal","_dialog","_backdrop","_initializeBackDrop","_focustrap","_initializeFocusTrap","_scrollBar","_adjustDialog","_showElement","_hideModal","handleUpdate","modalBody","transitionComplete","_triggerBackdropTransition","event2","_resetAdjustments","isModalOverflowing","initialOverflowY","isBodyOverflowing","paddingLeft","paddingRight","showEvent","alreadyOpen","CLASS_NAME_SHOWING","CLASS_NAME_HIDING","OPEN_SELECTOR","Offcanvas","blur","completeCallback","DefaultAllowlist","area","br","col","code","div","em","hr","h1","h2","h3","h4","h5","h6","li","ol","p","pre","s","small","span","sub","sup","strong","u","ul","uriAttributes","SAFE_URL_PATTERN","allowedAttribute","allowedAttributeList","attributeName","nodeValue","attributeRegex","regex","allowList","content","extraClass","sanitize","sanitizeFn","template","DefaultContentType","entry","TemplateFactory","getContent","_resolvePossibleFunction","hasContent","changeContent","_checkContent","toHtml","templateWrapper","innerHTML","_maybeSanitize","text","_setContent","arg","templateElement","_putElementInTemplate","textContent","unsafeHtml","sanitizeFunction","createdDocument","DOMParser","parseFromString","elementName","attributeList","allowedAttributes","sanitizeHtml","DISALLOWED_ATTRIBUTES","CLASS_NAME_FADE","SELECTOR_MODAL","EVENT_MODAL_HIDE","TRIGGER_HOVER","TRIGGER_FOCUS","AttachmentMap","AUTO","TOP","RIGHT","BOTTOM","LEFT","animation","container","customClass","delay","title","Tooltip","_isEnabled","_timeout","_isHovered","_activeTrigger","_templateFactory","_newContent","tip","_setListeners","_fixTitle","enable","disable","toggleEnabled","click","_leave","_enter","_hideModalHandler","_disposePopper","_isWithContent","isInTheDom","_getTipElement","_isWithActiveTrigger","_getTitle","_createTipElement","_getContentForTemplate","_getTemplateFactory","tipId","prefix","floor","random","getElementById","getUID","setContent","_initializeOnDelegatedTarget","_getDelegateConfig","attachment","triggers","eventIn","eventOut","_setTimeout","timeout","dataAttributes","dataAttribute","Popover","_getContent","EVENT_ACTIVATE","EVENT_CLICK","SELECTOR_TARGET_LINKS","SELECTOR_NAV_LINKS","SELECTOR_LINK_ITEMS","rootMargin","smoothScroll","threshold","ScrollSpy","_targetLinks","_observableSections","_rootElement","_activeTarget","_observer","_previousScrollData","visibleEntryTop","parentScrollTop","refresh","_initializeTargetsAndObservables","_maybeEnableSmoothScroll","disconnect","_getNewObserver","section","observe","observableSection","scrollTo","behavior","IntersectionObserver","_observerCallback","targetElement","_process","userScrollsDown","isIntersecting","_clearActiveClass","entryIsLowerThanPrevious","targetLinks","anchor","decodeURI","_activateParents","listGroup","activeNodes","spy","ARROW_LEFT_KEY","ARROW_RIGHT_KEY","HOME_KEY","END_KEY","NOT_SELECTOR_DROPDOWN_TOGGLE","SELECTOR_INNER_ELEM","SELECTOR_DATA_TOGGLE_ACTIVE","Tab","_setInitialAttributes","_getChildren","innerElem","_elemIsActive","active","_getActiveElem","hideEvent","_deactivate","_activate","relatedElem","_toggleDropDown","nextActiveElement","preventScroll","_setAttributeIfNotExists","_setInitialAttributesOnChild","_getInnerElement","isActive","outerElem","_getOuterElement","_setInitialAttributesOnTargetPanel","open","EVENT_MOUSEOVER","EVENT_MOUSEOUT","EVENT_FOCUSOUT","CLASS_NAME_HIDE","autohide","Toast","_hasMouseInteraction","_hasKeyboardInteraction","_clearTimeout","_maybeScheduleHide","isShown","_onInteraction","isInteracting"],"sources":["../../js/src/dom/data.js","../../js/src/util/index.js","../../js/src/dom/event-handler.js","../../js/src/dom/manipulator.js","../../js/src/util/config.js","../../js/src/base-component.js","../../js/src/dom/selector-engine.js","../../js/src/util/component-functions.js","../../js/src/alert.js","../../js/src/button.js","../../js/src/util/swipe.js","../../js/src/carousel.js","../../js/src/collapse.js","../../node_modules/@popperjs/core/lib/enums.js","../../node_modules/@popperjs/core/lib/dom-utils/getNodeName.js","../../node_modules/@popperjs/core/lib/dom-utils/getWindow.js","../../node_modules/@popperjs/core/lib/dom-utils/instanceOf.js","../../node_modules/@popperjs/core/lib/modifiers/applyStyles.js","../../node_modules/@popperjs/core/lib/utils/getBasePlacement.js","../../node_modules/@popperjs/core/lib/utils/math.js","../../node_modules/@popperjs/core/lib/utils/userAgent.js","../../node_modules/@popperjs/core/lib/dom-utils/isLayoutViewport.js","../../node_modules/@popperjs/core/lib/dom-utils/getBoundingClientRect.js","../../node_modules/@popperjs/core/lib/dom-utils/getLayoutRect.js","../../node_modules/@popperjs/core/lib/dom-utils/contains.js","../../node_modules/@popperjs/core/lib/dom-utils/getComputedStyle.js","../../node_modules/@popperjs/core/lib/dom-utils/isTableElement.js","../../node_modules/@popperjs/core/lib/dom-utils/getDocumentElement.js","../../node_modules/@popperjs/core/lib/dom-utils/getParentNode.js","../../node_modules/@popperjs/core/lib/dom-utils/getOffsetParent.js","../../node_modules/@popperjs/core/lib/utils/getMainAxisFromPlacement.js","../../node_modules/@popperjs/core/lib/utils/within.js","../../node_modules/@popperjs/core/lib/utils/mergePaddingObject.js","../../node_modules/@popperjs/core/lib/utils/getFreshSideObject.js","../../node_modules/@popperjs/core/lib/utils/expandToHashMap.js","../../node_modules/@popperjs/core/lib/modifiers/arrow.js","../../node_modules/@popperjs/core/lib/utils/getVariation.js","../../node_modules/@popperjs/core/lib/modifiers/computeStyles.js","../../node_modules/@popperjs/core/lib/modifiers/eventListeners.js","../../node_modules/@popperjs/core/lib/utils/getOppositePlacement.js","../../node_modules/@popperjs/core/lib/utils/getOppositeVariationPlacement.js","../../node_modules/@popperjs/core/lib/dom-utils/getWindowScroll.js","../../node_modules/@popperjs/core/lib/dom-utils/getWindowScrollBarX.js","../../node_modules/@popperjs/core/lib/dom-utils/isScrollParent.js","../../node_modules/@popperjs/core/lib/dom-utils/getScrollParent.js","../../node_modules/@popperjs/core/lib/dom-utils/listScrollParents.js","../../node_modules/@popperjs/core/lib/utils/rectToClientRect.js","../../node_modules/@popperjs/core/lib/dom-utils/getClippingRect.js","../../node_modules/@popperjs/core/lib/dom-utils/getViewportRect.js","../../node_modules/@popperjs/core/lib/dom-utils/getDocumentRect.js","../../node_modules/@popperjs/core/lib/utils/computeOffsets.js","../../node_modules/@popperjs/core/lib/utils/detectOverflow.js","../../node_modules/@popperjs/core/lib/utils/computeAutoPlacement.js","../../node_modules/@popperjs/core/lib/modifiers/flip.js","../../node_modules/@popperjs/core/lib/modifiers/hide.js","../../node_modules/@popperjs/core/lib/modifiers/offset.js","../../node_modules/@popperjs/core/lib/modifiers/popperOffsets.js","../../node_modules/@popperjs/core/lib/modifiers/preventOverflow.js","../../node_modules/@popperjs/core/lib/utils/getAltAxis.js","../../node_modules/@popperjs/core/lib/dom-utils/getCompositeRect.js","../../node_modules/@popperjs/core/lib/dom-utils/getNodeScroll.js","../../node_modules/@popperjs/core/lib/dom-utils/getHTMLElementScroll.js","../../node_modules/@popperjs/core/lib/utils/orderModifiers.js","../../node_modules/@popperjs/core/lib/createPopper.js","../../node_modules/@popperjs/core/lib/utils/debounce.js","../../node_modules/@popperjs/core/lib/utils/mergeByName.js","../../node_modules/@popperjs/core/lib/popper-lite.js","../../node_modules/@popperjs/core/lib/popper.js","../../js/src/dropdown.js","../../js/src/util/backdrop.js","../../js/src/util/focustrap.js","../../js/src/util/scrollbar.js","../../js/src/modal.js","../../js/src/offcanvas.js","../../js/src/util/sanitizer.js","../../js/src/util/template-factory.js","../../js/src/tooltip.js","../../js/src/popover.js","../../js/src/scrollspy.js","../../js/src/tab.js","../../js/src/toast.js","../../js/index.umd.js"],"sourcesContent":["/**\n * --------------------------------------------------------------------------\n * Bootstrap dom/data.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\n/**\n * Constants\n */\n\nconst elementMap = new Map()\n\nexport default {\n  set(element, key, instance) {\n    if (!elementMap.has(element)) {\n      elementMap.set(element, new Map())\n    }\n\n    const instanceMap = elementMap.get(element)\n\n    // make it clear we only want one instance per element\n    // can be removed later when multiple key/instances are fine to be used\n    if (!instanceMap.has(key) && instanceMap.size !== 0) {\n      // eslint-disable-next-line no-console\n      console.error(`Bootstrap doesn't allow more than one instance per element. Bound instance: ${Array.from(instanceMap.keys())[0]}.`)\n      return\n    }\n\n    instanceMap.set(key, instance)\n  },\n\n  get(element, key) {\n    if (elementMap.has(element)) {\n      return elementMap.get(element).get(key) || null\n    }\n\n    return null\n  },\n\n  remove(element, key) {\n    if (!elementMap.has(element)) {\n      return\n    }\n\n    const instanceMap = elementMap.get(element)\n\n    instanceMap.delete(key)\n\n    // free up element references if there are no instances left for an element\n    if (instanceMap.size === 0) {\n      elementMap.delete(element)\n    }\n  }\n}\n","/**\n * --------------------------------------------------------------------------\n * Bootstrap util/index.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\nconst MAX_UID = 1_000_000\nconst MILLISECONDS_MULTIPLIER = 1000\nconst TRANSITION_END = 'transitionend'\n\n/**\n * Properly escape IDs selectors to handle weird IDs\n * @param {string} selector\n * @returns {string}\n */\nconst parseSelector = selector => {\n  if (selector && window.CSS && window.CSS.escape) {\n    // document.querySelector needs escaping to handle IDs (html5+) containing for instance /\n    selector = selector.replace(/#([^\\s\"#']+)/g, (match, id) => `#${CSS.escape(id)}`)\n  }\n\n  return selector\n}\n\n// Shout-out Angus Croll (https://goo.gl/pxwQGp)\nconst toType = object => {\n  if (object === null || object === undefined) {\n    return `${object}`\n  }\n\n  return Object.prototype.toString.call(object).match(/\\s([a-z]+)/i)[1].toLowerCase()\n}\n\n/**\n * Public Util API\n */\n\nconst getUID = prefix => {\n  do {\n    prefix += Math.floor(Math.random() * MAX_UID)\n  } while (document.getElementById(prefix))\n\n  return prefix\n}\n\nconst getTransitionDurationFromElement = element => {\n  if (!element) {\n    return 0\n  }\n\n  // Get transition-duration of the element\n  let { transitionDuration, transitionDelay } = window.getComputedStyle(element)\n\n  const floatTransitionDuration = Number.parseFloat(transitionDuration)\n  const floatTransitionDelay = Number.parseFloat(transitionDelay)\n\n  // Return 0 if element or transition duration is not found\n  if (!floatTransitionDuration && !floatTransitionDelay) {\n    return 0\n  }\n\n  // If multiple durations are defined, take the first\n  transitionDuration = transitionDuration.split(',')[0]\n  transitionDelay = transitionDelay.split(',')[0]\n\n  return (Number.parseFloat(transitionDuration) + Number.parseFloat(transitionDelay)) * MILLISECONDS_MULTIPLIER\n}\n\nconst triggerTransitionEnd = element => {\n  element.dispatchEvent(new Event(TRANSITION_END))\n}\n\nconst isElement = object => {\n  if (!object || typeof object !== 'object') {\n    return false\n  }\n\n  if (typeof object.jquery !== 'undefined') {\n    object = object[0]\n  }\n\n  return typeof object.nodeType !== 'undefined'\n}\n\nconst getElement = object => {\n  // it's a jQuery object or a node element\n  if (isElement(object)) {\n    return object.jquery ? object[0] : object\n  }\n\n  if (typeof object === 'string' && object.length > 0) {\n    return document.querySelector(parseSelector(object))\n  }\n\n  return null\n}\n\nconst isVisible = element => {\n  if (!isElement(element) || element.getClientRects().length === 0) {\n    return false\n  }\n\n  const elementIsVisible = getComputedStyle(element).getPropertyValue('visibility') === 'visible'\n  // Handle `details` element as its content may falsie appear visible when it is closed\n  const closedDetails = element.closest('details:not([open])')\n\n  if (!closedDetails) {\n    return elementIsVisible\n  }\n\n  if (closedDetails !== element) {\n    const summary = element.closest('summary')\n    if (summary && summary.parentNode !== closedDetails) {\n      return false\n    }\n\n    if (summary === null) {\n      return false\n    }\n  }\n\n  return elementIsVisible\n}\n\nconst isDisabled = element => {\n  if (!element || element.nodeType !== Node.ELEMENT_NODE) {\n    return true\n  }\n\n  if (element.classList.contains('disabled')) {\n    return true\n  }\n\n  if (typeof element.disabled !== 'undefined') {\n    return element.disabled\n  }\n\n  return element.hasAttribute('disabled') && element.getAttribute('disabled') !== 'false'\n}\n\nconst findShadowRoot = element => {\n  if (!document.documentElement.attachShadow) {\n    return null\n  }\n\n  // Can find the shadow root otherwise it'll return the document\n  if (typeof element.getRootNode === 'function') {\n    const root = element.getRootNode()\n    return root instanceof ShadowRoot ? root : null\n  }\n\n  if (element instanceof ShadowRoot) {\n    return element\n  }\n\n  // when we don't find a shadow root\n  if (!element.parentNode) {\n    return null\n  }\n\n  return findShadowRoot(element.parentNode)\n}\n\nconst noop = () => {}\n\n/**\n * Trick to restart an element's animation\n *\n * @param {HTMLElement} element\n * @return void\n *\n * @see https://www.charistheo.io/blog/2021/02/restart-a-css-animation-with-javascript/#restarting-a-css-animation\n */\nconst reflow = element => {\n  element.offsetHeight // eslint-disable-line no-unused-expressions\n}\n\nconst getjQuery = () => {\n  if (window.jQuery && !document.body.hasAttribute('data-bs-no-jquery')) {\n    return window.jQuery\n  }\n\n  return null\n}\n\nconst DOMContentLoadedCallbacks = []\n\nconst onDOMContentLoaded = callback => {\n  if (document.readyState === 'loading') {\n    // add listener on the first call when the document is in loading state\n    if (!DOMContentLoadedCallbacks.length) {\n      document.addEventListener('DOMContentLoaded', () => {\n        for (const callback of DOMContentLoadedCallbacks) {\n          callback()\n        }\n      })\n    }\n\n    DOMContentLoadedCallbacks.push(callback)\n  } else {\n    callback()\n  }\n}\n\nconst isRTL = () => document.documentElement.dir === 'rtl'\n\nconst defineJQueryPlugin = plugin => {\n  onDOMContentLoaded(() => {\n    const $ = getjQuery()\n    /* istanbul ignore if */\n    if ($) {\n      const name = plugin.NAME\n      const JQUERY_NO_CONFLICT = $.fn[name]\n      $.fn[name] = plugin.jQueryInterface\n      $.fn[name].Constructor = plugin\n      $.fn[name].noConflict = () => {\n        $.fn[name] = JQUERY_NO_CONFLICT\n        return plugin.jQueryInterface\n      }\n    }\n  })\n}\n\nconst execute = (possibleCallback, args = [], defaultValue = possibleCallback) => {\n  return typeof possibleCallback === 'function' ? possibleCallback(...args) : defaultValue\n}\n\nconst executeAfterTransition = (callback, transitionElement, waitForTransition = true) => {\n  if (!waitForTransition) {\n    execute(callback)\n    return\n  }\n\n  const durationPadding = 5\n  const emulatedDuration = getTransitionDurationFromElement(transitionElement) + durationPadding\n\n  let called = false\n\n  const handler = ({ target }) => {\n    if (target !== transitionElement) {\n      return\n    }\n\n    called = true\n    transitionElement.removeEventListener(TRANSITION_END, handler)\n    execute(callback)\n  }\n\n  transitionElement.addEventListener(TRANSITION_END, handler)\n  setTimeout(() => {\n    if (!called) {\n      triggerTransitionEnd(transitionElement)\n    }\n  }, emulatedDuration)\n}\n\n/**\n * Return the previous/next element of a list.\n *\n * @param {array} list    The list of elements\n * @param activeElement   The active element\n * @param shouldGetNext   Choose to get next or previous element\n * @param isCycleAllowed\n * @return {Element|elem} The proper element\n */\nconst getNextActiveElement = (list, activeElement, shouldGetNext, isCycleAllowed) => {\n  const listLength = list.length\n  let index = list.indexOf(activeElement)\n\n  // if the element does not exist in the list return an element\n  // depending on the direction and if cycle is allowed\n  if (index === -1) {\n    return !shouldGetNext && isCycleAllowed ? list[listLength - 1] : list[0]\n  }\n\n  index += shouldGetNext ? 1 : -1\n\n  if (isCycleAllowed) {\n    index = (index + listLength) % listLength\n  }\n\n  return list[Math.max(0, Math.min(index, listLength - 1))]\n}\n\nexport {\n  defineJQueryPlugin,\n  execute,\n  executeAfterTransition,\n  findShadowRoot,\n  getElement,\n  getjQuery,\n  getNextActiveElement,\n  getTransitionDurationFromElement,\n  getUID,\n  isDisabled,\n  isElement,\n  isRTL,\n  isVisible,\n  noop,\n  onDOMContentLoaded,\n  parseSelector,\n  reflow,\n  triggerTransitionEnd,\n  toType\n}\n","/**\n * --------------------------------------------------------------------------\n * Bootstrap dom/event-handler.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\nimport { getjQuery } from '../util/index.js'\n\n/**\n * Constants\n */\n\nconst namespaceRegex = /[^.]*(?=\\..*)\\.|.*/\nconst stripNameRegex = /\\..*/\nconst stripUidRegex = /::\\d+$/\nconst eventRegistry = {} // Events storage\nlet uidEvent = 1\nconst customEvents = {\n  mouseenter: 'mouseover',\n  mouseleave: 'mouseout'\n}\n\nconst nativeEvents = new Set([\n  'click',\n  'dblclick',\n  'mouseup',\n  'mousedown',\n  'contextmenu',\n  'mousewheel',\n  'DOMMouseScroll',\n  'mouseover',\n  'mouseout',\n  'mousemove',\n  'selectstart',\n  'selectend',\n  'keydown',\n  'keypress',\n  'keyup',\n  'orientationchange',\n  'touchstart',\n  'touchmove',\n  'touchend',\n  'touchcancel',\n  'pointerdown',\n  'pointermove',\n  'pointerup',\n  'pointerleave',\n  'pointercancel',\n  'gesturestart',\n  'gesturechange',\n  'gestureend',\n  'focus',\n  'blur',\n  'change',\n  'reset',\n  'select',\n  'submit',\n  'focusin',\n  'focusout',\n  'load',\n  'unload',\n  'beforeunload',\n  'resize',\n  'move',\n  'DOMContentLoaded',\n  'readystatechange',\n  'error',\n  'abort',\n  'scroll'\n])\n\n/**\n * Private methods\n */\n\nfunction makeEventUid(element, uid) {\n  return (uid && `${uid}::${uidEvent++}`) || element.uidEvent || uidEvent++\n}\n\nfunction getElementEvents(element) {\n  const uid = makeEventUid(element)\n\n  element.uidEvent = uid\n  eventRegistry[uid] = eventRegistry[uid] || {}\n\n  return eventRegistry[uid]\n}\n\nfunction bootstrapHandler(element, fn) {\n  return function handler(event) {\n    hydrateObj(event, { delegateTarget: element })\n\n    if (handler.oneOff) {\n      EventHandler.off(element, event.type, fn)\n    }\n\n    return fn.apply(element, [event])\n  }\n}\n\nfunction bootstrapDelegationHandler(element, selector, fn) {\n  return function handler(event) {\n    const domElements = element.querySelectorAll(selector)\n\n    for (let { target } = event; target && target !== this; target = target.parentNode) {\n      for (const domElement of domElements) {\n        if (domElement !== target) {\n          continue\n        }\n\n        hydrateObj(event, { delegateTarget: target })\n\n        if (handler.oneOff) {\n          EventHandler.off(element, event.type, selector, fn)\n        }\n\n        return fn.apply(target, [event])\n      }\n    }\n  }\n}\n\nfunction findHandler(events, callable, delegationSelector = null) {\n  return Object.values(events)\n    .find(event => event.callable === callable && event.delegationSelector === delegationSelector)\n}\n\nfunction normalizeParameters(originalTypeEvent, handler, delegationFunction) {\n  const isDelegated = typeof handler === 'string'\n  // TODO: tooltip passes `false` instead of selector, so we need to check\n  const callable = isDelegated ? delegationFunction : (handler || delegationFunction)\n  let typeEvent = getTypeEvent(originalTypeEvent)\n\n  if (!nativeEvents.has(typeEvent)) {\n    typeEvent = originalTypeEvent\n  }\n\n  return [isDelegated, callable, typeEvent]\n}\n\nfunction addHandler(element, originalTypeEvent, handler, delegationFunction, oneOff) {\n  if (typeof originalTypeEvent !== 'string' || !element) {\n    return\n  }\n\n  let [isDelegated, callable, typeEvent] = normalizeParameters(originalTypeEvent, handler, delegationFunction)\n\n  // in case of mouseenter or mouseleave wrap the handler within a function that checks for its DOM position\n  // this prevents the handler from being dispatched the same way as mouseover or mouseout does\n  if (originalTypeEvent in customEvents) {\n    const wrapFunction = fn => {\n      return function (event) {\n        if (!event.relatedTarget || (event.relatedTarget !== event.delegateTarget && !event.delegateTarget.contains(event.relatedTarget))) {\n          return fn.call(this, event)\n        }\n      }\n    }\n\n    callable = wrapFunction(callable)\n  }\n\n  const events = getElementEvents(element)\n  const handlers = events[typeEvent] || (events[typeEvent] = {})\n  const previousFunction = findHandler(handlers, callable, isDelegated ? handler : null)\n\n  if (previousFunction) {\n    previousFunction.oneOff = previousFunction.oneOff && oneOff\n\n    return\n  }\n\n  const uid = makeEventUid(callable, originalTypeEvent.replace(namespaceRegex, ''))\n  const fn = isDelegated ?\n    bootstrapDelegationHandler(element, handler, callable) :\n    bootstrapHandler(element, callable)\n\n  fn.delegationSelector = isDelegated ? handler : null\n  fn.callable = callable\n  fn.oneOff = oneOff\n  fn.uidEvent = uid\n  handlers[uid] = fn\n\n  element.addEventListener(typeEvent, fn, isDelegated)\n}\n\nfunction removeHandler(element, events, typeEvent, handler, delegationSelector) {\n  const fn = findHandler(events[typeEvent], handler, delegationSelector)\n\n  if (!fn) {\n    return\n  }\n\n  element.removeEventListener(typeEvent, fn, Boolean(delegationSelector))\n  delete events[typeEvent][fn.uidEvent]\n}\n\nfunction removeNamespacedHandlers(element, events, typeEvent, namespace) {\n  const storeElementEvent = events[typeEvent] || {}\n\n  for (const [handlerKey, event] of Object.entries(storeElementEvent)) {\n    if (handlerKey.includes(namespace)) {\n      removeHandler(element, events, typeEvent, event.callable, event.delegationSelector)\n    }\n  }\n}\n\nfunction getTypeEvent(event) {\n  // allow to get the native events from namespaced events ('click.bs.button' --> 'click')\n  event = event.replace(stripNameRegex, '')\n  return customEvents[event] || event\n}\n\nconst EventHandler = {\n  on(element, event, handler, delegationFunction) {\n    addHandler(element, event, handler, delegationFunction, false)\n  },\n\n  one(element, event, handler, delegationFunction) {\n    addHandler(element, event, handler, delegationFunction, true)\n  },\n\n  off(element, originalTypeEvent, handler, delegationFunction) {\n    if (typeof originalTypeEvent !== 'string' || !element) {\n      return\n    }\n\n    const [isDelegated, callable, typeEvent] = normalizeParameters(originalTypeEvent, handler, delegationFunction)\n    const inNamespace = typeEvent !== originalTypeEvent\n    const events = getElementEvents(element)\n    const storeElementEvent = events[typeEvent] || {}\n    const isNamespace = originalTypeEvent.startsWith('.')\n\n    if (typeof callable !== 'undefined') {\n      // Simplest case: handler is passed, remove that listener ONLY.\n      if (!Object.keys(storeElementEvent).length) {\n        return\n      }\n\n      removeHandler(element, events, typeEvent, callable, isDelegated ? handler : null)\n      return\n    }\n\n    if (isNamespace) {\n      for (const elementEvent of Object.keys(events)) {\n        removeNamespacedHandlers(element, events, elementEvent, originalTypeEvent.slice(1))\n      }\n    }\n\n    for (const [keyHandlers, event] of Object.entries(storeElementEvent)) {\n      const handlerKey = keyHandlers.replace(stripUidRegex, '')\n\n      if (!inNamespace || originalTypeEvent.includes(handlerKey)) {\n        removeHandler(element, events, typeEvent, event.callable, event.delegationSelector)\n      }\n    }\n  },\n\n  trigger(element, event, args) {\n    if (typeof event !== 'string' || !element) {\n      return null\n    }\n\n    const $ = getjQuery()\n    const typeEvent = getTypeEvent(event)\n    const inNamespace = event !== typeEvent\n\n    let jQueryEvent = null\n    let bubbles = true\n    let nativeDispatch = true\n    let defaultPrevented = false\n\n    if (inNamespace && $) {\n      jQueryEvent = $.Event(event, args)\n\n      $(element).trigger(jQueryEvent)\n      bubbles = !jQueryEvent.isPropagationStopped()\n      nativeDispatch = !jQueryEvent.isImmediatePropagationStopped()\n      defaultPrevented = jQueryEvent.isDefaultPrevented()\n    }\n\n    const evt = hydrateObj(new Event(event, { bubbles, cancelable: true }), args)\n\n    if (defaultPrevented) {\n      evt.preventDefault()\n    }\n\n    if (nativeDispatch) {\n      element.dispatchEvent(evt)\n    }\n\n    if (evt.defaultPrevented && jQueryEvent) {\n      jQueryEvent.preventDefault()\n    }\n\n    return evt\n  }\n}\n\nfunction hydrateObj(obj, meta = {}) {\n  for (const [key, value] of Object.entries(meta)) {\n    try {\n      obj[key] = value\n    } catch {\n      Object.defineProperty(obj, key, {\n        configurable: true,\n        get() {\n          return value\n        }\n      })\n    }\n  }\n\n  return obj\n}\n\nexport default EventHandler\n","/**\n * --------------------------------------------------------------------------\n * Bootstrap dom/manipulator.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\nfunction normalizeData(value) {\n  if (value === 'true') {\n    return true\n  }\n\n  if (value === 'false') {\n    return false\n  }\n\n  if (value === Number(value).toString()) {\n    return Number(value)\n  }\n\n  if (value === '' || value === 'null') {\n    return null\n  }\n\n  if (typeof value !== 'string') {\n    return value\n  }\n\n  try {\n    return JSON.parse(decodeURIComponent(value))\n  } catch {\n    return value\n  }\n}\n\nfunction normalizeDataKey(key) {\n  return key.replace(/[A-Z]/g, chr => `-${chr.toLowerCase()}`)\n}\n\nconst Manipulator = {\n  setDataAttribute(element, key, value) {\n    element.setAttribute(`data-bs-${normalizeDataKey(key)}`, value)\n  },\n\n  removeDataAttribute(element, key) {\n    element.removeAttribute(`data-bs-${normalizeDataKey(key)}`)\n  },\n\n  getDataAttributes(element) {\n    if (!element) {\n      return {}\n    }\n\n    const attributes = {}\n    const bsKeys = Object.keys(element.dataset).filter(key => key.startsWith('bs') && !key.startsWith('bsConfig'))\n\n    for (const key of bsKeys) {\n      let pureKey = key.replace(/^bs/, '')\n      pureKey = pureKey.charAt(0).toLowerCase() + pureKey.slice(1, pureKey.length)\n      attributes[pureKey] = normalizeData(element.dataset[key])\n    }\n\n    return attributes\n  },\n\n  getDataAttribute(element, key) {\n    return normalizeData(element.getAttribute(`data-bs-${normalizeDataKey(key)}`))\n  }\n}\n\nexport default Manipulator\n","/**\n * --------------------------------------------------------------------------\n * Bootstrap util/config.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\nimport Manipulator from '../dom/manipulator.js'\nimport { isElement, toType } from './index.js'\n\n/**\n * Class definition\n */\n\nclass Config {\n  // Getters\n  static get Default() {\n    return {}\n  }\n\n  static get DefaultType() {\n    return {}\n  }\n\n  static get NAME() {\n    throw new Error('You have to implement the static method \"NAME\", for each component!')\n  }\n\n  _getConfig(config) {\n    config = this._mergeConfigObj(config)\n    config = this._configAfterMerge(config)\n    this._typeCheckConfig(config)\n    return config\n  }\n\n  _configAfterMerge(config) {\n    return config\n  }\n\n  _mergeConfigObj(config, element) {\n    const jsonConfig = isElement(element) ? Manipulator.getDataAttribute(element, 'config') : {} // try to parse\n\n    return {\n      ...this.constructor.Default,\n      ...(typeof jsonConfig === 'object' ? jsonConfig : {}),\n      ...(isElement(element) ? Manipulator.getDataAttributes(element) : {}),\n      ...(typeof config === 'object' ? config : {})\n    }\n  }\n\n  _typeCheckConfig(config, configTypes = this.constructor.DefaultType) {\n    for (const [property, expectedTypes] of Object.entries(configTypes)) {\n      const value = config[property]\n      const valueType = isElement(value) ? 'element' : toType(value)\n\n      if (!new RegExp(expectedTypes).test(valueType)) {\n        throw new TypeError(\n          `${this.constructor.NAME.toUpperCase()}: Option \"${property}\" provided type \"${valueType}\" but expected type \"${expectedTypes}\".`\n        )\n      }\n    }\n  }\n}\n\nexport default Config\n","/**\n * --------------------------------------------------------------------------\n * Bootstrap base-component.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\nimport Data from './dom/data.js'\nimport EventHandler from './dom/event-handler.js'\nimport Config from './util/config.js'\nimport { executeAfterTransition, getElement } from './util/index.js'\n\n/**\n * Constants\n */\n\nconst VERSION = '5.3.1'\n\n/**\n * Class definition\n */\n\nclass BaseComponent extends Config {\n  constructor(element, config) {\n    super()\n\n    element = getElement(element)\n    if (!element) {\n      return\n    }\n\n    this._element = element\n    this._config = this._getConfig(config)\n\n    Data.set(this._element, this.constructor.DATA_KEY, this)\n  }\n\n  // Public\n  dispose() {\n    Data.remove(this._element, this.constructor.DATA_KEY)\n    EventHandler.off(this._element, this.constructor.EVENT_KEY)\n\n    for (const propertyName of Object.getOwnPropertyNames(this)) {\n      this[propertyName] = null\n    }\n  }\n\n  _queueCallback(callback, element, isAnimated = true) {\n    executeAfterTransition(callback, element, isAnimated)\n  }\n\n  _getConfig(config) {\n    config = this._mergeConfigObj(config, this._element)\n    config = this._configAfterMerge(config)\n    this._typeCheckConfig(config)\n    return config\n  }\n\n  // Static\n  static getInstance(element) {\n    return Data.get(getElement(element), this.DATA_KEY)\n  }\n\n  static getOrCreateInstance(element, config = {}) {\n    return this.getInstance(element) || new this(element, typeof config === 'object' ? config : null)\n  }\n\n  static get VERSION() {\n    return VERSION\n  }\n\n  static get DATA_KEY() {\n    return `bs.${this.NAME}`\n  }\n\n  static get EVENT_KEY() {\n    return `.${this.DATA_KEY}`\n  }\n\n  static eventName(name) {\n    return `${name}${this.EVENT_KEY}`\n  }\n}\n\nexport default BaseComponent\n","/**\n * --------------------------------------------------------------------------\n * Bootstrap dom/selector-engine.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\nimport { isDisabled, isVisible, parseSelector } from '../util/index.js'\n\nconst getSelector = element => {\n  let selector = element.getAttribute('data-bs-target')\n\n  if (!selector || selector === '#') {\n    let hrefAttribute = element.getAttribute('href')\n\n    // The only valid content that could double as a selector are IDs or classes,\n    // so everything starting with `#` or `.`. If a \"real\" URL is used as the selector,\n    // `document.querySelector` will rightfully complain it is invalid.\n    // See https://github.com/twbs/bootstrap/issues/32273\n    if (!hrefAttribute || (!hrefAttribute.includes('#') && !hrefAttribute.startsWith('.'))) {\n      return null\n    }\n\n    // Just in case some CMS puts out a full URL with the anchor appended\n    if (hrefAttribute.includes('#') && !hrefAttribute.startsWith('#')) {\n      hrefAttribute = `#${hrefAttribute.split('#')[1]}`\n    }\n\n    selector = hrefAttribute && hrefAttribute !== '#' ? hrefAttribute.trim() : null\n  }\n\n  return parseSelector(selector)\n}\n\nconst SelectorEngine = {\n  find(selector, element = document.documentElement) {\n    return [].concat(...Element.prototype.querySelectorAll.call(element, selector))\n  },\n\n  findOne(selector, element = document.documentElement) {\n    return Element.prototype.querySelector.call(element, selector)\n  },\n\n  children(element, selector) {\n    return [].concat(...element.children).filter(child => child.matches(selector))\n  },\n\n  parents(element, selector) {\n    const parents = []\n    let ancestor = element.parentNode.closest(selector)\n\n    while (ancestor) {\n      parents.push(ancestor)\n      ancestor = ancestor.parentNode.closest(selector)\n    }\n\n    return parents\n  },\n\n  prev(element, selector) {\n    let previous = element.previousElementSibling\n\n    while (previous) {\n      if (previous.matches(selector)) {\n        return [previous]\n      }\n\n      previous = previous.previousElementSibling\n    }\n\n    return []\n  },\n  // TODO: this is now unused; remove later along with prev()\n  next(element, selector) {\n    let next = element.nextElementSibling\n\n    while (next) {\n      if (next.matches(selector)) {\n        return [next]\n      }\n\n      next = next.nextElementSibling\n    }\n\n    return []\n  },\n\n  focusableChildren(element) {\n    const focusables = [\n      'a',\n      'button',\n      'input',\n      'textarea',\n      'select',\n      'details',\n      '[tabindex]',\n      '[contenteditable=\"true\"]'\n    ].map(selector => `${selector}:not([tabindex^=\"-\"])`).join(',')\n\n    return this.find(focusables, element).filter(el => !isDisabled(el) && isVisible(el))\n  },\n\n  getSelectorFromElement(element) {\n    const selector = getSelector(element)\n\n    if (selector) {\n      return SelectorEngine.findOne(selector) ? selector : null\n    }\n\n    return null\n  },\n\n  getElementFromSelector(element) {\n    const selector = getSelector(element)\n\n    return selector ? SelectorEngine.findOne(selector) : null\n  },\n\n  getMultipleElementsFromSelector(element) {\n    const selector = getSelector(element)\n\n    return selector ? SelectorEngine.find(selector) : []\n  }\n}\n\nexport default SelectorEngine\n","/**\n * --------------------------------------------------------------------------\n * Bootstrap util/component-functions.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\nimport EventHandler from '../dom/event-handler.js'\nimport SelectorEngine from '../dom/selector-engine.js'\nimport { isDisabled } from './index.js'\n\nconst enableDismissTrigger = (component, method = 'hide') => {\n  const clickEvent = `click.dismiss${component.EVENT_KEY}`\n  const name = component.NAME\n\n  EventHandler.on(document, clickEvent, `[data-bs-dismiss=\"${name}\"]`, function (event) {\n    if (['A', 'AREA'].includes(this.tagName)) {\n      event.preventDefault()\n    }\n\n    if (isDisabled(this)) {\n      return\n    }\n\n    const target = SelectorEngine.getElementFromSelector(this) || this.closest(`.${name}`)\n    const instance = component.getOrCreateInstance(target)\n\n    // Method argument is left, for Alert and only, as it doesn't implement the 'hide' method\n    instance[method]()\n  })\n}\n\nexport {\n  enableDismissTrigger\n}\n","/**\n * --------------------------------------------------------------------------\n * Bootstrap alert.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\nimport BaseComponent from './base-component.js'\nimport EventHandler from './dom/event-handler.js'\nimport { enableDismissTrigger } from './util/component-functions.js'\nimport { defineJQueryPlugin } from './util/index.js'\n\n/**\n * Constants\n */\n\nconst NAME = 'alert'\nconst DATA_KEY = 'bs.alert'\nconst EVENT_KEY = `.${DATA_KEY}`\n\nconst EVENT_CLOSE = `close${EVENT_KEY}`\nconst EVENT_CLOSED = `closed${EVENT_KEY}`\nconst CLASS_NAME_FADE = 'fade'\nconst CLASS_NAME_SHOW = 'show'\n\n/**\n * Class definition\n */\n\nclass Alert extends BaseComponent {\n  // Getters\n  static get NAME() {\n    return NAME\n  }\n\n  // Public\n  close() {\n    const closeEvent = EventHandler.trigger(this._element, EVENT_CLOSE)\n\n    if (closeEvent.defaultPrevented) {\n      return\n    }\n\n    this._element.classList.remove(CLASS_NAME_SHOW)\n\n    const isAnimated = this._element.classList.contains(CLASS_NAME_FADE)\n    this._queueCallback(() => this._destroyElement(), this._element, isAnimated)\n  }\n\n  // Private\n  _destroyElement() {\n    this._element.remove()\n    EventHandler.trigger(this._element, EVENT_CLOSED)\n    this.dispose()\n  }\n\n  // Static\n  static jQueryInterface(config) {\n    return this.each(function () {\n      const data = Alert.getOrCreateInstance(this)\n\n      if (typeof config !== 'string') {\n        return\n      }\n\n      if (data[config] === undefined || config.startsWith('_') || config === 'constructor') {\n        throw new TypeError(`No method named \"${config}\"`)\n      }\n\n      data[config](this)\n    })\n  }\n}\n\n/**\n * Data API implementation\n */\n\nenableDismissTrigger(Alert, 'close')\n\n/**\n * jQuery\n */\n\ndefineJQueryPlugin(Alert)\n\nexport default Alert\n","/**\n * --------------------------------------------------------------------------\n * Bootstrap button.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\nimport BaseComponent from './base-component.js'\nimport EventHandler from './dom/event-handler.js'\nimport { defineJQueryPlugin } from './util/index.js'\n\n/**\n * Constants\n */\n\nconst NAME = 'button'\nconst DATA_KEY = 'bs.button'\nconst EVENT_KEY = `.${DATA_KEY}`\nconst DATA_API_KEY = '.data-api'\n\nconst CLASS_NAME_ACTIVE = 'active'\nconst SELECTOR_DATA_TOGGLE = '[data-bs-toggle=\"button\"]'\nconst EVENT_CLICK_DATA_API = `click${EVENT_KEY}${DATA_API_KEY}`\n\n/**\n * Class definition\n */\n\nclass Button extends BaseComponent {\n  // Getters\n  static get NAME() {\n    return NAME\n  }\n\n  // Public\n  toggle() {\n    // Toggle class and sync the `aria-pressed` attribute with the return value of the `.toggle()` method\n    this._element.setAttribute('aria-pressed', this._element.classList.toggle(CLASS_NAME_ACTIVE))\n  }\n\n  // Static\n  static jQueryInterface(config) {\n    return this.each(function () {\n      const data = Button.getOrCreateInstance(this)\n\n      if (config === 'toggle') {\n        data[config]()\n      }\n    })\n  }\n}\n\n/**\n * Data API implementation\n */\n\nEventHandler.on(document, EVENT_CLICK_DATA_API, SELECTOR_DATA_TOGGLE, event => {\n  event.preventDefault()\n\n  const button = event.target.closest(SELECTOR_DATA_TOGGLE)\n  const data = Button.getOrCreateInstance(button)\n\n  data.toggle()\n})\n\n/**\n * jQuery\n */\n\ndefineJQueryPlugin(Button)\n\nexport default Button\n","/**\n * --------------------------------------------------------------------------\n * Bootstrap util/swipe.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\nimport EventHandler from '../dom/event-handler.js'\nimport Config from './config.js'\nimport { execute } from './index.js'\n\n/**\n * Constants\n */\n\nconst NAME = 'swipe'\nconst EVENT_KEY = '.bs.swipe'\nconst EVENT_TOUCHSTART = `touchstart${EVENT_KEY}`\nconst EVENT_TOUCHMOVE = `touchmove${EVENT_KEY}`\nconst EVENT_TOUCHEND = `touchend${EVENT_KEY}`\nconst EVENT_POINTERDOWN = `pointerdown${EVENT_KEY}`\nconst EVENT_POINTERUP = `pointerup${EVENT_KEY}`\nconst POINTER_TYPE_TOUCH = 'touch'\nconst POINTER_TYPE_PEN = 'pen'\nconst CLASS_NAME_POINTER_EVENT = 'pointer-event'\nconst SWIPE_THRESHOLD = 40\n\nconst Default = {\n  endCallback: null,\n  leftCallback: null,\n  rightCallback: null\n}\n\nconst DefaultType = {\n  endCallback: '(function|null)',\n  leftCallback: '(function|null)',\n  rightCallback: '(function|null)'\n}\n\n/**\n * Class definition\n */\n\nclass Swipe extends Config {\n  constructor(element, config) {\n    super()\n    this._element = element\n\n    if (!element || !Swipe.isSupported()) {\n      return\n    }\n\n    this._config = this._getConfig(config)\n    this._deltaX = 0\n    this._supportPointerEvents = Boolean(window.PointerEvent)\n    this._initEvents()\n  }\n\n  // Getters\n  static get Default() {\n    return Default\n  }\n\n  static get DefaultType() {\n    return DefaultType\n  }\n\n  static get NAME() {\n    return NAME\n  }\n\n  // Public\n  dispose() {\n    EventHandler.off(this._element, EVENT_KEY)\n  }\n\n  // Private\n  _start(event) {\n    if (!this._supportPointerEvents) {\n      this._deltaX = event.touches[0].clientX\n\n      return\n    }\n\n    if (this._eventIsPointerPenTouch(event)) {\n      this._deltaX = event.clientX\n    }\n  }\n\n  _end(event) {\n    if (this._eventIsPointerPenTouch(event)) {\n      this._deltaX = event.clientX - this._deltaX\n    }\n\n    this._handleSwipe()\n    execute(this._config.endCallback)\n  }\n\n  _move(event) {\n    this._deltaX = event.touches && event.touches.length > 1 ?\n      0 :\n      event.touches[0].clientX - this._deltaX\n  }\n\n  _handleSwipe() {\n    const absDeltaX = Math.abs(this._deltaX)\n\n    if (absDeltaX <= SWIPE_THRESHOLD) {\n      return\n    }\n\n    const direction = absDeltaX / this._deltaX\n\n    this._deltaX = 0\n\n    if (!direction) {\n      return\n    }\n\n    execute(direction > 0 ? this._config.rightCallback : this._config.leftCallback)\n  }\n\n  _initEvents() {\n    if (this._supportPointerEvents) {\n      EventHandler.on(this._element, EVENT_POINTERDOWN, event => this._start(event))\n      EventHandler.on(this._element, EVENT_POINTERUP, event => this._end(event))\n\n      this._element.classList.add(CLASS_NAME_POINTER_EVENT)\n    } else {\n      EventHandler.on(this._element, EVENT_TOUCHSTART, event => this._start(event))\n      EventHandler.on(this._element, EVENT_TOUCHMOVE, event => this._move(event))\n      EventHandler.on(this._element, EVENT_TOUCHEND, event => this._end(event))\n    }\n  }\n\n  _eventIsPointerPenTouch(event) {\n    return this._supportPointerEvents && (event.pointerType === POINTER_TYPE_PEN || event.pointerType === POINTER_TYPE_TOUCH)\n  }\n\n  // Static\n  static isSupported() {\n    return 'ontouchstart' in document.documentElement || navigator.maxTouchPoints > 0\n  }\n}\n\nexport default Swipe\n","/**\n * --------------------------------------------------------------------------\n * Bootstrap carousel.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\nimport BaseComponent from './base-component.js'\nimport EventHandler from './dom/event-handler.js'\nimport Manipulator from './dom/manipulator.js'\nimport SelectorEngine from './dom/selector-engine.js'\nimport {\n  defineJQueryPlugin,\n  getNextActiveElement,\n  isRTL,\n  isVisible,\n  reflow,\n  triggerTransitionEnd\n} from './util/index.js'\nimport Swipe from './util/swipe.js'\n\n/**\n * Constants\n */\n\nconst NAME = 'carousel'\nconst DATA_KEY = 'bs.carousel'\nconst EVENT_KEY = `.${DATA_KEY}`\nconst DATA_API_KEY = '.data-api'\n\nconst ARROW_LEFT_KEY = 'ArrowLeft'\nconst ARROW_RIGHT_KEY = 'ArrowRight'\nconst TOUCHEVENT_COMPAT_WAIT = 500 // Time for mouse compat events to fire after touch\n\nconst ORDER_NEXT = 'next'\nconst ORDER_PREV = 'prev'\nconst DIRECTION_LEFT = 'left'\nconst DIRECTION_RIGHT = 'right'\n\nconst EVENT_SLIDE = `slide${EVENT_KEY}`\nconst EVENT_SLID = `slid${EVENT_KEY}`\nconst EVENT_KEYDOWN = `keydown${EVENT_KEY}`\nconst EVENT_MOUSEENTER = `mouseenter${EVENT_KEY}`\nconst EVENT_MOUSELEAVE = `mouseleave${EVENT_KEY}`\nconst EVENT_DRAG_START = `dragstart${EVENT_KEY}`\nconst EVENT_LOAD_DATA_API = `load${EVENT_KEY}${DATA_API_KEY}`\nconst EVENT_CLICK_DATA_API = `click${EVENT_KEY}${DATA_API_KEY}`\n\nconst CLASS_NAME_CAROUSEL = 'carousel'\nconst CLASS_NAME_ACTIVE = 'active'\nconst CLASS_NAME_SLIDE = 'slide'\nconst CLASS_NAME_END = 'carousel-item-end'\nconst CLASS_NAME_START = 'carousel-item-start'\nconst CLASS_NAME_NEXT = 'carousel-item-next'\nconst CLASS_NAME_PREV = 'carousel-item-prev'\n\nconst SELECTOR_ACTIVE = '.active'\nconst SELECTOR_ITEM = '.carousel-item'\nconst SELECTOR_ACTIVE_ITEM = SELECTOR_ACTIVE + SELECTOR_ITEM\nconst SELECTOR_ITEM_IMG = '.carousel-item img'\nconst SELECTOR_INDICATORS = '.carousel-indicators'\nconst SELECTOR_DATA_SLIDE = '[data-bs-slide], [data-bs-slide-to]'\nconst SELECTOR_DATA_RIDE = '[data-bs-ride=\"carousel\"]'\n\nconst KEY_TO_DIRECTION = {\n  [ARROW_LEFT_KEY]: DIRECTION_RIGHT,\n  [ARROW_RIGHT_KEY]: DIRECTION_LEFT\n}\n\nconst Default = {\n  interval: 5000,\n  keyboard: true,\n  pause: 'hover',\n  ride: false,\n  touch: true,\n  wrap: true\n}\n\nconst DefaultType = {\n  interval: '(number|boolean)', // TODO:v6 remove boolean support\n  keyboard: 'boolean',\n  pause: '(string|boolean)',\n  ride: '(boolean|string)',\n  touch: 'boolean',\n  wrap: 'boolean'\n}\n\n/**\n * Class definition\n */\n\nclass Carousel extends BaseComponent {\n  constructor(element, config) {\n    super(element, config)\n\n    this._interval = null\n    this._activeElement = null\n    this._isSliding = false\n    this.touchTimeout = null\n    this._swipeHelper = null\n\n    this._indicatorsElement = SelectorEngine.findOne(SELECTOR_INDICATORS, this._element)\n    this._addEventListeners()\n\n    if (this._config.ride === CLASS_NAME_CAROUSEL) {\n      this.cycle()\n    }\n  }\n\n  // Getters\n  static get Default() {\n    return Default\n  }\n\n  static get DefaultType() {\n    return DefaultType\n  }\n\n  static get NAME() {\n    return NAME\n  }\n\n  // Public\n  next() {\n    this._slide(ORDER_NEXT)\n  }\n\n  nextWhenVisible() {\n    // FIXME TODO use `document.visibilityState`\n    // Don't call next when the page isn't visible\n    // or the carousel or its parent isn't visible\n    if (!document.hidden && isVisible(this._element)) {\n      this.next()\n    }\n  }\n\n  prev() {\n    this._slide(ORDER_PREV)\n  }\n\n  pause() {\n    if (this._isSliding) {\n      triggerTransitionEnd(this._element)\n    }\n\n    this._clearInterval()\n  }\n\n  cycle() {\n    this._clearInterval()\n    this._updateInterval()\n\n    this._interval = setInterval(() => this.nextWhenVisible(), this._config.interval)\n  }\n\n  _maybeEnableCycle() {\n    if (!this._config.ride) {\n      return\n    }\n\n    if (this._isSliding) {\n      EventHandler.one(this._element, EVENT_SLID, () => this.cycle())\n      return\n    }\n\n    this.cycle()\n  }\n\n  to(index) {\n    const items = this._getItems()\n    if (index > items.length - 1 || index < 0) {\n      return\n    }\n\n    if (this._isSliding) {\n      EventHandler.one(this._element, EVENT_SLID, () => this.to(index))\n      return\n    }\n\n    const activeIndex = this._getItemIndex(this._getActive())\n    if (activeIndex === index) {\n      return\n    }\n\n    const order = index > activeIndex ? ORDER_NEXT : ORDER_PREV\n\n    this._slide(order, items[index])\n  }\n\n  dispose() {\n    if (this._swipeHelper) {\n      this._swipeHelper.dispose()\n    }\n\n    super.dispose()\n  }\n\n  // Private\n  _configAfterMerge(config) {\n    config.defaultInterval = config.interval\n    return config\n  }\n\n  _addEventListeners() {\n    if (this._config.keyboard) {\n      EventHandler.on(this._element, EVENT_KEYDOWN, event => this._keydown(event))\n    }\n\n    if (this._config.pause === 'hover') {\n      EventHandler.on(this._element, EVENT_MOUSEENTER, () => this.pause())\n      EventHandler.on(this._element, EVENT_MOUSELEAVE, () => this._maybeEnableCycle())\n    }\n\n    if (this._config.touch && Swipe.isSupported()) {\n      this._addTouchEventListeners()\n    }\n  }\n\n  _addTouchEventListeners() {\n    for (const img of SelectorEngine.find(SELECTOR_ITEM_IMG, this._element)) {\n      EventHandler.on(img, EVENT_DRAG_START, event => event.preventDefault())\n    }\n\n    const endCallBack = () => {\n      if (this._config.pause !== 'hover') {\n        return\n      }\n\n      // If it's a touch-enabled device, mouseenter/leave are fired as\n      // part of the mouse compatibility events on first tap - the carousel\n      // would stop cycling until user tapped out of it;\n      // here, we listen for touchend, explicitly pause the carousel\n      // (as if it's the second time we tap on it, mouseenter compat event\n      // is NOT fired) and after a timeout (to allow for mouse compatibility\n      // events to fire) we explicitly restart cycling\n\n      this.pause()\n      if (this.touchTimeout) {\n        clearTimeout(this.touchTimeout)\n      }\n\n      this.touchTimeout = setTimeout(() => this._maybeEnableCycle(), TOUCHEVENT_COMPAT_WAIT + this._config.interval)\n    }\n\n    const swipeConfig = {\n      leftCallback: () => this._slide(this._directionToOrder(DIRECTION_LEFT)),\n      rightCallback: () => this._slide(this._directionToOrder(DIRECTION_RIGHT)),\n      endCallback: endCallBack\n    }\n\n    this._swipeHelper = new Swipe(this._element, swipeConfig)\n  }\n\n  _keydown(event) {\n    if (/input|textarea/i.test(event.target.tagName)) {\n      return\n    }\n\n    const direction = KEY_TO_DIRECTION[event.key]\n    if (direction) {\n      event.preventDefault()\n      this._slide(this._directionToOrder(direction))\n    }\n  }\n\n  _getItemIndex(element) {\n    return this._getItems().indexOf(element)\n  }\n\n  _setActiveIndicatorElement(index) {\n    if (!this._indicatorsElement) {\n      return\n    }\n\n    const activeIndicator = SelectorEngine.findOne(SELECTOR_ACTIVE, this._indicatorsElement)\n\n    activeIndicator.classList.remove(CLASS_NAME_ACTIVE)\n    activeIndicator.removeAttribute('aria-current')\n\n    const newActiveIndicator = SelectorEngine.findOne(`[data-bs-slide-to=\"${index}\"]`, this._indicatorsElement)\n\n    if (newActiveIndicator) {\n      newActiveIndicator.classList.add(CLASS_NAME_ACTIVE)\n      newActiveIndicator.setAttribute('aria-current', 'true')\n    }\n  }\n\n  _updateInterval() {\n    const element = this._activeElement || this._getActive()\n\n    if (!element) {\n      return\n    }\n\n    const elementInterval = Number.parseInt(element.getAttribute('data-bs-interval'), 10)\n\n    this._config.interval = elementInterval || this._config.defaultInterval\n  }\n\n  _slide(order, element = null) {\n    if (this._isSliding) {\n      return\n    }\n\n    const activeElement = this._getActive()\n    const isNext = order === ORDER_NEXT\n    const nextElement = element || getNextActiveElement(this._getItems(), activeElement, isNext, this._config.wrap)\n\n    if (nextElement === activeElement) {\n      return\n    }\n\n    const nextElementIndex = this._getItemIndex(nextElement)\n\n    const triggerEvent = eventName => {\n      return EventHandler.trigger(this._element, eventName, {\n        relatedTarget: nextElement,\n        direction: this._orderToDirection(order),\n        from: this._getItemIndex(activeElement),\n        to: nextElementIndex\n      })\n    }\n\n    const slideEvent = triggerEvent(EVENT_SLIDE)\n\n    if (slideEvent.defaultPrevented) {\n      return\n    }\n\n    if (!activeElement || !nextElement) {\n      // Some weirdness is happening, so we bail\n      // TODO: change tests that use empty divs to avoid this check\n      return\n    }\n\n    const isCycling = Boolean(this._interval)\n    this.pause()\n\n    this._isSliding = true\n\n    this._setActiveIndicatorElement(nextElementIndex)\n    this._activeElement = nextElement\n\n    const directionalClassName = isNext ? CLASS_NAME_START : CLASS_NAME_END\n    const orderClassName = isNext ? CLASS_NAME_NEXT : CLASS_NAME_PREV\n\n    nextElement.classList.add(orderClassName)\n\n    reflow(nextElement)\n\n    activeElement.classList.add(directionalClassName)\n    nextElement.classList.add(directionalClassName)\n\n    const completeCallBack = () => {\n      nextElement.classList.remove(directionalClassName, orderClassName)\n      nextElement.classList.add(CLASS_NAME_ACTIVE)\n\n      activeElement.classList.remove(CLASS_NAME_ACTIVE, orderClassName, directionalClassName)\n\n      this._isSliding = false\n\n      triggerEvent(EVENT_SLID)\n    }\n\n    this._queueCallback(completeCallBack, activeElement, this._isAnimated())\n\n    if (isCycling) {\n      this.cycle()\n    }\n  }\n\n  _isAnimated() {\n    return this._element.classList.contains(CLASS_NAME_SLIDE)\n  }\n\n  _getActive() {\n    return SelectorEngine.findOne(SELECTOR_ACTIVE_ITEM, this._element)\n  }\n\n  _getItems() {\n    return SelectorEngine.find(SELECTOR_ITEM, this._element)\n  }\n\n  _clearInterval() {\n    if (this._interval) {\n      clearInterval(this._interval)\n      this._interval = null\n    }\n  }\n\n  _directionToOrder(direction) {\n    if (isRTL()) {\n      return direction === DIRECTION_LEFT ? ORDER_PREV : ORDER_NEXT\n    }\n\n    return direction === DIRECTION_LEFT ? ORDER_NEXT : ORDER_PREV\n  }\n\n  _orderToDirection(order) {\n    if (isRTL()) {\n      return order === ORDER_PREV ? DIRECTION_LEFT : DIRECTION_RIGHT\n    }\n\n    return order === ORDER_PREV ? DIRECTION_RIGHT : DIRECTION_LEFT\n  }\n\n  // Static\n  static jQueryInterface(config) {\n    return this.each(function () {\n      const data = Carousel.getOrCreateInstance(this, config)\n\n      if (typeof config === 'number') {\n        data.to(config)\n        return\n      }\n\n      if (typeof config === 'string') {\n        if (data[config] === undefined || config.startsWith('_') || config === 'constructor') {\n          throw new TypeError(`No method named \"${config}\"`)\n        }\n\n        data[config]()\n      }\n    })\n  }\n}\n\n/**\n * Data API implementation\n */\n\nEventHandler.on(document, EVENT_CLICK_DATA_API, SELECTOR_DATA_SLIDE, function (event) {\n  const target = SelectorEngine.getElementFromSelector(this)\n\n  if (!target || !target.classList.contains(CLASS_NAME_CAROUSEL)) {\n    return\n  }\n\n  event.preventDefault()\n\n  const carousel = Carousel.getOrCreateInstance(target)\n  const slideIndex = this.getAttribute('data-bs-slide-to')\n\n  if (slideIndex) {\n    carousel.to(slideIndex)\n    carousel._maybeEnableCycle()\n    return\n  }\n\n  if (Manipulator.getDataAttribute(this, 'slide') === 'next') {\n    carousel.next()\n    carousel._maybeEnableCycle()\n    return\n  }\n\n  carousel.prev()\n  carousel._maybeEnableCycle()\n})\n\nEventHandler.on(window, EVENT_LOAD_DATA_API, () => {\n  const carousels = SelectorEngine.find(SELECTOR_DATA_RIDE)\n\n  for (const carousel of carousels) {\n    Carousel.getOrCreateInstance(carousel)\n  }\n})\n\n/**\n * jQuery\n */\n\ndefineJQueryPlugin(Carousel)\n\nexport default Carousel\n","/**\n * --------------------------------------------------------------------------\n * Bootstrap collapse.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\nimport BaseComponent from './base-component.js'\nimport EventHandler from './dom/event-handler.js'\nimport SelectorEngine from './dom/selector-engine.js'\nimport {\n  defineJQueryPlugin,\n  getElement,\n  reflow\n} from './util/index.js'\n\n/**\n * Constants\n */\n\nconst NAME = 'collapse'\nconst DATA_KEY = 'bs.collapse'\nconst EVENT_KEY = `.${DATA_KEY}`\nconst DATA_API_KEY = '.data-api'\n\nconst EVENT_SHOW = `show${EVENT_KEY}`\nconst EVENT_SHOWN = `shown${EVENT_KEY}`\nconst EVENT_HIDE = `hide${EVENT_KEY}`\nconst EVENT_HIDDEN = `hidden${EVENT_KEY}`\nconst EVENT_CLICK_DATA_API = `click${EVENT_KEY}${DATA_API_KEY}`\n\nconst CLASS_NAME_SHOW = 'show'\nconst CLASS_NAME_COLLAPSE = 'collapse'\nconst CLASS_NAME_COLLAPSING = 'collapsing'\nconst CLASS_NAME_COLLAPSED = 'collapsed'\nconst CLASS_NAME_DEEPER_CHILDREN = `:scope .${CLASS_NAME_COLLAPSE} .${CLASS_NAME_COLLAPSE}`\nconst CLASS_NAME_HORIZONTAL = 'collapse-horizontal'\n\nconst WIDTH = 'width'\nconst HEIGHT = 'height'\n\nconst SELECTOR_ACTIVES = '.collapse.show, .collapse.collapsing'\nconst SELECTOR_DATA_TOGGLE = '[data-bs-toggle=\"collapse\"]'\n\nconst Default = {\n  parent: null,\n  toggle: true\n}\n\nconst DefaultType = {\n  parent: '(null|element)',\n  toggle: 'boolean'\n}\n\n/**\n * Class definition\n */\n\nclass Collapse extends BaseComponent {\n  constructor(element, config) {\n    super(element, config)\n\n    this._isTransitioning = false\n    this._triggerArray = []\n\n    const toggleList = SelectorEngine.find(SELECTOR_DATA_TOGGLE)\n\n    for (const elem of toggleList) {\n      const selector = SelectorEngine.getSelectorFromElement(elem)\n      const filterElement = SelectorEngine.find(selector)\n        .filter(foundElement => foundElement === this._element)\n\n      if (selector !== null && filterElement.length) {\n        this._triggerArray.push(elem)\n      }\n    }\n\n    this._initializeChildren()\n\n    if (!this._config.parent) {\n      this._addAriaAndCollapsedClass(this._triggerArray, this._isShown())\n    }\n\n    if (this._config.toggle) {\n      this.toggle()\n    }\n  }\n\n  // Getters\n  static get Default() {\n    return Default\n  }\n\n  static get DefaultType() {\n    return DefaultType\n  }\n\n  static get NAME() {\n    return NAME\n  }\n\n  // Public\n  toggle() {\n    if (this._isShown()) {\n      this.hide()\n    } else {\n      this.show()\n    }\n  }\n\n  show() {\n    if (this._isTransitioning || this._isShown()) {\n      return\n    }\n\n    let activeChildren = []\n\n    // find active children\n    if (this._config.parent) {\n      activeChildren = this._getFirstLevelChildren(SELECTOR_ACTIVES)\n        .filter(element => element !== this._element)\n        .map(element => Collapse.getOrCreateInstance(element, { toggle: false }))\n    }\n\n    if (activeChildren.length && activeChildren[0]._isTransitioning) {\n      return\n    }\n\n    const startEvent = EventHandler.trigger(this._element, EVENT_SHOW)\n    if (startEvent.defaultPrevented) {\n      return\n    }\n\n    for (const activeInstance of activeChildren) {\n      activeInstance.hide()\n    }\n\n    const dimension = this._getDimension()\n\n    this._element.classList.remove(CLASS_NAME_COLLAPSE)\n    this._element.classList.add(CLASS_NAME_COLLAPSING)\n\n    this._element.style[dimension] = 0\n\n    this._addAriaAndCollapsedClass(this._triggerArray, true)\n    this._isTransitioning = true\n\n    const complete = () => {\n      this._isTransitioning = false\n\n      this._element.classList.remove(CLASS_NAME_COLLAPSING)\n      this._element.classList.add(CLASS_NAME_COLLAPSE, CLASS_NAME_SHOW)\n\n      this._element.style[dimension] = ''\n\n      EventHandler.trigger(this._element, EVENT_SHOWN)\n    }\n\n    const capitalizedDimension = dimension[0].toUpperCase() + dimension.slice(1)\n    const scrollSize = `scroll${capitalizedDimension}`\n\n    this._queueCallback(complete, this._element, true)\n    this._element.style[dimension] = `${this._element[scrollSize]}px`\n  }\n\n  hide() {\n    if (this._isTransitioning || !this._isShown()) {\n      return\n    }\n\n    const startEvent = EventHandler.trigger(this._element, EVENT_HIDE)\n    if (startEvent.defaultPrevented) {\n      return\n    }\n\n    const dimension = this._getDimension()\n\n    this._element.style[dimension] = `${this._element.getBoundingClientRect()[dimension]}px`\n\n    reflow(this._element)\n\n    this._element.classList.add(CLASS_NAME_COLLAPSING)\n    this._element.classList.remove(CLASS_NAME_COLLAPSE, CLASS_NAME_SHOW)\n\n    for (const trigger of this._triggerArray) {\n      const element = SelectorEngine.getElementFromSelector(trigger)\n\n      if (element && !this._isShown(element)) {\n        this._addAriaAndCollapsedClass([trigger], false)\n      }\n    }\n\n    this._isTransitioning = true\n\n    const complete = () => {\n      this._isTransitioning = false\n      this._element.classList.remove(CLASS_NAME_COLLAPSING)\n      this._element.classList.add(CLASS_NAME_COLLAPSE)\n      EventHandler.trigger(this._element, EVENT_HIDDEN)\n    }\n\n    this._element.style[dimension] = ''\n\n    this._queueCallback(complete, this._element, true)\n  }\n\n  _isShown(element = this._element) {\n    return element.classList.contains(CLASS_NAME_SHOW)\n  }\n\n  // Private\n  _configAfterMerge(config) {\n    config.toggle = Boolean(config.toggle) // Coerce string values\n    config.parent = getElement(config.parent)\n    return config\n  }\n\n  _getDimension() {\n    return this._element.classList.contains(CLASS_NAME_HORIZONTAL) ? WIDTH : HEIGHT\n  }\n\n  _initializeChildren() {\n    if (!this._config.parent) {\n      return\n    }\n\n    const children = this._getFirstLevelChildren(SELECTOR_DATA_TOGGLE)\n\n    for (const element of children) {\n      const selected = SelectorEngine.getElementFromSelector(element)\n\n      if (selected) {\n        this._addAriaAndCollapsedClass([element], this._isShown(selected))\n      }\n    }\n  }\n\n  _getFirstLevelChildren(selector) {\n    const children = SelectorEngine.find(CLASS_NAME_DEEPER_CHILDREN, this._config.parent)\n    // remove children if greater depth\n    return SelectorEngine.find(selector, this._config.parent).filter(element => !children.includes(element))\n  }\n\n  _addAriaAndCollapsedClass(triggerArray, isOpen) {\n    if (!triggerArray.length) {\n      return\n    }\n\n    for (const element of triggerArray) {\n      element.classList.toggle(CLASS_NAME_COLLAPSED, !isOpen)\n      element.setAttribute('aria-expanded', isOpen)\n    }\n  }\n\n  // Static\n  static jQueryInterface(config) {\n    const _config = {}\n    if (typeof config === 'string' && /show|hide/.test(config)) {\n      _config.toggle = false\n    }\n\n    return this.each(function () {\n      const data = Collapse.getOrCreateInstance(this, _config)\n\n      if (typeof config === 'string') {\n        if (typeof data[config] === 'undefined') {\n          throw new TypeError(`No method named \"${config}\"`)\n        }\n\n        data[config]()\n      }\n    })\n  }\n}\n\n/**\n * Data API implementation\n */\n\nEventHandler.on(document, EVENT_CLICK_DATA_API, SELECTOR_DATA_TOGGLE, function (event) {\n  // preventDefault only for  elements (which change the URL) not inside the collapsible element\n  if (event.target.tagName === 'A' || (event.delegateTarget && event.delegateTarget.tagName === 'A')) {\n    event.preventDefault()\n  }\n\n  for (const element of SelectorEngine.getMultipleElementsFromSelector(this)) {\n    Collapse.getOrCreateInstance(element, { toggle: false }).toggle()\n  }\n})\n\n/**\n * jQuery\n */\n\ndefineJQueryPlugin(Collapse)\n\nexport default Collapse\n","export var top = 'top';\nexport var bottom = 'bottom';\nexport var right = 'right';\nexport var left = 'left';\nexport var auto = 'auto';\nexport var basePlacements = [top, bottom, right, left];\nexport var start = 'start';\nexport var end = 'end';\nexport var clippingParents = 'clippingParents';\nexport var viewport = 'viewport';\nexport var popper = 'popper';\nexport var reference = 'reference';\nexport var variationPlacements = /*#__PURE__*/basePlacements.reduce(function (acc, placement) {\n  return acc.concat([placement + \"-\" + start, placement + \"-\" + end]);\n}, []);\nexport var placements = /*#__PURE__*/[].concat(basePlacements, [auto]).reduce(function (acc, placement) {\n  return acc.concat([placement, placement + \"-\" + start, placement + \"-\" + end]);\n}, []); // modifiers that need to read the DOM\n\nexport var beforeRead = 'beforeRead';\nexport var read = 'read';\nexport var afterRead = 'afterRead'; // pure-logic modifiers\n\nexport var beforeMain = 'beforeMain';\nexport var main = 'main';\nexport var afterMain = 'afterMain'; // modifier with the purpose to write to the DOM (or write into a framework state)\n\nexport var beforeWrite = 'beforeWrite';\nexport var write = 'write';\nexport var afterWrite = 'afterWrite';\nexport var modifierPhases = [beforeRead, read, afterRead, beforeMain, main, afterMain, beforeWrite, write, afterWrite];","export default function getNodeName(element) {\n  return element ? (element.nodeName || '').toLowerCase() : null;\n}","export default function getWindow(node) {\n  if (node == null) {\n    return window;\n  }\n\n  if (node.toString() !== '[object Window]') {\n    var ownerDocument = node.ownerDocument;\n    return ownerDocument ? ownerDocument.defaultView || window : window;\n  }\n\n  return node;\n}","import getWindow from \"./getWindow.js\";\n\nfunction isElement(node) {\n  var OwnElement = getWindow(node).Element;\n  return node instanceof OwnElement || node instanceof Element;\n}\n\nfunction isHTMLElement(node) {\n  var OwnElement = getWindow(node).HTMLElement;\n  return node instanceof OwnElement || node instanceof HTMLElement;\n}\n\nfunction isShadowRoot(node) {\n  // IE 11 has no ShadowRoot\n  if (typeof ShadowRoot === 'undefined') {\n    return false;\n  }\n\n  var OwnElement = getWindow(node).ShadowRoot;\n  return node instanceof OwnElement || node instanceof ShadowRoot;\n}\n\nexport { isElement, isHTMLElement, isShadowRoot };","import getNodeName from \"../dom-utils/getNodeName.js\";\nimport { isHTMLElement } from \"../dom-utils/instanceOf.js\"; // This modifier takes the styles prepared by the `computeStyles` modifier\n// and applies them to the HTMLElements such as popper and arrow\n\nfunction applyStyles(_ref) {\n  var state = _ref.state;\n  Object.keys(state.elements).forEach(function (name) {\n    var style = state.styles[name] || {};\n    var attributes = state.attributes[name] || {};\n    var element = state.elements[name]; // arrow is optional + virtual elements\n\n    if (!isHTMLElement(element) || !getNodeName(element)) {\n      return;\n    } // Flow doesn't support to extend this property, but it's the most\n    // effective way to apply styles to an HTMLElement\n    // $FlowFixMe[cannot-write]\n\n\n    Object.assign(element.style, style);\n    Object.keys(attributes).forEach(function (name) {\n      var value = attributes[name];\n\n      if (value === false) {\n        element.removeAttribute(name);\n      } else {\n        element.setAttribute(name, value === true ? '' : value);\n      }\n    });\n  });\n}\n\nfunction effect(_ref2) {\n  var state = _ref2.state;\n  var initialStyles = {\n    popper: {\n      position: state.options.strategy,\n      left: '0',\n      top: '0',\n      margin: '0'\n    },\n    arrow: {\n      position: 'absolute'\n    },\n    reference: {}\n  };\n  Object.assign(state.elements.popper.style, initialStyles.popper);\n  state.styles = initialStyles;\n\n  if (state.elements.arrow) {\n    Object.assign(state.elements.arrow.style, initialStyles.arrow);\n  }\n\n  return function () {\n    Object.keys(state.elements).forEach(function (name) {\n      var element = state.elements[name];\n      var attributes = state.attributes[name] || {};\n      var styleProperties = Object.keys(state.styles.hasOwnProperty(name) ? state.styles[name] : initialStyles[name]); // Set all values to an empty string to unset them\n\n      var style = styleProperties.reduce(function (style, property) {\n        style[property] = '';\n        return style;\n      }, {}); // arrow is optional + virtual elements\n\n      if (!isHTMLElement(element) || !getNodeName(element)) {\n        return;\n      }\n\n      Object.assign(element.style, style);\n      Object.keys(attributes).forEach(function (attribute) {\n        element.removeAttribute(attribute);\n      });\n    });\n  };\n} // eslint-disable-next-line import/no-unused-modules\n\n\nexport default {\n  name: 'applyStyles',\n  enabled: true,\n  phase: 'write',\n  fn: applyStyles,\n  effect: effect,\n  requires: ['computeStyles']\n};","import { auto } from \"../enums.js\";\nexport default function getBasePlacement(placement) {\n  return placement.split('-')[0];\n}","export var max = Math.max;\nexport var min = Math.min;\nexport var round = Math.round;","export default function getUAString() {\n  var uaData = navigator.userAgentData;\n\n  if (uaData != null && uaData.brands && Array.isArray(uaData.brands)) {\n    return uaData.brands.map(function (item) {\n      return item.brand + \"/\" + item.version;\n    }).join(' ');\n  }\n\n  return navigator.userAgent;\n}","import getUAString from \"../utils/userAgent.js\";\nexport default function isLayoutViewport() {\n  return !/^((?!chrome|android).)*safari/i.test(getUAString());\n}","import { isElement, isHTMLElement } from \"./instanceOf.js\";\nimport { round } from \"../utils/math.js\";\nimport getWindow from \"./getWindow.js\";\nimport isLayoutViewport from \"./isLayoutViewport.js\";\nexport default function getBoundingClientRect(element, includeScale, isFixedStrategy) {\n  if (includeScale === void 0) {\n    includeScale = false;\n  }\n\n  if (isFixedStrategy === void 0) {\n    isFixedStrategy = false;\n  }\n\n  var clientRect = element.getBoundingClientRect();\n  var scaleX = 1;\n  var scaleY = 1;\n\n  if (includeScale && isHTMLElement(element)) {\n    scaleX = element.offsetWidth > 0 ? round(clientRect.width) / element.offsetWidth || 1 : 1;\n    scaleY = element.offsetHeight > 0 ? round(clientRect.height) / element.offsetHeight || 1 : 1;\n  }\n\n  var _ref = isElement(element) ? getWindow(element) : window,\n      visualViewport = _ref.visualViewport;\n\n  var addVisualOffsets = !isLayoutViewport() && isFixedStrategy;\n  var x = (clientRect.left + (addVisualOffsets && visualViewport ? visualViewport.offsetLeft : 0)) / scaleX;\n  var y = (clientRect.top + (addVisualOffsets && visualViewport ? visualViewport.offsetTop : 0)) / scaleY;\n  var width = clientRect.width / scaleX;\n  var height = clientRect.height / scaleY;\n  return {\n    width: width,\n    height: height,\n    top: y,\n    right: x + width,\n    bottom: y + height,\n    left: x,\n    x: x,\n    y: y\n  };\n}","import getBoundingClientRect from \"./getBoundingClientRect.js\"; // Returns the layout rect of an element relative to its offsetParent. Layout\n// means it doesn't take into account transforms.\n\nexport default function getLayoutRect(element) {\n  var clientRect = getBoundingClientRect(element); // Use the clientRect sizes if it's not been transformed.\n  // Fixes https://github.com/popperjs/popper-core/issues/1223\n\n  var width = element.offsetWidth;\n  var height = element.offsetHeight;\n\n  if (Math.abs(clientRect.width - width) <= 1) {\n    width = clientRect.width;\n  }\n\n  if (Math.abs(clientRect.height - height) <= 1) {\n    height = clientRect.height;\n  }\n\n  return {\n    x: element.offsetLeft,\n    y: element.offsetTop,\n    width: width,\n    height: height\n  };\n}","import { isShadowRoot } from \"./instanceOf.js\";\nexport default function contains(parent, child) {\n  var rootNode = child.getRootNode && child.getRootNode(); // First, attempt with faster native method\n\n  if (parent.contains(child)) {\n    return true;\n  } // then fallback to custom implementation with Shadow DOM support\n  else if (rootNode && isShadowRoot(rootNode)) {\n      var next = child;\n\n      do {\n        if (next && parent.isSameNode(next)) {\n          return true;\n        } // $FlowFixMe[prop-missing]: need a better way to handle this...\n\n\n        next = next.parentNode || next.host;\n      } while (next);\n    } // Give up, the result is false\n\n\n  return false;\n}","import getWindow from \"./getWindow.js\";\nexport default function getComputedStyle(element) {\n  return getWindow(element).getComputedStyle(element);\n}","import getNodeName from \"./getNodeName.js\";\nexport default function isTableElement(element) {\n  return ['table', 'td', 'th'].indexOf(getNodeName(element)) >= 0;\n}","import { isElement } from \"./instanceOf.js\";\nexport default function getDocumentElement(element) {\n  // $FlowFixMe[incompatible-return]: assume body is always available\n  return ((isElement(element) ? element.ownerDocument : // $FlowFixMe[prop-missing]\n  element.document) || window.document).documentElement;\n}","import getNodeName from \"./getNodeName.js\";\nimport getDocumentElement from \"./getDocumentElement.js\";\nimport { isShadowRoot } from \"./instanceOf.js\";\nexport default function getParentNode(element) {\n  if (getNodeName(element) === 'html') {\n    return element;\n  }\n\n  return (// this is a quicker (but less type safe) way to save quite some bytes from the bundle\n    // $FlowFixMe[incompatible-return]\n    // $FlowFixMe[prop-missing]\n    element.assignedSlot || // step into the shadow DOM of the parent of a slotted node\n    element.parentNode || ( // DOM Element detected\n    isShadowRoot(element) ? element.host : null) || // ShadowRoot detected\n    // $FlowFixMe[incompatible-call]: HTMLElement is a Node\n    getDocumentElement(element) // fallback\n\n  );\n}","import getWindow from \"./getWindow.js\";\nimport getNodeName from \"./getNodeName.js\";\nimport getComputedStyle from \"./getComputedStyle.js\";\nimport { isHTMLElement, isShadowRoot } from \"./instanceOf.js\";\nimport isTableElement from \"./isTableElement.js\";\nimport getParentNode from \"./getParentNode.js\";\nimport getUAString from \"../utils/userAgent.js\";\n\nfunction getTrueOffsetParent(element) {\n  if (!isHTMLElement(element) || // https://github.com/popperjs/popper-core/issues/837\n  getComputedStyle(element).position === 'fixed') {\n    return null;\n  }\n\n  return element.offsetParent;\n} // `.offsetParent` reports `null` for fixed elements, while absolute elements\n// return the containing block\n\n\nfunction getContainingBlock(element) {\n  var isFirefox = /firefox/i.test(getUAString());\n  var isIE = /Trident/i.test(getUAString());\n\n  if (isIE && isHTMLElement(element)) {\n    // In IE 9, 10 and 11 fixed elements containing block is always established by the viewport\n    var elementCss = getComputedStyle(element);\n\n    if (elementCss.position === 'fixed') {\n      return null;\n    }\n  }\n\n  var currentNode = getParentNode(element);\n\n  if (isShadowRoot(currentNode)) {\n    currentNode = currentNode.host;\n  }\n\n  while (isHTMLElement(currentNode) && ['html', 'body'].indexOf(getNodeName(currentNode)) < 0) {\n    var css = getComputedStyle(currentNode); // This is non-exhaustive but covers the most common CSS properties that\n    // create a containing block.\n    // https://developer.mozilla.org/en-US/docs/Web/CSS/Containing_block#identifying_the_containing_block\n\n    if (css.transform !== 'none' || css.perspective !== 'none' || css.contain === 'paint' || ['transform', 'perspective'].indexOf(css.willChange) !== -1 || isFirefox && css.willChange === 'filter' || isFirefox && css.filter && css.filter !== 'none') {\n      return currentNode;\n    } else {\n      currentNode = currentNode.parentNode;\n    }\n  }\n\n  return null;\n} // Gets the closest ancestor positioned element. Handles some edge cases,\n// such as table ancestors and cross browser bugs.\n\n\nexport default function getOffsetParent(element) {\n  var window = getWindow(element);\n  var offsetParent = getTrueOffsetParent(element);\n\n  while (offsetParent && isTableElement(offsetParent) && getComputedStyle(offsetParent).position === 'static') {\n    offsetParent = getTrueOffsetParent(offsetParent);\n  }\n\n  if (offsetParent && (getNodeName(offsetParent) === 'html' || getNodeName(offsetParent) === 'body' && getComputedStyle(offsetParent).position === 'static')) {\n    return window;\n  }\n\n  return offsetParent || getContainingBlock(element) || window;\n}","export default function getMainAxisFromPlacement(placement) {\n  return ['top', 'bottom'].indexOf(placement) >= 0 ? 'x' : 'y';\n}","import { max as mathMax, min as mathMin } from \"./math.js\";\nexport function within(min, value, max) {\n  return mathMax(min, mathMin(value, max));\n}\nexport function withinMaxClamp(min, value, max) {\n  var v = within(min, value, max);\n  return v > max ? max : v;\n}","import getFreshSideObject from \"./getFreshSideObject.js\";\nexport default function mergePaddingObject(paddingObject) {\n  return Object.assign({}, getFreshSideObject(), paddingObject);\n}","export default function getFreshSideObject() {\n  return {\n    top: 0,\n    right: 0,\n    bottom: 0,\n    left: 0\n  };\n}","export default function expandToHashMap(value, keys) {\n  return keys.reduce(function (hashMap, key) {\n    hashMap[key] = value;\n    return hashMap;\n  }, {});\n}","import getBasePlacement from \"../utils/getBasePlacement.js\";\nimport getLayoutRect from \"../dom-utils/getLayoutRect.js\";\nimport contains from \"../dom-utils/contains.js\";\nimport getOffsetParent from \"../dom-utils/getOffsetParent.js\";\nimport getMainAxisFromPlacement from \"../utils/getMainAxisFromPlacement.js\";\nimport { within } from \"../utils/within.js\";\nimport mergePaddingObject from \"../utils/mergePaddingObject.js\";\nimport expandToHashMap from \"../utils/expandToHashMap.js\";\nimport { left, right, basePlacements, top, bottom } from \"../enums.js\"; // eslint-disable-next-line import/no-unused-modules\n\nvar toPaddingObject = function toPaddingObject(padding, state) {\n  padding = typeof padding === 'function' ? padding(Object.assign({}, state.rects, {\n    placement: state.placement\n  })) : padding;\n  return mergePaddingObject(typeof padding !== 'number' ? padding : expandToHashMap(padding, basePlacements));\n};\n\nfunction arrow(_ref) {\n  var _state$modifiersData$;\n\n  var state = _ref.state,\n      name = _ref.name,\n      options = _ref.options;\n  var arrowElement = state.elements.arrow;\n  var popperOffsets = state.modifiersData.popperOffsets;\n  var basePlacement = getBasePlacement(state.placement);\n  var axis = getMainAxisFromPlacement(basePlacement);\n  var isVertical = [left, right].indexOf(basePlacement) >= 0;\n  var len = isVertical ? 'height' : 'width';\n\n  if (!arrowElement || !popperOffsets) {\n    return;\n  }\n\n  var paddingObject = toPaddingObject(options.padding, state);\n  var arrowRect = getLayoutRect(arrowElement);\n  var minProp = axis === 'y' ? top : left;\n  var maxProp = axis === 'y' ? bottom : right;\n  var endDiff = state.rects.reference[len] + state.rects.reference[axis] - popperOffsets[axis] - state.rects.popper[len];\n  var startDiff = popperOffsets[axis] - state.rects.reference[axis];\n  var arrowOffsetParent = getOffsetParent(arrowElement);\n  var clientSize = arrowOffsetParent ? axis === 'y' ? arrowOffsetParent.clientHeight || 0 : arrowOffsetParent.clientWidth || 0 : 0;\n  var centerToReference = endDiff / 2 - startDiff / 2; // Make sure the arrow doesn't overflow the popper if the center point is\n  // outside of the popper bounds\n\n  var min = paddingObject[minProp];\n  var max = clientSize - arrowRect[len] - paddingObject[maxProp];\n  var center = clientSize / 2 - arrowRect[len] / 2 + centerToReference;\n  var offset = within(min, center, max); // Prevents breaking syntax highlighting...\n\n  var axisProp = axis;\n  state.modifiersData[name] = (_state$modifiersData$ = {}, _state$modifiersData$[axisProp] = offset, _state$modifiersData$.centerOffset = offset - center, _state$modifiersData$);\n}\n\nfunction effect(_ref2) {\n  var state = _ref2.state,\n      options = _ref2.options;\n  var _options$element = options.element,\n      arrowElement = _options$element === void 0 ? '[data-popper-arrow]' : _options$element;\n\n  if (arrowElement == null) {\n    return;\n  } // CSS selector\n\n\n  if (typeof arrowElement === 'string') {\n    arrowElement = state.elements.popper.querySelector(arrowElement);\n\n    if (!arrowElement) {\n      return;\n    }\n  }\n\n  if (!contains(state.elements.popper, arrowElement)) {\n    return;\n  }\n\n  state.elements.arrow = arrowElement;\n} // eslint-disable-next-line import/no-unused-modules\n\n\nexport default {\n  name: 'arrow',\n  enabled: true,\n  phase: 'main',\n  fn: arrow,\n  effect: effect,\n  requires: ['popperOffsets'],\n  requiresIfExists: ['preventOverflow']\n};","export default function getVariation(placement) {\n  return placement.split('-')[1];\n}","import { top, left, right, bottom, end } from \"../enums.js\";\nimport getOffsetParent from \"../dom-utils/getOffsetParent.js\";\nimport getWindow from \"../dom-utils/getWindow.js\";\nimport getDocumentElement from \"../dom-utils/getDocumentElement.js\";\nimport getComputedStyle from \"../dom-utils/getComputedStyle.js\";\nimport getBasePlacement from \"../utils/getBasePlacement.js\";\nimport getVariation from \"../utils/getVariation.js\";\nimport { round } from \"../utils/math.js\"; // eslint-disable-next-line import/no-unused-modules\n\nvar unsetSides = {\n  top: 'auto',\n  right: 'auto',\n  bottom: 'auto',\n  left: 'auto'\n}; // Round the offsets to the nearest suitable subpixel based on the DPR.\n// Zooming can change the DPR, but it seems to report a value that will\n// cleanly divide the values into the appropriate subpixels.\n\nfunction roundOffsetsByDPR(_ref, win) {\n  var x = _ref.x,\n      y = _ref.y;\n  var dpr = win.devicePixelRatio || 1;\n  return {\n    x: round(x * dpr) / dpr || 0,\n    y: round(y * dpr) / dpr || 0\n  };\n}\n\nexport function mapToStyles(_ref2) {\n  var _Object$assign2;\n\n  var popper = _ref2.popper,\n      popperRect = _ref2.popperRect,\n      placement = _ref2.placement,\n      variation = _ref2.variation,\n      offsets = _ref2.offsets,\n      position = _ref2.position,\n      gpuAcceleration = _ref2.gpuAcceleration,\n      adaptive = _ref2.adaptive,\n      roundOffsets = _ref2.roundOffsets,\n      isFixed = _ref2.isFixed;\n  var _offsets$x = offsets.x,\n      x = _offsets$x === void 0 ? 0 : _offsets$x,\n      _offsets$y = offsets.y,\n      y = _offsets$y === void 0 ? 0 : _offsets$y;\n\n  var _ref3 = typeof roundOffsets === 'function' ? roundOffsets({\n    x: x,\n    y: y\n  }) : {\n    x: x,\n    y: y\n  };\n\n  x = _ref3.x;\n  y = _ref3.y;\n  var hasX = offsets.hasOwnProperty('x');\n  var hasY = offsets.hasOwnProperty('y');\n  var sideX = left;\n  var sideY = top;\n  var win = window;\n\n  if (adaptive) {\n    var offsetParent = getOffsetParent(popper);\n    var heightProp = 'clientHeight';\n    var widthProp = 'clientWidth';\n\n    if (offsetParent === getWindow(popper)) {\n      offsetParent = getDocumentElement(popper);\n\n      if (getComputedStyle(offsetParent).position !== 'static' && position === 'absolute') {\n        heightProp = 'scrollHeight';\n        widthProp = 'scrollWidth';\n      }\n    } // $FlowFixMe[incompatible-cast]: force type refinement, we compare offsetParent with window above, but Flow doesn't detect it\n\n\n    offsetParent = offsetParent;\n\n    if (placement === top || (placement === left || placement === right) && variation === end) {\n      sideY = bottom;\n      var offsetY = isFixed && offsetParent === win && win.visualViewport ? win.visualViewport.height : // $FlowFixMe[prop-missing]\n      offsetParent[heightProp];\n      y -= offsetY - popperRect.height;\n      y *= gpuAcceleration ? 1 : -1;\n    }\n\n    if (placement === left || (placement === top || placement === bottom) && variation === end) {\n      sideX = right;\n      var offsetX = isFixed && offsetParent === win && win.visualViewport ? win.visualViewport.width : // $FlowFixMe[prop-missing]\n      offsetParent[widthProp];\n      x -= offsetX - popperRect.width;\n      x *= gpuAcceleration ? 1 : -1;\n    }\n  }\n\n  var commonStyles = Object.assign({\n    position: position\n  }, adaptive && unsetSides);\n\n  var _ref4 = roundOffsets === true ? roundOffsetsByDPR({\n    x: x,\n    y: y\n  }, getWindow(popper)) : {\n    x: x,\n    y: y\n  };\n\n  x = _ref4.x;\n  y = _ref4.y;\n\n  if (gpuAcceleration) {\n    var _Object$assign;\n\n    return Object.assign({}, commonStyles, (_Object$assign = {}, _Object$assign[sideY] = hasY ? '0' : '', _Object$assign[sideX] = hasX ? '0' : '', _Object$assign.transform = (win.devicePixelRatio || 1) <= 1 ? \"translate(\" + x + \"px, \" + y + \"px)\" : \"translate3d(\" + x + \"px, \" + y + \"px, 0)\", _Object$assign));\n  }\n\n  return Object.assign({}, commonStyles, (_Object$assign2 = {}, _Object$assign2[sideY] = hasY ? y + \"px\" : '', _Object$assign2[sideX] = hasX ? x + \"px\" : '', _Object$assign2.transform = '', _Object$assign2));\n}\n\nfunction computeStyles(_ref5) {\n  var state = _ref5.state,\n      options = _ref5.options;\n  var _options$gpuAccelerat = options.gpuAcceleration,\n      gpuAcceleration = _options$gpuAccelerat === void 0 ? true : _options$gpuAccelerat,\n      _options$adaptive = options.adaptive,\n      adaptive = _options$adaptive === void 0 ? true : _options$adaptive,\n      _options$roundOffsets = options.roundOffsets,\n      roundOffsets = _options$roundOffsets === void 0 ? true : _options$roundOffsets;\n  var commonStyles = {\n    placement: getBasePlacement(state.placement),\n    variation: getVariation(state.placement),\n    popper: state.elements.popper,\n    popperRect: state.rects.popper,\n    gpuAcceleration: gpuAcceleration,\n    isFixed: state.options.strategy === 'fixed'\n  };\n\n  if (state.modifiersData.popperOffsets != null) {\n    state.styles.popper = Object.assign({}, state.styles.popper, mapToStyles(Object.assign({}, commonStyles, {\n      offsets: state.modifiersData.popperOffsets,\n      position: state.options.strategy,\n      adaptive: adaptive,\n      roundOffsets: roundOffsets\n    })));\n  }\n\n  if (state.modifiersData.arrow != null) {\n    state.styles.arrow = Object.assign({}, state.styles.arrow, mapToStyles(Object.assign({}, commonStyles, {\n      offsets: state.modifiersData.arrow,\n      position: 'absolute',\n      adaptive: false,\n      roundOffsets: roundOffsets\n    })));\n  }\n\n  state.attributes.popper = Object.assign({}, state.attributes.popper, {\n    'data-popper-placement': state.placement\n  });\n} // eslint-disable-next-line import/no-unused-modules\n\n\nexport default {\n  name: 'computeStyles',\n  enabled: true,\n  phase: 'beforeWrite',\n  fn: computeStyles,\n  data: {}\n};","import getWindow from \"../dom-utils/getWindow.js\"; // eslint-disable-next-line import/no-unused-modules\n\nvar passive = {\n  passive: true\n};\n\nfunction effect(_ref) {\n  var state = _ref.state,\n      instance = _ref.instance,\n      options = _ref.options;\n  var _options$scroll = options.scroll,\n      scroll = _options$scroll === void 0 ? true : _options$scroll,\n      _options$resize = options.resize,\n      resize = _options$resize === void 0 ? true : _options$resize;\n  var window = getWindow(state.elements.popper);\n  var scrollParents = [].concat(state.scrollParents.reference, state.scrollParents.popper);\n\n  if (scroll) {\n    scrollParents.forEach(function (scrollParent) {\n      scrollParent.addEventListener('scroll', instance.update, passive);\n    });\n  }\n\n  if (resize) {\n    window.addEventListener('resize', instance.update, passive);\n  }\n\n  return function () {\n    if (scroll) {\n      scrollParents.forEach(function (scrollParent) {\n        scrollParent.removeEventListener('scroll', instance.update, passive);\n      });\n    }\n\n    if (resize) {\n      window.removeEventListener('resize', instance.update, passive);\n    }\n  };\n} // eslint-disable-next-line import/no-unused-modules\n\n\nexport default {\n  name: 'eventListeners',\n  enabled: true,\n  phase: 'write',\n  fn: function fn() {},\n  effect: effect,\n  data: {}\n};","var hash = {\n  left: 'right',\n  right: 'left',\n  bottom: 'top',\n  top: 'bottom'\n};\nexport default function getOppositePlacement(placement) {\n  return placement.replace(/left|right|bottom|top/g, function (matched) {\n    return hash[matched];\n  });\n}","var hash = {\n  start: 'end',\n  end: 'start'\n};\nexport default function getOppositeVariationPlacement(placement) {\n  return placement.replace(/start|end/g, function (matched) {\n    return hash[matched];\n  });\n}","import getWindow from \"./getWindow.js\";\nexport default function getWindowScroll(node) {\n  var win = getWindow(node);\n  var scrollLeft = win.pageXOffset;\n  var scrollTop = win.pageYOffset;\n  return {\n    scrollLeft: scrollLeft,\n    scrollTop: scrollTop\n  };\n}","import getBoundingClientRect from \"./getBoundingClientRect.js\";\nimport getDocumentElement from \"./getDocumentElement.js\";\nimport getWindowScroll from \"./getWindowScroll.js\";\nexport default function getWindowScrollBarX(element) {\n  // If  has a CSS width greater than the viewport, then this will be\n  // incorrect for RTL.\n  // Popper 1 is broken in this case and never had a bug report so let's assume\n  // it's not an issue. I don't think anyone ever specifies width on \n  // anyway.\n  // Browsers where the left scrollbar doesn't cause an issue report `0` for\n  // this (e.g. Edge 2019, IE11, Safari)\n  return getBoundingClientRect(getDocumentElement(element)).left + getWindowScroll(element).scrollLeft;\n}","import getComputedStyle from \"./getComputedStyle.js\";\nexport default function isScrollParent(element) {\n  // Firefox wants us to check `-x` and `-y` variations as well\n  var _getComputedStyle = getComputedStyle(element),\n      overflow = _getComputedStyle.overflow,\n      overflowX = _getComputedStyle.overflowX,\n      overflowY = _getComputedStyle.overflowY;\n\n  return /auto|scroll|overlay|hidden/.test(overflow + overflowY + overflowX);\n}","import getParentNode from \"./getParentNode.js\";\nimport isScrollParent from \"./isScrollParent.js\";\nimport getNodeName from \"./getNodeName.js\";\nimport { isHTMLElement } from \"./instanceOf.js\";\nexport default function getScrollParent(node) {\n  if (['html', 'body', '#document'].indexOf(getNodeName(node)) >= 0) {\n    // $FlowFixMe[incompatible-return]: assume body is always available\n    return node.ownerDocument.body;\n  }\n\n  if (isHTMLElement(node) && isScrollParent(node)) {\n    return node;\n  }\n\n  return getScrollParent(getParentNode(node));\n}","import getScrollParent from \"./getScrollParent.js\";\nimport getParentNode from \"./getParentNode.js\";\nimport getWindow from \"./getWindow.js\";\nimport isScrollParent from \"./isScrollParent.js\";\n/*\ngiven a DOM element, return the list of all scroll parents, up the list of ancesors\nuntil we get to the top window object. This list is what we attach scroll listeners\nto, because if any of these parent elements scroll, we'll need to re-calculate the\nreference element's position.\n*/\n\nexport default function listScrollParents(element, list) {\n  var _element$ownerDocumen;\n\n  if (list === void 0) {\n    list = [];\n  }\n\n  var scrollParent = getScrollParent(element);\n  var isBody = scrollParent === ((_element$ownerDocumen = element.ownerDocument) == null ? void 0 : _element$ownerDocumen.body);\n  var win = getWindow(scrollParent);\n  var target = isBody ? [win].concat(win.visualViewport || [], isScrollParent(scrollParent) ? scrollParent : []) : scrollParent;\n  var updatedList = list.concat(target);\n  return isBody ? updatedList : // $FlowFixMe[incompatible-call]: isBody tells us target will be an HTMLElement here\n  updatedList.concat(listScrollParents(getParentNode(target)));\n}","export default function rectToClientRect(rect) {\n  return Object.assign({}, rect, {\n    left: rect.x,\n    top: rect.y,\n    right: rect.x + rect.width,\n    bottom: rect.y + rect.height\n  });\n}","import { viewport } from \"../enums.js\";\nimport getViewportRect from \"./getViewportRect.js\";\nimport getDocumentRect from \"./getDocumentRect.js\";\nimport listScrollParents from \"./listScrollParents.js\";\nimport getOffsetParent from \"./getOffsetParent.js\";\nimport getDocumentElement from \"./getDocumentElement.js\";\nimport getComputedStyle from \"./getComputedStyle.js\";\nimport { isElement, isHTMLElement } from \"./instanceOf.js\";\nimport getBoundingClientRect from \"./getBoundingClientRect.js\";\nimport getParentNode from \"./getParentNode.js\";\nimport contains from \"./contains.js\";\nimport getNodeName from \"./getNodeName.js\";\nimport rectToClientRect from \"../utils/rectToClientRect.js\";\nimport { max, min } from \"../utils/math.js\";\n\nfunction getInnerBoundingClientRect(element, strategy) {\n  var rect = getBoundingClientRect(element, false, strategy === 'fixed');\n  rect.top = rect.top + element.clientTop;\n  rect.left = rect.left + element.clientLeft;\n  rect.bottom = rect.top + element.clientHeight;\n  rect.right = rect.left + element.clientWidth;\n  rect.width = element.clientWidth;\n  rect.height = element.clientHeight;\n  rect.x = rect.left;\n  rect.y = rect.top;\n  return rect;\n}\n\nfunction getClientRectFromMixedType(element, clippingParent, strategy) {\n  return clippingParent === viewport ? rectToClientRect(getViewportRect(element, strategy)) : isElement(clippingParent) ? getInnerBoundingClientRect(clippingParent, strategy) : rectToClientRect(getDocumentRect(getDocumentElement(element)));\n} // A \"clipping parent\" is an overflowable container with the characteristic of\n// clipping (or hiding) overflowing elements with a position different from\n// `initial`\n\n\nfunction getClippingParents(element) {\n  var clippingParents = listScrollParents(getParentNode(element));\n  var canEscapeClipping = ['absolute', 'fixed'].indexOf(getComputedStyle(element).position) >= 0;\n  var clipperElement = canEscapeClipping && isHTMLElement(element) ? getOffsetParent(element) : element;\n\n  if (!isElement(clipperElement)) {\n    return [];\n  } // $FlowFixMe[incompatible-return]: https://github.com/facebook/flow/issues/1414\n\n\n  return clippingParents.filter(function (clippingParent) {\n    return isElement(clippingParent) && contains(clippingParent, clipperElement) && getNodeName(clippingParent) !== 'body';\n  });\n} // Gets the maximum area that the element is visible in due to any number of\n// clipping parents\n\n\nexport default function getClippingRect(element, boundary, rootBoundary, strategy) {\n  var mainClippingParents = boundary === 'clippingParents' ? getClippingParents(element) : [].concat(boundary);\n  var clippingParents = [].concat(mainClippingParents, [rootBoundary]);\n  var firstClippingParent = clippingParents[0];\n  var clippingRect = clippingParents.reduce(function (accRect, clippingParent) {\n    var rect = getClientRectFromMixedType(element, clippingParent, strategy);\n    accRect.top = max(rect.top, accRect.top);\n    accRect.right = min(rect.right, accRect.right);\n    accRect.bottom = min(rect.bottom, accRect.bottom);\n    accRect.left = max(rect.left, accRect.left);\n    return accRect;\n  }, getClientRectFromMixedType(element, firstClippingParent, strategy));\n  clippingRect.width = clippingRect.right - clippingRect.left;\n  clippingRect.height = clippingRect.bottom - clippingRect.top;\n  clippingRect.x = clippingRect.left;\n  clippingRect.y = clippingRect.top;\n  return clippingRect;\n}","import getWindow from \"./getWindow.js\";\nimport getDocumentElement from \"./getDocumentElement.js\";\nimport getWindowScrollBarX from \"./getWindowScrollBarX.js\";\nimport isLayoutViewport from \"./isLayoutViewport.js\";\nexport default function getViewportRect(element, strategy) {\n  var win = getWindow(element);\n  var html = getDocumentElement(element);\n  var visualViewport = win.visualViewport;\n  var width = html.clientWidth;\n  var height = html.clientHeight;\n  var x = 0;\n  var y = 0;\n\n  if (visualViewport) {\n    width = visualViewport.width;\n    height = visualViewport.height;\n    var layoutViewport = isLayoutViewport();\n\n    if (layoutViewport || !layoutViewport && strategy === 'fixed') {\n      x = visualViewport.offsetLeft;\n      y = visualViewport.offsetTop;\n    }\n  }\n\n  return {\n    width: width,\n    height: height,\n    x: x + getWindowScrollBarX(element),\n    y: y\n  };\n}","import getDocumentElement from \"./getDocumentElement.js\";\nimport getComputedStyle from \"./getComputedStyle.js\";\nimport getWindowScrollBarX from \"./getWindowScrollBarX.js\";\nimport getWindowScroll from \"./getWindowScroll.js\";\nimport { max } from \"../utils/math.js\"; // Gets the entire size of the scrollable document area, even extending outside\n// of the `` and `` rect bounds if horizontally scrollable\n\nexport default function getDocumentRect(element) {\n  var _element$ownerDocumen;\n\n  var html = getDocumentElement(element);\n  var winScroll = getWindowScroll(element);\n  var body = (_element$ownerDocumen = element.ownerDocument) == null ? void 0 : _element$ownerDocumen.body;\n  var width = max(html.scrollWidth, html.clientWidth, body ? body.scrollWidth : 0, body ? body.clientWidth : 0);\n  var height = max(html.scrollHeight, html.clientHeight, body ? body.scrollHeight : 0, body ? body.clientHeight : 0);\n  var x = -winScroll.scrollLeft + getWindowScrollBarX(element);\n  var y = -winScroll.scrollTop;\n\n  if (getComputedStyle(body || html).direction === 'rtl') {\n    x += max(html.clientWidth, body ? body.clientWidth : 0) - width;\n  }\n\n  return {\n    width: width,\n    height: height,\n    x: x,\n    y: y\n  };\n}","import getBasePlacement from \"./getBasePlacement.js\";\nimport getVariation from \"./getVariation.js\";\nimport getMainAxisFromPlacement from \"./getMainAxisFromPlacement.js\";\nimport { top, right, bottom, left, start, end } from \"../enums.js\";\nexport default function computeOffsets(_ref) {\n  var reference = _ref.reference,\n      element = _ref.element,\n      placement = _ref.placement;\n  var basePlacement = placement ? getBasePlacement(placement) : null;\n  var variation = placement ? getVariation(placement) : null;\n  var commonX = reference.x + reference.width / 2 - element.width / 2;\n  var commonY = reference.y + reference.height / 2 - element.height / 2;\n  var offsets;\n\n  switch (basePlacement) {\n    case top:\n      offsets = {\n        x: commonX,\n        y: reference.y - element.height\n      };\n      break;\n\n    case bottom:\n      offsets = {\n        x: commonX,\n        y: reference.y + reference.height\n      };\n      break;\n\n    case right:\n      offsets = {\n        x: reference.x + reference.width,\n        y: commonY\n      };\n      break;\n\n    case left:\n      offsets = {\n        x: reference.x - element.width,\n        y: commonY\n      };\n      break;\n\n    default:\n      offsets = {\n        x: reference.x,\n        y: reference.y\n      };\n  }\n\n  var mainAxis = basePlacement ? getMainAxisFromPlacement(basePlacement) : null;\n\n  if (mainAxis != null) {\n    var len = mainAxis === 'y' ? 'height' : 'width';\n\n    switch (variation) {\n      case start:\n        offsets[mainAxis] = offsets[mainAxis] - (reference[len] / 2 - element[len] / 2);\n        break;\n\n      case end:\n        offsets[mainAxis] = offsets[mainAxis] + (reference[len] / 2 - element[len] / 2);\n        break;\n\n      default:\n    }\n  }\n\n  return offsets;\n}","import getClippingRect from \"../dom-utils/getClippingRect.js\";\nimport getDocumentElement from \"../dom-utils/getDocumentElement.js\";\nimport getBoundingClientRect from \"../dom-utils/getBoundingClientRect.js\";\nimport computeOffsets from \"./computeOffsets.js\";\nimport rectToClientRect from \"./rectToClientRect.js\";\nimport { clippingParents, reference, popper, bottom, top, right, basePlacements, viewport } from \"../enums.js\";\nimport { isElement } from \"../dom-utils/instanceOf.js\";\nimport mergePaddingObject from \"./mergePaddingObject.js\";\nimport expandToHashMap from \"./expandToHashMap.js\"; // eslint-disable-next-line import/no-unused-modules\n\nexport default function detectOverflow(state, options) {\n  if (options === void 0) {\n    options = {};\n  }\n\n  var _options = options,\n      _options$placement = _options.placement,\n      placement = _options$placement === void 0 ? state.placement : _options$placement,\n      _options$strategy = _options.strategy,\n      strategy = _options$strategy === void 0 ? state.strategy : _options$strategy,\n      _options$boundary = _options.boundary,\n      boundary = _options$boundary === void 0 ? clippingParents : _options$boundary,\n      _options$rootBoundary = _options.rootBoundary,\n      rootBoundary = _options$rootBoundary === void 0 ? viewport : _options$rootBoundary,\n      _options$elementConte = _options.elementContext,\n      elementContext = _options$elementConte === void 0 ? popper : _options$elementConte,\n      _options$altBoundary = _options.altBoundary,\n      altBoundary = _options$altBoundary === void 0 ? false : _options$altBoundary,\n      _options$padding = _options.padding,\n      padding = _options$padding === void 0 ? 0 : _options$padding;\n  var paddingObject = mergePaddingObject(typeof padding !== 'number' ? padding : expandToHashMap(padding, basePlacements));\n  var altContext = elementContext === popper ? reference : popper;\n  var popperRect = state.rects.popper;\n  var element = state.elements[altBoundary ? altContext : elementContext];\n  var clippingClientRect = getClippingRect(isElement(element) ? element : element.contextElement || getDocumentElement(state.elements.popper), boundary, rootBoundary, strategy);\n  var referenceClientRect = getBoundingClientRect(state.elements.reference);\n  var popperOffsets = computeOffsets({\n    reference: referenceClientRect,\n    element: popperRect,\n    strategy: 'absolute',\n    placement: placement\n  });\n  var popperClientRect = rectToClientRect(Object.assign({}, popperRect, popperOffsets));\n  var elementClientRect = elementContext === popper ? popperClientRect : referenceClientRect; // positive = overflowing the clipping rect\n  // 0 or negative = within the clipping rect\n\n  var overflowOffsets = {\n    top: clippingClientRect.top - elementClientRect.top + paddingObject.top,\n    bottom: elementClientRect.bottom - clippingClientRect.bottom + paddingObject.bottom,\n    left: clippingClientRect.left - elementClientRect.left + paddingObject.left,\n    right: elementClientRect.right - clippingClientRect.right + paddingObject.right\n  };\n  var offsetData = state.modifiersData.offset; // Offsets can be applied only to the popper element\n\n  if (elementContext === popper && offsetData) {\n    var offset = offsetData[placement];\n    Object.keys(overflowOffsets).forEach(function (key) {\n      var multiply = [right, bottom].indexOf(key) >= 0 ? 1 : -1;\n      var axis = [top, bottom].indexOf(key) >= 0 ? 'y' : 'x';\n      overflowOffsets[key] += offset[axis] * multiply;\n    });\n  }\n\n  return overflowOffsets;\n}","import getVariation from \"./getVariation.js\";\nimport { variationPlacements, basePlacements, placements as allPlacements } from \"../enums.js\";\nimport detectOverflow from \"./detectOverflow.js\";\nimport getBasePlacement from \"./getBasePlacement.js\";\nexport default function computeAutoPlacement(state, options) {\n  if (options === void 0) {\n    options = {};\n  }\n\n  var _options = options,\n      placement = _options.placement,\n      boundary = _options.boundary,\n      rootBoundary = _options.rootBoundary,\n      padding = _options.padding,\n      flipVariations = _options.flipVariations,\n      _options$allowedAutoP = _options.allowedAutoPlacements,\n      allowedAutoPlacements = _options$allowedAutoP === void 0 ? allPlacements : _options$allowedAutoP;\n  var variation = getVariation(placement);\n  var placements = variation ? flipVariations ? variationPlacements : variationPlacements.filter(function (placement) {\n    return getVariation(placement) === variation;\n  }) : basePlacements;\n  var allowedPlacements = placements.filter(function (placement) {\n    return allowedAutoPlacements.indexOf(placement) >= 0;\n  });\n\n  if (allowedPlacements.length === 0) {\n    allowedPlacements = placements;\n  } // $FlowFixMe[incompatible-type]: Flow seems to have problems with two array unions...\n\n\n  var overflows = allowedPlacements.reduce(function (acc, placement) {\n    acc[placement] = detectOverflow(state, {\n      placement: placement,\n      boundary: boundary,\n      rootBoundary: rootBoundary,\n      padding: padding\n    })[getBasePlacement(placement)];\n    return acc;\n  }, {});\n  return Object.keys(overflows).sort(function (a, b) {\n    return overflows[a] - overflows[b];\n  });\n}","import getOppositePlacement from \"../utils/getOppositePlacement.js\";\nimport getBasePlacement from \"../utils/getBasePlacement.js\";\nimport getOppositeVariationPlacement from \"../utils/getOppositeVariationPlacement.js\";\nimport detectOverflow from \"../utils/detectOverflow.js\";\nimport computeAutoPlacement from \"../utils/computeAutoPlacement.js\";\nimport { bottom, top, start, right, left, auto } from \"../enums.js\";\nimport getVariation from \"../utils/getVariation.js\"; // eslint-disable-next-line import/no-unused-modules\n\nfunction getExpandedFallbackPlacements(placement) {\n  if (getBasePlacement(placement) === auto) {\n    return [];\n  }\n\n  var oppositePlacement = getOppositePlacement(placement);\n  return [getOppositeVariationPlacement(placement), oppositePlacement, getOppositeVariationPlacement(oppositePlacement)];\n}\n\nfunction flip(_ref) {\n  var state = _ref.state,\n      options = _ref.options,\n      name = _ref.name;\n\n  if (state.modifiersData[name]._skip) {\n    return;\n  }\n\n  var _options$mainAxis = options.mainAxis,\n      checkMainAxis = _options$mainAxis === void 0 ? true : _options$mainAxis,\n      _options$altAxis = options.altAxis,\n      checkAltAxis = _options$altAxis === void 0 ? true : _options$altAxis,\n      specifiedFallbackPlacements = options.fallbackPlacements,\n      padding = options.padding,\n      boundary = options.boundary,\n      rootBoundary = options.rootBoundary,\n      altBoundary = options.altBoundary,\n      _options$flipVariatio = options.flipVariations,\n      flipVariations = _options$flipVariatio === void 0 ? true : _options$flipVariatio,\n      allowedAutoPlacements = options.allowedAutoPlacements;\n  var preferredPlacement = state.options.placement;\n  var basePlacement = getBasePlacement(preferredPlacement);\n  var isBasePlacement = basePlacement === preferredPlacement;\n  var fallbackPlacements = specifiedFallbackPlacements || (isBasePlacement || !flipVariations ? [getOppositePlacement(preferredPlacement)] : getExpandedFallbackPlacements(preferredPlacement));\n  var placements = [preferredPlacement].concat(fallbackPlacements).reduce(function (acc, placement) {\n    return acc.concat(getBasePlacement(placement) === auto ? computeAutoPlacement(state, {\n      placement: placement,\n      boundary: boundary,\n      rootBoundary: rootBoundary,\n      padding: padding,\n      flipVariations: flipVariations,\n      allowedAutoPlacements: allowedAutoPlacements\n    }) : placement);\n  }, []);\n  var referenceRect = state.rects.reference;\n  var popperRect = state.rects.popper;\n  var checksMap = new Map();\n  var makeFallbackChecks = true;\n  var firstFittingPlacement = placements[0];\n\n  for (var i = 0; i < placements.length; i++) {\n    var placement = placements[i];\n\n    var _basePlacement = getBasePlacement(placement);\n\n    var isStartVariation = getVariation(placement) === start;\n    var isVertical = [top, bottom].indexOf(_basePlacement) >= 0;\n    var len = isVertical ? 'width' : 'height';\n    var overflow = detectOverflow(state, {\n      placement: placement,\n      boundary: boundary,\n      rootBoundary: rootBoundary,\n      altBoundary: altBoundary,\n      padding: padding\n    });\n    var mainVariationSide = isVertical ? isStartVariation ? right : left : isStartVariation ? bottom : top;\n\n    if (referenceRect[len] > popperRect[len]) {\n      mainVariationSide = getOppositePlacement(mainVariationSide);\n    }\n\n    var altVariationSide = getOppositePlacement(mainVariationSide);\n    var checks = [];\n\n    if (checkMainAxis) {\n      checks.push(overflow[_basePlacement] <= 0);\n    }\n\n    if (checkAltAxis) {\n      checks.push(overflow[mainVariationSide] <= 0, overflow[altVariationSide] <= 0);\n    }\n\n    if (checks.every(function (check) {\n      return check;\n    })) {\n      firstFittingPlacement = placement;\n      makeFallbackChecks = false;\n      break;\n    }\n\n    checksMap.set(placement, checks);\n  }\n\n  if (makeFallbackChecks) {\n    // `2` may be desired in some cases – research later\n    var numberOfChecks = flipVariations ? 3 : 1;\n\n    var _loop = function _loop(_i) {\n      var fittingPlacement = placements.find(function (placement) {\n        var checks = checksMap.get(placement);\n\n        if (checks) {\n          return checks.slice(0, _i).every(function (check) {\n            return check;\n          });\n        }\n      });\n\n      if (fittingPlacement) {\n        firstFittingPlacement = fittingPlacement;\n        return \"break\";\n      }\n    };\n\n    for (var _i = numberOfChecks; _i > 0; _i--) {\n      var _ret = _loop(_i);\n\n      if (_ret === \"break\") break;\n    }\n  }\n\n  if (state.placement !== firstFittingPlacement) {\n    state.modifiersData[name]._skip = true;\n    state.placement = firstFittingPlacement;\n    state.reset = true;\n  }\n} // eslint-disable-next-line import/no-unused-modules\n\n\nexport default {\n  name: 'flip',\n  enabled: true,\n  phase: 'main',\n  fn: flip,\n  requiresIfExists: ['offset'],\n  data: {\n    _skip: false\n  }\n};","import { top, bottom, left, right } from \"../enums.js\";\nimport detectOverflow from \"../utils/detectOverflow.js\";\n\nfunction getSideOffsets(overflow, rect, preventedOffsets) {\n  if (preventedOffsets === void 0) {\n    preventedOffsets = {\n      x: 0,\n      y: 0\n    };\n  }\n\n  return {\n    top: overflow.top - rect.height - preventedOffsets.y,\n    right: overflow.right - rect.width + preventedOffsets.x,\n    bottom: overflow.bottom - rect.height + preventedOffsets.y,\n    left: overflow.left - rect.width - preventedOffsets.x\n  };\n}\n\nfunction isAnySideFullyClipped(overflow) {\n  return [top, right, bottom, left].some(function (side) {\n    return overflow[side] >= 0;\n  });\n}\n\nfunction hide(_ref) {\n  var state = _ref.state,\n      name = _ref.name;\n  var referenceRect = state.rects.reference;\n  var popperRect = state.rects.popper;\n  var preventedOffsets = state.modifiersData.preventOverflow;\n  var referenceOverflow = detectOverflow(state, {\n    elementContext: 'reference'\n  });\n  var popperAltOverflow = detectOverflow(state, {\n    altBoundary: true\n  });\n  var referenceClippingOffsets = getSideOffsets(referenceOverflow, referenceRect);\n  var popperEscapeOffsets = getSideOffsets(popperAltOverflow, popperRect, preventedOffsets);\n  var isReferenceHidden = isAnySideFullyClipped(referenceClippingOffsets);\n  var hasPopperEscaped = isAnySideFullyClipped(popperEscapeOffsets);\n  state.modifiersData[name] = {\n    referenceClippingOffsets: referenceClippingOffsets,\n    popperEscapeOffsets: popperEscapeOffsets,\n    isReferenceHidden: isReferenceHidden,\n    hasPopperEscaped: hasPopperEscaped\n  };\n  state.attributes.popper = Object.assign({}, state.attributes.popper, {\n    'data-popper-reference-hidden': isReferenceHidden,\n    'data-popper-escaped': hasPopperEscaped\n  });\n} // eslint-disable-next-line import/no-unused-modules\n\n\nexport default {\n  name: 'hide',\n  enabled: true,\n  phase: 'main',\n  requiresIfExists: ['preventOverflow'],\n  fn: hide\n};","import getBasePlacement from \"../utils/getBasePlacement.js\";\nimport { top, left, right, placements } from \"../enums.js\"; // eslint-disable-next-line import/no-unused-modules\n\nexport function distanceAndSkiddingToXY(placement, rects, offset) {\n  var basePlacement = getBasePlacement(placement);\n  var invertDistance = [left, top].indexOf(basePlacement) >= 0 ? -1 : 1;\n\n  var _ref = typeof offset === 'function' ? offset(Object.assign({}, rects, {\n    placement: placement\n  })) : offset,\n      skidding = _ref[0],\n      distance = _ref[1];\n\n  skidding = skidding || 0;\n  distance = (distance || 0) * invertDistance;\n  return [left, right].indexOf(basePlacement) >= 0 ? {\n    x: distance,\n    y: skidding\n  } : {\n    x: skidding,\n    y: distance\n  };\n}\n\nfunction offset(_ref2) {\n  var state = _ref2.state,\n      options = _ref2.options,\n      name = _ref2.name;\n  var _options$offset = options.offset,\n      offset = _options$offset === void 0 ? [0, 0] : _options$offset;\n  var data = placements.reduce(function (acc, placement) {\n    acc[placement] = distanceAndSkiddingToXY(placement, state.rects, offset);\n    return acc;\n  }, {});\n  var _data$state$placement = data[state.placement],\n      x = _data$state$placement.x,\n      y = _data$state$placement.y;\n\n  if (state.modifiersData.popperOffsets != null) {\n    state.modifiersData.popperOffsets.x += x;\n    state.modifiersData.popperOffsets.y += y;\n  }\n\n  state.modifiersData[name] = data;\n} // eslint-disable-next-line import/no-unused-modules\n\n\nexport default {\n  name: 'offset',\n  enabled: true,\n  phase: 'main',\n  requires: ['popperOffsets'],\n  fn: offset\n};","import computeOffsets from \"../utils/computeOffsets.js\";\n\nfunction popperOffsets(_ref) {\n  var state = _ref.state,\n      name = _ref.name;\n  // Offsets are the actual position the popper needs to have to be\n  // properly positioned near its reference element\n  // This is the most basic placement, and will be adjusted by\n  // the modifiers in the next step\n  state.modifiersData[name] = computeOffsets({\n    reference: state.rects.reference,\n    element: state.rects.popper,\n    strategy: 'absolute',\n    placement: state.placement\n  });\n} // eslint-disable-next-line import/no-unused-modules\n\n\nexport default {\n  name: 'popperOffsets',\n  enabled: true,\n  phase: 'read',\n  fn: popperOffsets,\n  data: {}\n};","import { top, left, right, bottom, start } from \"../enums.js\";\nimport getBasePlacement from \"../utils/getBasePlacement.js\";\nimport getMainAxisFromPlacement from \"../utils/getMainAxisFromPlacement.js\";\nimport getAltAxis from \"../utils/getAltAxis.js\";\nimport { within, withinMaxClamp } from \"../utils/within.js\";\nimport getLayoutRect from \"../dom-utils/getLayoutRect.js\";\nimport getOffsetParent from \"../dom-utils/getOffsetParent.js\";\nimport detectOverflow from \"../utils/detectOverflow.js\";\nimport getVariation from \"../utils/getVariation.js\";\nimport getFreshSideObject from \"../utils/getFreshSideObject.js\";\nimport { min as mathMin, max as mathMax } from \"../utils/math.js\";\n\nfunction preventOverflow(_ref) {\n  var state = _ref.state,\n      options = _ref.options,\n      name = _ref.name;\n  var _options$mainAxis = options.mainAxis,\n      checkMainAxis = _options$mainAxis === void 0 ? true : _options$mainAxis,\n      _options$altAxis = options.altAxis,\n      checkAltAxis = _options$altAxis === void 0 ? false : _options$altAxis,\n      boundary = options.boundary,\n      rootBoundary = options.rootBoundary,\n      altBoundary = options.altBoundary,\n      padding = options.padding,\n      _options$tether = options.tether,\n      tether = _options$tether === void 0 ? true : _options$tether,\n      _options$tetherOffset = options.tetherOffset,\n      tetherOffset = _options$tetherOffset === void 0 ? 0 : _options$tetherOffset;\n  var overflow = detectOverflow(state, {\n    boundary: boundary,\n    rootBoundary: rootBoundary,\n    padding: padding,\n    altBoundary: altBoundary\n  });\n  var basePlacement = getBasePlacement(state.placement);\n  var variation = getVariation(state.placement);\n  var isBasePlacement = !variation;\n  var mainAxis = getMainAxisFromPlacement(basePlacement);\n  var altAxis = getAltAxis(mainAxis);\n  var popperOffsets = state.modifiersData.popperOffsets;\n  var referenceRect = state.rects.reference;\n  var popperRect = state.rects.popper;\n  var tetherOffsetValue = typeof tetherOffset === 'function' ? tetherOffset(Object.assign({}, state.rects, {\n    placement: state.placement\n  })) : tetherOffset;\n  var normalizedTetherOffsetValue = typeof tetherOffsetValue === 'number' ? {\n    mainAxis: tetherOffsetValue,\n    altAxis: tetherOffsetValue\n  } : Object.assign({\n    mainAxis: 0,\n    altAxis: 0\n  }, tetherOffsetValue);\n  var offsetModifierState = state.modifiersData.offset ? state.modifiersData.offset[state.placement] : null;\n  var data = {\n    x: 0,\n    y: 0\n  };\n\n  if (!popperOffsets) {\n    return;\n  }\n\n  if (checkMainAxis) {\n    var _offsetModifierState$;\n\n    var mainSide = mainAxis === 'y' ? top : left;\n    var altSide = mainAxis === 'y' ? bottom : right;\n    var len = mainAxis === 'y' ? 'height' : 'width';\n    var offset = popperOffsets[mainAxis];\n    var min = offset + overflow[mainSide];\n    var max = offset - overflow[altSide];\n    var additive = tether ? -popperRect[len] / 2 : 0;\n    var minLen = variation === start ? referenceRect[len] : popperRect[len];\n    var maxLen = variation === start ? -popperRect[len] : -referenceRect[len]; // We need to include the arrow in the calculation so the arrow doesn't go\n    // outside the reference bounds\n\n    var arrowElement = state.elements.arrow;\n    var arrowRect = tether && arrowElement ? getLayoutRect(arrowElement) : {\n      width: 0,\n      height: 0\n    };\n    var arrowPaddingObject = state.modifiersData['arrow#persistent'] ? state.modifiersData['arrow#persistent'].padding : getFreshSideObject();\n    var arrowPaddingMin = arrowPaddingObject[mainSide];\n    var arrowPaddingMax = arrowPaddingObject[altSide]; // If the reference length is smaller than the arrow length, we don't want\n    // to include its full size in the calculation. If the reference is small\n    // and near the edge of a boundary, the popper can overflow even if the\n    // reference is not overflowing as well (e.g. virtual elements with no\n    // width or height)\n\n    var arrowLen = within(0, referenceRect[len], arrowRect[len]);\n    var minOffset = isBasePlacement ? referenceRect[len] / 2 - additive - arrowLen - arrowPaddingMin - normalizedTetherOffsetValue.mainAxis : minLen - arrowLen - arrowPaddingMin - normalizedTetherOffsetValue.mainAxis;\n    var maxOffset = isBasePlacement ? -referenceRect[len] / 2 + additive + arrowLen + arrowPaddingMax + normalizedTetherOffsetValue.mainAxis : maxLen + arrowLen + arrowPaddingMax + normalizedTetherOffsetValue.mainAxis;\n    var arrowOffsetParent = state.elements.arrow && getOffsetParent(state.elements.arrow);\n    var clientOffset = arrowOffsetParent ? mainAxis === 'y' ? arrowOffsetParent.clientTop || 0 : arrowOffsetParent.clientLeft || 0 : 0;\n    var offsetModifierValue = (_offsetModifierState$ = offsetModifierState == null ? void 0 : offsetModifierState[mainAxis]) != null ? _offsetModifierState$ : 0;\n    var tetherMin = offset + minOffset - offsetModifierValue - clientOffset;\n    var tetherMax = offset + maxOffset - offsetModifierValue;\n    var preventedOffset = within(tether ? mathMin(min, tetherMin) : min, offset, tether ? mathMax(max, tetherMax) : max);\n    popperOffsets[mainAxis] = preventedOffset;\n    data[mainAxis] = preventedOffset - offset;\n  }\n\n  if (checkAltAxis) {\n    var _offsetModifierState$2;\n\n    var _mainSide = mainAxis === 'x' ? top : left;\n\n    var _altSide = mainAxis === 'x' ? bottom : right;\n\n    var _offset = popperOffsets[altAxis];\n\n    var _len = altAxis === 'y' ? 'height' : 'width';\n\n    var _min = _offset + overflow[_mainSide];\n\n    var _max = _offset - overflow[_altSide];\n\n    var isOriginSide = [top, left].indexOf(basePlacement) !== -1;\n\n    var _offsetModifierValue = (_offsetModifierState$2 = offsetModifierState == null ? void 0 : offsetModifierState[altAxis]) != null ? _offsetModifierState$2 : 0;\n\n    var _tetherMin = isOriginSide ? _min : _offset - referenceRect[_len] - popperRect[_len] - _offsetModifierValue + normalizedTetherOffsetValue.altAxis;\n\n    var _tetherMax = isOriginSide ? _offset + referenceRect[_len] + popperRect[_len] - _offsetModifierValue - normalizedTetherOffsetValue.altAxis : _max;\n\n    var _preventedOffset = tether && isOriginSide ? withinMaxClamp(_tetherMin, _offset, _tetherMax) : within(tether ? _tetherMin : _min, _offset, tether ? _tetherMax : _max);\n\n    popperOffsets[altAxis] = _preventedOffset;\n    data[altAxis] = _preventedOffset - _offset;\n  }\n\n  state.modifiersData[name] = data;\n} // eslint-disable-next-line import/no-unused-modules\n\n\nexport default {\n  name: 'preventOverflow',\n  enabled: true,\n  phase: 'main',\n  fn: preventOverflow,\n  requiresIfExists: ['offset']\n};","export default function getAltAxis(axis) {\n  return axis === 'x' ? 'y' : 'x';\n}","import getBoundingClientRect from \"./getBoundingClientRect.js\";\nimport getNodeScroll from \"./getNodeScroll.js\";\nimport getNodeName from \"./getNodeName.js\";\nimport { isHTMLElement } from \"./instanceOf.js\";\nimport getWindowScrollBarX from \"./getWindowScrollBarX.js\";\nimport getDocumentElement from \"./getDocumentElement.js\";\nimport isScrollParent from \"./isScrollParent.js\";\nimport { round } from \"../utils/math.js\";\n\nfunction isElementScaled(element) {\n  var rect = element.getBoundingClientRect();\n  var scaleX = round(rect.width) / element.offsetWidth || 1;\n  var scaleY = round(rect.height) / element.offsetHeight || 1;\n  return scaleX !== 1 || scaleY !== 1;\n} // Returns the composite rect of an element relative to its offsetParent.\n// Composite means it takes into account transforms as well as layout.\n\n\nexport default function getCompositeRect(elementOrVirtualElement, offsetParent, isFixed) {\n  if (isFixed === void 0) {\n    isFixed = false;\n  }\n\n  var isOffsetParentAnElement = isHTMLElement(offsetParent);\n  var offsetParentIsScaled = isHTMLElement(offsetParent) && isElementScaled(offsetParent);\n  var documentElement = getDocumentElement(offsetParent);\n  var rect = getBoundingClientRect(elementOrVirtualElement, offsetParentIsScaled, isFixed);\n  var scroll = {\n    scrollLeft: 0,\n    scrollTop: 0\n  };\n  var offsets = {\n    x: 0,\n    y: 0\n  };\n\n  if (isOffsetParentAnElement || !isOffsetParentAnElement && !isFixed) {\n    if (getNodeName(offsetParent) !== 'body' || // https://github.com/popperjs/popper-core/issues/1078\n    isScrollParent(documentElement)) {\n      scroll = getNodeScroll(offsetParent);\n    }\n\n    if (isHTMLElement(offsetParent)) {\n      offsets = getBoundingClientRect(offsetParent, true);\n      offsets.x += offsetParent.clientLeft;\n      offsets.y += offsetParent.clientTop;\n    } else if (documentElement) {\n      offsets.x = getWindowScrollBarX(documentElement);\n    }\n  }\n\n  return {\n    x: rect.left + scroll.scrollLeft - offsets.x,\n    y: rect.top + scroll.scrollTop - offsets.y,\n    width: rect.width,\n    height: rect.height\n  };\n}","import getWindowScroll from \"./getWindowScroll.js\";\nimport getWindow from \"./getWindow.js\";\nimport { isHTMLElement } from \"./instanceOf.js\";\nimport getHTMLElementScroll from \"./getHTMLElementScroll.js\";\nexport default function getNodeScroll(node) {\n  if (node === getWindow(node) || !isHTMLElement(node)) {\n    return getWindowScroll(node);\n  } else {\n    return getHTMLElementScroll(node);\n  }\n}","export default function getHTMLElementScroll(element) {\n  return {\n    scrollLeft: element.scrollLeft,\n    scrollTop: element.scrollTop\n  };\n}","import { modifierPhases } from \"../enums.js\"; // source: https://stackoverflow.com/questions/49875255\n\nfunction order(modifiers) {\n  var map = new Map();\n  var visited = new Set();\n  var result = [];\n  modifiers.forEach(function (modifier) {\n    map.set(modifier.name, modifier);\n  }); // On visiting object, check for its dependencies and visit them recursively\n\n  function sort(modifier) {\n    visited.add(modifier.name);\n    var requires = [].concat(modifier.requires || [], modifier.requiresIfExists || []);\n    requires.forEach(function (dep) {\n      if (!visited.has(dep)) {\n        var depModifier = map.get(dep);\n\n        if (depModifier) {\n          sort(depModifier);\n        }\n      }\n    });\n    result.push(modifier);\n  }\n\n  modifiers.forEach(function (modifier) {\n    if (!visited.has(modifier.name)) {\n      // check for visited object\n      sort(modifier);\n    }\n  });\n  return result;\n}\n\nexport default function orderModifiers(modifiers) {\n  // order based on dependencies\n  var orderedModifiers = order(modifiers); // order based on phase\n\n  return modifierPhases.reduce(function (acc, phase) {\n    return acc.concat(orderedModifiers.filter(function (modifier) {\n      return modifier.phase === phase;\n    }));\n  }, []);\n}","import getCompositeRect from \"./dom-utils/getCompositeRect.js\";\nimport getLayoutRect from \"./dom-utils/getLayoutRect.js\";\nimport listScrollParents from \"./dom-utils/listScrollParents.js\";\nimport getOffsetParent from \"./dom-utils/getOffsetParent.js\";\nimport orderModifiers from \"./utils/orderModifiers.js\";\nimport debounce from \"./utils/debounce.js\";\nimport mergeByName from \"./utils/mergeByName.js\";\nimport detectOverflow from \"./utils/detectOverflow.js\";\nimport { isElement } from \"./dom-utils/instanceOf.js\";\nvar DEFAULT_OPTIONS = {\n  placement: 'bottom',\n  modifiers: [],\n  strategy: 'absolute'\n};\n\nfunction areValidElements() {\n  for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n    args[_key] = arguments[_key];\n  }\n\n  return !args.some(function (element) {\n    return !(element && typeof element.getBoundingClientRect === 'function');\n  });\n}\n\nexport function popperGenerator(generatorOptions) {\n  if (generatorOptions === void 0) {\n    generatorOptions = {};\n  }\n\n  var _generatorOptions = generatorOptions,\n      _generatorOptions$def = _generatorOptions.defaultModifiers,\n      defaultModifiers = _generatorOptions$def === void 0 ? [] : _generatorOptions$def,\n      _generatorOptions$def2 = _generatorOptions.defaultOptions,\n      defaultOptions = _generatorOptions$def2 === void 0 ? DEFAULT_OPTIONS : _generatorOptions$def2;\n  return function createPopper(reference, popper, options) {\n    if (options === void 0) {\n      options = defaultOptions;\n    }\n\n    var state = {\n      placement: 'bottom',\n      orderedModifiers: [],\n      options: Object.assign({}, DEFAULT_OPTIONS, defaultOptions),\n      modifiersData: {},\n      elements: {\n        reference: reference,\n        popper: popper\n      },\n      attributes: {},\n      styles: {}\n    };\n    var effectCleanupFns = [];\n    var isDestroyed = false;\n    var instance = {\n      state: state,\n      setOptions: function setOptions(setOptionsAction) {\n        var options = typeof setOptionsAction === 'function' ? setOptionsAction(state.options) : setOptionsAction;\n        cleanupModifierEffects();\n        state.options = Object.assign({}, defaultOptions, state.options, options);\n        state.scrollParents = {\n          reference: isElement(reference) ? listScrollParents(reference) : reference.contextElement ? listScrollParents(reference.contextElement) : [],\n          popper: listScrollParents(popper)\n        }; // Orders the modifiers based on their dependencies and `phase`\n        // properties\n\n        var orderedModifiers = orderModifiers(mergeByName([].concat(defaultModifiers, state.options.modifiers))); // Strip out disabled modifiers\n\n        state.orderedModifiers = orderedModifiers.filter(function (m) {\n          return m.enabled;\n        });\n        runModifierEffects();\n        return instance.update();\n      },\n      // Sync update – it will always be executed, even if not necessary. This\n      // is useful for low frequency updates where sync behavior simplifies the\n      // logic.\n      // For high frequency updates (e.g. `resize` and `scroll` events), always\n      // prefer the async Popper#update method\n      forceUpdate: function forceUpdate() {\n        if (isDestroyed) {\n          return;\n        }\n\n        var _state$elements = state.elements,\n            reference = _state$elements.reference,\n            popper = _state$elements.popper; // Don't proceed if `reference` or `popper` are not valid elements\n        // anymore\n\n        if (!areValidElements(reference, popper)) {\n          return;\n        } // Store the reference and popper rects to be read by modifiers\n\n\n        state.rects = {\n          reference: getCompositeRect(reference, getOffsetParent(popper), state.options.strategy === 'fixed'),\n          popper: getLayoutRect(popper)\n        }; // Modifiers have the ability to reset the current update cycle. The\n        // most common use case for this is the `flip` modifier changing the\n        // placement, which then needs to re-run all the modifiers, because the\n        // logic was previously ran for the previous placement and is therefore\n        // stale/incorrect\n\n        state.reset = false;\n        state.placement = state.options.placement; // On each update cycle, the `modifiersData` property for each modifier\n        // is filled with the initial data specified by the modifier. This means\n        // it doesn't persist and is fresh on each update.\n        // To ensure persistent data, use `${name}#persistent`\n\n        state.orderedModifiers.forEach(function (modifier) {\n          return state.modifiersData[modifier.name] = Object.assign({}, modifier.data);\n        });\n\n        for (var index = 0; index < state.orderedModifiers.length; index++) {\n          if (state.reset === true) {\n            state.reset = false;\n            index = -1;\n            continue;\n          }\n\n          var _state$orderedModifie = state.orderedModifiers[index],\n              fn = _state$orderedModifie.fn,\n              _state$orderedModifie2 = _state$orderedModifie.options,\n              _options = _state$orderedModifie2 === void 0 ? {} : _state$orderedModifie2,\n              name = _state$orderedModifie.name;\n\n          if (typeof fn === 'function') {\n            state = fn({\n              state: state,\n              options: _options,\n              name: name,\n              instance: instance\n            }) || state;\n          }\n        }\n      },\n      // Async and optimistically optimized update – it will not be executed if\n      // not necessary (debounced to run at most once-per-tick)\n      update: debounce(function () {\n        return new Promise(function (resolve) {\n          instance.forceUpdate();\n          resolve(state);\n        });\n      }),\n      destroy: function destroy() {\n        cleanupModifierEffects();\n        isDestroyed = true;\n      }\n    };\n\n    if (!areValidElements(reference, popper)) {\n      return instance;\n    }\n\n    instance.setOptions(options).then(function (state) {\n      if (!isDestroyed && options.onFirstUpdate) {\n        options.onFirstUpdate(state);\n      }\n    }); // Modifiers have the ability to execute arbitrary code before the first\n    // update cycle runs. They will be executed in the same order as the update\n    // cycle. This is useful when a modifier adds some persistent data that\n    // other modifiers need to use, but the modifier is run after the dependent\n    // one.\n\n    function runModifierEffects() {\n      state.orderedModifiers.forEach(function (_ref) {\n        var name = _ref.name,\n            _ref$options = _ref.options,\n            options = _ref$options === void 0 ? {} : _ref$options,\n            effect = _ref.effect;\n\n        if (typeof effect === 'function') {\n          var cleanupFn = effect({\n            state: state,\n            name: name,\n            instance: instance,\n            options: options\n          });\n\n          var noopFn = function noopFn() {};\n\n          effectCleanupFns.push(cleanupFn || noopFn);\n        }\n      });\n    }\n\n    function cleanupModifierEffects() {\n      effectCleanupFns.forEach(function (fn) {\n        return fn();\n      });\n      effectCleanupFns = [];\n    }\n\n    return instance;\n  };\n}\nexport var createPopper = /*#__PURE__*/popperGenerator(); // eslint-disable-next-line import/no-unused-modules\n\nexport { detectOverflow };","export default function debounce(fn) {\n  var pending;\n  return function () {\n    if (!pending) {\n      pending = new Promise(function (resolve) {\n        Promise.resolve().then(function () {\n          pending = undefined;\n          resolve(fn());\n        });\n      });\n    }\n\n    return pending;\n  };\n}","export default function mergeByName(modifiers) {\n  var merged = modifiers.reduce(function (merged, current) {\n    var existing = merged[current.name];\n    merged[current.name] = existing ? Object.assign({}, existing, current, {\n      options: Object.assign({}, existing.options, current.options),\n      data: Object.assign({}, existing.data, current.data)\n    }) : current;\n    return merged;\n  }, {}); // IE11 does not support Object.values\n\n  return Object.keys(merged).map(function (key) {\n    return merged[key];\n  });\n}","import { popperGenerator, detectOverflow } from \"./createPopper.js\";\nimport eventListeners from \"./modifiers/eventListeners.js\";\nimport popperOffsets from \"./modifiers/popperOffsets.js\";\nimport computeStyles from \"./modifiers/computeStyles.js\";\nimport applyStyles from \"./modifiers/applyStyles.js\";\nvar defaultModifiers = [eventListeners, popperOffsets, computeStyles, applyStyles];\nvar createPopper = /*#__PURE__*/popperGenerator({\n  defaultModifiers: defaultModifiers\n}); // eslint-disable-next-line import/no-unused-modules\n\nexport { createPopper, popperGenerator, defaultModifiers, detectOverflow };","import { popperGenerator, detectOverflow } from \"./createPopper.js\";\nimport eventListeners from \"./modifiers/eventListeners.js\";\nimport popperOffsets from \"./modifiers/popperOffsets.js\";\nimport computeStyles from \"./modifiers/computeStyles.js\";\nimport applyStyles from \"./modifiers/applyStyles.js\";\nimport offset from \"./modifiers/offset.js\";\nimport flip from \"./modifiers/flip.js\";\nimport preventOverflow from \"./modifiers/preventOverflow.js\";\nimport arrow from \"./modifiers/arrow.js\";\nimport hide from \"./modifiers/hide.js\";\nvar defaultModifiers = [eventListeners, popperOffsets, computeStyles, applyStyles, offset, flip, preventOverflow, arrow, hide];\nvar createPopper = /*#__PURE__*/popperGenerator({\n  defaultModifiers: defaultModifiers\n}); // eslint-disable-next-line import/no-unused-modules\n\nexport { createPopper, popperGenerator, defaultModifiers, detectOverflow }; // eslint-disable-next-line import/no-unused-modules\n\nexport { createPopper as createPopperLite } from \"./popper-lite.js\"; // eslint-disable-next-line import/no-unused-modules\n\nexport * from \"./modifiers/index.js\";","/**\n * --------------------------------------------------------------------------\n * Bootstrap dropdown.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\nimport * as Popper from '@popperjs/core'\nimport BaseComponent from './base-component.js'\nimport EventHandler from './dom/event-handler.js'\nimport Manipulator from './dom/manipulator.js'\nimport SelectorEngine from './dom/selector-engine.js'\nimport {\n  defineJQueryPlugin,\n  execute,\n  getElement,\n  getNextActiveElement,\n  isDisabled,\n  isElement,\n  isRTL,\n  isVisible,\n  noop\n} from './util/index.js'\n\n/**\n * Constants\n */\n\nconst NAME = 'dropdown'\nconst DATA_KEY = 'bs.dropdown'\nconst EVENT_KEY = `.${DATA_KEY}`\nconst DATA_API_KEY = '.data-api'\n\nconst ESCAPE_KEY = 'Escape'\nconst TAB_KEY = 'Tab'\nconst ARROW_UP_KEY = 'ArrowUp'\nconst ARROW_DOWN_KEY = 'ArrowDown'\nconst RIGHT_MOUSE_BUTTON = 2 // MouseEvent.button value for the secondary button, usually the right button\n\nconst EVENT_HIDE = `hide${EVENT_KEY}`\nconst EVENT_HIDDEN = `hidden${EVENT_KEY}`\nconst EVENT_SHOW = `show${EVENT_KEY}`\nconst EVENT_SHOWN = `shown${EVENT_KEY}`\nconst EVENT_CLICK_DATA_API = `click${EVENT_KEY}${DATA_API_KEY}`\nconst EVENT_KEYDOWN_DATA_API = `keydown${EVENT_KEY}${DATA_API_KEY}`\nconst EVENT_KEYUP_DATA_API = `keyup${EVENT_KEY}${DATA_API_KEY}`\n\nconst CLASS_NAME_SHOW = 'show'\nconst CLASS_NAME_DROPUP = 'dropup'\nconst CLASS_NAME_DROPEND = 'dropend'\nconst CLASS_NAME_DROPSTART = 'dropstart'\nconst CLASS_NAME_DROPUP_CENTER = 'dropup-center'\nconst CLASS_NAME_DROPDOWN_CENTER = 'dropdown-center'\n\nconst SELECTOR_DATA_TOGGLE = '[data-bs-toggle=\"dropdown\"]:not(.disabled):not(:disabled)'\nconst SELECTOR_DATA_TOGGLE_SHOWN = `${SELECTOR_DATA_TOGGLE}.${CLASS_NAME_SHOW}`\nconst SELECTOR_MENU = '.dropdown-menu'\nconst SELECTOR_NAVBAR = '.navbar'\nconst SELECTOR_NAVBAR_NAV = '.navbar-nav'\nconst SELECTOR_VISIBLE_ITEMS = '.dropdown-menu .dropdown-item:not(.disabled):not(:disabled)'\n\nconst PLACEMENT_TOP = isRTL() ? 'top-end' : 'top-start'\nconst PLACEMENT_TOPEND = isRTL() ? 'top-start' : 'top-end'\nconst PLACEMENT_BOTTOM = isRTL() ? 'bottom-end' : 'bottom-start'\nconst PLACEMENT_BOTTOMEND = isRTL() ? 'bottom-start' : 'bottom-end'\nconst PLACEMENT_RIGHT = isRTL() ? 'left-start' : 'right-start'\nconst PLACEMENT_LEFT = isRTL() ? 'right-start' : 'left-start'\nconst PLACEMENT_TOPCENTER = 'top'\nconst PLACEMENT_BOTTOMCENTER = 'bottom'\n\nconst Default = {\n  autoClose: true,\n  boundary: 'clippingParents',\n  display: 'dynamic',\n  offset: [0, 2],\n  popperConfig: null,\n  reference: 'toggle'\n}\n\nconst DefaultType = {\n  autoClose: '(boolean|string)',\n  boundary: '(string|element)',\n  display: 'string',\n  offset: '(array|string|function)',\n  popperConfig: '(null|object|function)',\n  reference: '(string|element|object)'\n}\n\n/**\n * Class definition\n */\n\nclass Dropdown extends BaseComponent {\n  constructor(element, config) {\n    super(element, config)\n\n    this._popper = null\n    this._parent = this._element.parentNode // dropdown wrapper\n    // TODO: v6 revert #37011 & change markup https://getbootstrap.com/docs/5.3/forms/input-group/\n    this._menu = SelectorEngine.next(this._element, SELECTOR_MENU)[0] ||\n      SelectorEngine.prev(this._element, SELECTOR_MENU)[0] ||\n      SelectorEngine.findOne(SELECTOR_MENU, this._parent)\n    this._inNavbar = this._detectNavbar()\n  }\n\n  // Getters\n  static get Default() {\n    return Default\n  }\n\n  static get DefaultType() {\n    return DefaultType\n  }\n\n  static get NAME() {\n    return NAME\n  }\n\n  // Public\n  toggle() {\n    return this._isShown() ? this.hide() : this.show()\n  }\n\n  show() {\n    if (isDisabled(this._element) || this._isShown()) {\n      return\n    }\n\n    const relatedTarget = {\n      relatedTarget: this._element\n    }\n\n    const showEvent = EventHandler.trigger(this._element, EVENT_SHOW, relatedTarget)\n\n    if (showEvent.defaultPrevented) {\n      return\n    }\n\n    this._createPopper()\n\n    // If this is a touch-enabled device we add extra\n    // empty mouseover listeners to the body's immediate children;\n    // only needed because of broken event delegation on iOS\n    // https://www.quirksmode.org/blog/archives/2014/02/mouse_event_bub.html\n    if ('ontouchstart' in document.documentElement && !this._parent.closest(SELECTOR_NAVBAR_NAV)) {\n      for (const element of [].concat(...document.body.children)) {\n        EventHandler.on(element, 'mouseover', noop)\n      }\n    }\n\n    this._element.focus()\n    this._element.setAttribute('aria-expanded', true)\n\n    this._menu.classList.add(CLASS_NAME_SHOW)\n    this._element.classList.add(CLASS_NAME_SHOW)\n    EventHandler.trigger(this._element, EVENT_SHOWN, relatedTarget)\n  }\n\n  hide() {\n    if (isDisabled(this._element) || !this._isShown()) {\n      return\n    }\n\n    const relatedTarget = {\n      relatedTarget: this._element\n    }\n\n    this._completeHide(relatedTarget)\n  }\n\n  dispose() {\n    if (this._popper) {\n      this._popper.destroy()\n    }\n\n    super.dispose()\n  }\n\n  update() {\n    this._inNavbar = this._detectNavbar()\n    if (this._popper) {\n      this._popper.update()\n    }\n  }\n\n  // Private\n  _completeHide(relatedTarget) {\n    const hideEvent = EventHandler.trigger(this._element, EVENT_HIDE, relatedTarget)\n    if (hideEvent.defaultPrevented) {\n      return\n    }\n\n    // If this is a touch-enabled device we remove the extra\n    // empty mouseover listeners we added for iOS support\n    if ('ontouchstart' in document.documentElement) {\n      for (const element of [].concat(...document.body.children)) {\n        EventHandler.off(element, 'mouseover', noop)\n      }\n    }\n\n    if (this._popper) {\n      this._popper.destroy()\n    }\n\n    this._menu.classList.remove(CLASS_NAME_SHOW)\n    this._element.classList.remove(CLASS_NAME_SHOW)\n    this._element.setAttribute('aria-expanded', 'false')\n    Manipulator.removeDataAttribute(this._menu, 'popper')\n    EventHandler.trigger(this._element, EVENT_HIDDEN, relatedTarget)\n  }\n\n  _getConfig(config) {\n    config = super._getConfig(config)\n\n    if (typeof config.reference === 'object' && !isElement(config.reference) &&\n      typeof config.reference.getBoundingClientRect !== 'function'\n    ) {\n      // Popper virtual elements require a getBoundingClientRect method\n      throw new TypeError(`${NAME.toUpperCase()}: Option \"reference\" provided type \"object\" without a required \"getBoundingClientRect\" method.`)\n    }\n\n    return config\n  }\n\n  _createPopper() {\n    if (typeof Popper === 'undefined') {\n      throw new TypeError('Bootstrap\\'s dropdowns require Popper (https://popper.js.org)')\n    }\n\n    let referenceElement = this._element\n\n    if (this._config.reference === 'parent') {\n      referenceElement = this._parent\n    } else if (isElement(this._config.reference)) {\n      referenceElement = getElement(this._config.reference)\n    } else if (typeof this._config.reference === 'object') {\n      referenceElement = this._config.reference\n    }\n\n    const popperConfig = this._getPopperConfig()\n    this._popper = Popper.createPopper(referenceElement, this._menu, popperConfig)\n  }\n\n  _isShown() {\n    return this._menu.classList.contains(CLASS_NAME_SHOW)\n  }\n\n  _getPlacement() {\n    const parentDropdown = this._parent\n\n    if (parentDropdown.classList.contains(CLASS_NAME_DROPEND)) {\n      return PLACEMENT_RIGHT\n    }\n\n    if (parentDropdown.classList.contains(CLASS_NAME_DROPSTART)) {\n      return PLACEMENT_LEFT\n    }\n\n    if (parentDropdown.classList.contains(CLASS_NAME_DROPUP_CENTER)) {\n      return PLACEMENT_TOPCENTER\n    }\n\n    if (parentDropdown.classList.contains(CLASS_NAME_DROPDOWN_CENTER)) {\n      return PLACEMENT_BOTTOMCENTER\n    }\n\n    // We need to trim the value because custom properties can also include spaces\n    const isEnd = getComputedStyle(this._menu).getPropertyValue('--bs-position').trim() === 'end'\n\n    if (parentDropdown.classList.contains(CLASS_NAME_DROPUP)) {\n      return isEnd ? PLACEMENT_TOPEND : PLACEMENT_TOP\n    }\n\n    return isEnd ? PLACEMENT_BOTTOMEND : PLACEMENT_BOTTOM\n  }\n\n  _detectNavbar() {\n    return this._element.closest(SELECTOR_NAVBAR) !== null\n  }\n\n  _getOffset() {\n    const { offset } = this._config\n\n    if (typeof offset === 'string') {\n      return offset.split(',').map(value => Number.parseInt(value, 10))\n    }\n\n    if (typeof offset === 'function') {\n      return popperData => offset(popperData, this._element)\n    }\n\n    return offset\n  }\n\n  _getPopperConfig() {\n    const defaultBsPopperConfig = {\n      placement: this._getPlacement(),\n      modifiers: [{\n        name: 'preventOverflow',\n        options: {\n          boundary: this._config.boundary\n        }\n      },\n      {\n        name: 'offset',\n        options: {\n          offset: this._getOffset()\n        }\n      }]\n    }\n\n    // Disable Popper if we have a static display or Dropdown is in Navbar\n    if (this._inNavbar || this._config.display === 'static') {\n      Manipulator.setDataAttribute(this._menu, 'popper', 'static') // TODO: v6 remove\n      defaultBsPopperConfig.modifiers = [{\n        name: 'applyStyles',\n        enabled: false\n      }]\n    }\n\n    return {\n      ...defaultBsPopperConfig,\n      ...execute(this._config.popperConfig, [defaultBsPopperConfig])\n    }\n  }\n\n  _selectMenuItem({ key, target }) {\n    const items = SelectorEngine.find(SELECTOR_VISIBLE_ITEMS, this._menu).filter(element => isVisible(element))\n\n    if (!items.length) {\n      return\n    }\n\n    // if target isn't included in items (e.g. when expanding the dropdown)\n    // allow cycling to get the last item in case key equals ARROW_UP_KEY\n    getNextActiveElement(items, target, key === ARROW_DOWN_KEY, !items.includes(target)).focus()\n  }\n\n  // Static\n  static jQueryInterface(config) {\n    return this.each(function () {\n      const data = Dropdown.getOrCreateInstance(this, config)\n\n      if (typeof config !== 'string') {\n        return\n      }\n\n      if (typeof data[config] === 'undefined') {\n        throw new TypeError(`No method named \"${config}\"`)\n      }\n\n      data[config]()\n    })\n  }\n\n  static clearMenus(event) {\n    if (event.button === RIGHT_MOUSE_BUTTON || (event.type === 'keyup' && event.key !== TAB_KEY)) {\n      return\n    }\n\n    const openToggles = SelectorEngine.find(SELECTOR_DATA_TOGGLE_SHOWN)\n\n    for (const toggle of openToggles) {\n      const context = Dropdown.getInstance(toggle)\n      if (!context || context._config.autoClose === false) {\n        continue\n      }\n\n      const composedPath = event.composedPath()\n      const isMenuTarget = composedPath.includes(context._menu)\n      if (\n        composedPath.includes(context._element) ||\n        (context._config.autoClose === 'inside' && !isMenuTarget) ||\n        (context._config.autoClose === 'outside' && isMenuTarget)\n      ) {\n        continue\n      }\n\n      // Tab navigation through the dropdown menu or events from contained inputs shouldn't close the menu\n      if (context._menu.contains(event.target) && ((event.type === 'keyup' && event.key === TAB_KEY) || /input|select|option|textarea|form/i.test(event.target.tagName))) {\n        continue\n      }\n\n      const relatedTarget = { relatedTarget: context._element }\n\n      if (event.type === 'click') {\n        relatedTarget.clickEvent = event\n      }\n\n      context._completeHide(relatedTarget)\n    }\n  }\n\n  static dataApiKeydownHandler(event) {\n    // If not an UP | DOWN | ESCAPE key => not a dropdown command\n    // If input/textarea && if key is other than ESCAPE => not a dropdown command\n\n    const isInput = /input|textarea/i.test(event.target.tagName)\n    const isEscapeEvent = event.key === ESCAPE_KEY\n    const isUpOrDownEvent = [ARROW_UP_KEY, ARROW_DOWN_KEY].includes(event.key)\n\n    if (!isUpOrDownEvent && !isEscapeEvent) {\n      return\n    }\n\n    if (isInput && !isEscapeEvent) {\n      return\n    }\n\n    event.preventDefault()\n\n    // TODO: v6 revert #37011 & change markup https://getbootstrap.com/docs/5.3/forms/input-group/\n    const getToggleButton = this.matches(SELECTOR_DATA_TOGGLE) ?\n      this :\n      (SelectorEngine.prev(this, SELECTOR_DATA_TOGGLE)[0] ||\n        SelectorEngine.next(this, SELECTOR_DATA_TOGGLE)[0] ||\n        SelectorEngine.findOne(SELECTOR_DATA_TOGGLE, event.delegateTarget.parentNode))\n\n    const instance = Dropdown.getOrCreateInstance(getToggleButton)\n\n    if (isUpOrDownEvent) {\n      event.stopPropagation()\n      instance.show()\n      instance._selectMenuItem(event)\n      return\n    }\n\n    if (instance._isShown()) { // else is escape and we check if it is shown\n      event.stopPropagation()\n      instance.hide()\n      getToggleButton.focus()\n    }\n  }\n}\n\n/**\n * Data API implementation\n */\n\nEventHandler.on(document, EVENT_KEYDOWN_DATA_API, SELECTOR_DATA_TOGGLE, Dropdown.dataApiKeydownHandler)\nEventHandler.on(document, EVENT_KEYDOWN_DATA_API, SELECTOR_MENU, Dropdown.dataApiKeydownHandler)\nEventHandler.on(document, EVENT_CLICK_DATA_API, Dropdown.clearMenus)\nEventHandler.on(document, EVENT_KEYUP_DATA_API, Dropdown.clearMenus)\nEventHandler.on(document, EVENT_CLICK_DATA_API, SELECTOR_DATA_TOGGLE, function (event) {\n  event.preventDefault()\n  Dropdown.getOrCreateInstance(this).toggle()\n})\n\n/**\n * jQuery\n */\n\ndefineJQueryPlugin(Dropdown)\n\nexport default Dropdown\n","/**\n * --------------------------------------------------------------------------\n * Bootstrap util/backdrop.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\nimport EventHandler from '../dom/event-handler.js'\nimport Config from './config.js'\nimport { execute, executeAfterTransition, getElement, reflow } from './index.js'\n\n/**\n * Constants\n */\n\nconst NAME = 'backdrop'\nconst CLASS_NAME_FADE = 'fade'\nconst CLASS_NAME_SHOW = 'show'\nconst EVENT_MOUSEDOWN = `mousedown.bs.${NAME}`\n\nconst Default = {\n  className: 'modal-backdrop',\n  clickCallback: null,\n  isAnimated: false,\n  isVisible: true, // if false, we use the backdrop helper without adding any element to the dom\n  rootElement: 'body' // give the choice to place backdrop under different elements\n}\n\nconst DefaultType = {\n  className: 'string',\n  clickCallback: '(function|null)',\n  isAnimated: 'boolean',\n  isVisible: 'boolean',\n  rootElement: '(element|string)'\n}\n\n/**\n * Class definition\n */\n\nclass Backdrop extends Config {\n  constructor(config) {\n    super()\n    this._config = this._getConfig(config)\n    this._isAppended = false\n    this._element = null\n  }\n\n  // Getters\n  static get Default() {\n    return Default\n  }\n\n  static get DefaultType() {\n    return DefaultType\n  }\n\n  static get NAME() {\n    return NAME\n  }\n\n  // Public\n  show(callback) {\n    if (!this._config.isVisible) {\n      execute(callback)\n      return\n    }\n\n    this._append()\n\n    const element = this._getElement()\n    if (this._config.isAnimated) {\n      reflow(element)\n    }\n\n    element.classList.add(CLASS_NAME_SHOW)\n\n    this._emulateAnimation(() => {\n      execute(callback)\n    })\n  }\n\n  hide(callback) {\n    if (!this._config.isVisible) {\n      execute(callback)\n      return\n    }\n\n    this._getElement().classList.remove(CLASS_NAME_SHOW)\n\n    this._emulateAnimation(() => {\n      this.dispose()\n      execute(callback)\n    })\n  }\n\n  dispose() {\n    if (!this._isAppended) {\n      return\n    }\n\n    EventHandler.off(this._element, EVENT_MOUSEDOWN)\n\n    this._element.remove()\n    this._isAppended = false\n  }\n\n  // Private\n  _getElement() {\n    if (!this._element) {\n      const backdrop = document.createElement('div')\n      backdrop.className = this._config.className\n      if (this._config.isAnimated) {\n        backdrop.classList.add(CLASS_NAME_FADE)\n      }\n\n      this._element = backdrop\n    }\n\n    return this._element\n  }\n\n  _configAfterMerge(config) {\n    // use getElement() with the default \"body\" to get a fresh Element on each instantiation\n    config.rootElement = getElement(config.rootElement)\n    return config\n  }\n\n  _append() {\n    if (this._isAppended) {\n      return\n    }\n\n    const element = this._getElement()\n    this._config.rootElement.append(element)\n\n    EventHandler.on(element, EVENT_MOUSEDOWN, () => {\n      execute(this._config.clickCallback)\n    })\n\n    this._isAppended = true\n  }\n\n  _emulateAnimation(callback) {\n    executeAfterTransition(callback, this._getElement(), this._config.isAnimated)\n  }\n}\n\nexport default Backdrop\n","/**\n * --------------------------------------------------------------------------\n * Bootstrap util/focustrap.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\nimport EventHandler from '../dom/event-handler.js'\nimport SelectorEngine from '../dom/selector-engine.js'\nimport Config from './config.js'\n\n/**\n * Constants\n */\n\nconst NAME = 'focustrap'\nconst DATA_KEY = 'bs.focustrap'\nconst EVENT_KEY = `.${DATA_KEY}`\nconst EVENT_FOCUSIN = `focusin${EVENT_KEY}`\nconst EVENT_KEYDOWN_TAB = `keydown.tab${EVENT_KEY}`\n\nconst TAB_KEY = 'Tab'\nconst TAB_NAV_FORWARD = 'forward'\nconst TAB_NAV_BACKWARD = 'backward'\n\nconst Default = {\n  autofocus: true,\n  trapElement: null // The element to trap focus inside of\n}\n\nconst DefaultType = {\n  autofocus: 'boolean',\n  trapElement: 'element'\n}\n\n/**\n * Class definition\n */\n\nclass FocusTrap extends Config {\n  constructor(config) {\n    super()\n    this._config = this._getConfig(config)\n    this._isActive = false\n    this._lastTabNavDirection = null\n  }\n\n  // Getters\n  static get Default() {\n    return Default\n  }\n\n  static get DefaultType() {\n    return DefaultType\n  }\n\n  static get NAME() {\n    return NAME\n  }\n\n  // Public\n  activate() {\n    if (this._isActive) {\n      return\n    }\n\n    if (this._config.autofocus) {\n      this._config.trapElement.focus()\n    }\n\n    EventHandler.off(document, EVENT_KEY) // guard against infinite focus loop\n    EventHandler.on(document, EVENT_FOCUSIN, event => this._handleFocusin(event))\n    EventHandler.on(document, EVENT_KEYDOWN_TAB, event => this._handleKeydown(event))\n\n    this._isActive = true\n  }\n\n  deactivate() {\n    if (!this._isActive) {\n      return\n    }\n\n    this._isActive = false\n    EventHandler.off(document, EVENT_KEY)\n  }\n\n  // Private\n  _handleFocusin(event) {\n    const { trapElement } = this._config\n\n    if (event.target === document || event.target === trapElement || trapElement.contains(event.target)) {\n      return\n    }\n\n    const elements = SelectorEngine.focusableChildren(trapElement)\n\n    if (elements.length === 0) {\n      trapElement.focus()\n    } else if (this._lastTabNavDirection === TAB_NAV_BACKWARD) {\n      elements[elements.length - 1].focus()\n    } else {\n      elements[0].focus()\n    }\n  }\n\n  _handleKeydown(event) {\n    if (event.key !== TAB_KEY) {\n      return\n    }\n\n    this._lastTabNavDirection = event.shiftKey ? TAB_NAV_BACKWARD : TAB_NAV_FORWARD\n  }\n}\n\nexport default FocusTrap\n","/**\n * --------------------------------------------------------------------------\n * Bootstrap util/scrollBar.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\nimport Manipulator from '../dom/manipulator.js'\nimport SelectorEngine from '../dom/selector-engine.js'\nimport { isElement } from './index.js'\n\n/**\n * Constants\n */\n\nconst SELECTOR_FIXED_CONTENT = '.fixed-top, .fixed-bottom, .is-fixed, .sticky-top'\nconst SELECTOR_STICKY_CONTENT = '.sticky-top'\nconst PROPERTY_PADDING = 'padding-right'\nconst PROPERTY_MARGIN = 'margin-right'\n\n/**\n * Class definition\n */\n\nclass ScrollBarHelper {\n  constructor() {\n    this._element = document.body\n  }\n\n  // Public\n  getWidth() {\n    // https://developer.mozilla.org/en-US/docs/Web/API/Window/innerWidth#usage_notes\n    const documentWidth = document.documentElement.clientWidth\n    return Math.abs(window.innerWidth - documentWidth)\n  }\n\n  hide() {\n    const width = this.getWidth()\n    this._disableOverFlow()\n    // give padding to element to balance the hidden scrollbar width\n    this._setElementAttributes(this._element, PROPERTY_PADDING, calculatedValue => calculatedValue + width)\n    // trick: We adjust positive paddingRight and negative marginRight to sticky-top elements to keep showing fullwidth\n    this._setElementAttributes(SELECTOR_FIXED_CONTENT, PROPERTY_PADDING, calculatedValue => calculatedValue + width)\n    this._setElementAttributes(SELECTOR_STICKY_CONTENT, PROPERTY_MARGIN, calculatedValue => calculatedValue - width)\n  }\n\n  reset() {\n    this._resetElementAttributes(this._element, 'overflow')\n    this._resetElementAttributes(this._element, PROPERTY_PADDING)\n    this._resetElementAttributes(SELECTOR_FIXED_CONTENT, PROPERTY_PADDING)\n    this._resetElementAttributes(SELECTOR_STICKY_CONTENT, PROPERTY_MARGIN)\n  }\n\n  isOverflowing() {\n    return this.getWidth() > 0\n  }\n\n  // Private\n  _disableOverFlow() {\n    this._saveInitialAttribute(this._element, 'overflow')\n    this._element.style.overflow = 'hidden'\n  }\n\n  _setElementAttributes(selector, styleProperty, callback) {\n    const scrollbarWidth = this.getWidth()\n    const manipulationCallBack = element => {\n      if (element !== this._element && window.innerWidth > element.clientWidth + scrollbarWidth) {\n        return\n      }\n\n      this._saveInitialAttribute(element, styleProperty)\n      const calculatedValue = window.getComputedStyle(element).getPropertyValue(styleProperty)\n      element.style.setProperty(styleProperty, `${callback(Number.parseFloat(calculatedValue))}px`)\n    }\n\n    this._applyManipulationCallback(selector, manipulationCallBack)\n  }\n\n  _saveInitialAttribute(element, styleProperty) {\n    const actualValue = element.style.getPropertyValue(styleProperty)\n    if (actualValue) {\n      Manipulator.setDataAttribute(element, styleProperty, actualValue)\n    }\n  }\n\n  _resetElementAttributes(selector, styleProperty) {\n    const manipulationCallBack = element => {\n      const value = Manipulator.getDataAttribute(element, styleProperty)\n      // We only want to remove the property if the value is `null`; the value can also be zero\n      if (value === null) {\n        element.style.removeProperty(styleProperty)\n        return\n      }\n\n      Manipulator.removeDataAttribute(element, styleProperty)\n      element.style.setProperty(styleProperty, value)\n    }\n\n    this._applyManipulationCallback(selector, manipulationCallBack)\n  }\n\n  _applyManipulationCallback(selector, callBack) {\n    if (isElement(selector)) {\n      callBack(selector)\n      return\n    }\n\n    for (const sel of SelectorEngine.find(selector, this._element)) {\n      callBack(sel)\n    }\n  }\n}\n\nexport default ScrollBarHelper\n","/**\n * --------------------------------------------------------------------------\n * Bootstrap modal.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\nimport BaseComponent from './base-component.js'\nimport EventHandler from './dom/event-handler.js'\nimport SelectorEngine from './dom/selector-engine.js'\nimport Backdrop from './util/backdrop.js'\nimport { enableDismissTrigger } from './util/component-functions.js'\nimport FocusTrap from './util/focustrap.js'\nimport { defineJQueryPlugin, isRTL, isVisible, reflow } from './util/index.js'\nimport ScrollBarHelper from './util/scrollbar.js'\n\n/**\n * Constants\n */\n\nconst NAME = 'modal'\nconst DATA_KEY = 'bs.modal'\nconst EVENT_KEY = `.${DATA_KEY}`\nconst DATA_API_KEY = '.data-api'\nconst ESCAPE_KEY = 'Escape'\n\nconst EVENT_HIDE = `hide${EVENT_KEY}`\nconst EVENT_HIDE_PREVENTED = `hidePrevented${EVENT_KEY}`\nconst EVENT_HIDDEN = `hidden${EVENT_KEY}`\nconst EVENT_SHOW = `show${EVENT_KEY}`\nconst EVENT_SHOWN = `shown${EVENT_KEY}`\nconst EVENT_RESIZE = `resize${EVENT_KEY}`\nconst EVENT_CLICK_DISMISS = `click.dismiss${EVENT_KEY}`\nconst EVENT_MOUSEDOWN_DISMISS = `mousedown.dismiss${EVENT_KEY}`\nconst EVENT_KEYDOWN_DISMISS = `keydown.dismiss${EVENT_KEY}`\nconst EVENT_CLICK_DATA_API = `click${EVENT_KEY}${DATA_API_KEY}`\n\nconst CLASS_NAME_OPEN = 'modal-open'\nconst CLASS_NAME_FADE = 'fade'\nconst CLASS_NAME_SHOW = 'show'\nconst CLASS_NAME_STATIC = 'modal-static'\n\nconst OPEN_SELECTOR = '.modal.show'\nconst SELECTOR_DIALOG = '.modal-dialog'\nconst SELECTOR_MODAL_BODY = '.modal-body'\nconst SELECTOR_DATA_TOGGLE = '[data-bs-toggle=\"modal\"]'\n\nconst Default = {\n  backdrop: true,\n  focus: true,\n  keyboard: true\n}\n\nconst DefaultType = {\n  backdrop: '(boolean|string)',\n  focus: 'boolean',\n  keyboard: 'boolean'\n}\n\n/**\n * Class definition\n */\n\nclass Modal extends BaseComponent {\n  constructor(element, config) {\n    super(element, config)\n\n    this._dialog = SelectorEngine.findOne(SELECTOR_DIALOG, this._element)\n    this._backdrop = this._initializeBackDrop()\n    this._focustrap = this._initializeFocusTrap()\n    this._isShown = false\n    this._isTransitioning = false\n    this._scrollBar = new ScrollBarHelper()\n\n    this._addEventListeners()\n  }\n\n  // Getters\n  static get Default() {\n    return Default\n  }\n\n  static get DefaultType() {\n    return DefaultType\n  }\n\n  static get NAME() {\n    return NAME\n  }\n\n  // Public\n  toggle(relatedTarget) {\n    return this._isShown ? this.hide() : this.show(relatedTarget)\n  }\n\n  show(relatedTarget) {\n    if (this._isShown || this._isTransitioning) {\n      return\n    }\n\n    const showEvent = EventHandler.trigger(this._element, EVENT_SHOW, {\n      relatedTarget\n    })\n\n    if (showEvent.defaultPrevented) {\n      return\n    }\n\n    this._isShown = true\n    this._isTransitioning = true\n\n    this._scrollBar.hide()\n\n    document.body.classList.add(CLASS_NAME_OPEN)\n\n    this._adjustDialog()\n\n    this._backdrop.show(() => this._showElement(relatedTarget))\n  }\n\n  hide() {\n    if (!this._isShown || this._isTransitioning) {\n      return\n    }\n\n    const hideEvent = EventHandler.trigger(this._element, EVENT_HIDE)\n\n    if (hideEvent.defaultPrevented) {\n      return\n    }\n\n    this._isShown = false\n    this._isTransitioning = true\n    this._focustrap.deactivate()\n\n    this._element.classList.remove(CLASS_NAME_SHOW)\n\n    this._queueCallback(() => this._hideModal(), this._element, this._isAnimated())\n  }\n\n  dispose() {\n    EventHandler.off(window, EVENT_KEY)\n    EventHandler.off(this._dialog, EVENT_KEY)\n\n    this._backdrop.dispose()\n    this._focustrap.deactivate()\n\n    super.dispose()\n  }\n\n  handleUpdate() {\n    this._adjustDialog()\n  }\n\n  // Private\n  _initializeBackDrop() {\n    return new Backdrop({\n      isVisible: Boolean(this._config.backdrop), // 'static' option will be translated to true, and booleans will keep their value,\n      isAnimated: this._isAnimated()\n    })\n  }\n\n  _initializeFocusTrap() {\n    return new FocusTrap({\n      trapElement: this._element\n    })\n  }\n\n  _showElement(relatedTarget) {\n    // try to append dynamic modal\n    if (!document.body.contains(this._element)) {\n      document.body.append(this._element)\n    }\n\n    this._element.style.display = 'block'\n    this._element.removeAttribute('aria-hidden')\n    this._element.setAttribute('aria-modal', true)\n    this._element.setAttribute('role', 'dialog')\n    this._element.scrollTop = 0\n\n    const modalBody = SelectorEngine.findOne(SELECTOR_MODAL_BODY, this._dialog)\n    if (modalBody) {\n      modalBody.scrollTop = 0\n    }\n\n    reflow(this._element)\n\n    this._element.classList.add(CLASS_NAME_SHOW)\n\n    const transitionComplete = () => {\n      if (this._config.focus) {\n        this._focustrap.activate()\n      }\n\n      this._isTransitioning = false\n      EventHandler.trigger(this._element, EVENT_SHOWN, {\n        relatedTarget\n      })\n    }\n\n    this._queueCallback(transitionComplete, this._dialog, this._isAnimated())\n  }\n\n  _addEventListeners() {\n    EventHandler.on(this._element, EVENT_KEYDOWN_DISMISS, event => {\n      if (event.key !== ESCAPE_KEY) {\n        return\n      }\n\n      if (this._config.keyboard) {\n        this.hide()\n        return\n      }\n\n      this._triggerBackdropTransition()\n    })\n\n    EventHandler.on(window, EVENT_RESIZE, () => {\n      if (this._isShown && !this._isTransitioning) {\n        this._adjustDialog()\n      }\n    })\n\n    EventHandler.on(this._element, EVENT_MOUSEDOWN_DISMISS, event => {\n      // a bad trick to segregate clicks that may start inside dialog but end outside, and avoid listen to scrollbar clicks\n      EventHandler.one(this._element, EVENT_CLICK_DISMISS, event2 => {\n        if (this._element !== event.target || this._element !== event2.target) {\n          return\n        }\n\n        if (this._config.backdrop === 'static') {\n          this._triggerBackdropTransition()\n          return\n        }\n\n        if (this._config.backdrop) {\n          this.hide()\n        }\n      })\n    })\n  }\n\n  _hideModal() {\n    this._element.style.display = 'none'\n    this._element.setAttribute('aria-hidden', true)\n    this._element.removeAttribute('aria-modal')\n    this._element.removeAttribute('role')\n    this._isTransitioning = false\n\n    this._backdrop.hide(() => {\n      document.body.classList.remove(CLASS_NAME_OPEN)\n      this._resetAdjustments()\n      this._scrollBar.reset()\n      EventHandler.trigger(this._element, EVENT_HIDDEN)\n    })\n  }\n\n  _isAnimated() {\n    return this._element.classList.contains(CLASS_NAME_FADE)\n  }\n\n  _triggerBackdropTransition() {\n    const hideEvent = EventHandler.trigger(this._element, EVENT_HIDE_PREVENTED)\n    if (hideEvent.defaultPrevented) {\n      return\n    }\n\n    const isModalOverflowing = this._element.scrollHeight > document.documentElement.clientHeight\n    const initialOverflowY = this._element.style.overflowY\n    // return if the following background transition hasn't yet completed\n    if (initialOverflowY === 'hidden' || this._element.classList.contains(CLASS_NAME_STATIC)) {\n      return\n    }\n\n    if (!isModalOverflowing) {\n      this._element.style.overflowY = 'hidden'\n    }\n\n    this._element.classList.add(CLASS_NAME_STATIC)\n    this._queueCallback(() => {\n      this._element.classList.remove(CLASS_NAME_STATIC)\n      this._queueCallback(() => {\n        this._element.style.overflowY = initialOverflowY\n      }, this._dialog)\n    }, this._dialog)\n\n    this._element.focus()\n  }\n\n  /**\n   * The following methods are used to handle overflowing modals\n   */\n\n  _adjustDialog() {\n    const isModalOverflowing = this._element.scrollHeight > document.documentElement.clientHeight\n    const scrollbarWidth = this._scrollBar.getWidth()\n    const isBodyOverflowing = scrollbarWidth > 0\n\n    if (isBodyOverflowing && !isModalOverflowing) {\n      const property = isRTL() ? 'paddingLeft' : 'paddingRight'\n      this._element.style[property] = `${scrollbarWidth}px`\n    }\n\n    if (!isBodyOverflowing && isModalOverflowing) {\n      const property = isRTL() ? 'paddingRight' : 'paddingLeft'\n      this._element.style[property] = `${scrollbarWidth}px`\n    }\n  }\n\n  _resetAdjustments() {\n    this._element.style.paddingLeft = ''\n    this._element.style.paddingRight = ''\n  }\n\n  // Static\n  static jQueryInterface(config, relatedTarget) {\n    return this.each(function () {\n      const data = Modal.getOrCreateInstance(this, config)\n\n      if (typeof config !== 'string') {\n        return\n      }\n\n      if (typeof data[config] === 'undefined') {\n        throw new TypeError(`No method named \"${config}\"`)\n      }\n\n      data[config](relatedTarget)\n    })\n  }\n}\n\n/**\n * Data API implementation\n */\n\nEventHandler.on(document, EVENT_CLICK_DATA_API, SELECTOR_DATA_TOGGLE, function (event) {\n  const target = SelectorEngine.getElementFromSelector(this)\n\n  if (['A', 'AREA'].includes(this.tagName)) {\n    event.preventDefault()\n  }\n\n  EventHandler.one(target, EVENT_SHOW, showEvent => {\n    if (showEvent.defaultPrevented) {\n      // only register focus restorer if modal will actually get shown\n      return\n    }\n\n    EventHandler.one(target, EVENT_HIDDEN, () => {\n      if (isVisible(this)) {\n        this.focus()\n      }\n    })\n  })\n\n  // avoid conflict when clicking modal toggler while another one is open\n  const alreadyOpen = SelectorEngine.findOne(OPEN_SELECTOR)\n  if (alreadyOpen) {\n    Modal.getInstance(alreadyOpen).hide()\n  }\n\n  const data = Modal.getOrCreateInstance(target)\n\n  data.toggle(this)\n})\n\nenableDismissTrigger(Modal)\n\n/**\n * jQuery\n */\n\ndefineJQueryPlugin(Modal)\n\nexport default Modal\n","/**\n * --------------------------------------------------------------------------\n * Bootstrap offcanvas.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\nimport BaseComponent from './base-component.js'\nimport EventHandler from './dom/event-handler.js'\nimport SelectorEngine from './dom/selector-engine.js'\nimport Backdrop from './util/backdrop.js'\nimport { enableDismissTrigger } from './util/component-functions.js'\nimport FocusTrap from './util/focustrap.js'\nimport {\n  defineJQueryPlugin,\n  isDisabled,\n  isVisible\n} from './util/index.js'\nimport ScrollBarHelper from './util/scrollbar.js'\n\n/**\n * Constants\n */\n\nconst NAME = 'offcanvas'\nconst DATA_KEY = 'bs.offcanvas'\nconst EVENT_KEY = `.${DATA_KEY}`\nconst DATA_API_KEY = '.data-api'\nconst EVENT_LOAD_DATA_API = `load${EVENT_KEY}${DATA_API_KEY}`\nconst ESCAPE_KEY = 'Escape'\n\nconst CLASS_NAME_SHOW = 'show'\nconst CLASS_NAME_SHOWING = 'showing'\nconst CLASS_NAME_HIDING = 'hiding'\nconst CLASS_NAME_BACKDROP = 'offcanvas-backdrop'\nconst OPEN_SELECTOR = '.offcanvas.show'\n\nconst EVENT_SHOW = `show${EVENT_KEY}`\nconst EVENT_SHOWN = `shown${EVENT_KEY}`\nconst EVENT_HIDE = `hide${EVENT_KEY}`\nconst EVENT_HIDE_PREVENTED = `hidePrevented${EVENT_KEY}`\nconst EVENT_HIDDEN = `hidden${EVENT_KEY}`\nconst EVENT_RESIZE = `resize${EVENT_KEY}`\nconst EVENT_CLICK_DATA_API = `click${EVENT_KEY}${DATA_API_KEY}`\nconst EVENT_KEYDOWN_DISMISS = `keydown.dismiss${EVENT_KEY}`\n\nconst SELECTOR_DATA_TOGGLE = '[data-bs-toggle=\"offcanvas\"]'\n\nconst Default = {\n  backdrop: true,\n  keyboard: true,\n  scroll: false\n}\n\nconst DefaultType = {\n  backdrop: '(boolean|string)',\n  keyboard: 'boolean',\n  scroll: 'boolean'\n}\n\n/**\n * Class definition\n */\n\nclass Offcanvas extends BaseComponent {\n  constructor(element, config) {\n    super(element, config)\n\n    this._isShown = false\n    this._backdrop = this._initializeBackDrop()\n    this._focustrap = this._initializeFocusTrap()\n    this._addEventListeners()\n  }\n\n  // Getters\n  static get Default() {\n    return Default\n  }\n\n  static get DefaultType() {\n    return DefaultType\n  }\n\n  static get NAME() {\n    return NAME\n  }\n\n  // Public\n  toggle(relatedTarget) {\n    return this._isShown ? this.hide() : this.show(relatedTarget)\n  }\n\n  show(relatedTarget) {\n    if (this._isShown) {\n      return\n    }\n\n    const showEvent = EventHandler.trigger(this._element, EVENT_SHOW, { relatedTarget })\n\n    if (showEvent.defaultPrevented) {\n      return\n    }\n\n    this._isShown = true\n    this._backdrop.show()\n\n    if (!this._config.scroll) {\n      new ScrollBarHelper().hide()\n    }\n\n    this._element.setAttribute('aria-modal', true)\n    this._element.setAttribute('role', 'dialog')\n    this._element.classList.add(CLASS_NAME_SHOWING)\n\n    const completeCallBack = () => {\n      if (!this._config.scroll || this._config.backdrop) {\n        this._focustrap.activate()\n      }\n\n      this._element.classList.add(CLASS_NAME_SHOW)\n      this._element.classList.remove(CLASS_NAME_SHOWING)\n      EventHandler.trigger(this._element, EVENT_SHOWN, { relatedTarget })\n    }\n\n    this._queueCallback(completeCallBack, this._element, true)\n  }\n\n  hide() {\n    if (!this._isShown) {\n      return\n    }\n\n    const hideEvent = EventHandler.trigger(this._element, EVENT_HIDE)\n\n    if (hideEvent.defaultPrevented) {\n      return\n    }\n\n    this._focustrap.deactivate()\n    this._element.blur()\n    this._isShown = false\n    this._element.classList.add(CLASS_NAME_HIDING)\n    this._backdrop.hide()\n\n    const completeCallback = () => {\n      this._element.classList.remove(CLASS_NAME_SHOW, CLASS_NAME_HIDING)\n      this._element.removeAttribute('aria-modal')\n      this._element.removeAttribute('role')\n\n      if (!this._config.scroll) {\n        new ScrollBarHelper().reset()\n      }\n\n      EventHandler.trigger(this._element, EVENT_HIDDEN)\n    }\n\n    this._queueCallback(completeCallback, this._element, true)\n  }\n\n  dispose() {\n    this._backdrop.dispose()\n    this._focustrap.deactivate()\n    super.dispose()\n  }\n\n  // Private\n  _initializeBackDrop() {\n    const clickCallback = () => {\n      if (this._config.backdrop === 'static') {\n        EventHandler.trigger(this._element, EVENT_HIDE_PREVENTED)\n        return\n      }\n\n      this.hide()\n    }\n\n    // 'static' option will be translated to true, and booleans will keep their value\n    const isVisible = Boolean(this._config.backdrop)\n\n    return new Backdrop({\n      className: CLASS_NAME_BACKDROP,\n      isVisible,\n      isAnimated: true,\n      rootElement: this._element.parentNode,\n      clickCallback: isVisible ? clickCallback : null\n    })\n  }\n\n  _initializeFocusTrap() {\n    return new FocusTrap({\n      trapElement: this._element\n    })\n  }\n\n  _addEventListeners() {\n    EventHandler.on(this._element, EVENT_KEYDOWN_DISMISS, event => {\n      if (event.key !== ESCAPE_KEY) {\n        return\n      }\n\n      if (this._config.keyboard) {\n        this.hide()\n        return\n      }\n\n      EventHandler.trigger(this._element, EVENT_HIDE_PREVENTED)\n    })\n  }\n\n  // Static\n  static jQueryInterface(config) {\n    return this.each(function () {\n      const data = Offcanvas.getOrCreateInstance(this, config)\n\n      if (typeof config !== 'string') {\n        return\n      }\n\n      if (data[config] === undefined || config.startsWith('_') || config === 'constructor') {\n        throw new TypeError(`No method named \"${config}\"`)\n      }\n\n      data[config](this)\n    })\n  }\n}\n\n/**\n * Data API implementation\n */\n\nEventHandler.on(document, EVENT_CLICK_DATA_API, SELECTOR_DATA_TOGGLE, function (event) {\n  const target = SelectorEngine.getElementFromSelector(this)\n\n  if (['A', 'AREA'].includes(this.tagName)) {\n    event.preventDefault()\n  }\n\n  if (isDisabled(this)) {\n    return\n  }\n\n  EventHandler.one(target, EVENT_HIDDEN, () => {\n    // focus on trigger when it is closed\n    if (isVisible(this)) {\n      this.focus()\n    }\n  })\n\n  // avoid conflict when clicking a toggler of an offcanvas, while another is open\n  const alreadyOpen = SelectorEngine.findOne(OPEN_SELECTOR)\n  if (alreadyOpen && alreadyOpen !== target) {\n    Offcanvas.getInstance(alreadyOpen).hide()\n  }\n\n  const data = Offcanvas.getOrCreateInstance(target)\n  data.toggle(this)\n})\n\nEventHandler.on(window, EVENT_LOAD_DATA_API, () => {\n  for (const selector of SelectorEngine.find(OPEN_SELECTOR)) {\n    Offcanvas.getOrCreateInstance(selector).show()\n  }\n})\n\nEventHandler.on(window, EVENT_RESIZE, () => {\n  for (const element of SelectorEngine.find('[aria-modal][class*=show][class*=offcanvas-]')) {\n    if (getComputedStyle(element).position !== 'fixed') {\n      Offcanvas.getOrCreateInstance(element).hide()\n    }\n  }\n})\n\nenableDismissTrigger(Offcanvas)\n\n/**\n * jQuery\n */\n\ndefineJQueryPlugin(Offcanvas)\n\nexport default Offcanvas\n","/**\n * --------------------------------------------------------------------------\n * Bootstrap util/sanitizer.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\n// js-docs-start allow-list\nconst ARIA_ATTRIBUTE_PATTERN = /^aria-[\\w-]*$/i\n\nexport const DefaultAllowlist = {\n  // Global attributes allowed on any supplied element below.\n  '*': ['class', 'dir', 'id', 'lang', 'role', ARIA_ATTRIBUTE_PATTERN],\n  a: ['target', 'href', 'title', 'rel'],\n  area: [],\n  b: [],\n  br: [],\n  col: [],\n  code: [],\n  div: [],\n  em: [],\n  hr: [],\n  h1: [],\n  h2: [],\n  h3: [],\n  h4: [],\n  h5: [],\n  h6: [],\n  i: [],\n  img: ['src', 'srcset', 'alt', 'title', 'width', 'height'],\n  li: [],\n  ol: [],\n  p: [],\n  pre: [],\n  s: [],\n  small: [],\n  span: [],\n  sub: [],\n  sup: [],\n  strong: [],\n  u: [],\n  ul: []\n}\n// js-docs-end allow-list\n\nconst uriAttributes = new Set([\n  'background',\n  'cite',\n  'href',\n  'itemtype',\n  'longdesc',\n  'poster',\n  'src',\n  'xlink:href'\n])\n\n/**\n * A pattern that recognizes URLs that are safe wrt. XSS in URL navigation\n * contexts.\n *\n * Shout-out to Angular https://github.com/angular/angular/blob/15.2.8/packages/core/src/sanitization/url_sanitizer.ts#L38\n */\n// eslint-disable-next-line unicorn/better-regex\nconst SAFE_URL_PATTERN = /^(?!javascript:)(?:[a-z0-9+.-]+:|[^&:/?#]*(?:[/?#]|$))/i\n\nconst allowedAttribute = (attribute, allowedAttributeList) => {\n  const attributeName = attribute.nodeName.toLowerCase()\n\n  if (allowedAttributeList.includes(attributeName)) {\n    if (uriAttributes.has(attributeName)) {\n      return Boolean(SAFE_URL_PATTERN.test(attribute.nodeValue))\n    }\n\n    return true\n  }\n\n  // Check if a regular expression validates the attribute.\n  return allowedAttributeList.filter(attributeRegex => attributeRegex instanceof RegExp)\n    .some(regex => regex.test(attributeName))\n}\n\nexport function sanitizeHtml(unsafeHtml, allowList, sanitizeFunction) {\n  if (!unsafeHtml.length) {\n    return unsafeHtml\n  }\n\n  if (sanitizeFunction && typeof sanitizeFunction === 'function') {\n    return sanitizeFunction(unsafeHtml)\n  }\n\n  const domParser = new window.DOMParser()\n  const createdDocument = domParser.parseFromString(unsafeHtml, 'text/html')\n  const elements = [].concat(...createdDocument.body.querySelectorAll('*'))\n\n  for (const element of elements) {\n    const elementName = element.nodeName.toLowerCase()\n\n    if (!Object.keys(allowList).includes(elementName)) {\n      element.remove()\n      continue\n    }\n\n    const attributeList = [].concat(...element.attributes)\n    const allowedAttributes = [].concat(allowList['*'] || [], allowList[elementName] || [])\n\n    for (const attribute of attributeList) {\n      if (!allowedAttribute(attribute, allowedAttributes)) {\n        element.removeAttribute(attribute.nodeName)\n      }\n    }\n  }\n\n  return createdDocument.body.innerHTML\n}\n","/**\n * --------------------------------------------------------------------------\n * Bootstrap util/template-factory.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\nimport SelectorEngine from '../dom/selector-engine.js'\nimport Config from './config.js'\nimport { DefaultAllowlist, sanitizeHtml } from './sanitizer.js'\nimport { execute, getElement, isElement } from './index.js'\n\n/**\n * Constants\n */\n\nconst NAME = 'TemplateFactory'\n\nconst Default = {\n  allowList: DefaultAllowlist,\n  content: {}, // { selector : text ,  selector2 : text2 , }\n  extraClass: '',\n  html: false,\n  sanitize: true,\n  sanitizeFn: null,\n  template: '
      '\n}\n\nconst DefaultType = {\n  allowList: 'object',\n  content: 'object',\n  extraClass: '(string|function)',\n  html: 'boolean',\n  sanitize: 'boolean',\n  sanitizeFn: '(null|function)',\n  template: 'string'\n}\n\nconst DefaultContentType = {\n  entry: '(string|element|function|null)',\n  selector: '(string|element)'\n}\n\n/**\n * Class definition\n */\n\nclass TemplateFactory extends Config {\n  constructor(config) {\n    super()\n    this._config = this._getConfig(config)\n  }\n\n  // Getters\n  static get Default() {\n    return Default\n  }\n\n  static get DefaultType() {\n    return DefaultType\n  }\n\n  static get NAME() {\n    return NAME\n  }\n\n  // Public\n  getContent() {\n    return Object.values(this._config.content)\n      .map(config => this._resolvePossibleFunction(config))\n      .filter(Boolean)\n  }\n\n  hasContent() {\n    return this.getContent().length > 0\n  }\n\n  changeContent(content) {\n    this._checkContent(content)\n    this._config.content = { ...this._config.content, ...content }\n    return this\n  }\n\n  toHtml() {\n    const templateWrapper = document.createElement('div')\n    templateWrapper.innerHTML = this._maybeSanitize(this._config.template)\n\n    for (const [selector, text] of Object.entries(this._config.content)) {\n      this._setContent(templateWrapper, text, selector)\n    }\n\n    const template = templateWrapper.children[0]\n    const extraClass = this._resolvePossibleFunction(this._config.extraClass)\n\n    if (extraClass) {\n      template.classList.add(...extraClass.split(' '))\n    }\n\n    return template\n  }\n\n  // Private\n  _typeCheckConfig(config) {\n    super._typeCheckConfig(config)\n    this._checkContent(config.content)\n  }\n\n  _checkContent(arg) {\n    for (const [selector, content] of Object.entries(arg)) {\n      super._typeCheckConfig({ selector, entry: content }, DefaultContentType)\n    }\n  }\n\n  _setContent(template, content, selector) {\n    const templateElement = SelectorEngine.findOne(selector, template)\n\n    if (!templateElement) {\n      return\n    }\n\n    content = this._resolvePossibleFunction(content)\n\n    if (!content) {\n      templateElement.remove()\n      return\n    }\n\n    if (isElement(content)) {\n      this._putElementInTemplate(getElement(content), templateElement)\n      return\n    }\n\n    if (this._config.html) {\n      templateElement.innerHTML = this._maybeSanitize(content)\n      return\n    }\n\n    templateElement.textContent = content\n  }\n\n  _maybeSanitize(arg) {\n    return this._config.sanitize ? sanitizeHtml(arg, this._config.allowList, this._config.sanitizeFn) : arg\n  }\n\n  _resolvePossibleFunction(arg) {\n    return execute(arg, [this])\n  }\n\n  _putElementInTemplate(element, templateElement) {\n    if (this._config.html) {\n      templateElement.innerHTML = ''\n      templateElement.append(element)\n      return\n    }\n\n    templateElement.textContent = element.textContent\n  }\n}\n\nexport default TemplateFactory\n","/**\n * --------------------------------------------------------------------------\n * Bootstrap tooltip.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\nimport * as Popper from '@popperjs/core'\nimport BaseComponent from './base-component.js'\nimport EventHandler from './dom/event-handler.js'\nimport Manipulator from './dom/manipulator.js'\nimport { defineJQueryPlugin, execute, findShadowRoot, getElement, getUID, isRTL, noop } from './util/index.js'\nimport { DefaultAllowlist } from './util/sanitizer.js'\nimport TemplateFactory from './util/template-factory.js'\n\n/**\n * Constants\n */\n\nconst NAME = 'tooltip'\nconst DISALLOWED_ATTRIBUTES = new Set(['sanitize', 'allowList', 'sanitizeFn'])\n\nconst CLASS_NAME_FADE = 'fade'\nconst CLASS_NAME_MODAL = 'modal'\nconst CLASS_NAME_SHOW = 'show'\n\nconst SELECTOR_TOOLTIP_INNER = '.tooltip-inner'\nconst SELECTOR_MODAL = `.${CLASS_NAME_MODAL}`\n\nconst EVENT_MODAL_HIDE = 'hide.bs.modal'\n\nconst TRIGGER_HOVER = 'hover'\nconst TRIGGER_FOCUS = 'focus'\nconst TRIGGER_CLICK = 'click'\nconst TRIGGER_MANUAL = 'manual'\n\nconst EVENT_HIDE = 'hide'\nconst EVENT_HIDDEN = 'hidden'\nconst EVENT_SHOW = 'show'\nconst EVENT_SHOWN = 'shown'\nconst EVENT_INSERTED = 'inserted'\nconst EVENT_CLICK = 'click'\nconst EVENT_FOCUSIN = 'focusin'\nconst EVENT_FOCUSOUT = 'focusout'\nconst EVENT_MOUSEENTER = 'mouseenter'\nconst EVENT_MOUSELEAVE = 'mouseleave'\n\nconst AttachmentMap = {\n  AUTO: 'auto',\n  TOP: 'top',\n  RIGHT: isRTL() ? 'left' : 'right',\n  BOTTOM: 'bottom',\n  LEFT: isRTL() ? 'right' : 'left'\n}\n\nconst Default = {\n  allowList: DefaultAllowlist,\n  animation: true,\n  boundary: 'clippingParents',\n  container: false,\n  customClass: '',\n  delay: 0,\n  fallbackPlacements: ['top', 'right', 'bottom', 'left'],\n  html: false,\n  offset: [0, 6],\n  placement: 'top',\n  popperConfig: null,\n  sanitize: true,\n  sanitizeFn: null,\n  selector: false,\n  template: '
      ' +\n            '
      ' +\n            '
      ' +\n            '
      ',\n  title: '',\n  trigger: 'hover focus'\n}\n\nconst DefaultType = {\n  allowList: 'object',\n  animation: 'boolean',\n  boundary: '(string|element)',\n  container: '(string|element|boolean)',\n  customClass: '(string|function)',\n  delay: '(number|object)',\n  fallbackPlacements: 'array',\n  html: 'boolean',\n  offset: '(array|string|function)',\n  placement: '(string|function)',\n  popperConfig: '(null|object|function)',\n  sanitize: 'boolean',\n  sanitizeFn: '(null|function)',\n  selector: '(string|boolean)',\n  template: 'string',\n  title: '(string|element|function)',\n  trigger: 'string'\n}\n\n/**\n * Class definition\n */\n\nclass Tooltip extends BaseComponent {\n  constructor(element, config) {\n    if (typeof Popper === 'undefined') {\n      throw new TypeError('Bootstrap\\'s tooltips require Popper (https://popper.js.org)')\n    }\n\n    super(element, config)\n\n    // Private\n    this._isEnabled = true\n    this._timeout = 0\n    this._isHovered = null\n    this._activeTrigger = {}\n    this._popper = null\n    this._templateFactory = null\n    this._newContent = null\n\n    // Protected\n    this.tip = null\n\n    this._setListeners()\n\n    if (!this._config.selector) {\n      this._fixTitle()\n    }\n  }\n\n  // Getters\n  static get Default() {\n    return Default\n  }\n\n  static get DefaultType() {\n    return DefaultType\n  }\n\n  static get NAME() {\n    return NAME\n  }\n\n  // Public\n  enable() {\n    this._isEnabled = true\n  }\n\n  disable() {\n    this._isEnabled = false\n  }\n\n  toggleEnabled() {\n    this._isEnabled = !this._isEnabled\n  }\n\n  toggle() {\n    if (!this._isEnabled) {\n      return\n    }\n\n    this._activeTrigger.click = !this._activeTrigger.click\n    if (this._isShown()) {\n      this._leave()\n      return\n    }\n\n    this._enter()\n  }\n\n  dispose() {\n    clearTimeout(this._timeout)\n\n    EventHandler.off(this._element.closest(SELECTOR_MODAL), EVENT_MODAL_HIDE, this._hideModalHandler)\n\n    if (this._element.getAttribute('data-bs-original-title')) {\n      this._element.setAttribute('title', this._element.getAttribute('data-bs-original-title'))\n    }\n\n    this._disposePopper()\n    super.dispose()\n  }\n\n  show() {\n    if (this._element.style.display === 'none') {\n      throw new Error('Please use show on visible elements')\n    }\n\n    if (!(this._isWithContent() && this._isEnabled)) {\n      return\n    }\n\n    const showEvent = EventHandler.trigger(this._element, this.constructor.eventName(EVENT_SHOW))\n    const shadowRoot = findShadowRoot(this._element)\n    const isInTheDom = (shadowRoot || this._element.ownerDocument.documentElement).contains(this._element)\n\n    if (showEvent.defaultPrevented || !isInTheDom) {\n      return\n    }\n\n    // TODO: v6 remove this or make it optional\n    this._disposePopper()\n\n    const tip = this._getTipElement()\n\n    this._element.setAttribute('aria-describedby', tip.getAttribute('id'))\n\n    const { container } = this._config\n\n    if (!this._element.ownerDocument.documentElement.contains(this.tip)) {\n      container.append(tip)\n      EventHandler.trigger(this._element, this.constructor.eventName(EVENT_INSERTED))\n    }\n\n    this._popper = this._createPopper(tip)\n\n    tip.classList.add(CLASS_NAME_SHOW)\n\n    // If this is a touch-enabled device we add extra\n    // empty mouseover listeners to the body's immediate children;\n    // only needed because of broken event delegation on iOS\n    // https://www.quirksmode.org/blog/archives/2014/02/mouse_event_bub.html\n    if ('ontouchstart' in document.documentElement) {\n      for (const element of [].concat(...document.body.children)) {\n        EventHandler.on(element, 'mouseover', noop)\n      }\n    }\n\n    const complete = () => {\n      EventHandler.trigger(this._element, this.constructor.eventName(EVENT_SHOWN))\n\n      if (this._isHovered === false) {\n        this._leave()\n      }\n\n      this._isHovered = false\n    }\n\n    this._queueCallback(complete, this.tip, this._isAnimated())\n  }\n\n  hide() {\n    if (!this._isShown()) {\n      return\n    }\n\n    const hideEvent = EventHandler.trigger(this._element, this.constructor.eventName(EVENT_HIDE))\n    if (hideEvent.defaultPrevented) {\n      return\n    }\n\n    const tip = this._getTipElement()\n    tip.classList.remove(CLASS_NAME_SHOW)\n\n    // If this is a touch-enabled device we remove the extra\n    // empty mouseover listeners we added for iOS support\n    if ('ontouchstart' in document.documentElement) {\n      for (const element of [].concat(...document.body.children)) {\n        EventHandler.off(element, 'mouseover', noop)\n      }\n    }\n\n    this._activeTrigger[TRIGGER_CLICK] = false\n    this._activeTrigger[TRIGGER_FOCUS] = false\n    this._activeTrigger[TRIGGER_HOVER] = false\n    this._isHovered = null // it is a trick to support manual triggering\n\n    const complete = () => {\n      if (this._isWithActiveTrigger()) {\n        return\n      }\n\n      if (!this._isHovered) {\n        this._disposePopper()\n      }\n\n      this._element.removeAttribute('aria-describedby')\n      EventHandler.trigger(this._element, this.constructor.eventName(EVENT_HIDDEN))\n    }\n\n    this._queueCallback(complete, this.tip, this._isAnimated())\n  }\n\n  update() {\n    if (this._popper) {\n      this._popper.update()\n    }\n  }\n\n  // Protected\n  _isWithContent() {\n    return Boolean(this._getTitle())\n  }\n\n  _getTipElement() {\n    if (!this.tip) {\n      this.tip = this._createTipElement(this._newContent || this._getContentForTemplate())\n    }\n\n    return this.tip\n  }\n\n  _createTipElement(content) {\n    const tip = this._getTemplateFactory(content).toHtml()\n\n    // TODO: remove this check in v6\n    if (!tip) {\n      return null\n    }\n\n    tip.classList.remove(CLASS_NAME_FADE, CLASS_NAME_SHOW)\n    // TODO: v6 the following can be achieved with CSS only\n    tip.classList.add(`bs-${this.constructor.NAME}-auto`)\n\n    const tipId = getUID(this.constructor.NAME).toString()\n\n    tip.setAttribute('id', tipId)\n\n    if (this._isAnimated()) {\n      tip.classList.add(CLASS_NAME_FADE)\n    }\n\n    return tip\n  }\n\n  setContent(content) {\n    this._newContent = content\n    if (this._isShown()) {\n      this._disposePopper()\n      this.show()\n    }\n  }\n\n  _getTemplateFactory(content) {\n    if (this._templateFactory) {\n      this._templateFactory.changeContent(content)\n    } else {\n      this._templateFactory = new TemplateFactory({\n        ...this._config,\n        // the `content` var has to be after `this._config`\n        // to override config.content in case of popover\n        content,\n        extraClass: this._resolvePossibleFunction(this._config.customClass)\n      })\n    }\n\n    return this._templateFactory\n  }\n\n  _getContentForTemplate() {\n    return {\n      [SELECTOR_TOOLTIP_INNER]: this._getTitle()\n    }\n  }\n\n  _getTitle() {\n    return this._resolvePossibleFunction(this._config.title) || this._element.getAttribute('data-bs-original-title')\n  }\n\n  // Private\n  _initializeOnDelegatedTarget(event) {\n    return this.constructor.getOrCreateInstance(event.delegateTarget, this._getDelegateConfig())\n  }\n\n  _isAnimated() {\n    return this._config.animation || (this.tip && this.tip.classList.contains(CLASS_NAME_FADE))\n  }\n\n  _isShown() {\n    return this.tip && this.tip.classList.contains(CLASS_NAME_SHOW)\n  }\n\n  _createPopper(tip) {\n    const placement = execute(this._config.placement, [this, tip, this._element])\n    const attachment = AttachmentMap[placement.toUpperCase()]\n    return Popper.createPopper(this._element, tip, this._getPopperConfig(attachment))\n  }\n\n  _getOffset() {\n    const { offset } = this._config\n\n    if (typeof offset === 'string') {\n      return offset.split(',').map(value => Number.parseInt(value, 10))\n    }\n\n    if (typeof offset === 'function') {\n      return popperData => offset(popperData, this._element)\n    }\n\n    return offset\n  }\n\n  _resolvePossibleFunction(arg) {\n    return execute(arg, [this._element])\n  }\n\n  _getPopperConfig(attachment) {\n    const defaultBsPopperConfig = {\n      placement: attachment,\n      modifiers: [\n        {\n          name: 'flip',\n          options: {\n            fallbackPlacements: this._config.fallbackPlacements\n          }\n        },\n        {\n          name: 'offset',\n          options: {\n            offset: this._getOffset()\n          }\n        },\n        {\n          name: 'preventOverflow',\n          options: {\n            boundary: this._config.boundary\n          }\n        },\n        {\n          name: 'arrow',\n          options: {\n            element: `.${this.constructor.NAME}-arrow`\n          }\n        },\n        {\n          name: 'preSetPlacement',\n          enabled: true,\n          phase: 'beforeMain',\n          fn: data => {\n            // Pre-set Popper's placement attribute in order to read the arrow sizes properly.\n            // Otherwise, Popper mixes up the width and height dimensions since the initial arrow style is for top placement\n            this._getTipElement().setAttribute('data-popper-placement', data.state.placement)\n          }\n        }\n      ]\n    }\n\n    return {\n      ...defaultBsPopperConfig,\n      ...execute(this._config.popperConfig, [defaultBsPopperConfig])\n    }\n  }\n\n  _setListeners() {\n    const triggers = this._config.trigger.split(' ')\n\n    for (const trigger of triggers) {\n      if (trigger === 'click') {\n        EventHandler.on(this._element, this.constructor.eventName(EVENT_CLICK), this._config.selector, event => {\n          const context = this._initializeOnDelegatedTarget(event)\n          context.toggle()\n        })\n      } else if (trigger !== TRIGGER_MANUAL) {\n        const eventIn = trigger === TRIGGER_HOVER ?\n          this.constructor.eventName(EVENT_MOUSEENTER) :\n          this.constructor.eventName(EVENT_FOCUSIN)\n        const eventOut = trigger === TRIGGER_HOVER ?\n          this.constructor.eventName(EVENT_MOUSELEAVE) :\n          this.constructor.eventName(EVENT_FOCUSOUT)\n\n        EventHandler.on(this._element, eventIn, this._config.selector, event => {\n          const context = this._initializeOnDelegatedTarget(event)\n          context._activeTrigger[event.type === 'focusin' ? TRIGGER_FOCUS : TRIGGER_HOVER] = true\n          context._enter()\n        })\n        EventHandler.on(this._element, eventOut, this._config.selector, event => {\n          const context = this._initializeOnDelegatedTarget(event)\n          context._activeTrigger[event.type === 'focusout' ? TRIGGER_FOCUS : TRIGGER_HOVER] =\n            context._element.contains(event.relatedTarget)\n\n          context._leave()\n        })\n      }\n    }\n\n    this._hideModalHandler = () => {\n      if (this._element) {\n        this.hide()\n      }\n    }\n\n    EventHandler.on(this._element.closest(SELECTOR_MODAL), EVENT_MODAL_HIDE, this._hideModalHandler)\n  }\n\n  _fixTitle() {\n    const title = this._element.getAttribute('title')\n\n    if (!title) {\n      return\n    }\n\n    if (!this._element.getAttribute('aria-label') && !this._element.textContent.trim()) {\n      this._element.setAttribute('aria-label', title)\n    }\n\n    this._element.setAttribute('data-bs-original-title', title) // DO NOT USE IT. Is only for backwards compatibility\n    this._element.removeAttribute('title')\n  }\n\n  _enter() {\n    if (this._isShown() || this._isHovered) {\n      this._isHovered = true\n      return\n    }\n\n    this._isHovered = true\n\n    this._setTimeout(() => {\n      if (this._isHovered) {\n        this.show()\n      }\n    }, this._config.delay.show)\n  }\n\n  _leave() {\n    if (this._isWithActiveTrigger()) {\n      return\n    }\n\n    this._isHovered = false\n\n    this._setTimeout(() => {\n      if (!this._isHovered) {\n        this.hide()\n      }\n    }, this._config.delay.hide)\n  }\n\n  _setTimeout(handler, timeout) {\n    clearTimeout(this._timeout)\n    this._timeout = setTimeout(handler, timeout)\n  }\n\n  _isWithActiveTrigger() {\n    return Object.values(this._activeTrigger).includes(true)\n  }\n\n  _getConfig(config) {\n    const dataAttributes = Manipulator.getDataAttributes(this._element)\n\n    for (const dataAttribute of Object.keys(dataAttributes)) {\n      if (DISALLOWED_ATTRIBUTES.has(dataAttribute)) {\n        delete dataAttributes[dataAttribute]\n      }\n    }\n\n    config = {\n      ...dataAttributes,\n      ...(typeof config === 'object' && config ? config : {})\n    }\n    config = this._mergeConfigObj(config)\n    config = this._configAfterMerge(config)\n    this._typeCheckConfig(config)\n    return config\n  }\n\n  _configAfterMerge(config) {\n    config.container = config.container === false ? document.body : getElement(config.container)\n\n    if (typeof config.delay === 'number') {\n      config.delay = {\n        show: config.delay,\n        hide: config.delay\n      }\n    }\n\n    if (typeof config.title === 'number') {\n      config.title = config.title.toString()\n    }\n\n    if (typeof config.content === 'number') {\n      config.content = config.content.toString()\n    }\n\n    return config\n  }\n\n  _getDelegateConfig() {\n    const config = {}\n\n    for (const [key, value] of Object.entries(this._config)) {\n      if (this.constructor.Default[key] !== value) {\n        config[key] = value\n      }\n    }\n\n    config.selector = false\n    config.trigger = 'manual'\n\n    // In the future can be replaced with:\n    // const keysWithDifferentValues = Object.entries(this._config).filter(entry => this.constructor.Default[entry[0]] !== this._config[entry[0]])\n    // `Object.fromEntries(keysWithDifferentValues)`\n    return config\n  }\n\n  _disposePopper() {\n    if (this._popper) {\n      this._popper.destroy()\n      this._popper = null\n    }\n\n    if (this.tip) {\n      this.tip.remove()\n      this.tip = null\n    }\n  }\n\n  // Static\n  static jQueryInterface(config) {\n    return this.each(function () {\n      const data = Tooltip.getOrCreateInstance(this, config)\n\n      if (typeof config !== 'string') {\n        return\n      }\n\n      if (typeof data[config] === 'undefined') {\n        throw new TypeError(`No method named \"${config}\"`)\n      }\n\n      data[config]()\n    })\n  }\n}\n\n/**\n * jQuery\n */\n\ndefineJQueryPlugin(Tooltip)\n\nexport default Tooltip\n","/**\n * --------------------------------------------------------------------------\n * Bootstrap popover.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\nimport Tooltip from './tooltip.js'\nimport { defineJQueryPlugin } from './util/index.js'\n\n/**\n * Constants\n */\n\nconst NAME = 'popover'\n\nconst SELECTOR_TITLE = '.popover-header'\nconst SELECTOR_CONTENT = '.popover-body'\n\nconst Default = {\n  ...Tooltip.Default,\n  content: '',\n  offset: [0, 8],\n  placement: 'right',\n  template: '
      ' +\n    '
      ' +\n    '
      ' +\n    '
      ' +\n    '
      ',\n  trigger: 'click'\n}\n\nconst DefaultType = {\n  ...Tooltip.DefaultType,\n  content: '(null|string|element|function)'\n}\n\n/**\n * Class definition\n */\n\nclass Popover extends Tooltip {\n  // Getters\n  static get Default() {\n    return Default\n  }\n\n  static get DefaultType() {\n    return DefaultType\n  }\n\n  static get NAME() {\n    return NAME\n  }\n\n  // Overrides\n  _isWithContent() {\n    return this._getTitle() || this._getContent()\n  }\n\n  // Private\n  _getContentForTemplate() {\n    return {\n      [SELECTOR_TITLE]: this._getTitle(),\n      [SELECTOR_CONTENT]: this._getContent()\n    }\n  }\n\n  _getContent() {\n    return this._resolvePossibleFunction(this._config.content)\n  }\n\n  // Static\n  static jQueryInterface(config) {\n    return this.each(function () {\n      const data = Popover.getOrCreateInstance(this, config)\n\n      if (typeof config !== 'string') {\n        return\n      }\n\n      if (typeof data[config] === 'undefined') {\n        throw new TypeError(`No method named \"${config}\"`)\n      }\n\n      data[config]()\n    })\n  }\n}\n\n/**\n * jQuery\n */\n\ndefineJQueryPlugin(Popover)\n\nexport default Popover\n","/**\n * --------------------------------------------------------------------------\n * Bootstrap scrollspy.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\nimport BaseComponent from './base-component.js'\nimport EventHandler from './dom/event-handler.js'\nimport SelectorEngine from './dom/selector-engine.js'\nimport { defineJQueryPlugin, getElement, isDisabled, isVisible } from './util/index.js'\n\n/**\n * Constants\n */\n\nconst NAME = 'scrollspy'\nconst DATA_KEY = 'bs.scrollspy'\nconst EVENT_KEY = `.${DATA_KEY}`\nconst DATA_API_KEY = '.data-api'\n\nconst EVENT_ACTIVATE = `activate${EVENT_KEY}`\nconst EVENT_CLICK = `click${EVENT_KEY}`\nconst EVENT_LOAD_DATA_API = `load${EVENT_KEY}${DATA_API_KEY}`\n\nconst CLASS_NAME_DROPDOWN_ITEM = 'dropdown-item'\nconst CLASS_NAME_ACTIVE = 'active'\n\nconst SELECTOR_DATA_SPY = '[data-bs-spy=\"scroll\"]'\nconst SELECTOR_TARGET_LINKS = '[href]'\nconst SELECTOR_NAV_LIST_GROUP = '.nav, .list-group'\nconst SELECTOR_NAV_LINKS = '.nav-link'\nconst SELECTOR_NAV_ITEMS = '.nav-item'\nconst SELECTOR_LIST_ITEMS = '.list-group-item'\nconst SELECTOR_LINK_ITEMS = `${SELECTOR_NAV_LINKS}, ${SELECTOR_NAV_ITEMS} > ${SELECTOR_NAV_LINKS}, ${SELECTOR_LIST_ITEMS}`\nconst SELECTOR_DROPDOWN = '.dropdown'\nconst SELECTOR_DROPDOWN_TOGGLE = '.dropdown-toggle'\n\nconst Default = {\n  offset: null, // TODO: v6 @deprecated, keep it for backwards compatibility reasons\n  rootMargin: '0px 0px -25%',\n  smoothScroll: false,\n  target: null,\n  threshold: [0.1, 0.5, 1]\n}\n\nconst DefaultType = {\n  offset: '(number|null)', // TODO v6 @deprecated, keep it for backwards compatibility reasons\n  rootMargin: 'string',\n  smoothScroll: 'boolean',\n  target: 'element',\n  threshold: 'array'\n}\n\n/**\n * Class definition\n */\n\nclass ScrollSpy extends BaseComponent {\n  constructor(element, config) {\n    super(element, config)\n\n    // this._element is the observablesContainer and config.target the menu links wrapper\n    this._targetLinks = new Map()\n    this._observableSections = new Map()\n    this._rootElement = getComputedStyle(this._element).overflowY === 'visible' ? null : this._element\n    this._activeTarget = null\n    this._observer = null\n    this._previousScrollData = {\n      visibleEntryTop: 0,\n      parentScrollTop: 0\n    }\n    this.refresh() // initialize\n  }\n\n  // Getters\n  static get Default() {\n    return Default\n  }\n\n  static get DefaultType() {\n    return DefaultType\n  }\n\n  static get NAME() {\n    return NAME\n  }\n\n  // Public\n  refresh() {\n    this._initializeTargetsAndObservables()\n    this._maybeEnableSmoothScroll()\n\n    if (this._observer) {\n      this._observer.disconnect()\n    } else {\n      this._observer = this._getNewObserver()\n    }\n\n    for (const section of this._observableSections.values()) {\n      this._observer.observe(section)\n    }\n  }\n\n  dispose() {\n    this._observer.disconnect()\n    super.dispose()\n  }\n\n  // Private\n  _configAfterMerge(config) {\n    // TODO: on v6 target should be given explicitly & remove the {target: 'ss-target'} case\n    config.target = getElement(config.target) || document.body\n\n    // TODO: v6 Only for backwards compatibility reasons. Use rootMargin only\n    config.rootMargin = config.offset ? `${config.offset}px 0px -30%` : config.rootMargin\n\n    if (typeof config.threshold === 'string') {\n      config.threshold = config.threshold.split(',').map(value => Number.parseFloat(value))\n    }\n\n    return config\n  }\n\n  _maybeEnableSmoothScroll() {\n    if (!this._config.smoothScroll) {\n      return\n    }\n\n    // unregister any previous listeners\n    EventHandler.off(this._config.target, EVENT_CLICK)\n\n    EventHandler.on(this._config.target, EVENT_CLICK, SELECTOR_TARGET_LINKS, event => {\n      const observableSection = this._observableSections.get(event.target.hash)\n      if (observableSection) {\n        event.preventDefault()\n        const root = this._rootElement || window\n        const height = observableSection.offsetTop - this._element.offsetTop\n        if (root.scrollTo) {\n          root.scrollTo({ top: height, behavior: 'smooth' })\n          return\n        }\n\n        // Chrome 60 doesn't support `scrollTo`\n        root.scrollTop = height\n      }\n    })\n  }\n\n  _getNewObserver() {\n    const options = {\n      root: this._rootElement,\n      threshold: this._config.threshold,\n      rootMargin: this._config.rootMargin\n    }\n\n    return new IntersectionObserver(entries => this._observerCallback(entries), options)\n  }\n\n  // The logic of selection\n  _observerCallback(entries) {\n    const targetElement = entry => this._targetLinks.get(`#${entry.target.id}`)\n    const activate = entry => {\n      this._previousScrollData.visibleEntryTop = entry.target.offsetTop\n      this._process(targetElement(entry))\n    }\n\n    const parentScrollTop = (this._rootElement || document.documentElement).scrollTop\n    const userScrollsDown = parentScrollTop >= this._previousScrollData.parentScrollTop\n    this._previousScrollData.parentScrollTop = parentScrollTop\n\n    for (const entry of entries) {\n      if (!entry.isIntersecting) {\n        this._activeTarget = null\n        this._clearActiveClass(targetElement(entry))\n\n        continue\n      }\n\n      const entryIsLowerThanPrevious = entry.target.offsetTop >= this._previousScrollData.visibleEntryTop\n      // if we are scrolling down, pick the bigger offsetTop\n      if (userScrollsDown && entryIsLowerThanPrevious) {\n        activate(entry)\n        // if parent isn't scrolled, let's keep the first visible item, breaking the iteration\n        if (!parentScrollTop) {\n          return\n        }\n\n        continue\n      }\n\n      // if we are scrolling up, pick the smallest offsetTop\n      if (!userScrollsDown && !entryIsLowerThanPrevious) {\n        activate(entry)\n      }\n    }\n  }\n\n  _initializeTargetsAndObservables() {\n    this._targetLinks = new Map()\n    this._observableSections = new Map()\n\n    const targetLinks = SelectorEngine.find(SELECTOR_TARGET_LINKS, this._config.target)\n\n    for (const anchor of targetLinks) {\n      // ensure that the anchor has an id and is not disabled\n      if (!anchor.hash || isDisabled(anchor)) {\n        continue\n      }\n\n      const observableSection = SelectorEngine.findOne(decodeURI(anchor.hash), this._element)\n\n      // ensure that the observableSection exists & is visible\n      if (isVisible(observableSection)) {\n        this._targetLinks.set(decodeURI(anchor.hash), anchor)\n        this._observableSections.set(anchor.hash, observableSection)\n      }\n    }\n  }\n\n  _process(target) {\n    if (this._activeTarget === target) {\n      return\n    }\n\n    this._clearActiveClass(this._config.target)\n    this._activeTarget = target\n    target.classList.add(CLASS_NAME_ACTIVE)\n    this._activateParents(target)\n\n    EventHandler.trigger(this._element, EVENT_ACTIVATE, { relatedTarget: target })\n  }\n\n  _activateParents(target) {\n    // Activate dropdown parents\n    if (target.classList.contains(CLASS_NAME_DROPDOWN_ITEM)) {\n      SelectorEngine.findOne(SELECTOR_DROPDOWN_TOGGLE, target.closest(SELECTOR_DROPDOWN))\n        .classList.add(CLASS_NAME_ACTIVE)\n      return\n    }\n\n    for (const listGroup of SelectorEngine.parents(target, SELECTOR_NAV_LIST_GROUP)) {\n      // Set triggered links parents as active\n      // With both 
         and 
      ')},createChildNavList:function(e){var t=this.createNavList();return e.append(t),t},generateNavEl:function(e,t){var n=a('      ');n.attr("href","#"+e),n.text(t);var r=a("
    • ");return r.append(n),r},generateNavItem:function(e){var t=this.generateAnchor(e),n=a(e),r=n.data("toc-text")||n.text();return this.generateNavEl(t,r)},getTopLevel:function(e){for(var t=1;t<=6;t++){if(1
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/dev/deps/font-awesome-6.4.2/css/all.css b/dev/deps/font-awesome-6.4.2/css/all.css
new file mode 100644
index 000000000..bdb6e3ae8
--- /dev/null
+++ b/dev/deps/font-awesome-6.4.2/css/all.css
@@ -0,0 +1,7968 @@
+/*!
+ * Font Awesome Free 6.4.2 by @fontawesome - https://fontawesome.com
+ * License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License)
+ * Copyright 2023 Fonticons, Inc.
+ */
+.fa {
+  font-family: var(--fa-style-family, "Font Awesome 6 Free");
+  font-weight: var(--fa-style, 900); }
+
+.fa,
+.fa-classic,
+.fa-sharp,
+.fas,
+.fa-solid,
+.far,
+.fa-regular,
+.fab,
+.fa-brands {
+  -moz-osx-font-smoothing: grayscale;
+  -webkit-font-smoothing: antialiased;
+  display: var(--fa-display, inline-block);
+  font-style: normal;
+  font-variant: normal;
+  line-height: 1;
+  text-rendering: auto; }
+
+.fas,
+.fa-classic,
+.fa-solid,
+.far,
+.fa-regular {
+  font-family: 'Font Awesome 6 Free'; }
+
+.fab,
+.fa-brands {
+  font-family: 'Font Awesome 6 Brands'; }
+
+.fa-1x {
+  font-size: 1em; }
+
+.fa-2x {
+  font-size: 2em; }
+
+.fa-3x {
+  font-size: 3em; }
+
+.fa-4x {
+  font-size: 4em; }
+
+.fa-5x {
+  font-size: 5em; }
+
+.fa-6x {
+  font-size: 6em; }
+
+.fa-7x {
+  font-size: 7em; }
+
+.fa-8x {
+  font-size: 8em; }
+
+.fa-9x {
+  font-size: 9em; }
+
+.fa-10x {
+  font-size: 10em; }
+
+.fa-2xs {
+  font-size: 0.625em;
+  line-height: 0.1em;
+  vertical-align: 0.225em; }
+
+.fa-xs {
+  font-size: 0.75em;
+  line-height: 0.08333em;
+  vertical-align: 0.125em; }
+
+.fa-sm {
+  font-size: 0.875em;
+  line-height: 0.07143em;
+  vertical-align: 0.05357em; }
+
+.fa-lg {
+  font-size: 1.25em;
+  line-height: 0.05em;
+  vertical-align: -0.075em; }
+
+.fa-xl {
+  font-size: 1.5em;
+  line-height: 0.04167em;
+  vertical-align: -0.125em; }
+
+.fa-2xl {
+  font-size: 2em;
+  line-height: 0.03125em;
+  vertical-align: -0.1875em; }
+
+.fa-fw {
+  text-align: center;
+  width: 1.25em; }
+
+.fa-ul {
+  list-style-type: none;
+  margin-left: var(--fa-li-margin, 2.5em);
+  padding-left: 0; }
+  .fa-ul > li {
+    position: relative; }
+
+.fa-li {
+  left: calc(var(--fa-li-width, 2em) * -1);
+  position: absolute;
+  text-align: center;
+  width: var(--fa-li-width, 2em);
+  line-height: inherit; }
+
+.fa-border {
+  border-color: var(--fa-border-color, #eee);
+  border-radius: var(--fa-border-radius, 0.1em);
+  border-style: var(--fa-border-style, solid);
+  border-width: var(--fa-border-width, 0.08em);
+  padding: var(--fa-border-padding, 0.2em 0.25em 0.15em); }
+
+.fa-pull-left {
+  float: left;
+  margin-right: var(--fa-pull-margin, 0.3em); }
+
+.fa-pull-right {
+  float: right;
+  margin-left: var(--fa-pull-margin, 0.3em); }
+
+.fa-beat {
+  -webkit-animation-name: fa-beat;
+          animation-name: fa-beat;
+  -webkit-animation-delay: var(--fa-animation-delay, 0s);
+          animation-delay: var(--fa-animation-delay, 0s);
+  -webkit-animation-direction: var(--fa-animation-direction, normal);
+          animation-direction: var(--fa-animation-direction, normal);
+  -webkit-animation-duration: var(--fa-animation-duration, 1s);
+          animation-duration: var(--fa-animation-duration, 1s);
+  -webkit-animation-iteration-count: var(--fa-animation-iteration-count, infinite);
+          animation-iteration-count: var(--fa-animation-iteration-count, infinite);
+  -webkit-animation-timing-function: var(--fa-animation-timing, ease-in-out);
+          animation-timing-function: var(--fa-animation-timing, ease-in-out); }
+
+.fa-bounce {
+  -webkit-animation-name: fa-bounce;
+          animation-name: fa-bounce;
+  -webkit-animation-delay: var(--fa-animation-delay, 0s);
+          animation-delay: var(--fa-animation-delay, 0s);
+  -webkit-animation-direction: var(--fa-animation-direction, normal);
+          animation-direction: var(--fa-animation-direction, normal);
+  -webkit-animation-duration: var(--fa-animation-duration, 1s);
+          animation-duration: var(--fa-animation-duration, 1s);
+  -webkit-animation-iteration-count: var(--fa-animation-iteration-count, infinite);
+          animation-iteration-count: var(--fa-animation-iteration-count, infinite);
+  -webkit-animation-timing-function: var(--fa-animation-timing, cubic-bezier(0.28, 0.84, 0.42, 1));
+          animation-timing-function: var(--fa-animation-timing, cubic-bezier(0.28, 0.84, 0.42, 1)); }
+
+.fa-fade {
+  -webkit-animation-name: fa-fade;
+          animation-name: fa-fade;
+  -webkit-animation-delay: var(--fa-animation-delay, 0s);
+          animation-delay: var(--fa-animation-delay, 0s);
+  -webkit-animation-direction: var(--fa-animation-direction, normal);
+          animation-direction: var(--fa-animation-direction, normal);
+  -webkit-animation-duration: var(--fa-animation-duration, 1s);
+          animation-duration: var(--fa-animation-duration, 1s);
+  -webkit-animation-iteration-count: var(--fa-animation-iteration-count, infinite);
+          animation-iteration-count: var(--fa-animation-iteration-count, infinite);
+  -webkit-animation-timing-function: var(--fa-animation-timing, cubic-bezier(0.4, 0, 0.6, 1));
+          animation-timing-function: var(--fa-animation-timing, cubic-bezier(0.4, 0, 0.6, 1)); }
+
+.fa-beat-fade {
+  -webkit-animation-name: fa-beat-fade;
+          animation-name: fa-beat-fade;
+  -webkit-animation-delay: var(--fa-animation-delay, 0s);
+          animation-delay: var(--fa-animation-delay, 0s);
+  -webkit-animation-direction: var(--fa-animation-direction, normal);
+          animation-direction: var(--fa-animation-direction, normal);
+  -webkit-animation-duration: var(--fa-animation-duration, 1s);
+          animation-duration: var(--fa-animation-duration, 1s);
+  -webkit-animation-iteration-count: var(--fa-animation-iteration-count, infinite);
+          animation-iteration-count: var(--fa-animation-iteration-count, infinite);
+  -webkit-animation-timing-function: var(--fa-animation-timing, cubic-bezier(0.4, 0, 0.6, 1));
+          animation-timing-function: var(--fa-animation-timing, cubic-bezier(0.4, 0, 0.6, 1)); }
+
+.fa-flip {
+  -webkit-animation-name: fa-flip;
+          animation-name: fa-flip;
+  -webkit-animation-delay: var(--fa-animation-delay, 0s);
+          animation-delay: var(--fa-animation-delay, 0s);
+  -webkit-animation-direction: var(--fa-animation-direction, normal);
+          animation-direction: var(--fa-animation-direction, normal);
+  -webkit-animation-duration: var(--fa-animation-duration, 1s);
+          animation-duration: var(--fa-animation-duration, 1s);
+  -webkit-animation-iteration-count: var(--fa-animation-iteration-count, infinite);
+          animation-iteration-count: var(--fa-animation-iteration-count, infinite);
+  -webkit-animation-timing-function: var(--fa-animation-timing, ease-in-out);
+          animation-timing-function: var(--fa-animation-timing, ease-in-out); }
+
+.fa-shake {
+  -webkit-animation-name: fa-shake;
+          animation-name: fa-shake;
+  -webkit-animation-delay: var(--fa-animation-delay, 0s);
+          animation-delay: var(--fa-animation-delay, 0s);
+  -webkit-animation-direction: var(--fa-animation-direction, normal);
+          animation-direction: var(--fa-animation-direction, normal);
+  -webkit-animation-duration: var(--fa-animation-duration, 1s);
+          animation-duration: var(--fa-animation-duration, 1s);
+  -webkit-animation-iteration-count: var(--fa-animation-iteration-count, infinite);
+          animation-iteration-count: var(--fa-animation-iteration-count, infinite);
+  -webkit-animation-timing-function: var(--fa-animation-timing, linear);
+          animation-timing-function: var(--fa-animation-timing, linear); }
+
+.fa-spin {
+  -webkit-animation-name: fa-spin;
+          animation-name: fa-spin;
+  -webkit-animation-delay: var(--fa-animation-delay, 0s);
+          animation-delay: var(--fa-animation-delay, 0s);
+  -webkit-animation-direction: var(--fa-animation-direction, normal);
+          animation-direction: var(--fa-animation-direction, normal);
+  -webkit-animation-duration: var(--fa-animation-duration, 2s);
+          animation-duration: var(--fa-animation-duration, 2s);
+  -webkit-animation-iteration-count: var(--fa-animation-iteration-count, infinite);
+          animation-iteration-count: var(--fa-animation-iteration-count, infinite);
+  -webkit-animation-timing-function: var(--fa-animation-timing, linear);
+          animation-timing-function: var(--fa-animation-timing, linear); }
+
+.fa-spin-reverse {
+  --fa-animation-direction: reverse; }
+
+.fa-pulse,
+.fa-spin-pulse {
+  -webkit-animation-name: fa-spin;
+          animation-name: fa-spin;
+  -webkit-animation-direction: var(--fa-animation-direction, normal);
+          animation-direction: var(--fa-animation-direction, normal);
+  -webkit-animation-duration: var(--fa-animation-duration, 1s);
+          animation-duration: var(--fa-animation-duration, 1s);
+  -webkit-animation-iteration-count: var(--fa-animation-iteration-count, infinite);
+          animation-iteration-count: var(--fa-animation-iteration-count, infinite);
+  -webkit-animation-timing-function: var(--fa-animation-timing, steps(8));
+          animation-timing-function: var(--fa-animation-timing, steps(8)); }
+
+@media (prefers-reduced-motion: reduce) {
+  .fa-beat,
+  .fa-bounce,
+  .fa-fade,
+  .fa-beat-fade,
+  .fa-flip,
+  .fa-pulse,
+  .fa-shake,
+  .fa-spin,
+  .fa-spin-pulse {
+    -webkit-animation-delay: -1ms;
+            animation-delay: -1ms;
+    -webkit-animation-duration: 1ms;
+            animation-duration: 1ms;
+    -webkit-animation-iteration-count: 1;
+            animation-iteration-count: 1;
+    -webkit-transition-delay: 0s;
+            transition-delay: 0s;
+    -webkit-transition-duration: 0s;
+            transition-duration: 0s; } }
+
+@-webkit-keyframes fa-beat {
+  0%, 90% {
+    -webkit-transform: scale(1);
+            transform: scale(1); }
+  45% {
+    -webkit-transform: scale(var(--fa-beat-scale, 1.25));
+            transform: scale(var(--fa-beat-scale, 1.25)); } }
+
+@keyframes fa-beat {
+  0%, 90% {
+    -webkit-transform: scale(1);
+            transform: scale(1); }
+  45% {
+    -webkit-transform: scale(var(--fa-beat-scale, 1.25));
+            transform: scale(var(--fa-beat-scale, 1.25)); } }
+
+@-webkit-keyframes fa-bounce {
+  0% {
+    -webkit-transform: scale(1, 1) translateY(0);
+            transform: scale(1, 1) translateY(0); }
+  10% {
+    -webkit-transform: scale(var(--fa-bounce-start-scale-x, 1.1), var(--fa-bounce-start-scale-y, 0.9)) translateY(0);
+            transform: scale(var(--fa-bounce-start-scale-x, 1.1), var(--fa-bounce-start-scale-y, 0.9)) translateY(0); }
+  30% {
+    -webkit-transform: scale(var(--fa-bounce-jump-scale-x, 0.9), var(--fa-bounce-jump-scale-y, 1.1)) translateY(var(--fa-bounce-height, -0.5em));
+            transform: scale(var(--fa-bounce-jump-scale-x, 0.9), var(--fa-bounce-jump-scale-y, 1.1)) translateY(var(--fa-bounce-height, -0.5em)); }
+  50% {
+    -webkit-transform: scale(var(--fa-bounce-land-scale-x, 1.05), var(--fa-bounce-land-scale-y, 0.95)) translateY(0);
+            transform: scale(var(--fa-bounce-land-scale-x, 1.05), var(--fa-bounce-land-scale-y, 0.95)) translateY(0); }
+  57% {
+    -webkit-transform: scale(1, 1) translateY(var(--fa-bounce-rebound, -0.125em));
+            transform: scale(1, 1) translateY(var(--fa-bounce-rebound, -0.125em)); }
+  64% {
+    -webkit-transform: scale(1, 1) translateY(0);
+            transform: scale(1, 1) translateY(0); }
+  100% {
+    -webkit-transform: scale(1, 1) translateY(0);
+            transform: scale(1, 1) translateY(0); } }
+
+@keyframes fa-bounce {
+  0% {
+    -webkit-transform: scale(1, 1) translateY(0);
+            transform: scale(1, 1) translateY(0); }
+  10% {
+    -webkit-transform: scale(var(--fa-bounce-start-scale-x, 1.1), var(--fa-bounce-start-scale-y, 0.9)) translateY(0);
+            transform: scale(var(--fa-bounce-start-scale-x, 1.1), var(--fa-bounce-start-scale-y, 0.9)) translateY(0); }
+  30% {
+    -webkit-transform: scale(var(--fa-bounce-jump-scale-x, 0.9), var(--fa-bounce-jump-scale-y, 1.1)) translateY(var(--fa-bounce-height, -0.5em));
+            transform: scale(var(--fa-bounce-jump-scale-x, 0.9), var(--fa-bounce-jump-scale-y, 1.1)) translateY(var(--fa-bounce-height, -0.5em)); }
+  50% {
+    -webkit-transform: scale(var(--fa-bounce-land-scale-x, 1.05), var(--fa-bounce-land-scale-y, 0.95)) translateY(0);
+            transform: scale(var(--fa-bounce-land-scale-x, 1.05), var(--fa-bounce-land-scale-y, 0.95)) translateY(0); }
+  57% {
+    -webkit-transform: scale(1, 1) translateY(var(--fa-bounce-rebound, -0.125em));
+            transform: scale(1, 1) translateY(var(--fa-bounce-rebound, -0.125em)); }
+  64% {
+    -webkit-transform: scale(1, 1) translateY(0);
+            transform: scale(1, 1) translateY(0); }
+  100% {
+    -webkit-transform: scale(1, 1) translateY(0);
+            transform: scale(1, 1) translateY(0); } }
+
+@-webkit-keyframes fa-fade {
+  50% {
+    opacity: var(--fa-fade-opacity, 0.4); } }
+
+@keyframes fa-fade {
+  50% {
+    opacity: var(--fa-fade-opacity, 0.4); } }
+
+@-webkit-keyframes fa-beat-fade {
+  0%, 100% {
+    opacity: var(--fa-beat-fade-opacity, 0.4);
+    -webkit-transform: scale(1);
+            transform: scale(1); }
+  50% {
+    opacity: 1;
+    -webkit-transform: scale(var(--fa-beat-fade-scale, 1.125));
+            transform: scale(var(--fa-beat-fade-scale, 1.125)); } }
+
+@keyframes fa-beat-fade {
+  0%, 100% {
+    opacity: var(--fa-beat-fade-opacity, 0.4);
+    -webkit-transform: scale(1);
+            transform: scale(1); }
+  50% {
+    opacity: 1;
+    -webkit-transform: scale(var(--fa-beat-fade-scale, 1.125));
+            transform: scale(var(--fa-beat-fade-scale, 1.125)); } }
+
+@-webkit-keyframes fa-flip {
+  50% {
+    -webkit-transform: rotate3d(var(--fa-flip-x, 0), var(--fa-flip-y, 1), var(--fa-flip-z, 0), var(--fa-flip-angle, -180deg));
+            transform: rotate3d(var(--fa-flip-x, 0), var(--fa-flip-y, 1), var(--fa-flip-z, 0), var(--fa-flip-angle, -180deg)); } }
+
+@keyframes fa-flip {
+  50% {
+    -webkit-transform: rotate3d(var(--fa-flip-x, 0), var(--fa-flip-y, 1), var(--fa-flip-z, 0), var(--fa-flip-angle, -180deg));
+            transform: rotate3d(var(--fa-flip-x, 0), var(--fa-flip-y, 1), var(--fa-flip-z, 0), var(--fa-flip-angle, -180deg)); } }
+
+@-webkit-keyframes fa-shake {
+  0% {
+    -webkit-transform: rotate(-15deg);
+            transform: rotate(-15deg); }
+  4% {
+    -webkit-transform: rotate(15deg);
+            transform: rotate(15deg); }
+  8%, 24% {
+    -webkit-transform: rotate(-18deg);
+            transform: rotate(-18deg); }
+  12%, 28% {
+    -webkit-transform: rotate(18deg);
+            transform: rotate(18deg); }
+  16% {
+    -webkit-transform: rotate(-22deg);
+            transform: rotate(-22deg); }
+  20% {
+    -webkit-transform: rotate(22deg);
+            transform: rotate(22deg); }
+  32% {
+    -webkit-transform: rotate(-12deg);
+            transform: rotate(-12deg); }
+  36% {
+    -webkit-transform: rotate(12deg);
+            transform: rotate(12deg); }
+  40%, 100% {
+    -webkit-transform: rotate(0deg);
+            transform: rotate(0deg); } }
+
+@keyframes fa-shake {
+  0% {
+    -webkit-transform: rotate(-15deg);
+            transform: rotate(-15deg); }
+  4% {
+    -webkit-transform: rotate(15deg);
+            transform: rotate(15deg); }
+  8%, 24% {
+    -webkit-transform: rotate(-18deg);
+            transform: rotate(-18deg); }
+  12%, 28% {
+    -webkit-transform: rotate(18deg);
+            transform: rotate(18deg); }
+  16% {
+    -webkit-transform: rotate(-22deg);
+            transform: rotate(-22deg); }
+  20% {
+    -webkit-transform: rotate(22deg);
+            transform: rotate(22deg); }
+  32% {
+    -webkit-transform: rotate(-12deg);
+            transform: rotate(-12deg); }
+  36% {
+    -webkit-transform: rotate(12deg);
+            transform: rotate(12deg); }
+  40%, 100% {
+    -webkit-transform: rotate(0deg);
+            transform: rotate(0deg); } }
+
+@-webkit-keyframes fa-spin {
+  0% {
+    -webkit-transform: rotate(0deg);
+            transform: rotate(0deg); }
+  100% {
+    -webkit-transform: rotate(360deg);
+            transform: rotate(360deg); } }
+
+@keyframes fa-spin {
+  0% {
+    -webkit-transform: rotate(0deg);
+            transform: rotate(0deg); }
+  100% {
+    -webkit-transform: rotate(360deg);
+            transform: rotate(360deg); } }
+
+.fa-rotate-90 {
+  -webkit-transform: rotate(90deg);
+          transform: rotate(90deg); }
+
+.fa-rotate-180 {
+  -webkit-transform: rotate(180deg);
+          transform: rotate(180deg); }
+
+.fa-rotate-270 {
+  -webkit-transform: rotate(270deg);
+          transform: rotate(270deg); }
+
+.fa-flip-horizontal {
+  -webkit-transform: scale(-1, 1);
+          transform: scale(-1, 1); }
+
+.fa-flip-vertical {
+  -webkit-transform: scale(1, -1);
+          transform: scale(1, -1); }
+
+.fa-flip-both,
+.fa-flip-horizontal.fa-flip-vertical {
+  -webkit-transform: scale(-1, -1);
+          transform: scale(-1, -1); }
+
+.fa-rotate-by {
+  -webkit-transform: rotate(var(--fa-rotate-angle, none));
+          transform: rotate(var(--fa-rotate-angle, none)); }
+
+.fa-stack {
+  display: inline-block;
+  height: 2em;
+  line-height: 2em;
+  position: relative;
+  vertical-align: middle;
+  width: 2.5em; }
+
+.fa-stack-1x,
+.fa-stack-2x {
+  left: 0;
+  position: absolute;
+  text-align: center;
+  width: 100%;
+  z-index: var(--fa-stack-z-index, auto); }
+
+.fa-stack-1x {
+  line-height: inherit; }
+
+.fa-stack-2x {
+  font-size: 2em; }
+
+.fa-inverse {
+  color: var(--fa-inverse, #fff); }
+
+/* Font Awesome uses the Unicode Private Use Area (PUA) to ensure screen
+readers do not read off random characters that represent icons */
+
+.fa-0::before {
+  content: "\30"; }
+
+.fa-1::before {
+  content: "\31"; }
+
+.fa-2::before {
+  content: "\32"; }
+
+.fa-3::before {
+  content: "\33"; }
+
+.fa-4::before {
+  content: "\34"; }
+
+.fa-5::before {
+  content: "\35"; }
+
+.fa-6::before {
+  content: "\36"; }
+
+.fa-7::before {
+  content: "\37"; }
+
+.fa-8::before {
+  content: "\38"; }
+
+.fa-9::before {
+  content: "\39"; }
+
+.fa-fill-drip::before {
+  content: "\f576"; }
+
+.fa-arrows-to-circle::before {
+  content: "\e4bd"; }
+
+.fa-circle-chevron-right::before {
+  content: "\f138"; }
+
+.fa-chevron-circle-right::before {
+  content: "\f138"; }
+
+.fa-at::before {
+  content: "\40"; }
+
+.fa-trash-can::before {
+  content: "\f2ed"; }
+
+.fa-trash-alt::before {
+  content: "\f2ed"; }
+
+.fa-text-height::before {
+  content: "\f034"; }
+
+.fa-user-xmark::before {
+  content: "\f235"; }
+
+.fa-user-times::before {
+  content: "\f235"; }
+
+.fa-stethoscope::before {
+  content: "\f0f1"; }
+
+.fa-message::before {
+  content: "\f27a"; }
+
+.fa-comment-alt::before {
+  content: "\f27a"; }
+
+.fa-info::before {
+  content: "\f129"; }
+
+.fa-down-left-and-up-right-to-center::before {
+  content: "\f422"; }
+
+.fa-compress-alt::before {
+  content: "\f422"; }
+
+.fa-explosion::before {
+  content: "\e4e9"; }
+
+.fa-file-lines::before {
+  content: "\f15c"; }
+
+.fa-file-alt::before {
+  content: "\f15c"; }
+
+.fa-file-text::before {
+  content: "\f15c"; }
+
+.fa-wave-square::before {
+  content: "\f83e"; }
+
+.fa-ring::before {
+  content: "\f70b"; }
+
+.fa-building-un::before {
+  content: "\e4d9"; }
+
+.fa-dice-three::before {
+  content: "\f527"; }
+
+.fa-calendar-days::before {
+  content: "\f073"; }
+
+.fa-calendar-alt::before {
+  content: "\f073"; }
+
+.fa-anchor-circle-check::before {
+  content: "\e4aa"; }
+
+.fa-building-circle-arrow-right::before {
+  content: "\e4d1"; }
+
+.fa-volleyball::before {
+  content: "\f45f"; }
+
+.fa-volleyball-ball::before {
+  content: "\f45f"; }
+
+.fa-arrows-up-to-line::before {
+  content: "\e4c2"; }
+
+.fa-sort-down::before {
+  content: "\f0dd"; }
+
+.fa-sort-desc::before {
+  content: "\f0dd"; }
+
+.fa-circle-minus::before {
+  content: "\f056"; }
+
+.fa-minus-circle::before {
+  content: "\f056"; }
+
+.fa-door-open::before {
+  content: "\f52b"; }
+
+.fa-right-from-bracket::before {
+  content: "\f2f5"; }
+
+.fa-sign-out-alt::before {
+  content: "\f2f5"; }
+
+.fa-atom::before {
+  content: "\f5d2"; }
+
+.fa-soap::before {
+  content: "\e06e"; }
+
+.fa-icons::before {
+  content: "\f86d"; }
+
+.fa-heart-music-camera-bolt::before {
+  content: "\f86d"; }
+
+.fa-microphone-lines-slash::before {
+  content: "\f539"; }
+
+.fa-microphone-alt-slash::before {
+  content: "\f539"; }
+
+.fa-bridge-circle-check::before {
+  content: "\e4c9"; }
+
+.fa-pump-medical::before {
+  content: "\e06a"; }
+
+.fa-fingerprint::before {
+  content: "\f577"; }
+
+.fa-hand-point-right::before {
+  content: "\f0a4"; }
+
+.fa-magnifying-glass-location::before {
+  content: "\f689"; }
+
+.fa-search-location::before {
+  content: "\f689"; }
+
+.fa-forward-step::before {
+  content: "\f051"; }
+
+.fa-step-forward::before {
+  content: "\f051"; }
+
+.fa-face-smile-beam::before {
+  content: "\f5b8"; }
+
+.fa-smile-beam::before {
+  content: "\f5b8"; }
+
+.fa-flag-checkered::before {
+  content: "\f11e"; }
+
+.fa-football::before {
+  content: "\f44e"; }
+
+.fa-football-ball::before {
+  content: "\f44e"; }
+
+.fa-school-circle-exclamation::before {
+  content: "\e56c"; }
+
+.fa-crop::before {
+  content: "\f125"; }
+
+.fa-angles-down::before {
+  content: "\f103"; }
+
+.fa-angle-double-down::before {
+  content: "\f103"; }
+
+.fa-users-rectangle::before {
+  content: "\e594"; }
+
+.fa-people-roof::before {
+  content: "\e537"; }
+
+.fa-people-line::before {
+  content: "\e534"; }
+
+.fa-beer-mug-empty::before {
+  content: "\f0fc"; }
+
+.fa-beer::before {
+  content: "\f0fc"; }
+
+.fa-diagram-predecessor::before {
+  content: "\e477"; }
+
+.fa-arrow-up-long::before {
+  content: "\f176"; }
+
+.fa-long-arrow-up::before {
+  content: "\f176"; }
+
+.fa-fire-flame-simple::before {
+  content: "\f46a"; }
+
+.fa-burn::before {
+  content: "\f46a"; }
+
+.fa-person::before {
+  content: "\f183"; }
+
+.fa-male::before {
+  content: "\f183"; }
+
+.fa-laptop::before {
+  content: "\f109"; }
+
+.fa-file-csv::before {
+  content: "\f6dd"; }
+
+.fa-menorah::before {
+  content: "\f676"; }
+
+.fa-truck-plane::before {
+  content: "\e58f"; }
+
+.fa-record-vinyl::before {
+  content: "\f8d9"; }
+
+.fa-face-grin-stars::before {
+  content: "\f587"; }
+
+.fa-grin-stars::before {
+  content: "\f587"; }
+
+.fa-bong::before {
+  content: "\f55c"; }
+
+.fa-spaghetti-monster-flying::before {
+  content: "\f67b"; }
+
+.fa-pastafarianism::before {
+  content: "\f67b"; }
+
+.fa-arrow-down-up-across-line::before {
+  content: "\e4af"; }
+
+.fa-spoon::before {
+  content: "\f2e5"; }
+
+.fa-utensil-spoon::before {
+  content: "\f2e5"; }
+
+.fa-jar-wheat::before {
+  content: "\e517"; }
+
+.fa-envelopes-bulk::before {
+  content: "\f674"; }
+
+.fa-mail-bulk::before {
+  content: "\f674"; }
+
+.fa-file-circle-exclamation::before {
+  content: "\e4eb"; }
+
+.fa-circle-h::before {
+  content: "\f47e"; }
+
+.fa-hospital-symbol::before {
+  content: "\f47e"; }
+
+.fa-pager::before {
+  content: "\f815"; }
+
+.fa-address-book::before {
+  content: "\f2b9"; }
+
+.fa-contact-book::before {
+  content: "\f2b9"; }
+
+.fa-strikethrough::before {
+  content: "\f0cc"; }
+
+.fa-k::before {
+  content: "\4b"; }
+
+.fa-landmark-flag::before {
+  content: "\e51c"; }
+
+.fa-pencil::before {
+  content: "\f303"; }
+
+.fa-pencil-alt::before {
+  content: "\f303"; }
+
+.fa-backward::before {
+  content: "\f04a"; }
+
+.fa-caret-right::before {
+  content: "\f0da"; }
+
+.fa-comments::before {
+  content: "\f086"; }
+
+.fa-paste::before {
+  content: "\f0ea"; }
+
+.fa-file-clipboard::before {
+  content: "\f0ea"; }
+
+.fa-code-pull-request::before {
+  content: "\e13c"; }
+
+.fa-clipboard-list::before {
+  content: "\f46d"; }
+
+.fa-truck-ramp-box::before {
+  content: "\f4de"; }
+
+.fa-truck-loading::before {
+  content: "\f4de"; }
+
+.fa-user-check::before {
+  content: "\f4fc"; }
+
+.fa-vial-virus::before {
+  content: "\e597"; }
+
+.fa-sheet-plastic::before {
+  content: "\e571"; }
+
+.fa-blog::before {
+  content: "\f781"; }
+
+.fa-user-ninja::before {
+  content: "\f504"; }
+
+.fa-person-arrow-up-from-line::before {
+  content: "\e539"; }
+
+.fa-scroll-torah::before {
+  content: "\f6a0"; }
+
+.fa-torah::before {
+  content: "\f6a0"; }
+
+.fa-broom-ball::before {
+  content: "\f458"; }
+
+.fa-quidditch::before {
+  content: "\f458"; }
+
+.fa-quidditch-broom-ball::before {
+  content: "\f458"; }
+
+.fa-toggle-off::before {
+  content: "\f204"; }
+
+.fa-box-archive::before {
+  content: "\f187"; }
+
+.fa-archive::before {
+  content: "\f187"; }
+
+.fa-person-drowning::before {
+  content: "\e545"; }
+
+.fa-arrow-down-9-1::before {
+  content: "\f886"; }
+
+.fa-sort-numeric-desc::before {
+  content: "\f886"; }
+
+.fa-sort-numeric-down-alt::before {
+  content: "\f886"; }
+
+.fa-face-grin-tongue-squint::before {
+  content: "\f58a"; }
+
+.fa-grin-tongue-squint::before {
+  content: "\f58a"; }
+
+.fa-spray-can::before {
+  content: "\f5bd"; }
+
+.fa-truck-monster::before {
+  content: "\f63b"; }
+
+.fa-w::before {
+  content: "\57"; }
+
+.fa-earth-africa::before {
+  content: "\f57c"; }
+
+.fa-globe-africa::before {
+  content: "\f57c"; }
+
+.fa-rainbow::before {
+  content: "\f75b"; }
+
+.fa-circle-notch::before {
+  content: "\f1ce"; }
+
+.fa-tablet-screen-button::before {
+  content: "\f3fa"; }
+
+.fa-tablet-alt::before {
+  content: "\f3fa"; }
+
+.fa-paw::before {
+  content: "\f1b0"; }
+
+.fa-cloud::before {
+  content: "\f0c2"; }
+
+.fa-trowel-bricks::before {
+  content: "\e58a"; }
+
+.fa-face-flushed::before {
+  content: "\f579"; }
+
+.fa-flushed::before {
+  content: "\f579"; }
+
+.fa-hospital-user::before {
+  content: "\f80d"; }
+
+.fa-tent-arrow-left-right::before {
+  content: "\e57f"; }
+
+.fa-gavel::before {
+  content: "\f0e3"; }
+
+.fa-legal::before {
+  content: "\f0e3"; }
+
+.fa-binoculars::before {
+  content: "\f1e5"; }
+
+.fa-microphone-slash::before {
+  content: "\f131"; }
+
+.fa-box-tissue::before {
+  content: "\e05b"; }
+
+.fa-motorcycle::before {
+  content: "\f21c"; }
+
+.fa-bell-concierge::before {
+  content: "\f562"; }
+
+.fa-concierge-bell::before {
+  content: "\f562"; }
+
+.fa-pen-ruler::before {
+  content: "\f5ae"; }
+
+.fa-pencil-ruler::before {
+  content: "\f5ae"; }
+
+.fa-people-arrows::before {
+  content: "\e068"; }
+
+.fa-people-arrows-left-right::before {
+  content: "\e068"; }
+
+.fa-mars-and-venus-burst::before {
+  content: "\e523"; }
+
+.fa-square-caret-right::before {
+  content: "\f152"; }
+
+.fa-caret-square-right::before {
+  content: "\f152"; }
+
+.fa-scissors::before {
+  content: "\f0c4"; }
+
+.fa-cut::before {
+  content: "\f0c4"; }
+
+.fa-sun-plant-wilt::before {
+  content: "\e57a"; }
+
+.fa-toilets-portable::before {
+  content: "\e584"; }
+
+.fa-hockey-puck::before {
+  content: "\f453"; }
+
+.fa-table::before {
+  content: "\f0ce"; }
+
+.fa-magnifying-glass-arrow-right::before {
+  content: "\e521"; }
+
+.fa-tachograph-digital::before {
+  content: "\f566"; }
+
+.fa-digital-tachograph::before {
+  content: "\f566"; }
+
+.fa-users-slash::before {
+  content: "\e073"; }
+
+.fa-clover::before {
+  content: "\e139"; }
+
+.fa-reply::before {
+  content: "\f3e5"; }
+
+.fa-mail-reply::before {
+  content: "\f3e5"; }
+
+.fa-star-and-crescent::before {
+  content: "\f699"; }
+
+.fa-house-fire::before {
+  content: "\e50c"; }
+
+.fa-square-minus::before {
+  content: "\f146"; }
+
+.fa-minus-square::before {
+  content: "\f146"; }
+
+.fa-helicopter::before {
+  content: "\f533"; }
+
+.fa-compass::before {
+  content: "\f14e"; }
+
+.fa-square-caret-down::before {
+  content: "\f150"; }
+
+.fa-caret-square-down::before {
+  content: "\f150"; }
+
+.fa-file-circle-question::before {
+  content: "\e4ef"; }
+
+.fa-laptop-code::before {
+  content: "\f5fc"; }
+
+.fa-swatchbook::before {
+  content: "\f5c3"; }
+
+.fa-prescription-bottle::before {
+  content: "\f485"; }
+
+.fa-bars::before {
+  content: "\f0c9"; }
+
+.fa-navicon::before {
+  content: "\f0c9"; }
+
+.fa-people-group::before {
+  content: "\e533"; }
+
+.fa-hourglass-end::before {
+  content: "\f253"; }
+
+.fa-hourglass-3::before {
+  content: "\f253"; }
+
+.fa-heart-crack::before {
+  content: "\f7a9"; }
+
+.fa-heart-broken::before {
+  content: "\f7a9"; }
+
+.fa-square-up-right::before {
+  content: "\f360"; }
+
+.fa-external-link-square-alt::before {
+  content: "\f360"; }
+
+.fa-face-kiss-beam::before {
+  content: "\f597"; }
+
+.fa-kiss-beam::before {
+  content: "\f597"; }
+
+.fa-film::before {
+  content: "\f008"; }
+
+.fa-ruler-horizontal::before {
+  content: "\f547"; }
+
+.fa-people-robbery::before {
+  content: "\e536"; }
+
+.fa-lightbulb::before {
+  content: "\f0eb"; }
+
+.fa-caret-left::before {
+  content: "\f0d9"; }
+
+.fa-circle-exclamation::before {
+  content: "\f06a"; }
+
+.fa-exclamation-circle::before {
+  content: "\f06a"; }
+
+.fa-school-circle-xmark::before {
+  content: "\e56d"; }
+
+.fa-arrow-right-from-bracket::before {
+  content: "\f08b"; }
+
+.fa-sign-out::before {
+  content: "\f08b"; }
+
+.fa-circle-chevron-down::before {
+  content: "\f13a"; }
+
+.fa-chevron-circle-down::before {
+  content: "\f13a"; }
+
+.fa-unlock-keyhole::before {
+  content: "\f13e"; }
+
+.fa-unlock-alt::before {
+  content: "\f13e"; }
+
+.fa-cloud-showers-heavy::before {
+  content: "\f740"; }
+
+.fa-headphones-simple::before {
+  content: "\f58f"; }
+
+.fa-headphones-alt::before {
+  content: "\f58f"; }
+
+.fa-sitemap::before {
+  content: "\f0e8"; }
+
+.fa-circle-dollar-to-slot::before {
+  content: "\f4b9"; }
+
+.fa-donate::before {
+  content: "\f4b9"; }
+
+.fa-memory::before {
+  content: "\f538"; }
+
+.fa-road-spikes::before {
+  content: "\e568"; }
+
+.fa-fire-burner::before {
+  content: "\e4f1"; }
+
+.fa-flag::before {
+  content: "\f024"; }
+
+.fa-hanukiah::before {
+  content: "\f6e6"; }
+
+.fa-feather::before {
+  content: "\f52d"; }
+
+.fa-volume-low::before {
+  content: "\f027"; }
+
+.fa-volume-down::before {
+  content: "\f027"; }
+
+.fa-comment-slash::before {
+  content: "\f4b3"; }
+
+.fa-cloud-sun-rain::before {
+  content: "\f743"; }
+
+.fa-compress::before {
+  content: "\f066"; }
+
+.fa-wheat-awn::before {
+  content: "\e2cd"; }
+
+.fa-wheat-alt::before {
+  content: "\e2cd"; }
+
+.fa-ankh::before {
+  content: "\f644"; }
+
+.fa-hands-holding-child::before {
+  content: "\e4fa"; }
+
+.fa-asterisk::before {
+  content: "\2a"; }
+
+.fa-square-check::before {
+  content: "\f14a"; }
+
+.fa-check-square::before {
+  content: "\f14a"; }
+
+.fa-peseta-sign::before {
+  content: "\e221"; }
+
+.fa-heading::before {
+  content: "\f1dc"; }
+
+.fa-header::before {
+  content: "\f1dc"; }
+
+.fa-ghost::before {
+  content: "\f6e2"; }
+
+.fa-list::before {
+  content: "\f03a"; }
+
+.fa-list-squares::before {
+  content: "\f03a"; }
+
+.fa-square-phone-flip::before {
+  content: "\f87b"; }
+
+.fa-phone-square-alt::before {
+  content: "\f87b"; }
+
+.fa-cart-plus::before {
+  content: "\f217"; }
+
+.fa-gamepad::before {
+  content: "\f11b"; }
+
+.fa-circle-dot::before {
+  content: "\f192"; }
+
+.fa-dot-circle::before {
+  content: "\f192"; }
+
+.fa-face-dizzy::before {
+  content: "\f567"; }
+
+.fa-dizzy::before {
+  content: "\f567"; }
+
+.fa-egg::before {
+  content: "\f7fb"; }
+
+.fa-house-medical-circle-xmark::before {
+  content: "\e513"; }
+
+.fa-campground::before {
+  content: "\f6bb"; }
+
+.fa-folder-plus::before {
+  content: "\f65e"; }
+
+.fa-futbol::before {
+  content: "\f1e3"; }
+
+.fa-futbol-ball::before {
+  content: "\f1e3"; }
+
+.fa-soccer-ball::before {
+  content: "\f1e3"; }
+
+.fa-paintbrush::before {
+  content: "\f1fc"; }
+
+.fa-paint-brush::before {
+  content: "\f1fc"; }
+
+.fa-lock::before {
+  content: "\f023"; }
+
+.fa-gas-pump::before {
+  content: "\f52f"; }
+
+.fa-hot-tub-person::before {
+  content: "\f593"; }
+
+.fa-hot-tub::before {
+  content: "\f593"; }
+
+.fa-map-location::before {
+  content: "\f59f"; }
+
+.fa-map-marked::before {
+  content: "\f59f"; }
+
+.fa-house-flood-water::before {
+  content: "\e50e"; }
+
+.fa-tree::before {
+  content: "\f1bb"; }
+
+.fa-bridge-lock::before {
+  content: "\e4cc"; }
+
+.fa-sack-dollar::before {
+  content: "\f81d"; }
+
+.fa-pen-to-square::before {
+  content: "\f044"; }
+
+.fa-edit::before {
+  content: "\f044"; }
+
+.fa-car-side::before {
+  content: "\f5e4"; }
+
+.fa-share-nodes::before {
+  content: "\f1e0"; }
+
+.fa-share-alt::before {
+  content: "\f1e0"; }
+
+.fa-heart-circle-minus::before {
+  content: "\e4ff"; }
+
+.fa-hourglass-half::before {
+  content: "\f252"; }
+
+.fa-hourglass-2::before {
+  content: "\f252"; }
+
+.fa-microscope::before {
+  content: "\f610"; }
+
+.fa-sink::before {
+  content: "\e06d"; }
+
+.fa-bag-shopping::before {
+  content: "\f290"; }
+
+.fa-shopping-bag::before {
+  content: "\f290"; }
+
+.fa-arrow-down-z-a::before {
+  content: "\f881"; }
+
+.fa-sort-alpha-desc::before {
+  content: "\f881"; }
+
+.fa-sort-alpha-down-alt::before {
+  content: "\f881"; }
+
+.fa-mitten::before {
+  content: "\f7b5"; }
+
+.fa-person-rays::before {
+  content: "\e54d"; }
+
+.fa-users::before {
+  content: "\f0c0"; }
+
+.fa-eye-slash::before {
+  content: "\f070"; }
+
+.fa-flask-vial::before {
+  content: "\e4f3"; }
+
+.fa-hand::before {
+  content: "\f256"; }
+
+.fa-hand-paper::before {
+  content: "\f256"; }
+
+.fa-om::before {
+  content: "\f679"; }
+
+.fa-worm::before {
+  content: "\e599"; }
+
+.fa-house-circle-xmark::before {
+  content: "\e50b"; }
+
+.fa-plug::before {
+  content: "\f1e6"; }
+
+.fa-chevron-up::before {
+  content: "\f077"; }
+
+.fa-hand-spock::before {
+  content: "\f259"; }
+
+.fa-stopwatch::before {
+  content: "\f2f2"; }
+
+.fa-face-kiss::before {
+  content: "\f596"; }
+
+.fa-kiss::before {
+  content: "\f596"; }
+
+.fa-bridge-circle-xmark::before {
+  content: "\e4cb"; }
+
+.fa-face-grin-tongue::before {
+  content: "\f589"; }
+
+.fa-grin-tongue::before {
+  content: "\f589"; }
+
+.fa-chess-bishop::before {
+  content: "\f43a"; }
+
+.fa-face-grin-wink::before {
+  content: "\f58c"; }
+
+.fa-grin-wink::before {
+  content: "\f58c"; }
+
+.fa-ear-deaf::before {
+  content: "\f2a4"; }
+
+.fa-deaf::before {
+  content: "\f2a4"; }
+
+.fa-deafness::before {
+  content: "\f2a4"; }
+
+.fa-hard-of-hearing::before {
+  content: "\f2a4"; }
+
+.fa-road-circle-check::before {
+  content: "\e564"; }
+
+.fa-dice-five::before {
+  content: "\f523"; }
+
+.fa-square-rss::before {
+  content: "\f143"; }
+
+.fa-rss-square::before {
+  content: "\f143"; }
+
+.fa-land-mine-on::before {
+  content: "\e51b"; }
+
+.fa-i-cursor::before {
+  content: "\f246"; }
+
+.fa-stamp::before {
+  content: "\f5bf"; }
+
+.fa-stairs::before {
+  content: "\e289"; }
+
+.fa-i::before {
+  content: "\49"; }
+
+.fa-hryvnia-sign::before {
+  content: "\f6f2"; }
+
+.fa-hryvnia::before {
+  content: "\f6f2"; }
+
+.fa-pills::before {
+  content: "\f484"; }
+
+.fa-face-grin-wide::before {
+  content: "\f581"; }
+
+.fa-grin-alt::before {
+  content: "\f581"; }
+
+.fa-tooth::before {
+  content: "\f5c9"; }
+
+.fa-v::before {
+  content: "\56"; }
+
+.fa-bangladeshi-taka-sign::before {
+  content: "\e2e6"; }
+
+.fa-bicycle::before {
+  content: "\f206"; }
+
+.fa-staff-snake::before {
+  content: "\e579"; }
+
+.fa-rod-asclepius::before {
+  content: "\e579"; }
+
+.fa-rod-snake::before {
+  content: "\e579"; }
+
+.fa-staff-aesculapius::before {
+  content: "\e579"; }
+
+.fa-head-side-cough-slash::before {
+  content: "\e062"; }
+
+.fa-truck-medical::before {
+  content: "\f0f9"; }
+
+.fa-ambulance::before {
+  content: "\f0f9"; }
+
+.fa-wheat-awn-circle-exclamation::before {
+  content: "\e598"; }
+
+.fa-snowman::before {
+  content: "\f7d0"; }
+
+.fa-mortar-pestle::before {
+  content: "\f5a7"; }
+
+.fa-road-barrier::before {
+  content: "\e562"; }
+
+.fa-school::before {
+  content: "\f549"; }
+
+.fa-igloo::before {
+  content: "\f7ae"; }
+
+.fa-joint::before {
+  content: "\f595"; }
+
+.fa-angle-right::before {
+  content: "\f105"; }
+
+.fa-horse::before {
+  content: "\f6f0"; }
+
+.fa-q::before {
+  content: "\51"; }
+
+.fa-g::before {
+  content: "\47"; }
+
+.fa-notes-medical::before {
+  content: "\f481"; }
+
+.fa-temperature-half::before {
+  content: "\f2c9"; }
+
+.fa-temperature-2::before {
+  content: "\f2c9"; }
+
+.fa-thermometer-2::before {
+  content: "\f2c9"; }
+
+.fa-thermometer-half::before {
+  content: "\f2c9"; }
+
+.fa-dong-sign::before {
+  content: "\e169"; }
+
+.fa-capsules::before {
+  content: "\f46b"; }
+
+.fa-poo-storm::before {
+  content: "\f75a"; }
+
+.fa-poo-bolt::before {
+  content: "\f75a"; }
+
+.fa-face-frown-open::before {
+  content: "\f57a"; }
+
+.fa-frown-open::before {
+  content: "\f57a"; }
+
+.fa-hand-point-up::before {
+  content: "\f0a6"; }
+
+.fa-money-bill::before {
+  content: "\f0d6"; }
+
+.fa-bookmark::before {
+  content: "\f02e"; }
+
+.fa-align-justify::before {
+  content: "\f039"; }
+
+.fa-umbrella-beach::before {
+  content: "\f5ca"; }
+
+.fa-helmet-un::before {
+  content: "\e503"; }
+
+.fa-bullseye::before {
+  content: "\f140"; }
+
+.fa-bacon::before {
+  content: "\f7e5"; }
+
+.fa-hand-point-down::before {
+  content: "\f0a7"; }
+
+.fa-arrow-up-from-bracket::before {
+  content: "\e09a"; }
+
+.fa-folder::before {
+  content: "\f07b"; }
+
+.fa-folder-blank::before {
+  content: "\f07b"; }
+
+.fa-file-waveform::before {
+  content: "\f478"; }
+
+.fa-file-medical-alt::before {
+  content: "\f478"; }
+
+.fa-radiation::before {
+  content: "\f7b9"; }
+
+.fa-chart-simple::before {
+  content: "\e473"; }
+
+.fa-mars-stroke::before {
+  content: "\f229"; }
+
+.fa-vial::before {
+  content: "\f492"; }
+
+.fa-gauge::before {
+  content: "\f624"; }
+
+.fa-dashboard::before {
+  content: "\f624"; }
+
+.fa-gauge-med::before {
+  content: "\f624"; }
+
+.fa-tachometer-alt-average::before {
+  content: "\f624"; }
+
+.fa-wand-magic-sparkles::before {
+  content: "\e2ca"; }
+
+.fa-magic-wand-sparkles::before {
+  content: "\e2ca"; }
+
+.fa-e::before {
+  content: "\45"; }
+
+.fa-pen-clip::before {
+  content: "\f305"; }
+
+.fa-pen-alt::before {
+  content: "\f305"; }
+
+.fa-bridge-circle-exclamation::before {
+  content: "\e4ca"; }
+
+.fa-user::before {
+  content: "\f007"; }
+
+.fa-school-circle-check::before {
+  content: "\e56b"; }
+
+.fa-dumpster::before {
+  content: "\f793"; }
+
+.fa-van-shuttle::before {
+  content: "\f5b6"; }
+
+.fa-shuttle-van::before {
+  content: "\f5b6"; }
+
+.fa-building-user::before {
+  content: "\e4da"; }
+
+.fa-square-caret-left::before {
+  content: "\f191"; }
+
+.fa-caret-square-left::before {
+  content: "\f191"; }
+
+.fa-highlighter::before {
+  content: "\f591"; }
+
+.fa-key::before {
+  content: "\f084"; }
+
+.fa-bullhorn::before {
+  content: "\f0a1"; }
+
+.fa-globe::before {
+  content: "\f0ac"; }
+
+.fa-synagogue::before {
+  content: "\f69b"; }
+
+.fa-person-half-dress::before {
+  content: "\e548"; }
+
+.fa-road-bridge::before {
+  content: "\e563"; }
+
+.fa-location-arrow::before {
+  content: "\f124"; }
+
+.fa-c::before {
+  content: "\43"; }
+
+.fa-tablet-button::before {
+  content: "\f10a"; }
+
+.fa-building-lock::before {
+  content: "\e4d6"; }
+
+.fa-pizza-slice::before {
+  content: "\f818"; }
+
+.fa-money-bill-wave::before {
+  content: "\f53a"; }
+
+.fa-chart-area::before {
+  content: "\f1fe"; }
+
+.fa-area-chart::before {
+  content: "\f1fe"; }
+
+.fa-house-flag::before {
+  content: "\e50d"; }
+
+.fa-person-circle-minus::before {
+  content: "\e540"; }
+
+.fa-ban::before {
+  content: "\f05e"; }
+
+.fa-cancel::before {
+  content: "\f05e"; }
+
+.fa-camera-rotate::before {
+  content: "\e0d8"; }
+
+.fa-spray-can-sparkles::before {
+  content: "\f5d0"; }
+
+.fa-air-freshener::before {
+  content: "\f5d0"; }
+
+.fa-star::before {
+  content: "\f005"; }
+
+.fa-repeat::before {
+  content: "\f363"; }
+
+.fa-cross::before {
+  content: "\f654"; }
+
+.fa-box::before {
+  content: "\f466"; }
+
+.fa-venus-mars::before {
+  content: "\f228"; }
+
+.fa-arrow-pointer::before {
+  content: "\f245"; }
+
+.fa-mouse-pointer::before {
+  content: "\f245"; }
+
+.fa-maximize::before {
+  content: "\f31e"; }
+
+.fa-expand-arrows-alt::before {
+  content: "\f31e"; }
+
+.fa-charging-station::before {
+  content: "\f5e7"; }
+
+.fa-shapes::before {
+  content: "\f61f"; }
+
+.fa-triangle-circle-square::before {
+  content: "\f61f"; }
+
+.fa-shuffle::before {
+  content: "\f074"; }
+
+.fa-random::before {
+  content: "\f074"; }
+
+.fa-person-running::before {
+  content: "\f70c"; }
+
+.fa-running::before {
+  content: "\f70c"; }
+
+.fa-mobile-retro::before {
+  content: "\e527"; }
+
+.fa-grip-lines-vertical::before {
+  content: "\f7a5"; }
+
+.fa-spider::before {
+  content: "\f717"; }
+
+.fa-hands-bound::before {
+  content: "\e4f9"; }
+
+.fa-file-invoice-dollar::before {
+  content: "\f571"; }
+
+.fa-plane-circle-exclamation::before {
+  content: "\e556"; }
+
+.fa-x-ray::before {
+  content: "\f497"; }
+
+.fa-spell-check::before {
+  content: "\f891"; }
+
+.fa-slash::before {
+  content: "\f715"; }
+
+.fa-computer-mouse::before {
+  content: "\f8cc"; }
+
+.fa-mouse::before {
+  content: "\f8cc"; }
+
+.fa-arrow-right-to-bracket::before {
+  content: "\f090"; }
+
+.fa-sign-in::before {
+  content: "\f090"; }
+
+.fa-shop-slash::before {
+  content: "\e070"; }
+
+.fa-store-alt-slash::before {
+  content: "\e070"; }
+
+.fa-server::before {
+  content: "\f233"; }
+
+.fa-virus-covid-slash::before {
+  content: "\e4a9"; }
+
+.fa-shop-lock::before {
+  content: "\e4a5"; }
+
+.fa-hourglass-start::before {
+  content: "\f251"; }
+
+.fa-hourglass-1::before {
+  content: "\f251"; }
+
+.fa-blender-phone::before {
+  content: "\f6b6"; }
+
+.fa-building-wheat::before {
+  content: "\e4db"; }
+
+.fa-person-breastfeeding::before {
+  content: "\e53a"; }
+
+.fa-right-to-bracket::before {
+  content: "\f2f6"; }
+
+.fa-sign-in-alt::before {
+  content: "\f2f6"; }
+
+.fa-venus::before {
+  content: "\f221"; }
+
+.fa-passport::before {
+  content: "\f5ab"; }
+
+.fa-heart-pulse::before {
+  content: "\f21e"; }
+
+.fa-heartbeat::before {
+  content: "\f21e"; }
+
+.fa-people-carry-box::before {
+  content: "\f4ce"; }
+
+.fa-people-carry::before {
+  content: "\f4ce"; }
+
+.fa-temperature-high::before {
+  content: "\f769"; }
+
+.fa-microchip::before {
+  content: "\f2db"; }
+
+.fa-crown::before {
+  content: "\f521"; }
+
+.fa-weight-hanging::before {
+  content: "\f5cd"; }
+
+.fa-xmarks-lines::before {
+  content: "\e59a"; }
+
+.fa-file-prescription::before {
+  content: "\f572"; }
+
+.fa-weight-scale::before {
+  content: "\f496"; }
+
+.fa-weight::before {
+  content: "\f496"; }
+
+.fa-user-group::before {
+  content: "\f500"; }
+
+.fa-user-friends::before {
+  content: "\f500"; }
+
+.fa-arrow-up-a-z::before {
+  content: "\f15e"; }
+
+.fa-sort-alpha-up::before {
+  content: "\f15e"; }
+
+.fa-chess-knight::before {
+  content: "\f441"; }
+
+.fa-face-laugh-squint::before {
+  content: "\f59b"; }
+
+.fa-laugh-squint::before {
+  content: "\f59b"; }
+
+.fa-wheelchair::before {
+  content: "\f193"; }
+
+.fa-circle-arrow-up::before {
+  content: "\f0aa"; }
+
+.fa-arrow-circle-up::before {
+  content: "\f0aa"; }
+
+.fa-toggle-on::before {
+  content: "\f205"; }
+
+.fa-person-walking::before {
+  content: "\f554"; }
+
+.fa-walking::before {
+  content: "\f554"; }
+
+.fa-l::before {
+  content: "\4c"; }
+
+.fa-fire::before {
+  content: "\f06d"; }
+
+.fa-bed-pulse::before {
+  content: "\f487"; }
+
+.fa-procedures::before {
+  content: "\f487"; }
+
+.fa-shuttle-space::before {
+  content: "\f197"; }
+
+.fa-space-shuttle::before {
+  content: "\f197"; }
+
+.fa-face-laugh::before {
+  content: "\f599"; }
+
+.fa-laugh::before {
+  content: "\f599"; }
+
+.fa-folder-open::before {
+  content: "\f07c"; }
+
+.fa-heart-circle-plus::before {
+  content: "\e500"; }
+
+.fa-code-fork::before {
+  content: "\e13b"; }
+
+.fa-city::before {
+  content: "\f64f"; }
+
+.fa-microphone-lines::before {
+  content: "\f3c9"; }
+
+.fa-microphone-alt::before {
+  content: "\f3c9"; }
+
+.fa-pepper-hot::before {
+  content: "\f816"; }
+
+.fa-unlock::before {
+  content: "\f09c"; }
+
+.fa-colon-sign::before {
+  content: "\e140"; }
+
+.fa-headset::before {
+  content: "\f590"; }
+
+.fa-store-slash::before {
+  content: "\e071"; }
+
+.fa-road-circle-xmark::before {
+  content: "\e566"; }
+
+.fa-user-minus::before {
+  content: "\f503"; }
+
+.fa-mars-stroke-up::before {
+  content: "\f22a"; }
+
+.fa-mars-stroke-v::before {
+  content: "\f22a"; }
+
+.fa-champagne-glasses::before {
+  content: "\f79f"; }
+
+.fa-glass-cheers::before {
+  content: "\f79f"; }
+
+.fa-clipboard::before {
+  content: "\f328"; }
+
+.fa-house-circle-exclamation::before {
+  content: "\e50a"; }
+
+.fa-file-arrow-up::before {
+  content: "\f574"; }
+
+.fa-file-upload::before {
+  content: "\f574"; }
+
+.fa-wifi::before {
+  content: "\f1eb"; }
+
+.fa-wifi-3::before {
+  content: "\f1eb"; }
+
+.fa-wifi-strong::before {
+  content: "\f1eb"; }
+
+.fa-bath::before {
+  content: "\f2cd"; }
+
+.fa-bathtub::before {
+  content: "\f2cd"; }
+
+.fa-underline::before {
+  content: "\f0cd"; }
+
+.fa-user-pen::before {
+  content: "\f4ff"; }
+
+.fa-user-edit::before {
+  content: "\f4ff"; }
+
+.fa-signature::before {
+  content: "\f5b7"; }
+
+.fa-stroopwafel::before {
+  content: "\f551"; }
+
+.fa-bold::before {
+  content: "\f032"; }
+
+.fa-anchor-lock::before {
+  content: "\e4ad"; }
+
+.fa-building-ngo::before {
+  content: "\e4d7"; }
+
+.fa-manat-sign::before {
+  content: "\e1d5"; }
+
+.fa-not-equal::before {
+  content: "\f53e"; }
+
+.fa-border-top-left::before {
+  content: "\f853"; }
+
+.fa-border-style::before {
+  content: "\f853"; }
+
+.fa-map-location-dot::before {
+  content: "\f5a0"; }
+
+.fa-map-marked-alt::before {
+  content: "\f5a0"; }
+
+.fa-jedi::before {
+  content: "\f669"; }
+
+.fa-square-poll-vertical::before {
+  content: "\f681"; }
+
+.fa-poll::before {
+  content: "\f681"; }
+
+.fa-mug-hot::before {
+  content: "\f7b6"; }
+
+.fa-car-battery::before {
+  content: "\f5df"; }
+
+.fa-battery-car::before {
+  content: "\f5df"; }
+
+.fa-gift::before {
+  content: "\f06b"; }
+
+.fa-dice-two::before {
+  content: "\f528"; }
+
+.fa-chess-queen::before {
+  content: "\f445"; }
+
+.fa-glasses::before {
+  content: "\f530"; }
+
+.fa-chess-board::before {
+  content: "\f43c"; }
+
+.fa-building-circle-check::before {
+  content: "\e4d2"; }
+
+.fa-person-chalkboard::before {
+  content: "\e53d"; }
+
+.fa-mars-stroke-right::before {
+  content: "\f22b"; }
+
+.fa-mars-stroke-h::before {
+  content: "\f22b"; }
+
+.fa-hand-back-fist::before {
+  content: "\f255"; }
+
+.fa-hand-rock::before {
+  content: "\f255"; }
+
+.fa-square-caret-up::before {
+  content: "\f151"; }
+
+.fa-caret-square-up::before {
+  content: "\f151"; }
+
+.fa-cloud-showers-water::before {
+  content: "\e4e4"; }
+
+.fa-chart-bar::before {
+  content: "\f080"; }
+
+.fa-bar-chart::before {
+  content: "\f080"; }
+
+.fa-hands-bubbles::before {
+  content: "\e05e"; }
+
+.fa-hands-wash::before {
+  content: "\e05e"; }
+
+.fa-less-than-equal::before {
+  content: "\f537"; }
+
+.fa-train::before {
+  content: "\f238"; }
+
+.fa-eye-low-vision::before {
+  content: "\f2a8"; }
+
+.fa-low-vision::before {
+  content: "\f2a8"; }
+
+.fa-crow::before {
+  content: "\f520"; }
+
+.fa-sailboat::before {
+  content: "\e445"; }
+
+.fa-window-restore::before {
+  content: "\f2d2"; }
+
+.fa-square-plus::before {
+  content: "\f0fe"; }
+
+.fa-plus-square::before {
+  content: "\f0fe"; }
+
+.fa-torii-gate::before {
+  content: "\f6a1"; }
+
+.fa-frog::before {
+  content: "\f52e"; }
+
+.fa-bucket::before {
+  content: "\e4cf"; }
+
+.fa-image::before {
+  content: "\f03e"; }
+
+.fa-microphone::before {
+  content: "\f130"; }
+
+.fa-cow::before {
+  content: "\f6c8"; }
+
+.fa-caret-up::before {
+  content: "\f0d8"; }
+
+.fa-screwdriver::before {
+  content: "\f54a"; }
+
+.fa-folder-closed::before {
+  content: "\e185"; }
+
+.fa-house-tsunami::before {
+  content: "\e515"; }
+
+.fa-square-nfi::before {
+  content: "\e576"; }
+
+.fa-arrow-up-from-ground-water::before {
+  content: "\e4b5"; }
+
+.fa-martini-glass::before {
+  content: "\f57b"; }
+
+.fa-glass-martini-alt::before {
+  content: "\f57b"; }
+
+.fa-rotate-left::before {
+  content: "\f2ea"; }
+
+.fa-rotate-back::before {
+  content: "\f2ea"; }
+
+.fa-rotate-backward::before {
+  content: "\f2ea"; }
+
+.fa-undo-alt::before {
+  content: "\f2ea"; }
+
+.fa-table-columns::before {
+  content: "\f0db"; }
+
+.fa-columns::before {
+  content: "\f0db"; }
+
+.fa-lemon::before {
+  content: "\f094"; }
+
+.fa-head-side-mask::before {
+  content: "\e063"; }
+
+.fa-handshake::before {
+  content: "\f2b5"; }
+
+.fa-gem::before {
+  content: "\f3a5"; }
+
+.fa-dolly::before {
+  content: "\f472"; }
+
+.fa-dolly-box::before {
+  content: "\f472"; }
+
+.fa-smoking::before {
+  content: "\f48d"; }
+
+.fa-minimize::before {
+  content: "\f78c"; }
+
+.fa-compress-arrows-alt::before {
+  content: "\f78c"; }
+
+.fa-monument::before {
+  content: "\f5a6"; }
+
+.fa-snowplow::before {
+  content: "\f7d2"; }
+
+.fa-angles-right::before {
+  content: "\f101"; }
+
+.fa-angle-double-right::before {
+  content: "\f101"; }
+
+.fa-cannabis::before {
+  content: "\f55f"; }
+
+.fa-circle-play::before {
+  content: "\f144"; }
+
+.fa-play-circle::before {
+  content: "\f144"; }
+
+.fa-tablets::before {
+  content: "\f490"; }
+
+.fa-ethernet::before {
+  content: "\f796"; }
+
+.fa-euro-sign::before {
+  content: "\f153"; }
+
+.fa-eur::before {
+  content: "\f153"; }
+
+.fa-euro::before {
+  content: "\f153"; }
+
+.fa-chair::before {
+  content: "\f6c0"; }
+
+.fa-circle-check::before {
+  content: "\f058"; }
+
+.fa-check-circle::before {
+  content: "\f058"; }
+
+.fa-circle-stop::before {
+  content: "\f28d"; }
+
+.fa-stop-circle::before {
+  content: "\f28d"; }
+
+.fa-compass-drafting::before {
+  content: "\f568"; }
+
+.fa-drafting-compass::before {
+  content: "\f568"; }
+
+.fa-plate-wheat::before {
+  content: "\e55a"; }
+
+.fa-icicles::before {
+  content: "\f7ad"; }
+
+.fa-person-shelter::before {
+  content: "\e54f"; }
+
+.fa-neuter::before {
+  content: "\f22c"; }
+
+.fa-id-badge::before {
+  content: "\f2c1"; }
+
+.fa-marker::before {
+  content: "\f5a1"; }
+
+.fa-face-laugh-beam::before {
+  content: "\f59a"; }
+
+.fa-laugh-beam::before {
+  content: "\f59a"; }
+
+.fa-helicopter-symbol::before {
+  content: "\e502"; }
+
+.fa-universal-access::before {
+  content: "\f29a"; }
+
+.fa-circle-chevron-up::before {
+  content: "\f139"; }
+
+.fa-chevron-circle-up::before {
+  content: "\f139"; }
+
+.fa-lari-sign::before {
+  content: "\e1c8"; }
+
+.fa-volcano::before {
+  content: "\f770"; }
+
+.fa-person-walking-dashed-line-arrow-right::before {
+  content: "\e553"; }
+
+.fa-sterling-sign::before {
+  content: "\f154"; }
+
+.fa-gbp::before {
+  content: "\f154"; }
+
+.fa-pound-sign::before {
+  content: "\f154"; }
+
+.fa-viruses::before {
+  content: "\e076"; }
+
+.fa-square-person-confined::before {
+  content: "\e577"; }
+
+.fa-user-tie::before {
+  content: "\f508"; }
+
+.fa-arrow-down-long::before {
+  content: "\f175"; }
+
+.fa-long-arrow-down::before {
+  content: "\f175"; }
+
+.fa-tent-arrow-down-to-line::before {
+  content: "\e57e"; }
+
+.fa-certificate::before {
+  content: "\f0a3"; }
+
+.fa-reply-all::before {
+  content: "\f122"; }
+
+.fa-mail-reply-all::before {
+  content: "\f122"; }
+
+.fa-suitcase::before {
+  content: "\f0f2"; }
+
+.fa-person-skating::before {
+  content: "\f7c5"; }
+
+.fa-skating::before {
+  content: "\f7c5"; }
+
+.fa-filter-circle-dollar::before {
+  content: "\f662"; }
+
+.fa-funnel-dollar::before {
+  content: "\f662"; }
+
+.fa-camera-retro::before {
+  content: "\f083"; }
+
+.fa-circle-arrow-down::before {
+  content: "\f0ab"; }
+
+.fa-arrow-circle-down::before {
+  content: "\f0ab"; }
+
+.fa-file-import::before {
+  content: "\f56f"; }
+
+.fa-arrow-right-to-file::before {
+  content: "\f56f"; }
+
+.fa-square-arrow-up-right::before {
+  content: "\f14c"; }
+
+.fa-external-link-square::before {
+  content: "\f14c"; }
+
+.fa-box-open::before {
+  content: "\f49e"; }
+
+.fa-scroll::before {
+  content: "\f70e"; }
+
+.fa-spa::before {
+  content: "\f5bb"; }
+
+.fa-location-pin-lock::before {
+  content: "\e51f"; }
+
+.fa-pause::before {
+  content: "\f04c"; }
+
+.fa-hill-avalanche::before {
+  content: "\e507"; }
+
+.fa-temperature-empty::before {
+  content: "\f2cb"; }
+
+.fa-temperature-0::before {
+  content: "\f2cb"; }
+
+.fa-thermometer-0::before {
+  content: "\f2cb"; }
+
+.fa-thermometer-empty::before {
+  content: "\f2cb"; }
+
+.fa-bomb::before {
+  content: "\f1e2"; }
+
+.fa-registered::before {
+  content: "\f25d"; }
+
+.fa-address-card::before {
+  content: "\f2bb"; }
+
+.fa-contact-card::before {
+  content: "\f2bb"; }
+
+.fa-vcard::before {
+  content: "\f2bb"; }
+
+.fa-scale-unbalanced-flip::before {
+  content: "\f516"; }
+
+.fa-balance-scale-right::before {
+  content: "\f516"; }
+
+.fa-subscript::before {
+  content: "\f12c"; }
+
+.fa-diamond-turn-right::before {
+  content: "\f5eb"; }
+
+.fa-directions::before {
+  content: "\f5eb"; }
+
+.fa-burst::before {
+  content: "\e4dc"; }
+
+.fa-house-laptop::before {
+  content: "\e066"; }
+
+.fa-laptop-house::before {
+  content: "\e066"; }
+
+.fa-face-tired::before {
+  content: "\f5c8"; }
+
+.fa-tired::before {
+  content: "\f5c8"; }
+
+.fa-money-bills::before {
+  content: "\e1f3"; }
+
+.fa-smog::before {
+  content: "\f75f"; }
+
+.fa-crutch::before {
+  content: "\f7f7"; }
+
+.fa-cloud-arrow-up::before {
+  content: "\f0ee"; }
+
+.fa-cloud-upload::before {
+  content: "\f0ee"; }
+
+.fa-cloud-upload-alt::before {
+  content: "\f0ee"; }
+
+.fa-palette::before {
+  content: "\f53f"; }
+
+.fa-arrows-turn-right::before {
+  content: "\e4c0"; }
+
+.fa-vest::before {
+  content: "\e085"; }
+
+.fa-ferry::before {
+  content: "\e4ea"; }
+
+.fa-arrows-down-to-people::before {
+  content: "\e4b9"; }
+
+.fa-seedling::before {
+  content: "\f4d8"; }
+
+.fa-sprout::before {
+  content: "\f4d8"; }
+
+.fa-left-right::before {
+  content: "\f337"; }
+
+.fa-arrows-alt-h::before {
+  content: "\f337"; }
+
+.fa-boxes-packing::before {
+  content: "\e4c7"; }
+
+.fa-circle-arrow-left::before {
+  content: "\f0a8"; }
+
+.fa-arrow-circle-left::before {
+  content: "\f0a8"; }
+
+.fa-group-arrows-rotate::before {
+  content: "\e4f6"; }
+
+.fa-bowl-food::before {
+  content: "\e4c6"; }
+
+.fa-candy-cane::before {
+  content: "\f786"; }
+
+.fa-arrow-down-wide-short::before {
+  content: "\f160"; }
+
+.fa-sort-amount-asc::before {
+  content: "\f160"; }
+
+.fa-sort-amount-down::before {
+  content: "\f160"; }
+
+.fa-cloud-bolt::before {
+  content: "\f76c"; }
+
+.fa-thunderstorm::before {
+  content: "\f76c"; }
+
+.fa-text-slash::before {
+  content: "\f87d"; }
+
+.fa-remove-format::before {
+  content: "\f87d"; }
+
+.fa-face-smile-wink::before {
+  content: "\f4da"; }
+
+.fa-smile-wink::before {
+  content: "\f4da"; }
+
+.fa-file-word::before {
+  content: "\f1c2"; }
+
+.fa-file-powerpoint::before {
+  content: "\f1c4"; }
+
+.fa-arrows-left-right::before {
+  content: "\f07e"; }
+
+.fa-arrows-h::before {
+  content: "\f07e"; }
+
+.fa-house-lock::before {
+  content: "\e510"; }
+
+.fa-cloud-arrow-down::before {
+  content: "\f0ed"; }
+
+.fa-cloud-download::before {
+  content: "\f0ed"; }
+
+.fa-cloud-download-alt::before {
+  content: "\f0ed"; }
+
+.fa-children::before {
+  content: "\e4e1"; }
+
+.fa-chalkboard::before {
+  content: "\f51b"; }
+
+.fa-blackboard::before {
+  content: "\f51b"; }
+
+.fa-user-large-slash::before {
+  content: "\f4fa"; }
+
+.fa-user-alt-slash::before {
+  content: "\f4fa"; }
+
+.fa-envelope-open::before {
+  content: "\f2b6"; }
+
+.fa-handshake-simple-slash::before {
+  content: "\e05f"; }
+
+.fa-handshake-alt-slash::before {
+  content: "\e05f"; }
+
+.fa-mattress-pillow::before {
+  content: "\e525"; }
+
+.fa-guarani-sign::before {
+  content: "\e19a"; }
+
+.fa-arrows-rotate::before {
+  content: "\f021"; }
+
+.fa-refresh::before {
+  content: "\f021"; }
+
+.fa-sync::before {
+  content: "\f021"; }
+
+.fa-fire-extinguisher::before {
+  content: "\f134"; }
+
+.fa-cruzeiro-sign::before {
+  content: "\e152"; }
+
+.fa-greater-than-equal::before {
+  content: "\f532"; }
+
+.fa-shield-halved::before {
+  content: "\f3ed"; }
+
+.fa-shield-alt::before {
+  content: "\f3ed"; }
+
+.fa-book-atlas::before {
+  content: "\f558"; }
+
+.fa-atlas::before {
+  content: "\f558"; }
+
+.fa-virus::before {
+  content: "\e074"; }
+
+.fa-envelope-circle-check::before {
+  content: "\e4e8"; }
+
+.fa-layer-group::before {
+  content: "\f5fd"; }
+
+.fa-arrows-to-dot::before {
+  content: "\e4be"; }
+
+.fa-archway::before {
+  content: "\f557"; }
+
+.fa-heart-circle-check::before {
+  content: "\e4fd"; }
+
+.fa-house-chimney-crack::before {
+  content: "\f6f1"; }
+
+.fa-house-damage::before {
+  content: "\f6f1"; }
+
+.fa-file-zipper::before {
+  content: "\f1c6"; }
+
+.fa-file-archive::before {
+  content: "\f1c6"; }
+
+.fa-square::before {
+  content: "\f0c8"; }
+
+.fa-martini-glass-empty::before {
+  content: "\f000"; }
+
+.fa-glass-martini::before {
+  content: "\f000"; }
+
+.fa-couch::before {
+  content: "\f4b8"; }
+
+.fa-cedi-sign::before {
+  content: "\e0df"; }
+
+.fa-italic::before {
+  content: "\f033"; }
+
+.fa-church::before {
+  content: "\f51d"; }
+
+.fa-comments-dollar::before {
+  content: "\f653"; }
+
+.fa-democrat::before {
+  content: "\f747"; }
+
+.fa-z::before {
+  content: "\5a"; }
+
+.fa-person-skiing::before {
+  content: "\f7c9"; }
+
+.fa-skiing::before {
+  content: "\f7c9"; }
+
+.fa-road-lock::before {
+  content: "\e567"; }
+
+.fa-a::before {
+  content: "\41"; }
+
+.fa-temperature-arrow-down::before {
+  content: "\e03f"; }
+
+.fa-temperature-down::before {
+  content: "\e03f"; }
+
+.fa-feather-pointed::before {
+  content: "\f56b"; }
+
+.fa-feather-alt::before {
+  content: "\f56b"; }
+
+.fa-p::before {
+  content: "\50"; }
+
+.fa-snowflake::before {
+  content: "\f2dc"; }
+
+.fa-newspaper::before {
+  content: "\f1ea"; }
+
+.fa-rectangle-ad::before {
+  content: "\f641"; }
+
+.fa-ad::before {
+  content: "\f641"; }
+
+.fa-circle-arrow-right::before {
+  content: "\f0a9"; }
+
+.fa-arrow-circle-right::before {
+  content: "\f0a9"; }
+
+.fa-filter-circle-xmark::before {
+  content: "\e17b"; }
+
+.fa-locust::before {
+  content: "\e520"; }
+
+.fa-sort::before {
+  content: "\f0dc"; }
+
+.fa-unsorted::before {
+  content: "\f0dc"; }
+
+.fa-list-ol::before {
+  content: "\f0cb"; }
+
+.fa-list-1-2::before {
+  content: "\f0cb"; }
+
+.fa-list-numeric::before {
+  content: "\f0cb"; }
+
+.fa-person-dress-burst::before {
+  content: "\e544"; }
+
+.fa-money-check-dollar::before {
+  content: "\f53d"; }
+
+.fa-money-check-alt::before {
+  content: "\f53d"; }
+
+.fa-vector-square::before {
+  content: "\f5cb"; }
+
+.fa-bread-slice::before {
+  content: "\f7ec"; }
+
+.fa-language::before {
+  content: "\f1ab"; }
+
+.fa-face-kiss-wink-heart::before {
+  content: "\f598"; }
+
+.fa-kiss-wink-heart::before {
+  content: "\f598"; }
+
+.fa-filter::before {
+  content: "\f0b0"; }
+
+.fa-question::before {
+  content: "\3f"; }
+
+.fa-file-signature::before {
+  content: "\f573"; }
+
+.fa-up-down-left-right::before {
+  content: "\f0b2"; }
+
+.fa-arrows-alt::before {
+  content: "\f0b2"; }
+
+.fa-house-chimney-user::before {
+  content: "\e065"; }
+
+.fa-hand-holding-heart::before {
+  content: "\f4be"; }
+
+.fa-puzzle-piece::before {
+  content: "\f12e"; }
+
+.fa-money-check::before {
+  content: "\f53c"; }
+
+.fa-star-half-stroke::before {
+  content: "\f5c0"; }
+
+.fa-star-half-alt::before {
+  content: "\f5c0"; }
+
+.fa-code::before {
+  content: "\f121"; }
+
+.fa-whiskey-glass::before {
+  content: "\f7a0"; }
+
+.fa-glass-whiskey::before {
+  content: "\f7a0"; }
+
+.fa-building-circle-exclamation::before {
+  content: "\e4d3"; }
+
+.fa-magnifying-glass-chart::before {
+  content: "\e522"; }
+
+.fa-arrow-up-right-from-square::before {
+  content: "\f08e"; }
+
+.fa-external-link::before {
+  content: "\f08e"; }
+
+.fa-cubes-stacked::before {
+  content: "\e4e6"; }
+
+.fa-won-sign::before {
+  content: "\f159"; }
+
+.fa-krw::before {
+  content: "\f159"; }
+
+.fa-won::before {
+  content: "\f159"; }
+
+.fa-virus-covid::before {
+  content: "\e4a8"; }
+
+.fa-austral-sign::before {
+  content: "\e0a9"; }
+
+.fa-f::before {
+  content: "\46"; }
+
+.fa-leaf::before {
+  content: "\f06c"; }
+
+.fa-road::before {
+  content: "\f018"; }
+
+.fa-taxi::before {
+  content: "\f1ba"; }
+
+.fa-cab::before {
+  content: "\f1ba"; }
+
+.fa-person-circle-plus::before {
+  content: "\e541"; }
+
+.fa-chart-pie::before {
+  content: "\f200"; }
+
+.fa-pie-chart::before {
+  content: "\f200"; }
+
+.fa-bolt-lightning::before {
+  content: "\e0b7"; }
+
+.fa-sack-xmark::before {
+  content: "\e56a"; }
+
+.fa-file-excel::before {
+  content: "\f1c3"; }
+
+.fa-file-contract::before {
+  content: "\f56c"; }
+
+.fa-fish-fins::before {
+  content: "\e4f2"; }
+
+.fa-building-flag::before {
+  content: "\e4d5"; }
+
+.fa-face-grin-beam::before {
+  content: "\f582"; }
+
+.fa-grin-beam::before {
+  content: "\f582"; }
+
+.fa-object-ungroup::before {
+  content: "\f248"; }
+
+.fa-poop::before {
+  content: "\f619"; }
+
+.fa-location-pin::before {
+  content: "\f041"; }
+
+.fa-map-marker::before {
+  content: "\f041"; }
+
+.fa-kaaba::before {
+  content: "\f66b"; }
+
+.fa-toilet-paper::before {
+  content: "\f71e"; }
+
+.fa-helmet-safety::before {
+  content: "\f807"; }
+
+.fa-hard-hat::before {
+  content: "\f807"; }
+
+.fa-hat-hard::before {
+  content: "\f807"; }
+
+.fa-eject::before {
+  content: "\f052"; }
+
+.fa-circle-right::before {
+  content: "\f35a"; }
+
+.fa-arrow-alt-circle-right::before {
+  content: "\f35a"; }
+
+.fa-plane-circle-check::before {
+  content: "\e555"; }
+
+.fa-face-rolling-eyes::before {
+  content: "\f5a5"; }
+
+.fa-meh-rolling-eyes::before {
+  content: "\f5a5"; }
+
+.fa-object-group::before {
+  content: "\f247"; }
+
+.fa-chart-line::before {
+  content: "\f201"; }
+
+.fa-line-chart::before {
+  content: "\f201"; }
+
+.fa-mask-ventilator::before {
+  content: "\e524"; }
+
+.fa-arrow-right::before {
+  content: "\f061"; }
+
+.fa-signs-post::before {
+  content: "\f277"; }
+
+.fa-map-signs::before {
+  content: "\f277"; }
+
+.fa-cash-register::before {
+  content: "\f788"; }
+
+.fa-person-circle-question::before {
+  content: "\e542"; }
+
+.fa-h::before {
+  content: "\48"; }
+
+.fa-tarp::before {
+  content: "\e57b"; }
+
+.fa-screwdriver-wrench::before {
+  content: "\f7d9"; }
+
+.fa-tools::before {
+  content: "\f7d9"; }
+
+.fa-arrows-to-eye::before {
+  content: "\e4bf"; }
+
+.fa-plug-circle-bolt::before {
+  content: "\e55b"; }
+
+.fa-heart::before {
+  content: "\f004"; }
+
+.fa-mars-and-venus::before {
+  content: "\f224"; }
+
+.fa-house-user::before {
+  content: "\e1b0"; }
+
+.fa-home-user::before {
+  content: "\e1b0"; }
+
+.fa-dumpster-fire::before {
+  content: "\f794"; }
+
+.fa-house-crack::before {
+  content: "\e3b1"; }
+
+.fa-martini-glass-citrus::before {
+  content: "\f561"; }
+
+.fa-cocktail::before {
+  content: "\f561"; }
+
+.fa-face-surprise::before {
+  content: "\f5c2"; }
+
+.fa-surprise::before {
+  content: "\f5c2"; }
+
+.fa-bottle-water::before {
+  content: "\e4c5"; }
+
+.fa-circle-pause::before {
+  content: "\f28b"; }
+
+.fa-pause-circle::before {
+  content: "\f28b"; }
+
+.fa-toilet-paper-slash::before {
+  content: "\e072"; }
+
+.fa-apple-whole::before {
+  content: "\f5d1"; }
+
+.fa-apple-alt::before {
+  content: "\f5d1"; }
+
+.fa-kitchen-set::before {
+  content: "\e51a"; }
+
+.fa-r::before {
+  content: "\52"; }
+
+.fa-temperature-quarter::before {
+  content: "\f2ca"; }
+
+.fa-temperature-1::before {
+  content: "\f2ca"; }
+
+.fa-thermometer-1::before {
+  content: "\f2ca"; }
+
+.fa-thermometer-quarter::before {
+  content: "\f2ca"; }
+
+.fa-cube::before {
+  content: "\f1b2"; }
+
+.fa-bitcoin-sign::before {
+  content: "\e0b4"; }
+
+.fa-shield-dog::before {
+  content: "\e573"; }
+
+.fa-solar-panel::before {
+  content: "\f5ba"; }
+
+.fa-lock-open::before {
+  content: "\f3c1"; }
+
+.fa-elevator::before {
+  content: "\e16d"; }
+
+.fa-money-bill-transfer::before {
+  content: "\e528"; }
+
+.fa-money-bill-trend-up::before {
+  content: "\e529"; }
+
+.fa-house-flood-water-circle-arrow-right::before {
+  content: "\e50f"; }
+
+.fa-square-poll-horizontal::before {
+  content: "\f682"; }
+
+.fa-poll-h::before {
+  content: "\f682"; }
+
+.fa-circle::before {
+  content: "\f111"; }
+
+.fa-backward-fast::before {
+  content: "\f049"; }
+
+.fa-fast-backward::before {
+  content: "\f049"; }
+
+.fa-recycle::before {
+  content: "\f1b8"; }
+
+.fa-user-astronaut::before {
+  content: "\f4fb"; }
+
+.fa-plane-slash::before {
+  content: "\e069"; }
+
+.fa-trademark::before {
+  content: "\f25c"; }
+
+.fa-basketball::before {
+  content: "\f434"; }
+
+.fa-basketball-ball::before {
+  content: "\f434"; }
+
+.fa-satellite-dish::before {
+  content: "\f7c0"; }
+
+.fa-circle-up::before {
+  content: "\f35b"; }
+
+.fa-arrow-alt-circle-up::before {
+  content: "\f35b"; }
+
+.fa-mobile-screen-button::before {
+  content: "\f3cd"; }
+
+.fa-mobile-alt::before {
+  content: "\f3cd"; }
+
+.fa-volume-high::before {
+  content: "\f028"; }
+
+.fa-volume-up::before {
+  content: "\f028"; }
+
+.fa-users-rays::before {
+  content: "\e593"; }
+
+.fa-wallet::before {
+  content: "\f555"; }
+
+.fa-clipboard-check::before {
+  content: "\f46c"; }
+
+.fa-file-audio::before {
+  content: "\f1c7"; }
+
+.fa-burger::before {
+  content: "\f805"; }
+
+.fa-hamburger::before {
+  content: "\f805"; }
+
+.fa-wrench::before {
+  content: "\f0ad"; }
+
+.fa-bugs::before {
+  content: "\e4d0"; }
+
+.fa-rupee-sign::before {
+  content: "\f156"; }
+
+.fa-rupee::before {
+  content: "\f156"; }
+
+.fa-file-image::before {
+  content: "\f1c5"; }
+
+.fa-circle-question::before {
+  content: "\f059"; }
+
+.fa-question-circle::before {
+  content: "\f059"; }
+
+.fa-plane-departure::before {
+  content: "\f5b0"; }
+
+.fa-handshake-slash::before {
+  content: "\e060"; }
+
+.fa-book-bookmark::before {
+  content: "\e0bb"; }
+
+.fa-code-branch::before {
+  content: "\f126"; }
+
+.fa-hat-cowboy::before {
+  content: "\f8c0"; }
+
+.fa-bridge::before {
+  content: "\e4c8"; }
+
+.fa-phone-flip::before {
+  content: "\f879"; }
+
+.fa-phone-alt::before {
+  content: "\f879"; }
+
+.fa-truck-front::before {
+  content: "\e2b7"; }
+
+.fa-cat::before {
+  content: "\f6be"; }
+
+.fa-anchor-circle-exclamation::before {
+  content: "\e4ab"; }
+
+.fa-truck-field::before {
+  content: "\e58d"; }
+
+.fa-route::before {
+  content: "\f4d7"; }
+
+.fa-clipboard-question::before {
+  content: "\e4e3"; }
+
+.fa-panorama::before {
+  content: "\e209"; }
+
+.fa-comment-medical::before {
+  content: "\f7f5"; }
+
+.fa-teeth-open::before {
+  content: "\f62f"; }
+
+.fa-file-circle-minus::before {
+  content: "\e4ed"; }
+
+.fa-tags::before {
+  content: "\f02c"; }
+
+.fa-wine-glass::before {
+  content: "\f4e3"; }
+
+.fa-forward-fast::before {
+  content: "\f050"; }
+
+.fa-fast-forward::before {
+  content: "\f050"; }
+
+.fa-face-meh-blank::before {
+  content: "\f5a4"; }
+
+.fa-meh-blank::before {
+  content: "\f5a4"; }
+
+.fa-square-parking::before {
+  content: "\f540"; }
+
+.fa-parking::before {
+  content: "\f540"; }
+
+.fa-house-signal::before {
+  content: "\e012"; }
+
+.fa-bars-progress::before {
+  content: "\f828"; }
+
+.fa-tasks-alt::before {
+  content: "\f828"; }
+
+.fa-faucet-drip::before {
+  content: "\e006"; }
+
+.fa-cart-flatbed::before {
+  content: "\f474"; }
+
+.fa-dolly-flatbed::before {
+  content: "\f474"; }
+
+.fa-ban-smoking::before {
+  content: "\f54d"; }
+
+.fa-smoking-ban::before {
+  content: "\f54d"; }
+
+.fa-terminal::before {
+  content: "\f120"; }
+
+.fa-mobile-button::before {
+  content: "\f10b"; }
+
+.fa-house-medical-flag::before {
+  content: "\e514"; }
+
+.fa-basket-shopping::before {
+  content: "\f291"; }
+
+.fa-shopping-basket::before {
+  content: "\f291"; }
+
+.fa-tape::before {
+  content: "\f4db"; }
+
+.fa-bus-simple::before {
+  content: "\f55e"; }
+
+.fa-bus-alt::before {
+  content: "\f55e"; }
+
+.fa-eye::before {
+  content: "\f06e"; }
+
+.fa-face-sad-cry::before {
+  content: "\f5b3"; }
+
+.fa-sad-cry::before {
+  content: "\f5b3"; }
+
+.fa-audio-description::before {
+  content: "\f29e"; }
+
+.fa-person-military-to-person::before {
+  content: "\e54c"; }
+
+.fa-file-shield::before {
+  content: "\e4f0"; }
+
+.fa-user-slash::before {
+  content: "\f506"; }
+
+.fa-pen::before {
+  content: "\f304"; }
+
+.fa-tower-observation::before {
+  content: "\e586"; }
+
+.fa-file-code::before {
+  content: "\f1c9"; }
+
+.fa-signal::before {
+  content: "\f012"; }
+
+.fa-signal-5::before {
+  content: "\f012"; }
+
+.fa-signal-perfect::before {
+  content: "\f012"; }
+
+.fa-bus::before {
+  content: "\f207"; }
+
+.fa-heart-circle-xmark::before {
+  content: "\e501"; }
+
+.fa-house-chimney::before {
+  content: "\e3af"; }
+
+.fa-home-lg::before {
+  content: "\e3af"; }
+
+.fa-window-maximize::before {
+  content: "\f2d0"; }
+
+.fa-face-frown::before {
+  content: "\f119"; }
+
+.fa-frown::before {
+  content: "\f119"; }
+
+.fa-prescription::before {
+  content: "\f5b1"; }
+
+.fa-shop::before {
+  content: "\f54f"; }
+
+.fa-store-alt::before {
+  content: "\f54f"; }
+
+.fa-floppy-disk::before {
+  content: "\f0c7"; }
+
+.fa-save::before {
+  content: "\f0c7"; }
+
+.fa-vihara::before {
+  content: "\f6a7"; }
+
+.fa-scale-unbalanced::before {
+  content: "\f515"; }
+
+.fa-balance-scale-left::before {
+  content: "\f515"; }
+
+.fa-sort-up::before {
+  content: "\f0de"; }
+
+.fa-sort-asc::before {
+  content: "\f0de"; }
+
+.fa-comment-dots::before {
+  content: "\f4ad"; }
+
+.fa-commenting::before {
+  content: "\f4ad"; }
+
+.fa-plant-wilt::before {
+  content: "\e5aa"; }
+
+.fa-diamond::before {
+  content: "\f219"; }
+
+.fa-face-grin-squint::before {
+  content: "\f585"; }
+
+.fa-grin-squint::before {
+  content: "\f585"; }
+
+.fa-hand-holding-dollar::before {
+  content: "\f4c0"; }
+
+.fa-hand-holding-usd::before {
+  content: "\f4c0"; }
+
+.fa-bacterium::before {
+  content: "\e05a"; }
+
+.fa-hand-pointer::before {
+  content: "\f25a"; }
+
+.fa-drum-steelpan::before {
+  content: "\f56a"; }
+
+.fa-hand-scissors::before {
+  content: "\f257"; }
+
+.fa-hands-praying::before {
+  content: "\f684"; }
+
+.fa-praying-hands::before {
+  content: "\f684"; }
+
+.fa-arrow-rotate-right::before {
+  content: "\f01e"; }
+
+.fa-arrow-right-rotate::before {
+  content: "\f01e"; }
+
+.fa-arrow-rotate-forward::before {
+  content: "\f01e"; }
+
+.fa-redo::before {
+  content: "\f01e"; }
+
+.fa-biohazard::before {
+  content: "\f780"; }
+
+.fa-location-crosshairs::before {
+  content: "\f601"; }
+
+.fa-location::before {
+  content: "\f601"; }
+
+.fa-mars-double::before {
+  content: "\f227"; }
+
+.fa-child-dress::before {
+  content: "\e59c"; }
+
+.fa-users-between-lines::before {
+  content: "\e591"; }
+
+.fa-lungs-virus::before {
+  content: "\e067"; }
+
+.fa-face-grin-tears::before {
+  content: "\f588"; }
+
+.fa-grin-tears::before {
+  content: "\f588"; }
+
+.fa-phone::before {
+  content: "\f095"; }
+
+.fa-calendar-xmark::before {
+  content: "\f273"; }
+
+.fa-calendar-times::before {
+  content: "\f273"; }
+
+.fa-child-reaching::before {
+  content: "\e59d"; }
+
+.fa-head-side-virus::before {
+  content: "\e064"; }
+
+.fa-user-gear::before {
+  content: "\f4fe"; }
+
+.fa-user-cog::before {
+  content: "\f4fe"; }
+
+.fa-arrow-up-1-9::before {
+  content: "\f163"; }
+
+.fa-sort-numeric-up::before {
+  content: "\f163"; }
+
+.fa-door-closed::before {
+  content: "\f52a"; }
+
+.fa-shield-virus::before {
+  content: "\e06c"; }
+
+.fa-dice-six::before {
+  content: "\f526"; }
+
+.fa-mosquito-net::before {
+  content: "\e52c"; }
+
+.fa-bridge-water::before {
+  content: "\e4ce"; }
+
+.fa-person-booth::before {
+  content: "\f756"; }
+
+.fa-text-width::before {
+  content: "\f035"; }
+
+.fa-hat-wizard::before {
+  content: "\f6e8"; }
+
+.fa-pen-fancy::before {
+  content: "\f5ac"; }
+
+.fa-person-digging::before {
+  content: "\f85e"; }
+
+.fa-digging::before {
+  content: "\f85e"; }
+
+.fa-trash::before {
+  content: "\f1f8"; }
+
+.fa-gauge-simple::before {
+  content: "\f629"; }
+
+.fa-gauge-simple-med::before {
+  content: "\f629"; }
+
+.fa-tachometer-average::before {
+  content: "\f629"; }
+
+.fa-book-medical::before {
+  content: "\f7e6"; }
+
+.fa-poo::before {
+  content: "\f2fe"; }
+
+.fa-quote-right::before {
+  content: "\f10e"; }
+
+.fa-quote-right-alt::before {
+  content: "\f10e"; }
+
+.fa-shirt::before {
+  content: "\f553"; }
+
+.fa-t-shirt::before {
+  content: "\f553"; }
+
+.fa-tshirt::before {
+  content: "\f553"; }
+
+.fa-cubes::before {
+  content: "\f1b3"; }
+
+.fa-divide::before {
+  content: "\f529"; }
+
+.fa-tenge-sign::before {
+  content: "\f7d7"; }
+
+.fa-tenge::before {
+  content: "\f7d7"; }
+
+.fa-headphones::before {
+  content: "\f025"; }
+
+.fa-hands-holding::before {
+  content: "\f4c2"; }
+
+.fa-hands-clapping::before {
+  content: "\e1a8"; }
+
+.fa-republican::before {
+  content: "\f75e"; }
+
+.fa-arrow-left::before {
+  content: "\f060"; }
+
+.fa-person-circle-xmark::before {
+  content: "\e543"; }
+
+.fa-ruler::before {
+  content: "\f545"; }
+
+.fa-align-left::before {
+  content: "\f036"; }
+
+.fa-dice-d6::before {
+  content: "\f6d1"; }
+
+.fa-restroom::before {
+  content: "\f7bd"; }
+
+.fa-j::before {
+  content: "\4a"; }
+
+.fa-users-viewfinder::before {
+  content: "\e595"; }
+
+.fa-file-video::before {
+  content: "\f1c8"; }
+
+.fa-up-right-from-square::before {
+  content: "\f35d"; }
+
+.fa-external-link-alt::before {
+  content: "\f35d"; }
+
+.fa-table-cells::before {
+  content: "\f00a"; }
+
+.fa-th::before {
+  content: "\f00a"; }
+
+.fa-file-pdf::before {
+  content: "\f1c1"; }
+
+.fa-book-bible::before {
+  content: "\f647"; }
+
+.fa-bible::before {
+  content: "\f647"; }
+
+.fa-o::before {
+  content: "\4f"; }
+
+.fa-suitcase-medical::before {
+  content: "\f0fa"; }
+
+.fa-medkit::before {
+  content: "\f0fa"; }
+
+.fa-user-secret::before {
+  content: "\f21b"; }
+
+.fa-otter::before {
+  content: "\f700"; }
+
+.fa-person-dress::before {
+  content: "\f182"; }
+
+.fa-female::before {
+  content: "\f182"; }
+
+.fa-comment-dollar::before {
+  content: "\f651"; }
+
+.fa-business-time::before {
+  content: "\f64a"; }
+
+.fa-briefcase-clock::before {
+  content: "\f64a"; }
+
+.fa-table-cells-large::before {
+  content: "\f009"; }
+
+.fa-th-large::before {
+  content: "\f009"; }
+
+.fa-book-tanakh::before {
+  content: "\f827"; }
+
+.fa-tanakh::before {
+  content: "\f827"; }
+
+.fa-phone-volume::before {
+  content: "\f2a0"; }
+
+.fa-volume-control-phone::before {
+  content: "\f2a0"; }
+
+.fa-hat-cowboy-side::before {
+  content: "\f8c1"; }
+
+.fa-clipboard-user::before {
+  content: "\f7f3"; }
+
+.fa-child::before {
+  content: "\f1ae"; }
+
+.fa-lira-sign::before {
+  content: "\f195"; }
+
+.fa-satellite::before {
+  content: "\f7bf"; }
+
+.fa-plane-lock::before {
+  content: "\e558"; }
+
+.fa-tag::before {
+  content: "\f02b"; }
+
+.fa-comment::before {
+  content: "\f075"; }
+
+.fa-cake-candles::before {
+  content: "\f1fd"; }
+
+.fa-birthday-cake::before {
+  content: "\f1fd"; }
+
+.fa-cake::before {
+  content: "\f1fd"; }
+
+.fa-envelope::before {
+  content: "\f0e0"; }
+
+.fa-angles-up::before {
+  content: "\f102"; }
+
+.fa-angle-double-up::before {
+  content: "\f102"; }
+
+.fa-paperclip::before {
+  content: "\f0c6"; }
+
+.fa-arrow-right-to-city::before {
+  content: "\e4b3"; }
+
+.fa-ribbon::before {
+  content: "\f4d6"; }
+
+.fa-lungs::before {
+  content: "\f604"; }
+
+.fa-arrow-up-9-1::before {
+  content: "\f887"; }
+
+.fa-sort-numeric-up-alt::before {
+  content: "\f887"; }
+
+.fa-litecoin-sign::before {
+  content: "\e1d3"; }
+
+.fa-border-none::before {
+  content: "\f850"; }
+
+.fa-circle-nodes::before {
+  content: "\e4e2"; }
+
+.fa-parachute-box::before {
+  content: "\f4cd"; }
+
+.fa-indent::before {
+  content: "\f03c"; }
+
+.fa-truck-field-un::before {
+  content: "\e58e"; }
+
+.fa-hourglass::before {
+  content: "\f254"; }
+
+.fa-hourglass-empty::before {
+  content: "\f254"; }
+
+.fa-mountain::before {
+  content: "\f6fc"; }
+
+.fa-user-doctor::before {
+  content: "\f0f0"; }
+
+.fa-user-md::before {
+  content: "\f0f0"; }
+
+.fa-circle-info::before {
+  content: "\f05a"; }
+
+.fa-info-circle::before {
+  content: "\f05a"; }
+
+.fa-cloud-meatball::before {
+  content: "\f73b"; }
+
+.fa-camera::before {
+  content: "\f030"; }
+
+.fa-camera-alt::before {
+  content: "\f030"; }
+
+.fa-square-virus::before {
+  content: "\e578"; }
+
+.fa-meteor::before {
+  content: "\f753"; }
+
+.fa-car-on::before {
+  content: "\e4dd"; }
+
+.fa-sleigh::before {
+  content: "\f7cc"; }
+
+.fa-arrow-down-1-9::before {
+  content: "\f162"; }
+
+.fa-sort-numeric-asc::before {
+  content: "\f162"; }
+
+.fa-sort-numeric-down::before {
+  content: "\f162"; }
+
+.fa-hand-holding-droplet::before {
+  content: "\f4c1"; }
+
+.fa-hand-holding-water::before {
+  content: "\f4c1"; }
+
+.fa-water::before {
+  content: "\f773"; }
+
+.fa-calendar-check::before {
+  content: "\f274"; }
+
+.fa-braille::before {
+  content: "\f2a1"; }
+
+.fa-prescription-bottle-medical::before {
+  content: "\f486"; }
+
+.fa-prescription-bottle-alt::before {
+  content: "\f486"; }
+
+.fa-landmark::before {
+  content: "\f66f"; }
+
+.fa-truck::before {
+  content: "\f0d1"; }
+
+.fa-crosshairs::before {
+  content: "\f05b"; }
+
+.fa-person-cane::before {
+  content: "\e53c"; }
+
+.fa-tent::before {
+  content: "\e57d"; }
+
+.fa-vest-patches::before {
+  content: "\e086"; }
+
+.fa-check-double::before {
+  content: "\f560"; }
+
+.fa-arrow-down-a-z::before {
+  content: "\f15d"; }
+
+.fa-sort-alpha-asc::before {
+  content: "\f15d"; }
+
+.fa-sort-alpha-down::before {
+  content: "\f15d"; }
+
+.fa-money-bill-wheat::before {
+  content: "\e52a"; }
+
+.fa-cookie::before {
+  content: "\f563"; }
+
+.fa-arrow-rotate-left::before {
+  content: "\f0e2"; }
+
+.fa-arrow-left-rotate::before {
+  content: "\f0e2"; }
+
+.fa-arrow-rotate-back::before {
+  content: "\f0e2"; }
+
+.fa-arrow-rotate-backward::before {
+  content: "\f0e2"; }
+
+.fa-undo::before {
+  content: "\f0e2"; }
+
+.fa-hard-drive::before {
+  content: "\f0a0"; }
+
+.fa-hdd::before {
+  content: "\f0a0"; }
+
+.fa-face-grin-squint-tears::before {
+  content: "\f586"; }
+
+.fa-grin-squint-tears::before {
+  content: "\f586"; }
+
+.fa-dumbbell::before {
+  content: "\f44b"; }
+
+.fa-rectangle-list::before {
+  content: "\f022"; }
+
+.fa-list-alt::before {
+  content: "\f022"; }
+
+.fa-tarp-droplet::before {
+  content: "\e57c"; }
+
+.fa-house-medical-circle-check::before {
+  content: "\e511"; }
+
+.fa-person-skiing-nordic::before {
+  content: "\f7ca"; }
+
+.fa-skiing-nordic::before {
+  content: "\f7ca"; }
+
+.fa-calendar-plus::before {
+  content: "\f271"; }
+
+.fa-plane-arrival::before {
+  content: "\f5af"; }
+
+.fa-circle-left::before {
+  content: "\f359"; }
+
+.fa-arrow-alt-circle-left::before {
+  content: "\f359"; }
+
+.fa-train-subway::before {
+  content: "\f239"; }
+
+.fa-subway::before {
+  content: "\f239"; }
+
+.fa-chart-gantt::before {
+  content: "\e0e4"; }
+
+.fa-indian-rupee-sign::before {
+  content: "\e1bc"; }
+
+.fa-indian-rupee::before {
+  content: "\e1bc"; }
+
+.fa-inr::before {
+  content: "\e1bc"; }
+
+.fa-crop-simple::before {
+  content: "\f565"; }
+
+.fa-crop-alt::before {
+  content: "\f565"; }
+
+.fa-money-bill-1::before {
+  content: "\f3d1"; }
+
+.fa-money-bill-alt::before {
+  content: "\f3d1"; }
+
+.fa-left-long::before {
+  content: "\f30a"; }
+
+.fa-long-arrow-alt-left::before {
+  content: "\f30a"; }
+
+.fa-dna::before {
+  content: "\f471"; }
+
+.fa-virus-slash::before {
+  content: "\e075"; }
+
+.fa-minus::before {
+  content: "\f068"; }
+
+.fa-subtract::before {
+  content: "\f068"; }
+
+.fa-chess::before {
+  content: "\f439"; }
+
+.fa-arrow-left-long::before {
+  content: "\f177"; }
+
+.fa-long-arrow-left::before {
+  content: "\f177"; }
+
+.fa-plug-circle-check::before {
+  content: "\e55c"; }
+
+.fa-street-view::before {
+  content: "\f21d"; }
+
+.fa-franc-sign::before {
+  content: "\e18f"; }
+
+.fa-volume-off::before {
+  content: "\f026"; }
+
+.fa-hands-asl-interpreting::before {
+  content: "\f2a3"; }
+
+.fa-american-sign-language-interpreting::before {
+  content: "\f2a3"; }
+
+.fa-asl-interpreting::before {
+  content: "\f2a3"; }
+
+.fa-hands-american-sign-language-interpreting::before {
+  content: "\f2a3"; }
+
+.fa-gear::before {
+  content: "\f013"; }
+
+.fa-cog::before {
+  content: "\f013"; }
+
+.fa-droplet-slash::before {
+  content: "\f5c7"; }
+
+.fa-tint-slash::before {
+  content: "\f5c7"; }
+
+.fa-mosque::before {
+  content: "\f678"; }
+
+.fa-mosquito::before {
+  content: "\e52b"; }
+
+.fa-star-of-david::before {
+  content: "\f69a"; }
+
+.fa-person-military-rifle::before {
+  content: "\e54b"; }
+
+.fa-cart-shopping::before {
+  content: "\f07a"; }
+
+.fa-shopping-cart::before {
+  content: "\f07a"; }
+
+.fa-vials::before {
+  content: "\f493"; }
+
+.fa-plug-circle-plus::before {
+  content: "\e55f"; }
+
+.fa-place-of-worship::before {
+  content: "\f67f"; }
+
+.fa-grip-vertical::before {
+  content: "\f58e"; }
+
+.fa-arrow-turn-up::before {
+  content: "\f148"; }
+
+.fa-level-up::before {
+  content: "\f148"; }
+
+.fa-u::before {
+  content: "\55"; }
+
+.fa-square-root-variable::before {
+  content: "\f698"; }
+
+.fa-square-root-alt::before {
+  content: "\f698"; }
+
+.fa-clock::before {
+  content: "\f017"; }
+
+.fa-clock-four::before {
+  content: "\f017"; }
+
+.fa-backward-step::before {
+  content: "\f048"; }
+
+.fa-step-backward::before {
+  content: "\f048"; }
+
+.fa-pallet::before {
+  content: "\f482"; }
+
+.fa-faucet::before {
+  content: "\e005"; }
+
+.fa-baseball-bat-ball::before {
+  content: "\f432"; }
+
+.fa-s::before {
+  content: "\53"; }
+
+.fa-timeline::before {
+  content: "\e29c"; }
+
+.fa-keyboard::before {
+  content: "\f11c"; }
+
+.fa-caret-down::before {
+  content: "\f0d7"; }
+
+.fa-house-chimney-medical::before {
+  content: "\f7f2"; }
+
+.fa-clinic-medical::before {
+  content: "\f7f2"; }
+
+.fa-temperature-three-quarters::before {
+  content: "\f2c8"; }
+
+.fa-temperature-3::before {
+  content: "\f2c8"; }
+
+.fa-thermometer-3::before {
+  content: "\f2c8"; }
+
+.fa-thermometer-three-quarters::before {
+  content: "\f2c8"; }
+
+.fa-mobile-screen::before {
+  content: "\f3cf"; }
+
+.fa-mobile-android-alt::before {
+  content: "\f3cf"; }
+
+.fa-plane-up::before {
+  content: "\e22d"; }
+
+.fa-piggy-bank::before {
+  content: "\f4d3"; }
+
+.fa-battery-half::before {
+  content: "\f242"; }
+
+.fa-battery-3::before {
+  content: "\f242"; }
+
+.fa-mountain-city::before {
+  content: "\e52e"; }
+
+.fa-coins::before {
+  content: "\f51e"; }
+
+.fa-khanda::before {
+  content: "\f66d"; }
+
+.fa-sliders::before {
+  content: "\f1de"; }
+
+.fa-sliders-h::before {
+  content: "\f1de"; }
+
+.fa-folder-tree::before {
+  content: "\f802"; }
+
+.fa-network-wired::before {
+  content: "\f6ff"; }
+
+.fa-map-pin::before {
+  content: "\f276"; }
+
+.fa-hamsa::before {
+  content: "\f665"; }
+
+.fa-cent-sign::before {
+  content: "\e3f5"; }
+
+.fa-flask::before {
+  content: "\f0c3"; }
+
+.fa-person-pregnant::before {
+  content: "\e31e"; }
+
+.fa-wand-sparkles::before {
+  content: "\f72b"; }
+
+.fa-ellipsis-vertical::before {
+  content: "\f142"; }
+
+.fa-ellipsis-v::before {
+  content: "\f142"; }
+
+.fa-ticket::before {
+  content: "\f145"; }
+
+.fa-power-off::before {
+  content: "\f011"; }
+
+.fa-right-long::before {
+  content: "\f30b"; }
+
+.fa-long-arrow-alt-right::before {
+  content: "\f30b"; }
+
+.fa-flag-usa::before {
+  content: "\f74d"; }
+
+.fa-laptop-file::before {
+  content: "\e51d"; }
+
+.fa-tty::before {
+  content: "\f1e4"; }
+
+.fa-teletype::before {
+  content: "\f1e4"; }
+
+.fa-diagram-next::before {
+  content: "\e476"; }
+
+.fa-person-rifle::before {
+  content: "\e54e"; }
+
+.fa-house-medical-circle-exclamation::before {
+  content: "\e512"; }
+
+.fa-closed-captioning::before {
+  content: "\f20a"; }
+
+.fa-person-hiking::before {
+  content: "\f6ec"; }
+
+.fa-hiking::before {
+  content: "\f6ec"; }
+
+.fa-venus-double::before {
+  content: "\f226"; }
+
+.fa-images::before {
+  content: "\f302"; }
+
+.fa-calculator::before {
+  content: "\f1ec"; }
+
+.fa-people-pulling::before {
+  content: "\e535"; }
+
+.fa-n::before {
+  content: "\4e"; }
+
+.fa-cable-car::before {
+  content: "\f7da"; }
+
+.fa-tram::before {
+  content: "\f7da"; }
+
+.fa-cloud-rain::before {
+  content: "\f73d"; }
+
+.fa-building-circle-xmark::before {
+  content: "\e4d4"; }
+
+.fa-ship::before {
+  content: "\f21a"; }
+
+.fa-arrows-down-to-line::before {
+  content: "\e4b8"; }
+
+.fa-download::before {
+  content: "\f019"; }
+
+.fa-face-grin::before {
+  content: "\f580"; }
+
+.fa-grin::before {
+  content: "\f580"; }
+
+.fa-delete-left::before {
+  content: "\f55a"; }
+
+.fa-backspace::before {
+  content: "\f55a"; }
+
+.fa-eye-dropper::before {
+  content: "\f1fb"; }
+
+.fa-eye-dropper-empty::before {
+  content: "\f1fb"; }
+
+.fa-eyedropper::before {
+  content: "\f1fb"; }
+
+.fa-file-circle-check::before {
+  content: "\e5a0"; }
+
+.fa-forward::before {
+  content: "\f04e"; }
+
+.fa-mobile::before {
+  content: "\f3ce"; }
+
+.fa-mobile-android::before {
+  content: "\f3ce"; }
+
+.fa-mobile-phone::before {
+  content: "\f3ce"; }
+
+.fa-face-meh::before {
+  content: "\f11a"; }
+
+.fa-meh::before {
+  content: "\f11a"; }
+
+.fa-align-center::before {
+  content: "\f037"; }
+
+.fa-book-skull::before {
+  content: "\f6b7"; }
+
+.fa-book-dead::before {
+  content: "\f6b7"; }
+
+.fa-id-card::before {
+  content: "\f2c2"; }
+
+.fa-drivers-license::before {
+  content: "\f2c2"; }
+
+.fa-outdent::before {
+  content: "\f03b"; }
+
+.fa-dedent::before {
+  content: "\f03b"; }
+
+.fa-heart-circle-exclamation::before {
+  content: "\e4fe"; }
+
+.fa-house::before {
+  content: "\f015"; }
+
+.fa-home::before {
+  content: "\f015"; }
+
+.fa-home-alt::before {
+  content: "\f015"; }
+
+.fa-home-lg-alt::before {
+  content: "\f015"; }
+
+.fa-calendar-week::before {
+  content: "\f784"; }
+
+.fa-laptop-medical::before {
+  content: "\f812"; }
+
+.fa-b::before {
+  content: "\42"; }
+
+.fa-file-medical::before {
+  content: "\f477"; }
+
+.fa-dice-one::before {
+  content: "\f525"; }
+
+.fa-kiwi-bird::before {
+  content: "\f535"; }
+
+.fa-arrow-right-arrow-left::before {
+  content: "\f0ec"; }
+
+.fa-exchange::before {
+  content: "\f0ec"; }
+
+.fa-rotate-right::before {
+  content: "\f2f9"; }
+
+.fa-redo-alt::before {
+  content: "\f2f9"; }
+
+.fa-rotate-forward::before {
+  content: "\f2f9"; }
+
+.fa-utensils::before {
+  content: "\f2e7"; }
+
+.fa-cutlery::before {
+  content: "\f2e7"; }
+
+.fa-arrow-up-wide-short::before {
+  content: "\f161"; }
+
+.fa-sort-amount-up::before {
+  content: "\f161"; }
+
+.fa-mill-sign::before {
+  content: "\e1ed"; }
+
+.fa-bowl-rice::before {
+  content: "\e2eb"; }
+
+.fa-skull::before {
+  content: "\f54c"; }
+
+.fa-tower-broadcast::before {
+  content: "\f519"; }
+
+.fa-broadcast-tower::before {
+  content: "\f519"; }
+
+.fa-truck-pickup::before {
+  content: "\f63c"; }
+
+.fa-up-long::before {
+  content: "\f30c"; }
+
+.fa-long-arrow-alt-up::before {
+  content: "\f30c"; }
+
+.fa-stop::before {
+  content: "\f04d"; }
+
+.fa-code-merge::before {
+  content: "\f387"; }
+
+.fa-upload::before {
+  content: "\f093"; }
+
+.fa-hurricane::before {
+  content: "\f751"; }
+
+.fa-mound::before {
+  content: "\e52d"; }
+
+.fa-toilet-portable::before {
+  content: "\e583"; }
+
+.fa-compact-disc::before {
+  content: "\f51f"; }
+
+.fa-file-arrow-down::before {
+  content: "\f56d"; }
+
+.fa-file-download::before {
+  content: "\f56d"; }
+
+.fa-caravan::before {
+  content: "\f8ff"; }
+
+.fa-shield-cat::before {
+  content: "\e572"; }
+
+.fa-bolt::before {
+  content: "\f0e7"; }
+
+.fa-zap::before {
+  content: "\f0e7"; }
+
+.fa-glass-water::before {
+  content: "\e4f4"; }
+
+.fa-oil-well::before {
+  content: "\e532"; }
+
+.fa-vault::before {
+  content: "\e2c5"; }
+
+.fa-mars::before {
+  content: "\f222"; }
+
+.fa-toilet::before {
+  content: "\f7d8"; }
+
+.fa-plane-circle-xmark::before {
+  content: "\e557"; }
+
+.fa-yen-sign::before {
+  content: "\f157"; }
+
+.fa-cny::before {
+  content: "\f157"; }
+
+.fa-jpy::before {
+  content: "\f157"; }
+
+.fa-rmb::before {
+  content: "\f157"; }
+
+.fa-yen::before {
+  content: "\f157"; }
+
+.fa-ruble-sign::before {
+  content: "\f158"; }
+
+.fa-rouble::before {
+  content: "\f158"; }
+
+.fa-rub::before {
+  content: "\f158"; }
+
+.fa-ruble::before {
+  content: "\f158"; }
+
+.fa-sun::before {
+  content: "\f185"; }
+
+.fa-guitar::before {
+  content: "\f7a6"; }
+
+.fa-face-laugh-wink::before {
+  content: "\f59c"; }
+
+.fa-laugh-wink::before {
+  content: "\f59c"; }
+
+.fa-horse-head::before {
+  content: "\f7ab"; }
+
+.fa-bore-hole::before {
+  content: "\e4c3"; }
+
+.fa-industry::before {
+  content: "\f275"; }
+
+.fa-circle-down::before {
+  content: "\f358"; }
+
+.fa-arrow-alt-circle-down::before {
+  content: "\f358"; }
+
+.fa-arrows-turn-to-dots::before {
+  content: "\e4c1"; }
+
+.fa-florin-sign::before {
+  content: "\e184"; }
+
+.fa-arrow-down-short-wide::before {
+  content: "\f884"; }
+
+.fa-sort-amount-desc::before {
+  content: "\f884"; }
+
+.fa-sort-amount-down-alt::before {
+  content: "\f884"; }
+
+.fa-less-than::before {
+  content: "\3c"; }
+
+.fa-angle-down::before {
+  content: "\f107"; }
+
+.fa-car-tunnel::before {
+  content: "\e4de"; }
+
+.fa-head-side-cough::before {
+  content: "\e061"; }
+
+.fa-grip-lines::before {
+  content: "\f7a4"; }
+
+.fa-thumbs-down::before {
+  content: "\f165"; }
+
+.fa-user-lock::before {
+  content: "\f502"; }
+
+.fa-arrow-right-long::before {
+  content: "\f178"; }
+
+.fa-long-arrow-right::before {
+  content: "\f178"; }
+
+.fa-anchor-circle-xmark::before {
+  content: "\e4ac"; }
+
+.fa-ellipsis::before {
+  content: "\f141"; }
+
+.fa-ellipsis-h::before {
+  content: "\f141"; }
+
+.fa-chess-pawn::before {
+  content: "\f443"; }
+
+.fa-kit-medical::before {
+  content: "\f479"; }
+
+.fa-first-aid::before {
+  content: "\f479"; }
+
+.fa-person-through-window::before {
+  content: "\e5a9"; }
+
+.fa-toolbox::before {
+  content: "\f552"; }
+
+.fa-hands-holding-circle::before {
+  content: "\e4fb"; }
+
+.fa-bug::before {
+  content: "\f188"; }
+
+.fa-credit-card::before {
+  content: "\f09d"; }
+
+.fa-credit-card-alt::before {
+  content: "\f09d"; }
+
+.fa-car::before {
+  content: "\f1b9"; }
+
+.fa-automobile::before {
+  content: "\f1b9"; }
+
+.fa-hand-holding-hand::before {
+  content: "\e4f7"; }
+
+.fa-book-open-reader::before {
+  content: "\f5da"; }
+
+.fa-book-reader::before {
+  content: "\f5da"; }
+
+.fa-mountain-sun::before {
+  content: "\e52f"; }
+
+.fa-arrows-left-right-to-line::before {
+  content: "\e4ba"; }
+
+.fa-dice-d20::before {
+  content: "\f6cf"; }
+
+.fa-truck-droplet::before {
+  content: "\e58c"; }
+
+.fa-file-circle-xmark::before {
+  content: "\e5a1"; }
+
+.fa-temperature-arrow-up::before {
+  content: "\e040"; }
+
+.fa-temperature-up::before {
+  content: "\e040"; }
+
+.fa-medal::before {
+  content: "\f5a2"; }
+
+.fa-bed::before {
+  content: "\f236"; }
+
+.fa-square-h::before {
+  content: "\f0fd"; }
+
+.fa-h-square::before {
+  content: "\f0fd"; }
+
+.fa-podcast::before {
+  content: "\f2ce"; }
+
+.fa-temperature-full::before {
+  content: "\f2c7"; }
+
+.fa-temperature-4::before {
+  content: "\f2c7"; }
+
+.fa-thermometer-4::before {
+  content: "\f2c7"; }
+
+.fa-thermometer-full::before {
+  content: "\f2c7"; }
+
+.fa-bell::before {
+  content: "\f0f3"; }
+
+.fa-superscript::before {
+  content: "\f12b"; }
+
+.fa-plug-circle-xmark::before {
+  content: "\e560"; }
+
+.fa-star-of-life::before {
+  content: "\f621"; }
+
+.fa-phone-slash::before {
+  content: "\f3dd"; }
+
+.fa-paint-roller::before {
+  content: "\f5aa"; }
+
+.fa-handshake-angle::before {
+  content: "\f4c4"; }
+
+.fa-hands-helping::before {
+  content: "\f4c4"; }
+
+.fa-location-dot::before {
+  content: "\f3c5"; }
+
+.fa-map-marker-alt::before {
+  content: "\f3c5"; }
+
+.fa-file::before {
+  content: "\f15b"; }
+
+.fa-greater-than::before {
+  content: "\3e"; }
+
+.fa-person-swimming::before {
+  content: "\f5c4"; }
+
+.fa-swimmer::before {
+  content: "\f5c4"; }
+
+.fa-arrow-down::before {
+  content: "\f063"; }
+
+.fa-droplet::before {
+  content: "\f043"; }
+
+.fa-tint::before {
+  content: "\f043"; }
+
+.fa-eraser::before {
+  content: "\f12d"; }
+
+.fa-earth-americas::before {
+  content: "\f57d"; }
+
+.fa-earth::before {
+  content: "\f57d"; }
+
+.fa-earth-america::before {
+  content: "\f57d"; }
+
+.fa-globe-americas::before {
+  content: "\f57d"; }
+
+.fa-person-burst::before {
+  content: "\e53b"; }
+
+.fa-dove::before {
+  content: "\f4ba"; }
+
+.fa-battery-empty::before {
+  content: "\f244"; }
+
+.fa-battery-0::before {
+  content: "\f244"; }
+
+.fa-socks::before {
+  content: "\f696"; }
+
+.fa-inbox::before {
+  content: "\f01c"; }
+
+.fa-section::before {
+  content: "\e447"; }
+
+.fa-gauge-high::before {
+  content: "\f625"; }
+
+.fa-tachometer-alt::before {
+  content: "\f625"; }
+
+.fa-tachometer-alt-fast::before {
+  content: "\f625"; }
+
+.fa-envelope-open-text::before {
+  content: "\f658"; }
+
+.fa-hospital::before {
+  content: "\f0f8"; }
+
+.fa-hospital-alt::before {
+  content: "\f0f8"; }
+
+.fa-hospital-wide::before {
+  content: "\f0f8"; }
+
+.fa-wine-bottle::before {
+  content: "\f72f"; }
+
+.fa-chess-rook::before {
+  content: "\f447"; }
+
+.fa-bars-staggered::before {
+  content: "\f550"; }
+
+.fa-reorder::before {
+  content: "\f550"; }
+
+.fa-stream::before {
+  content: "\f550"; }
+
+.fa-dharmachakra::before {
+  content: "\f655"; }
+
+.fa-hotdog::before {
+  content: "\f80f"; }
+
+.fa-person-walking-with-cane::before {
+  content: "\f29d"; }
+
+.fa-blind::before {
+  content: "\f29d"; }
+
+.fa-drum::before {
+  content: "\f569"; }
+
+.fa-ice-cream::before {
+  content: "\f810"; }
+
+.fa-heart-circle-bolt::before {
+  content: "\e4fc"; }
+
+.fa-fax::before {
+  content: "\f1ac"; }
+
+.fa-paragraph::before {
+  content: "\f1dd"; }
+
+.fa-check-to-slot::before {
+  content: "\f772"; }
+
+.fa-vote-yea::before {
+  content: "\f772"; }
+
+.fa-star-half::before {
+  content: "\f089"; }
+
+.fa-boxes-stacked::before {
+  content: "\f468"; }
+
+.fa-boxes::before {
+  content: "\f468"; }
+
+.fa-boxes-alt::before {
+  content: "\f468"; }
+
+.fa-link::before {
+  content: "\f0c1"; }
+
+.fa-chain::before {
+  content: "\f0c1"; }
+
+.fa-ear-listen::before {
+  content: "\f2a2"; }
+
+.fa-assistive-listening-systems::before {
+  content: "\f2a2"; }
+
+.fa-tree-city::before {
+  content: "\e587"; }
+
+.fa-play::before {
+  content: "\f04b"; }
+
+.fa-font::before {
+  content: "\f031"; }
+
+.fa-rupiah-sign::before {
+  content: "\e23d"; }
+
+.fa-magnifying-glass::before {
+  content: "\f002"; }
+
+.fa-search::before {
+  content: "\f002"; }
+
+.fa-table-tennis-paddle-ball::before {
+  content: "\f45d"; }
+
+.fa-ping-pong-paddle-ball::before {
+  content: "\f45d"; }
+
+.fa-table-tennis::before {
+  content: "\f45d"; }
+
+.fa-person-dots-from-line::before {
+  content: "\f470"; }
+
+.fa-diagnoses::before {
+  content: "\f470"; }
+
+.fa-trash-can-arrow-up::before {
+  content: "\f82a"; }
+
+.fa-trash-restore-alt::before {
+  content: "\f82a"; }
+
+.fa-naira-sign::before {
+  content: "\e1f6"; }
+
+.fa-cart-arrow-down::before {
+  content: "\f218"; }
+
+.fa-walkie-talkie::before {
+  content: "\f8ef"; }
+
+.fa-file-pen::before {
+  content: "\f31c"; }
+
+.fa-file-edit::before {
+  content: "\f31c"; }
+
+.fa-receipt::before {
+  content: "\f543"; }
+
+.fa-square-pen::before {
+  content: "\f14b"; }
+
+.fa-pen-square::before {
+  content: "\f14b"; }
+
+.fa-pencil-square::before {
+  content: "\f14b"; }
+
+.fa-suitcase-rolling::before {
+  content: "\f5c1"; }
+
+.fa-person-circle-exclamation::before {
+  content: "\e53f"; }
+
+.fa-chevron-down::before {
+  content: "\f078"; }
+
+.fa-battery-full::before {
+  content: "\f240"; }
+
+.fa-battery::before {
+  content: "\f240"; }
+
+.fa-battery-5::before {
+  content: "\f240"; }
+
+.fa-skull-crossbones::before {
+  content: "\f714"; }
+
+.fa-code-compare::before {
+  content: "\e13a"; }
+
+.fa-list-ul::before {
+  content: "\f0ca"; }
+
+.fa-list-dots::before {
+  content: "\f0ca"; }
+
+.fa-school-lock::before {
+  content: "\e56f"; }
+
+.fa-tower-cell::before {
+  content: "\e585"; }
+
+.fa-down-long::before {
+  content: "\f309"; }
+
+.fa-long-arrow-alt-down::before {
+  content: "\f309"; }
+
+.fa-ranking-star::before {
+  content: "\e561"; }
+
+.fa-chess-king::before {
+  content: "\f43f"; }
+
+.fa-person-harassing::before {
+  content: "\e549"; }
+
+.fa-brazilian-real-sign::before {
+  content: "\e46c"; }
+
+.fa-landmark-dome::before {
+  content: "\f752"; }
+
+.fa-landmark-alt::before {
+  content: "\f752"; }
+
+.fa-arrow-up::before {
+  content: "\f062"; }
+
+.fa-tv::before {
+  content: "\f26c"; }
+
+.fa-television::before {
+  content: "\f26c"; }
+
+.fa-tv-alt::before {
+  content: "\f26c"; }
+
+.fa-shrimp::before {
+  content: "\e448"; }
+
+.fa-list-check::before {
+  content: "\f0ae"; }
+
+.fa-tasks::before {
+  content: "\f0ae"; }
+
+.fa-jug-detergent::before {
+  content: "\e519"; }
+
+.fa-circle-user::before {
+  content: "\f2bd"; }
+
+.fa-user-circle::before {
+  content: "\f2bd"; }
+
+.fa-user-shield::before {
+  content: "\f505"; }
+
+.fa-wind::before {
+  content: "\f72e"; }
+
+.fa-car-burst::before {
+  content: "\f5e1"; }
+
+.fa-car-crash::before {
+  content: "\f5e1"; }
+
+.fa-y::before {
+  content: "\59"; }
+
+.fa-person-snowboarding::before {
+  content: "\f7ce"; }
+
+.fa-snowboarding::before {
+  content: "\f7ce"; }
+
+.fa-truck-fast::before {
+  content: "\f48b"; }
+
+.fa-shipping-fast::before {
+  content: "\f48b"; }
+
+.fa-fish::before {
+  content: "\f578"; }
+
+.fa-user-graduate::before {
+  content: "\f501"; }
+
+.fa-circle-half-stroke::before {
+  content: "\f042"; }
+
+.fa-adjust::before {
+  content: "\f042"; }
+
+.fa-clapperboard::before {
+  content: "\e131"; }
+
+.fa-circle-radiation::before {
+  content: "\f7ba"; }
+
+.fa-radiation-alt::before {
+  content: "\f7ba"; }
+
+.fa-baseball::before {
+  content: "\f433"; }
+
+.fa-baseball-ball::before {
+  content: "\f433"; }
+
+.fa-jet-fighter-up::before {
+  content: "\e518"; }
+
+.fa-diagram-project::before {
+  content: "\f542"; }
+
+.fa-project-diagram::before {
+  content: "\f542"; }
+
+.fa-copy::before {
+  content: "\f0c5"; }
+
+.fa-volume-xmark::before {
+  content: "\f6a9"; }
+
+.fa-volume-mute::before {
+  content: "\f6a9"; }
+
+.fa-volume-times::before {
+  content: "\f6a9"; }
+
+.fa-hand-sparkles::before {
+  content: "\e05d"; }
+
+.fa-grip::before {
+  content: "\f58d"; }
+
+.fa-grip-horizontal::before {
+  content: "\f58d"; }
+
+.fa-share-from-square::before {
+  content: "\f14d"; }
+
+.fa-share-square::before {
+  content: "\f14d"; }
+
+.fa-child-combatant::before {
+  content: "\e4e0"; }
+
+.fa-child-rifle::before {
+  content: "\e4e0"; }
+
+.fa-gun::before {
+  content: "\e19b"; }
+
+.fa-square-phone::before {
+  content: "\f098"; }
+
+.fa-phone-square::before {
+  content: "\f098"; }
+
+.fa-plus::before {
+  content: "\2b"; }
+
+.fa-add::before {
+  content: "\2b"; }
+
+.fa-expand::before {
+  content: "\f065"; }
+
+.fa-computer::before {
+  content: "\e4e5"; }
+
+.fa-xmark::before {
+  content: "\f00d"; }
+
+.fa-close::before {
+  content: "\f00d"; }
+
+.fa-multiply::before {
+  content: "\f00d"; }
+
+.fa-remove::before {
+  content: "\f00d"; }
+
+.fa-times::before {
+  content: "\f00d"; }
+
+.fa-arrows-up-down-left-right::before {
+  content: "\f047"; }
+
+.fa-arrows::before {
+  content: "\f047"; }
+
+.fa-chalkboard-user::before {
+  content: "\f51c"; }
+
+.fa-chalkboard-teacher::before {
+  content: "\f51c"; }
+
+.fa-peso-sign::before {
+  content: "\e222"; }
+
+.fa-building-shield::before {
+  content: "\e4d8"; }
+
+.fa-baby::before {
+  content: "\f77c"; }
+
+.fa-users-line::before {
+  content: "\e592"; }
+
+.fa-quote-left::before {
+  content: "\f10d"; }
+
+.fa-quote-left-alt::before {
+  content: "\f10d"; }
+
+.fa-tractor::before {
+  content: "\f722"; }
+
+.fa-trash-arrow-up::before {
+  content: "\f829"; }
+
+.fa-trash-restore::before {
+  content: "\f829"; }
+
+.fa-arrow-down-up-lock::before {
+  content: "\e4b0"; }
+
+.fa-lines-leaning::before {
+  content: "\e51e"; }
+
+.fa-ruler-combined::before {
+  content: "\f546"; }
+
+.fa-copyright::before {
+  content: "\f1f9"; }
+
+.fa-equals::before {
+  content: "\3d"; }
+
+.fa-blender::before {
+  content: "\f517"; }
+
+.fa-teeth::before {
+  content: "\f62e"; }
+
+.fa-shekel-sign::before {
+  content: "\f20b"; }
+
+.fa-ils::before {
+  content: "\f20b"; }
+
+.fa-shekel::before {
+  content: "\f20b"; }
+
+.fa-sheqel::before {
+  content: "\f20b"; }
+
+.fa-sheqel-sign::before {
+  content: "\f20b"; }
+
+.fa-map::before {
+  content: "\f279"; }
+
+.fa-rocket::before {
+  content: "\f135"; }
+
+.fa-photo-film::before {
+  content: "\f87c"; }
+
+.fa-photo-video::before {
+  content: "\f87c"; }
+
+.fa-folder-minus::before {
+  content: "\f65d"; }
+
+.fa-store::before {
+  content: "\f54e"; }
+
+.fa-arrow-trend-up::before {
+  content: "\e098"; }
+
+.fa-plug-circle-minus::before {
+  content: "\e55e"; }
+
+.fa-sign-hanging::before {
+  content: "\f4d9"; }
+
+.fa-sign::before {
+  content: "\f4d9"; }
+
+.fa-bezier-curve::before {
+  content: "\f55b"; }
+
+.fa-bell-slash::before {
+  content: "\f1f6"; }
+
+.fa-tablet::before {
+  content: "\f3fb"; }
+
+.fa-tablet-android::before {
+  content: "\f3fb"; }
+
+.fa-school-flag::before {
+  content: "\e56e"; }
+
+.fa-fill::before {
+  content: "\f575"; }
+
+.fa-angle-up::before {
+  content: "\f106"; }
+
+.fa-drumstick-bite::before {
+  content: "\f6d7"; }
+
+.fa-holly-berry::before {
+  content: "\f7aa"; }
+
+.fa-chevron-left::before {
+  content: "\f053"; }
+
+.fa-bacteria::before {
+  content: "\e059"; }
+
+.fa-hand-lizard::before {
+  content: "\f258"; }
+
+.fa-notdef::before {
+  content: "\e1fe"; }
+
+.fa-disease::before {
+  content: "\f7fa"; }
+
+.fa-briefcase-medical::before {
+  content: "\f469"; }
+
+.fa-genderless::before {
+  content: "\f22d"; }
+
+.fa-chevron-right::before {
+  content: "\f054"; }
+
+.fa-retweet::before {
+  content: "\f079"; }
+
+.fa-car-rear::before {
+  content: "\f5de"; }
+
+.fa-car-alt::before {
+  content: "\f5de"; }
+
+.fa-pump-soap::before {
+  content: "\e06b"; }
+
+.fa-video-slash::before {
+  content: "\f4e2"; }
+
+.fa-battery-quarter::before {
+  content: "\f243"; }
+
+.fa-battery-2::before {
+  content: "\f243"; }
+
+.fa-radio::before {
+  content: "\f8d7"; }
+
+.fa-baby-carriage::before {
+  content: "\f77d"; }
+
+.fa-carriage-baby::before {
+  content: "\f77d"; }
+
+.fa-traffic-light::before {
+  content: "\f637"; }
+
+.fa-thermometer::before {
+  content: "\f491"; }
+
+.fa-vr-cardboard::before {
+  content: "\f729"; }
+
+.fa-hand-middle-finger::before {
+  content: "\f806"; }
+
+.fa-percent::before {
+  content: "\25"; }
+
+.fa-percentage::before {
+  content: "\25"; }
+
+.fa-truck-moving::before {
+  content: "\f4df"; }
+
+.fa-glass-water-droplet::before {
+  content: "\e4f5"; }
+
+.fa-display::before {
+  content: "\e163"; }
+
+.fa-face-smile::before {
+  content: "\f118"; }
+
+.fa-smile::before {
+  content: "\f118"; }
+
+.fa-thumbtack::before {
+  content: "\f08d"; }
+
+.fa-thumb-tack::before {
+  content: "\f08d"; }
+
+.fa-trophy::before {
+  content: "\f091"; }
+
+.fa-person-praying::before {
+  content: "\f683"; }
+
+.fa-pray::before {
+  content: "\f683"; }
+
+.fa-hammer::before {
+  content: "\f6e3"; }
+
+.fa-hand-peace::before {
+  content: "\f25b"; }
+
+.fa-rotate::before {
+  content: "\f2f1"; }
+
+.fa-sync-alt::before {
+  content: "\f2f1"; }
+
+.fa-spinner::before {
+  content: "\f110"; }
+
+.fa-robot::before {
+  content: "\f544"; }
+
+.fa-peace::before {
+  content: "\f67c"; }
+
+.fa-gears::before {
+  content: "\f085"; }
+
+.fa-cogs::before {
+  content: "\f085"; }
+
+.fa-warehouse::before {
+  content: "\f494"; }
+
+.fa-arrow-up-right-dots::before {
+  content: "\e4b7"; }
+
+.fa-splotch::before {
+  content: "\f5bc"; }
+
+.fa-face-grin-hearts::before {
+  content: "\f584"; }
+
+.fa-grin-hearts::before {
+  content: "\f584"; }
+
+.fa-dice-four::before {
+  content: "\f524"; }
+
+.fa-sim-card::before {
+  content: "\f7c4"; }
+
+.fa-transgender::before {
+  content: "\f225"; }
+
+.fa-transgender-alt::before {
+  content: "\f225"; }
+
+.fa-mercury::before {
+  content: "\f223"; }
+
+.fa-arrow-turn-down::before {
+  content: "\f149"; }
+
+.fa-level-down::before {
+  content: "\f149"; }
+
+.fa-person-falling-burst::before {
+  content: "\e547"; }
+
+.fa-award::before {
+  content: "\f559"; }
+
+.fa-ticket-simple::before {
+  content: "\f3ff"; }
+
+.fa-ticket-alt::before {
+  content: "\f3ff"; }
+
+.fa-building::before {
+  content: "\f1ad"; }
+
+.fa-angles-left::before {
+  content: "\f100"; }
+
+.fa-angle-double-left::before {
+  content: "\f100"; }
+
+.fa-qrcode::before {
+  content: "\f029"; }
+
+.fa-clock-rotate-left::before {
+  content: "\f1da"; }
+
+.fa-history::before {
+  content: "\f1da"; }
+
+.fa-face-grin-beam-sweat::before {
+  content: "\f583"; }
+
+.fa-grin-beam-sweat::before {
+  content: "\f583"; }
+
+.fa-file-export::before {
+  content: "\f56e"; }
+
+.fa-arrow-right-from-file::before {
+  content: "\f56e"; }
+
+.fa-shield::before {
+  content: "\f132"; }
+
+.fa-shield-blank::before {
+  content: "\f132"; }
+
+.fa-arrow-up-short-wide::before {
+  content: "\f885"; }
+
+.fa-sort-amount-up-alt::before {
+  content: "\f885"; }
+
+.fa-house-medical::before {
+  content: "\e3b2"; }
+
+.fa-golf-ball-tee::before {
+  content: "\f450"; }
+
+.fa-golf-ball::before {
+  content: "\f450"; }
+
+.fa-circle-chevron-left::before {
+  content: "\f137"; }
+
+.fa-chevron-circle-left::before {
+  content: "\f137"; }
+
+.fa-house-chimney-window::before {
+  content: "\e00d"; }
+
+.fa-pen-nib::before {
+  content: "\f5ad"; }
+
+.fa-tent-arrow-turn-left::before {
+  content: "\e580"; }
+
+.fa-tents::before {
+  content: "\e582"; }
+
+.fa-wand-magic::before {
+  content: "\f0d0"; }
+
+.fa-magic::before {
+  content: "\f0d0"; }
+
+.fa-dog::before {
+  content: "\f6d3"; }
+
+.fa-carrot::before {
+  content: "\f787"; }
+
+.fa-moon::before {
+  content: "\f186"; }
+
+.fa-wine-glass-empty::before {
+  content: "\f5ce"; }
+
+.fa-wine-glass-alt::before {
+  content: "\f5ce"; }
+
+.fa-cheese::before {
+  content: "\f7ef"; }
+
+.fa-yin-yang::before {
+  content: "\f6ad"; }
+
+.fa-music::before {
+  content: "\f001"; }
+
+.fa-code-commit::before {
+  content: "\f386"; }
+
+.fa-temperature-low::before {
+  content: "\f76b"; }
+
+.fa-person-biking::before {
+  content: "\f84a"; }
+
+.fa-biking::before {
+  content: "\f84a"; }
+
+.fa-broom::before {
+  content: "\f51a"; }
+
+.fa-shield-heart::before {
+  content: "\e574"; }
+
+.fa-gopuram::before {
+  content: "\f664"; }
+
+.fa-earth-oceania::before {
+  content: "\e47b"; }
+
+.fa-globe-oceania::before {
+  content: "\e47b"; }
+
+.fa-square-xmark::before {
+  content: "\f2d3"; }
+
+.fa-times-square::before {
+  content: "\f2d3"; }
+
+.fa-xmark-square::before {
+  content: "\f2d3"; }
+
+.fa-hashtag::before {
+  content: "\23"; }
+
+.fa-up-right-and-down-left-from-center::before {
+  content: "\f424"; }
+
+.fa-expand-alt::before {
+  content: "\f424"; }
+
+.fa-oil-can::before {
+  content: "\f613"; }
+
+.fa-t::before {
+  content: "\54"; }
+
+.fa-hippo::before {
+  content: "\f6ed"; }
+
+.fa-chart-column::before {
+  content: "\e0e3"; }
+
+.fa-infinity::before {
+  content: "\f534"; }
+
+.fa-vial-circle-check::before {
+  content: "\e596"; }
+
+.fa-person-arrow-down-to-line::before {
+  content: "\e538"; }
+
+.fa-voicemail::before {
+  content: "\f897"; }
+
+.fa-fan::before {
+  content: "\f863"; }
+
+.fa-person-walking-luggage::before {
+  content: "\e554"; }
+
+.fa-up-down::before {
+  content: "\f338"; }
+
+.fa-arrows-alt-v::before {
+  content: "\f338"; }
+
+.fa-cloud-moon-rain::before {
+  content: "\f73c"; }
+
+.fa-calendar::before {
+  content: "\f133"; }
+
+.fa-trailer::before {
+  content: "\e041"; }
+
+.fa-bahai::before {
+  content: "\f666"; }
+
+.fa-haykal::before {
+  content: "\f666"; }
+
+.fa-sd-card::before {
+  content: "\f7c2"; }
+
+.fa-dragon::before {
+  content: "\f6d5"; }
+
+.fa-shoe-prints::before {
+  content: "\f54b"; }
+
+.fa-circle-plus::before {
+  content: "\f055"; }
+
+.fa-plus-circle::before {
+  content: "\f055"; }
+
+.fa-face-grin-tongue-wink::before {
+  content: "\f58b"; }
+
+.fa-grin-tongue-wink::before {
+  content: "\f58b"; }
+
+.fa-hand-holding::before {
+  content: "\f4bd"; }
+
+.fa-plug-circle-exclamation::before {
+  content: "\e55d"; }
+
+.fa-link-slash::before {
+  content: "\f127"; }
+
+.fa-chain-broken::before {
+  content: "\f127"; }
+
+.fa-chain-slash::before {
+  content: "\f127"; }
+
+.fa-unlink::before {
+  content: "\f127"; }
+
+.fa-clone::before {
+  content: "\f24d"; }
+
+.fa-person-walking-arrow-loop-left::before {
+  content: "\e551"; }
+
+.fa-arrow-up-z-a::before {
+  content: "\f882"; }
+
+.fa-sort-alpha-up-alt::before {
+  content: "\f882"; }
+
+.fa-fire-flame-curved::before {
+  content: "\f7e4"; }
+
+.fa-fire-alt::before {
+  content: "\f7e4"; }
+
+.fa-tornado::before {
+  content: "\f76f"; }
+
+.fa-file-circle-plus::before {
+  content: "\e494"; }
+
+.fa-book-quran::before {
+  content: "\f687"; }
+
+.fa-quran::before {
+  content: "\f687"; }
+
+.fa-anchor::before {
+  content: "\f13d"; }
+
+.fa-border-all::before {
+  content: "\f84c"; }
+
+.fa-face-angry::before {
+  content: "\f556"; }
+
+.fa-angry::before {
+  content: "\f556"; }
+
+.fa-cookie-bite::before {
+  content: "\f564"; }
+
+.fa-arrow-trend-down::before {
+  content: "\e097"; }
+
+.fa-rss::before {
+  content: "\f09e"; }
+
+.fa-feed::before {
+  content: "\f09e"; }
+
+.fa-draw-polygon::before {
+  content: "\f5ee"; }
+
+.fa-scale-balanced::before {
+  content: "\f24e"; }
+
+.fa-balance-scale::before {
+  content: "\f24e"; }
+
+.fa-gauge-simple-high::before {
+  content: "\f62a"; }
+
+.fa-tachometer::before {
+  content: "\f62a"; }
+
+.fa-tachometer-fast::before {
+  content: "\f62a"; }
+
+.fa-shower::before {
+  content: "\f2cc"; }
+
+.fa-desktop::before {
+  content: "\f390"; }
+
+.fa-desktop-alt::before {
+  content: "\f390"; }
+
+.fa-m::before {
+  content: "\4d"; }
+
+.fa-table-list::before {
+  content: "\f00b"; }
+
+.fa-th-list::before {
+  content: "\f00b"; }
+
+.fa-comment-sms::before {
+  content: "\f7cd"; }
+
+.fa-sms::before {
+  content: "\f7cd"; }
+
+.fa-book::before {
+  content: "\f02d"; }
+
+.fa-user-plus::before {
+  content: "\f234"; }
+
+.fa-check::before {
+  content: "\f00c"; }
+
+.fa-battery-three-quarters::before {
+  content: "\f241"; }
+
+.fa-battery-4::before {
+  content: "\f241"; }
+
+.fa-house-circle-check::before {
+  content: "\e509"; }
+
+.fa-angle-left::before {
+  content: "\f104"; }
+
+.fa-diagram-successor::before {
+  content: "\e47a"; }
+
+.fa-truck-arrow-right::before {
+  content: "\e58b"; }
+
+.fa-arrows-split-up-and-left::before {
+  content: "\e4bc"; }
+
+.fa-hand-fist::before {
+  content: "\f6de"; }
+
+.fa-fist-raised::before {
+  content: "\f6de"; }
+
+.fa-cloud-moon::before {
+  content: "\f6c3"; }
+
+.fa-briefcase::before {
+  content: "\f0b1"; }
+
+.fa-person-falling::before {
+  content: "\e546"; }
+
+.fa-image-portrait::before {
+  content: "\f3e0"; }
+
+.fa-portrait::before {
+  content: "\f3e0"; }
+
+.fa-user-tag::before {
+  content: "\f507"; }
+
+.fa-rug::before {
+  content: "\e569"; }
+
+.fa-earth-europe::before {
+  content: "\f7a2"; }
+
+.fa-globe-europe::before {
+  content: "\f7a2"; }
+
+.fa-cart-flatbed-suitcase::before {
+  content: "\f59d"; }
+
+.fa-luggage-cart::before {
+  content: "\f59d"; }
+
+.fa-rectangle-xmark::before {
+  content: "\f410"; }
+
+.fa-rectangle-times::before {
+  content: "\f410"; }
+
+.fa-times-rectangle::before {
+  content: "\f410"; }
+
+.fa-window-close::before {
+  content: "\f410"; }
+
+.fa-baht-sign::before {
+  content: "\e0ac"; }
+
+.fa-book-open::before {
+  content: "\f518"; }
+
+.fa-book-journal-whills::before {
+  content: "\f66a"; }
+
+.fa-journal-whills::before {
+  content: "\f66a"; }
+
+.fa-handcuffs::before {
+  content: "\e4f8"; }
+
+.fa-triangle-exclamation::before {
+  content: "\f071"; }
+
+.fa-exclamation-triangle::before {
+  content: "\f071"; }
+
+.fa-warning::before {
+  content: "\f071"; }
+
+.fa-database::before {
+  content: "\f1c0"; }
+
+.fa-share::before {
+  content: "\f064"; }
+
+.fa-arrow-turn-right::before {
+  content: "\f064"; }
+
+.fa-mail-forward::before {
+  content: "\f064"; }
+
+.fa-bottle-droplet::before {
+  content: "\e4c4"; }
+
+.fa-mask-face::before {
+  content: "\e1d7"; }
+
+.fa-hill-rockslide::before {
+  content: "\e508"; }
+
+.fa-right-left::before {
+  content: "\f362"; }
+
+.fa-exchange-alt::before {
+  content: "\f362"; }
+
+.fa-paper-plane::before {
+  content: "\f1d8"; }
+
+.fa-road-circle-exclamation::before {
+  content: "\e565"; }
+
+.fa-dungeon::before {
+  content: "\f6d9"; }
+
+.fa-align-right::before {
+  content: "\f038"; }
+
+.fa-money-bill-1-wave::before {
+  content: "\f53b"; }
+
+.fa-money-bill-wave-alt::before {
+  content: "\f53b"; }
+
+.fa-life-ring::before {
+  content: "\f1cd"; }
+
+.fa-hands::before {
+  content: "\f2a7"; }
+
+.fa-sign-language::before {
+  content: "\f2a7"; }
+
+.fa-signing::before {
+  content: "\f2a7"; }
+
+.fa-calendar-day::before {
+  content: "\f783"; }
+
+.fa-water-ladder::before {
+  content: "\f5c5"; }
+
+.fa-ladder-water::before {
+  content: "\f5c5"; }
+
+.fa-swimming-pool::before {
+  content: "\f5c5"; }
+
+.fa-arrows-up-down::before {
+  content: "\f07d"; }
+
+.fa-arrows-v::before {
+  content: "\f07d"; }
+
+.fa-face-grimace::before {
+  content: "\f57f"; }
+
+.fa-grimace::before {
+  content: "\f57f"; }
+
+.fa-wheelchair-move::before {
+  content: "\e2ce"; }
+
+.fa-wheelchair-alt::before {
+  content: "\e2ce"; }
+
+.fa-turn-down::before {
+  content: "\f3be"; }
+
+.fa-level-down-alt::before {
+  content: "\f3be"; }
+
+.fa-person-walking-arrow-right::before {
+  content: "\e552"; }
+
+.fa-square-envelope::before {
+  content: "\f199"; }
+
+.fa-envelope-square::before {
+  content: "\f199"; }
+
+.fa-dice::before {
+  content: "\f522"; }
+
+.fa-bowling-ball::before {
+  content: "\f436"; }
+
+.fa-brain::before {
+  content: "\f5dc"; }
+
+.fa-bandage::before {
+  content: "\f462"; }
+
+.fa-band-aid::before {
+  content: "\f462"; }
+
+.fa-calendar-minus::before {
+  content: "\f272"; }
+
+.fa-circle-xmark::before {
+  content: "\f057"; }
+
+.fa-times-circle::before {
+  content: "\f057"; }
+
+.fa-xmark-circle::before {
+  content: "\f057"; }
+
+.fa-gifts::before {
+  content: "\f79c"; }
+
+.fa-hotel::before {
+  content: "\f594"; }
+
+.fa-earth-asia::before {
+  content: "\f57e"; }
+
+.fa-globe-asia::before {
+  content: "\f57e"; }
+
+.fa-id-card-clip::before {
+  content: "\f47f"; }
+
+.fa-id-card-alt::before {
+  content: "\f47f"; }
+
+.fa-magnifying-glass-plus::before {
+  content: "\f00e"; }
+
+.fa-search-plus::before {
+  content: "\f00e"; }
+
+.fa-thumbs-up::before {
+  content: "\f164"; }
+
+.fa-user-clock::before {
+  content: "\f4fd"; }
+
+.fa-hand-dots::before {
+  content: "\f461"; }
+
+.fa-allergies::before {
+  content: "\f461"; }
+
+.fa-file-invoice::before {
+  content: "\f570"; }
+
+.fa-window-minimize::before {
+  content: "\f2d1"; }
+
+.fa-mug-saucer::before {
+  content: "\f0f4"; }
+
+.fa-coffee::before {
+  content: "\f0f4"; }
+
+.fa-brush::before {
+  content: "\f55d"; }
+
+.fa-mask::before {
+  content: "\f6fa"; }
+
+.fa-magnifying-glass-minus::before {
+  content: "\f010"; }
+
+.fa-search-minus::before {
+  content: "\f010"; }
+
+.fa-ruler-vertical::before {
+  content: "\f548"; }
+
+.fa-user-large::before {
+  content: "\f406"; }
+
+.fa-user-alt::before {
+  content: "\f406"; }
+
+.fa-train-tram::before {
+  content: "\e5b4"; }
+
+.fa-user-nurse::before {
+  content: "\f82f"; }
+
+.fa-syringe::before {
+  content: "\f48e"; }
+
+.fa-cloud-sun::before {
+  content: "\f6c4"; }
+
+.fa-stopwatch-20::before {
+  content: "\e06f"; }
+
+.fa-square-full::before {
+  content: "\f45c"; }
+
+.fa-magnet::before {
+  content: "\f076"; }
+
+.fa-jar::before {
+  content: "\e516"; }
+
+.fa-note-sticky::before {
+  content: "\f249"; }
+
+.fa-sticky-note::before {
+  content: "\f249"; }
+
+.fa-bug-slash::before {
+  content: "\e490"; }
+
+.fa-arrow-up-from-water-pump::before {
+  content: "\e4b6"; }
+
+.fa-bone::before {
+  content: "\f5d7"; }
+
+.fa-user-injured::before {
+  content: "\f728"; }
+
+.fa-face-sad-tear::before {
+  content: "\f5b4"; }
+
+.fa-sad-tear::before {
+  content: "\f5b4"; }
+
+.fa-plane::before {
+  content: "\f072"; }
+
+.fa-tent-arrows-down::before {
+  content: "\e581"; }
+
+.fa-exclamation::before {
+  content: "\21"; }
+
+.fa-arrows-spin::before {
+  content: "\e4bb"; }
+
+.fa-print::before {
+  content: "\f02f"; }
+
+.fa-turkish-lira-sign::before {
+  content: "\e2bb"; }
+
+.fa-try::before {
+  content: "\e2bb"; }
+
+.fa-turkish-lira::before {
+  content: "\e2bb"; }
+
+.fa-dollar-sign::before {
+  content: "\24"; }
+
+.fa-dollar::before {
+  content: "\24"; }
+
+.fa-usd::before {
+  content: "\24"; }
+
+.fa-x::before {
+  content: "\58"; }
+
+.fa-magnifying-glass-dollar::before {
+  content: "\f688"; }
+
+.fa-search-dollar::before {
+  content: "\f688"; }
+
+.fa-users-gear::before {
+  content: "\f509"; }
+
+.fa-users-cog::before {
+  content: "\f509"; }
+
+.fa-person-military-pointing::before {
+  content: "\e54a"; }
+
+.fa-building-columns::before {
+  content: "\f19c"; }
+
+.fa-bank::before {
+  content: "\f19c"; }
+
+.fa-institution::before {
+  content: "\f19c"; }
+
+.fa-museum::before {
+  content: "\f19c"; }
+
+.fa-university::before {
+  content: "\f19c"; }
+
+.fa-umbrella::before {
+  content: "\f0e9"; }
+
+.fa-trowel::before {
+  content: "\e589"; }
+
+.fa-d::before {
+  content: "\44"; }
+
+.fa-stapler::before {
+  content: "\e5af"; }
+
+.fa-masks-theater::before {
+  content: "\f630"; }
+
+.fa-theater-masks::before {
+  content: "\f630"; }
+
+.fa-kip-sign::before {
+  content: "\e1c4"; }
+
+.fa-hand-point-left::before {
+  content: "\f0a5"; }
+
+.fa-handshake-simple::before {
+  content: "\f4c6"; }
+
+.fa-handshake-alt::before {
+  content: "\f4c6"; }
+
+.fa-jet-fighter::before {
+  content: "\f0fb"; }
+
+.fa-fighter-jet::before {
+  content: "\f0fb"; }
+
+.fa-square-share-nodes::before {
+  content: "\f1e1"; }
+
+.fa-share-alt-square::before {
+  content: "\f1e1"; }
+
+.fa-barcode::before {
+  content: "\f02a"; }
+
+.fa-plus-minus::before {
+  content: "\e43c"; }
+
+.fa-video::before {
+  content: "\f03d"; }
+
+.fa-video-camera::before {
+  content: "\f03d"; }
+
+.fa-graduation-cap::before {
+  content: "\f19d"; }
+
+.fa-mortar-board::before {
+  content: "\f19d"; }
+
+.fa-hand-holding-medical::before {
+  content: "\e05c"; }
+
+.fa-person-circle-check::before {
+  content: "\e53e"; }
+
+.fa-turn-up::before {
+  content: "\f3bf"; }
+
+.fa-level-up-alt::before {
+  content: "\f3bf"; }
+
+.sr-only,
+.fa-sr-only {
+  position: absolute;
+  width: 1px;
+  height: 1px;
+  padding: 0;
+  margin: -1px;
+  overflow: hidden;
+  clip: rect(0, 0, 0, 0);
+  white-space: nowrap;
+  border-width: 0; }
+
+.sr-only-focusable:not(:focus),
+.fa-sr-only-focusable:not(:focus) {
+  position: absolute;
+  width: 1px;
+  height: 1px;
+  padding: 0;
+  margin: -1px;
+  overflow: hidden;
+  clip: rect(0, 0, 0, 0);
+  white-space: nowrap;
+  border-width: 0; }
+:root, :host {
+  --fa-style-family-brands: 'Font Awesome 6 Brands';
+  --fa-font-brands: normal 400 1em/1 'Font Awesome 6 Brands'; }
+
+@font-face {
+  font-family: 'Font Awesome 6 Brands';
+  font-style: normal;
+  font-weight: 400;
+  font-display: block;
+  src: url("../webfonts/fa-brands-400.woff2") format("woff2"), url("../webfonts/fa-brands-400.ttf") format("truetype"); }
+
+.fab,
+.fa-brands {
+  font-weight: 400; }
+
+.fa-monero:before {
+  content: "\f3d0"; }
+
+.fa-hooli:before {
+  content: "\f427"; }
+
+.fa-yelp:before {
+  content: "\f1e9"; }
+
+.fa-cc-visa:before {
+  content: "\f1f0"; }
+
+.fa-lastfm:before {
+  content: "\f202"; }
+
+.fa-shopware:before {
+  content: "\f5b5"; }
+
+.fa-creative-commons-nc:before {
+  content: "\f4e8"; }
+
+.fa-aws:before {
+  content: "\f375"; }
+
+.fa-redhat:before {
+  content: "\f7bc"; }
+
+.fa-yoast:before {
+  content: "\f2b1"; }
+
+.fa-cloudflare:before {
+  content: "\e07d"; }
+
+.fa-ups:before {
+  content: "\f7e0"; }
+
+.fa-wpexplorer:before {
+  content: "\f2de"; }
+
+.fa-dyalog:before {
+  content: "\f399"; }
+
+.fa-bity:before {
+  content: "\f37a"; }
+
+.fa-stackpath:before {
+  content: "\f842"; }
+
+.fa-buysellads:before {
+  content: "\f20d"; }
+
+.fa-first-order:before {
+  content: "\f2b0"; }
+
+.fa-modx:before {
+  content: "\f285"; }
+
+.fa-guilded:before {
+  content: "\e07e"; }
+
+.fa-vnv:before {
+  content: "\f40b"; }
+
+.fa-square-js:before {
+  content: "\f3b9"; }
+
+.fa-js-square:before {
+  content: "\f3b9"; }
+
+.fa-microsoft:before {
+  content: "\f3ca"; }
+
+.fa-qq:before {
+  content: "\f1d6"; }
+
+.fa-orcid:before {
+  content: "\f8d2"; }
+
+.fa-java:before {
+  content: "\f4e4"; }
+
+.fa-invision:before {
+  content: "\f7b0"; }
+
+.fa-creative-commons-pd-alt:before {
+  content: "\f4ed"; }
+
+.fa-centercode:before {
+  content: "\f380"; }
+
+.fa-glide-g:before {
+  content: "\f2a6"; }
+
+.fa-drupal:before {
+  content: "\f1a9"; }
+
+.fa-hire-a-helper:before {
+  content: "\f3b0"; }
+
+.fa-creative-commons-by:before {
+  content: "\f4e7"; }
+
+.fa-unity:before {
+  content: "\e049"; }
+
+.fa-whmcs:before {
+  content: "\f40d"; }
+
+.fa-rocketchat:before {
+  content: "\f3e8"; }
+
+.fa-vk:before {
+  content: "\f189"; }
+
+.fa-untappd:before {
+  content: "\f405"; }
+
+.fa-mailchimp:before {
+  content: "\f59e"; }
+
+.fa-css3-alt:before {
+  content: "\f38b"; }
+
+.fa-square-reddit:before {
+  content: "\f1a2"; }
+
+.fa-reddit-square:before {
+  content: "\f1a2"; }
+
+.fa-vimeo-v:before {
+  content: "\f27d"; }
+
+.fa-contao:before {
+  content: "\f26d"; }
+
+.fa-square-font-awesome:before {
+  content: "\e5ad"; }
+
+.fa-deskpro:before {
+  content: "\f38f"; }
+
+.fa-sistrix:before {
+  content: "\f3ee"; }
+
+.fa-square-instagram:before {
+  content: "\e055"; }
+
+.fa-instagram-square:before {
+  content: "\e055"; }
+
+.fa-battle-net:before {
+  content: "\f835"; }
+
+.fa-the-red-yeti:before {
+  content: "\f69d"; }
+
+.fa-square-hacker-news:before {
+  content: "\f3af"; }
+
+.fa-hacker-news-square:before {
+  content: "\f3af"; }
+
+.fa-edge:before {
+  content: "\f282"; }
+
+.fa-threads:before {
+  content: "\e618"; }
+
+.fa-napster:before {
+  content: "\f3d2"; }
+
+.fa-square-snapchat:before {
+  content: "\f2ad"; }
+
+.fa-snapchat-square:before {
+  content: "\f2ad"; }
+
+.fa-google-plus-g:before {
+  content: "\f0d5"; }
+
+.fa-artstation:before {
+  content: "\f77a"; }
+
+.fa-markdown:before {
+  content: "\f60f"; }
+
+.fa-sourcetree:before {
+  content: "\f7d3"; }
+
+.fa-google-plus:before {
+  content: "\f2b3"; }
+
+.fa-diaspora:before {
+  content: "\f791"; }
+
+.fa-foursquare:before {
+  content: "\f180"; }
+
+.fa-stack-overflow:before {
+  content: "\f16c"; }
+
+.fa-github-alt:before {
+  content: "\f113"; }
+
+.fa-phoenix-squadron:before {
+  content: "\f511"; }
+
+.fa-pagelines:before {
+  content: "\f18c"; }
+
+.fa-algolia:before {
+  content: "\f36c"; }
+
+.fa-red-river:before {
+  content: "\f3e3"; }
+
+.fa-creative-commons-sa:before {
+  content: "\f4ef"; }
+
+.fa-safari:before {
+  content: "\f267"; }
+
+.fa-google:before {
+  content: "\f1a0"; }
+
+.fa-square-font-awesome-stroke:before {
+  content: "\f35c"; }
+
+.fa-font-awesome-alt:before {
+  content: "\f35c"; }
+
+.fa-atlassian:before {
+  content: "\f77b"; }
+
+.fa-linkedin-in:before {
+  content: "\f0e1"; }
+
+.fa-digital-ocean:before {
+  content: "\f391"; }
+
+.fa-nimblr:before {
+  content: "\f5a8"; }
+
+.fa-chromecast:before {
+  content: "\f838"; }
+
+.fa-evernote:before {
+  content: "\f839"; }
+
+.fa-hacker-news:before {
+  content: "\f1d4"; }
+
+.fa-creative-commons-sampling:before {
+  content: "\f4f0"; }
+
+.fa-adversal:before {
+  content: "\f36a"; }
+
+.fa-creative-commons:before {
+  content: "\f25e"; }
+
+.fa-watchman-monitoring:before {
+  content: "\e087"; }
+
+.fa-fonticons:before {
+  content: "\f280"; }
+
+.fa-weixin:before {
+  content: "\f1d7"; }
+
+.fa-shirtsinbulk:before {
+  content: "\f214"; }
+
+.fa-codepen:before {
+  content: "\f1cb"; }
+
+.fa-git-alt:before {
+  content: "\f841"; }
+
+.fa-lyft:before {
+  content: "\f3c3"; }
+
+.fa-rev:before {
+  content: "\f5b2"; }
+
+.fa-windows:before {
+  content: "\f17a"; }
+
+.fa-wizards-of-the-coast:before {
+  content: "\f730"; }
+
+.fa-square-viadeo:before {
+  content: "\f2aa"; }
+
+.fa-viadeo-square:before {
+  content: "\f2aa"; }
+
+.fa-meetup:before {
+  content: "\f2e0"; }
+
+.fa-centos:before {
+  content: "\f789"; }
+
+.fa-adn:before {
+  content: "\f170"; }
+
+.fa-cloudsmith:before {
+  content: "\f384"; }
+
+.fa-pied-piper-alt:before {
+  content: "\f1a8"; }
+
+.fa-square-dribbble:before {
+  content: "\f397"; }
+
+.fa-dribbble-square:before {
+  content: "\f397"; }
+
+.fa-codiepie:before {
+  content: "\f284"; }
+
+.fa-node:before {
+  content: "\f419"; }
+
+.fa-mix:before {
+  content: "\f3cb"; }
+
+.fa-steam:before {
+  content: "\f1b6"; }
+
+.fa-cc-apple-pay:before {
+  content: "\f416"; }
+
+.fa-scribd:before {
+  content: "\f28a"; }
+
+.fa-debian:before {
+  content: "\e60b"; }
+
+.fa-openid:before {
+  content: "\f19b"; }
+
+.fa-instalod:before {
+  content: "\e081"; }
+
+.fa-expeditedssl:before {
+  content: "\f23e"; }
+
+.fa-sellcast:before {
+  content: "\f2da"; }
+
+.fa-square-twitter:before {
+  content: "\f081"; }
+
+.fa-twitter-square:before {
+  content: "\f081"; }
+
+.fa-r-project:before {
+  content: "\f4f7"; }
+
+.fa-delicious:before {
+  content: "\f1a5"; }
+
+.fa-freebsd:before {
+  content: "\f3a4"; }
+
+.fa-vuejs:before {
+  content: "\f41f"; }
+
+.fa-accusoft:before {
+  content: "\f369"; }
+
+.fa-ioxhost:before {
+  content: "\f208"; }
+
+.fa-fonticons-fi:before {
+  content: "\f3a2"; }
+
+.fa-app-store:before {
+  content: "\f36f"; }
+
+.fa-cc-mastercard:before {
+  content: "\f1f1"; }
+
+.fa-itunes-note:before {
+  content: "\f3b5"; }
+
+.fa-golang:before {
+  content: "\e40f"; }
+
+.fa-kickstarter:before {
+  content: "\f3bb"; }
+
+.fa-grav:before {
+  content: "\f2d6"; }
+
+.fa-weibo:before {
+  content: "\f18a"; }
+
+.fa-uncharted:before {
+  content: "\e084"; }
+
+.fa-firstdraft:before {
+  content: "\f3a1"; }
+
+.fa-square-youtube:before {
+  content: "\f431"; }
+
+.fa-youtube-square:before {
+  content: "\f431"; }
+
+.fa-wikipedia-w:before {
+  content: "\f266"; }
+
+.fa-wpressr:before {
+  content: "\f3e4"; }
+
+.fa-rendact:before {
+  content: "\f3e4"; }
+
+.fa-angellist:before {
+  content: "\f209"; }
+
+.fa-galactic-republic:before {
+  content: "\f50c"; }
+
+.fa-nfc-directional:before {
+  content: "\e530"; }
+
+.fa-skype:before {
+  content: "\f17e"; }
+
+.fa-joget:before {
+  content: "\f3b7"; }
+
+.fa-fedora:before {
+  content: "\f798"; }
+
+.fa-stripe-s:before {
+  content: "\f42a"; }
+
+.fa-meta:before {
+  content: "\e49b"; }
+
+.fa-laravel:before {
+  content: "\f3bd"; }
+
+.fa-hotjar:before {
+  content: "\f3b1"; }
+
+.fa-bluetooth-b:before {
+  content: "\f294"; }
+
+.fa-sticker-mule:before {
+  content: "\f3f7"; }
+
+.fa-creative-commons-zero:before {
+  content: "\f4f3"; }
+
+.fa-hips:before {
+  content: "\f452"; }
+
+.fa-behance:before {
+  content: "\f1b4"; }
+
+.fa-reddit:before {
+  content: "\f1a1"; }
+
+.fa-discord:before {
+  content: "\f392"; }
+
+.fa-chrome:before {
+  content: "\f268"; }
+
+.fa-app-store-ios:before {
+  content: "\f370"; }
+
+.fa-cc-discover:before {
+  content: "\f1f2"; }
+
+.fa-wpbeginner:before {
+  content: "\f297"; }
+
+.fa-confluence:before {
+  content: "\f78d"; }
+
+.fa-mdb:before {
+  content: "\f8ca"; }
+
+.fa-dochub:before {
+  content: "\f394"; }
+
+.fa-accessible-icon:before {
+  content: "\f368"; }
+
+.fa-ebay:before {
+  content: "\f4f4"; }
+
+.fa-amazon:before {
+  content: "\f270"; }
+
+.fa-unsplash:before {
+  content: "\e07c"; }
+
+.fa-yarn:before {
+  content: "\f7e3"; }
+
+.fa-square-steam:before {
+  content: "\f1b7"; }
+
+.fa-steam-square:before {
+  content: "\f1b7"; }
+
+.fa-500px:before {
+  content: "\f26e"; }
+
+.fa-square-vimeo:before {
+  content: "\f194"; }
+
+.fa-vimeo-square:before {
+  content: "\f194"; }
+
+.fa-asymmetrik:before {
+  content: "\f372"; }
+
+.fa-font-awesome:before {
+  content: "\f2b4"; }
+
+.fa-font-awesome-flag:before {
+  content: "\f2b4"; }
+
+.fa-font-awesome-logo-full:before {
+  content: "\f2b4"; }
+
+.fa-gratipay:before {
+  content: "\f184"; }
+
+.fa-apple:before {
+  content: "\f179"; }
+
+.fa-hive:before {
+  content: "\e07f"; }
+
+.fa-gitkraken:before {
+  content: "\f3a6"; }
+
+.fa-keybase:before {
+  content: "\f4f5"; }
+
+.fa-apple-pay:before {
+  content: "\f415"; }
+
+.fa-padlet:before {
+  content: "\e4a0"; }
+
+.fa-amazon-pay:before {
+  content: "\f42c"; }
+
+.fa-square-github:before {
+  content: "\f092"; }
+
+.fa-github-square:before {
+  content: "\f092"; }
+
+.fa-stumbleupon:before {
+  content: "\f1a4"; }
+
+.fa-fedex:before {
+  content: "\f797"; }
+
+.fa-phoenix-framework:before {
+  content: "\f3dc"; }
+
+.fa-shopify:before {
+  content: "\e057"; }
+
+.fa-neos:before {
+  content: "\f612"; }
+
+.fa-square-threads:before {
+  content: "\e619"; }
+
+.fa-hackerrank:before {
+  content: "\f5f7"; }
+
+.fa-researchgate:before {
+  content: "\f4f8"; }
+
+.fa-swift:before {
+  content: "\f8e1"; }
+
+.fa-angular:before {
+  content: "\f420"; }
+
+.fa-speakap:before {
+  content: "\f3f3"; }
+
+.fa-angrycreative:before {
+  content: "\f36e"; }
+
+.fa-y-combinator:before {
+  content: "\f23b"; }
+
+.fa-empire:before {
+  content: "\f1d1"; }
+
+.fa-envira:before {
+  content: "\f299"; }
+
+.fa-square-gitlab:before {
+  content: "\e5ae"; }
+
+.fa-gitlab-square:before {
+  content: "\e5ae"; }
+
+.fa-studiovinari:before {
+  content: "\f3f8"; }
+
+.fa-pied-piper:before {
+  content: "\f2ae"; }
+
+.fa-wordpress:before {
+  content: "\f19a"; }
+
+.fa-product-hunt:before {
+  content: "\f288"; }
+
+.fa-firefox:before {
+  content: "\f269"; }
+
+.fa-linode:before {
+  content: "\f2b8"; }
+
+.fa-goodreads:before {
+  content: "\f3a8"; }
+
+.fa-square-odnoklassniki:before {
+  content: "\f264"; }
+
+.fa-odnoklassniki-square:before {
+  content: "\f264"; }
+
+.fa-jsfiddle:before {
+  content: "\f1cc"; }
+
+.fa-sith:before {
+  content: "\f512"; }
+
+.fa-themeisle:before {
+  content: "\f2b2"; }
+
+.fa-page4:before {
+  content: "\f3d7"; }
+
+.fa-hashnode:before {
+  content: "\e499"; }
+
+.fa-react:before {
+  content: "\f41b"; }
+
+.fa-cc-paypal:before {
+  content: "\f1f4"; }
+
+.fa-squarespace:before {
+  content: "\f5be"; }
+
+.fa-cc-stripe:before {
+  content: "\f1f5"; }
+
+.fa-creative-commons-share:before {
+  content: "\f4f2"; }
+
+.fa-bitcoin:before {
+  content: "\f379"; }
+
+.fa-keycdn:before {
+  content: "\f3ba"; }
+
+.fa-opera:before {
+  content: "\f26a"; }
+
+.fa-itch-io:before {
+  content: "\f83a"; }
+
+.fa-umbraco:before {
+  content: "\f8e8"; }
+
+.fa-galactic-senate:before {
+  content: "\f50d"; }
+
+.fa-ubuntu:before {
+  content: "\f7df"; }
+
+.fa-draft2digital:before {
+  content: "\f396"; }
+
+.fa-stripe:before {
+  content: "\f429"; }
+
+.fa-houzz:before {
+  content: "\f27c"; }
+
+.fa-gg:before {
+  content: "\f260"; }
+
+.fa-dhl:before {
+  content: "\f790"; }
+
+.fa-square-pinterest:before {
+  content: "\f0d3"; }
+
+.fa-pinterest-square:before {
+  content: "\f0d3"; }
+
+.fa-xing:before {
+  content: "\f168"; }
+
+.fa-blackberry:before {
+  content: "\f37b"; }
+
+.fa-creative-commons-pd:before {
+  content: "\f4ec"; }
+
+.fa-playstation:before {
+  content: "\f3df"; }
+
+.fa-quinscape:before {
+  content: "\f459"; }
+
+.fa-less:before {
+  content: "\f41d"; }
+
+.fa-blogger-b:before {
+  content: "\f37d"; }
+
+.fa-opencart:before {
+  content: "\f23d"; }
+
+.fa-vine:before {
+  content: "\f1ca"; }
+
+.fa-paypal:before {
+  content: "\f1ed"; }
+
+.fa-gitlab:before {
+  content: "\f296"; }
+
+.fa-typo3:before {
+  content: "\f42b"; }
+
+.fa-reddit-alien:before {
+  content: "\f281"; }
+
+.fa-yahoo:before {
+  content: "\f19e"; }
+
+.fa-dailymotion:before {
+  content: "\e052"; }
+
+.fa-affiliatetheme:before {
+  content: "\f36b"; }
+
+.fa-pied-piper-pp:before {
+  content: "\f1a7"; }
+
+.fa-bootstrap:before {
+  content: "\f836"; }
+
+.fa-odnoklassniki:before {
+  content: "\f263"; }
+
+.fa-nfc-symbol:before {
+  content: "\e531"; }
+
+.fa-ethereum:before {
+  content: "\f42e"; }
+
+.fa-speaker-deck:before {
+  content: "\f83c"; }
+
+.fa-creative-commons-nc-eu:before {
+  content: "\f4e9"; }
+
+.fa-patreon:before {
+  content: "\f3d9"; }
+
+.fa-avianex:before {
+  content: "\f374"; }
+
+.fa-ello:before {
+  content: "\f5f1"; }
+
+.fa-gofore:before {
+  content: "\f3a7"; }
+
+.fa-bimobject:before {
+  content: "\f378"; }
+
+.fa-facebook-f:before {
+  content: "\f39e"; }
+
+.fa-square-google-plus:before {
+  content: "\f0d4"; }
+
+.fa-google-plus-square:before {
+  content: "\f0d4"; }
+
+.fa-mandalorian:before {
+  content: "\f50f"; }
+
+.fa-first-order-alt:before {
+  content: "\f50a"; }
+
+.fa-osi:before {
+  content: "\f41a"; }
+
+.fa-google-wallet:before {
+  content: "\f1ee"; }
+
+.fa-d-and-d-beyond:before {
+  content: "\f6ca"; }
+
+.fa-periscope:before {
+  content: "\f3da"; }
+
+.fa-fulcrum:before {
+  content: "\f50b"; }
+
+.fa-cloudscale:before {
+  content: "\f383"; }
+
+.fa-forumbee:before {
+  content: "\f211"; }
+
+.fa-mizuni:before {
+  content: "\f3cc"; }
+
+.fa-schlix:before {
+  content: "\f3ea"; }
+
+.fa-square-xing:before {
+  content: "\f169"; }
+
+.fa-xing-square:before {
+  content: "\f169"; }
+
+.fa-bandcamp:before {
+  content: "\f2d5"; }
+
+.fa-wpforms:before {
+  content: "\f298"; }
+
+.fa-cloudversify:before {
+  content: "\f385"; }
+
+.fa-usps:before {
+  content: "\f7e1"; }
+
+.fa-megaport:before {
+  content: "\f5a3"; }
+
+.fa-magento:before {
+  content: "\f3c4"; }
+
+.fa-spotify:before {
+  content: "\f1bc"; }
+
+.fa-optin-monster:before {
+  content: "\f23c"; }
+
+.fa-fly:before {
+  content: "\f417"; }
+
+.fa-aviato:before {
+  content: "\f421"; }
+
+.fa-itunes:before {
+  content: "\f3b4"; }
+
+.fa-cuttlefish:before {
+  content: "\f38c"; }
+
+.fa-blogger:before {
+  content: "\f37c"; }
+
+.fa-flickr:before {
+  content: "\f16e"; }
+
+.fa-viber:before {
+  content: "\f409"; }
+
+.fa-soundcloud:before {
+  content: "\f1be"; }
+
+.fa-digg:before {
+  content: "\f1a6"; }
+
+.fa-tencent-weibo:before {
+  content: "\f1d5"; }
+
+.fa-symfony:before {
+  content: "\f83d"; }
+
+.fa-maxcdn:before {
+  content: "\f136"; }
+
+.fa-etsy:before {
+  content: "\f2d7"; }
+
+.fa-facebook-messenger:before {
+  content: "\f39f"; }
+
+.fa-audible:before {
+  content: "\f373"; }
+
+.fa-think-peaks:before {
+  content: "\f731"; }
+
+.fa-bilibili:before {
+  content: "\e3d9"; }
+
+.fa-erlang:before {
+  content: "\f39d"; }
+
+.fa-x-twitter:before {
+  content: "\e61b"; }
+
+.fa-cotton-bureau:before {
+  content: "\f89e"; }
+
+.fa-dashcube:before {
+  content: "\f210"; }
+
+.fa-42-group:before {
+  content: "\e080"; }
+
+.fa-innosoft:before {
+  content: "\e080"; }
+
+.fa-stack-exchange:before {
+  content: "\f18d"; }
+
+.fa-elementor:before {
+  content: "\f430"; }
+
+.fa-square-pied-piper:before {
+  content: "\e01e"; }
+
+.fa-pied-piper-square:before {
+  content: "\e01e"; }
+
+.fa-creative-commons-nd:before {
+  content: "\f4eb"; }
+
+.fa-palfed:before {
+  content: "\f3d8"; }
+
+.fa-superpowers:before {
+  content: "\f2dd"; }
+
+.fa-resolving:before {
+  content: "\f3e7"; }
+
+.fa-xbox:before {
+  content: "\f412"; }
+
+.fa-searchengin:before {
+  content: "\f3eb"; }
+
+.fa-tiktok:before {
+  content: "\e07b"; }
+
+.fa-square-facebook:before {
+  content: "\f082"; }
+
+.fa-facebook-square:before {
+  content: "\f082"; }
+
+.fa-renren:before {
+  content: "\f18b"; }
+
+.fa-linux:before {
+  content: "\f17c"; }
+
+.fa-glide:before {
+  content: "\f2a5"; }
+
+.fa-linkedin:before {
+  content: "\f08c"; }
+
+.fa-hubspot:before {
+  content: "\f3b2"; }
+
+.fa-deploydog:before {
+  content: "\f38e"; }
+
+.fa-twitch:before {
+  content: "\f1e8"; }
+
+.fa-ravelry:before {
+  content: "\f2d9"; }
+
+.fa-mixer:before {
+  content: "\e056"; }
+
+.fa-square-lastfm:before {
+  content: "\f203"; }
+
+.fa-lastfm-square:before {
+  content: "\f203"; }
+
+.fa-vimeo:before {
+  content: "\f40a"; }
+
+.fa-mendeley:before {
+  content: "\f7b3"; }
+
+.fa-uniregistry:before {
+  content: "\f404"; }
+
+.fa-figma:before {
+  content: "\f799"; }
+
+.fa-creative-commons-remix:before {
+  content: "\f4ee"; }
+
+.fa-cc-amazon-pay:before {
+  content: "\f42d"; }
+
+.fa-dropbox:before {
+  content: "\f16b"; }
+
+.fa-instagram:before {
+  content: "\f16d"; }
+
+.fa-cmplid:before {
+  content: "\e360"; }
+
+.fa-facebook:before {
+  content: "\f09a"; }
+
+.fa-gripfire:before {
+  content: "\f3ac"; }
+
+.fa-jedi-order:before {
+  content: "\f50e"; }
+
+.fa-uikit:before {
+  content: "\f403"; }
+
+.fa-fort-awesome-alt:before {
+  content: "\f3a3"; }
+
+.fa-phabricator:before {
+  content: "\f3db"; }
+
+.fa-ussunnah:before {
+  content: "\f407"; }
+
+.fa-earlybirds:before {
+  content: "\f39a"; }
+
+.fa-trade-federation:before {
+  content: "\f513"; }
+
+.fa-autoprefixer:before {
+  content: "\f41c"; }
+
+.fa-whatsapp:before {
+  content: "\f232"; }
+
+.fa-slideshare:before {
+  content: "\f1e7"; }
+
+.fa-google-play:before {
+  content: "\f3ab"; }
+
+.fa-viadeo:before {
+  content: "\f2a9"; }
+
+.fa-line:before {
+  content: "\f3c0"; }
+
+.fa-google-drive:before {
+  content: "\f3aa"; }
+
+.fa-servicestack:before {
+  content: "\f3ec"; }
+
+.fa-simplybuilt:before {
+  content: "\f215"; }
+
+.fa-bitbucket:before {
+  content: "\f171"; }
+
+.fa-imdb:before {
+  content: "\f2d8"; }
+
+.fa-deezer:before {
+  content: "\e077"; }
+
+.fa-raspberry-pi:before {
+  content: "\f7bb"; }
+
+.fa-jira:before {
+  content: "\f7b1"; }
+
+.fa-docker:before {
+  content: "\f395"; }
+
+.fa-screenpal:before {
+  content: "\e570"; }
+
+.fa-bluetooth:before {
+  content: "\f293"; }
+
+.fa-gitter:before {
+  content: "\f426"; }
+
+.fa-d-and-d:before {
+  content: "\f38d"; }
+
+.fa-microblog:before {
+  content: "\e01a"; }
+
+.fa-cc-diners-club:before {
+  content: "\f24c"; }
+
+.fa-gg-circle:before {
+  content: "\f261"; }
+
+.fa-pied-piper-hat:before {
+  content: "\f4e5"; }
+
+.fa-kickstarter-k:before {
+  content: "\f3bc"; }
+
+.fa-yandex:before {
+  content: "\f413"; }
+
+.fa-readme:before {
+  content: "\f4d5"; }
+
+.fa-html5:before {
+  content: "\f13b"; }
+
+.fa-sellsy:before {
+  content: "\f213"; }
+
+.fa-sass:before {
+  content: "\f41e"; }
+
+.fa-wirsindhandwerk:before {
+  content: "\e2d0"; }
+
+.fa-wsh:before {
+  content: "\e2d0"; }
+
+.fa-buromobelexperte:before {
+  content: "\f37f"; }
+
+.fa-salesforce:before {
+  content: "\f83b"; }
+
+.fa-octopus-deploy:before {
+  content: "\e082"; }
+
+.fa-medapps:before {
+  content: "\f3c6"; }
+
+.fa-ns8:before {
+  content: "\f3d5"; }
+
+.fa-pinterest-p:before {
+  content: "\f231"; }
+
+.fa-apper:before {
+  content: "\f371"; }
+
+.fa-fort-awesome:before {
+  content: "\f286"; }
+
+.fa-waze:before {
+  content: "\f83f"; }
+
+.fa-cc-jcb:before {
+  content: "\f24b"; }
+
+.fa-snapchat:before {
+  content: "\f2ab"; }
+
+.fa-snapchat-ghost:before {
+  content: "\f2ab"; }
+
+.fa-fantasy-flight-games:before {
+  content: "\f6dc"; }
+
+.fa-rust:before {
+  content: "\e07a"; }
+
+.fa-wix:before {
+  content: "\f5cf"; }
+
+.fa-square-behance:before {
+  content: "\f1b5"; }
+
+.fa-behance-square:before {
+  content: "\f1b5"; }
+
+.fa-supple:before {
+  content: "\f3f9"; }
+
+.fa-rebel:before {
+  content: "\f1d0"; }
+
+.fa-css3:before {
+  content: "\f13c"; }
+
+.fa-staylinked:before {
+  content: "\f3f5"; }
+
+.fa-kaggle:before {
+  content: "\f5fa"; }
+
+.fa-space-awesome:before {
+  content: "\e5ac"; }
+
+.fa-deviantart:before {
+  content: "\f1bd"; }
+
+.fa-cpanel:before {
+  content: "\f388"; }
+
+.fa-goodreads-g:before {
+  content: "\f3a9"; }
+
+.fa-square-git:before {
+  content: "\f1d2"; }
+
+.fa-git-square:before {
+  content: "\f1d2"; }
+
+.fa-square-tumblr:before {
+  content: "\f174"; }
+
+.fa-tumblr-square:before {
+  content: "\f174"; }
+
+.fa-trello:before {
+  content: "\f181"; }
+
+.fa-creative-commons-nc-jp:before {
+  content: "\f4ea"; }
+
+.fa-get-pocket:before {
+  content: "\f265"; }
+
+.fa-perbyte:before {
+  content: "\e083"; }
+
+.fa-grunt:before {
+  content: "\f3ad"; }
+
+.fa-weebly:before {
+  content: "\f5cc"; }
+
+.fa-connectdevelop:before {
+  content: "\f20e"; }
+
+.fa-leanpub:before {
+  content: "\f212"; }
+
+.fa-black-tie:before {
+  content: "\f27e"; }
+
+.fa-themeco:before {
+  content: "\f5c6"; }
+
+.fa-python:before {
+  content: "\f3e2"; }
+
+.fa-android:before {
+  content: "\f17b"; }
+
+.fa-bots:before {
+  content: "\e340"; }
+
+.fa-free-code-camp:before {
+  content: "\f2c5"; }
+
+.fa-hornbill:before {
+  content: "\f592"; }
+
+.fa-js:before {
+  content: "\f3b8"; }
+
+.fa-ideal:before {
+  content: "\e013"; }
+
+.fa-git:before {
+  content: "\f1d3"; }
+
+.fa-dev:before {
+  content: "\f6cc"; }
+
+.fa-sketch:before {
+  content: "\f7c6"; }
+
+.fa-yandex-international:before {
+  content: "\f414"; }
+
+.fa-cc-amex:before {
+  content: "\f1f3"; }
+
+.fa-uber:before {
+  content: "\f402"; }
+
+.fa-github:before {
+  content: "\f09b"; }
+
+.fa-php:before {
+  content: "\f457"; }
+
+.fa-alipay:before {
+  content: "\f642"; }
+
+.fa-youtube:before {
+  content: "\f167"; }
+
+.fa-skyatlas:before {
+  content: "\f216"; }
+
+.fa-firefox-browser:before {
+  content: "\e007"; }
+
+.fa-replyd:before {
+  content: "\f3e6"; }
+
+.fa-suse:before {
+  content: "\f7d6"; }
+
+.fa-jenkins:before {
+  content: "\f3b6"; }
+
+.fa-twitter:before {
+  content: "\f099"; }
+
+.fa-rockrms:before {
+  content: "\f3e9"; }
+
+.fa-pinterest:before {
+  content: "\f0d2"; }
+
+.fa-buffer:before {
+  content: "\f837"; }
+
+.fa-npm:before {
+  content: "\f3d4"; }
+
+.fa-yammer:before {
+  content: "\f840"; }
+
+.fa-btc:before {
+  content: "\f15a"; }
+
+.fa-dribbble:before {
+  content: "\f17d"; }
+
+.fa-stumbleupon-circle:before {
+  content: "\f1a3"; }
+
+.fa-internet-explorer:before {
+  content: "\f26b"; }
+
+.fa-stubber:before {
+  content: "\e5c7"; }
+
+.fa-telegram:before {
+  content: "\f2c6"; }
+
+.fa-telegram-plane:before {
+  content: "\f2c6"; }
+
+.fa-old-republic:before {
+  content: "\f510"; }
+
+.fa-odysee:before {
+  content: "\e5c6"; }
+
+.fa-square-whatsapp:before {
+  content: "\f40c"; }
+
+.fa-whatsapp-square:before {
+  content: "\f40c"; }
+
+.fa-node-js:before {
+  content: "\f3d3"; }
+
+.fa-edge-legacy:before {
+  content: "\e078"; }
+
+.fa-slack:before {
+  content: "\f198"; }
+
+.fa-slack-hash:before {
+  content: "\f198"; }
+
+.fa-medrt:before {
+  content: "\f3c8"; }
+
+.fa-usb:before {
+  content: "\f287"; }
+
+.fa-tumblr:before {
+  content: "\f173"; }
+
+.fa-vaadin:before {
+  content: "\f408"; }
+
+.fa-quora:before {
+  content: "\f2c4"; }
+
+.fa-square-x-twitter:before {
+  content: "\e61a"; }
+
+.fa-reacteurope:before {
+  content: "\f75d"; }
+
+.fa-medium:before {
+  content: "\f23a"; }
+
+.fa-medium-m:before {
+  content: "\f23a"; }
+
+.fa-amilia:before {
+  content: "\f36d"; }
+
+.fa-mixcloud:before {
+  content: "\f289"; }
+
+.fa-flipboard:before {
+  content: "\f44d"; }
+
+.fa-viacoin:before {
+  content: "\f237"; }
+
+.fa-critical-role:before {
+  content: "\f6c9"; }
+
+.fa-sitrox:before {
+  content: "\e44a"; }
+
+.fa-discourse:before {
+  content: "\f393"; }
+
+.fa-joomla:before {
+  content: "\f1aa"; }
+
+.fa-mastodon:before {
+  content: "\f4f6"; }
+
+.fa-airbnb:before {
+  content: "\f834"; }
+
+.fa-wolf-pack-battalion:before {
+  content: "\f514"; }
+
+.fa-buy-n-large:before {
+  content: "\f8a6"; }
+
+.fa-gulp:before {
+  content: "\f3ae"; }
+
+.fa-creative-commons-sampling-plus:before {
+  content: "\f4f1"; }
+
+.fa-strava:before {
+  content: "\f428"; }
+
+.fa-ember:before {
+  content: "\f423"; }
+
+.fa-canadian-maple-leaf:before {
+  content: "\f785"; }
+
+.fa-teamspeak:before {
+  content: "\f4f9"; }
+
+.fa-pushed:before {
+  content: "\f3e1"; }
+
+.fa-wordpress-simple:before {
+  content: "\f411"; }
+
+.fa-nutritionix:before {
+  content: "\f3d6"; }
+
+.fa-wodu:before {
+  content: "\e088"; }
+
+.fa-google-pay:before {
+  content: "\e079"; }
+
+.fa-intercom:before {
+  content: "\f7af"; }
+
+.fa-zhihu:before {
+  content: "\f63f"; }
+
+.fa-korvue:before {
+  content: "\f42f"; }
+
+.fa-pix:before {
+  content: "\e43a"; }
+
+.fa-steam-symbol:before {
+  content: "\f3f6"; }
+:root, :host {
+  --fa-style-family-classic: 'Font Awesome 6 Free';
+  --fa-font-regular: normal 400 1em/1 'Font Awesome 6 Free'; }
+
+@font-face {
+  font-family: 'Font Awesome 6 Free';
+  font-style: normal;
+  font-weight: 400;
+  font-display: block;
+  src: url("../webfonts/fa-regular-400.woff2") format("woff2"), url("../webfonts/fa-regular-400.ttf") format("truetype"); }
+
+.far,
+.fa-regular {
+  font-weight: 400; }
+:root, :host {
+  --fa-style-family-classic: 'Font Awesome 6 Free';
+  --fa-font-solid: normal 900 1em/1 'Font Awesome 6 Free'; }
+
+@font-face {
+  font-family: 'Font Awesome 6 Free';
+  font-style: normal;
+  font-weight: 900;
+  font-display: block;
+  src: url("../webfonts/fa-solid-900.woff2") format("woff2"), url("../webfonts/fa-solid-900.ttf") format("truetype"); }
+
+.fas,
+.fa-solid {
+  font-weight: 900; }
+@font-face {
+  font-family: 'Font Awesome 5 Brands';
+  font-display: block;
+  font-weight: 400;
+  src: url("../webfonts/fa-brands-400.woff2") format("woff2"), url("../webfonts/fa-brands-400.ttf") format("truetype"); }
+
+@font-face {
+  font-family: 'Font Awesome 5 Free';
+  font-display: block;
+  font-weight: 900;
+  src: url("../webfonts/fa-solid-900.woff2") format("woff2"), url("../webfonts/fa-solid-900.ttf") format("truetype"); }
+
+@font-face {
+  font-family: 'Font Awesome 5 Free';
+  font-display: block;
+  font-weight: 400;
+  src: url("../webfonts/fa-regular-400.woff2") format("woff2"), url("../webfonts/fa-regular-400.ttf") format("truetype"); }
+@font-face {
+  font-family: 'FontAwesome';
+  font-display: block;
+  src: url("../webfonts/fa-solid-900.woff2") format("woff2"), url("../webfonts/fa-solid-900.ttf") format("truetype"); }
+
+@font-face {
+  font-family: 'FontAwesome';
+  font-display: block;
+  src: url("../webfonts/fa-brands-400.woff2") format("woff2"), url("../webfonts/fa-brands-400.ttf") format("truetype"); }
+
+@font-face {
+  font-family: 'FontAwesome';
+  font-display: block;
+  src: url("../webfonts/fa-regular-400.woff2") format("woff2"), url("../webfonts/fa-regular-400.ttf") format("truetype"); }
+
+@font-face {
+  font-family: 'FontAwesome';
+  font-display: block;
+  src: url("../webfonts/fa-v4compatibility.woff2") format("woff2"), url("../webfonts/fa-v4compatibility.ttf") format("truetype"); }
diff --git a/dev/deps/font-awesome-6.4.2/css/all.min.css b/dev/deps/font-awesome-6.4.2/css/all.min.css
new file mode 100644
index 000000000..6604a0677
--- /dev/null
+++ b/dev/deps/font-awesome-6.4.2/css/all.min.css
@@ -0,0 +1,9 @@
+/*!
+ * Font Awesome Free 6.4.2 by @fontawesome - https://fontawesome.com
+ * License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License)
+ * Copyright 2023 Fonticons, Inc.
+ */
+.fa{font-family:var(--fa-style-family,"Font Awesome 6 Free");font-weight:var(--fa-style,900)}.fa,.fa-brands,.fa-classic,.fa-regular,.fa-sharp,.fa-solid,.fab,.far,.fas{-moz-osx-font-smoothing:grayscale;-webkit-font-smoothing:antialiased;display:var(--fa-display,inline-block);font-style:normal;font-variant:normal;line-height:1;text-rendering:auto}.fa-classic,.fa-regular,.fa-solid,.far,.fas{font-family:"Font Awesome 6 Free"}.fa-brands,.fab{font-family:"Font Awesome 6 Brands"}.fa-1x{font-size:1em}.fa-2x{font-size:2em}.fa-3x{font-size:3em}.fa-4x{font-size:4em}.fa-5x{font-size:5em}.fa-6x{font-size:6em}.fa-7x{font-size:7em}.fa-8x{font-size:8em}.fa-9x{font-size:9em}.fa-10x{font-size:10em}.fa-2xs{font-size:.625em;line-height:.1em;vertical-align:.225em}.fa-xs{font-size:.75em;line-height:.08333em;vertical-align:.125em}.fa-sm{font-size:.875em;line-height:.07143em;vertical-align:.05357em}.fa-lg{font-size:1.25em;line-height:.05em;vertical-align:-.075em}.fa-xl{font-size:1.5em;line-height:.04167em;vertical-align:-.125em}.fa-2xl{font-size:2em;line-height:.03125em;vertical-align:-.1875em}.fa-fw{text-align:center;width:1.25em}.fa-ul{list-style-type:none;margin-left:var(--fa-li-margin,2.5em);padding-left:0}.fa-ul>li{position:relative}.fa-li{left:calc(var(--fa-li-width, 2em)*-1);position:absolute;text-align:center;width:var(--fa-li-width,2em);line-height:inherit}.fa-border{border-radius:var(--fa-border-radius,.1em);border:var(--fa-border-width,.08em) var(--fa-border-style,solid) var(--fa-border-color,#eee);padding:var(--fa-border-padding,.2em .25em .15em)}.fa-pull-left{float:left;margin-right:var(--fa-pull-margin,.3em)}.fa-pull-right{float:right;margin-left:var(--fa-pull-margin,.3em)}.fa-beat{-webkit-animation-name:fa-beat;animation-name:fa-beat;-webkit-animation-delay:var(--fa-animation-delay,0s);animation-delay:var(--fa-animation-delay,0s);-webkit-animation-direction:var(--fa-animation-direction,normal);animation-direction:var(--fa-animation-direction,normal);-webkit-animation-duration:var(--fa-animation-duration,1s);animation-duration:var(--fa-animation-duration,1s);-webkit-animation-iteration-count:var(--fa-animation-iteration-count,infinite);animation-iteration-count:var(--fa-animation-iteration-count,infinite);-webkit-animation-timing-function:var(--fa-animation-timing,ease-in-out);animation-timing-function:var(--fa-animation-timing,ease-in-out)}.fa-bounce{-webkit-animation-name:fa-bounce;animation-name:fa-bounce;-webkit-animation-delay:var(--fa-animation-delay,0s);animation-delay:var(--fa-animation-delay,0s);-webkit-animation-direction:var(--fa-animation-direction,normal);animation-direction:var(--fa-animation-direction,normal);-webkit-animation-duration:var(--fa-animation-duration,1s);animation-duration:var(--fa-animation-duration,1s);-webkit-animation-iteration-count:var(--fa-animation-iteration-count,infinite);animation-iteration-count:var(--fa-animation-iteration-count,infinite);-webkit-animation-timing-function:var(--fa-animation-timing,cubic-bezier(.28,.84,.42,1));animation-timing-function:var(--fa-animation-timing,cubic-bezier(.28,.84,.42,1))}.fa-fade{-webkit-animation-name:fa-fade;animation-name:fa-fade;-webkit-animation-iteration-count:var(--fa-animation-iteration-count,infinite);animation-iteration-count:var(--fa-animation-iteration-count,infinite);-webkit-animation-timing-function:var(--fa-animation-timing,cubic-bezier(.4,0,.6,1));animation-timing-function:var(--fa-animation-timing,cubic-bezier(.4,0,.6,1))}.fa-beat-fade,.fa-fade{-webkit-animation-delay:var(--fa-animation-delay,0s);animation-delay:var(--fa-animation-delay,0s);-webkit-animation-direction:var(--fa-animation-direction,normal);animation-direction:var(--fa-animation-direction,normal);-webkit-animation-duration:var(--fa-animation-duration,1s);animation-duration:var(--fa-animation-duration,1s)}.fa-beat-fade{-webkit-animation-name:fa-beat-fade;animation-name:fa-beat-fade;-webkit-animation-iteration-count:var(--fa-animation-iteration-count,infinite);animation-iteration-count:var(--fa-animation-iteration-count,infinite);-webkit-animation-timing-function:var(--fa-animation-timing,cubic-bezier(.4,0,.6,1));animation-timing-function:var(--fa-animation-timing,cubic-bezier(.4,0,.6,1))}.fa-flip{-webkit-animation-name:fa-flip;animation-name:fa-flip;-webkit-animation-delay:var(--fa-animation-delay,0s);animation-delay:var(--fa-animation-delay,0s);-webkit-animation-direction:var(--fa-animation-direction,normal);animation-direction:var(--fa-animation-direction,normal);-webkit-animation-duration:var(--fa-animation-duration,1s);animation-duration:var(--fa-animation-duration,1s);-webkit-animation-iteration-count:var(--fa-animation-iteration-count,infinite);animation-iteration-count:var(--fa-animation-iteration-count,infinite);-webkit-animation-timing-function:var(--fa-animation-timing,ease-in-out);animation-timing-function:var(--fa-animation-timing,ease-in-out)}.fa-shake{-webkit-animation-name:fa-shake;animation-name:fa-shake;-webkit-animation-duration:var(--fa-animation-duration,1s);animation-duration:var(--fa-animation-duration,1s);-webkit-animation-iteration-count:var(--fa-animation-iteration-count,infinite);animation-iteration-count:var(--fa-animation-iteration-count,infinite);-webkit-animation-timing-function:var(--fa-animation-timing,linear);animation-timing-function:var(--fa-animation-timing,linear)}.fa-shake,.fa-spin{-webkit-animation-delay:var(--fa-animation-delay,0s);animation-delay:var(--fa-animation-delay,0s);-webkit-animation-direction:var(--fa-animation-direction,normal);animation-direction:var(--fa-animation-direction,normal)}.fa-spin{-webkit-animation-name:fa-spin;animation-name:fa-spin;-webkit-animation-duration:var(--fa-animation-duration,2s);animation-duration:var(--fa-animation-duration,2s);-webkit-animation-iteration-count:var(--fa-animation-iteration-count,infinite);animation-iteration-count:var(--fa-animation-iteration-count,infinite);-webkit-animation-timing-function:var(--fa-animation-timing,linear);animation-timing-function:var(--fa-animation-timing,linear)}.fa-spin-reverse{--fa-animation-direction:reverse}.fa-pulse,.fa-spin-pulse{-webkit-animation-name:fa-spin;animation-name:fa-spin;-webkit-animation-direction:var(--fa-animation-direction,normal);animation-direction:var(--fa-animation-direction,normal);-webkit-animation-duration:var(--fa-animation-duration,1s);animation-duration:var(--fa-animation-duration,1s);-webkit-animation-iteration-count:var(--fa-animation-iteration-count,infinite);animation-iteration-count:var(--fa-animation-iteration-count,infinite);-webkit-animation-timing-function:var(--fa-animation-timing,steps(8));animation-timing-function:var(--fa-animation-timing,steps(8))}@media (prefers-reduced-motion:reduce){.fa-beat,.fa-beat-fade,.fa-bounce,.fa-fade,.fa-flip,.fa-pulse,.fa-shake,.fa-spin,.fa-spin-pulse{-webkit-animation-delay:-1ms;animation-delay:-1ms;-webkit-animation-duration:1ms;animation-duration:1ms;-webkit-animation-iteration-count:1;animation-iteration-count:1;-webkit-transition-delay:0s;transition-delay:0s;-webkit-transition-duration:0s;transition-duration:0s}}@-webkit-keyframes fa-beat{0%,90%{-webkit-transform:scale(1);transform:scale(1)}45%{-webkit-transform:scale(var(--fa-beat-scale,1.25));transform:scale(var(--fa-beat-scale,1.25))}}@keyframes fa-beat{0%,90%{-webkit-transform:scale(1);transform:scale(1)}45%{-webkit-transform:scale(var(--fa-beat-scale,1.25));transform:scale(var(--fa-beat-scale,1.25))}}@-webkit-keyframes fa-bounce{0%{-webkit-transform:scale(1) translateY(0);transform:scale(1) translateY(0)}10%{-webkit-transform:scale(var(--fa-bounce-start-scale-x,1.1),var(--fa-bounce-start-scale-y,.9)) translateY(0);transform:scale(var(--fa-bounce-start-scale-x,1.1),var(--fa-bounce-start-scale-y,.9)) translateY(0)}30%{-webkit-transform:scale(var(--fa-bounce-jump-scale-x,.9),var(--fa-bounce-jump-scale-y,1.1)) translateY(var(--fa-bounce-height,-.5em));transform:scale(var(--fa-bounce-jump-scale-x,.9),var(--fa-bounce-jump-scale-y,1.1)) translateY(var(--fa-bounce-height,-.5em))}50%{-webkit-transform:scale(var(--fa-bounce-land-scale-x,1.05),var(--fa-bounce-land-scale-y,.95)) translateY(0);transform:scale(var(--fa-bounce-land-scale-x,1.05),var(--fa-bounce-land-scale-y,.95)) translateY(0)}57%{-webkit-transform:scale(1) translateY(var(--fa-bounce-rebound,-.125em));transform:scale(1) translateY(var(--fa-bounce-rebound,-.125em))}64%{-webkit-transform:scale(1) translateY(0);transform:scale(1) translateY(0)}to{-webkit-transform:scale(1) translateY(0);transform:scale(1) translateY(0)}}@keyframes fa-bounce{0%{-webkit-transform:scale(1) translateY(0);transform:scale(1) translateY(0)}10%{-webkit-transform:scale(var(--fa-bounce-start-scale-x,1.1),var(--fa-bounce-start-scale-y,.9)) translateY(0);transform:scale(var(--fa-bounce-start-scale-x,1.1),var(--fa-bounce-start-scale-y,.9)) translateY(0)}30%{-webkit-transform:scale(var(--fa-bounce-jump-scale-x,.9),var(--fa-bounce-jump-scale-y,1.1)) translateY(var(--fa-bounce-height,-.5em));transform:scale(var(--fa-bounce-jump-scale-x,.9),var(--fa-bounce-jump-scale-y,1.1)) translateY(var(--fa-bounce-height,-.5em))}50%{-webkit-transform:scale(var(--fa-bounce-land-scale-x,1.05),var(--fa-bounce-land-scale-y,.95)) translateY(0);transform:scale(var(--fa-bounce-land-scale-x,1.05),var(--fa-bounce-land-scale-y,.95)) translateY(0)}57%{-webkit-transform:scale(1) translateY(var(--fa-bounce-rebound,-.125em));transform:scale(1) translateY(var(--fa-bounce-rebound,-.125em))}64%{-webkit-transform:scale(1) translateY(0);transform:scale(1) translateY(0)}to{-webkit-transform:scale(1) translateY(0);transform:scale(1) translateY(0)}}@-webkit-keyframes fa-fade{50%{opacity:var(--fa-fade-opacity,.4)}}@keyframes fa-fade{50%{opacity:var(--fa-fade-opacity,.4)}}@-webkit-keyframes fa-beat-fade{0%,to{opacity:var(--fa-beat-fade-opacity,.4);-webkit-transform:scale(1);transform:scale(1)}50%{opacity:1;-webkit-transform:scale(var(--fa-beat-fade-scale,1.125));transform:scale(var(--fa-beat-fade-scale,1.125))}}@keyframes fa-beat-fade{0%,to{opacity:var(--fa-beat-fade-opacity,.4);-webkit-transform:scale(1);transform:scale(1)}50%{opacity:1;-webkit-transform:scale(var(--fa-beat-fade-scale,1.125));transform:scale(var(--fa-beat-fade-scale,1.125))}}@-webkit-keyframes fa-flip{50%{-webkit-transform:rotate3d(var(--fa-flip-x,0),var(--fa-flip-y,1),var(--fa-flip-z,0),var(--fa-flip-angle,-180deg));transform:rotate3d(var(--fa-flip-x,0),var(--fa-flip-y,1),var(--fa-flip-z,0),var(--fa-flip-angle,-180deg))}}@keyframes fa-flip{50%{-webkit-transform:rotate3d(var(--fa-flip-x,0),var(--fa-flip-y,1),var(--fa-flip-z,0),var(--fa-flip-angle,-180deg));transform:rotate3d(var(--fa-flip-x,0),var(--fa-flip-y,1),var(--fa-flip-z,0),var(--fa-flip-angle,-180deg))}}@-webkit-keyframes fa-shake{0%{-webkit-transform:rotate(-15deg);transform:rotate(-15deg)}4%{-webkit-transform:rotate(15deg);transform:rotate(15deg)}8%,24%{-webkit-transform:rotate(-18deg);transform:rotate(-18deg)}12%,28%{-webkit-transform:rotate(18deg);transform:rotate(18deg)}16%{-webkit-transform:rotate(-22deg);transform:rotate(-22deg)}20%{-webkit-transform:rotate(22deg);transform:rotate(22deg)}32%{-webkit-transform:rotate(-12deg);transform:rotate(-12deg)}36%{-webkit-transform:rotate(12deg);transform:rotate(12deg)}40%,to{-webkit-transform:rotate(0deg);transform:rotate(0deg)}}@keyframes fa-shake{0%{-webkit-transform:rotate(-15deg);transform:rotate(-15deg)}4%{-webkit-transform:rotate(15deg);transform:rotate(15deg)}8%,24%{-webkit-transform:rotate(-18deg);transform:rotate(-18deg)}12%,28%{-webkit-transform:rotate(18deg);transform:rotate(18deg)}16%{-webkit-transform:rotate(-22deg);transform:rotate(-22deg)}20%{-webkit-transform:rotate(22deg);transform:rotate(22deg)}32%{-webkit-transform:rotate(-12deg);transform:rotate(-12deg)}36%{-webkit-transform:rotate(12deg);transform:rotate(12deg)}40%,to{-webkit-transform:rotate(0deg);transform:rotate(0deg)}}@-webkit-keyframes fa-spin{0%{-webkit-transform:rotate(0deg);transform:rotate(0deg)}to{-webkit-transform:rotate(1turn);transform:rotate(1turn)}}@keyframes fa-spin{0%{-webkit-transform:rotate(0deg);transform:rotate(0deg)}to{-webkit-transform:rotate(1turn);transform:rotate(1turn)}}.fa-rotate-90{-webkit-transform:rotate(90deg);transform:rotate(90deg)}.fa-rotate-180{-webkit-transform:rotate(180deg);transform:rotate(180deg)}.fa-rotate-270{-webkit-transform:rotate(270deg);transform:rotate(270deg)}.fa-flip-horizontal{-webkit-transform:scaleX(-1);transform:scaleX(-1)}.fa-flip-vertical{-webkit-transform:scaleY(-1);transform:scaleY(-1)}.fa-flip-both,.fa-flip-horizontal.fa-flip-vertical{-webkit-transform:scale(-1);transform:scale(-1)}.fa-rotate-by{-webkit-transform:rotate(var(--fa-rotate-angle,none));transform:rotate(var(--fa-rotate-angle,none))}.fa-stack{display:inline-block;height:2em;line-height:2em;position:relative;vertical-align:middle;width:2.5em}.fa-stack-1x,.fa-stack-2x{left:0;position:absolute;text-align:center;width:100%;z-index:var(--fa-stack-z-index,auto)}.fa-stack-1x{line-height:inherit}.fa-stack-2x{font-size:2em}.fa-inverse{color:var(--fa-inverse,#fff)}
+
+.fa-0:before{content:"\30"}.fa-1:before{content:"\31"}.fa-2:before{content:"\32"}.fa-3:before{content:"\33"}.fa-4:before{content:"\34"}.fa-5:before{content:"\35"}.fa-6:before{content:"\36"}.fa-7:before{content:"\37"}.fa-8:before{content:"\38"}.fa-9:before{content:"\39"}.fa-fill-drip:before{content:"\f576"}.fa-arrows-to-circle:before{content:"\e4bd"}.fa-chevron-circle-right:before,.fa-circle-chevron-right:before{content:"\f138"}.fa-at:before{content:"\40"}.fa-trash-alt:before,.fa-trash-can:before{content:"\f2ed"}.fa-text-height:before{content:"\f034"}.fa-user-times:before,.fa-user-xmark:before{content:"\f235"}.fa-stethoscope:before{content:"\f0f1"}.fa-comment-alt:before,.fa-message:before{content:"\f27a"}.fa-info:before{content:"\f129"}.fa-compress-alt:before,.fa-down-left-and-up-right-to-center:before{content:"\f422"}.fa-explosion:before{content:"\e4e9"}.fa-file-alt:before,.fa-file-lines:before,.fa-file-text:before{content:"\f15c"}.fa-wave-square:before{content:"\f83e"}.fa-ring:before{content:"\f70b"}.fa-building-un:before{content:"\e4d9"}.fa-dice-three:before{content:"\f527"}.fa-calendar-alt:before,.fa-calendar-days:before{content:"\f073"}.fa-anchor-circle-check:before{content:"\e4aa"}.fa-building-circle-arrow-right:before{content:"\e4d1"}.fa-volleyball-ball:before,.fa-volleyball:before{content:"\f45f"}.fa-arrows-up-to-line:before{content:"\e4c2"}.fa-sort-desc:before,.fa-sort-down:before{content:"\f0dd"}.fa-circle-minus:before,.fa-minus-circle:before{content:"\f056"}.fa-door-open:before{content:"\f52b"}.fa-right-from-bracket:before,.fa-sign-out-alt:before{content:"\f2f5"}.fa-atom:before{content:"\f5d2"}.fa-soap:before{content:"\e06e"}.fa-heart-music-camera-bolt:before,.fa-icons:before{content:"\f86d"}.fa-microphone-alt-slash:before,.fa-microphone-lines-slash:before{content:"\f539"}.fa-bridge-circle-check:before{content:"\e4c9"}.fa-pump-medical:before{content:"\e06a"}.fa-fingerprint:before{content:"\f577"}.fa-hand-point-right:before{content:"\f0a4"}.fa-magnifying-glass-location:before,.fa-search-location:before{content:"\f689"}.fa-forward-step:before,.fa-step-forward:before{content:"\f051"}.fa-face-smile-beam:before,.fa-smile-beam:before{content:"\f5b8"}.fa-flag-checkered:before{content:"\f11e"}.fa-football-ball:before,.fa-football:before{content:"\f44e"}.fa-school-circle-exclamation:before{content:"\e56c"}.fa-crop:before{content:"\f125"}.fa-angle-double-down:before,.fa-angles-down:before{content:"\f103"}.fa-users-rectangle:before{content:"\e594"}.fa-people-roof:before{content:"\e537"}.fa-people-line:before{content:"\e534"}.fa-beer-mug-empty:before,.fa-beer:before{content:"\f0fc"}.fa-diagram-predecessor:before{content:"\e477"}.fa-arrow-up-long:before,.fa-long-arrow-up:before{content:"\f176"}.fa-burn:before,.fa-fire-flame-simple:before{content:"\f46a"}.fa-male:before,.fa-person:before{content:"\f183"}.fa-laptop:before{content:"\f109"}.fa-file-csv:before{content:"\f6dd"}.fa-menorah:before{content:"\f676"}.fa-truck-plane:before{content:"\e58f"}.fa-record-vinyl:before{content:"\f8d9"}.fa-face-grin-stars:before,.fa-grin-stars:before{content:"\f587"}.fa-bong:before{content:"\f55c"}.fa-pastafarianism:before,.fa-spaghetti-monster-flying:before{content:"\f67b"}.fa-arrow-down-up-across-line:before{content:"\e4af"}.fa-spoon:before,.fa-utensil-spoon:before{content:"\f2e5"}.fa-jar-wheat:before{content:"\e517"}.fa-envelopes-bulk:before,.fa-mail-bulk:before{content:"\f674"}.fa-file-circle-exclamation:before{content:"\e4eb"}.fa-circle-h:before,.fa-hospital-symbol:before{content:"\f47e"}.fa-pager:before{content:"\f815"}.fa-address-book:before,.fa-contact-book:before{content:"\f2b9"}.fa-strikethrough:before{content:"\f0cc"}.fa-k:before{content:"\4b"}.fa-landmark-flag:before{content:"\e51c"}.fa-pencil-alt:before,.fa-pencil:before{content:"\f303"}.fa-backward:before{content:"\f04a"}.fa-caret-right:before{content:"\f0da"}.fa-comments:before{content:"\f086"}.fa-file-clipboard:before,.fa-paste:before{content:"\f0ea"}.fa-code-pull-request:before{content:"\e13c"}.fa-clipboard-list:before{content:"\f46d"}.fa-truck-loading:before,.fa-truck-ramp-box:before{content:"\f4de"}.fa-user-check:before{content:"\f4fc"}.fa-vial-virus:before{content:"\e597"}.fa-sheet-plastic:before{content:"\e571"}.fa-blog:before{content:"\f781"}.fa-user-ninja:before{content:"\f504"}.fa-person-arrow-up-from-line:before{content:"\e539"}.fa-scroll-torah:before,.fa-torah:before{content:"\f6a0"}.fa-broom-ball:before,.fa-quidditch-broom-ball:before,.fa-quidditch:before{content:"\f458"}.fa-toggle-off:before{content:"\f204"}.fa-archive:before,.fa-box-archive:before{content:"\f187"}.fa-person-drowning:before{content:"\e545"}.fa-arrow-down-9-1:before,.fa-sort-numeric-desc:before,.fa-sort-numeric-down-alt:before{content:"\f886"}.fa-face-grin-tongue-squint:before,.fa-grin-tongue-squint:before{content:"\f58a"}.fa-spray-can:before{content:"\f5bd"}.fa-truck-monster:before{content:"\f63b"}.fa-w:before{content:"\57"}.fa-earth-africa:before,.fa-globe-africa:before{content:"\f57c"}.fa-rainbow:before{content:"\f75b"}.fa-circle-notch:before{content:"\f1ce"}.fa-tablet-alt:before,.fa-tablet-screen-button:before{content:"\f3fa"}.fa-paw:before{content:"\f1b0"}.fa-cloud:before{content:"\f0c2"}.fa-trowel-bricks:before{content:"\e58a"}.fa-face-flushed:before,.fa-flushed:before{content:"\f579"}.fa-hospital-user:before{content:"\f80d"}.fa-tent-arrow-left-right:before{content:"\e57f"}.fa-gavel:before,.fa-legal:before{content:"\f0e3"}.fa-binoculars:before{content:"\f1e5"}.fa-microphone-slash:before{content:"\f131"}.fa-box-tissue:before{content:"\e05b"}.fa-motorcycle:before{content:"\f21c"}.fa-bell-concierge:before,.fa-concierge-bell:before{content:"\f562"}.fa-pen-ruler:before,.fa-pencil-ruler:before{content:"\f5ae"}.fa-people-arrows-left-right:before,.fa-people-arrows:before{content:"\e068"}.fa-mars-and-venus-burst:before{content:"\e523"}.fa-caret-square-right:before,.fa-square-caret-right:before{content:"\f152"}.fa-cut:before,.fa-scissors:before{content:"\f0c4"}.fa-sun-plant-wilt:before{content:"\e57a"}.fa-toilets-portable:before{content:"\e584"}.fa-hockey-puck:before{content:"\f453"}.fa-table:before{content:"\f0ce"}.fa-magnifying-glass-arrow-right:before{content:"\e521"}.fa-digital-tachograph:before,.fa-tachograph-digital:before{content:"\f566"}.fa-users-slash:before{content:"\e073"}.fa-clover:before{content:"\e139"}.fa-mail-reply:before,.fa-reply:before{content:"\f3e5"}.fa-star-and-crescent:before{content:"\f699"}.fa-house-fire:before{content:"\e50c"}.fa-minus-square:before,.fa-square-minus:before{content:"\f146"}.fa-helicopter:before{content:"\f533"}.fa-compass:before{content:"\f14e"}.fa-caret-square-down:before,.fa-square-caret-down:before{content:"\f150"}.fa-file-circle-question:before{content:"\e4ef"}.fa-laptop-code:before{content:"\f5fc"}.fa-swatchbook:before{content:"\f5c3"}.fa-prescription-bottle:before{content:"\f485"}.fa-bars:before,.fa-navicon:before{content:"\f0c9"}.fa-people-group:before{content:"\e533"}.fa-hourglass-3:before,.fa-hourglass-end:before{content:"\f253"}.fa-heart-broken:before,.fa-heart-crack:before{content:"\f7a9"}.fa-external-link-square-alt:before,.fa-square-up-right:before{content:"\f360"}.fa-face-kiss-beam:before,.fa-kiss-beam:before{content:"\f597"}.fa-film:before{content:"\f008"}.fa-ruler-horizontal:before{content:"\f547"}.fa-people-robbery:before{content:"\e536"}.fa-lightbulb:before{content:"\f0eb"}.fa-caret-left:before{content:"\f0d9"}.fa-circle-exclamation:before,.fa-exclamation-circle:before{content:"\f06a"}.fa-school-circle-xmark:before{content:"\e56d"}.fa-arrow-right-from-bracket:before,.fa-sign-out:before{content:"\f08b"}.fa-chevron-circle-down:before,.fa-circle-chevron-down:before{content:"\f13a"}.fa-unlock-alt:before,.fa-unlock-keyhole:before{content:"\f13e"}.fa-cloud-showers-heavy:before{content:"\f740"}.fa-headphones-alt:before,.fa-headphones-simple:before{content:"\f58f"}.fa-sitemap:before{content:"\f0e8"}.fa-circle-dollar-to-slot:before,.fa-donate:before{content:"\f4b9"}.fa-memory:before{content:"\f538"}.fa-road-spikes:before{content:"\e568"}.fa-fire-burner:before{content:"\e4f1"}.fa-flag:before{content:"\f024"}.fa-hanukiah:before{content:"\f6e6"}.fa-feather:before{content:"\f52d"}.fa-volume-down:before,.fa-volume-low:before{content:"\f027"}.fa-comment-slash:before{content:"\f4b3"}.fa-cloud-sun-rain:before{content:"\f743"}.fa-compress:before{content:"\f066"}.fa-wheat-alt:before,.fa-wheat-awn:before{content:"\e2cd"}.fa-ankh:before{content:"\f644"}.fa-hands-holding-child:before{content:"\e4fa"}.fa-asterisk:before{content:"\2a"}.fa-check-square:before,.fa-square-check:before{content:"\f14a"}.fa-peseta-sign:before{content:"\e221"}.fa-header:before,.fa-heading:before{content:"\f1dc"}.fa-ghost:before{content:"\f6e2"}.fa-list-squares:before,.fa-list:before{content:"\f03a"}.fa-phone-square-alt:before,.fa-square-phone-flip:before{content:"\f87b"}.fa-cart-plus:before{content:"\f217"}.fa-gamepad:before{content:"\f11b"}.fa-circle-dot:before,.fa-dot-circle:before{content:"\f192"}.fa-dizzy:before,.fa-face-dizzy:before{content:"\f567"}.fa-egg:before{content:"\f7fb"}.fa-house-medical-circle-xmark:before{content:"\e513"}.fa-campground:before{content:"\f6bb"}.fa-folder-plus:before{content:"\f65e"}.fa-futbol-ball:before,.fa-futbol:before,.fa-soccer-ball:before{content:"\f1e3"}.fa-paint-brush:before,.fa-paintbrush:before{content:"\f1fc"}.fa-lock:before{content:"\f023"}.fa-gas-pump:before{content:"\f52f"}.fa-hot-tub-person:before,.fa-hot-tub:before{content:"\f593"}.fa-map-location:before,.fa-map-marked:before{content:"\f59f"}.fa-house-flood-water:before{content:"\e50e"}.fa-tree:before{content:"\f1bb"}.fa-bridge-lock:before{content:"\e4cc"}.fa-sack-dollar:before{content:"\f81d"}.fa-edit:before,.fa-pen-to-square:before{content:"\f044"}.fa-car-side:before{content:"\f5e4"}.fa-share-alt:before,.fa-share-nodes:before{content:"\f1e0"}.fa-heart-circle-minus:before{content:"\e4ff"}.fa-hourglass-2:before,.fa-hourglass-half:before{content:"\f252"}.fa-microscope:before{content:"\f610"}.fa-sink:before{content:"\e06d"}.fa-bag-shopping:before,.fa-shopping-bag:before{content:"\f290"}.fa-arrow-down-z-a:before,.fa-sort-alpha-desc:before,.fa-sort-alpha-down-alt:before{content:"\f881"}.fa-mitten:before{content:"\f7b5"}.fa-person-rays:before{content:"\e54d"}.fa-users:before{content:"\f0c0"}.fa-eye-slash:before{content:"\f070"}.fa-flask-vial:before{content:"\e4f3"}.fa-hand-paper:before,.fa-hand:before{content:"\f256"}.fa-om:before{content:"\f679"}.fa-worm:before{content:"\e599"}.fa-house-circle-xmark:before{content:"\e50b"}.fa-plug:before{content:"\f1e6"}.fa-chevron-up:before{content:"\f077"}.fa-hand-spock:before{content:"\f259"}.fa-stopwatch:before{content:"\f2f2"}.fa-face-kiss:before,.fa-kiss:before{content:"\f596"}.fa-bridge-circle-xmark:before{content:"\e4cb"}.fa-face-grin-tongue:before,.fa-grin-tongue:before{content:"\f589"}.fa-chess-bishop:before{content:"\f43a"}.fa-face-grin-wink:before,.fa-grin-wink:before{content:"\f58c"}.fa-deaf:before,.fa-deafness:before,.fa-ear-deaf:before,.fa-hard-of-hearing:before{content:"\f2a4"}.fa-road-circle-check:before{content:"\e564"}.fa-dice-five:before{content:"\f523"}.fa-rss-square:before,.fa-square-rss:before{content:"\f143"}.fa-land-mine-on:before{content:"\e51b"}.fa-i-cursor:before{content:"\f246"}.fa-stamp:before{content:"\f5bf"}.fa-stairs:before{content:"\e289"}.fa-i:before{content:"\49"}.fa-hryvnia-sign:before,.fa-hryvnia:before{content:"\f6f2"}.fa-pills:before{content:"\f484"}.fa-face-grin-wide:before,.fa-grin-alt:before{content:"\f581"}.fa-tooth:before{content:"\f5c9"}.fa-v:before{content:"\56"}.fa-bangladeshi-taka-sign:before{content:"\e2e6"}.fa-bicycle:before{content:"\f206"}.fa-rod-asclepius:before,.fa-rod-snake:before,.fa-staff-aesculapius:before,.fa-staff-snake:before{content:"\e579"}.fa-head-side-cough-slash:before{content:"\e062"}.fa-ambulance:before,.fa-truck-medical:before{content:"\f0f9"}.fa-wheat-awn-circle-exclamation:before{content:"\e598"}.fa-snowman:before{content:"\f7d0"}.fa-mortar-pestle:before{content:"\f5a7"}.fa-road-barrier:before{content:"\e562"}.fa-school:before{content:"\f549"}.fa-igloo:before{content:"\f7ae"}.fa-joint:before{content:"\f595"}.fa-angle-right:before{content:"\f105"}.fa-horse:before{content:"\f6f0"}.fa-q:before{content:"\51"}.fa-g:before{content:"\47"}.fa-notes-medical:before{content:"\f481"}.fa-temperature-2:before,.fa-temperature-half:before,.fa-thermometer-2:before,.fa-thermometer-half:before{content:"\f2c9"}.fa-dong-sign:before{content:"\e169"}.fa-capsules:before{content:"\f46b"}.fa-poo-bolt:before,.fa-poo-storm:before{content:"\f75a"}.fa-face-frown-open:before,.fa-frown-open:before{content:"\f57a"}.fa-hand-point-up:before{content:"\f0a6"}.fa-money-bill:before{content:"\f0d6"}.fa-bookmark:before{content:"\f02e"}.fa-align-justify:before{content:"\f039"}.fa-umbrella-beach:before{content:"\f5ca"}.fa-helmet-un:before{content:"\e503"}.fa-bullseye:before{content:"\f140"}.fa-bacon:before{content:"\f7e5"}.fa-hand-point-down:before{content:"\f0a7"}.fa-arrow-up-from-bracket:before{content:"\e09a"}.fa-folder-blank:before,.fa-folder:before{content:"\f07b"}.fa-file-medical-alt:before,.fa-file-waveform:before{content:"\f478"}.fa-radiation:before{content:"\f7b9"}.fa-chart-simple:before{content:"\e473"}.fa-mars-stroke:before{content:"\f229"}.fa-vial:before{content:"\f492"}.fa-dashboard:before,.fa-gauge-med:before,.fa-gauge:before,.fa-tachometer-alt-average:before{content:"\f624"}.fa-magic-wand-sparkles:before,.fa-wand-magic-sparkles:before{content:"\e2ca"}.fa-e:before{content:"\45"}.fa-pen-alt:before,.fa-pen-clip:before{content:"\f305"}.fa-bridge-circle-exclamation:before{content:"\e4ca"}.fa-user:before{content:"\f007"}.fa-school-circle-check:before{content:"\e56b"}.fa-dumpster:before{content:"\f793"}.fa-shuttle-van:before,.fa-van-shuttle:before{content:"\f5b6"}.fa-building-user:before{content:"\e4da"}.fa-caret-square-left:before,.fa-square-caret-left:before{content:"\f191"}.fa-highlighter:before{content:"\f591"}.fa-key:before{content:"\f084"}.fa-bullhorn:before{content:"\f0a1"}.fa-globe:before{content:"\f0ac"}.fa-synagogue:before{content:"\f69b"}.fa-person-half-dress:before{content:"\e548"}.fa-road-bridge:before{content:"\e563"}.fa-location-arrow:before{content:"\f124"}.fa-c:before{content:"\43"}.fa-tablet-button:before{content:"\f10a"}.fa-building-lock:before{content:"\e4d6"}.fa-pizza-slice:before{content:"\f818"}.fa-money-bill-wave:before{content:"\f53a"}.fa-area-chart:before,.fa-chart-area:before{content:"\f1fe"}.fa-house-flag:before{content:"\e50d"}.fa-person-circle-minus:before{content:"\e540"}.fa-ban:before,.fa-cancel:before{content:"\f05e"}.fa-camera-rotate:before{content:"\e0d8"}.fa-air-freshener:before,.fa-spray-can-sparkles:before{content:"\f5d0"}.fa-star:before{content:"\f005"}.fa-repeat:before{content:"\f363"}.fa-cross:before{content:"\f654"}.fa-box:before{content:"\f466"}.fa-venus-mars:before{content:"\f228"}.fa-arrow-pointer:before,.fa-mouse-pointer:before{content:"\f245"}.fa-expand-arrows-alt:before,.fa-maximize:before{content:"\f31e"}.fa-charging-station:before{content:"\f5e7"}.fa-shapes:before,.fa-triangle-circle-square:before{content:"\f61f"}.fa-random:before,.fa-shuffle:before{content:"\f074"}.fa-person-running:before,.fa-running:before{content:"\f70c"}.fa-mobile-retro:before{content:"\e527"}.fa-grip-lines-vertical:before{content:"\f7a5"}.fa-spider:before{content:"\f717"}.fa-hands-bound:before{content:"\e4f9"}.fa-file-invoice-dollar:before{content:"\f571"}.fa-plane-circle-exclamation:before{content:"\e556"}.fa-x-ray:before{content:"\f497"}.fa-spell-check:before{content:"\f891"}.fa-slash:before{content:"\f715"}.fa-computer-mouse:before,.fa-mouse:before{content:"\f8cc"}.fa-arrow-right-to-bracket:before,.fa-sign-in:before{content:"\f090"}.fa-shop-slash:before,.fa-store-alt-slash:before{content:"\e070"}.fa-server:before{content:"\f233"}.fa-virus-covid-slash:before{content:"\e4a9"}.fa-shop-lock:before{content:"\e4a5"}.fa-hourglass-1:before,.fa-hourglass-start:before{content:"\f251"}.fa-blender-phone:before{content:"\f6b6"}.fa-building-wheat:before{content:"\e4db"}.fa-person-breastfeeding:before{content:"\e53a"}.fa-right-to-bracket:before,.fa-sign-in-alt:before{content:"\f2f6"}.fa-venus:before{content:"\f221"}.fa-passport:before{content:"\f5ab"}.fa-heart-pulse:before,.fa-heartbeat:before{content:"\f21e"}.fa-people-carry-box:before,.fa-people-carry:before{content:"\f4ce"}.fa-temperature-high:before{content:"\f769"}.fa-microchip:before{content:"\f2db"}.fa-crown:before{content:"\f521"}.fa-weight-hanging:before{content:"\f5cd"}.fa-xmarks-lines:before{content:"\e59a"}.fa-file-prescription:before{content:"\f572"}.fa-weight-scale:before,.fa-weight:before{content:"\f496"}.fa-user-friends:before,.fa-user-group:before{content:"\f500"}.fa-arrow-up-a-z:before,.fa-sort-alpha-up:before{content:"\f15e"}.fa-chess-knight:before{content:"\f441"}.fa-face-laugh-squint:before,.fa-laugh-squint:before{content:"\f59b"}.fa-wheelchair:before{content:"\f193"}.fa-arrow-circle-up:before,.fa-circle-arrow-up:before{content:"\f0aa"}.fa-toggle-on:before{content:"\f205"}.fa-person-walking:before,.fa-walking:before{content:"\f554"}.fa-l:before{content:"\4c"}.fa-fire:before{content:"\f06d"}.fa-bed-pulse:before,.fa-procedures:before{content:"\f487"}.fa-shuttle-space:before,.fa-space-shuttle:before{content:"\f197"}.fa-face-laugh:before,.fa-laugh:before{content:"\f599"}.fa-folder-open:before{content:"\f07c"}.fa-heart-circle-plus:before{content:"\e500"}.fa-code-fork:before{content:"\e13b"}.fa-city:before{content:"\f64f"}.fa-microphone-alt:before,.fa-microphone-lines:before{content:"\f3c9"}.fa-pepper-hot:before{content:"\f816"}.fa-unlock:before{content:"\f09c"}.fa-colon-sign:before{content:"\e140"}.fa-headset:before{content:"\f590"}.fa-store-slash:before{content:"\e071"}.fa-road-circle-xmark:before{content:"\e566"}.fa-user-minus:before{content:"\f503"}.fa-mars-stroke-up:before,.fa-mars-stroke-v:before{content:"\f22a"}.fa-champagne-glasses:before,.fa-glass-cheers:before{content:"\f79f"}.fa-clipboard:before{content:"\f328"}.fa-house-circle-exclamation:before{content:"\e50a"}.fa-file-arrow-up:before,.fa-file-upload:before{content:"\f574"}.fa-wifi-3:before,.fa-wifi-strong:before,.fa-wifi:before{content:"\f1eb"}.fa-bath:before,.fa-bathtub:before{content:"\f2cd"}.fa-underline:before{content:"\f0cd"}.fa-user-edit:before,.fa-user-pen:before{content:"\f4ff"}.fa-signature:before{content:"\f5b7"}.fa-stroopwafel:before{content:"\f551"}.fa-bold:before{content:"\f032"}.fa-anchor-lock:before{content:"\e4ad"}.fa-building-ngo:before{content:"\e4d7"}.fa-manat-sign:before{content:"\e1d5"}.fa-not-equal:before{content:"\f53e"}.fa-border-style:before,.fa-border-top-left:before{content:"\f853"}.fa-map-location-dot:before,.fa-map-marked-alt:before{content:"\f5a0"}.fa-jedi:before{content:"\f669"}.fa-poll:before,.fa-square-poll-vertical:before{content:"\f681"}.fa-mug-hot:before{content:"\f7b6"}.fa-battery-car:before,.fa-car-battery:before{content:"\f5df"}.fa-gift:before{content:"\f06b"}.fa-dice-two:before{content:"\f528"}.fa-chess-queen:before{content:"\f445"}.fa-glasses:before{content:"\f530"}.fa-chess-board:before{content:"\f43c"}.fa-building-circle-check:before{content:"\e4d2"}.fa-person-chalkboard:before{content:"\e53d"}.fa-mars-stroke-h:before,.fa-mars-stroke-right:before{content:"\f22b"}.fa-hand-back-fist:before,.fa-hand-rock:before{content:"\f255"}.fa-caret-square-up:before,.fa-square-caret-up:before{content:"\f151"}.fa-cloud-showers-water:before{content:"\e4e4"}.fa-bar-chart:before,.fa-chart-bar:before{content:"\f080"}.fa-hands-bubbles:before,.fa-hands-wash:before{content:"\e05e"}.fa-less-than-equal:before{content:"\f537"}.fa-train:before{content:"\f238"}.fa-eye-low-vision:before,.fa-low-vision:before{content:"\f2a8"}.fa-crow:before{content:"\f520"}.fa-sailboat:before{content:"\e445"}.fa-window-restore:before{content:"\f2d2"}.fa-plus-square:before,.fa-square-plus:before{content:"\f0fe"}.fa-torii-gate:before{content:"\f6a1"}.fa-frog:before{content:"\f52e"}.fa-bucket:before{content:"\e4cf"}.fa-image:before{content:"\f03e"}.fa-microphone:before{content:"\f130"}.fa-cow:before{content:"\f6c8"}.fa-caret-up:before{content:"\f0d8"}.fa-screwdriver:before{content:"\f54a"}.fa-folder-closed:before{content:"\e185"}.fa-house-tsunami:before{content:"\e515"}.fa-square-nfi:before{content:"\e576"}.fa-arrow-up-from-ground-water:before{content:"\e4b5"}.fa-glass-martini-alt:before,.fa-martini-glass:before{content:"\f57b"}.fa-rotate-back:before,.fa-rotate-backward:before,.fa-rotate-left:before,.fa-undo-alt:before{content:"\f2ea"}.fa-columns:before,.fa-table-columns:before{content:"\f0db"}.fa-lemon:before{content:"\f094"}.fa-head-side-mask:before{content:"\e063"}.fa-handshake:before{content:"\f2b5"}.fa-gem:before{content:"\f3a5"}.fa-dolly-box:before,.fa-dolly:before{content:"\f472"}.fa-smoking:before{content:"\f48d"}.fa-compress-arrows-alt:before,.fa-minimize:before{content:"\f78c"}.fa-monument:before{content:"\f5a6"}.fa-snowplow:before{content:"\f7d2"}.fa-angle-double-right:before,.fa-angles-right:before{content:"\f101"}.fa-cannabis:before{content:"\f55f"}.fa-circle-play:before,.fa-play-circle:before{content:"\f144"}.fa-tablets:before{content:"\f490"}.fa-ethernet:before{content:"\f796"}.fa-eur:before,.fa-euro-sign:before,.fa-euro:before{content:"\f153"}.fa-chair:before{content:"\f6c0"}.fa-check-circle:before,.fa-circle-check:before{content:"\f058"}.fa-circle-stop:before,.fa-stop-circle:before{content:"\f28d"}.fa-compass-drafting:before,.fa-drafting-compass:before{content:"\f568"}.fa-plate-wheat:before{content:"\e55a"}.fa-icicles:before{content:"\f7ad"}.fa-person-shelter:before{content:"\e54f"}.fa-neuter:before{content:"\f22c"}.fa-id-badge:before{content:"\f2c1"}.fa-marker:before{content:"\f5a1"}.fa-face-laugh-beam:before,.fa-laugh-beam:before{content:"\f59a"}.fa-helicopter-symbol:before{content:"\e502"}.fa-universal-access:before{content:"\f29a"}.fa-chevron-circle-up:before,.fa-circle-chevron-up:before{content:"\f139"}.fa-lari-sign:before{content:"\e1c8"}.fa-volcano:before{content:"\f770"}.fa-person-walking-dashed-line-arrow-right:before{content:"\e553"}.fa-gbp:before,.fa-pound-sign:before,.fa-sterling-sign:before{content:"\f154"}.fa-viruses:before{content:"\e076"}.fa-square-person-confined:before{content:"\e577"}.fa-user-tie:before{content:"\f508"}.fa-arrow-down-long:before,.fa-long-arrow-down:before{content:"\f175"}.fa-tent-arrow-down-to-line:before{content:"\e57e"}.fa-certificate:before{content:"\f0a3"}.fa-mail-reply-all:before,.fa-reply-all:before{content:"\f122"}.fa-suitcase:before{content:"\f0f2"}.fa-person-skating:before,.fa-skating:before{content:"\f7c5"}.fa-filter-circle-dollar:before,.fa-funnel-dollar:before{content:"\f662"}.fa-camera-retro:before{content:"\f083"}.fa-arrow-circle-down:before,.fa-circle-arrow-down:before{content:"\f0ab"}.fa-arrow-right-to-file:before,.fa-file-import:before{content:"\f56f"}.fa-external-link-square:before,.fa-square-arrow-up-right:before{content:"\f14c"}.fa-box-open:before{content:"\f49e"}.fa-scroll:before{content:"\f70e"}.fa-spa:before{content:"\f5bb"}.fa-location-pin-lock:before{content:"\e51f"}.fa-pause:before{content:"\f04c"}.fa-hill-avalanche:before{content:"\e507"}.fa-temperature-0:before,.fa-temperature-empty:before,.fa-thermometer-0:before,.fa-thermometer-empty:before{content:"\f2cb"}.fa-bomb:before{content:"\f1e2"}.fa-registered:before{content:"\f25d"}.fa-address-card:before,.fa-contact-card:before,.fa-vcard:before{content:"\f2bb"}.fa-balance-scale-right:before,.fa-scale-unbalanced-flip:before{content:"\f516"}.fa-subscript:before{content:"\f12c"}.fa-diamond-turn-right:before,.fa-directions:before{content:"\f5eb"}.fa-burst:before{content:"\e4dc"}.fa-house-laptop:before,.fa-laptop-house:before{content:"\e066"}.fa-face-tired:before,.fa-tired:before{content:"\f5c8"}.fa-money-bills:before{content:"\e1f3"}.fa-smog:before{content:"\f75f"}.fa-crutch:before{content:"\f7f7"}.fa-cloud-arrow-up:before,.fa-cloud-upload-alt:before,.fa-cloud-upload:before{content:"\f0ee"}.fa-palette:before{content:"\f53f"}.fa-arrows-turn-right:before{content:"\e4c0"}.fa-vest:before{content:"\e085"}.fa-ferry:before{content:"\e4ea"}.fa-arrows-down-to-people:before{content:"\e4b9"}.fa-seedling:before,.fa-sprout:before{content:"\f4d8"}.fa-arrows-alt-h:before,.fa-left-right:before{content:"\f337"}.fa-boxes-packing:before{content:"\e4c7"}.fa-arrow-circle-left:before,.fa-circle-arrow-left:before{content:"\f0a8"}.fa-group-arrows-rotate:before{content:"\e4f6"}.fa-bowl-food:before{content:"\e4c6"}.fa-candy-cane:before{content:"\f786"}.fa-arrow-down-wide-short:before,.fa-sort-amount-asc:before,.fa-sort-amount-down:before{content:"\f160"}.fa-cloud-bolt:before,.fa-thunderstorm:before{content:"\f76c"}.fa-remove-format:before,.fa-text-slash:before{content:"\f87d"}.fa-face-smile-wink:before,.fa-smile-wink:before{content:"\f4da"}.fa-file-word:before{content:"\f1c2"}.fa-file-powerpoint:before{content:"\f1c4"}.fa-arrows-h:before,.fa-arrows-left-right:before{content:"\f07e"}.fa-house-lock:before{content:"\e510"}.fa-cloud-arrow-down:before,.fa-cloud-download-alt:before,.fa-cloud-download:before{content:"\f0ed"}.fa-children:before{content:"\e4e1"}.fa-blackboard:before,.fa-chalkboard:before{content:"\f51b"}.fa-user-alt-slash:before,.fa-user-large-slash:before{content:"\f4fa"}.fa-envelope-open:before{content:"\f2b6"}.fa-handshake-alt-slash:before,.fa-handshake-simple-slash:before{content:"\e05f"}.fa-mattress-pillow:before{content:"\e525"}.fa-guarani-sign:before{content:"\e19a"}.fa-arrows-rotate:before,.fa-refresh:before,.fa-sync:before{content:"\f021"}.fa-fire-extinguisher:before{content:"\f134"}.fa-cruzeiro-sign:before{content:"\e152"}.fa-greater-than-equal:before{content:"\f532"}.fa-shield-alt:before,.fa-shield-halved:before{content:"\f3ed"}.fa-atlas:before,.fa-book-atlas:before{content:"\f558"}.fa-virus:before{content:"\e074"}.fa-envelope-circle-check:before{content:"\e4e8"}.fa-layer-group:before{content:"\f5fd"}.fa-arrows-to-dot:before{content:"\e4be"}.fa-archway:before{content:"\f557"}.fa-heart-circle-check:before{content:"\e4fd"}.fa-house-chimney-crack:before,.fa-house-damage:before{content:"\f6f1"}.fa-file-archive:before,.fa-file-zipper:before{content:"\f1c6"}.fa-square:before{content:"\f0c8"}.fa-glass-martini:before,.fa-martini-glass-empty:before{content:"\f000"}.fa-couch:before{content:"\f4b8"}.fa-cedi-sign:before{content:"\e0df"}.fa-italic:before{content:"\f033"}.fa-church:before{content:"\f51d"}.fa-comments-dollar:before{content:"\f653"}.fa-democrat:before{content:"\f747"}.fa-z:before{content:"\5a"}.fa-person-skiing:before,.fa-skiing:before{content:"\f7c9"}.fa-road-lock:before{content:"\e567"}.fa-a:before{content:"\41"}.fa-temperature-arrow-down:before,.fa-temperature-down:before{content:"\e03f"}.fa-feather-alt:before,.fa-feather-pointed:before{content:"\f56b"}.fa-p:before{content:"\50"}.fa-snowflake:before{content:"\f2dc"}.fa-newspaper:before{content:"\f1ea"}.fa-ad:before,.fa-rectangle-ad:before{content:"\f641"}.fa-arrow-circle-right:before,.fa-circle-arrow-right:before{content:"\f0a9"}.fa-filter-circle-xmark:before{content:"\e17b"}.fa-locust:before{content:"\e520"}.fa-sort:before,.fa-unsorted:before{content:"\f0dc"}.fa-list-1-2:before,.fa-list-numeric:before,.fa-list-ol:before{content:"\f0cb"}.fa-person-dress-burst:before{content:"\e544"}.fa-money-check-alt:before,.fa-money-check-dollar:before{content:"\f53d"}.fa-vector-square:before{content:"\f5cb"}.fa-bread-slice:before{content:"\f7ec"}.fa-language:before{content:"\f1ab"}.fa-face-kiss-wink-heart:before,.fa-kiss-wink-heart:before{content:"\f598"}.fa-filter:before{content:"\f0b0"}.fa-question:before{content:"\3f"}.fa-file-signature:before{content:"\f573"}.fa-arrows-alt:before,.fa-up-down-left-right:before{content:"\f0b2"}.fa-house-chimney-user:before{content:"\e065"}.fa-hand-holding-heart:before{content:"\f4be"}.fa-puzzle-piece:before{content:"\f12e"}.fa-money-check:before{content:"\f53c"}.fa-star-half-alt:before,.fa-star-half-stroke:before{content:"\f5c0"}.fa-code:before{content:"\f121"}.fa-glass-whiskey:before,.fa-whiskey-glass:before{content:"\f7a0"}.fa-building-circle-exclamation:before{content:"\e4d3"}.fa-magnifying-glass-chart:before{content:"\e522"}.fa-arrow-up-right-from-square:before,.fa-external-link:before{content:"\f08e"}.fa-cubes-stacked:before{content:"\e4e6"}.fa-krw:before,.fa-won-sign:before,.fa-won:before{content:"\f159"}.fa-virus-covid:before{content:"\e4a8"}.fa-austral-sign:before{content:"\e0a9"}.fa-f:before{content:"\46"}.fa-leaf:before{content:"\f06c"}.fa-road:before{content:"\f018"}.fa-cab:before,.fa-taxi:before{content:"\f1ba"}.fa-person-circle-plus:before{content:"\e541"}.fa-chart-pie:before,.fa-pie-chart:before{content:"\f200"}.fa-bolt-lightning:before{content:"\e0b7"}.fa-sack-xmark:before{content:"\e56a"}.fa-file-excel:before{content:"\f1c3"}.fa-file-contract:before{content:"\f56c"}.fa-fish-fins:before{content:"\e4f2"}.fa-building-flag:before{content:"\e4d5"}.fa-face-grin-beam:before,.fa-grin-beam:before{content:"\f582"}.fa-object-ungroup:before{content:"\f248"}.fa-poop:before{content:"\f619"}.fa-location-pin:before,.fa-map-marker:before{content:"\f041"}.fa-kaaba:before{content:"\f66b"}.fa-toilet-paper:before{content:"\f71e"}.fa-hard-hat:before,.fa-hat-hard:before,.fa-helmet-safety:before{content:"\f807"}.fa-eject:before{content:"\f052"}.fa-arrow-alt-circle-right:before,.fa-circle-right:before{content:"\f35a"}.fa-plane-circle-check:before{content:"\e555"}.fa-face-rolling-eyes:before,.fa-meh-rolling-eyes:before{content:"\f5a5"}.fa-object-group:before{content:"\f247"}.fa-chart-line:before,.fa-line-chart:before{content:"\f201"}.fa-mask-ventilator:before{content:"\e524"}.fa-arrow-right:before{content:"\f061"}.fa-map-signs:before,.fa-signs-post:before{content:"\f277"}.fa-cash-register:before{content:"\f788"}.fa-person-circle-question:before{content:"\e542"}.fa-h:before{content:"\48"}.fa-tarp:before{content:"\e57b"}.fa-screwdriver-wrench:before,.fa-tools:before{content:"\f7d9"}.fa-arrows-to-eye:before{content:"\e4bf"}.fa-plug-circle-bolt:before{content:"\e55b"}.fa-heart:before{content:"\f004"}.fa-mars-and-venus:before{content:"\f224"}.fa-home-user:before,.fa-house-user:before{content:"\e1b0"}.fa-dumpster-fire:before{content:"\f794"}.fa-house-crack:before{content:"\e3b1"}.fa-cocktail:before,.fa-martini-glass-citrus:before{content:"\f561"}.fa-face-surprise:before,.fa-surprise:before{content:"\f5c2"}.fa-bottle-water:before{content:"\e4c5"}.fa-circle-pause:before,.fa-pause-circle:before{content:"\f28b"}.fa-toilet-paper-slash:before{content:"\e072"}.fa-apple-alt:before,.fa-apple-whole:before{content:"\f5d1"}.fa-kitchen-set:before{content:"\e51a"}.fa-r:before{content:"\52"}.fa-temperature-1:before,.fa-temperature-quarter:before,.fa-thermometer-1:before,.fa-thermometer-quarter:before{content:"\f2ca"}.fa-cube:before{content:"\f1b2"}.fa-bitcoin-sign:before{content:"\e0b4"}.fa-shield-dog:before{content:"\e573"}.fa-solar-panel:before{content:"\f5ba"}.fa-lock-open:before{content:"\f3c1"}.fa-elevator:before{content:"\e16d"}.fa-money-bill-transfer:before{content:"\e528"}.fa-money-bill-trend-up:before{content:"\e529"}.fa-house-flood-water-circle-arrow-right:before{content:"\e50f"}.fa-poll-h:before,.fa-square-poll-horizontal:before{content:"\f682"}.fa-circle:before{content:"\f111"}.fa-backward-fast:before,.fa-fast-backward:before{content:"\f049"}.fa-recycle:before{content:"\f1b8"}.fa-user-astronaut:before{content:"\f4fb"}.fa-plane-slash:before{content:"\e069"}.fa-trademark:before{content:"\f25c"}.fa-basketball-ball:before,.fa-basketball:before{content:"\f434"}.fa-satellite-dish:before{content:"\f7c0"}.fa-arrow-alt-circle-up:before,.fa-circle-up:before{content:"\f35b"}.fa-mobile-alt:before,.fa-mobile-screen-button:before{content:"\f3cd"}.fa-volume-high:before,.fa-volume-up:before{content:"\f028"}.fa-users-rays:before{content:"\e593"}.fa-wallet:before{content:"\f555"}.fa-clipboard-check:before{content:"\f46c"}.fa-file-audio:before{content:"\f1c7"}.fa-burger:before,.fa-hamburger:before{content:"\f805"}.fa-wrench:before{content:"\f0ad"}.fa-bugs:before{content:"\e4d0"}.fa-rupee-sign:before,.fa-rupee:before{content:"\f156"}.fa-file-image:before{content:"\f1c5"}.fa-circle-question:before,.fa-question-circle:before{content:"\f059"}.fa-plane-departure:before{content:"\f5b0"}.fa-handshake-slash:before{content:"\e060"}.fa-book-bookmark:before{content:"\e0bb"}.fa-code-branch:before{content:"\f126"}.fa-hat-cowboy:before{content:"\f8c0"}.fa-bridge:before{content:"\e4c8"}.fa-phone-alt:before,.fa-phone-flip:before{content:"\f879"}.fa-truck-front:before{content:"\e2b7"}.fa-cat:before{content:"\f6be"}.fa-anchor-circle-exclamation:before{content:"\e4ab"}.fa-truck-field:before{content:"\e58d"}.fa-route:before{content:"\f4d7"}.fa-clipboard-question:before{content:"\e4e3"}.fa-panorama:before{content:"\e209"}.fa-comment-medical:before{content:"\f7f5"}.fa-teeth-open:before{content:"\f62f"}.fa-file-circle-minus:before{content:"\e4ed"}.fa-tags:before{content:"\f02c"}.fa-wine-glass:before{content:"\f4e3"}.fa-fast-forward:before,.fa-forward-fast:before{content:"\f050"}.fa-face-meh-blank:before,.fa-meh-blank:before{content:"\f5a4"}.fa-parking:before,.fa-square-parking:before{content:"\f540"}.fa-house-signal:before{content:"\e012"}.fa-bars-progress:before,.fa-tasks-alt:before{content:"\f828"}.fa-faucet-drip:before{content:"\e006"}.fa-cart-flatbed:before,.fa-dolly-flatbed:before{content:"\f474"}.fa-ban-smoking:before,.fa-smoking-ban:before{content:"\f54d"}.fa-terminal:before{content:"\f120"}.fa-mobile-button:before{content:"\f10b"}.fa-house-medical-flag:before{content:"\e514"}.fa-basket-shopping:before,.fa-shopping-basket:before{content:"\f291"}.fa-tape:before{content:"\f4db"}.fa-bus-alt:before,.fa-bus-simple:before{content:"\f55e"}.fa-eye:before{content:"\f06e"}.fa-face-sad-cry:before,.fa-sad-cry:before{content:"\f5b3"}.fa-audio-description:before{content:"\f29e"}.fa-person-military-to-person:before{content:"\e54c"}.fa-file-shield:before{content:"\e4f0"}.fa-user-slash:before{content:"\f506"}.fa-pen:before{content:"\f304"}.fa-tower-observation:before{content:"\e586"}.fa-file-code:before{content:"\f1c9"}.fa-signal-5:before,.fa-signal-perfect:before,.fa-signal:before{content:"\f012"}.fa-bus:before{content:"\f207"}.fa-heart-circle-xmark:before{content:"\e501"}.fa-home-lg:before,.fa-house-chimney:before{content:"\e3af"}.fa-window-maximize:before{content:"\f2d0"}.fa-face-frown:before,.fa-frown:before{content:"\f119"}.fa-prescription:before{content:"\f5b1"}.fa-shop:before,.fa-store-alt:before{content:"\f54f"}.fa-floppy-disk:before,.fa-save:before{content:"\f0c7"}.fa-vihara:before{content:"\f6a7"}.fa-balance-scale-left:before,.fa-scale-unbalanced:before{content:"\f515"}.fa-sort-asc:before,.fa-sort-up:before{content:"\f0de"}.fa-comment-dots:before,.fa-commenting:before{content:"\f4ad"}.fa-plant-wilt:before{content:"\e5aa"}.fa-diamond:before{content:"\f219"}.fa-face-grin-squint:before,.fa-grin-squint:before{content:"\f585"}.fa-hand-holding-dollar:before,.fa-hand-holding-usd:before{content:"\f4c0"}.fa-bacterium:before{content:"\e05a"}.fa-hand-pointer:before{content:"\f25a"}.fa-drum-steelpan:before{content:"\f56a"}.fa-hand-scissors:before{content:"\f257"}.fa-hands-praying:before,.fa-praying-hands:before{content:"\f684"}.fa-arrow-right-rotate:before,.fa-arrow-rotate-forward:before,.fa-arrow-rotate-right:before,.fa-redo:before{content:"\f01e"}.fa-biohazard:before{content:"\f780"}.fa-location-crosshairs:before,.fa-location:before{content:"\f601"}.fa-mars-double:before{content:"\f227"}.fa-child-dress:before{content:"\e59c"}.fa-users-between-lines:before{content:"\e591"}.fa-lungs-virus:before{content:"\e067"}.fa-face-grin-tears:before,.fa-grin-tears:before{content:"\f588"}.fa-phone:before{content:"\f095"}.fa-calendar-times:before,.fa-calendar-xmark:before{content:"\f273"}.fa-child-reaching:before{content:"\e59d"}.fa-head-side-virus:before{content:"\e064"}.fa-user-cog:before,.fa-user-gear:before{content:"\f4fe"}.fa-arrow-up-1-9:before,.fa-sort-numeric-up:before{content:"\f163"}.fa-door-closed:before{content:"\f52a"}.fa-shield-virus:before{content:"\e06c"}.fa-dice-six:before{content:"\f526"}.fa-mosquito-net:before{content:"\e52c"}.fa-bridge-water:before{content:"\e4ce"}.fa-person-booth:before{content:"\f756"}.fa-text-width:before{content:"\f035"}.fa-hat-wizard:before{content:"\f6e8"}.fa-pen-fancy:before{content:"\f5ac"}.fa-digging:before,.fa-person-digging:before{content:"\f85e"}.fa-trash:before{content:"\f1f8"}.fa-gauge-simple-med:before,.fa-gauge-simple:before,.fa-tachometer-average:before{content:"\f629"}.fa-book-medical:before{content:"\f7e6"}.fa-poo:before{content:"\f2fe"}.fa-quote-right-alt:before,.fa-quote-right:before{content:"\f10e"}.fa-shirt:before,.fa-t-shirt:before,.fa-tshirt:before{content:"\f553"}.fa-cubes:before{content:"\f1b3"}.fa-divide:before{content:"\f529"}.fa-tenge-sign:before,.fa-tenge:before{content:"\f7d7"}.fa-headphones:before{content:"\f025"}.fa-hands-holding:before{content:"\f4c2"}.fa-hands-clapping:before{content:"\e1a8"}.fa-republican:before{content:"\f75e"}.fa-arrow-left:before{content:"\f060"}.fa-person-circle-xmark:before{content:"\e543"}.fa-ruler:before{content:"\f545"}.fa-align-left:before{content:"\f036"}.fa-dice-d6:before{content:"\f6d1"}.fa-restroom:before{content:"\f7bd"}.fa-j:before{content:"\4a"}.fa-users-viewfinder:before{content:"\e595"}.fa-file-video:before{content:"\f1c8"}.fa-external-link-alt:before,.fa-up-right-from-square:before{content:"\f35d"}.fa-table-cells:before,.fa-th:before{content:"\f00a"}.fa-file-pdf:before{content:"\f1c1"}.fa-bible:before,.fa-book-bible:before{content:"\f647"}.fa-o:before{content:"\4f"}.fa-medkit:before,.fa-suitcase-medical:before{content:"\f0fa"}.fa-user-secret:before{content:"\f21b"}.fa-otter:before{content:"\f700"}.fa-female:before,.fa-person-dress:before{content:"\f182"}.fa-comment-dollar:before{content:"\f651"}.fa-briefcase-clock:before,.fa-business-time:before{content:"\f64a"}.fa-table-cells-large:before,.fa-th-large:before{content:"\f009"}.fa-book-tanakh:before,.fa-tanakh:before{content:"\f827"}.fa-phone-volume:before,.fa-volume-control-phone:before{content:"\f2a0"}.fa-hat-cowboy-side:before{content:"\f8c1"}.fa-clipboard-user:before{content:"\f7f3"}.fa-child:before{content:"\f1ae"}.fa-lira-sign:before{content:"\f195"}.fa-satellite:before{content:"\f7bf"}.fa-plane-lock:before{content:"\e558"}.fa-tag:before{content:"\f02b"}.fa-comment:before{content:"\f075"}.fa-birthday-cake:before,.fa-cake-candles:before,.fa-cake:before{content:"\f1fd"}.fa-envelope:before{content:"\f0e0"}.fa-angle-double-up:before,.fa-angles-up:before{content:"\f102"}.fa-paperclip:before{content:"\f0c6"}.fa-arrow-right-to-city:before{content:"\e4b3"}.fa-ribbon:before{content:"\f4d6"}.fa-lungs:before{content:"\f604"}.fa-arrow-up-9-1:before,.fa-sort-numeric-up-alt:before{content:"\f887"}.fa-litecoin-sign:before{content:"\e1d3"}.fa-border-none:before{content:"\f850"}.fa-circle-nodes:before{content:"\e4e2"}.fa-parachute-box:before{content:"\f4cd"}.fa-indent:before{content:"\f03c"}.fa-truck-field-un:before{content:"\e58e"}.fa-hourglass-empty:before,.fa-hourglass:before{content:"\f254"}.fa-mountain:before{content:"\f6fc"}.fa-user-doctor:before,.fa-user-md:before{content:"\f0f0"}.fa-circle-info:before,.fa-info-circle:before{content:"\f05a"}.fa-cloud-meatball:before{content:"\f73b"}.fa-camera-alt:before,.fa-camera:before{content:"\f030"}.fa-square-virus:before{content:"\e578"}.fa-meteor:before{content:"\f753"}.fa-car-on:before{content:"\e4dd"}.fa-sleigh:before{content:"\f7cc"}.fa-arrow-down-1-9:before,.fa-sort-numeric-asc:before,.fa-sort-numeric-down:before{content:"\f162"}.fa-hand-holding-droplet:before,.fa-hand-holding-water:before{content:"\f4c1"}.fa-water:before{content:"\f773"}.fa-calendar-check:before{content:"\f274"}.fa-braille:before{content:"\f2a1"}.fa-prescription-bottle-alt:before,.fa-prescription-bottle-medical:before{content:"\f486"}.fa-landmark:before{content:"\f66f"}.fa-truck:before{content:"\f0d1"}.fa-crosshairs:before{content:"\f05b"}.fa-person-cane:before{content:"\e53c"}.fa-tent:before{content:"\e57d"}.fa-vest-patches:before{content:"\e086"}.fa-check-double:before{content:"\f560"}.fa-arrow-down-a-z:before,.fa-sort-alpha-asc:before,.fa-sort-alpha-down:before{content:"\f15d"}.fa-money-bill-wheat:before{content:"\e52a"}.fa-cookie:before{content:"\f563"}.fa-arrow-left-rotate:before,.fa-arrow-rotate-back:before,.fa-arrow-rotate-backward:before,.fa-arrow-rotate-left:before,.fa-undo:before{content:"\f0e2"}.fa-hard-drive:before,.fa-hdd:before{content:"\f0a0"}.fa-face-grin-squint-tears:before,.fa-grin-squint-tears:before{content:"\f586"}.fa-dumbbell:before{content:"\f44b"}.fa-list-alt:before,.fa-rectangle-list:before{content:"\f022"}.fa-tarp-droplet:before{content:"\e57c"}.fa-house-medical-circle-check:before{content:"\e511"}.fa-person-skiing-nordic:before,.fa-skiing-nordic:before{content:"\f7ca"}.fa-calendar-plus:before{content:"\f271"}.fa-plane-arrival:before{content:"\f5af"}.fa-arrow-alt-circle-left:before,.fa-circle-left:before{content:"\f359"}.fa-subway:before,.fa-train-subway:before{content:"\f239"}.fa-chart-gantt:before{content:"\e0e4"}.fa-indian-rupee-sign:before,.fa-indian-rupee:before,.fa-inr:before{content:"\e1bc"}.fa-crop-alt:before,.fa-crop-simple:before{content:"\f565"}.fa-money-bill-1:before,.fa-money-bill-alt:before{content:"\f3d1"}.fa-left-long:before,.fa-long-arrow-alt-left:before{content:"\f30a"}.fa-dna:before{content:"\f471"}.fa-virus-slash:before{content:"\e075"}.fa-minus:before,.fa-subtract:before{content:"\f068"}.fa-chess:before{content:"\f439"}.fa-arrow-left-long:before,.fa-long-arrow-left:before{content:"\f177"}.fa-plug-circle-check:before{content:"\e55c"}.fa-street-view:before{content:"\f21d"}.fa-franc-sign:before{content:"\e18f"}.fa-volume-off:before{content:"\f026"}.fa-american-sign-language-interpreting:before,.fa-asl-interpreting:before,.fa-hands-american-sign-language-interpreting:before,.fa-hands-asl-interpreting:before{content:"\f2a3"}.fa-cog:before,.fa-gear:before{content:"\f013"}.fa-droplet-slash:before,.fa-tint-slash:before{content:"\f5c7"}.fa-mosque:before{content:"\f678"}.fa-mosquito:before{content:"\e52b"}.fa-star-of-david:before{content:"\f69a"}.fa-person-military-rifle:before{content:"\e54b"}.fa-cart-shopping:before,.fa-shopping-cart:before{content:"\f07a"}.fa-vials:before{content:"\f493"}.fa-plug-circle-plus:before{content:"\e55f"}.fa-place-of-worship:before{content:"\f67f"}.fa-grip-vertical:before{content:"\f58e"}.fa-arrow-turn-up:before,.fa-level-up:before{content:"\f148"}.fa-u:before{content:"\55"}.fa-square-root-alt:before,.fa-square-root-variable:before{content:"\f698"}.fa-clock-four:before,.fa-clock:before{content:"\f017"}.fa-backward-step:before,.fa-step-backward:before{content:"\f048"}.fa-pallet:before{content:"\f482"}.fa-faucet:before{content:"\e005"}.fa-baseball-bat-ball:before{content:"\f432"}.fa-s:before{content:"\53"}.fa-timeline:before{content:"\e29c"}.fa-keyboard:before{content:"\f11c"}.fa-caret-down:before{content:"\f0d7"}.fa-clinic-medical:before,.fa-house-chimney-medical:before{content:"\f7f2"}.fa-temperature-3:before,.fa-temperature-three-quarters:before,.fa-thermometer-3:before,.fa-thermometer-three-quarters:before{content:"\f2c8"}.fa-mobile-android-alt:before,.fa-mobile-screen:before{content:"\f3cf"}.fa-plane-up:before{content:"\e22d"}.fa-piggy-bank:before{content:"\f4d3"}.fa-battery-3:before,.fa-battery-half:before{content:"\f242"}.fa-mountain-city:before{content:"\e52e"}.fa-coins:before{content:"\f51e"}.fa-khanda:before{content:"\f66d"}.fa-sliders-h:before,.fa-sliders:before{content:"\f1de"}.fa-folder-tree:before{content:"\f802"}.fa-network-wired:before{content:"\f6ff"}.fa-map-pin:before{content:"\f276"}.fa-hamsa:before{content:"\f665"}.fa-cent-sign:before{content:"\e3f5"}.fa-flask:before{content:"\f0c3"}.fa-person-pregnant:before{content:"\e31e"}.fa-wand-sparkles:before{content:"\f72b"}.fa-ellipsis-v:before,.fa-ellipsis-vertical:before{content:"\f142"}.fa-ticket:before{content:"\f145"}.fa-power-off:before{content:"\f011"}.fa-long-arrow-alt-right:before,.fa-right-long:before{content:"\f30b"}.fa-flag-usa:before{content:"\f74d"}.fa-laptop-file:before{content:"\e51d"}.fa-teletype:before,.fa-tty:before{content:"\f1e4"}.fa-diagram-next:before{content:"\e476"}.fa-person-rifle:before{content:"\e54e"}.fa-house-medical-circle-exclamation:before{content:"\e512"}.fa-closed-captioning:before{content:"\f20a"}.fa-hiking:before,.fa-person-hiking:before{content:"\f6ec"}.fa-venus-double:before{content:"\f226"}.fa-images:before{content:"\f302"}.fa-calculator:before{content:"\f1ec"}.fa-people-pulling:before{content:"\e535"}.fa-n:before{content:"\4e"}.fa-cable-car:before,.fa-tram:before{content:"\f7da"}.fa-cloud-rain:before{content:"\f73d"}.fa-building-circle-xmark:before{content:"\e4d4"}.fa-ship:before{content:"\f21a"}.fa-arrows-down-to-line:before{content:"\e4b8"}.fa-download:before{content:"\f019"}.fa-face-grin:before,.fa-grin:before{content:"\f580"}.fa-backspace:before,.fa-delete-left:before{content:"\f55a"}.fa-eye-dropper-empty:before,.fa-eye-dropper:before,.fa-eyedropper:before{content:"\f1fb"}.fa-file-circle-check:before{content:"\e5a0"}.fa-forward:before{content:"\f04e"}.fa-mobile-android:before,.fa-mobile-phone:before,.fa-mobile:before{content:"\f3ce"}.fa-face-meh:before,.fa-meh:before{content:"\f11a"}.fa-align-center:before{content:"\f037"}.fa-book-dead:before,.fa-book-skull:before{content:"\f6b7"}.fa-drivers-license:before,.fa-id-card:before{content:"\f2c2"}.fa-dedent:before,.fa-outdent:before{content:"\f03b"}.fa-heart-circle-exclamation:before{content:"\e4fe"}.fa-home-alt:before,.fa-home-lg-alt:before,.fa-home:before,.fa-house:before{content:"\f015"}.fa-calendar-week:before{content:"\f784"}.fa-laptop-medical:before{content:"\f812"}.fa-b:before{content:"\42"}.fa-file-medical:before{content:"\f477"}.fa-dice-one:before{content:"\f525"}.fa-kiwi-bird:before{content:"\f535"}.fa-arrow-right-arrow-left:before,.fa-exchange:before{content:"\f0ec"}.fa-redo-alt:before,.fa-rotate-forward:before,.fa-rotate-right:before{content:"\f2f9"}.fa-cutlery:before,.fa-utensils:before{content:"\f2e7"}.fa-arrow-up-wide-short:before,.fa-sort-amount-up:before{content:"\f161"}.fa-mill-sign:before{content:"\e1ed"}.fa-bowl-rice:before{content:"\e2eb"}.fa-skull:before{content:"\f54c"}.fa-broadcast-tower:before,.fa-tower-broadcast:before{content:"\f519"}.fa-truck-pickup:before{content:"\f63c"}.fa-long-arrow-alt-up:before,.fa-up-long:before{content:"\f30c"}.fa-stop:before{content:"\f04d"}.fa-code-merge:before{content:"\f387"}.fa-upload:before{content:"\f093"}.fa-hurricane:before{content:"\f751"}.fa-mound:before{content:"\e52d"}.fa-toilet-portable:before{content:"\e583"}.fa-compact-disc:before{content:"\f51f"}.fa-file-arrow-down:before,.fa-file-download:before{content:"\f56d"}.fa-caravan:before{content:"\f8ff"}.fa-shield-cat:before{content:"\e572"}.fa-bolt:before,.fa-zap:before{content:"\f0e7"}.fa-glass-water:before{content:"\e4f4"}.fa-oil-well:before{content:"\e532"}.fa-vault:before{content:"\e2c5"}.fa-mars:before{content:"\f222"}.fa-toilet:before{content:"\f7d8"}.fa-plane-circle-xmark:before{content:"\e557"}.fa-cny:before,.fa-jpy:before,.fa-rmb:before,.fa-yen-sign:before,.fa-yen:before{content:"\f157"}.fa-rouble:before,.fa-rub:before,.fa-ruble-sign:before,.fa-ruble:before{content:"\f158"}.fa-sun:before{content:"\f185"}.fa-guitar:before{content:"\f7a6"}.fa-face-laugh-wink:before,.fa-laugh-wink:before{content:"\f59c"}.fa-horse-head:before{content:"\f7ab"}.fa-bore-hole:before{content:"\e4c3"}.fa-industry:before{content:"\f275"}.fa-arrow-alt-circle-down:before,.fa-circle-down:before{content:"\f358"}.fa-arrows-turn-to-dots:before{content:"\e4c1"}.fa-florin-sign:before{content:"\e184"}.fa-arrow-down-short-wide:before,.fa-sort-amount-desc:before,.fa-sort-amount-down-alt:before{content:"\f884"}.fa-less-than:before{content:"\3c"}.fa-angle-down:before{content:"\f107"}.fa-car-tunnel:before{content:"\e4de"}.fa-head-side-cough:before{content:"\e061"}.fa-grip-lines:before{content:"\f7a4"}.fa-thumbs-down:before{content:"\f165"}.fa-user-lock:before{content:"\f502"}.fa-arrow-right-long:before,.fa-long-arrow-right:before{content:"\f178"}.fa-anchor-circle-xmark:before{content:"\e4ac"}.fa-ellipsis-h:before,.fa-ellipsis:before{content:"\f141"}.fa-chess-pawn:before{content:"\f443"}.fa-first-aid:before,.fa-kit-medical:before{content:"\f479"}.fa-person-through-window:before{content:"\e5a9"}.fa-toolbox:before{content:"\f552"}.fa-hands-holding-circle:before{content:"\e4fb"}.fa-bug:before{content:"\f188"}.fa-credit-card-alt:before,.fa-credit-card:before{content:"\f09d"}.fa-automobile:before,.fa-car:before{content:"\f1b9"}.fa-hand-holding-hand:before{content:"\e4f7"}.fa-book-open-reader:before,.fa-book-reader:before{content:"\f5da"}.fa-mountain-sun:before{content:"\e52f"}.fa-arrows-left-right-to-line:before{content:"\e4ba"}.fa-dice-d20:before{content:"\f6cf"}.fa-truck-droplet:before{content:"\e58c"}.fa-file-circle-xmark:before{content:"\e5a1"}.fa-temperature-arrow-up:before,.fa-temperature-up:before{content:"\e040"}.fa-medal:before{content:"\f5a2"}.fa-bed:before{content:"\f236"}.fa-h-square:before,.fa-square-h:before{content:"\f0fd"}.fa-podcast:before{content:"\f2ce"}.fa-temperature-4:before,.fa-temperature-full:before,.fa-thermometer-4:before,.fa-thermometer-full:before{content:"\f2c7"}.fa-bell:before{content:"\f0f3"}.fa-superscript:before{content:"\f12b"}.fa-plug-circle-xmark:before{content:"\e560"}.fa-star-of-life:before{content:"\f621"}.fa-phone-slash:before{content:"\f3dd"}.fa-paint-roller:before{content:"\f5aa"}.fa-hands-helping:before,.fa-handshake-angle:before{content:"\f4c4"}.fa-location-dot:before,.fa-map-marker-alt:before{content:"\f3c5"}.fa-file:before{content:"\f15b"}.fa-greater-than:before{content:"\3e"}.fa-person-swimming:before,.fa-swimmer:before{content:"\f5c4"}.fa-arrow-down:before{content:"\f063"}.fa-droplet:before,.fa-tint:before{content:"\f043"}.fa-eraser:before{content:"\f12d"}.fa-earth-america:before,.fa-earth-americas:before,.fa-earth:before,.fa-globe-americas:before{content:"\f57d"}.fa-person-burst:before{content:"\e53b"}.fa-dove:before{content:"\f4ba"}.fa-battery-0:before,.fa-battery-empty:before{content:"\f244"}.fa-socks:before{content:"\f696"}.fa-inbox:before{content:"\f01c"}.fa-section:before{content:"\e447"}.fa-gauge-high:before,.fa-tachometer-alt-fast:before,.fa-tachometer-alt:before{content:"\f625"}.fa-envelope-open-text:before{content:"\f658"}.fa-hospital-alt:before,.fa-hospital-wide:before,.fa-hospital:before{content:"\f0f8"}.fa-wine-bottle:before{content:"\f72f"}.fa-chess-rook:before{content:"\f447"}.fa-bars-staggered:before,.fa-reorder:before,.fa-stream:before{content:"\f550"}.fa-dharmachakra:before{content:"\f655"}.fa-hotdog:before{content:"\f80f"}.fa-blind:before,.fa-person-walking-with-cane:before{content:"\f29d"}.fa-drum:before{content:"\f569"}.fa-ice-cream:before{content:"\f810"}.fa-heart-circle-bolt:before{content:"\e4fc"}.fa-fax:before{content:"\f1ac"}.fa-paragraph:before{content:"\f1dd"}.fa-check-to-slot:before,.fa-vote-yea:before{content:"\f772"}.fa-star-half:before{content:"\f089"}.fa-boxes-alt:before,.fa-boxes-stacked:before,.fa-boxes:before{content:"\f468"}.fa-chain:before,.fa-link:before{content:"\f0c1"}.fa-assistive-listening-systems:before,.fa-ear-listen:before{content:"\f2a2"}.fa-tree-city:before{content:"\e587"}.fa-play:before{content:"\f04b"}.fa-font:before{content:"\f031"}.fa-rupiah-sign:before{content:"\e23d"}.fa-magnifying-glass:before,.fa-search:before{content:"\f002"}.fa-ping-pong-paddle-ball:before,.fa-table-tennis-paddle-ball:before,.fa-table-tennis:before{content:"\f45d"}.fa-diagnoses:before,.fa-person-dots-from-line:before{content:"\f470"}.fa-trash-can-arrow-up:before,.fa-trash-restore-alt:before{content:"\f82a"}.fa-naira-sign:before{content:"\e1f6"}.fa-cart-arrow-down:before{content:"\f218"}.fa-walkie-talkie:before{content:"\f8ef"}.fa-file-edit:before,.fa-file-pen:before{content:"\f31c"}.fa-receipt:before{content:"\f543"}.fa-pen-square:before,.fa-pencil-square:before,.fa-square-pen:before{content:"\f14b"}.fa-suitcase-rolling:before{content:"\f5c1"}.fa-person-circle-exclamation:before{content:"\e53f"}.fa-chevron-down:before{content:"\f078"}.fa-battery-5:before,.fa-battery-full:before,.fa-battery:before{content:"\f240"}.fa-skull-crossbones:before{content:"\f714"}.fa-code-compare:before{content:"\e13a"}.fa-list-dots:before,.fa-list-ul:before{content:"\f0ca"}.fa-school-lock:before{content:"\e56f"}.fa-tower-cell:before{content:"\e585"}.fa-down-long:before,.fa-long-arrow-alt-down:before{content:"\f309"}.fa-ranking-star:before{content:"\e561"}.fa-chess-king:before{content:"\f43f"}.fa-person-harassing:before{content:"\e549"}.fa-brazilian-real-sign:before{content:"\e46c"}.fa-landmark-alt:before,.fa-landmark-dome:before{content:"\f752"}.fa-arrow-up:before{content:"\f062"}.fa-television:before,.fa-tv-alt:before,.fa-tv:before{content:"\f26c"}.fa-shrimp:before{content:"\e448"}.fa-list-check:before,.fa-tasks:before{content:"\f0ae"}.fa-jug-detergent:before{content:"\e519"}.fa-circle-user:before,.fa-user-circle:before{content:"\f2bd"}.fa-user-shield:before{content:"\f505"}.fa-wind:before{content:"\f72e"}.fa-car-burst:before,.fa-car-crash:before{content:"\f5e1"}.fa-y:before{content:"\59"}.fa-person-snowboarding:before,.fa-snowboarding:before{content:"\f7ce"}.fa-shipping-fast:before,.fa-truck-fast:before{content:"\f48b"}.fa-fish:before{content:"\f578"}.fa-user-graduate:before{content:"\f501"}.fa-adjust:before,.fa-circle-half-stroke:before{content:"\f042"}.fa-clapperboard:before{content:"\e131"}.fa-circle-radiation:before,.fa-radiation-alt:before{content:"\f7ba"}.fa-baseball-ball:before,.fa-baseball:before{content:"\f433"}.fa-jet-fighter-up:before{content:"\e518"}.fa-diagram-project:before,.fa-project-diagram:before{content:"\f542"}.fa-copy:before{content:"\f0c5"}.fa-volume-mute:before,.fa-volume-times:before,.fa-volume-xmark:before{content:"\f6a9"}.fa-hand-sparkles:before{content:"\e05d"}.fa-grip-horizontal:before,.fa-grip:before{content:"\f58d"}.fa-share-from-square:before,.fa-share-square:before{content:"\f14d"}.fa-child-combatant:before,.fa-child-rifle:before{content:"\e4e0"}.fa-gun:before{content:"\e19b"}.fa-phone-square:before,.fa-square-phone:before{content:"\f098"}.fa-add:before,.fa-plus:before{content:"\2b"}.fa-expand:before{content:"\f065"}.fa-computer:before{content:"\e4e5"}.fa-close:before,.fa-multiply:before,.fa-remove:before,.fa-times:before,.fa-xmark:before{content:"\f00d"}.fa-arrows-up-down-left-right:before,.fa-arrows:before{content:"\f047"}.fa-chalkboard-teacher:before,.fa-chalkboard-user:before{content:"\f51c"}.fa-peso-sign:before{content:"\e222"}.fa-building-shield:before{content:"\e4d8"}.fa-baby:before{content:"\f77c"}.fa-users-line:before{content:"\e592"}.fa-quote-left-alt:before,.fa-quote-left:before{content:"\f10d"}.fa-tractor:before{content:"\f722"}.fa-trash-arrow-up:before,.fa-trash-restore:before{content:"\f829"}.fa-arrow-down-up-lock:before{content:"\e4b0"}.fa-lines-leaning:before{content:"\e51e"}.fa-ruler-combined:before{content:"\f546"}.fa-copyright:before{content:"\f1f9"}.fa-equals:before{content:"\3d"}.fa-blender:before{content:"\f517"}.fa-teeth:before{content:"\f62e"}.fa-ils:before,.fa-shekel-sign:before,.fa-shekel:before,.fa-sheqel-sign:before,.fa-sheqel:before{content:"\f20b"}.fa-map:before{content:"\f279"}.fa-rocket:before{content:"\f135"}.fa-photo-film:before,.fa-photo-video:before{content:"\f87c"}.fa-folder-minus:before{content:"\f65d"}.fa-store:before{content:"\f54e"}.fa-arrow-trend-up:before{content:"\e098"}.fa-plug-circle-minus:before{content:"\e55e"}.fa-sign-hanging:before,.fa-sign:before{content:"\f4d9"}.fa-bezier-curve:before{content:"\f55b"}.fa-bell-slash:before{content:"\f1f6"}.fa-tablet-android:before,.fa-tablet:before{content:"\f3fb"}.fa-school-flag:before{content:"\e56e"}.fa-fill:before{content:"\f575"}.fa-angle-up:before{content:"\f106"}.fa-drumstick-bite:before{content:"\f6d7"}.fa-holly-berry:before{content:"\f7aa"}.fa-chevron-left:before{content:"\f053"}.fa-bacteria:before{content:"\e059"}.fa-hand-lizard:before{content:"\f258"}.fa-notdef:before{content:"\e1fe"}.fa-disease:before{content:"\f7fa"}.fa-briefcase-medical:before{content:"\f469"}.fa-genderless:before{content:"\f22d"}.fa-chevron-right:before{content:"\f054"}.fa-retweet:before{content:"\f079"}.fa-car-alt:before,.fa-car-rear:before{content:"\f5de"}.fa-pump-soap:before{content:"\e06b"}.fa-video-slash:before{content:"\f4e2"}.fa-battery-2:before,.fa-battery-quarter:before{content:"\f243"}.fa-radio:before{content:"\f8d7"}.fa-baby-carriage:before,.fa-carriage-baby:before{content:"\f77d"}.fa-traffic-light:before{content:"\f637"}.fa-thermometer:before{content:"\f491"}.fa-vr-cardboard:before{content:"\f729"}.fa-hand-middle-finger:before{content:"\f806"}.fa-percent:before,.fa-percentage:before{content:"\25"}.fa-truck-moving:before{content:"\f4df"}.fa-glass-water-droplet:before{content:"\e4f5"}.fa-display:before{content:"\e163"}.fa-face-smile:before,.fa-smile:before{content:"\f118"}.fa-thumb-tack:before,.fa-thumbtack:before{content:"\f08d"}.fa-trophy:before{content:"\f091"}.fa-person-praying:before,.fa-pray:before{content:"\f683"}.fa-hammer:before{content:"\f6e3"}.fa-hand-peace:before{content:"\f25b"}.fa-rotate:before,.fa-sync-alt:before{content:"\f2f1"}.fa-spinner:before{content:"\f110"}.fa-robot:before{content:"\f544"}.fa-peace:before{content:"\f67c"}.fa-cogs:before,.fa-gears:before{content:"\f085"}.fa-warehouse:before{content:"\f494"}.fa-arrow-up-right-dots:before{content:"\e4b7"}.fa-splotch:before{content:"\f5bc"}.fa-face-grin-hearts:before,.fa-grin-hearts:before{content:"\f584"}.fa-dice-four:before{content:"\f524"}.fa-sim-card:before{content:"\f7c4"}.fa-transgender-alt:before,.fa-transgender:before{content:"\f225"}.fa-mercury:before{content:"\f223"}.fa-arrow-turn-down:before,.fa-level-down:before{content:"\f149"}.fa-person-falling-burst:before{content:"\e547"}.fa-award:before{content:"\f559"}.fa-ticket-alt:before,.fa-ticket-simple:before{content:"\f3ff"}.fa-building:before{content:"\f1ad"}.fa-angle-double-left:before,.fa-angles-left:before{content:"\f100"}.fa-qrcode:before{content:"\f029"}.fa-clock-rotate-left:before,.fa-history:before{content:"\f1da"}.fa-face-grin-beam-sweat:before,.fa-grin-beam-sweat:before{content:"\f583"}.fa-arrow-right-from-file:before,.fa-file-export:before{content:"\f56e"}.fa-shield-blank:before,.fa-shield:before{content:"\f132"}.fa-arrow-up-short-wide:before,.fa-sort-amount-up-alt:before{content:"\f885"}.fa-house-medical:before{content:"\e3b2"}.fa-golf-ball-tee:before,.fa-golf-ball:before{content:"\f450"}.fa-chevron-circle-left:before,.fa-circle-chevron-left:before{content:"\f137"}.fa-house-chimney-window:before{content:"\e00d"}.fa-pen-nib:before{content:"\f5ad"}.fa-tent-arrow-turn-left:before{content:"\e580"}.fa-tents:before{content:"\e582"}.fa-magic:before,.fa-wand-magic:before{content:"\f0d0"}.fa-dog:before{content:"\f6d3"}.fa-carrot:before{content:"\f787"}.fa-moon:before{content:"\f186"}.fa-wine-glass-alt:before,.fa-wine-glass-empty:before{content:"\f5ce"}.fa-cheese:before{content:"\f7ef"}.fa-yin-yang:before{content:"\f6ad"}.fa-music:before{content:"\f001"}.fa-code-commit:before{content:"\f386"}.fa-temperature-low:before{content:"\f76b"}.fa-biking:before,.fa-person-biking:before{content:"\f84a"}.fa-broom:before{content:"\f51a"}.fa-shield-heart:before{content:"\e574"}.fa-gopuram:before{content:"\f664"}.fa-earth-oceania:before,.fa-globe-oceania:before{content:"\e47b"}.fa-square-xmark:before,.fa-times-square:before,.fa-xmark-square:before{content:"\f2d3"}.fa-hashtag:before{content:"\23"}.fa-expand-alt:before,.fa-up-right-and-down-left-from-center:before{content:"\f424"}.fa-oil-can:before{content:"\f613"}.fa-t:before{content:"\54"}.fa-hippo:before{content:"\f6ed"}.fa-chart-column:before{content:"\e0e3"}.fa-infinity:before{content:"\f534"}.fa-vial-circle-check:before{content:"\e596"}.fa-person-arrow-down-to-line:before{content:"\e538"}.fa-voicemail:before{content:"\f897"}.fa-fan:before{content:"\f863"}.fa-person-walking-luggage:before{content:"\e554"}.fa-arrows-alt-v:before,.fa-up-down:before{content:"\f338"}.fa-cloud-moon-rain:before{content:"\f73c"}.fa-calendar:before{content:"\f133"}.fa-trailer:before{content:"\e041"}.fa-bahai:before,.fa-haykal:before{content:"\f666"}.fa-sd-card:before{content:"\f7c2"}.fa-dragon:before{content:"\f6d5"}.fa-shoe-prints:before{content:"\f54b"}.fa-circle-plus:before,.fa-plus-circle:before{content:"\f055"}.fa-face-grin-tongue-wink:before,.fa-grin-tongue-wink:before{content:"\f58b"}.fa-hand-holding:before{content:"\f4bd"}.fa-plug-circle-exclamation:before{content:"\e55d"}.fa-chain-broken:before,.fa-chain-slash:before,.fa-link-slash:before,.fa-unlink:before{content:"\f127"}.fa-clone:before{content:"\f24d"}.fa-person-walking-arrow-loop-left:before{content:"\e551"}.fa-arrow-up-z-a:before,.fa-sort-alpha-up-alt:before{content:"\f882"}.fa-fire-alt:before,.fa-fire-flame-curved:before{content:"\f7e4"}.fa-tornado:before{content:"\f76f"}.fa-file-circle-plus:before{content:"\e494"}.fa-book-quran:before,.fa-quran:before{content:"\f687"}.fa-anchor:before{content:"\f13d"}.fa-border-all:before{content:"\f84c"}.fa-angry:before,.fa-face-angry:before{content:"\f556"}.fa-cookie-bite:before{content:"\f564"}.fa-arrow-trend-down:before{content:"\e097"}.fa-feed:before,.fa-rss:before{content:"\f09e"}.fa-draw-polygon:before{content:"\f5ee"}.fa-balance-scale:before,.fa-scale-balanced:before{content:"\f24e"}.fa-gauge-simple-high:before,.fa-tachometer-fast:before,.fa-tachometer:before{content:"\f62a"}.fa-shower:before{content:"\f2cc"}.fa-desktop-alt:before,.fa-desktop:before{content:"\f390"}.fa-m:before{content:"\4d"}.fa-table-list:before,.fa-th-list:before{content:"\f00b"}.fa-comment-sms:before,.fa-sms:before{content:"\f7cd"}.fa-book:before{content:"\f02d"}.fa-user-plus:before{content:"\f234"}.fa-check:before{content:"\f00c"}.fa-battery-4:before,.fa-battery-three-quarters:before{content:"\f241"}.fa-house-circle-check:before{content:"\e509"}.fa-angle-left:before{content:"\f104"}.fa-diagram-successor:before{content:"\e47a"}.fa-truck-arrow-right:before{content:"\e58b"}.fa-arrows-split-up-and-left:before{content:"\e4bc"}.fa-fist-raised:before,.fa-hand-fist:before{content:"\f6de"}.fa-cloud-moon:before{content:"\f6c3"}.fa-briefcase:before{content:"\f0b1"}.fa-person-falling:before{content:"\e546"}.fa-image-portrait:before,.fa-portrait:before{content:"\f3e0"}.fa-user-tag:before{content:"\f507"}.fa-rug:before{content:"\e569"}.fa-earth-europe:before,.fa-globe-europe:before{content:"\f7a2"}.fa-cart-flatbed-suitcase:before,.fa-luggage-cart:before{content:"\f59d"}.fa-rectangle-times:before,.fa-rectangle-xmark:before,.fa-times-rectangle:before,.fa-window-close:before{content:"\f410"}.fa-baht-sign:before{content:"\e0ac"}.fa-book-open:before{content:"\f518"}.fa-book-journal-whills:before,.fa-journal-whills:before{content:"\f66a"}.fa-handcuffs:before{content:"\e4f8"}.fa-exclamation-triangle:before,.fa-triangle-exclamation:before,.fa-warning:before{content:"\f071"}.fa-database:before{content:"\f1c0"}.fa-arrow-turn-right:before,.fa-mail-forward:before,.fa-share:before{content:"\f064"}.fa-bottle-droplet:before{content:"\e4c4"}.fa-mask-face:before{content:"\e1d7"}.fa-hill-rockslide:before{content:"\e508"}.fa-exchange-alt:before,.fa-right-left:before{content:"\f362"}.fa-paper-plane:before{content:"\f1d8"}.fa-road-circle-exclamation:before{content:"\e565"}.fa-dungeon:before{content:"\f6d9"}.fa-align-right:before{content:"\f038"}.fa-money-bill-1-wave:before,.fa-money-bill-wave-alt:before{content:"\f53b"}.fa-life-ring:before{content:"\f1cd"}.fa-hands:before,.fa-sign-language:before,.fa-signing:before{content:"\f2a7"}.fa-calendar-day:before{content:"\f783"}.fa-ladder-water:before,.fa-swimming-pool:before,.fa-water-ladder:before{content:"\f5c5"}.fa-arrows-up-down:before,.fa-arrows-v:before{content:"\f07d"}.fa-face-grimace:before,.fa-grimace:before{content:"\f57f"}.fa-wheelchair-alt:before,.fa-wheelchair-move:before{content:"\e2ce"}.fa-level-down-alt:before,.fa-turn-down:before{content:"\f3be"}.fa-person-walking-arrow-right:before{content:"\e552"}.fa-envelope-square:before,.fa-square-envelope:before{content:"\f199"}.fa-dice:before{content:"\f522"}.fa-bowling-ball:before{content:"\f436"}.fa-brain:before{content:"\f5dc"}.fa-band-aid:before,.fa-bandage:before{content:"\f462"}.fa-calendar-minus:before{content:"\f272"}.fa-circle-xmark:before,.fa-times-circle:before,.fa-xmark-circle:before{content:"\f057"}.fa-gifts:before{content:"\f79c"}.fa-hotel:before{content:"\f594"}.fa-earth-asia:before,.fa-globe-asia:before{content:"\f57e"}.fa-id-card-alt:before,.fa-id-card-clip:before{content:"\f47f"}.fa-magnifying-glass-plus:before,.fa-search-plus:before{content:"\f00e"}.fa-thumbs-up:before{content:"\f164"}.fa-user-clock:before{content:"\f4fd"}.fa-allergies:before,.fa-hand-dots:before{content:"\f461"}.fa-file-invoice:before{content:"\f570"}.fa-window-minimize:before{content:"\f2d1"}.fa-coffee:before,.fa-mug-saucer:before{content:"\f0f4"}.fa-brush:before{content:"\f55d"}.fa-mask:before{content:"\f6fa"}.fa-magnifying-glass-minus:before,.fa-search-minus:before{content:"\f010"}.fa-ruler-vertical:before{content:"\f548"}.fa-user-alt:before,.fa-user-large:before{content:"\f406"}.fa-train-tram:before{content:"\e5b4"}.fa-user-nurse:before{content:"\f82f"}.fa-syringe:before{content:"\f48e"}.fa-cloud-sun:before{content:"\f6c4"}.fa-stopwatch-20:before{content:"\e06f"}.fa-square-full:before{content:"\f45c"}.fa-magnet:before{content:"\f076"}.fa-jar:before{content:"\e516"}.fa-note-sticky:before,.fa-sticky-note:before{content:"\f249"}.fa-bug-slash:before{content:"\e490"}.fa-arrow-up-from-water-pump:before{content:"\e4b6"}.fa-bone:before{content:"\f5d7"}.fa-user-injured:before{content:"\f728"}.fa-face-sad-tear:before,.fa-sad-tear:before{content:"\f5b4"}.fa-plane:before{content:"\f072"}.fa-tent-arrows-down:before{content:"\e581"}.fa-exclamation:before{content:"\21"}.fa-arrows-spin:before{content:"\e4bb"}.fa-print:before{content:"\f02f"}.fa-try:before,.fa-turkish-lira-sign:before,.fa-turkish-lira:before{content:"\e2bb"}.fa-dollar-sign:before,.fa-dollar:before,.fa-usd:before{content:"\24"}.fa-x:before{content:"\58"}.fa-magnifying-glass-dollar:before,.fa-search-dollar:before{content:"\f688"}.fa-users-cog:before,.fa-users-gear:before{content:"\f509"}.fa-person-military-pointing:before{content:"\e54a"}.fa-bank:before,.fa-building-columns:before,.fa-institution:before,.fa-museum:before,.fa-university:before{content:"\f19c"}.fa-umbrella:before{content:"\f0e9"}.fa-trowel:before{content:"\e589"}.fa-d:before{content:"\44"}.fa-stapler:before{content:"\e5af"}.fa-masks-theater:before,.fa-theater-masks:before{content:"\f630"}.fa-kip-sign:before{content:"\e1c4"}.fa-hand-point-left:before{content:"\f0a5"}.fa-handshake-alt:before,.fa-handshake-simple:before{content:"\f4c6"}.fa-fighter-jet:before,.fa-jet-fighter:before{content:"\f0fb"}.fa-share-alt-square:before,.fa-square-share-nodes:before{content:"\f1e1"}.fa-barcode:before{content:"\f02a"}.fa-plus-minus:before{content:"\e43c"}.fa-video-camera:before,.fa-video:before{content:"\f03d"}.fa-graduation-cap:before,.fa-mortar-board:before{content:"\f19d"}.fa-hand-holding-medical:before{content:"\e05c"}.fa-person-circle-check:before{content:"\e53e"}.fa-level-up-alt:before,.fa-turn-up:before{content:"\f3bf"}
+.fa-sr-only,.fa-sr-only-focusable:not(:focus),.sr-only,.sr-only-focusable:not(:focus){position:absolute;width:1px;height:1px;padding:0;margin:-1px;overflow:hidden;clip:rect(0,0,0,0);white-space:nowrap;border-width:0}:host,:root{--fa-style-family-brands:"Font Awesome 6 Brands";--fa-font-brands:normal 400 1em/1 "Font Awesome 6 Brands"}@font-face{font-family:"Font Awesome 6 Brands";font-style:normal;font-weight:400;font-display:block;src: url("../webfonts/fa-brands-400.woff2") format("woff2"), url("../webfonts/fa-brands-400.ttf") format("truetype"); }.fa-brands,.fab{font-weight:400}.fa-monero:before{content:"\f3d0"}.fa-hooli:before{content:"\f427"}.fa-yelp:before{content:"\f1e9"}.fa-cc-visa:before{content:"\f1f0"}.fa-lastfm:before{content:"\f202"}.fa-shopware:before{content:"\f5b5"}.fa-creative-commons-nc:before{content:"\f4e8"}.fa-aws:before{content:"\f375"}.fa-redhat:before{content:"\f7bc"}.fa-yoast:before{content:"\f2b1"}.fa-cloudflare:before{content:"\e07d"}.fa-ups:before{content:"\f7e0"}.fa-wpexplorer:before{content:"\f2de"}.fa-dyalog:before{content:"\f399"}.fa-bity:before{content:"\f37a"}.fa-stackpath:before{content:"\f842"}.fa-buysellads:before{content:"\f20d"}.fa-first-order:before{content:"\f2b0"}.fa-modx:before{content:"\f285"}.fa-guilded:before{content:"\e07e"}.fa-vnv:before{content:"\f40b"}.fa-js-square:before,.fa-square-js:before{content:"\f3b9"}.fa-microsoft:before{content:"\f3ca"}.fa-qq:before{content:"\f1d6"}.fa-orcid:before{content:"\f8d2"}.fa-java:before{content:"\f4e4"}.fa-invision:before{content:"\f7b0"}.fa-creative-commons-pd-alt:before{content:"\f4ed"}.fa-centercode:before{content:"\f380"}.fa-glide-g:before{content:"\f2a6"}.fa-drupal:before{content:"\f1a9"}.fa-hire-a-helper:before{content:"\f3b0"}.fa-creative-commons-by:before{content:"\f4e7"}.fa-unity:before{content:"\e049"}.fa-whmcs:before{content:"\f40d"}.fa-rocketchat:before{content:"\f3e8"}.fa-vk:before{content:"\f189"}.fa-untappd:before{content:"\f405"}.fa-mailchimp:before{content:"\f59e"}.fa-css3-alt:before{content:"\f38b"}.fa-reddit-square:before,.fa-square-reddit:before{content:"\f1a2"}.fa-vimeo-v:before{content:"\f27d"}.fa-contao:before{content:"\f26d"}.fa-square-font-awesome:before{content:"\e5ad"}.fa-deskpro:before{content:"\f38f"}.fa-sistrix:before{content:"\f3ee"}.fa-instagram-square:before,.fa-square-instagram:before{content:"\e055"}.fa-battle-net:before{content:"\f835"}.fa-the-red-yeti:before{content:"\f69d"}.fa-hacker-news-square:before,.fa-square-hacker-news:before{content:"\f3af"}.fa-edge:before{content:"\f282"}.fa-threads:before{content:"\e618"}.fa-napster:before{content:"\f3d2"}.fa-snapchat-square:before,.fa-square-snapchat:before{content:"\f2ad"}.fa-google-plus-g:before{content:"\f0d5"}.fa-artstation:before{content:"\f77a"}.fa-markdown:before{content:"\f60f"}.fa-sourcetree:before{content:"\f7d3"}.fa-google-plus:before{content:"\f2b3"}.fa-diaspora:before{content:"\f791"}.fa-foursquare:before{content:"\f180"}.fa-stack-overflow:before{content:"\f16c"}.fa-github-alt:before{content:"\f113"}.fa-phoenix-squadron:before{content:"\f511"}.fa-pagelines:before{content:"\f18c"}.fa-algolia:before{content:"\f36c"}.fa-red-river:before{content:"\f3e3"}.fa-creative-commons-sa:before{content:"\f4ef"}.fa-safari:before{content:"\f267"}.fa-google:before{content:"\f1a0"}.fa-font-awesome-alt:before,.fa-square-font-awesome-stroke:before{content:"\f35c"}.fa-atlassian:before{content:"\f77b"}.fa-linkedin-in:before{content:"\f0e1"}.fa-digital-ocean:before{content:"\f391"}.fa-nimblr:before{content:"\f5a8"}.fa-chromecast:before{content:"\f838"}.fa-evernote:before{content:"\f839"}.fa-hacker-news:before{content:"\f1d4"}.fa-creative-commons-sampling:before{content:"\f4f0"}.fa-adversal:before{content:"\f36a"}.fa-creative-commons:before{content:"\f25e"}.fa-watchman-monitoring:before{content:"\e087"}.fa-fonticons:before{content:"\f280"}.fa-weixin:before{content:"\f1d7"}.fa-shirtsinbulk:before{content:"\f214"}.fa-codepen:before{content:"\f1cb"}.fa-git-alt:before{content:"\f841"}.fa-lyft:before{content:"\f3c3"}.fa-rev:before{content:"\f5b2"}.fa-windows:before{content:"\f17a"}.fa-wizards-of-the-coast:before{content:"\f730"}.fa-square-viadeo:before,.fa-viadeo-square:before{content:"\f2aa"}.fa-meetup:before{content:"\f2e0"}.fa-centos:before{content:"\f789"}.fa-adn:before{content:"\f170"}.fa-cloudsmith:before{content:"\f384"}.fa-pied-piper-alt:before{content:"\f1a8"}.fa-dribbble-square:before,.fa-square-dribbble:before{content:"\f397"}.fa-codiepie:before{content:"\f284"}.fa-node:before{content:"\f419"}.fa-mix:before{content:"\f3cb"}.fa-steam:before{content:"\f1b6"}.fa-cc-apple-pay:before{content:"\f416"}.fa-scribd:before{content:"\f28a"}.fa-debian:before{content:"\e60b"}.fa-openid:before{content:"\f19b"}.fa-instalod:before{content:"\e081"}.fa-expeditedssl:before{content:"\f23e"}.fa-sellcast:before{content:"\f2da"}.fa-square-twitter:before,.fa-twitter-square:before{content:"\f081"}.fa-r-project:before{content:"\f4f7"}.fa-delicious:before{content:"\f1a5"}.fa-freebsd:before{content:"\f3a4"}.fa-vuejs:before{content:"\f41f"}.fa-accusoft:before{content:"\f369"}.fa-ioxhost:before{content:"\f208"}.fa-fonticons-fi:before{content:"\f3a2"}.fa-app-store:before{content:"\f36f"}.fa-cc-mastercard:before{content:"\f1f1"}.fa-itunes-note:before{content:"\f3b5"}.fa-golang:before{content:"\e40f"}.fa-kickstarter:before{content:"\f3bb"}.fa-grav:before{content:"\f2d6"}.fa-weibo:before{content:"\f18a"}.fa-uncharted:before{content:"\e084"}.fa-firstdraft:before{content:"\f3a1"}.fa-square-youtube:before,.fa-youtube-square:before{content:"\f431"}.fa-wikipedia-w:before{content:"\f266"}.fa-rendact:before,.fa-wpressr:before{content:"\f3e4"}.fa-angellist:before{content:"\f209"}.fa-galactic-republic:before{content:"\f50c"}.fa-nfc-directional:before{content:"\e530"}.fa-skype:before{content:"\f17e"}.fa-joget:before{content:"\f3b7"}.fa-fedora:before{content:"\f798"}.fa-stripe-s:before{content:"\f42a"}.fa-meta:before{content:"\e49b"}.fa-laravel:before{content:"\f3bd"}.fa-hotjar:before{content:"\f3b1"}.fa-bluetooth-b:before{content:"\f294"}.fa-sticker-mule:before{content:"\f3f7"}.fa-creative-commons-zero:before{content:"\f4f3"}.fa-hips:before{content:"\f452"}.fa-behance:before{content:"\f1b4"}.fa-reddit:before{content:"\f1a1"}.fa-discord:before{content:"\f392"}.fa-chrome:before{content:"\f268"}.fa-app-store-ios:before{content:"\f370"}.fa-cc-discover:before{content:"\f1f2"}.fa-wpbeginner:before{content:"\f297"}.fa-confluence:before{content:"\f78d"}.fa-mdb:before{content:"\f8ca"}.fa-dochub:before{content:"\f394"}.fa-accessible-icon:before{content:"\f368"}.fa-ebay:before{content:"\f4f4"}.fa-amazon:before{content:"\f270"}.fa-unsplash:before{content:"\e07c"}.fa-yarn:before{content:"\f7e3"}.fa-square-steam:before,.fa-steam-square:before{content:"\f1b7"}.fa-500px:before{content:"\f26e"}.fa-square-vimeo:before,.fa-vimeo-square:before{content:"\f194"}.fa-asymmetrik:before{content:"\f372"}.fa-font-awesome-flag:before,.fa-font-awesome-logo-full:before,.fa-font-awesome:before{content:"\f2b4"}.fa-gratipay:before{content:"\f184"}.fa-apple:before{content:"\f179"}.fa-hive:before{content:"\e07f"}.fa-gitkraken:before{content:"\f3a6"}.fa-keybase:before{content:"\f4f5"}.fa-apple-pay:before{content:"\f415"}.fa-padlet:before{content:"\e4a0"}.fa-amazon-pay:before{content:"\f42c"}.fa-github-square:before,.fa-square-github:before{content:"\f092"}.fa-stumbleupon:before{content:"\f1a4"}.fa-fedex:before{content:"\f797"}.fa-phoenix-framework:before{content:"\f3dc"}.fa-shopify:before{content:"\e057"}.fa-neos:before{content:"\f612"}.fa-square-threads:before{content:"\e619"}.fa-hackerrank:before{content:"\f5f7"}.fa-researchgate:before{content:"\f4f8"}.fa-swift:before{content:"\f8e1"}.fa-angular:before{content:"\f420"}.fa-speakap:before{content:"\f3f3"}.fa-angrycreative:before{content:"\f36e"}.fa-y-combinator:before{content:"\f23b"}.fa-empire:before{content:"\f1d1"}.fa-envira:before{content:"\f299"}.fa-gitlab-square:before,.fa-square-gitlab:before{content:"\e5ae"}.fa-studiovinari:before{content:"\f3f8"}.fa-pied-piper:before{content:"\f2ae"}.fa-wordpress:before{content:"\f19a"}.fa-product-hunt:before{content:"\f288"}.fa-firefox:before{content:"\f269"}.fa-linode:before{content:"\f2b8"}.fa-goodreads:before{content:"\f3a8"}.fa-odnoklassniki-square:before,.fa-square-odnoklassniki:before{content:"\f264"}.fa-jsfiddle:before{content:"\f1cc"}.fa-sith:before{content:"\f512"}.fa-themeisle:before{content:"\f2b2"}.fa-page4:before{content:"\f3d7"}.fa-hashnode:before{content:"\e499"}.fa-react:before{content:"\f41b"}.fa-cc-paypal:before{content:"\f1f4"}.fa-squarespace:before{content:"\f5be"}.fa-cc-stripe:before{content:"\f1f5"}.fa-creative-commons-share:before{content:"\f4f2"}.fa-bitcoin:before{content:"\f379"}.fa-keycdn:before{content:"\f3ba"}.fa-opera:before{content:"\f26a"}.fa-itch-io:before{content:"\f83a"}.fa-umbraco:before{content:"\f8e8"}.fa-galactic-senate:before{content:"\f50d"}.fa-ubuntu:before{content:"\f7df"}.fa-draft2digital:before{content:"\f396"}.fa-stripe:before{content:"\f429"}.fa-houzz:before{content:"\f27c"}.fa-gg:before{content:"\f260"}.fa-dhl:before{content:"\f790"}.fa-pinterest-square:before,.fa-square-pinterest:before{content:"\f0d3"}.fa-xing:before{content:"\f168"}.fa-blackberry:before{content:"\f37b"}.fa-creative-commons-pd:before{content:"\f4ec"}.fa-playstation:before{content:"\f3df"}.fa-quinscape:before{content:"\f459"}.fa-less:before{content:"\f41d"}.fa-blogger-b:before{content:"\f37d"}.fa-opencart:before{content:"\f23d"}.fa-vine:before{content:"\f1ca"}.fa-paypal:before{content:"\f1ed"}.fa-gitlab:before{content:"\f296"}.fa-typo3:before{content:"\f42b"}.fa-reddit-alien:before{content:"\f281"}.fa-yahoo:before{content:"\f19e"}.fa-dailymotion:before{content:"\e052"}.fa-affiliatetheme:before{content:"\f36b"}.fa-pied-piper-pp:before{content:"\f1a7"}.fa-bootstrap:before{content:"\f836"}.fa-odnoklassniki:before{content:"\f263"}.fa-nfc-symbol:before{content:"\e531"}.fa-ethereum:before{content:"\f42e"}.fa-speaker-deck:before{content:"\f83c"}.fa-creative-commons-nc-eu:before{content:"\f4e9"}.fa-patreon:before{content:"\f3d9"}.fa-avianex:before{content:"\f374"}.fa-ello:before{content:"\f5f1"}.fa-gofore:before{content:"\f3a7"}.fa-bimobject:before{content:"\f378"}.fa-facebook-f:before{content:"\f39e"}.fa-google-plus-square:before,.fa-square-google-plus:before{content:"\f0d4"}.fa-mandalorian:before{content:"\f50f"}.fa-first-order-alt:before{content:"\f50a"}.fa-osi:before{content:"\f41a"}.fa-google-wallet:before{content:"\f1ee"}.fa-d-and-d-beyond:before{content:"\f6ca"}.fa-periscope:before{content:"\f3da"}.fa-fulcrum:before{content:"\f50b"}.fa-cloudscale:before{content:"\f383"}.fa-forumbee:before{content:"\f211"}.fa-mizuni:before{content:"\f3cc"}.fa-schlix:before{content:"\f3ea"}.fa-square-xing:before,.fa-xing-square:before{content:"\f169"}.fa-bandcamp:before{content:"\f2d5"}.fa-wpforms:before{content:"\f298"}.fa-cloudversify:before{content:"\f385"}.fa-usps:before{content:"\f7e1"}.fa-megaport:before{content:"\f5a3"}.fa-magento:before{content:"\f3c4"}.fa-spotify:before{content:"\f1bc"}.fa-optin-monster:before{content:"\f23c"}.fa-fly:before{content:"\f417"}.fa-aviato:before{content:"\f421"}.fa-itunes:before{content:"\f3b4"}.fa-cuttlefish:before{content:"\f38c"}.fa-blogger:before{content:"\f37c"}.fa-flickr:before{content:"\f16e"}.fa-viber:before{content:"\f409"}.fa-soundcloud:before{content:"\f1be"}.fa-digg:before{content:"\f1a6"}.fa-tencent-weibo:before{content:"\f1d5"}.fa-symfony:before{content:"\f83d"}.fa-maxcdn:before{content:"\f136"}.fa-etsy:before{content:"\f2d7"}.fa-facebook-messenger:before{content:"\f39f"}.fa-audible:before{content:"\f373"}.fa-think-peaks:before{content:"\f731"}.fa-bilibili:before{content:"\e3d9"}.fa-erlang:before{content:"\f39d"}.fa-x-twitter:before{content:"\e61b"}.fa-cotton-bureau:before{content:"\f89e"}.fa-dashcube:before{content:"\f210"}.fa-42-group:before,.fa-innosoft:before{content:"\e080"}.fa-stack-exchange:before{content:"\f18d"}.fa-elementor:before{content:"\f430"}.fa-pied-piper-square:before,.fa-square-pied-piper:before{content:"\e01e"}.fa-creative-commons-nd:before{content:"\f4eb"}.fa-palfed:before{content:"\f3d8"}.fa-superpowers:before{content:"\f2dd"}.fa-resolving:before{content:"\f3e7"}.fa-xbox:before{content:"\f412"}.fa-searchengin:before{content:"\f3eb"}.fa-tiktok:before{content:"\e07b"}.fa-facebook-square:before,.fa-square-facebook:before{content:"\f082"}.fa-renren:before{content:"\f18b"}.fa-linux:before{content:"\f17c"}.fa-glide:before{content:"\f2a5"}.fa-linkedin:before{content:"\f08c"}.fa-hubspot:before{content:"\f3b2"}.fa-deploydog:before{content:"\f38e"}.fa-twitch:before{content:"\f1e8"}.fa-ravelry:before{content:"\f2d9"}.fa-mixer:before{content:"\e056"}.fa-lastfm-square:before,.fa-square-lastfm:before{content:"\f203"}.fa-vimeo:before{content:"\f40a"}.fa-mendeley:before{content:"\f7b3"}.fa-uniregistry:before{content:"\f404"}.fa-figma:before{content:"\f799"}.fa-creative-commons-remix:before{content:"\f4ee"}.fa-cc-amazon-pay:before{content:"\f42d"}.fa-dropbox:before{content:"\f16b"}.fa-instagram:before{content:"\f16d"}.fa-cmplid:before{content:"\e360"}.fa-facebook:before{content:"\f09a"}.fa-gripfire:before{content:"\f3ac"}.fa-jedi-order:before{content:"\f50e"}.fa-uikit:before{content:"\f403"}.fa-fort-awesome-alt:before{content:"\f3a3"}.fa-phabricator:before{content:"\f3db"}.fa-ussunnah:before{content:"\f407"}.fa-earlybirds:before{content:"\f39a"}.fa-trade-federation:before{content:"\f513"}.fa-autoprefixer:before{content:"\f41c"}.fa-whatsapp:before{content:"\f232"}.fa-slideshare:before{content:"\f1e7"}.fa-google-play:before{content:"\f3ab"}.fa-viadeo:before{content:"\f2a9"}.fa-line:before{content:"\f3c0"}.fa-google-drive:before{content:"\f3aa"}.fa-servicestack:before{content:"\f3ec"}.fa-simplybuilt:before{content:"\f215"}.fa-bitbucket:before{content:"\f171"}.fa-imdb:before{content:"\f2d8"}.fa-deezer:before{content:"\e077"}.fa-raspberry-pi:before{content:"\f7bb"}.fa-jira:before{content:"\f7b1"}.fa-docker:before{content:"\f395"}.fa-screenpal:before{content:"\e570"}.fa-bluetooth:before{content:"\f293"}.fa-gitter:before{content:"\f426"}.fa-d-and-d:before{content:"\f38d"}.fa-microblog:before{content:"\e01a"}.fa-cc-diners-club:before{content:"\f24c"}.fa-gg-circle:before{content:"\f261"}.fa-pied-piper-hat:before{content:"\f4e5"}.fa-kickstarter-k:before{content:"\f3bc"}.fa-yandex:before{content:"\f413"}.fa-readme:before{content:"\f4d5"}.fa-html5:before{content:"\f13b"}.fa-sellsy:before{content:"\f213"}.fa-sass:before{content:"\f41e"}.fa-wirsindhandwerk:before,.fa-wsh:before{content:"\e2d0"}.fa-buromobelexperte:before{content:"\f37f"}.fa-salesforce:before{content:"\f83b"}.fa-octopus-deploy:before{content:"\e082"}.fa-medapps:before{content:"\f3c6"}.fa-ns8:before{content:"\f3d5"}.fa-pinterest-p:before{content:"\f231"}.fa-apper:before{content:"\f371"}.fa-fort-awesome:before{content:"\f286"}.fa-waze:before{content:"\f83f"}.fa-cc-jcb:before{content:"\f24b"}.fa-snapchat-ghost:before,.fa-snapchat:before{content:"\f2ab"}.fa-fantasy-flight-games:before{content:"\f6dc"}.fa-rust:before{content:"\e07a"}.fa-wix:before{content:"\f5cf"}.fa-behance-square:before,.fa-square-behance:before{content:"\f1b5"}.fa-supple:before{content:"\f3f9"}.fa-rebel:before{content:"\f1d0"}.fa-css3:before{content:"\f13c"}.fa-staylinked:before{content:"\f3f5"}.fa-kaggle:before{content:"\f5fa"}.fa-space-awesome:before{content:"\e5ac"}.fa-deviantart:before{content:"\f1bd"}.fa-cpanel:before{content:"\f388"}.fa-goodreads-g:before{content:"\f3a9"}.fa-git-square:before,.fa-square-git:before{content:"\f1d2"}.fa-square-tumblr:before,.fa-tumblr-square:before{content:"\f174"}.fa-trello:before{content:"\f181"}.fa-creative-commons-nc-jp:before{content:"\f4ea"}.fa-get-pocket:before{content:"\f265"}.fa-perbyte:before{content:"\e083"}.fa-grunt:before{content:"\f3ad"}.fa-weebly:before{content:"\f5cc"}.fa-connectdevelop:before{content:"\f20e"}.fa-leanpub:before{content:"\f212"}.fa-black-tie:before{content:"\f27e"}.fa-themeco:before{content:"\f5c6"}.fa-python:before{content:"\f3e2"}.fa-android:before{content:"\f17b"}.fa-bots:before{content:"\e340"}.fa-free-code-camp:before{content:"\f2c5"}.fa-hornbill:before{content:"\f592"}.fa-js:before{content:"\f3b8"}.fa-ideal:before{content:"\e013"}.fa-git:before{content:"\f1d3"}.fa-dev:before{content:"\f6cc"}.fa-sketch:before{content:"\f7c6"}.fa-yandex-international:before{content:"\f414"}.fa-cc-amex:before{content:"\f1f3"}.fa-uber:before{content:"\f402"}.fa-github:before{content:"\f09b"}.fa-php:before{content:"\f457"}.fa-alipay:before{content:"\f642"}.fa-youtube:before{content:"\f167"}.fa-skyatlas:before{content:"\f216"}.fa-firefox-browser:before{content:"\e007"}.fa-replyd:before{content:"\f3e6"}.fa-suse:before{content:"\f7d6"}.fa-jenkins:before{content:"\f3b6"}.fa-twitter:before{content:"\f099"}.fa-rockrms:before{content:"\f3e9"}.fa-pinterest:before{content:"\f0d2"}.fa-buffer:before{content:"\f837"}.fa-npm:before{content:"\f3d4"}.fa-yammer:before{content:"\f840"}.fa-btc:before{content:"\f15a"}.fa-dribbble:before{content:"\f17d"}.fa-stumbleupon-circle:before{content:"\f1a3"}.fa-internet-explorer:before{content:"\f26b"}.fa-stubber:before{content:"\e5c7"}.fa-telegram-plane:before,.fa-telegram:before{content:"\f2c6"}.fa-old-republic:before{content:"\f510"}.fa-odysee:before{content:"\e5c6"}.fa-square-whatsapp:before,.fa-whatsapp-square:before{content:"\f40c"}.fa-node-js:before{content:"\f3d3"}.fa-edge-legacy:before{content:"\e078"}.fa-slack-hash:before,.fa-slack:before{content:"\f198"}.fa-medrt:before{content:"\f3c8"}.fa-usb:before{content:"\f287"}.fa-tumblr:before{content:"\f173"}.fa-vaadin:before{content:"\f408"}.fa-quora:before{content:"\f2c4"}.fa-square-x-twitter:before{content:"\e61a"}.fa-reacteurope:before{content:"\f75d"}.fa-medium-m:before,.fa-medium:before{content:"\f23a"}.fa-amilia:before{content:"\f36d"}.fa-mixcloud:before{content:"\f289"}.fa-flipboard:before{content:"\f44d"}.fa-viacoin:before{content:"\f237"}.fa-critical-role:before{content:"\f6c9"}.fa-sitrox:before{content:"\e44a"}.fa-discourse:before{content:"\f393"}.fa-joomla:before{content:"\f1aa"}.fa-mastodon:before{content:"\f4f6"}.fa-airbnb:before{content:"\f834"}.fa-wolf-pack-battalion:before{content:"\f514"}.fa-buy-n-large:before{content:"\f8a6"}.fa-gulp:before{content:"\f3ae"}.fa-creative-commons-sampling-plus:before{content:"\f4f1"}.fa-strava:before{content:"\f428"}.fa-ember:before{content:"\f423"}.fa-canadian-maple-leaf:before{content:"\f785"}.fa-teamspeak:before{content:"\f4f9"}.fa-pushed:before{content:"\f3e1"}.fa-wordpress-simple:before{content:"\f411"}.fa-nutritionix:before{content:"\f3d6"}.fa-wodu:before{content:"\e088"}.fa-google-pay:before{content:"\e079"}.fa-intercom:before{content:"\f7af"}.fa-zhihu:before{content:"\f63f"}.fa-korvue:before{content:"\f42f"}.fa-pix:before{content:"\e43a"}.fa-steam-symbol:before{content:"\f3f6"}:host,:root{--fa-font-regular:normal 400 1em/1 "Font Awesome 6 Free"}@font-face{font-family:"Font Awesome 6 Free";font-style:normal;font-weight:400;font-display:block;src: url("../webfonts/fa-regular-400.woff2") format("woff2"), url("../webfonts/fa-regular-400.ttf") format("truetype"); }.fa-regular,.far{font-weight:400}:host,:root{--fa-style-family-classic:"Font Awesome 6 Free";--fa-font-solid:normal 900 1em/1 "Font Awesome 6 Free"}@font-face{font-family:"Font Awesome 6 Free";font-style:normal;font-weight:900;font-display:block;src: url("../webfonts/fa-solid-900.woff2") format("woff2"), url("../webfonts/fa-solid-900.ttf") format("truetype"); }.fa-solid,.fas{font-weight:900}@font-face{font-family:"Font Awesome 5 Brands";font-display:block;font-weight:400;src: url("../webfonts/fa-brands-400.woff2") format("woff2"), url("../webfonts/fa-brands-400.ttf") format("truetype"); }@font-face{font-family:"Font Awesome 5 Free";font-display:block;font-weight:900;src: url("../webfonts/fa-solid-900.woff2") format("woff2"), url("../webfonts/fa-solid-900.ttf") format("truetype"); }@font-face{font-family:"Font Awesome 5 Free";font-display:block;font-weight:400;src: url("../webfonts/fa-regular-400.woff2") format("woff2"), url("../webfonts/fa-regular-400.ttf") format("truetype"); }@font-face{font-family:"FontAwesome";font-display:block;src: url("../webfonts/fa-solid-900.woff2") format("woff2"), url("../webfonts/fa-solid-900.ttf") format("truetype"); }@font-face{font-family:"FontAwesome";font-display:block;src: url("../webfonts/fa-brands-400.woff2") format("woff2"), url("../webfonts/fa-brands-400.ttf") format("truetype"); }@font-face{font-family:"FontAwesome";font-display:block;src: url("../webfonts/fa-regular-400.woff2") format("woff2"), url("../webfonts/fa-regular-400.ttf") format("truetype"); }@font-face{font-family:"FontAwesome";font-display:block;src: url("../webfonts/fa-v4compatibility.woff2") format("woff2"), url("../webfonts/fa-v4compatibility.ttf") format("truetype"); }
\ No newline at end of file
diff --git a/dev/deps/font-awesome-6.4.2/css/v4-shims.css b/dev/deps/font-awesome-6.4.2/css/v4-shims.css
new file mode 100644
index 000000000..a85953d17
--- /dev/null
+++ b/dev/deps/font-awesome-6.4.2/css/v4-shims.css
@@ -0,0 +1,2194 @@
+/*!
+ * Font Awesome Free 6.4.2 by @fontawesome - https://fontawesome.com
+ * License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License)
+ * Copyright 2023 Fonticons, Inc.
+ */
+.fa.fa-glass:before {
+  content: "\f000"; }
+
+.fa.fa-envelope-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-envelope-o:before {
+  content: "\f0e0"; }
+
+.fa.fa-star-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-star-o:before {
+  content: "\f005"; }
+
+.fa.fa-remove:before {
+  content: "\f00d"; }
+
+.fa.fa-close:before {
+  content: "\f00d"; }
+
+.fa.fa-gear:before {
+  content: "\f013"; }
+
+.fa.fa-trash-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-trash-o:before {
+  content: "\f2ed"; }
+
+.fa.fa-home:before {
+  content: "\f015"; }
+
+.fa.fa-file-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-file-o:before {
+  content: "\f15b"; }
+
+.fa.fa-clock-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-clock-o:before {
+  content: "\f017"; }
+
+.fa.fa-arrow-circle-o-down {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-arrow-circle-o-down:before {
+  content: "\f358"; }
+
+.fa.fa-arrow-circle-o-up {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-arrow-circle-o-up:before {
+  content: "\f35b"; }
+
+.fa.fa-play-circle-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-play-circle-o:before {
+  content: "\f144"; }
+
+.fa.fa-repeat:before {
+  content: "\f01e"; }
+
+.fa.fa-rotate-right:before {
+  content: "\f01e"; }
+
+.fa.fa-refresh:before {
+  content: "\f021"; }
+
+.fa.fa-list-alt {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-list-alt:before {
+  content: "\f022"; }
+
+.fa.fa-dedent:before {
+  content: "\f03b"; }
+
+.fa.fa-video-camera:before {
+  content: "\f03d"; }
+
+.fa.fa-picture-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-picture-o:before {
+  content: "\f03e"; }
+
+.fa.fa-photo {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-photo:before {
+  content: "\f03e"; }
+
+.fa.fa-image {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-image:before {
+  content: "\f03e"; }
+
+.fa.fa-map-marker:before {
+  content: "\f3c5"; }
+
+.fa.fa-pencil-square-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-pencil-square-o:before {
+  content: "\f044"; }
+
+.fa.fa-edit {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-edit:before {
+  content: "\f044"; }
+
+.fa.fa-share-square-o:before {
+  content: "\f14d"; }
+
+.fa.fa-check-square-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-check-square-o:before {
+  content: "\f14a"; }
+
+.fa.fa-arrows:before {
+  content: "\f0b2"; }
+
+.fa.fa-times-circle-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-times-circle-o:before {
+  content: "\f057"; }
+
+.fa.fa-check-circle-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-check-circle-o:before {
+  content: "\f058"; }
+
+.fa.fa-mail-forward:before {
+  content: "\f064"; }
+
+.fa.fa-expand:before {
+  content: "\f424"; }
+
+.fa.fa-compress:before {
+  content: "\f422"; }
+
+.fa.fa-eye {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-eye-slash {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-warning:before {
+  content: "\f071"; }
+
+.fa.fa-calendar:before {
+  content: "\f073"; }
+
+.fa.fa-arrows-v:before {
+  content: "\f338"; }
+
+.fa.fa-arrows-h:before {
+  content: "\f337"; }
+
+.fa.fa-bar-chart:before {
+  content: "\e0e3"; }
+
+.fa.fa-bar-chart-o:before {
+  content: "\e0e3"; }
+
+.fa.fa-twitter-square {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-twitter-square:before {
+  content: "\f081"; }
+
+.fa.fa-facebook-square {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-facebook-square:before {
+  content: "\f082"; }
+
+.fa.fa-gears:before {
+  content: "\f085"; }
+
+.fa.fa-thumbs-o-up {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-thumbs-o-up:before {
+  content: "\f164"; }
+
+.fa.fa-thumbs-o-down {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-thumbs-o-down:before {
+  content: "\f165"; }
+
+.fa.fa-heart-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-heart-o:before {
+  content: "\f004"; }
+
+.fa.fa-sign-out:before {
+  content: "\f2f5"; }
+
+.fa.fa-linkedin-square {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-linkedin-square:before {
+  content: "\f08c"; }
+
+.fa.fa-thumb-tack:before {
+  content: "\f08d"; }
+
+.fa.fa-external-link:before {
+  content: "\f35d"; }
+
+.fa.fa-sign-in:before {
+  content: "\f2f6"; }
+
+.fa.fa-github-square {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-github-square:before {
+  content: "\f092"; }
+
+.fa.fa-lemon-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-lemon-o:before {
+  content: "\f094"; }
+
+.fa.fa-square-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-square-o:before {
+  content: "\f0c8"; }
+
+.fa.fa-bookmark-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-bookmark-o:before {
+  content: "\f02e"; }
+
+.fa.fa-twitter {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-facebook {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-facebook:before {
+  content: "\f39e"; }
+
+.fa.fa-facebook-f {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-facebook-f:before {
+  content: "\f39e"; }
+
+.fa.fa-github {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-credit-card {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-feed:before {
+  content: "\f09e"; }
+
+.fa.fa-hdd-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-hdd-o:before {
+  content: "\f0a0"; }
+
+.fa.fa-hand-o-right {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-hand-o-right:before {
+  content: "\f0a4"; }
+
+.fa.fa-hand-o-left {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-hand-o-left:before {
+  content: "\f0a5"; }
+
+.fa.fa-hand-o-up {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-hand-o-up:before {
+  content: "\f0a6"; }
+
+.fa.fa-hand-o-down {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-hand-o-down:before {
+  content: "\f0a7"; }
+
+.fa.fa-globe:before {
+  content: "\f57d"; }
+
+.fa.fa-tasks:before {
+  content: "\f828"; }
+
+.fa.fa-arrows-alt:before {
+  content: "\f31e"; }
+
+.fa.fa-group:before {
+  content: "\f0c0"; }
+
+.fa.fa-chain:before {
+  content: "\f0c1"; }
+
+.fa.fa-cut:before {
+  content: "\f0c4"; }
+
+.fa.fa-files-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-files-o:before {
+  content: "\f0c5"; }
+
+.fa.fa-floppy-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-floppy-o:before {
+  content: "\f0c7"; }
+
+.fa.fa-save {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-save:before {
+  content: "\f0c7"; }
+
+.fa.fa-navicon:before {
+  content: "\f0c9"; }
+
+.fa.fa-reorder:before {
+  content: "\f0c9"; }
+
+.fa.fa-magic:before {
+  content: "\e2ca"; }
+
+.fa.fa-pinterest {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-pinterest-square {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-pinterest-square:before {
+  content: "\f0d3"; }
+
+.fa.fa-google-plus-square {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-google-plus-square:before {
+  content: "\f0d4"; }
+
+.fa.fa-google-plus {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-google-plus:before {
+  content: "\f0d5"; }
+
+.fa.fa-money:before {
+  content: "\f3d1"; }
+
+.fa.fa-unsorted:before {
+  content: "\f0dc"; }
+
+.fa.fa-sort-desc:before {
+  content: "\f0dd"; }
+
+.fa.fa-sort-asc:before {
+  content: "\f0de"; }
+
+.fa.fa-linkedin {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-linkedin:before {
+  content: "\f0e1"; }
+
+.fa.fa-rotate-left:before {
+  content: "\f0e2"; }
+
+.fa.fa-legal:before {
+  content: "\f0e3"; }
+
+.fa.fa-tachometer:before {
+  content: "\f625"; }
+
+.fa.fa-dashboard:before {
+  content: "\f625"; }
+
+.fa.fa-comment-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-comment-o:before {
+  content: "\f075"; }
+
+.fa.fa-comments-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-comments-o:before {
+  content: "\f086"; }
+
+.fa.fa-flash:before {
+  content: "\f0e7"; }
+
+.fa.fa-clipboard:before {
+  content: "\f0ea"; }
+
+.fa.fa-lightbulb-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-lightbulb-o:before {
+  content: "\f0eb"; }
+
+.fa.fa-exchange:before {
+  content: "\f362"; }
+
+.fa.fa-cloud-download:before {
+  content: "\f0ed"; }
+
+.fa.fa-cloud-upload:before {
+  content: "\f0ee"; }
+
+.fa.fa-bell-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-bell-o:before {
+  content: "\f0f3"; }
+
+.fa.fa-cutlery:before {
+  content: "\f2e7"; }
+
+.fa.fa-file-text-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-file-text-o:before {
+  content: "\f15c"; }
+
+.fa.fa-building-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-building-o:before {
+  content: "\f1ad"; }
+
+.fa.fa-hospital-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-hospital-o:before {
+  content: "\f0f8"; }
+
+.fa.fa-tablet:before {
+  content: "\f3fa"; }
+
+.fa.fa-mobile:before {
+  content: "\f3cd"; }
+
+.fa.fa-mobile-phone:before {
+  content: "\f3cd"; }
+
+.fa.fa-circle-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-circle-o:before {
+  content: "\f111"; }
+
+.fa.fa-mail-reply:before {
+  content: "\f3e5"; }
+
+.fa.fa-github-alt {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-folder-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-folder-o:before {
+  content: "\f07b"; }
+
+.fa.fa-folder-open-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-folder-open-o:before {
+  content: "\f07c"; }
+
+.fa.fa-smile-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-smile-o:before {
+  content: "\f118"; }
+
+.fa.fa-frown-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-frown-o:before {
+  content: "\f119"; }
+
+.fa.fa-meh-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-meh-o:before {
+  content: "\f11a"; }
+
+.fa.fa-keyboard-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-keyboard-o:before {
+  content: "\f11c"; }
+
+.fa.fa-flag-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-flag-o:before {
+  content: "\f024"; }
+
+.fa.fa-mail-reply-all:before {
+  content: "\f122"; }
+
+.fa.fa-star-half-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-star-half-o:before {
+  content: "\f5c0"; }
+
+.fa.fa-star-half-empty {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-star-half-empty:before {
+  content: "\f5c0"; }
+
+.fa.fa-star-half-full {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-star-half-full:before {
+  content: "\f5c0"; }
+
+.fa.fa-code-fork:before {
+  content: "\f126"; }
+
+.fa.fa-chain-broken:before {
+  content: "\f127"; }
+
+.fa.fa-unlink:before {
+  content: "\f127"; }
+
+.fa.fa-calendar-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-calendar-o:before {
+  content: "\f133"; }
+
+.fa.fa-maxcdn {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-html5 {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-css3 {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-unlock-alt:before {
+  content: "\f09c"; }
+
+.fa.fa-minus-square-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-minus-square-o:before {
+  content: "\f146"; }
+
+.fa.fa-level-up:before {
+  content: "\f3bf"; }
+
+.fa.fa-level-down:before {
+  content: "\f3be"; }
+
+.fa.fa-pencil-square:before {
+  content: "\f14b"; }
+
+.fa.fa-external-link-square:before {
+  content: "\f360"; }
+
+.fa.fa-compass {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-caret-square-o-down {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-caret-square-o-down:before {
+  content: "\f150"; }
+
+.fa.fa-toggle-down {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-toggle-down:before {
+  content: "\f150"; }
+
+.fa.fa-caret-square-o-up {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-caret-square-o-up:before {
+  content: "\f151"; }
+
+.fa.fa-toggle-up {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-toggle-up:before {
+  content: "\f151"; }
+
+.fa.fa-caret-square-o-right {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-caret-square-o-right:before {
+  content: "\f152"; }
+
+.fa.fa-toggle-right {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-toggle-right:before {
+  content: "\f152"; }
+
+.fa.fa-eur:before {
+  content: "\f153"; }
+
+.fa.fa-euro:before {
+  content: "\f153"; }
+
+.fa.fa-gbp:before {
+  content: "\f154"; }
+
+.fa.fa-usd:before {
+  content: "\24"; }
+
+.fa.fa-dollar:before {
+  content: "\24"; }
+
+.fa.fa-inr:before {
+  content: "\e1bc"; }
+
+.fa.fa-rupee:before {
+  content: "\e1bc"; }
+
+.fa.fa-jpy:before {
+  content: "\f157"; }
+
+.fa.fa-cny:before {
+  content: "\f157"; }
+
+.fa.fa-rmb:before {
+  content: "\f157"; }
+
+.fa.fa-yen:before {
+  content: "\f157"; }
+
+.fa.fa-rub:before {
+  content: "\f158"; }
+
+.fa.fa-ruble:before {
+  content: "\f158"; }
+
+.fa.fa-rouble:before {
+  content: "\f158"; }
+
+.fa.fa-krw:before {
+  content: "\f159"; }
+
+.fa.fa-won:before {
+  content: "\f159"; }
+
+.fa.fa-btc {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-bitcoin {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-bitcoin:before {
+  content: "\f15a"; }
+
+.fa.fa-file-text:before {
+  content: "\f15c"; }
+
+.fa.fa-sort-alpha-asc:before {
+  content: "\f15d"; }
+
+.fa.fa-sort-alpha-desc:before {
+  content: "\f881"; }
+
+.fa.fa-sort-amount-asc:before {
+  content: "\f884"; }
+
+.fa.fa-sort-amount-desc:before {
+  content: "\f160"; }
+
+.fa.fa-sort-numeric-asc:before {
+  content: "\f162"; }
+
+.fa.fa-sort-numeric-desc:before {
+  content: "\f886"; }
+
+.fa.fa-youtube-square {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-youtube-square:before {
+  content: "\f431"; }
+
+.fa.fa-youtube {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-xing {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-xing-square {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-xing-square:before {
+  content: "\f169"; }
+
+.fa.fa-youtube-play {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-youtube-play:before {
+  content: "\f167"; }
+
+.fa.fa-dropbox {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-stack-overflow {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-instagram {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-flickr {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-adn {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-bitbucket {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-bitbucket-square {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-bitbucket-square:before {
+  content: "\f171"; }
+
+.fa.fa-tumblr {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-tumblr-square {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-tumblr-square:before {
+  content: "\f174"; }
+
+.fa.fa-long-arrow-down:before {
+  content: "\f309"; }
+
+.fa.fa-long-arrow-up:before {
+  content: "\f30c"; }
+
+.fa.fa-long-arrow-left:before {
+  content: "\f30a"; }
+
+.fa.fa-long-arrow-right:before {
+  content: "\f30b"; }
+
+.fa.fa-apple {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-windows {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-android {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-linux {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-dribbble {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-skype {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-foursquare {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-trello {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-gratipay {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-gittip {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-gittip:before {
+  content: "\f184"; }
+
+.fa.fa-sun-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-sun-o:before {
+  content: "\f185"; }
+
+.fa.fa-moon-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-moon-o:before {
+  content: "\f186"; }
+
+.fa.fa-vk {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-weibo {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-renren {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-pagelines {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-stack-exchange {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-arrow-circle-o-right {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-arrow-circle-o-right:before {
+  content: "\f35a"; }
+
+.fa.fa-arrow-circle-o-left {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-arrow-circle-o-left:before {
+  content: "\f359"; }
+
+.fa.fa-caret-square-o-left {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-caret-square-o-left:before {
+  content: "\f191"; }
+
+.fa.fa-toggle-left {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-toggle-left:before {
+  content: "\f191"; }
+
+.fa.fa-dot-circle-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-dot-circle-o:before {
+  content: "\f192"; }
+
+.fa.fa-vimeo-square {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-vimeo-square:before {
+  content: "\f194"; }
+
+.fa.fa-try:before {
+  content: "\e2bb"; }
+
+.fa.fa-turkish-lira:before {
+  content: "\e2bb"; }
+
+.fa.fa-plus-square-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-plus-square-o:before {
+  content: "\f0fe"; }
+
+.fa.fa-slack {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-wordpress {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-openid {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-institution:before {
+  content: "\f19c"; }
+
+.fa.fa-bank:before {
+  content: "\f19c"; }
+
+.fa.fa-mortar-board:before {
+  content: "\f19d"; }
+
+.fa.fa-yahoo {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-google {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-reddit {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-reddit-square {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-reddit-square:before {
+  content: "\f1a2"; }
+
+.fa.fa-stumbleupon-circle {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-stumbleupon {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-delicious {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-digg {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-pied-piper-pp {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-pied-piper-alt {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-drupal {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-joomla {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-behance {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-behance-square {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-behance-square:before {
+  content: "\f1b5"; }
+
+.fa.fa-steam {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-steam-square {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-steam-square:before {
+  content: "\f1b7"; }
+
+.fa.fa-automobile:before {
+  content: "\f1b9"; }
+
+.fa.fa-cab:before {
+  content: "\f1ba"; }
+
+.fa.fa-spotify {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-deviantart {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-soundcloud {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-file-pdf-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-file-pdf-o:before {
+  content: "\f1c1"; }
+
+.fa.fa-file-word-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-file-word-o:before {
+  content: "\f1c2"; }
+
+.fa.fa-file-excel-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-file-excel-o:before {
+  content: "\f1c3"; }
+
+.fa.fa-file-powerpoint-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-file-powerpoint-o:before {
+  content: "\f1c4"; }
+
+.fa.fa-file-image-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-file-image-o:before {
+  content: "\f1c5"; }
+
+.fa.fa-file-photo-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-file-photo-o:before {
+  content: "\f1c5"; }
+
+.fa.fa-file-picture-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-file-picture-o:before {
+  content: "\f1c5"; }
+
+.fa.fa-file-archive-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-file-archive-o:before {
+  content: "\f1c6"; }
+
+.fa.fa-file-zip-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-file-zip-o:before {
+  content: "\f1c6"; }
+
+.fa.fa-file-audio-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-file-audio-o:before {
+  content: "\f1c7"; }
+
+.fa.fa-file-sound-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-file-sound-o:before {
+  content: "\f1c7"; }
+
+.fa.fa-file-video-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-file-video-o:before {
+  content: "\f1c8"; }
+
+.fa.fa-file-movie-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-file-movie-o:before {
+  content: "\f1c8"; }
+
+.fa.fa-file-code-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-file-code-o:before {
+  content: "\f1c9"; }
+
+.fa.fa-vine {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-codepen {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-jsfiddle {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-life-bouy:before {
+  content: "\f1cd"; }
+
+.fa.fa-life-buoy:before {
+  content: "\f1cd"; }
+
+.fa.fa-life-saver:before {
+  content: "\f1cd"; }
+
+.fa.fa-support:before {
+  content: "\f1cd"; }
+
+.fa.fa-circle-o-notch:before {
+  content: "\f1ce"; }
+
+.fa.fa-rebel {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-ra {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-ra:before {
+  content: "\f1d0"; }
+
+.fa.fa-resistance {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-resistance:before {
+  content: "\f1d0"; }
+
+.fa.fa-empire {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-ge {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-ge:before {
+  content: "\f1d1"; }
+
+.fa.fa-git-square {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-git-square:before {
+  content: "\f1d2"; }
+
+.fa.fa-git {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-hacker-news {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-y-combinator-square {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-y-combinator-square:before {
+  content: "\f1d4"; }
+
+.fa.fa-yc-square {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-yc-square:before {
+  content: "\f1d4"; }
+
+.fa.fa-tencent-weibo {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-qq {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-weixin {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-wechat {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-wechat:before {
+  content: "\f1d7"; }
+
+.fa.fa-send:before {
+  content: "\f1d8"; }
+
+.fa.fa-paper-plane-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-paper-plane-o:before {
+  content: "\f1d8"; }
+
+.fa.fa-send-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-send-o:before {
+  content: "\f1d8"; }
+
+.fa.fa-circle-thin {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-circle-thin:before {
+  content: "\f111"; }
+
+.fa.fa-header:before {
+  content: "\f1dc"; }
+
+.fa.fa-futbol-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-futbol-o:before {
+  content: "\f1e3"; }
+
+.fa.fa-soccer-ball-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-soccer-ball-o:before {
+  content: "\f1e3"; }
+
+.fa.fa-slideshare {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-twitch {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-yelp {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-newspaper-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-newspaper-o:before {
+  content: "\f1ea"; }
+
+.fa.fa-paypal {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-google-wallet {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-cc-visa {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-cc-mastercard {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-cc-discover {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-cc-amex {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-cc-paypal {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-cc-stripe {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-bell-slash-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-bell-slash-o:before {
+  content: "\f1f6"; }
+
+.fa.fa-trash:before {
+  content: "\f2ed"; }
+
+.fa.fa-copyright {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-eyedropper:before {
+  content: "\f1fb"; }
+
+.fa.fa-area-chart:before {
+  content: "\f1fe"; }
+
+.fa.fa-pie-chart:before {
+  content: "\f200"; }
+
+.fa.fa-line-chart:before {
+  content: "\f201"; }
+
+.fa.fa-lastfm {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-lastfm-square {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-lastfm-square:before {
+  content: "\f203"; }
+
+.fa.fa-ioxhost {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-angellist {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-cc {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-cc:before {
+  content: "\f20a"; }
+
+.fa.fa-ils:before {
+  content: "\f20b"; }
+
+.fa.fa-shekel:before {
+  content: "\f20b"; }
+
+.fa.fa-sheqel:before {
+  content: "\f20b"; }
+
+.fa.fa-buysellads {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-connectdevelop {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-dashcube {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-forumbee {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-leanpub {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-sellsy {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-shirtsinbulk {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-simplybuilt {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-skyatlas {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-diamond {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-diamond:before {
+  content: "\f3a5"; }
+
+.fa.fa-transgender:before {
+  content: "\f224"; }
+
+.fa.fa-intersex:before {
+  content: "\f224"; }
+
+.fa.fa-transgender-alt:before {
+  content: "\f225"; }
+
+.fa.fa-facebook-official {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-facebook-official:before {
+  content: "\f09a"; }
+
+.fa.fa-pinterest-p {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-whatsapp {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-hotel:before {
+  content: "\f236"; }
+
+.fa.fa-viacoin {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-medium {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-y-combinator {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-yc {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-yc:before {
+  content: "\f23b"; }
+
+.fa.fa-optin-monster {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-opencart {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-expeditedssl {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-battery-4:before {
+  content: "\f240"; }
+
+.fa.fa-battery:before {
+  content: "\f240"; }
+
+.fa.fa-battery-3:before {
+  content: "\f241"; }
+
+.fa.fa-battery-2:before {
+  content: "\f242"; }
+
+.fa.fa-battery-1:before {
+  content: "\f243"; }
+
+.fa.fa-battery-0:before {
+  content: "\f244"; }
+
+.fa.fa-object-group {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-object-ungroup {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-sticky-note-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-sticky-note-o:before {
+  content: "\f249"; }
+
+.fa.fa-cc-jcb {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-cc-diners-club {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-clone {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-hourglass-o:before {
+  content: "\f254"; }
+
+.fa.fa-hourglass-1:before {
+  content: "\f251"; }
+
+.fa.fa-hourglass-2:before {
+  content: "\f252"; }
+
+.fa.fa-hourglass-3:before {
+  content: "\f253"; }
+
+.fa.fa-hand-rock-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-hand-rock-o:before {
+  content: "\f255"; }
+
+.fa.fa-hand-grab-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-hand-grab-o:before {
+  content: "\f255"; }
+
+.fa.fa-hand-paper-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-hand-paper-o:before {
+  content: "\f256"; }
+
+.fa.fa-hand-stop-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-hand-stop-o:before {
+  content: "\f256"; }
+
+.fa.fa-hand-scissors-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-hand-scissors-o:before {
+  content: "\f257"; }
+
+.fa.fa-hand-lizard-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-hand-lizard-o:before {
+  content: "\f258"; }
+
+.fa.fa-hand-spock-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-hand-spock-o:before {
+  content: "\f259"; }
+
+.fa.fa-hand-pointer-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-hand-pointer-o:before {
+  content: "\f25a"; }
+
+.fa.fa-hand-peace-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-hand-peace-o:before {
+  content: "\f25b"; }
+
+.fa.fa-registered {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-creative-commons {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-gg {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-gg-circle {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-odnoklassniki {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-odnoklassniki-square {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-odnoklassniki-square:before {
+  content: "\f264"; }
+
+.fa.fa-get-pocket {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-wikipedia-w {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-safari {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-chrome {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-firefox {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-opera {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-internet-explorer {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-television:before {
+  content: "\f26c"; }
+
+.fa.fa-contao {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-500px {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-amazon {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-calendar-plus-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-calendar-plus-o:before {
+  content: "\f271"; }
+
+.fa.fa-calendar-minus-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-calendar-minus-o:before {
+  content: "\f272"; }
+
+.fa.fa-calendar-times-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-calendar-times-o:before {
+  content: "\f273"; }
+
+.fa.fa-calendar-check-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-calendar-check-o:before {
+  content: "\f274"; }
+
+.fa.fa-map-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-map-o:before {
+  content: "\f279"; }
+
+.fa.fa-commenting:before {
+  content: "\f4ad"; }
+
+.fa.fa-commenting-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-commenting-o:before {
+  content: "\f4ad"; }
+
+.fa.fa-houzz {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-vimeo {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-vimeo:before {
+  content: "\f27d"; }
+
+.fa.fa-black-tie {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-fonticons {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-reddit-alien {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-edge {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-credit-card-alt:before {
+  content: "\f09d"; }
+
+.fa.fa-codiepie {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-modx {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-fort-awesome {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-usb {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-product-hunt {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-mixcloud {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-scribd {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-pause-circle-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-pause-circle-o:before {
+  content: "\f28b"; }
+
+.fa.fa-stop-circle-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-stop-circle-o:before {
+  content: "\f28d"; }
+
+.fa.fa-bluetooth {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-bluetooth-b {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-gitlab {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-wpbeginner {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-wpforms {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-envira {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-wheelchair-alt {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-wheelchair-alt:before {
+  content: "\f368"; }
+
+.fa.fa-question-circle-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-question-circle-o:before {
+  content: "\f059"; }
+
+.fa.fa-volume-control-phone:before {
+  content: "\f2a0"; }
+
+.fa.fa-asl-interpreting:before {
+  content: "\f2a3"; }
+
+.fa.fa-deafness:before {
+  content: "\f2a4"; }
+
+.fa.fa-hard-of-hearing:before {
+  content: "\f2a4"; }
+
+.fa.fa-glide {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-glide-g {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-signing:before {
+  content: "\f2a7"; }
+
+.fa.fa-viadeo {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-viadeo-square {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-viadeo-square:before {
+  content: "\f2aa"; }
+
+.fa.fa-snapchat {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-snapchat-ghost {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-snapchat-ghost:before {
+  content: "\f2ab"; }
+
+.fa.fa-snapchat-square {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-snapchat-square:before {
+  content: "\f2ad"; }
+
+.fa.fa-pied-piper {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-first-order {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-yoast {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-themeisle {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-google-plus-official {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-google-plus-official:before {
+  content: "\f2b3"; }
+
+.fa.fa-google-plus-circle {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-google-plus-circle:before {
+  content: "\f2b3"; }
+
+.fa.fa-font-awesome {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-fa {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-fa:before {
+  content: "\f2b4"; }
+
+.fa.fa-handshake-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-handshake-o:before {
+  content: "\f2b5"; }
+
+.fa.fa-envelope-open-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-envelope-open-o:before {
+  content: "\f2b6"; }
+
+.fa.fa-linode {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-address-book-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-address-book-o:before {
+  content: "\f2b9"; }
+
+.fa.fa-vcard:before {
+  content: "\f2bb"; }
+
+.fa.fa-address-card-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-address-card-o:before {
+  content: "\f2bb"; }
+
+.fa.fa-vcard-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-vcard-o:before {
+  content: "\f2bb"; }
+
+.fa.fa-user-circle-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-user-circle-o:before {
+  content: "\f2bd"; }
+
+.fa.fa-user-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-user-o:before {
+  content: "\f007"; }
+
+.fa.fa-id-badge {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-drivers-license:before {
+  content: "\f2c2"; }
+
+.fa.fa-id-card-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-id-card-o:before {
+  content: "\f2c2"; }
+
+.fa.fa-drivers-license-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-drivers-license-o:before {
+  content: "\f2c2"; }
+
+.fa.fa-quora {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-free-code-camp {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-telegram {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-thermometer-4:before {
+  content: "\f2c7"; }
+
+.fa.fa-thermometer:before {
+  content: "\f2c7"; }
+
+.fa.fa-thermometer-3:before {
+  content: "\f2c8"; }
+
+.fa.fa-thermometer-2:before {
+  content: "\f2c9"; }
+
+.fa.fa-thermometer-1:before {
+  content: "\f2ca"; }
+
+.fa.fa-thermometer-0:before {
+  content: "\f2cb"; }
+
+.fa.fa-bathtub:before {
+  content: "\f2cd"; }
+
+.fa.fa-s15:before {
+  content: "\f2cd"; }
+
+.fa.fa-window-maximize {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-window-restore {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-times-rectangle:before {
+  content: "\f410"; }
+
+.fa.fa-window-close-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-window-close-o:before {
+  content: "\f410"; }
+
+.fa.fa-times-rectangle-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-times-rectangle-o:before {
+  content: "\f410"; }
+
+.fa.fa-bandcamp {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-grav {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-etsy {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-imdb {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-ravelry {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-eercast {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-eercast:before {
+  content: "\f2da"; }
+
+.fa.fa-snowflake-o {
+  font-family: 'Font Awesome 6 Free';
+  font-weight: 400; }
+
+.fa.fa-snowflake-o:before {
+  content: "\f2dc"; }
+
+.fa.fa-superpowers {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-wpexplorer {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
+
+.fa.fa-meetup {
+  font-family: 'Font Awesome 6 Brands';
+  font-weight: 400; }
diff --git a/dev/deps/font-awesome-6.4.2/css/v4-shims.min.css b/dev/deps/font-awesome-6.4.2/css/v4-shims.min.css
new file mode 100644
index 000000000..64e4e8d83
--- /dev/null
+++ b/dev/deps/font-awesome-6.4.2/css/v4-shims.min.css
@@ -0,0 +1,6 @@
+/*!
+ * Font Awesome Free 6.4.2 by @fontawesome - https://fontawesome.com
+ * License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License)
+ * Copyright 2023 Fonticons, Inc.
+ */
+.fa.fa-glass:before{content:"\f000"}.fa.fa-envelope-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-envelope-o:before{content:"\f0e0"}.fa.fa-star-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-star-o:before{content:"\f005"}.fa.fa-close:before,.fa.fa-remove:before{content:"\f00d"}.fa.fa-gear:before{content:"\f013"}.fa.fa-trash-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-trash-o:before{content:"\f2ed"}.fa.fa-home:before{content:"\f015"}.fa.fa-file-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-file-o:before{content:"\f15b"}.fa.fa-clock-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-clock-o:before{content:"\f017"}.fa.fa-arrow-circle-o-down{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-arrow-circle-o-down:before{content:"\f358"}.fa.fa-arrow-circle-o-up{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-arrow-circle-o-up:before{content:"\f35b"}.fa.fa-play-circle-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-play-circle-o:before{content:"\f144"}.fa.fa-repeat:before,.fa.fa-rotate-right:before{content:"\f01e"}.fa.fa-refresh:before{content:"\f021"}.fa.fa-list-alt{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-list-alt:before{content:"\f022"}.fa.fa-dedent:before{content:"\f03b"}.fa.fa-video-camera:before{content:"\f03d"}.fa.fa-picture-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-picture-o:before{content:"\f03e"}.fa.fa-photo{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-photo:before{content:"\f03e"}.fa.fa-image{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-image:before{content:"\f03e"}.fa.fa-map-marker:before{content:"\f3c5"}.fa.fa-pencil-square-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-pencil-square-o:before{content:"\f044"}.fa.fa-edit{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-edit:before{content:"\f044"}.fa.fa-share-square-o:before{content:"\f14d"}.fa.fa-check-square-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-check-square-o:before{content:"\f14a"}.fa.fa-arrows:before{content:"\f0b2"}.fa.fa-times-circle-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-times-circle-o:before{content:"\f057"}.fa.fa-check-circle-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-check-circle-o:before{content:"\f058"}.fa.fa-mail-forward:before{content:"\f064"}.fa.fa-expand:before{content:"\f424"}.fa.fa-compress:before{content:"\f422"}.fa.fa-eye,.fa.fa-eye-slash{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-warning:before{content:"\f071"}.fa.fa-calendar:before{content:"\f073"}.fa.fa-arrows-v:before{content:"\f338"}.fa.fa-arrows-h:before{content:"\f337"}.fa.fa-bar-chart-o:before,.fa.fa-bar-chart:before{content:"\e0e3"}.fa.fa-twitter-square{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-twitter-square:before{content:"\f081"}.fa.fa-facebook-square{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-facebook-square:before{content:"\f082"}.fa.fa-gears:before{content:"\f085"}.fa.fa-thumbs-o-up{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-thumbs-o-up:before{content:"\f164"}.fa.fa-thumbs-o-down{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-thumbs-o-down:before{content:"\f165"}.fa.fa-heart-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-heart-o:before{content:"\f004"}.fa.fa-sign-out:before{content:"\f2f5"}.fa.fa-linkedin-square{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-linkedin-square:before{content:"\f08c"}.fa.fa-thumb-tack:before{content:"\f08d"}.fa.fa-external-link:before{content:"\f35d"}.fa.fa-sign-in:before{content:"\f2f6"}.fa.fa-github-square{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-github-square:before{content:"\f092"}.fa.fa-lemon-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-lemon-o:before{content:"\f094"}.fa.fa-square-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-square-o:before{content:"\f0c8"}.fa.fa-bookmark-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-bookmark-o:before{content:"\f02e"}.fa.fa-facebook,.fa.fa-twitter{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-facebook:before{content:"\f39e"}.fa.fa-facebook-f{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-facebook-f:before{content:"\f39e"}.fa.fa-github{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-credit-card{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-feed:before{content:"\f09e"}.fa.fa-hdd-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-hdd-o:before{content:"\f0a0"}.fa.fa-hand-o-right{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-hand-o-right:before{content:"\f0a4"}.fa.fa-hand-o-left{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-hand-o-left:before{content:"\f0a5"}.fa.fa-hand-o-up{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-hand-o-up:before{content:"\f0a6"}.fa.fa-hand-o-down{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-hand-o-down:before{content:"\f0a7"}.fa.fa-globe:before{content:"\f57d"}.fa.fa-tasks:before{content:"\f828"}.fa.fa-arrows-alt:before{content:"\f31e"}.fa.fa-group:before{content:"\f0c0"}.fa.fa-chain:before{content:"\f0c1"}.fa.fa-cut:before{content:"\f0c4"}.fa.fa-files-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-files-o:before{content:"\f0c5"}.fa.fa-floppy-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-floppy-o:before{content:"\f0c7"}.fa.fa-save{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-save:before{content:"\f0c7"}.fa.fa-navicon:before,.fa.fa-reorder:before{content:"\f0c9"}.fa.fa-magic:before{content:"\e2ca"}.fa.fa-pinterest,.fa.fa-pinterest-square{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-pinterest-square:before{content:"\f0d3"}.fa.fa-google-plus-square{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-google-plus-square:before{content:"\f0d4"}.fa.fa-google-plus{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-google-plus:before{content:"\f0d5"}.fa.fa-money:before{content:"\f3d1"}.fa.fa-unsorted:before{content:"\f0dc"}.fa.fa-sort-desc:before{content:"\f0dd"}.fa.fa-sort-asc:before{content:"\f0de"}.fa.fa-linkedin{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-linkedin:before{content:"\f0e1"}.fa.fa-rotate-left:before{content:"\f0e2"}.fa.fa-legal:before{content:"\f0e3"}.fa.fa-dashboard:before,.fa.fa-tachometer:before{content:"\f625"}.fa.fa-comment-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-comment-o:before{content:"\f075"}.fa.fa-comments-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-comments-o:before{content:"\f086"}.fa.fa-flash:before{content:"\f0e7"}.fa.fa-clipboard:before{content:"\f0ea"}.fa.fa-lightbulb-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-lightbulb-o:before{content:"\f0eb"}.fa.fa-exchange:before{content:"\f362"}.fa.fa-cloud-download:before{content:"\f0ed"}.fa.fa-cloud-upload:before{content:"\f0ee"}.fa.fa-bell-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-bell-o:before{content:"\f0f3"}.fa.fa-cutlery:before{content:"\f2e7"}.fa.fa-file-text-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-file-text-o:before{content:"\f15c"}.fa.fa-building-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-building-o:before{content:"\f1ad"}.fa.fa-hospital-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-hospital-o:before{content:"\f0f8"}.fa.fa-tablet:before{content:"\f3fa"}.fa.fa-mobile-phone:before,.fa.fa-mobile:before{content:"\f3cd"}.fa.fa-circle-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-circle-o:before{content:"\f111"}.fa.fa-mail-reply:before{content:"\f3e5"}.fa.fa-github-alt{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-folder-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-folder-o:before{content:"\f07b"}.fa.fa-folder-open-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-folder-open-o:before{content:"\f07c"}.fa.fa-smile-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-smile-o:before{content:"\f118"}.fa.fa-frown-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-frown-o:before{content:"\f119"}.fa.fa-meh-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-meh-o:before{content:"\f11a"}.fa.fa-keyboard-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-keyboard-o:before{content:"\f11c"}.fa.fa-flag-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-flag-o:before{content:"\f024"}.fa.fa-mail-reply-all:before{content:"\f122"}.fa.fa-star-half-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-star-half-o:before{content:"\f5c0"}.fa.fa-star-half-empty{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-star-half-empty:before{content:"\f5c0"}.fa.fa-star-half-full{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-star-half-full:before{content:"\f5c0"}.fa.fa-code-fork:before{content:"\f126"}.fa.fa-chain-broken:before,.fa.fa-unlink:before{content:"\f127"}.fa.fa-calendar-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-calendar-o:before{content:"\f133"}.fa.fa-css3,.fa.fa-html5,.fa.fa-maxcdn{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-unlock-alt:before{content:"\f09c"}.fa.fa-minus-square-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-minus-square-o:before{content:"\f146"}.fa.fa-level-up:before{content:"\f3bf"}.fa.fa-level-down:before{content:"\f3be"}.fa.fa-pencil-square:before{content:"\f14b"}.fa.fa-external-link-square:before{content:"\f360"}.fa.fa-compass{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-caret-square-o-down{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-caret-square-o-down:before{content:"\f150"}.fa.fa-toggle-down{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-toggle-down:before{content:"\f150"}.fa.fa-caret-square-o-up{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-caret-square-o-up:before{content:"\f151"}.fa.fa-toggle-up{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-toggle-up:before{content:"\f151"}.fa.fa-caret-square-o-right{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-caret-square-o-right:before{content:"\f152"}.fa.fa-toggle-right{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-toggle-right:before{content:"\f152"}.fa.fa-eur:before,.fa.fa-euro:before{content:"\f153"}.fa.fa-gbp:before{content:"\f154"}.fa.fa-dollar:before,.fa.fa-usd:before{content:"\24"}.fa.fa-inr:before,.fa.fa-rupee:before{content:"\e1bc"}.fa.fa-cny:before,.fa.fa-jpy:before,.fa.fa-rmb:before,.fa.fa-yen:before{content:"\f157"}.fa.fa-rouble:before,.fa.fa-rub:before,.fa.fa-ruble:before{content:"\f158"}.fa.fa-krw:before,.fa.fa-won:before{content:"\f159"}.fa.fa-bitcoin,.fa.fa-btc{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-bitcoin:before{content:"\f15a"}.fa.fa-file-text:before{content:"\f15c"}.fa.fa-sort-alpha-asc:before{content:"\f15d"}.fa.fa-sort-alpha-desc:before{content:"\f881"}.fa.fa-sort-amount-asc:before{content:"\f884"}.fa.fa-sort-amount-desc:before{content:"\f160"}.fa.fa-sort-numeric-asc:before{content:"\f162"}.fa.fa-sort-numeric-desc:before{content:"\f886"}.fa.fa-youtube-square{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-youtube-square:before{content:"\f431"}.fa.fa-xing,.fa.fa-xing-square,.fa.fa-youtube{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-xing-square:before{content:"\f169"}.fa.fa-youtube-play{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-youtube-play:before{content:"\f167"}.fa.fa-adn,.fa.fa-bitbucket,.fa.fa-bitbucket-square,.fa.fa-dropbox,.fa.fa-flickr,.fa.fa-instagram,.fa.fa-stack-overflow{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-bitbucket-square:before{content:"\f171"}.fa.fa-tumblr,.fa.fa-tumblr-square{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-tumblr-square:before{content:"\f174"}.fa.fa-long-arrow-down:before{content:"\f309"}.fa.fa-long-arrow-up:before{content:"\f30c"}.fa.fa-long-arrow-left:before{content:"\f30a"}.fa.fa-long-arrow-right:before{content:"\f30b"}.fa.fa-android,.fa.fa-apple,.fa.fa-dribbble,.fa.fa-foursquare,.fa.fa-gittip,.fa.fa-gratipay,.fa.fa-linux,.fa.fa-skype,.fa.fa-trello,.fa.fa-windows{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-gittip:before{content:"\f184"}.fa.fa-sun-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-sun-o:before{content:"\f185"}.fa.fa-moon-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-moon-o:before{content:"\f186"}.fa.fa-pagelines,.fa.fa-renren,.fa.fa-stack-exchange,.fa.fa-vk,.fa.fa-weibo{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-arrow-circle-o-right{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-arrow-circle-o-right:before{content:"\f35a"}.fa.fa-arrow-circle-o-left{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-arrow-circle-o-left:before{content:"\f359"}.fa.fa-caret-square-o-left{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-caret-square-o-left:before{content:"\f191"}.fa.fa-toggle-left{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-toggle-left:before{content:"\f191"}.fa.fa-dot-circle-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-dot-circle-o:before{content:"\f192"}.fa.fa-vimeo-square{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-vimeo-square:before{content:"\f194"}.fa.fa-try:before,.fa.fa-turkish-lira:before{content:"\e2bb"}.fa.fa-plus-square-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-plus-square-o:before{content:"\f0fe"}.fa.fa-openid,.fa.fa-slack,.fa.fa-wordpress{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-bank:before,.fa.fa-institution:before{content:"\f19c"}.fa.fa-mortar-board:before{content:"\f19d"}.fa.fa-google,.fa.fa-reddit,.fa.fa-reddit-square,.fa.fa-yahoo{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-reddit-square:before{content:"\f1a2"}.fa.fa-behance,.fa.fa-behance-square,.fa.fa-delicious,.fa.fa-digg,.fa.fa-drupal,.fa.fa-joomla,.fa.fa-pied-piper-alt,.fa.fa-pied-piper-pp,.fa.fa-stumbleupon,.fa.fa-stumbleupon-circle{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-behance-square:before{content:"\f1b5"}.fa.fa-steam,.fa.fa-steam-square{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-steam-square:before{content:"\f1b7"}.fa.fa-automobile:before{content:"\f1b9"}.fa.fa-cab:before{content:"\f1ba"}.fa.fa-deviantart,.fa.fa-soundcloud,.fa.fa-spotify{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-file-pdf-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-file-pdf-o:before{content:"\f1c1"}.fa.fa-file-word-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-file-word-o:before{content:"\f1c2"}.fa.fa-file-excel-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-file-excel-o:before{content:"\f1c3"}.fa.fa-file-powerpoint-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-file-powerpoint-o:before{content:"\f1c4"}.fa.fa-file-image-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-file-image-o:before{content:"\f1c5"}.fa.fa-file-photo-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-file-photo-o:before{content:"\f1c5"}.fa.fa-file-picture-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-file-picture-o:before{content:"\f1c5"}.fa.fa-file-archive-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-file-archive-o:before{content:"\f1c6"}.fa.fa-file-zip-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-file-zip-o:before{content:"\f1c6"}.fa.fa-file-audio-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-file-audio-o:before{content:"\f1c7"}.fa.fa-file-sound-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-file-sound-o:before{content:"\f1c7"}.fa.fa-file-video-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-file-video-o:before{content:"\f1c8"}.fa.fa-file-movie-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-file-movie-o:before{content:"\f1c8"}.fa.fa-file-code-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-file-code-o:before{content:"\f1c9"}.fa.fa-codepen,.fa.fa-jsfiddle,.fa.fa-vine{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-life-bouy:before,.fa.fa-life-buoy:before,.fa.fa-life-saver:before,.fa.fa-support:before{content:"\f1cd"}.fa.fa-circle-o-notch:before{content:"\f1ce"}.fa.fa-ra,.fa.fa-rebel{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-ra:before{content:"\f1d0"}.fa.fa-resistance{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-resistance:before{content:"\f1d0"}.fa.fa-empire,.fa.fa-ge{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-ge:before{content:"\f1d1"}.fa.fa-git-square{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-git-square:before{content:"\f1d2"}.fa.fa-git,.fa.fa-hacker-news,.fa.fa-y-combinator-square{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-y-combinator-square:before{content:"\f1d4"}.fa.fa-yc-square{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-yc-square:before{content:"\f1d4"}.fa.fa-qq,.fa.fa-tencent-weibo,.fa.fa-wechat,.fa.fa-weixin{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-wechat:before{content:"\f1d7"}.fa.fa-send:before{content:"\f1d8"}.fa.fa-paper-plane-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-paper-plane-o:before{content:"\f1d8"}.fa.fa-send-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-send-o:before{content:"\f1d8"}.fa.fa-circle-thin{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-circle-thin:before{content:"\f111"}.fa.fa-header:before{content:"\f1dc"}.fa.fa-futbol-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-futbol-o:before{content:"\f1e3"}.fa.fa-soccer-ball-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-soccer-ball-o:before{content:"\f1e3"}.fa.fa-slideshare,.fa.fa-twitch,.fa.fa-yelp{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-newspaper-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-newspaper-o:before{content:"\f1ea"}.fa.fa-cc-amex,.fa.fa-cc-discover,.fa.fa-cc-mastercard,.fa.fa-cc-paypal,.fa.fa-cc-stripe,.fa.fa-cc-visa,.fa.fa-google-wallet,.fa.fa-paypal{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-bell-slash-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-bell-slash-o:before{content:"\f1f6"}.fa.fa-trash:before{content:"\f2ed"}.fa.fa-copyright{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-eyedropper:before{content:"\f1fb"}.fa.fa-area-chart:before{content:"\f1fe"}.fa.fa-pie-chart:before{content:"\f200"}.fa.fa-line-chart:before{content:"\f201"}.fa.fa-lastfm,.fa.fa-lastfm-square{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-lastfm-square:before{content:"\f203"}.fa.fa-angellist,.fa.fa-ioxhost{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-cc{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-cc:before{content:"\f20a"}.fa.fa-ils:before,.fa.fa-shekel:before,.fa.fa-sheqel:before{content:"\f20b"}.fa.fa-buysellads,.fa.fa-connectdevelop,.fa.fa-dashcube,.fa.fa-forumbee,.fa.fa-leanpub,.fa.fa-sellsy,.fa.fa-shirtsinbulk,.fa.fa-simplybuilt,.fa.fa-skyatlas{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-diamond{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-diamond:before{content:"\f3a5"}.fa.fa-intersex:before,.fa.fa-transgender:before{content:"\f224"}.fa.fa-transgender-alt:before{content:"\f225"}.fa.fa-facebook-official{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-facebook-official:before{content:"\f09a"}.fa.fa-pinterest-p,.fa.fa-whatsapp{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-hotel:before{content:"\f236"}.fa.fa-medium,.fa.fa-viacoin,.fa.fa-y-combinator,.fa.fa-yc{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-yc:before{content:"\f23b"}.fa.fa-expeditedssl,.fa.fa-opencart,.fa.fa-optin-monster{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-battery-4:before,.fa.fa-battery:before{content:"\f240"}.fa.fa-battery-3:before{content:"\f241"}.fa.fa-battery-2:before{content:"\f242"}.fa.fa-battery-1:before{content:"\f243"}.fa.fa-battery-0:before{content:"\f244"}.fa.fa-object-group,.fa.fa-object-ungroup,.fa.fa-sticky-note-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-sticky-note-o:before{content:"\f249"}.fa.fa-cc-diners-club,.fa.fa-cc-jcb{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-clone{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-hourglass-o:before{content:"\f254"}.fa.fa-hourglass-1:before{content:"\f251"}.fa.fa-hourglass-2:before{content:"\f252"}.fa.fa-hourglass-3:before{content:"\f253"}.fa.fa-hand-rock-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-hand-rock-o:before{content:"\f255"}.fa.fa-hand-grab-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-hand-grab-o:before{content:"\f255"}.fa.fa-hand-paper-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-hand-paper-o:before{content:"\f256"}.fa.fa-hand-stop-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-hand-stop-o:before{content:"\f256"}.fa.fa-hand-scissors-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-hand-scissors-o:before{content:"\f257"}.fa.fa-hand-lizard-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-hand-lizard-o:before{content:"\f258"}.fa.fa-hand-spock-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-hand-spock-o:before{content:"\f259"}.fa.fa-hand-pointer-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-hand-pointer-o:before{content:"\f25a"}.fa.fa-hand-peace-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-hand-peace-o:before{content:"\f25b"}.fa.fa-registered{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-creative-commons,.fa.fa-gg,.fa.fa-gg-circle,.fa.fa-odnoklassniki,.fa.fa-odnoklassniki-square{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-odnoklassniki-square:before{content:"\f264"}.fa.fa-chrome,.fa.fa-firefox,.fa.fa-get-pocket,.fa.fa-internet-explorer,.fa.fa-opera,.fa.fa-safari,.fa.fa-wikipedia-w{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-television:before{content:"\f26c"}.fa.fa-500px,.fa.fa-amazon,.fa.fa-contao{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-calendar-plus-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-calendar-plus-o:before{content:"\f271"}.fa.fa-calendar-minus-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-calendar-minus-o:before{content:"\f272"}.fa.fa-calendar-times-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-calendar-times-o:before{content:"\f273"}.fa.fa-calendar-check-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-calendar-check-o:before{content:"\f274"}.fa.fa-map-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-map-o:before{content:"\f279"}.fa.fa-commenting:before{content:"\f4ad"}.fa.fa-commenting-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-commenting-o:before{content:"\f4ad"}.fa.fa-houzz,.fa.fa-vimeo{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-vimeo:before{content:"\f27d"}.fa.fa-black-tie,.fa.fa-edge,.fa.fa-fonticons,.fa.fa-reddit-alien{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-credit-card-alt:before{content:"\f09d"}.fa.fa-codiepie,.fa.fa-fort-awesome,.fa.fa-mixcloud,.fa.fa-modx,.fa.fa-product-hunt,.fa.fa-scribd,.fa.fa-usb{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-pause-circle-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-pause-circle-o:before{content:"\f28b"}.fa.fa-stop-circle-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-stop-circle-o:before{content:"\f28d"}.fa.fa-bluetooth,.fa.fa-bluetooth-b,.fa.fa-envira,.fa.fa-gitlab,.fa.fa-wheelchair-alt,.fa.fa-wpbeginner,.fa.fa-wpforms{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-wheelchair-alt:before{content:"\f368"}.fa.fa-question-circle-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-question-circle-o:before{content:"\f059"}.fa.fa-volume-control-phone:before{content:"\f2a0"}.fa.fa-asl-interpreting:before{content:"\f2a3"}.fa.fa-deafness:before,.fa.fa-hard-of-hearing:before{content:"\f2a4"}.fa.fa-glide,.fa.fa-glide-g{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-signing:before{content:"\f2a7"}.fa.fa-viadeo,.fa.fa-viadeo-square{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-viadeo-square:before{content:"\f2aa"}.fa.fa-snapchat,.fa.fa-snapchat-ghost{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-snapchat-ghost:before{content:"\f2ab"}.fa.fa-snapchat-square{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-snapchat-square:before{content:"\f2ad"}.fa.fa-first-order,.fa.fa-google-plus-official,.fa.fa-pied-piper,.fa.fa-themeisle,.fa.fa-yoast{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-google-plus-official:before{content:"\f2b3"}.fa.fa-google-plus-circle{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-google-plus-circle:before{content:"\f2b3"}.fa.fa-fa,.fa.fa-font-awesome{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-fa:before{content:"\f2b4"}.fa.fa-handshake-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-handshake-o:before{content:"\f2b5"}.fa.fa-envelope-open-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-envelope-open-o:before{content:"\f2b6"}.fa.fa-linode{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-address-book-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-address-book-o:before{content:"\f2b9"}.fa.fa-vcard:before{content:"\f2bb"}.fa.fa-address-card-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-address-card-o:before{content:"\f2bb"}.fa.fa-vcard-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-vcard-o:before{content:"\f2bb"}.fa.fa-user-circle-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-user-circle-o:before{content:"\f2bd"}.fa.fa-user-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-user-o:before{content:"\f007"}.fa.fa-id-badge{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-drivers-license:before{content:"\f2c2"}.fa.fa-id-card-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-id-card-o:before{content:"\f2c2"}.fa.fa-drivers-license-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-drivers-license-o:before{content:"\f2c2"}.fa.fa-free-code-camp,.fa.fa-quora,.fa.fa-telegram{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-thermometer-4:before,.fa.fa-thermometer:before{content:"\f2c7"}.fa.fa-thermometer-3:before{content:"\f2c8"}.fa.fa-thermometer-2:before{content:"\f2c9"}.fa.fa-thermometer-1:before{content:"\f2ca"}.fa.fa-thermometer-0:before{content:"\f2cb"}.fa.fa-bathtub:before,.fa.fa-s15:before{content:"\f2cd"}.fa.fa-window-maximize,.fa.fa-window-restore{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-times-rectangle:before{content:"\f410"}.fa.fa-window-close-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-window-close-o:before{content:"\f410"}.fa.fa-times-rectangle-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-times-rectangle-o:before{content:"\f410"}.fa.fa-bandcamp,.fa.fa-eercast,.fa.fa-etsy,.fa.fa-grav,.fa.fa-imdb,.fa.fa-ravelry{font-family:"Font Awesome 6 Brands";font-weight:400}.fa.fa-eercast:before{content:"\f2da"}.fa.fa-snowflake-o{font-family:"Font Awesome 6 Free";font-weight:400}.fa.fa-snowflake-o:before{content:"\f2dc"}.fa.fa-meetup,.fa.fa-superpowers,.fa.fa-wpexplorer{font-family:"Font Awesome 6 Brands";font-weight:400}
\ No newline at end of file
diff --git a/dev/deps/font-awesome-6.4.2/webfonts/fa-brands-400.ttf b/dev/deps/font-awesome-6.4.2/webfonts/fa-brands-400.ttf
new file mode 100644
index 000000000..30f55b743
Binary files /dev/null and b/dev/deps/font-awesome-6.4.2/webfonts/fa-brands-400.ttf differ
diff --git a/dev/deps/font-awesome-6.4.2/webfonts/fa-brands-400.woff2 b/dev/deps/font-awesome-6.4.2/webfonts/fa-brands-400.woff2
new file mode 100644
index 000000000..8a480d9b1
Binary files /dev/null and b/dev/deps/font-awesome-6.4.2/webfonts/fa-brands-400.woff2 differ
diff --git a/dev/deps/font-awesome-6.4.2/webfonts/fa-regular-400.ttf b/dev/deps/font-awesome-6.4.2/webfonts/fa-regular-400.ttf
new file mode 100644
index 000000000..c79589d83
Binary files /dev/null and b/dev/deps/font-awesome-6.4.2/webfonts/fa-regular-400.ttf differ
diff --git a/dev/deps/font-awesome-6.4.2/webfonts/fa-regular-400.woff2 b/dev/deps/font-awesome-6.4.2/webfonts/fa-regular-400.woff2
new file mode 100644
index 000000000..059a94e2f
Binary files /dev/null and b/dev/deps/font-awesome-6.4.2/webfonts/fa-regular-400.woff2 differ
diff --git a/dev/deps/font-awesome-6.4.2/webfonts/fa-solid-900.ttf b/dev/deps/font-awesome-6.4.2/webfonts/fa-solid-900.ttf
new file mode 100644
index 000000000..e479fb293
Binary files /dev/null and b/dev/deps/font-awesome-6.4.2/webfonts/fa-solid-900.ttf differ
diff --git a/dev/deps/font-awesome-6.4.2/webfonts/fa-solid-900.woff2 b/dev/deps/font-awesome-6.4.2/webfonts/fa-solid-900.woff2
new file mode 100644
index 000000000..88b0367aa
Binary files /dev/null and b/dev/deps/font-awesome-6.4.2/webfonts/fa-solid-900.woff2 differ
diff --git a/dev/deps/font-awesome-6.4.2/webfonts/fa-v4compatibility.ttf b/dev/deps/font-awesome-6.4.2/webfonts/fa-v4compatibility.ttf
new file mode 100644
index 000000000..ba6cb258e
Binary files /dev/null and b/dev/deps/font-awesome-6.4.2/webfonts/fa-v4compatibility.ttf differ
diff --git a/dev/deps/font-awesome-6.4.2/webfonts/fa-v4compatibility.woff2 b/dev/deps/font-awesome-6.4.2/webfonts/fa-v4compatibility.woff2
new file mode 100644
index 000000000..23b1c47ba
Binary files /dev/null and b/dev/deps/font-awesome-6.4.2/webfonts/fa-v4compatibility.woff2 differ
diff --git a/dev/deps/headroom-0.11.0/headroom.min.js b/dev/deps/headroom-0.11.0/headroom.min.js
new file mode 100644
index 000000000..433069fda
--- /dev/null
+++ b/dev/deps/headroom-0.11.0/headroom.min.js
@@ -0,0 +1,7 @@
+/*!
+ * headroom.js v0.11.0 - Give your page some headroom. Hide your header until you need it
+ * Copyright (c) 2020 Nick Williams - http://wicky.nillia.ms/headroom.js
+ * License: MIT
+ */
+
+!function(t,n){"object"==typeof exports&&"undefined"!=typeof module?module.exports=n():"function"==typeof define&&define.amd?define(n):(t=t||self).Headroom=n()}(this,function(){"use strict";function t(){return"undefined"!=typeof window}function d(t){return function(t){return t&&t.document&&function(t){return 9===t.nodeType}(t.document)}(t)?function(t){var n=t.document,o=n.body,s=n.documentElement;return{scrollHeight:function(){return Math.max(o.scrollHeight,s.scrollHeight,o.offsetHeight,s.offsetHeight,o.clientHeight,s.clientHeight)},height:function(){return t.innerHeight||s.clientHeight||o.clientHeight},scrollY:function(){return void 0!==t.pageYOffset?t.pageYOffset:(s||o.parentNode||o).scrollTop}}}(t):function(t){return{scrollHeight:function(){return Math.max(t.scrollHeight,t.offsetHeight,t.clientHeight)},height:function(){return Math.max(t.offsetHeight,t.clientHeight)},scrollY:function(){return t.scrollTop}}}(t)}function n(t,s,e){var n,o=function(){var n=!1;try{var t={get passive(){n=!0}};window.addEventListener("test",t,t),window.removeEventListener("test",t,t)}catch(t){n=!1}return n}(),i=!1,r=d(t),l=r.scrollY(),a={};function c(){var t=Math.round(r.scrollY()),n=r.height(),o=r.scrollHeight();a.scrollY=t,a.lastScrollY=l,a.direction=ls.tolerance[a.direction],e(a),l=t,i=!1}function h(){i||(i=!0,n=requestAnimationFrame(c))}var u=!!o&&{passive:!0,capture:!1};return t.addEventListener("scroll",h,u),c(),{destroy:function(){cancelAnimationFrame(n),t.removeEventListener("scroll",h,u)}}}function o(t,n){n=n||{},Object.assign(this,o.options,n),this.classes=Object.assign({},o.options.classes,n.classes),this.elem=t,this.tolerance=function(t){return t===Object(t)?t:{down:t,up:t}}(this.tolerance),this.initialised=!1,this.frozen=!1}return o.prototype={constructor:o,init:function(){return o.cutsTheMustard&&!this.initialised&&(this.addClass("initial"),this.initialised=!0,setTimeout(function(t){t.scrollTracker=n(t.scroller,{offset:t.offset,tolerance:t.tolerance},t.update.bind(t))},100,this)),this},destroy:function(){this.initialised=!1,Object.keys(this.classes).forEach(this.removeClass,this),this.scrollTracker.destroy()},unpin:function(){!this.hasClass("pinned")&&this.hasClass("unpinned")||(this.addClass("unpinned"),this.removeClass("pinned"),this.onUnpin&&this.onUnpin.call(this))},pin:function(){this.hasClass("unpinned")&&(this.addClass("pinned"),this.removeClass("unpinned"),this.onPin&&this.onPin.call(this))},freeze:function(){this.frozen=!0,this.addClass("frozen")},unfreeze:function(){this.frozen=!1,this.removeClass("frozen")},top:function(){this.hasClass("top")||(this.addClass("top"),this.removeClass("notTop"),this.onTop&&this.onTop.call(this))},notTop:function(){this.hasClass("notTop")||(this.addClass("notTop"),this.removeClass("top"),this.onNotTop&&this.onNotTop.call(this))},bottom:function(){this.hasClass("bottom")||(this.addClass("bottom"),this.removeClass("notBottom"),this.onBottom&&this.onBottom.call(this))},notBottom:function(){this.hasClass("notBottom")||(this.addClass("notBottom"),this.removeClass("bottom"),this.onNotBottom&&this.onNotBottom.call(this))},shouldUnpin:function(t){return"down"===t.direction&&!t.top&&t.toleranceExceeded},shouldPin:function(t){return"up"===t.direction&&t.toleranceExceeded||t.top},addClass:function(t){this.elem.classList.add.apply(this.elem.classList,this.classes[t].split(" "))},removeClass:function(t){this.elem.classList.remove.apply(this.elem.classList,this.classes[t].split(" "))},hasClass:function(t){return this.classes[t].split(" ").every(function(t){return this.classList.contains(t)},this.elem)},update:function(t){t.isOutOfBounds||!0!==this.frozen&&(t.top?this.top():this.notTop(),t.bottom?this.bottom():this.notBottom(),this.shouldUnpin(t)?this.unpin():this.shouldPin(t)&&this.pin())}},o.options={tolerance:{up:0,down:0},offset:0,scroller:t()?window:null,classes:{frozen:"headroom--frozen",pinned:"headroom--pinned",unpinned:"headroom--unpinned",top:"headroom--top",notTop:"headroom--not-top",bottom:"headroom--bottom",notBottom:"headroom--not-bottom",initial:"headroom"}},o.cutsTheMustard=!!(t()&&function(){}.bind&&"classList"in document.documentElement&&Object.assign&&Object.keys&&requestAnimationFrame),o});
\ No newline at end of file
diff --git a/dev/deps/headroom-0.11.0/jQuery.headroom.min.js b/dev/deps/headroom-0.11.0/jQuery.headroom.min.js
new file mode 100644
index 000000000..17f70c9e3
--- /dev/null
+++ b/dev/deps/headroom-0.11.0/jQuery.headroom.min.js
@@ -0,0 +1,7 @@
+/*!
+ * headroom.js v0.9.4 - Give your page some headroom. Hide your header until you need it
+ * Copyright (c) 2017 Nick Williams - http://wicky.nillia.ms/headroom.js
+ * License: MIT
+ */
+
+!function(a){a&&(a.fn.headroom=function(b){return this.each(function(){var c=a(this),d=c.data("headroom"),e="object"==typeof b&&b;e=a.extend(!0,{},Headroom.options,e),d||(d=new Headroom(this,e),d.init(),c.data("headroom",d)),"string"==typeof b&&(d[b](),"destroy"===b&&c.removeData("headroom"))})},a("[data-headroom]").each(function(){var b=a(this);b.headroom(b.data())}))}(window.Zepto||window.jQuery);
\ No newline at end of file
diff --git a/dev/deps/jquery-3.6.0/jquery-3.6.0.js b/dev/deps/jquery-3.6.0/jquery-3.6.0.js
new file mode 100644
index 000000000..fc6c299b7
--- /dev/null
+++ b/dev/deps/jquery-3.6.0/jquery-3.6.0.js
@@ -0,0 +1,10881 @@
+/*!
+ * jQuery JavaScript Library v3.6.0
+ * https://jquery.com/
+ *
+ * Includes Sizzle.js
+ * https://sizzlejs.com/
+ *
+ * Copyright OpenJS Foundation and other contributors
+ * Released under the MIT license
+ * https://jquery.org/license
+ *
+ * Date: 2021-03-02T17:08Z
+ */
+( function( global, factory ) {
+
+	"use strict";
+
+	if ( typeof module === "object" && typeof module.exports === "object" ) {
+
+		// For CommonJS and CommonJS-like environments where a proper `window`
+		// is present, execute the factory and get jQuery.
+		// For environments that do not have a `window` with a `document`
+		// (such as Node.js), expose a factory as module.exports.
+		// This accentuates the need for the creation of a real `window`.
+		// e.g. var jQuery = require("jquery")(window);
+		// See ticket #14549 for more info.
+		module.exports = global.document ?
+			factory( global, true ) :
+			function( w ) {
+				if ( !w.document ) {
+					throw new Error( "jQuery requires a window with a document" );
+				}
+				return factory( w );
+			};
+	} else {
+		factory( global );
+	}
+
+// Pass this if window is not defined yet
+} )( typeof window !== "undefined" ? window : this, function( window, noGlobal ) {
+
+// Edge <= 12 - 13+, Firefox <=18 - 45+, IE 10 - 11, Safari 5.1 - 9+, iOS 6 - 9.1
+// throw exceptions when non-strict code (e.g., ASP.NET 4.5) accesses strict mode
+// arguments.callee.caller (trac-13335). But as of jQuery 3.0 (2016), strict mode should be common
+// enough that all such attempts are guarded in a try block.
+"use strict";
+
+var arr = [];
+
+var getProto = Object.getPrototypeOf;
+
+var slice = arr.slice;
+
+var flat = arr.flat ? function( array ) {
+	return arr.flat.call( array );
+} : function( array ) {
+	return arr.concat.apply( [], array );
+};
+
+
+var push = arr.push;
+
+var indexOf = arr.indexOf;
+
+var class2type = {};
+
+var toString = class2type.toString;
+
+var hasOwn = class2type.hasOwnProperty;
+
+var fnToString = hasOwn.toString;
+
+var ObjectFunctionString = fnToString.call( Object );
+
+var support = {};
+
+var isFunction = function isFunction( obj ) {
+
+		// Support: Chrome <=57, Firefox <=52
+		// In some browsers, typeof returns "function" for HTML  elements
+		// (i.e., `typeof document.createElement( "object" ) === "function"`).
+		// We don't want to classify *any* DOM node as a function.
+		// Support: QtWeb <=3.8.5, WebKit <=534.34, wkhtmltopdf tool <=0.12.5
+		// Plus for old WebKit, typeof returns "function" for HTML collections
+		// (e.g., `typeof document.getElementsByTagName("div") === "function"`). (gh-4756)
+		return typeof obj === "function" && typeof obj.nodeType !== "number" &&
+			typeof obj.item !== "function";
+	};
+
+
+var isWindow = function isWindow( obj ) {
+		return obj != null && obj === obj.window;
+	};
+
+
+var document = window.document;
+
+
+
+	var preservedScriptAttributes = {
+		type: true,
+		src: true,
+		nonce: true,
+		noModule: true
+	};
+
+	function DOMEval( code, node, doc ) {
+		doc = doc || document;
+
+		var i, val,
+			script = doc.createElement( "script" );
+
+		script.text = code;
+		if ( node ) {
+			for ( i in preservedScriptAttributes ) {
+
+				// Support: Firefox 64+, Edge 18+
+				// Some browsers don't support the "nonce" property on scripts.
+				// On the other hand, just using `getAttribute` is not enough as
+				// the `nonce` attribute is reset to an empty string whenever it
+				// becomes browsing-context connected.
+				// See https://github.com/whatwg/html/issues/2369
+				// See https://html.spec.whatwg.org/#nonce-attributes
+				// The `node.getAttribute` check was added for the sake of
+				// `jQuery.globalEval` so that it can fake a nonce-containing node
+				// via an object.
+				val = node[ i ] || node.getAttribute && node.getAttribute( i );
+				if ( val ) {
+					script.setAttribute( i, val );
+				}
+			}
+		}
+		doc.head.appendChild( script ).parentNode.removeChild( script );
+	}
+
+
+function toType( obj ) {
+	if ( obj == null ) {
+		return obj + "";
+	}
+
+	// Support: Android <=2.3 only (functionish RegExp)
+	return typeof obj === "object" || typeof obj === "function" ?
+		class2type[ toString.call( obj ) ] || "object" :
+		typeof obj;
+}
+/* global Symbol */
+// Defining this global in .eslintrc.json would create a danger of using the global
+// unguarded in another place, it seems safer to define global only for this module
+
+
+
+var
+	version = "3.6.0",
+
+	// Define a local copy of jQuery
+	jQuery = function( selector, context ) {
+
+		// The jQuery object is actually just the init constructor 'enhanced'
+		// Need init if jQuery is called (just allow error to be thrown if not included)
+		return new jQuery.fn.init( selector, context );
+	};
+
+jQuery.fn = jQuery.prototype = {
+
+	// The current version of jQuery being used
+	jquery: version,
+
+	constructor: jQuery,
+
+	// The default length of a jQuery object is 0
+	length: 0,
+
+	toArray: function() {
+		return slice.call( this );
+	},
+
+	// Get the Nth element in the matched element set OR
+	// Get the whole matched element set as a clean array
+	get: function( num ) {
+
+		// Return all the elements in a clean array
+		if ( num == null ) {
+			return slice.call( this );
+		}
+
+		// Return just the one element from the set
+		return num < 0 ? this[ num + this.length ] : this[ num ];
+	},
+
+	// Take an array of elements and push it onto the stack
+	// (returning the new matched element set)
+	pushStack: function( elems ) {
+
+		// Build a new jQuery matched element set
+		var ret = jQuery.merge( this.constructor(), elems );
+
+		// Add the old object onto the stack (as a reference)
+		ret.prevObject = this;
+
+		// Return the newly-formed element set
+		return ret;
+	},
+
+	// Execute a callback for every element in the matched set.
+	each: function( callback ) {
+		return jQuery.each( this, callback );
+	},
+
+	map: function( callback ) {
+		return this.pushStack( jQuery.map( this, function( elem, i ) {
+			return callback.call( elem, i, elem );
+		} ) );
+	},
+
+	slice: function() {
+		return this.pushStack( slice.apply( this, arguments ) );
+	},
+
+	first: function() {
+		return this.eq( 0 );
+	},
+
+	last: function() {
+		return this.eq( -1 );
+	},
+
+	even: function() {
+		return this.pushStack( jQuery.grep( this, function( _elem, i ) {
+			return ( i + 1 ) % 2;
+		} ) );
+	},
+
+	odd: function() {
+		return this.pushStack( jQuery.grep( this, function( _elem, i ) {
+			return i % 2;
+		} ) );
+	},
+
+	eq: function( i ) {
+		var len = this.length,
+			j = +i + ( i < 0 ? len : 0 );
+		return this.pushStack( j >= 0 && j < len ? [ this[ j ] ] : [] );
+	},
+
+	end: function() {
+		return this.prevObject || this.constructor();
+	},
+
+	// For internal use only.
+	// Behaves like an Array's method, not like a jQuery method.
+	push: push,
+	sort: arr.sort,
+	splice: arr.splice
+};
+
+jQuery.extend = jQuery.fn.extend = function() {
+	var options, name, src, copy, copyIsArray, clone,
+		target = arguments[ 0 ] || {},
+		i = 1,
+		length = arguments.length,
+		deep = false;
+
+	// Handle a deep copy situation
+	if ( typeof target === "boolean" ) {
+		deep = target;
+
+		// Skip the boolean and the target
+		target = arguments[ i ] || {};
+		i++;
+	}
+
+	// Handle case when target is a string or something (possible in deep copy)
+	if ( typeof target !== "object" && !isFunction( target ) ) {
+		target = {};
+	}
+
+	// Extend jQuery itself if only one argument is passed
+	if ( i === length ) {
+		target = this;
+		i--;
+	}
+
+	for ( ; i < length; i++ ) {
+
+		// Only deal with non-null/undefined values
+		if ( ( options = arguments[ i ] ) != null ) {
+
+			// Extend the base object
+			for ( name in options ) {
+				copy = options[ name ];
+
+				// Prevent Object.prototype pollution
+				// Prevent never-ending loop
+				if ( name === "__proto__" || target === copy ) {
+					continue;
+				}
+
+				// Recurse if we're merging plain objects or arrays
+				if ( deep && copy && ( jQuery.isPlainObject( copy ) ||
+					( copyIsArray = Array.isArray( copy ) ) ) ) {
+					src = target[ name ];
+
+					// Ensure proper type for the source value
+					if ( copyIsArray && !Array.isArray( src ) ) {
+						clone = [];
+					} else if ( !copyIsArray && !jQuery.isPlainObject( src ) ) {
+						clone = {};
+					} else {
+						clone = src;
+					}
+					copyIsArray = false;
+
+					// Never move original objects, clone them
+					target[ name ] = jQuery.extend( deep, clone, copy );
+
+				// Don't bring in undefined values
+				} else if ( copy !== undefined ) {
+					target[ name ] = copy;
+				}
+			}
+		}
+	}
+
+	// Return the modified object
+	return target;
+};
+
+jQuery.extend( {
+
+	// Unique for each copy of jQuery on the page
+	expando: "jQuery" + ( version + Math.random() ).replace( /\D/g, "" ),
+
+	// Assume jQuery is ready without the ready module
+	isReady: true,
+
+	error: function( msg ) {
+		throw new Error( msg );
+	},
+
+	noop: function() {},
+
+	isPlainObject: function( obj ) {
+		var proto, Ctor;
+
+		// Detect obvious negatives
+		// Use toString instead of jQuery.type to catch host objects
+		if ( !obj || toString.call( obj ) !== "[object Object]" ) {
+			return false;
+		}
+
+		proto = getProto( obj );
+
+		// Objects with no prototype (e.g., `Object.create( null )`) are plain
+		if ( !proto ) {
+			return true;
+		}
+
+		// Objects with prototype are plain iff they were constructed by a global Object function
+		Ctor = hasOwn.call( proto, "constructor" ) && proto.constructor;
+		return typeof Ctor === "function" && fnToString.call( Ctor ) === ObjectFunctionString;
+	},
+
+	isEmptyObject: function( obj ) {
+		var name;
+
+		for ( name in obj ) {
+			return false;
+		}
+		return true;
+	},
+
+	// Evaluates a script in a provided context; falls back to the global one
+	// if not specified.
+	globalEval: function( code, options, doc ) {
+		DOMEval( code, { nonce: options && options.nonce }, doc );
+	},
+
+	each: function( obj, callback ) {
+		var length, i = 0;
+
+		if ( isArrayLike( obj ) ) {
+			length = obj.length;
+			for ( ; i < length; i++ ) {
+				if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) {
+					break;
+				}
+			}
+		} else {
+			for ( i in obj ) {
+				if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) {
+					break;
+				}
+			}
+		}
+
+		return obj;
+	},
+
+	// results is for internal usage only
+	makeArray: function( arr, results ) {
+		var ret = results || [];
+
+		if ( arr != null ) {
+			if ( isArrayLike( Object( arr ) ) ) {
+				jQuery.merge( ret,
+					typeof arr === "string" ?
+						[ arr ] : arr
+				);
+			} else {
+				push.call( ret, arr );
+			}
+		}
+
+		return ret;
+	},
+
+	inArray: function( elem, arr, i ) {
+		return arr == null ? -1 : indexOf.call( arr, elem, i );
+	},
+
+	// Support: Android <=4.0 only, PhantomJS 1 only
+	// push.apply(_, arraylike) throws on ancient WebKit
+	merge: function( first, second ) {
+		var len = +second.length,
+			j = 0,
+			i = first.length;
+
+		for ( ; j < len; j++ ) {
+			first[ i++ ] = second[ j ];
+		}
+
+		first.length = i;
+
+		return first;
+	},
+
+	grep: function( elems, callback, invert ) {
+		var callbackInverse,
+			matches = [],
+			i = 0,
+			length = elems.length,
+			callbackExpect = !invert;
+
+		// Go through the array, only saving the items
+		// that pass the validator function
+		for ( ; i < length; i++ ) {
+			callbackInverse = !callback( elems[ i ], i );
+			if ( callbackInverse !== callbackExpect ) {
+				matches.push( elems[ i ] );
+			}
+		}
+
+		return matches;
+	},
+
+	// arg is for internal usage only
+	map: function( elems, callback, arg ) {
+		var length, value,
+			i = 0,
+			ret = [];
+
+		// Go through the array, translating each of the items to their new values
+		if ( isArrayLike( elems ) ) {
+			length = elems.length;
+			for ( ; i < length; i++ ) {
+				value = callback( elems[ i ], i, arg );
+
+				if ( value != null ) {
+					ret.push( value );
+				}
+			}
+
+		// Go through every key on the object,
+		} else {
+			for ( i in elems ) {
+				value = callback( elems[ i ], i, arg );
+
+				if ( value != null ) {
+					ret.push( value );
+				}
+			}
+		}
+
+		// Flatten any nested arrays
+		return flat( ret );
+	},
+
+	// A global GUID counter for objects
+	guid: 1,
+
+	// jQuery.support is not used in Core but other projects attach their
+	// properties to it so it needs to exist.
+	support: support
+} );
+
+if ( typeof Symbol === "function" ) {
+	jQuery.fn[ Symbol.iterator ] = arr[ Symbol.iterator ];
+}
+
+// Populate the class2type map
+jQuery.each( "Boolean Number String Function Array Date RegExp Object Error Symbol".split( " " ),
+	function( _i, name ) {
+		class2type[ "[object " + name + "]" ] = name.toLowerCase();
+	} );
+
+function isArrayLike( obj ) {
+
+	// Support: real iOS 8.2 only (not reproducible in simulator)
+	// `in` check used to prevent JIT error (gh-2145)
+	// hasOwn isn't used here due to false negatives
+	// regarding Nodelist length in IE
+	var length = !!obj && "length" in obj && obj.length,
+		type = toType( obj );
+
+	if ( isFunction( obj ) || isWindow( obj ) ) {
+		return false;
+	}
+
+	return type === "array" || length === 0 ||
+		typeof length === "number" && length > 0 && ( length - 1 ) in obj;
+}
+var Sizzle =
+/*!
+ * Sizzle CSS Selector Engine v2.3.6
+ * https://sizzlejs.com/
+ *
+ * Copyright JS Foundation and other contributors
+ * Released under the MIT license
+ * https://js.foundation/
+ *
+ * Date: 2021-02-16
+ */
+( function( window ) {
+var i,
+	support,
+	Expr,
+	getText,
+	isXML,
+	tokenize,
+	compile,
+	select,
+	outermostContext,
+	sortInput,
+	hasDuplicate,
+
+	// Local document vars
+	setDocument,
+	document,
+	docElem,
+	documentIsHTML,
+	rbuggyQSA,
+	rbuggyMatches,
+	matches,
+	contains,
+
+	// Instance-specific data
+	expando = "sizzle" + 1 * new Date(),
+	preferredDoc = window.document,
+	dirruns = 0,
+	done = 0,
+	classCache = createCache(),
+	tokenCache = createCache(),
+	compilerCache = createCache(),
+	nonnativeSelectorCache = createCache(),
+	sortOrder = function( a, b ) {
+		if ( a === b ) {
+			hasDuplicate = true;
+		}
+		return 0;
+	},
+
+	// Instance methods
+	hasOwn = ( {} ).hasOwnProperty,
+	arr = [],
+	pop = arr.pop,
+	pushNative = arr.push,
+	push = arr.push,
+	slice = arr.slice,
+
+	// Use a stripped-down indexOf as it's faster than native
+	// https://jsperf.com/thor-indexof-vs-for/5
+	indexOf = function( list, elem ) {
+		var i = 0,
+			len = list.length;
+		for ( ; i < len; i++ ) {
+			if ( list[ i ] === elem ) {
+				return i;
+			}
+		}
+		return -1;
+	},
+
+	booleans = "checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|" +
+		"ismap|loop|multiple|open|readonly|required|scoped",
+
+	// Regular expressions
+
+	// http://www.w3.org/TR/css3-selectors/#whitespace
+	whitespace = "[\\x20\\t\\r\\n\\f]",
+
+	// https://www.w3.org/TR/css-syntax-3/#ident-token-diagram
+	identifier = "(?:\\\\[\\da-fA-F]{1,6}" + whitespace +
+		"?|\\\\[^\\r\\n\\f]|[\\w-]|[^\0-\\x7f])+",
+
+	// Attribute selectors: http://www.w3.org/TR/selectors/#attribute-selectors
+	attributes = "\\[" + whitespace + "*(" + identifier + ")(?:" + whitespace +
+
+		// Operator (capture 2)
+		"*([*^$|!~]?=)" + whitespace +
+
+		// "Attribute values must be CSS identifiers [capture 5]
+		// or strings [capture 3 or capture 4]"
+		"*(?:'((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\"|(" + identifier + "))|)" +
+		whitespace + "*\\]",
+
+	pseudos = ":(" + identifier + ")(?:\\((" +
+
+		// To reduce the number of selectors needing tokenize in the preFilter, prefer arguments:
+		// 1. quoted (capture 3; capture 4 or capture 5)
+		"('((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\")|" +
+
+		// 2. simple (capture 6)
+		"((?:\\\\.|[^\\\\()[\\]]|" + attributes + ")*)|" +
+
+		// 3. anything else (capture 2)
+		".*" +
+		")\\)|)",
+
+	// Leading and non-escaped trailing whitespace, capturing some non-whitespace characters preceding the latter
+	rwhitespace = new RegExp( whitespace + "+", "g" ),
+	rtrim = new RegExp( "^" + whitespace + "+|((?:^|[^\\\\])(?:\\\\.)*)" +
+		whitespace + "+$", "g" ),
+
+	rcomma = new RegExp( "^" + whitespace + "*," + whitespace + "*" ),
+	rcombinators = new RegExp( "^" + whitespace + "*([>+~]|" + whitespace + ")" + whitespace +
+		"*" ),
+	rdescend = new RegExp( whitespace + "|>" ),
+
+	rpseudo = new RegExp( pseudos ),
+	ridentifier = new RegExp( "^" + identifier + "$" ),
+
+	matchExpr = {
+		"ID": new RegExp( "^#(" + identifier + ")" ),
+		"CLASS": new RegExp( "^\\.(" + identifier + ")" ),
+		"TAG": new RegExp( "^(" + identifier + "|[*])" ),
+		"ATTR": new RegExp( "^" + attributes ),
+		"PSEUDO": new RegExp( "^" + pseudos ),
+		"CHILD": new RegExp( "^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\(" +
+			whitespace + "*(even|odd|(([+-]|)(\\d*)n|)" + whitespace + "*(?:([+-]|)" +
+			whitespace + "*(\\d+)|))" + whitespace + "*\\)|)", "i" ),
+		"bool": new RegExp( "^(?:" + booleans + ")$", "i" ),
+
+		// For use in libraries implementing .is()
+		// We use this for POS matching in `select`
+		"needsContext": new RegExp( "^" + whitespace +
+			"*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\(" + whitespace +
+			"*((?:-\\d)?\\d*)" + whitespace + "*\\)|)(?=[^-]|$)", "i" )
+	},
+
+	rhtml = /HTML$/i,
+	rinputs = /^(?:input|select|textarea|button)$/i,
+	rheader = /^h\d$/i,
+
+	rnative = /^[^{]+\{\s*\[native \w/,
+
+	// Easily-parseable/retrievable ID or TAG or CLASS selectors
+	rquickExpr = /^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/,
+
+	rsibling = /[+~]/,
+
+	// CSS escapes
+	// http://www.w3.org/TR/CSS21/syndata.html#escaped-characters
+	runescape = new RegExp( "\\\\[\\da-fA-F]{1,6}" + whitespace + "?|\\\\([^\\r\\n\\f])", "g" ),
+	funescape = function( escape, nonHex ) {
+		var high = "0x" + escape.slice( 1 ) - 0x10000;
+
+		return nonHex ?
+
+			// Strip the backslash prefix from a non-hex escape sequence
+			nonHex :
+
+			// Replace a hexadecimal escape sequence with the encoded Unicode code point
+			// Support: IE <=11+
+			// For values outside the Basic Multilingual Plane (BMP), manually construct a
+			// surrogate pair
+			high < 0 ?
+				String.fromCharCode( high + 0x10000 ) :
+				String.fromCharCode( high >> 10 | 0xD800, high & 0x3FF | 0xDC00 );
+	},
+
+	// CSS string/identifier serialization
+	// https://drafts.csswg.org/cssom/#common-serializing-idioms
+	rcssescape = /([\0-\x1f\x7f]|^-?\d)|^-$|[^\0-\x1f\x7f-\uFFFF\w-]/g,
+	fcssescape = function( ch, asCodePoint ) {
+		if ( asCodePoint ) {
+
+			// U+0000 NULL becomes U+FFFD REPLACEMENT CHARACTER
+			if ( ch === "\0" ) {
+				return "\uFFFD";
+			}
+
+			// Control characters and (dependent upon position) numbers get escaped as code points
+			return ch.slice( 0, -1 ) + "\\" +
+				ch.charCodeAt( ch.length - 1 ).toString( 16 ) + " ";
+		}
+
+		// Other potentially-special ASCII characters get backslash-escaped
+		return "\\" + ch;
+	},
+
+	// Used for iframes
+	// See setDocument()
+	// Removing the function wrapper causes a "Permission Denied"
+	// error in IE
+	unloadHandler = function() {
+		setDocument();
+	},
+
+	inDisabledFieldset = addCombinator(
+		function( elem ) {
+			return elem.disabled === true && elem.nodeName.toLowerCase() === "fieldset";
+		},
+		{ dir: "parentNode", next: "legend" }
+	);
+
+// Optimize for push.apply( _, NodeList )
+try {
+	push.apply(
+		( arr = slice.call( preferredDoc.childNodes ) ),
+		preferredDoc.childNodes
+	);
+
+	// Support: Android<4.0
+	// Detect silently failing push.apply
+	// eslint-disable-next-line no-unused-expressions
+	arr[ preferredDoc.childNodes.length ].nodeType;
+} catch ( e ) {
+	push = { apply: arr.length ?
+
+		// Leverage slice if possible
+		function( target, els ) {
+			pushNative.apply( target, slice.call( els ) );
+		} :
+
+		// Support: IE<9
+		// Otherwise append directly
+		function( target, els ) {
+			var j = target.length,
+				i = 0;
+
+			// Can't trust NodeList.length
+			while ( ( target[ j++ ] = els[ i++ ] ) ) {}
+			target.length = j - 1;
+		}
+	};
+}
+
+function Sizzle( selector, context, results, seed ) {
+	var m, i, elem, nid, match, groups, newSelector,
+		newContext = context && context.ownerDocument,
+
+		// nodeType defaults to 9, since context defaults to document
+		nodeType = context ? context.nodeType : 9;
+
+	results = results || [];
+
+	// Return early from calls with invalid selector or context
+	if ( typeof selector !== "string" || !selector ||
+		nodeType !== 1 && nodeType !== 9 && nodeType !== 11 ) {
+
+		return results;
+	}
+
+	// Try to shortcut find operations (as opposed to filters) in HTML documents
+	if ( !seed ) {
+		setDocument( context );
+		context = context || document;
+
+		if ( documentIsHTML ) {
+
+			// If the selector is sufficiently simple, try using a "get*By*" DOM method
+			// (excepting DocumentFragment context, where the methods don't exist)
+			if ( nodeType !== 11 && ( match = rquickExpr.exec( selector ) ) ) {
+
+				// ID selector
+				if ( ( m = match[ 1 ] ) ) {
+
+					// Document context
+					if ( nodeType === 9 ) {
+						if ( ( elem = context.getElementById( m ) ) ) {
+
+							// Support: IE, Opera, Webkit
+							// TODO: identify versions
+							// getElementById can match elements by name instead of ID
+							if ( elem.id === m ) {
+								results.push( elem );
+								return results;
+							}
+						} else {
+							return results;
+						}
+
+					// Element context
+					} else {
+
+						// Support: IE, Opera, Webkit
+						// TODO: identify versions
+						// getElementById can match elements by name instead of ID
+						if ( newContext && ( elem = newContext.getElementById( m ) ) &&
+							contains( context, elem ) &&
+							elem.id === m ) {
+
+							results.push( elem );
+							return results;
+						}
+					}
+
+				// Type selector
+				} else if ( match[ 2 ] ) {
+					push.apply( results, context.getElementsByTagName( selector ) );
+					return results;
+
+				// Class selector
+				} else if ( ( m = match[ 3 ] ) && support.getElementsByClassName &&
+					context.getElementsByClassName ) {
+
+					push.apply( results, context.getElementsByClassName( m ) );
+					return results;
+				}
+			}
+
+			// Take advantage of querySelectorAll
+			if ( support.qsa &&
+				!nonnativeSelectorCache[ selector + " " ] &&
+				( !rbuggyQSA || !rbuggyQSA.test( selector ) ) &&
+
+				// Support: IE 8 only
+				// Exclude object elements
+				( nodeType !== 1 || context.nodeName.toLowerCase() !== "object" ) ) {
+
+				newSelector = selector;
+				newContext = context;
+
+				// qSA considers elements outside a scoping root when evaluating child or
+				// descendant combinators, which is not what we want.
+				// In such cases, we work around the behavior by prefixing every selector in the
+				// list with an ID selector referencing the scope context.
+				// The technique has to be used as well when a leading combinator is used
+				// as such selectors are not recognized by querySelectorAll.
+				// Thanks to Andrew Dupont for this technique.
+				if ( nodeType === 1 &&
+					( rdescend.test( selector ) || rcombinators.test( selector ) ) ) {
+
+					// Expand context for sibling selectors
+					newContext = rsibling.test( selector ) && testContext( context.parentNode ) ||
+						context;
+
+					// We can use :scope instead of the ID hack if the browser
+					// supports it & if we're not changing the context.
+					if ( newContext !== context || !support.scope ) {
+
+						// Capture the context ID, setting it first if necessary
+						if ( ( nid = context.getAttribute( "id" ) ) ) {
+							nid = nid.replace( rcssescape, fcssescape );
+						} else {
+							context.setAttribute( "id", ( nid = expando ) );
+						}
+					}
+
+					// Prefix every selector in the list
+					groups = tokenize( selector );
+					i = groups.length;
+					while ( i-- ) {
+						groups[ i ] = ( nid ? "#" + nid : ":scope" ) + " " +
+							toSelector( groups[ i ] );
+					}
+					newSelector = groups.join( "," );
+				}
+
+				try {
+					push.apply( results,
+						newContext.querySelectorAll( newSelector )
+					);
+					return results;
+				} catch ( qsaError ) {
+					nonnativeSelectorCache( selector, true );
+				} finally {
+					if ( nid === expando ) {
+						context.removeAttribute( "id" );
+					}
+				}
+			}
+		}
+	}
+
+	// All others
+	return select( selector.replace( rtrim, "$1" ), context, results, seed );
+}
+
+/**
+ * Create key-value caches of limited size
+ * @returns {function(string, object)} Returns the Object data after storing it on itself with
+ *	property name the (space-suffixed) string and (if the cache is larger than Expr.cacheLength)
+ *	deleting the oldest entry
+ */
+function createCache() {
+	var keys = [];
+
+	function cache( key, value ) {
+
+		// Use (key + " ") to avoid collision with native prototype properties (see Issue #157)
+		if ( keys.push( key + " " ) > Expr.cacheLength ) {
+
+			// Only keep the most recent entries
+			delete cache[ keys.shift() ];
+		}
+		return ( cache[ key + " " ] = value );
+	}
+	return cache;
+}
+
+/**
+ * Mark a function for special use by Sizzle
+ * @param {Function} fn The function to mark
+ */
+function markFunction( fn ) {
+	fn[ expando ] = true;
+	return fn;
+}
+
+/**
+ * Support testing using an element
+ * @param {Function} fn Passed the created element and returns a boolean result
+ */
+function assert( fn ) {
+	var el = document.createElement( "fieldset" );
+
+	try {
+		return !!fn( el );
+	} catch ( e ) {
+		return false;
+	} finally {
+
+		// Remove from its parent by default
+		if ( el.parentNode ) {
+			el.parentNode.removeChild( el );
+		}
+
+		// release memory in IE
+		el = null;
+	}
+}
+
+/**
+ * Adds the same handler for all of the specified attrs
+ * @param {String} attrs Pipe-separated list of attributes
+ * @param {Function} handler The method that will be applied
+ */
+function addHandle( attrs, handler ) {
+	var arr = attrs.split( "|" ),
+		i = arr.length;
+
+	while ( i-- ) {
+		Expr.attrHandle[ arr[ i ] ] = handler;
+	}
+}
+
+/**
+ * Checks document order of two siblings
+ * @param {Element} a
+ * @param {Element} b
+ * @returns {Number} Returns less than 0 if a precedes b, greater than 0 if a follows b
+ */
+function siblingCheck( a, b ) {
+	var cur = b && a,
+		diff = cur && a.nodeType === 1 && b.nodeType === 1 &&
+			a.sourceIndex - b.sourceIndex;
+
+	// Use IE sourceIndex if available on both nodes
+	if ( diff ) {
+		return diff;
+	}
+
+	// Check if b follows a
+	if ( cur ) {
+		while ( ( cur = cur.nextSibling ) ) {
+			if ( cur === b ) {
+				return -1;
+			}
+		}
+	}
+
+	return a ? 1 : -1;
+}
+
+/**
+ * Returns a function to use in pseudos for input types
+ * @param {String} type
+ */
+function createInputPseudo( type ) {
+	return function( elem ) {
+		var name = elem.nodeName.toLowerCase();
+		return name === "input" && elem.type === type;
+	};
+}
+
+/**
+ * Returns a function to use in pseudos for buttons
+ * @param {String} type
+ */
+function createButtonPseudo( type ) {
+	return function( elem ) {
+		var name = elem.nodeName.toLowerCase();
+		return ( name === "input" || name === "button" ) && elem.type === type;
+	};
+}
+
+/**
+ * Returns a function to use in pseudos for :enabled/:disabled
+ * @param {Boolean} disabled true for :disabled; false for :enabled
+ */
+function createDisabledPseudo( disabled ) {
+
+	// Known :disabled false positives: fieldset[disabled] > legend:nth-of-type(n+2) :can-disable
+	return function( elem ) {
+
+		// Only certain elements can match :enabled or :disabled
+		// https://html.spec.whatwg.org/multipage/scripting.html#selector-enabled
+		// https://html.spec.whatwg.org/multipage/scripting.html#selector-disabled
+		if ( "form" in elem ) {
+
+			// Check for inherited disabledness on relevant non-disabled elements:
+			// * listed form-associated elements in a disabled fieldset
+			//   https://html.spec.whatwg.org/multipage/forms.html#category-listed
+			//   https://html.spec.whatwg.org/multipage/forms.html#concept-fe-disabled
+			// * option elements in a disabled optgroup
+			//   https://html.spec.whatwg.org/multipage/forms.html#concept-option-disabled
+			// All such elements have a "form" property.
+			if ( elem.parentNode && elem.disabled === false ) {
+
+				// Option elements defer to a parent optgroup if present
+				if ( "label" in elem ) {
+					if ( "label" in elem.parentNode ) {
+						return elem.parentNode.disabled === disabled;
+					} else {
+						return elem.disabled === disabled;
+					}
+				}
+
+				// Support: IE 6 - 11
+				// Use the isDisabled shortcut property to check for disabled fieldset ancestors
+				return elem.isDisabled === disabled ||
+
+					// Where there is no isDisabled, check manually
+					/* jshint -W018 */
+					elem.isDisabled !== !disabled &&
+					inDisabledFieldset( elem ) === disabled;
+			}
+
+			return elem.disabled === disabled;
+
+		// Try to winnow out elements that can't be disabled before trusting the disabled property.
+		// Some victims get caught in our net (label, legend, menu, track), but it shouldn't
+		// even exist on them, let alone have a boolean value.
+		} else if ( "label" in elem ) {
+			return elem.disabled === disabled;
+		}
+
+		// Remaining elements are neither :enabled nor :disabled
+		return false;
+	};
+}
+
+/**
+ * Returns a function to use in pseudos for positionals
+ * @param {Function} fn
+ */
+function createPositionalPseudo( fn ) {
+	return markFunction( function( argument ) {
+		argument = +argument;
+		return markFunction( function( seed, matches ) {
+			var j,
+				matchIndexes = fn( [], seed.length, argument ),
+				i = matchIndexes.length;
+
+			// Match elements found at the specified indexes
+			while ( i-- ) {
+				if ( seed[ ( j = matchIndexes[ i ] ) ] ) {
+					seed[ j ] = !( matches[ j ] = seed[ j ] );
+				}
+			}
+		} );
+	} );
+}
+
+/**
+ * Checks a node for validity as a Sizzle context
+ * @param {Element|Object=} context
+ * @returns {Element|Object|Boolean} The input node if acceptable, otherwise a falsy value
+ */
+function testContext( context ) {
+	return context && typeof context.getElementsByTagName !== "undefined" && context;
+}
+
+// Expose support vars for convenience
+support = Sizzle.support = {};
+
+/**
+ * Detects XML nodes
+ * @param {Element|Object} elem An element or a document
+ * @returns {Boolean} True iff elem is a non-HTML XML node
+ */
+isXML = Sizzle.isXML = function( elem ) {
+	var namespace = elem && elem.namespaceURI,
+		docElem = elem && ( elem.ownerDocument || elem ).documentElement;
+
+	// Support: IE <=8
+	// Assume HTML when documentElement doesn't yet exist, such as inside loading iframes
+	// https://bugs.jquery.com/ticket/4833
+	return !rhtml.test( namespace || docElem && docElem.nodeName || "HTML" );
+};
+
+/**
+ * Sets document-related variables once based on the current document
+ * @param {Element|Object} [doc] An element or document object to use to set the document
+ * @returns {Object} Returns the current document
+ */
+setDocument = Sizzle.setDocument = function( node ) {
+	var hasCompare, subWindow,
+		doc = node ? node.ownerDocument || node : preferredDoc;
+
+	// Return early if doc is invalid or already selected
+	// Support: IE 11+, Edge 17 - 18+
+	// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+	// two documents; shallow comparisons work.
+	// eslint-disable-next-line eqeqeq
+	if ( doc == document || doc.nodeType !== 9 || !doc.documentElement ) {
+		return document;
+	}
+
+	// Update global variables
+	document = doc;
+	docElem = document.documentElement;
+	documentIsHTML = !isXML( document );
+
+	// Support: IE 9 - 11+, Edge 12 - 18+
+	// Accessing iframe documents after unload throws "permission denied" errors (jQuery #13936)
+	// Support: IE 11+, Edge 17 - 18+
+	// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+	// two documents; shallow comparisons work.
+	// eslint-disable-next-line eqeqeq
+	if ( preferredDoc != document &&
+		( subWindow = document.defaultView ) && subWindow.top !== subWindow ) {
+
+		// Support: IE 11, Edge
+		if ( subWindow.addEventListener ) {
+			subWindow.addEventListener( "unload", unloadHandler, false );
+
+		// Support: IE 9 - 10 only
+		} else if ( subWindow.attachEvent ) {
+			subWindow.attachEvent( "onunload", unloadHandler );
+		}
+	}
+
+	// Support: IE 8 - 11+, Edge 12 - 18+, Chrome <=16 - 25 only, Firefox <=3.6 - 31 only,
+	// Safari 4 - 5 only, Opera <=11.6 - 12.x only
+	// IE/Edge & older browsers don't support the :scope pseudo-class.
+	// Support: Safari 6.0 only
+	// Safari 6.0 supports :scope but it's an alias of :root there.
+	support.scope = assert( function( el ) {
+		docElem.appendChild( el ).appendChild( document.createElement( "div" ) );
+		return typeof el.querySelectorAll !== "undefined" &&
+			!el.querySelectorAll( ":scope fieldset div" ).length;
+	} );
+
+	/* Attributes
+	---------------------------------------------------------------------- */
+
+	// Support: IE<8
+	// Verify that getAttribute really returns attributes and not properties
+	// (excepting IE8 booleans)
+	support.attributes = assert( function( el ) {
+		el.className = "i";
+		return !el.getAttribute( "className" );
+	} );
+
+	/* getElement(s)By*
+	---------------------------------------------------------------------- */
+
+	// Check if getElementsByTagName("*") returns only elements
+	support.getElementsByTagName = assert( function( el ) {
+		el.appendChild( document.createComment( "" ) );
+		return !el.getElementsByTagName( "*" ).length;
+	} );
+
+	// Support: IE<9
+	support.getElementsByClassName = rnative.test( document.getElementsByClassName );
+
+	// Support: IE<10
+	// Check if getElementById returns elements by name
+	// The broken getElementById methods don't pick up programmatically-set names,
+	// so use a roundabout getElementsByName test
+	support.getById = assert( function( el ) {
+		docElem.appendChild( el ).id = expando;
+		return !document.getElementsByName || !document.getElementsByName( expando ).length;
+	} );
+
+	// ID filter and find
+	if ( support.getById ) {
+		Expr.filter[ "ID" ] = function( id ) {
+			var attrId = id.replace( runescape, funescape );
+			return function( elem ) {
+				return elem.getAttribute( "id" ) === attrId;
+			};
+		};
+		Expr.find[ "ID" ] = function( id, context ) {
+			if ( typeof context.getElementById !== "undefined" && documentIsHTML ) {
+				var elem = context.getElementById( id );
+				return elem ? [ elem ] : [];
+			}
+		};
+	} else {
+		Expr.filter[ "ID" ] =  function( id ) {
+			var attrId = id.replace( runescape, funescape );
+			return function( elem ) {
+				var node = typeof elem.getAttributeNode !== "undefined" &&
+					elem.getAttributeNode( "id" );
+				return node && node.value === attrId;
+			};
+		};
+
+		// Support: IE 6 - 7 only
+		// getElementById is not reliable as a find shortcut
+		Expr.find[ "ID" ] = function( id, context ) {
+			if ( typeof context.getElementById !== "undefined" && documentIsHTML ) {
+				var node, i, elems,
+					elem = context.getElementById( id );
+
+				if ( elem ) {
+
+					// Verify the id attribute
+					node = elem.getAttributeNode( "id" );
+					if ( node && node.value === id ) {
+						return [ elem ];
+					}
+
+					// Fall back on getElementsByName
+					elems = context.getElementsByName( id );
+					i = 0;
+					while ( ( elem = elems[ i++ ] ) ) {
+						node = elem.getAttributeNode( "id" );
+						if ( node && node.value === id ) {
+							return [ elem ];
+						}
+					}
+				}
+
+				return [];
+			}
+		};
+	}
+
+	// Tag
+	Expr.find[ "TAG" ] = support.getElementsByTagName ?
+		function( tag, context ) {
+			if ( typeof context.getElementsByTagName !== "undefined" ) {
+				return context.getElementsByTagName( tag );
+
+			// DocumentFragment nodes don't have gEBTN
+			} else if ( support.qsa ) {
+				return context.querySelectorAll( tag );
+			}
+		} :
+
+		function( tag, context ) {
+			var elem,
+				tmp = [],
+				i = 0,
+
+				// By happy coincidence, a (broken) gEBTN appears on DocumentFragment nodes too
+				results = context.getElementsByTagName( tag );
+
+			// Filter out possible comments
+			if ( tag === "*" ) {
+				while ( ( elem = results[ i++ ] ) ) {
+					if ( elem.nodeType === 1 ) {
+						tmp.push( elem );
+					}
+				}
+
+				return tmp;
+			}
+			return results;
+		};
+
+	// Class
+	Expr.find[ "CLASS" ] = support.getElementsByClassName && function( className, context ) {
+		if ( typeof context.getElementsByClassName !== "undefined" && documentIsHTML ) {
+			return context.getElementsByClassName( className );
+		}
+	};
+
+	/* QSA/matchesSelector
+	---------------------------------------------------------------------- */
+
+	// QSA and matchesSelector support
+
+	// matchesSelector(:active) reports false when true (IE9/Opera 11.5)
+	rbuggyMatches = [];
+
+	// qSa(:focus) reports false when true (Chrome 21)
+	// We allow this because of a bug in IE8/9 that throws an error
+	// whenever `document.activeElement` is accessed on an iframe
+	// So, we allow :focus to pass through QSA all the time to avoid the IE error
+	// See https://bugs.jquery.com/ticket/13378
+	rbuggyQSA = [];
+
+	if ( ( support.qsa = rnative.test( document.querySelectorAll ) ) ) {
+
+		// Build QSA regex
+		// Regex strategy adopted from Diego Perini
+		assert( function( el ) {
+
+			var input;
+
+			// Select is set to empty string on purpose
+			// This is to test IE's treatment of not explicitly
+			// setting a boolean content attribute,
+			// since its presence should be enough
+			// https://bugs.jquery.com/ticket/12359
+			docElem.appendChild( el ).innerHTML = "" +
+				"";
+
+			// Support: IE8, Opera 11-12.16
+			// Nothing should be selected when empty strings follow ^= or $= or *=
+			// The test attribute must be unknown in Opera but "safe" for WinRT
+			// https://msdn.microsoft.com/en-us/library/ie/hh465388.aspx#attribute_section
+			if ( el.querySelectorAll( "[msallowcapture^='']" ).length ) {
+				rbuggyQSA.push( "[*^$]=" + whitespace + "*(?:''|\"\")" );
+			}
+
+			// Support: IE8
+			// Boolean attributes and "value" are not treated correctly
+			if ( !el.querySelectorAll( "[selected]" ).length ) {
+				rbuggyQSA.push( "\\[" + whitespace + "*(?:value|" + booleans + ")" );
+			}
+
+			// Support: Chrome<29, Android<4.4, Safari<7.0+, iOS<7.0+, PhantomJS<1.9.8+
+			if ( !el.querySelectorAll( "[id~=" + expando + "-]" ).length ) {
+				rbuggyQSA.push( "~=" );
+			}
+
+			// Support: IE 11+, Edge 15 - 18+
+			// IE 11/Edge don't find elements on a `[name='']` query in some cases.
+			// Adding a temporary attribute to the document before the selection works
+			// around the issue.
+			// Interestingly, IE 10 & older don't seem to have the issue.
+			input = document.createElement( "input" );
+			input.setAttribute( "name", "" );
+			el.appendChild( input );
+			if ( !el.querySelectorAll( "[name='']" ).length ) {
+				rbuggyQSA.push( "\\[" + whitespace + "*name" + whitespace + "*=" +
+					whitespace + "*(?:''|\"\")" );
+			}
+
+			// Webkit/Opera - :checked should return selected option elements
+			// http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked
+			// IE8 throws error here and will not see later tests
+			if ( !el.querySelectorAll( ":checked" ).length ) {
+				rbuggyQSA.push( ":checked" );
+			}
+
+			// Support: Safari 8+, iOS 8+
+			// https://bugs.webkit.org/show_bug.cgi?id=136851
+			// In-page `selector#id sibling-combinator selector` fails
+			if ( !el.querySelectorAll( "a#" + expando + "+*" ).length ) {
+				rbuggyQSA.push( ".#.+[+~]" );
+			}
+
+			// Support: Firefox <=3.6 - 5 only
+			// Old Firefox doesn't throw on a badly-escaped identifier.
+			el.querySelectorAll( "\\\f" );
+			rbuggyQSA.push( "[\\r\\n\\f]" );
+		} );
+
+		assert( function( el ) {
+			el.innerHTML = "" +
+				"";
+
+			// Support: Windows 8 Native Apps
+			// The type and name attributes are restricted during .innerHTML assignment
+			var input = document.createElement( "input" );
+			input.setAttribute( "type", "hidden" );
+			el.appendChild( input ).setAttribute( "name", "D" );
+
+			// Support: IE8
+			// Enforce case-sensitivity of name attribute
+			if ( el.querySelectorAll( "[name=d]" ).length ) {
+				rbuggyQSA.push( "name" + whitespace + "*[*^$|!~]?=" );
+			}
+
+			// FF 3.5 - :enabled/:disabled and hidden elements (hidden elements are still enabled)
+			// IE8 throws error here and will not see later tests
+			if ( el.querySelectorAll( ":enabled" ).length !== 2 ) {
+				rbuggyQSA.push( ":enabled", ":disabled" );
+			}
+
+			// Support: IE9-11+
+			// IE's :disabled selector does not pick up the children of disabled fieldsets
+			docElem.appendChild( el ).disabled = true;
+			if ( el.querySelectorAll( ":disabled" ).length !== 2 ) {
+				rbuggyQSA.push( ":enabled", ":disabled" );
+			}
+
+			// Support: Opera 10 - 11 only
+			// Opera 10-11 does not throw on post-comma invalid pseudos
+			el.querySelectorAll( "*,:x" );
+			rbuggyQSA.push( ",.*:" );
+		} );
+	}
+
+	if ( ( support.matchesSelector = rnative.test( ( matches = docElem.matches ||
+		docElem.webkitMatchesSelector ||
+		docElem.mozMatchesSelector ||
+		docElem.oMatchesSelector ||
+		docElem.msMatchesSelector ) ) ) ) {
+
+		assert( function( el ) {
+
+			// Check to see if it's possible to do matchesSelector
+			// on a disconnected node (IE 9)
+			support.disconnectedMatch = matches.call( el, "*" );
+
+			// This should fail with an exception
+			// Gecko does not error, returns false instead
+			matches.call( el, "[s!='']:x" );
+			rbuggyMatches.push( "!=", pseudos );
+		} );
+	}
+
+	rbuggyQSA = rbuggyQSA.length && new RegExp( rbuggyQSA.join( "|" ) );
+	rbuggyMatches = rbuggyMatches.length && new RegExp( rbuggyMatches.join( "|" ) );
+
+	/* Contains
+	---------------------------------------------------------------------- */
+	hasCompare = rnative.test( docElem.compareDocumentPosition );
+
+	// Element contains another
+	// Purposefully self-exclusive
+	// As in, an element does not contain itself
+	contains = hasCompare || rnative.test( docElem.contains ) ?
+		function( a, b ) {
+			var adown = a.nodeType === 9 ? a.documentElement : a,
+				bup = b && b.parentNode;
+			return a === bup || !!( bup && bup.nodeType === 1 && (
+				adown.contains ?
+					adown.contains( bup ) :
+					a.compareDocumentPosition && a.compareDocumentPosition( bup ) & 16
+			) );
+		} :
+		function( a, b ) {
+			if ( b ) {
+				while ( ( b = b.parentNode ) ) {
+					if ( b === a ) {
+						return true;
+					}
+				}
+			}
+			return false;
+		};
+
+	/* Sorting
+	---------------------------------------------------------------------- */
+
+	// Document order sorting
+	sortOrder = hasCompare ?
+	function( a, b ) {
+
+		// Flag for duplicate removal
+		if ( a === b ) {
+			hasDuplicate = true;
+			return 0;
+		}
+
+		// Sort on method existence if only one input has compareDocumentPosition
+		var compare = !a.compareDocumentPosition - !b.compareDocumentPosition;
+		if ( compare ) {
+			return compare;
+		}
+
+		// Calculate position if both inputs belong to the same document
+		// Support: IE 11+, Edge 17 - 18+
+		// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+		// two documents; shallow comparisons work.
+		// eslint-disable-next-line eqeqeq
+		compare = ( a.ownerDocument || a ) == ( b.ownerDocument || b ) ?
+			a.compareDocumentPosition( b ) :
+
+			// Otherwise we know they are disconnected
+			1;
+
+		// Disconnected nodes
+		if ( compare & 1 ||
+			( !support.sortDetached && b.compareDocumentPosition( a ) === compare ) ) {
+
+			// Choose the first element that is related to our preferred document
+			// Support: IE 11+, Edge 17 - 18+
+			// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+			// two documents; shallow comparisons work.
+			// eslint-disable-next-line eqeqeq
+			if ( a == document || a.ownerDocument == preferredDoc &&
+				contains( preferredDoc, a ) ) {
+				return -1;
+			}
+
+			// Support: IE 11+, Edge 17 - 18+
+			// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+			// two documents; shallow comparisons work.
+			// eslint-disable-next-line eqeqeq
+			if ( b == document || b.ownerDocument == preferredDoc &&
+				contains( preferredDoc, b ) ) {
+				return 1;
+			}
+
+			// Maintain original order
+			return sortInput ?
+				( indexOf( sortInput, a ) - indexOf( sortInput, b ) ) :
+				0;
+		}
+
+		return compare & 4 ? -1 : 1;
+	} :
+	function( a, b ) {
+
+		// Exit early if the nodes are identical
+		if ( a === b ) {
+			hasDuplicate = true;
+			return 0;
+		}
+
+		var cur,
+			i = 0,
+			aup = a.parentNode,
+			bup = b.parentNode,
+			ap = [ a ],
+			bp = [ b ];
+
+		// Parentless nodes are either documents or disconnected
+		if ( !aup || !bup ) {
+
+			// Support: IE 11+, Edge 17 - 18+
+			// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+			// two documents; shallow comparisons work.
+			/* eslint-disable eqeqeq */
+			return a == document ? -1 :
+				b == document ? 1 :
+				/* eslint-enable eqeqeq */
+				aup ? -1 :
+				bup ? 1 :
+				sortInput ?
+				( indexOf( sortInput, a ) - indexOf( sortInput, b ) ) :
+				0;
+
+		// If the nodes are siblings, we can do a quick check
+		} else if ( aup === bup ) {
+			return siblingCheck( a, b );
+		}
+
+		// Otherwise we need full lists of their ancestors for comparison
+		cur = a;
+		while ( ( cur = cur.parentNode ) ) {
+			ap.unshift( cur );
+		}
+		cur = b;
+		while ( ( cur = cur.parentNode ) ) {
+			bp.unshift( cur );
+		}
+
+		// Walk down the tree looking for a discrepancy
+		while ( ap[ i ] === bp[ i ] ) {
+			i++;
+		}
+
+		return i ?
+
+			// Do a sibling check if the nodes have a common ancestor
+			siblingCheck( ap[ i ], bp[ i ] ) :
+
+			// Otherwise nodes in our document sort first
+			// Support: IE 11+, Edge 17 - 18+
+			// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+			// two documents; shallow comparisons work.
+			/* eslint-disable eqeqeq */
+			ap[ i ] == preferredDoc ? -1 :
+			bp[ i ] == preferredDoc ? 1 :
+			/* eslint-enable eqeqeq */
+			0;
+	};
+
+	return document;
+};
+
+Sizzle.matches = function( expr, elements ) {
+	return Sizzle( expr, null, null, elements );
+};
+
+Sizzle.matchesSelector = function( elem, expr ) {
+	setDocument( elem );
+
+	if ( support.matchesSelector && documentIsHTML &&
+		!nonnativeSelectorCache[ expr + " " ] &&
+		( !rbuggyMatches || !rbuggyMatches.test( expr ) ) &&
+		( !rbuggyQSA     || !rbuggyQSA.test( expr ) ) ) {
+
+		try {
+			var ret = matches.call( elem, expr );
+
+			// IE 9's matchesSelector returns false on disconnected nodes
+			if ( ret || support.disconnectedMatch ||
+
+				// As well, disconnected nodes are said to be in a document
+				// fragment in IE 9
+				elem.document && elem.document.nodeType !== 11 ) {
+				return ret;
+			}
+		} catch ( e ) {
+			nonnativeSelectorCache( expr, true );
+		}
+	}
+
+	return Sizzle( expr, document, null, [ elem ] ).length > 0;
+};
+
+Sizzle.contains = function( context, elem ) {
+
+	// Set document vars if needed
+	// Support: IE 11+, Edge 17 - 18+
+	// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+	// two documents; shallow comparisons work.
+	// eslint-disable-next-line eqeqeq
+	if ( ( context.ownerDocument || context ) != document ) {
+		setDocument( context );
+	}
+	return contains( context, elem );
+};
+
+Sizzle.attr = function( elem, name ) {
+
+	// Set document vars if needed
+	// Support: IE 11+, Edge 17 - 18+
+	// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+	// two documents; shallow comparisons work.
+	// eslint-disable-next-line eqeqeq
+	if ( ( elem.ownerDocument || elem ) != document ) {
+		setDocument( elem );
+	}
+
+	var fn = Expr.attrHandle[ name.toLowerCase() ],
+
+		// Don't get fooled by Object.prototype properties (jQuery #13807)
+		val = fn && hasOwn.call( Expr.attrHandle, name.toLowerCase() ) ?
+			fn( elem, name, !documentIsHTML ) :
+			undefined;
+
+	return val !== undefined ?
+		val :
+		support.attributes || !documentIsHTML ?
+			elem.getAttribute( name ) :
+			( val = elem.getAttributeNode( name ) ) && val.specified ?
+				val.value :
+				null;
+};
+
+Sizzle.escape = function( sel ) {
+	return ( sel + "" ).replace( rcssescape, fcssescape );
+};
+
+Sizzle.error = function( msg ) {
+	throw new Error( "Syntax error, unrecognized expression: " + msg );
+};
+
+/**
+ * Document sorting and removing duplicates
+ * @param {ArrayLike} results
+ */
+Sizzle.uniqueSort = function( results ) {
+	var elem,
+		duplicates = [],
+		j = 0,
+		i = 0;
+
+	// Unless we *know* we can detect duplicates, assume their presence
+	hasDuplicate = !support.detectDuplicates;
+	sortInput = !support.sortStable && results.slice( 0 );
+	results.sort( sortOrder );
+
+	if ( hasDuplicate ) {
+		while ( ( elem = results[ i++ ] ) ) {
+			if ( elem === results[ i ] ) {
+				j = duplicates.push( i );
+			}
+		}
+		while ( j-- ) {
+			results.splice( duplicates[ j ], 1 );
+		}
+	}
+
+	// Clear input after sorting to release objects
+	// See https://github.com/jquery/sizzle/pull/225
+	sortInput = null;
+
+	return results;
+};
+
+/**
+ * Utility function for retrieving the text value of an array of DOM nodes
+ * @param {Array|Element} elem
+ */
+getText = Sizzle.getText = function( elem ) {
+	var node,
+		ret = "",
+		i = 0,
+		nodeType = elem.nodeType;
+
+	if ( !nodeType ) {
+
+		// If no nodeType, this is expected to be an array
+		while ( ( node = elem[ i++ ] ) ) {
+
+			// Do not traverse comment nodes
+			ret += getText( node );
+		}
+	} else if ( nodeType === 1 || nodeType === 9 || nodeType === 11 ) {
+
+		// Use textContent for elements
+		// innerText usage removed for consistency of new lines (jQuery #11153)
+		if ( typeof elem.textContent === "string" ) {
+			return elem.textContent;
+		} else {
+
+			// Traverse its children
+			for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) {
+				ret += getText( elem );
+			}
+		}
+	} else if ( nodeType === 3 || nodeType === 4 ) {
+		return elem.nodeValue;
+	}
+
+	// Do not include comment or processing instruction nodes
+
+	return ret;
+};
+
+Expr = Sizzle.selectors = {
+
+	// Can be adjusted by the user
+	cacheLength: 50,
+
+	createPseudo: markFunction,
+
+	match: matchExpr,
+
+	attrHandle: {},
+
+	find: {},
+
+	relative: {
+		">": { dir: "parentNode", first: true },
+		" ": { dir: "parentNode" },
+		"+": { dir: "previousSibling", first: true },
+		"~": { dir: "previousSibling" }
+	},
+
+	preFilter: {
+		"ATTR": function( match ) {
+			match[ 1 ] = match[ 1 ].replace( runescape, funescape );
+
+			// Move the given value to match[3] whether quoted or unquoted
+			match[ 3 ] = ( match[ 3 ] || match[ 4 ] ||
+				match[ 5 ] || "" ).replace( runescape, funescape );
+
+			if ( match[ 2 ] === "~=" ) {
+				match[ 3 ] = " " + match[ 3 ] + " ";
+			}
+
+			return match.slice( 0, 4 );
+		},
+
+		"CHILD": function( match ) {
+
+			/* matches from matchExpr["CHILD"]
+				1 type (only|nth|...)
+				2 what (child|of-type)
+				3 argument (even|odd|\d*|\d*n([+-]\d+)?|...)
+				4 xn-component of xn+y argument ([+-]?\d*n|)
+				5 sign of xn-component
+				6 x of xn-component
+				7 sign of y-component
+				8 y of y-component
+			*/
+			match[ 1 ] = match[ 1 ].toLowerCase();
+
+			if ( match[ 1 ].slice( 0, 3 ) === "nth" ) {
+
+				// nth-* requires argument
+				if ( !match[ 3 ] ) {
+					Sizzle.error( match[ 0 ] );
+				}
+
+				// numeric x and y parameters for Expr.filter.CHILD
+				// remember that false/true cast respectively to 0/1
+				match[ 4 ] = +( match[ 4 ] ?
+					match[ 5 ] + ( match[ 6 ] || 1 ) :
+					2 * ( match[ 3 ] === "even" || match[ 3 ] === "odd" ) );
+				match[ 5 ] = +( ( match[ 7 ] + match[ 8 ] ) || match[ 3 ] === "odd" );
+
+				// other types prohibit arguments
+			} else if ( match[ 3 ] ) {
+				Sizzle.error( match[ 0 ] );
+			}
+
+			return match;
+		},
+
+		"PSEUDO": function( match ) {
+			var excess,
+				unquoted = !match[ 6 ] && match[ 2 ];
+
+			if ( matchExpr[ "CHILD" ].test( match[ 0 ] ) ) {
+				return null;
+			}
+
+			// Accept quoted arguments as-is
+			if ( match[ 3 ] ) {
+				match[ 2 ] = match[ 4 ] || match[ 5 ] || "";
+
+			// Strip excess characters from unquoted arguments
+			} else if ( unquoted && rpseudo.test( unquoted ) &&
+
+				// Get excess from tokenize (recursively)
+				( excess = tokenize( unquoted, true ) ) &&
+
+				// advance to the next closing parenthesis
+				( excess = unquoted.indexOf( ")", unquoted.length - excess ) - unquoted.length ) ) {
+
+				// excess is a negative index
+				match[ 0 ] = match[ 0 ].slice( 0, excess );
+				match[ 2 ] = unquoted.slice( 0, excess );
+			}
+
+			// Return only captures needed by the pseudo filter method (type and argument)
+			return match.slice( 0, 3 );
+		}
+	},
+
+	filter: {
+
+		"TAG": function( nodeNameSelector ) {
+			var nodeName = nodeNameSelector.replace( runescape, funescape ).toLowerCase();
+			return nodeNameSelector === "*" ?
+				function() {
+					return true;
+				} :
+				function( elem ) {
+					return elem.nodeName && elem.nodeName.toLowerCase() === nodeName;
+				};
+		},
+
+		"CLASS": function( className ) {
+			var pattern = classCache[ className + " " ];
+
+			return pattern ||
+				( pattern = new RegExp( "(^|" + whitespace +
+					")" + className + "(" + whitespace + "|$)" ) ) && classCache(
+						className, function( elem ) {
+							return pattern.test(
+								typeof elem.className === "string" && elem.className ||
+								typeof elem.getAttribute !== "undefined" &&
+									elem.getAttribute( "class" ) ||
+								""
+							);
+				} );
+		},
+
+		"ATTR": function( name, operator, check ) {
+			return function( elem ) {
+				var result = Sizzle.attr( elem, name );
+
+				if ( result == null ) {
+					return operator === "!=";
+				}
+				if ( !operator ) {
+					return true;
+				}
+
+				result += "";
+
+				/* eslint-disable max-len */
+
+				return operator === "=" ? result === check :
+					operator === "!=" ? result !== check :
+					operator === "^=" ? check && result.indexOf( check ) === 0 :
+					operator === "*=" ? check && result.indexOf( check ) > -1 :
+					operator === "$=" ? check && result.slice( -check.length ) === check :
+					operator === "~=" ? ( " " + result.replace( rwhitespace, " " ) + " " ).indexOf( check ) > -1 :
+					operator === "|=" ? result === check || result.slice( 0, check.length + 1 ) === check + "-" :
+					false;
+				/* eslint-enable max-len */
+
+			};
+		},
+
+		"CHILD": function( type, what, _argument, first, last ) {
+			var simple = type.slice( 0, 3 ) !== "nth",
+				forward = type.slice( -4 ) !== "last",
+				ofType = what === "of-type";
+
+			return first === 1 && last === 0 ?
+
+				// Shortcut for :nth-*(n)
+				function( elem ) {
+					return !!elem.parentNode;
+				} :
+
+				function( elem, _context, xml ) {
+					var cache, uniqueCache, outerCache, node, nodeIndex, start,
+						dir = simple !== forward ? "nextSibling" : "previousSibling",
+						parent = elem.parentNode,
+						name = ofType && elem.nodeName.toLowerCase(),
+						useCache = !xml && !ofType,
+						diff = false;
+
+					if ( parent ) {
+
+						// :(first|last|only)-(child|of-type)
+						if ( simple ) {
+							while ( dir ) {
+								node = elem;
+								while ( ( node = node[ dir ] ) ) {
+									if ( ofType ?
+										node.nodeName.toLowerCase() === name :
+										node.nodeType === 1 ) {
+
+										return false;
+									}
+								}
+
+								// Reverse direction for :only-* (if we haven't yet done so)
+								start = dir = type === "only" && !start && "nextSibling";
+							}
+							return true;
+						}
+
+						start = [ forward ? parent.firstChild : parent.lastChild ];
+
+						// non-xml :nth-child(...) stores cache data on `parent`
+						if ( forward && useCache ) {
+
+							// Seek `elem` from a previously-cached index
+
+							// ...in a gzip-friendly way
+							node = parent;
+							outerCache = node[ expando ] || ( node[ expando ] = {} );
+
+							// Support: IE <9 only
+							// Defend against cloned attroperties (jQuery gh-1709)
+							uniqueCache = outerCache[ node.uniqueID ] ||
+								( outerCache[ node.uniqueID ] = {} );
+
+							cache = uniqueCache[ type ] || [];
+							nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ];
+							diff = nodeIndex && cache[ 2 ];
+							node = nodeIndex && parent.childNodes[ nodeIndex ];
+
+							while ( ( node = ++nodeIndex && node && node[ dir ] ||
+
+								// Fallback to seeking `elem` from the start
+								( diff = nodeIndex = 0 ) || start.pop() ) ) {
+
+								// When found, cache indexes on `parent` and break
+								if ( node.nodeType === 1 && ++diff && node === elem ) {
+									uniqueCache[ type ] = [ dirruns, nodeIndex, diff ];
+									break;
+								}
+							}
+
+						} else {
+
+							// Use previously-cached element index if available
+							if ( useCache ) {
+
+								// ...in a gzip-friendly way
+								node = elem;
+								outerCache = node[ expando ] || ( node[ expando ] = {} );
+
+								// Support: IE <9 only
+								// Defend against cloned attroperties (jQuery gh-1709)
+								uniqueCache = outerCache[ node.uniqueID ] ||
+									( outerCache[ node.uniqueID ] = {} );
+
+								cache = uniqueCache[ type ] || [];
+								nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ];
+								diff = nodeIndex;
+							}
+
+							// xml :nth-child(...)
+							// or :nth-last-child(...) or :nth(-last)?-of-type(...)
+							if ( diff === false ) {
+
+								// Use the same loop as above to seek `elem` from the start
+								while ( ( node = ++nodeIndex && node && node[ dir ] ||
+									( diff = nodeIndex = 0 ) || start.pop() ) ) {
+
+									if ( ( ofType ?
+										node.nodeName.toLowerCase() === name :
+										node.nodeType === 1 ) &&
+										++diff ) {
+
+										// Cache the index of each encountered element
+										if ( useCache ) {
+											outerCache = node[ expando ] ||
+												( node[ expando ] = {} );
+
+											// Support: IE <9 only
+											// Defend against cloned attroperties (jQuery gh-1709)
+											uniqueCache = outerCache[ node.uniqueID ] ||
+												( outerCache[ node.uniqueID ] = {} );
+
+											uniqueCache[ type ] = [ dirruns, diff ];
+										}
+
+										if ( node === elem ) {
+											break;
+										}
+									}
+								}
+							}
+						}
+
+						// Incorporate the offset, then check against cycle size
+						diff -= last;
+						return diff === first || ( diff % first === 0 && diff / first >= 0 );
+					}
+				};
+		},
+
+		"PSEUDO": function( pseudo, argument ) {
+
+			// pseudo-class names are case-insensitive
+			// http://www.w3.org/TR/selectors/#pseudo-classes
+			// Prioritize by case sensitivity in case custom pseudos are added with uppercase letters
+			// Remember that setFilters inherits from pseudos
+			var args,
+				fn = Expr.pseudos[ pseudo ] || Expr.setFilters[ pseudo.toLowerCase() ] ||
+					Sizzle.error( "unsupported pseudo: " + pseudo );
+
+			// The user may use createPseudo to indicate that
+			// arguments are needed to create the filter function
+			// just as Sizzle does
+			if ( fn[ expando ] ) {
+				return fn( argument );
+			}
+
+			// But maintain support for old signatures
+			if ( fn.length > 1 ) {
+				args = [ pseudo, pseudo, "", argument ];
+				return Expr.setFilters.hasOwnProperty( pseudo.toLowerCase() ) ?
+					markFunction( function( seed, matches ) {
+						var idx,
+							matched = fn( seed, argument ),
+							i = matched.length;
+						while ( i-- ) {
+							idx = indexOf( seed, matched[ i ] );
+							seed[ idx ] = !( matches[ idx ] = matched[ i ] );
+						}
+					} ) :
+					function( elem ) {
+						return fn( elem, 0, args );
+					};
+			}
+
+			return fn;
+		}
+	},
+
+	pseudos: {
+
+		// Potentially complex pseudos
+		"not": markFunction( function( selector ) {
+
+			// Trim the selector passed to compile
+			// to avoid treating leading and trailing
+			// spaces as combinators
+			var input = [],
+				results = [],
+				matcher = compile( selector.replace( rtrim, "$1" ) );
+
+			return matcher[ expando ] ?
+				markFunction( function( seed, matches, _context, xml ) {
+					var elem,
+						unmatched = matcher( seed, null, xml, [] ),
+						i = seed.length;
+
+					// Match elements unmatched by `matcher`
+					while ( i-- ) {
+						if ( ( elem = unmatched[ i ] ) ) {
+							seed[ i ] = !( matches[ i ] = elem );
+						}
+					}
+				} ) :
+				function( elem, _context, xml ) {
+					input[ 0 ] = elem;
+					matcher( input, null, xml, results );
+
+					// Don't keep the element (issue #299)
+					input[ 0 ] = null;
+					return !results.pop();
+				};
+		} ),
+
+		"has": markFunction( function( selector ) {
+			return function( elem ) {
+				return Sizzle( selector, elem ).length > 0;
+			};
+		} ),
+
+		"contains": markFunction( function( text ) {
+			text = text.replace( runescape, funescape );
+			return function( elem ) {
+				return ( elem.textContent || getText( elem ) ).indexOf( text ) > -1;
+			};
+		} ),
+
+		// "Whether an element is represented by a :lang() selector
+		// is based solely on the element's language value
+		// being equal to the identifier C,
+		// or beginning with the identifier C immediately followed by "-".
+		// The matching of C against the element's language value is performed case-insensitively.
+		// The identifier C does not have to be a valid language name."
+		// http://www.w3.org/TR/selectors/#lang-pseudo
+		"lang": markFunction( function( lang ) {
+
+			// lang value must be a valid identifier
+			if ( !ridentifier.test( lang || "" ) ) {
+				Sizzle.error( "unsupported lang: " + lang );
+			}
+			lang = lang.replace( runescape, funescape ).toLowerCase();
+			return function( elem ) {
+				var elemLang;
+				do {
+					if ( ( elemLang = documentIsHTML ?
+						elem.lang :
+						elem.getAttribute( "xml:lang" ) || elem.getAttribute( "lang" ) ) ) {
+
+						elemLang = elemLang.toLowerCase();
+						return elemLang === lang || elemLang.indexOf( lang + "-" ) === 0;
+					}
+				} while ( ( elem = elem.parentNode ) && elem.nodeType === 1 );
+				return false;
+			};
+		} ),
+
+		// Miscellaneous
+		"target": function( elem ) {
+			var hash = window.location && window.location.hash;
+			return hash && hash.slice( 1 ) === elem.id;
+		},
+
+		"root": function( elem ) {
+			return elem === docElem;
+		},
+
+		"focus": function( elem ) {
+			return elem === document.activeElement &&
+				( !document.hasFocus || document.hasFocus() ) &&
+				!!( elem.type || elem.href || ~elem.tabIndex );
+		},
+
+		// Boolean properties
+		"enabled": createDisabledPseudo( false ),
+		"disabled": createDisabledPseudo( true ),
+
+		"checked": function( elem ) {
+
+			// In CSS3, :checked should return both checked and selected elements
+			// http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked
+			var nodeName = elem.nodeName.toLowerCase();
+			return ( nodeName === "input" && !!elem.checked ) ||
+				( nodeName === "option" && !!elem.selected );
+		},
+
+		"selected": function( elem ) {
+
+			// Accessing this property makes selected-by-default
+			// options in Safari work properly
+			if ( elem.parentNode ) {
+				// eslint-disable-next-line no-unused-expressions
+				elem.parentNode.selectedIndex;
+			}
+
+			return elem.selected === true;
+		},
+
+		// Contents
+		"empty": function( elem ) {
+
+			// http://www.w3.org/TR/selectors/#empty-pseudo
+			// :empty is negated by element (1) or content nodes (text: 3; cdata: 4; entity ref: 5),
+			//   but not by others (comment: 8; processing instruction: 7; etc.)
+			// nodeType < 6 works because attributes (2) do not appear as children
+			for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) {
+				if ( elem.nodeType < 6 ) {
+					return false;
+				}
+			}
+			return true;
+		},
+
+		"parent": function( elem ) {
+			return !Expr.pseudos[ "empty" ]( elem );
+		},
+
+		// Element/input types
+		"header": function( elem ) {
+			return rheader.test( elem.nodeName );
+		},
+
+		"input": function( elem ) {
+			return rinputs.test( elem.nodeName );
+		},
+
+		"button": function( elem ) {
+			var name = elem.nodeName.toLowerCase();
+			return name === "input" && elem.type === "button" || name === "button";
+		},
+
+		"text": function( elem ) {
+			var attr;
+			return elem.nodeName.toLowerCase() === "input" &&
+				elem.type === "text" &&
+
+				// Support: IE<8
+				// New HTML5 attribute values (e.g., "search") appear with elem.type === "text"
+				( ( attr = elem.getAttribute( "type" ) ) == null ||
+					attr.toLowerCase() === "text" );
+		},
+
+		// Position-in-collection
+		"first": createPositionalPseudo( function() {
+			return [ 0 ];
+		} ),
+
+		"last": createPositionalPseudo( function( _matchIndexes, length ) {
+			return [ length - 1 ];
+		} ),
+
+		"eq": createPositionalPseudo( function( _matchIndexes, length, argument ) {
+			return [ argument < 0 ? argument + length : argument ];
+		} ),
+
+		"even": createPositionalPseudo( function( matchIndexes, length ) {
+			var i = 0;
+			for ( ; i < length; i += 2 ) {
+				matchIndexes.push( i );
+			}
+			return matchIndexes;
+		} ),
+
+		"odd": createPositionalPseudo( function( matchIndexes, length ) {
+			var i = 1;
+			for ( ; i < length; i += 2 ) {
+				matchIndexes.push( i );
+			}
+			return matchIndexes;
+		} ),
+
+		"lt": createPositionalPseudo( function( matchIndexes, length, argument ) {
+			var i = argument < 0 ?
+				argument + length :
+				argument > length ?
+					length :
+					argument;
+			for ( ; --i >= 0; ) {
+				matchIndexes.push( i );
+			}
+			return matchIndexes;
+		} ),
+
+		"gt": createPositionalPseudo( function( matchIndexes, length, argument ) {
+			var i = argument < 0 ? argument + length : argument;
+			for ( ; ++i < length; ) {
+				matchIndexes.push( i );
+			}
+			return matchIndexes;
+		} )
+	}
+};
+
+Expr.pseudos[ "nth" ] = Expr.pseudos[ "eq" ];
+
+// Add button/input type pseudos
+for ( i in { radio: true, checkbox: true, file: true, password: true, image: true } ) {
+	Expr.pseudos[ i ] = createInputPseudo( i );
+}
+for ( i in { submit: true, reset: true } ) {
+	Expr.pseudos[ i ] = createButtonPseudo( i );
+}
+
+// Easy API for creating new setFilters
+function setFilters() {}
+setFilters.prototype = Expr.filters = Expr.pseudos;
+Expr.setFilters = new setFilters();
+
+tokenize = Sizzle.tokenize = function( selector, parseOnly ) {
+	var matched, match, tokens, type,
+		soFar, groups, preFilters,
+		cached = tokenCache[ selector + " " ];
+
+	if ( cached ) {
+		return parseOnly ? 0 : cached.slice( 0 );
+	}
+
+	soFar = selector;
+	groups = [];
+	preFilters = Expr.preFilter;
+
+	while ( soFar ) {
+
+		// Comma and first run
+		if ( !matched || ( match = rcomma.exec( soFar ) ) ) {
+			if ( match ) {
+
+				// Don't consume trailing commas as valid
+				soFar = soFar.slice( match[ 0 ].length ) || soFar;
+			}
+			groups.push( ( tokens = [] ) );
+		}
+
+		matched = false;
+
+		// Combinators
+		if ( ( match = rcombinators.exec( soFar ) ) ) {
+			matched = match.shift();
+			tokens.push( {
+				value: matched,
+
+				// Cast descendant combinators to space
+				type: match[ 0 ].replace( rtrim, " " )
+			} );
+			soFar = soFar.slice( matched.length );
+		}
+
+		// Filters
+		for ( type in Expr.filter ) {
+			if ( ( match = matchExpr[ type ].exec( soFar ) ) && ( !preFilters[ type ] ||
+				( match = preFilters[ type ]( match ) ) ) ) {
+				matched = match.shift();
+				tokens.push( {
+					value: matched,
+					type: type,
+					matches: match
+				} );
+				soFar = soFar.slice( matched.length );
+			}
+		}
+
+		if ( !matched ) {
+			break;
+		}
+	}
+
+	// Return the length of the invalid excess
+	// if we're just parsing
+	// Otherwise, throw an error or return tokens
+	return parseOnly ?
+		soFar.length :
+		soFar ?
+			Sizzle.error( selector ) :
+
+			// Cache the tokens
+			tokenCache( selector, groups ).slice( 0 );
+};
+
+function toSelector( tokens ) {
+	var i = 0,
+		len = tokens.length,
+		selector = "";
+	for ( ; i < len; i++ ) {
+		selector += tokens[ i ].value;
+	}
+	return selector;
+}
+
+function addCombinator( matcher, combinator, base ) {
+	var dir = combinator.dir,
+		skip = combinator.next,
+		key = skip || dir,
+		checkNonElements = base && key === "parentNode",
+		doneName = done++;
+
+	return combinator.first ?
+
+		// Check against closest ancestor/preceding element
+		function( elem, context, xml ) {
+			while ( ( elem = elem[ dir ] ) ) {
+				if ( elem.nodeType === 1 || checkNonElements ) {
+					return matcher( elem, context, xml );
+				}
+			}
+			return false;
+		} :
+
+		// Check against all ancestor/preceding elements
+		function( elem, context, xml ) {
+			var oldCache, uniqueCache, outerCache,
+				newCache = [ dirruns, doneName ];
+
+			// We can't set arbitrary data on XML nodes, so they don't benefit from combinator caching
+			if ( xml ) {
+				while ( ( elem = elem[ dir ] ) ) {
+					if ( elem.nodeType === 1 || checkNonElements ) {
+						if ( matcher( elem, context, xml ) ) {
+							return true;
+						}
+					}
+				}
+			} else {
+				while ( ( elem = elem[ dir ] ) ) {
+					if ( elem.nodeType === 1 || checkNonElements ) {
+						outerCache = elem[ expando ] || ( elem[ expando ] = {} );
+
+						// Support: IE <9 only
+						// Defend against cloned attroperties (jQuery gh-1709)
+						uniqueCache = outerCache[ elem.uniqueID ] ||
+							( outerCache[ elem.uniqueID ] = {} );
+
+						if ( skip && skip === elem.nodeName.toLowerCase() ) {
+							elem = elem[ dir ] || elem;
+						} else if ( ( oldCache = uniqueCache[ key ] ) &&
+							oldCache[ 0 ] === dirruns && oldCache[ 1 ] === doneName ) {
+
+							// Assign to newCache so results back-propagate to previous elements
+							return ( newCache[ 2 ] = oldCache[ 2 ] );
+						} else {
+
+							// Reuse newcache so results back-propagate to previous elements
+							uniqueCache[ key ] = newCache;
+
+							// A match means we're done; a fail means we have to keep checking
+							if ( ( newCache[ 2 ] = matcher( elem, context, xml ) ) ) {
+								return true;
+							}
+						}
+					}
+				}
+			}
+			return false;
+		};
+}
+
+function elementMatcher( matchers ) {
+	return matchers.length > 1 ?
+		function( elem, context, xml ) {
+			var i = matchers.length;
+			while ( i-- ) {
+				if ( !matchers[ i ]( elem, context, xml ) ) {
+					return false;
+				}
+			}
+			return true;
+		} :
+		matchers[ 0 ];
+}
+
+function multipleContexts( selector, contexts, results ) {
+	var i = 0,
+		len = contexts.length;
+	for ( ; i < len; i++ ) {
+		Sizzle( selector, contexts[ i ], results );
+	}
+	return results;
+}
+
+function condense( unmatched, map, filter, context, xml ) {
+	var elem,
+		newUnmatched = [],
+		i = 0,
+		len = unmatched.length,
+		mapped = map != null;
+
+	for ( ; i < len; i++ ) {
+		if ( ( elem = unmatched[ i ] ) ) {
+			if ( !filter || filter( elem, context, xml ) ) {
+				newUnmatched.push( elem );
+				if ( mapped ) {
+					map.push( i );
+				}
+			}
+		}
+	}
+
+	return newUnmatched;
+}
+
+function setMatcher( preFilter, selector, matcher, postFilter, postFinder, postSelector ) {
+	if ( postFilter && !postFilter[ expando ] ) {
+		postFilter = setMatcher( postFilter );
+	}
+	if ( postFinder && !postFinder[ expando ] ) {
+		postFinder = setMatcher( postFinder, postSelector );
+	}
+	return markFunction( function( seed, results, context, xml ) {
+		var temp, i, elem,
+			preMap = [],
+			postMap = [],
+			preexisting = results.length,
+
+			// Get initial elements from seed or context
+			elems = seed || multipleContexts(
+				selector || "*",
+				context.nodeType ? [ context ] : context,
+				[]
+			),
+
+			// Prefilter to get matcher input, preserving a map for seed-results synchronization
+			matcherIn = preFilter && ( seed || !selector ) ?
+				condense( elems, preMap, preFilter, context, xml ) :
+				elems,
+
+			matcherOut = matcher ?
+
+				// If we have a postFinder, or filtered seed, or non-seed postFilter or preexisting results,
+				postFinder || ( seed ? preFilter : preexisting || postFilter ) ?
+
+					// ...intermediate processing is necessary
+					[] :
+
+					// ...otherwise use results directly
+					results :
+				matcherIn;
+
+		// Find primary matches
+		if ( matcher ) {
+			matcher( matcherIn, matcherOut, context, xml );
+		}
+
+		// Apply postFilter
+		if ( postFilter ) {
+			temp = condense( matcherOut, postMap );
+			postFilter( temp, [], context, xml );
+
+			// Un-match failing elements by moving them back to matcherIn
+			i = temp.length;
+			while ( i-- ) {
+				if ( ( elem = temp[ i ] ) ) {
+					matcherOut[ postMap[ i ] ] = !( matcherIn[ postMap[ i ] ] = elem );
+				}
+			}
+		}
+
+		if ( seed ) {
+			if ( postFinder || preFilter ) {
+				if ( postFinder ) {
+
+					// Get the final matcherOut by condensing this intermediate into postFinder contexts
+					temp = [];
+					i = matcherOut.length;
+					while ( i-- ) {
+						if ( ( elem = matcherOut[ i ] ) ) {
+
+							// Restore matcherIn since elem is not yet a final match
+							temp.push( ( matcherIn[ i ] = elem ) );
+						}
+					}
+					postFinder( null, ( matcherOut = [] ), temp, xml );
+				}
+
+				// Move matched elements from seed to results to keep them synchronized
+				i = matcherOut.length;
+				while ( i-- ) {
+					if ( ( elem = matcherOut[ i ] ) &&
+						( temp = postFinder ? indexOf( seed, elem ) : preMap[ i ] ) > -1 ) {
+
+						seed[ temp ] = !( results[ temp ] = elem );
+					}
+				}
+			}
+
+		// Add elements to results, through postFinder if defined
+		} else {
+			matcherOut = condense(
+				matcherOut === results ?
+					matcherOut.splice( preexisting, matcherOut.length ) :
+					matcherOut
+			);
+			if ( postFinder ) {
+				postFinder( null, results, matcherOut, xml );
+			} else {
+				push.apply( results, matcherOut );
+			}
+		}
+	} );
+}
+
+function matcherFromTokens( tokens ) {
+	var checkContext, matcher, j,
+		len = tokens.length,
+		leadingRelative = Expr.relative[ tokens[ 0 ].type ],
+		implicitRelative = leadingRelative || Expr.relative[ " " ],
+		i = leadingRelative ? 1 : 0,
+
+		// The foundational matcher ensures that elements are reachable from top-level context(s)
+		matchContext = addCombinator( function( elem ) {
+			return elem === checkContext;
+		}, implicitRelative, true ),
+		matchAnyContext = addCombinator( function( elem ) {
+			return indexOf( checkContext, elem ) > -1;
+		}, implicitRelative, true ),
+		matchers = [ function( elem, context, xml ) {
+			var ret = ( !leadingRelative && ( xml || context !== outermostContext ) ) || (
+				( checkContext = context ).nodeType ?
+					matchContext( elem, context, xml ) :
+					matchAnyContext( elem, context, xml ) );
+
+			// Avoid hanging onto element (issue #299)
+			checkContext = null;
+			return ret;
+		} ];
+
+	for ( ; i < len; i++ ) {
+		if ( ( matcher = Expr.relative[ tokens[ i ].type ] ) ) {
+			matchers = [ addCombinator( elementMatcher( matchers ), matcher ) ];
+		} else {
+			matcher = Expr.filter[ tokens[ i ].type ].apply( null, tokens[ i ].matches );
+
+			// Return special upon seeing a positional matcher
+			if ( matcher[ expando ] ) {
+
+				// Find the next relative operator (if any) for proper handling
+				j = ++i;
+				for ( ; j < len; j++ ) {
+					if ( Expr.relative[ tokens[ j ].type ] ) {
+						break;
+					}
+				}
+				return setMatcher(
+					i > 1 && elementMatcher( matchers ),
+					i > 1 && toSelector(
+
+					// If the preceding token was a descendant combinator, insert an implicit any-element `*`
+					tokens
+						.slice( 0, i - 1 )
+						.concat( { value: tokens[ i - 2 ].type === " " ? "*" : "" } )
+					).replace( rtrim, "$1" ),
+					matcher,
+					i < j && matcherFromTokens( tokens.slice( i, j ) ),
+					j < len && matcherFromTokens( ( tokens = tokens.slice( j ) ) ),
+					j < len && toSelector( tokens )
+				);
+			}
+			matchers.push( matcher );
+		}
+	}
+
+	return elementMatcher( matchers );
+}
+
+function matcherFromGroupMatchers( elementMatchers, setMatchers ) {
+	var bySet = setMatchers.length > 0,
+		byElement = elementMatchers.length > 0,
+		superMatcher = function( seed, context, xml, results, outermost ) {
+			var elem, j, matcher,
+				matchedCount = 0,
+				i = "0",
+				unmatched = seed && [],
+				setMatched = [],
+				contextBackup = outermostContext,
+
+				// We must always have either seed elements or outermost context
+				elems = seed || byElement && Expr.find[ "TAG" ]( "*", outermost ),
+
+				// Use integer dirruns iff this is the outermost matcher
+				dirrunsUnique = ( dirruns += contextBackup == null ? 1 : Math.random() || 0.1 ),
+				len = elems.length;
+
+			if ( outermost ) {
+
+				// Support: IE 11+, Edge 17 - 18+
+				// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+				// two documents; shallow comparisons work.
+				// eslint-disable-next-line eqeqeq
+				outermostContext = context == document || context || outermost;
+			}
+
+			// Add elements passing elementMatchers directly to results
+			// Support: IE<9, Safari
+			// Tolerate NodeList properties (IE: "length"; Safari: ) matching elements by id
+			for ( ; i !== len && ( elem = elems[ i ] ) != null; i++ ) {
+				if ( byElement && elem ) {
+					j = 0;
+
+					// Support: IE 11+, Edge 17 - 18+
+					// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+					// two documents; shallow comparisons work.
+					// eslint-disable-next-line eqeqeq
+					if ( !context && elem.ownerDocument != document ) {
+						setDocument( elem );
+						xml = !documentIsHTML;
+					}
+					while ( ( matcher = elementMatchers[ j++ ] ) ) {
+						if ( matcher( elem, context || document, xml ) ) {
+							results.push( elem );
+							break;
+						}
+					}
+					if ( outermost ) {
+						dirruns = dirrunsUnique;
+					}
+				}
+
+				// Track unmatched elements for set filters
+				if ( bySet ) {
+
+					// They will have gone through all possible matchers
+					if ( ( elem = !matcher && elem ) ) {
+						matchedCount--;
+					}
+
+					// Lengthen the array for every element, matched or not
+					if ( seed ) {
+						unmatched.push( elem );
+					}
+				}
+			}
+
+			// `i` is now the count of elements visited above, and adding it to `matchedCount`
+			// makes the latter nonnegative.
+			matchedCount += i;
+
+			// Apply set filters to unmatched elements
+			// NOTE: This can be skipped if there are no unmatched elements (i.e., `matchedCount`
+			// equals `i`), unless we didn't visit _any_ elements in the above loop because we have
+			// no element matchers and no seed.
+			// Incrementing an initially-string "0" `i` allows `i` to remain a string only in that
+			// case, which will result in a "00" `matchedCount` that differs from `i` but is also
+			// numerically zero.
+			if ( bySet && i !== matchedCount ) {
+				j = 0;
+				while ( ( matcher = setMatchers[ j++ ] ) ) {
+					matcher( unmatched, setMatched, context, xml );
+				}
+
+				if ( seed ) {
+
+					// Reintegrate element matches to eliminate the need for sorting
+					if ( matchedCount > 0 ) {
+						while ( i-- ) {
+							if ( !( unmatched[ i ] || setMatched[ i ] ) ) {
+								setMatched[ i ] = pop.call( results );
+							}
+						}
+					}
+
+					// Discard index placeholder values to get only actual matches
+					setMatched = condense( setMatched );
+				}
+
+				// Add matches to results
+				push.apply( results, setMatched );
+
+				// Seedless set matches succeeding multiple successful matchers stipulate sorting
+				if ( outermost && !seed && setMatched.length > 0 &&
+					( matchedCount + setMatchers.length ) > 1 ) {
+
+					Sizzle.uniqueSort( results );
+				}
+			}
+
+			// Override manipulation of globals by nested matchers
+			if ( outermost ) {
+				dirruns = dirrunsUnique;
+				outermostContext = contextBackup;
+			}
+
+			return unmatched;
+		};
+
+	return bySet ?
+		markFunction( superMatcher ) :
+		superMatcher;
+}
+
+compile = Sizzle.compile = function( selector, match /* Internal Use Only */ ) {
+	var i,
+		setMatchers = [],
+		elementMatchers = [],
+		cached = compilerCache[ selector + " " ];
+
+	if ( !cached ) {
+
+		// Generate a function of recursive functions that can be used to check each element
+		if ( !match ) {
+			match = tokenize( selector );
+		}
+		i = match.length;
+		while ( i-- ) {
+			cached = matcherFromTokens( match[ i ] );
+			if ( cached[ expando ] ) {
+				setMatchers.push( cached );
+			} else {
+				elementMatchers.push( cached );
+			}
+		}
+
+		// Cache the compiled function
+		cached = compilerCache(
+			selector,
+			matcherFromGroupMatchers( elementMatchers, setMatchers )
+		);
+
+		// Save selector and tokenization
+		cached.selector = selector;
+	}
+	return cached;
+};
+
+/**
+ * A low-level selection function that works with Sizzle's compiled
+ *  selector functions
+ * @param {String|Function} selector A selector or a pre-compiled
+ *  selector function built with Sizzle.compile
+ * @param {Element} context
+ * @param {Array} [results]
+ * @param {Array} [seed] A set of elements to match against
+ */
+select = Sizzle.select = function( selector, context, results, seed ) {
+	var i, tokens, token, type, find,
+		compiled = typeof selector === "function" && selector,
+		match = !seed && tokenize( ( selector = compiled.selector || selector ) );
+
+	results = results || [];
+
+	// Try to minimize operations if there is only one selector in the list and no seed
+	// (the latter of which guarantees us context)
+	if ( match.length === 1 ) {
+
+		// Reduce context if the leading compound selector is an ID
+		tokens = match[ 0 ] = match[ 0 ].slice( 0 );
+		if ( tokens.length > 2 && ( token = tokens[ 0 ] ).type === "ID" &&
+			context.nodeType === 9 && documentIsHTML && Expr.relative[ tokens[ 1 ].type ] ) {
+
+			context = ( Expr.find[ "ID" ]( token.matches[ 0 ]
+				.replace( runescape, funescape ), context ) || [] )[ 0 ];
+			if ( !context ) {
+				return results;
+
+			// Precompiled matchers will still verify ancestry, so step up a level
+			} else if ( compiled ) {
+				context = context.parentNode;
+			}
+
+			selector = selector.slice( tokens.shift().value.length );
+		}
+
+		// Fetch a seed set for right-to-left matching
+		i = matchExpr[ "needsContext" ].test( selector ) ? 0 : tokens.length;
+		while ( i-- ) {
+			token = tokens[ i ];
+
+			// Abort if we hit a combinator
+			if ( Expr.relative[ ( type = token.type ) ] ) {
+				break;
+			}
+			if ( ( find = Expr.find[ type ] ) ) {
+
+				// Search, expanding context for leading sibling combinators
+				if ( ( seed = find(
+					token.matches[ 0 ].replace( runescape, funescape ),
+					rsibling.test( tokens[ 0 ].type ) && testContext( context.parentNode ) ||
+						context
+				) ) ) {
+
+					// If seed is empty or no tokens remain, we can return early
+					tokens.splice( i, 1 );
+					selector = seed.length && toSelector( tokens );
+					if ( !selector ) {
+						push.apply( results, seed );
+						return results;
+					}
+
+					break;
+				}
+			}
+		}
+	}
+
+	// Compile and execute a filtering function if one is not provided
+	// Provide `match` to avoid retokenization if we modified the selector above
+	( compiled || compile( selector, match ) )(
+		seed,
+		context,
+		!documentIsHTML,
+		results,
+		!context || rsibling.test( selector ) && testContext( context.parentNode ) || context
+	);
+	return results;
+};
+
+// One-time assignments
+
+// Sort stability
+support.sortStable = expando.split( "" ).sort( sortOrder ).join( "" ) === expando;
+
+// Support: Chrome 14-35+
+// Always assume duplicates if they aren't passed to the comparison function
+support.detectDuplicates = !!hasDuplicate;
+
+// Initialize against the default document
+setDocument();
+
+// Support: Webkit<537.32 - Safari 6.0.3/Chrome 25 (fixed in Chrome 27)
+// Detached nodes confoundingly follow *each other*
+support.sortDetached = assert( function( el ) {
+
+	// Should return 1, but returns 4 (following)
+	return el.compareDocumentPosition( document.createElement( "fieldset" ) ) & 1;
+} );
+
+// Support: IE<8
+// Prevent attribute/property "interpolation"
+// https://msdn.microsoft.com/en-us/library/ms536429%28VS.85%29.aspx
+if ( !assert( function( el ) {
+	el.innerHTML = "";
+	return el.firstChild.getAttribute( "href" ) === "#";
+} ) ) {
+	addHandle( "type|href|height|width", function( elem, name, isXML ) {
+		if ( !isXML ) {
+			return elem.getAttribute( name, name.toLowerCase() === "type" ? 1 : 2 );
+		}
+	} );
+}
+
+// Support: IE<9
+// Use defaultValue in place of getAttribute("value")
+if ( !support.attributes || !assert( function( el ) {
+	el.innerHTML = "";
+	el.firstChild.setAttribute( "value", "" );
+	return el.firstChild.getAttribute( "value" ) === "";
+} ) ) {
+	addHandle( "value", function( elem, _name, isXML ) {
+		if ( !isXML && elem.nodeName.toLowerCase() === "input" ) {
+			return elem.defaultValue;
+		}
+	} );
+}
+
+// Support: IE<9
+// Use getAttributeNode to fetch booleans when getAttribute lies
+if ( !assert( function( el ) {
+	return el.getAttribute( "disabled" ) == null;
+} ) ) {
+	addHandle( booleans, function( elem, name, isXML ) {
+		var val;
+		if ( !isXML ) {
+			return elem[ name ] === true ? name.toLowerCase() :
+				( val = elem.getAttributeNode( name ) ) && val.specified ?
+					val.value :
+					null;
+		}
+	} );
+}
+
+return Sizzle;
+
+} )( window );
+
+
+
+jQuery.find = Sizzle;
+jQuery.expr = Sizzle.selectors;
+
+// Deprecated
+jQuery.expr[ ":" ] = jQuery.expr.pseudos;
+jQuery.uniqueSort = jQuery.unique = Sizzle.uniqueSort;
+jQuery.text = Sizzle.getText;
+jQuery.isXMLDoc = Sizzle.isXML;
+jQuery.contains = Sizzle.contains;
+jQuery.escapeSelector = Sizzle.escape;
+
+
+
+
+var dir = function( elem, dir, until ) {
+	var matched = [],
+		truncate = until !== undefined;
+
+	while ( ( elem = elem[ dir ] ) && elem.nodeType !== 9 ) {
+		if ( elem.nodeType === 1 ) {
+			if ( truncate && jQuery( elem ).is( until ) ) {
+				break;
+			}
+			matched.push( elem );
+		}
+	}
+	return matched;
+};
+
+
+var siblings = function( n, elem ) {
+	var matched = [];
+
+	for ( ; n; n = n.nextSibling ) {
+		if ( n.nodeType === 1 && n !== elem ) {
+			matched.push( n );
+		}
+	}
+
+	return matched;
+};
+
+
+var rneedsContext = jQuery.expr.match.needsContext;
+
+
+
+function nodeName( elem, name ) {
+
+	return elem.nodeName && elem.nodeName.toLowerCase() === name.toLowerCase();
+
+}
+var rsingleTag = ( /^<([a-z][^\/\0>:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i );
+
+
+
+// Implement the identical functionality for filter and not
+function winnow( elements, qualifier, not ) {
+	if ( isFunction( qualifier ) ) {
+		return jQuery.grep( elements, function( elem, i ) {
+			return !!qualifier.call( elem, i, elem ) !== not;
+		} );
+	}
+
+	// Single element
+	if ( qualifier.nodeType ) {
+		return jQuery.grep( elements, function( elem ) {
+			return ( elem === qualifier ) !== not;
+		} );
+	}
+
+	// Arraylike of elements (jQuery, arguments, Array)
+	if ( typeof qualifier !== "string" ) {
+		return jQuery.grep( elements, function( elem ) {
+			return ( indexOf.call( qualifier, elem ) > -1 ) !== not;
+		} );
+	}
+
+	// Filtered directly for both simple and complex selectors
+	return jQuery.filter( qualifier, elements, not );
+}
+
+jQuery.filter = function( expr, elems, not ) {
+	var elem = elems[ 0 ];
+
+	if ( not ) {
+		expr = ":not(" + expr + ")";
+	}
+
+	if ( elems.length === 1 && elem.nodeType === 1 ) {
+		return jQuery.find.matchesSelector( elem, expr ) ? [ elem ] : [];
+	}
+
+	return jQuery.find.matches( expr, jQuery.grep( elems, function( elem ) {
+		return elem.nodeType === 1;
+	} ) );
+};
+
+jQuery.fn.extend( {
+	find: function( selector ) {
+		var i, ret,
+			len = this.length,
+			self = this;
+
+		if ( typeof selector !== "string" ) {
+			return this.pushStack( jQuery( selector ).filter( function() {
+				for ( i = 0; i < len; i++ ) {
+					if ( jQuery.contains( self[ i ], this ) ) {
+						return true;
+					}
+				}
+			} ) );
+		}
+
+		ret = this.pushStack( [] );
+
+		for ( i = 0; i < len; i++ ) {
+			jQuery.find( selector, self[ i ], ret );
+		}
+
+		return len > 1 ? jQuery.uniqueSort( ret ) : ret;
+	},
+	filter: function( selector ) {
+		return this.pushStack( winnow( this, selector || [], false ) );
+	},
+	not: function( selector ) {
+		return this.pushStack( winnow( this, selector || [], true ) );
+	},
+	is: function( selector ) {
+		return !!winnow(
+			this,
+
+			// If this is a positional/relative selector, check membership in the returned set
+			// so $("p:first").is("p:last") won't return true for a doc with two "p".
+			typeof selector === "string" && rneedsContext.test( selector ) ?
+				jQuery( selector ) :
+				selector || [],
+			false
+		).length;
+	}
+} );
+
+
+// Initialize a jQuery object
+
+
+// A central reference to the root jQuery(document)
+var rootjQuery,
+
+	// A simple way to check for HTML strings
+	// Prioritize #id over  to avoid XSS via location.hash (#9521)
+	// Strict HTML recognition (#11290: must start with <)
+	// Shortcut simple #id case for speed
+	rquickExpr = /^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]+))$/,
+
+	init = jQuery.fn.init = function( selector, context, root ) {
+		var match, elem;
+
+		// HANDLE: $(""), $(null), $(undefined), $(false)
+		if ( !selector ) {
+			return this;
+		}
+
+		// Method init() accepts an alternate rootjQuery
+		// so migrate can support jQuery.sub (gh-2101)
+		root = root || rootjQuery;
+
+		// Handle HTML strings
+		if ( typeof selector === "string" ) {
+			if ( selector[ 0 ] === "<" &&
+				selector[ selector.length - 1 ] === ">" &&
+				selector.length >= 3 ) {
+
+				// Assume that strings that start and end with <> are HTML and skip the regex check
+				match = [ null, selector, null ];
+
+			} else {
+				match = rquickExpr.exec( selector );
+			}
+
+			// Match html or make sure no context is specified for #id
+			if ( match && ( match[ 1 ] || !context ) ) {
+
+				// HANDLE: $(html) -> $(array)
+				if ( match[ 1 ] ) {
+					context = context instanceof jQuery ? context[ 0 ] : context;
+
+					// Option to run scripts is true for back-compat
+					// Intentionally let the error be thrown if parseHTML is not present
+					jQuery.merge( this, jQuery.parseHTML(
+						match[ 1 ],
+						context && context.nodeType ? context.ownerDocument || context : document,
+						true
+					) );
+
+					// HANDLE: $(html, props)
+					if ( rsingleTag.test( match[ 1 ] ) && jQuery.isPlainObject( context ) ) {
+						for ( match in context ) {
+
+							// Properties of context are called as methods if possible
+							if ( isFunction( this[ match ] ) ) {
+								this[ match ]( context[ match ] );
+
+							// ...and otherwise set as attributes
+							} else {
+								this.attr( match, context[ match ] );
+							}
+						}
+					}
+
+					return this;
+
+				// HANDLE: $(#id)
+				} else {
+					elem = document.getElementById( match[ 2 ] );
+
+					if ( elem ) {
+
+						// Inject the element directly into the jQuery object
+						this[ 0 ] = elem;
+						this.length = 1;
+					}
+					return this;
+				}
+
+			// HANDLE: $(expr, $(...))
+			} else if ( !context || context.jquery ) {
+				return ( context || root ).find( selector );
+
+			// HANDLE: $(expr, context)
+			// (which is just equivalent to: $(context).find(expr)
+			} else {
+				return this.constructor( context ).find( selector );
+			}
+
+		// HANDLE: $(DOMElement)
+		} else if ( selector.nodeType ) {
+			this[ 0 ] = selector;
+			this.length = 1;
+			return this;
+
+		// HANDLE: $(function)
+		// Shortcut for document ready
+		} else if ( isFunction( selector ) ) {
+			return root.ready !== undefined ?
+				root.ready( selector ) :
+
+				// Execute immediately if ready is not present
+				selector( jQuery );
+		}
+
+		return jQuery.makeArray( selector, this );
+	};
+
+// Give the init function the jQuery prototype for later instantiation
+init.prototype = jQuery.fn;
+
+// Initialize central reference
+rootjQuery = jQuery( document );
+
+
+var rparentsprev = /^(?:parents|prev(?:Until|All))/,
+
+	// Methods guaranteed to produce a unique set when starting from a unique set
+	guaranteedUnique = {
+		children: true,
+		contents: true,
+		next: true,
+		prev: true
+	};
+
+jQuery.fn.extend( {
+	has: function( target ) {
+		var targets = jQuery( target, this ),
+			l = targets.length;
+
+		return this.filter( function() {
+			var i = 0;
+			for ( ; i < l; i++ ) {
+				if ( jQuery.contains( this, targets[ i ] ) ) {
+					return true;
+				}
+			}
+		} );
+	},
+
+	closest: function( selectors, context ) {
+		var cur,
+			i = 0,
+			l = this.length,
+			matched = [],
+			targets = typeof selectors !== "string" && jQuery( selectors );
+
+		// Positional selectors never match, since there's no _selection_ context
+		if ( !rneedsContext.test( selectors ) ) {
+			for ( ; i < l; i++ ) {
+				for ( cur = this[ i ]; cur && cur !== context; cur = cur.parentNode ) {
+
+					// Always skip document fragments
+					if ( cur.nodeType < 11 && ( targets ?
+						targets.index( cur ) > -1 :
+
+						// Don't pass non-elements to Sizzle
+						cur.nodeType === 1 &&
+							jQuery.find.matchesSelector( cur, selectors ) ) ) {
+
+						matched.push( cur );
+						break;
+					}
+				}
+			}
+		}
+
+		return this.pushStack( matched.length > 1 ? jQuery.uniqueSort( matched ) : matched );
+	},
+
+	// Determine the position of an element within the set
+	index: function( elem ) {
+
+		// No argument, return index in parent
+		if ( !elem ) {
+			return ( this[ 0 ] && this[ 0 ].parentNode ) ? this.first().prevAll().length : -1;
+		}
+
+		// Index in selector
+		if ( typeof elem === "string" ) {
+			return indexOf.call( jQuery( elem ), this[ 0 ] );
+		}
+
+		// Locate the position of the desired element
+		return indexOf.call( this,
+
+			// If it receives a jQuery object, the first element is used
+			elem.jquery ? elem[ 0 ] : elem
+		);
+	},
+
+	add: function( selector, context ) {
+		return this.pushStack(
+			jQuery.uniqueSort(
+				jQuery.merge( this.get(), jQuery( selector, context ) )
+			)
+		);
+	},
+
+	addBack: function( selector ) {
+		return this.add( selector == null ?
+			this.prevObject : this.prevObject.filter( selector )
+		);
+	}
+} );
+
+function sibling( cur, dir ) {
+	while ( ( cur = cur[ dir ] ) && cur.nodeType !== 1 ) {}
+	return cur;
+}
+
+jQuery.each( {
+	parent: function( elem ) {
+		var parent = elem.parentNode;
+		return parent && parent.nodeType !== 11 ? parent : null;
+	},
+	parents: function( elem ) {
+		return dir( elem, "parentNode" );
+	},
+	parentsUntil: function( elem, _i, until ) {
+		return dir( elem, "parentNode", until );
+	},
+	next: function( elem ) {
+		return sibling( elem, "nextSibling" );
+	},
+	prev: function( elem ) {
+		return sibling( elem, "previousSibling" );
+	},
+	nextAll: function( elem ) {
+		return dir( elem, "nextSibling" );
+	},
+	prevAll: function( elem ) {
+		return dir( elem, "previousSibling" );
+	},
+	nextUntil: function( elem, _i, until ) {
+		return dir( elem, "nextSibling", until );
+	},
+	prevUntil: function( elem, _i, until ) {
+		return dir( elem, "previousSibling", until );
+	},
+	siblings: function( elem ) {
+		return siblings( ( elem.parentNode || {} ).firstChild, elem );
+	},
+	children: function( elem ) {
+		return siblings( elem.firstChild );
+	},
+	contents: function( elem ) {
+		if ( elem.contentDocument != null &&
+
+			// Support: IE 11+
+			//  elements with no `data` attribute has an object
+			// `contentDocument` with a `null` prototype.
+			getProto( elem.contentDocument ) ) {
+
+			return elem.contentDocument;
+		}
+
+		// Support: IE 9 - 11 only, iOS 7 only, Android Browser <=4.3 only
+		// Treat the template element as a regular one in browsers that
+		// don't support it.
+		if ( nodeName( elem, "template" ) ) {
+			elem = elem.content || elem;
+		}
+
+		return jQuery.merge( [], elem.childNodes );
+	}
+}, function( name, fn ) {
+	jQuery.fn[ name ] = function( until, selector ) {
+		var matched = jQuery.map( this, fn, until );
+
+		if ( name.slice( -5 ) !== "Until" ) {
+			selector = until;
+		}
+
+		if ( selector && typeof selector === "string" ) {
+			matched = jQuery.filter( selector, matched );
+		}
+
+		if ( this.length > 1 ) {
+
+			// Remove duplicates
+			if ( !guaranteedUnique[ name ] ) {
+				jQuery.uniqueSort( matched );
+			}
+
+			// Reverse order for parents* and prev-derivatives
+			if ( rparentsprev.test( name ) ) {
+				matched.reverse();
+			}
+		}
+
+		return this.pushStack( matched );
+	};
+} );
+var rnothtmlwhite = ( /[^\x20\t\r\n\f]+/g );
+
+
+
+// Convert String-formatted options into Object-formatted ones
+function createOptions( options ) {
+	var object = {};
+	jQuery.each( options.match( rnothtmlwhite ) || [], function( _, flag ) {
+		object[ flag ] = true;
+	} );
+	return object;
+}
+
+/*
+ * Create a callback list using the following parameters:
+ *
+ *	options: an optional list of space-separated options that will change how
+ *			the callback list behaves or a more traditional option object
+ *
+ * By default a callback list will act like an event callback list and can be
+ * "fired" multiple times.
+ *
+ * Possible options:
+ *
+ *	once:			will ensure the callback list can only be fired once (like a Deferred)
+ *
+ *	memory:			will keep track of previous values and will call any callback added
+ *					after the list has been fired right away with the latest "memorized"
+ *					values (like a Deferred)
+ *
+ *	unique:			will ensure a callback can only be added once (no duplicate in the list)
+ *
+ *	stopOnFalse:	interrupt callings when a callback returns false
+ *
+ */
+jQuery.Callbacks = function( options ) {
+
+	// Convert options from String-formatted to Object-formatted if needed
+	// (we check in cache first)
+	options = typeof options === "string" ?
+		createOptions( options ) :
+		jQuery.extend( {}, options );
+
+	var // Flag to know if list is currently firing
+		firing,
+
+		// Last fire value for non-forgettable lists
+		memory,
+
+		// Flag to know if list was already fired
+		fired,
+
+		// Flag to prevent firing
+		locked,
+
+		// Actual callback list
+		list = [],
+
+		// Queue of execution data for repeatable lists
+		queue = [],
+
+		// Index of currently firing callback (modified by add/remove as needed)
+		firingIndex = -1,
+
+		// Fire callbacks
+		fire = function() {
+
+			// Enforce single-firing
+			locked = locked || options.once;
+
+			// Execute callbacks for all pending executions,
+			// respecting firingIndex overrides and runtime changes
+			fired = firing = true;
+			for ( ; queue.length; firingIndex = -1 ) {
+				memory = queue.shift();
+				while ( ++firingIndex < list.length ) {
+
+					// Run callback and check for early termination
+					if ( list[ firingIndex ].apply( memory[ 0 ], memory[ 1 ] ) === false &&
+						options.stopOnFalse ) {
+
+						// Jump to end and forget the data so .add doesn't re-fire
+						firingIndex = list.length;
+						memory = false;
+					}
+				}
+			}
+
+			// Forget the data if we're done with it
+			if ( !options.memory ) {
+				memory = false;
+			}
+
+			firing = false;
+
+			// Clean up if we're done firing for good
+			if ( locked ) {
+
+				// Keep an empty list if we have data for future add calls
+				if ( memory ) {
+					list = [];
+
+				// Otherwise, this object is spent
+				} else {
+					list = "";
+				}
+			}
+		},
+
+		// Actual Callbacks object
+		self = {
+
+			// Add a callback or a collection of callbacks to the list
+			add: function() {
+				if ( list ) {
+
+					// If we have memory from a past run, we should fire after adding
+					if ( memory && !firing ) {
+						firingIndex = list.length - 1;
+						queue.push( memory );
+					}
+
+					( function add( args ) {
+						jQuery.each( args, function( _, arg ) {
+							if ( isFunction( arg ) ) {
+								if ( !options.unique || !self.has( arg ) ) {
+									list.push( arg );
+								}
+							} else if ( arg && arg.length && toType( arg ) !== "string" ) {
+
+								// Inspect recursively
+								add( arg );
+							}
+						} );
+					} )( arguments );
+
+					if ( memory && !firing ) {
+						fire();
+					}
+				}
+				return this;
+			},
+
+			// Remove a callback from the list
+			remove: function() {
+				jQuery.each( arguments, function( _, arg ) {
+					var index;
+					while ( ( index = jQuery.inArray( arg, list, index ) ) > -1 ) {
+						list.splice( index, 1 );
+
+						// Handle firing indexes
+						if ( index <= firingIndex ) {
+							firingIndex--;
+						}
+					}
+				} );
+				return this;
+			},
+
+			// Check if a given callback is in the list.
+			// If no argument is given, return whether or not list has callbacks attached.
+			has: function( fn ) {
+				return fn ?
+					jQuery.inArray( fn, list ) > -1 :
+					list.length > 0;
+			},
+
+			// Remove all callbacks from the list
+			empty: function() {
+				if ( list ) {
+					list = [];
+				}
+				return this;
+			},
+
+			// Disable .fire and .add
+			// Abort any current/pending executions
+			// Clear all callbacks and values
+			disable: function() {
+				locked = queue = [];
+				list = memory = "";
+				return this;
+			},
+			disabled: function() {
+				return !list;
+			},
+
+			// Disable .fire
+			// Also disable .add unless we have memory (since it would have no effect)
+			// Abort any pending executions
+			lock: function() {
+				locked = queue = [];
+				if ( !memory && !firing ) {
+					list = memory = "";
+				}
+				return this;
+			},
+			locked: function() {
+				return !!locked;
+			},
+
+			// Call all callbacks with the given context and arguments
+			fireWith: function( context, args ) {
+				if ( !locked ) {
+					args = args || [];
+					args = [ context, args.slice ? args.slice() : args ];
+					queue.push( args );
+					if ( !firing ) {
+						fire();
+					}
+				}
+				return this;
+			},
+
+			// Call all the callbacks with the given arguments
+			fire: function() {
+				self.fireWith( this, arguments );
+				return this;
+			},
+
+			// To know if the callbacks have already been called at least once
+			fired: function() {
+				return !!fired;
+			}
+		};
+
+	return self;
+};
+
+
+function Identity( v ) {
+	return v;
+}
+function Thrower( ex ) {
+	throw ex;
+}
+
+function adoptValue( value, resolve, reject, noValue ) {
+	var method;
+
+	try {
+
+		// Check for promise aspect first to privilege synchronous behavior
+		if ( value && isFunction( ( method = value.promise ) ) ) {
+			method.call( value ).done( resolve ).fail( reject );
+
+		// Other thenables
+		} else if ( value && isFunction( ( method = value.then ) ) ) {
+			method.call( value, resolve, reject );
+
+		// Other non-thenables
+		} else {
+
+			// Control `resolve` arguments by letting Array#slice cast boolean `noValue` to integer:
+			// * false: [ value ].slice( 0 ) => resolve( value )
+			// * true: [ value ].slice( 1 ) => resolve()
+			resolve.apply( undefined, [ value ].slice( noValue ) );
+		}
+
+	// For Promises/A+, convert exceptions into rejections
+	// Since jQuery.when doesn't unwrap thenables, we can skip the extra checks appearing in
+	// Deferred#then to conditionally suppress rejection.
+	} catch ( value ) {
+
+		// Support: Android 4.0 only
+		// Strict mode functions invoked without .call/.apply get global-object context
+		reject.apply( undefined, [ value ] );
+	}
+}
+
+jQuery.extend( {
+
+	Deferred: function( func ) {
+		var tuples = [
+
+				// action, add listener, callbacks,
+				// ... .then handlers, argument index, [final state]
+				[ "notify", "progress", jQuery.Callbacks( "memory" ),
+					jQuery.Callbacks( "memory" ), 2 ],
+				[ "resolve", "done", jQuery.Callbacks( "once memory" ),
+					jQuery.Callbacks( "once memory" ), 0, "resolved" ],
+				[ "reject", "fail", jQuery.Callbacks( "once memory" ),
+					jQuery.Callbacks( "once memory" ), 1, "rejected" ]
+			],
+			state = "pending",
+			promise = {
+				state: function() {
+					return state;
+				},
+				always: function() {
+					deferred.done( arguments ).fail( arguments );
+					return this;
+				},
+				"catch": function( fn ) {
+					return promise.then( null, fn );
+				},
+
+				// Keep pipe for back-compat
+				pipe: function( /* fnDone, fnFail, fnProgress */ ) {
+					var fns = arguments;
+
+					return jQuery.Deferred( function( newDefer ) {
+						jQuery.each( tuples, function( _i, tuple ) {
+
+							// Map tuples (progress, done, fail) to arguments (done, fail, progress)
+							var fn = isFunction( fns[ tuple[ 4 ] ] ) && fns[ tuple[ 4 ] ];
+
+							// deferred.progress(function() { bind to newDefer or newDefer.notify })
+							// deferred.done(function() { bind to newDefer or newDefer.resolve })
+							// deferred.fail(function() { bind to newDefer or newDefer.reject })
+							deferred[ tuple[ 1 ] ]( function() {
+								var returned = fn && fn.apply( this, arguments );
+								if ( returned && isFunction( returned.promise ) ) {
+									returned.promise()
+										.progress( newDefer.notify )
+										.done( newDefer.resolve )
+										.fail( newDefer.reject );
+								} else {
+									newDefer[ tuple[ 0 ] + "With" ](
+										this,
+										fn ? [ returned ] : arguments
+									);
+								}
+							} );
+						} );
+						fns = null;
+					} ).promise();
+				},
+				then: function( onFulfilled, onRejected, onProgress ) {
+					var maxDepth = 0;
+					function resolve( depth, deferred, handler, special ) {
+						return function() {
+							var that = this,
+								args = arguments,
+								mightThrow = function() {
+									var returned, then;
+
+									// Support: Promises/A+ section 2.3.3.3.3
+									// https://promisesaplus.com/#point-59
+									// Ignore double-resolution attempts
+									if ( depth < maxDepth ) {
+										return;
+									}
+
+									returned = handler.apply( that, args );
+
+									// Support: Promises/A+ section 2.3.1
+									// https://promisesaplus.com/#point-48
+									if ( returned === deferred.promise() ) {
+										throw new TypeError( "Thenable self-resolution" );
+									}
+
+									// Support: Promises/A+ sections 2.3.3.1, 3.5
+									// https://promisesaplus.com/#point-54
+									// https://promisesaplus.com/#point-75
+									// Retrieve `then` only once
+									then = returned &&
+
+										// Support: Promises/A+ section 2.3.4
+										// https://promisesaplus.com/#point-64
+										// Only check objects and functions for thenability
+										( typeof returned === "object" ||
+											typeof returned === "function" ) &&
+										returned.then;
+
+									// Handle a returned thenable
+									if ( isFunction( then ) ) {
+
+										// Special processors (notify) just wait for resolution
+										if ( special ) {
+											then.call(
+												returned,
+												resolve( maxDepth, deferred, Identity, special ),
+												resolve( maxDepth, deferred, Thrower, special )
+											);
+
+										// Normal processors (resolve) also hook into progress
+										} else {
+
+											// ...and disregard older resolution values
+											maxDepth++;
+
+											then.call(
+												returned,
+												resolve( maxDepth, deferred, Identity, special ),
+												resolve( maxDepth, deferred, Thrower, special ),
+												resolve( maxDepth, deferred, Identity,
+													deferred.notifyWith )
+											);
+										}
+
+									// Handle all other returned values
+									} else {
+
+										// Only substitute handlers pass on context
+										// and multiple values (non-spec behavior)
+										if ( handler !== Identity ) {
+											that = undefined;
+											args = [ returned ];
+										}
+
+										// Process the value(s)
+										// Default process is resolve
+										( special || deferred.resolveWith )( that, args );
+									}
+								},
+
+								// Only normal processors (resolve) catch and reject exceptions
+								process = special ?
+									mightThrow :
+									function() {
+										try {
+											mightThrow();
+										} catch ( e ) {
+
+											if ( jQuery.Deferred.exceptionHook ) {
+												jQuery.Deferred.exceptionHook( e,
+													process.stackTrace );
+											}
+
+											// Support: Promises/A+ section 2.3.3.3.4.1
+											// https://promisesaplus.com/#point-61
+											// Ignore post-resolution exceptions
+											if ( depth + 1 >= maxDepth ) {
+
+												// Only substitute handlers pass on context
+												// and multiple values (non-spec behavior)
+												if ( handler !== Thrower ) {
+													that = undefined;
+													args = [ e ];
+												}
+
+												deferred.rejectWith( that, args );
+											}
+										}
+									};
+
+							// Support: Promises/A+ section 2.3.3.3.1
+							// https://promisesaplus.com/#point-57
+							// Re-resolve promises immediately to dodge false rejection from
+							// subsequent errors
+							if ( depth ) {
+								process();
+							} else {
+
+								// Call an optional hook to record the stack, in case of exception
+								// since it's otherwise lost when execution goes async
+								if ( jQuery.Deferred.getStackHook ) {
+									process.stackTrace = jQuery.Deferred.getStackHook();
+								}
+								window.setTimeout( process );
+							}
+						};
+					}
+
+					return jQuery.Deferred( function( newDefer ) {
+
+						// progress_handlers.add( ... )
+						tuples[ 0 ][ 3 ].add(
+							resolve(
+								0,
+								newDefer,
+								isFunction( onProgress ) ?
+									onProgress :
+									Identity,
+								newDefer.notifyWith
+							)
+						);
+
+						// fulfilled_handlers.add( ... )
+						tuples[ 1 ][ 3 ].add(
+							resolve(
+								0,
+								newDefer,
+								isFunction( onFulfilled ) ?
+									onFulfilled :
+									Identity
+							)
+						);
+
+						// rejected_handlers.add( ... )
+						tuples[ 2 ][ 3 ].add(
+							resolve(
+								0,
+								newDefer,
+								isFunction( onRejected ) ?
+									onRejected :
+									Thrower
+							)
+						);
+					} ).promise();
+				},
+
+				// Get a promise for this deferred
+				// If obj is provided, the promise aspect is added to the object
+				promise: function( obj ) {
+					return obj != null ? jQuery.extend( obj, promise ) : promise;
+				}
+			},
+			deferred = {};
+
+		// Add list-specific methods
+		jQuery.each( tuples, function( i, tuple ) {
+			var list = tuple[ 2 ],
+				stateString = tuple[ 5 ];
+
+			// promise.progress = list.add
+			// promise.done = list.add
+			// promise.fail = list.add
+			promise[ tuple[ 1 ] ] = list.add;
+
+			// Handle state
+			if ( stateString ) {
+				list.add(
+					function() {
+
+						// state = "resolved" (i.e., fulfilled)
+						// state = "rejected"
+						state = stateString;
+					},
+
+					// rejected_callbacks.disable
+					// fulfilled_callbacks.disable
+					tuples[ 3 - i ][ 2 ].disable,
+
+					// rejected_handlers.disable
+					// fulfilled_handlers.disable
+					tuples[ 3 - i ][ 3 ].disable,
+
+					// progress_callbacks.lock
+					tuples[ 0 ][ 2 ].lock,
+
+					// progress_handlers.lock
+					tuples[ 0 ][ 3 ].lock
+				);
+			}
+
+			// progress_handlers.fire
+			// fulfilled_handlers.fire
+			// rejected_handlers.fire
+			list.add( tuple[ 3 ].fire );
+
+			// deferred.notify = function() { deferred.notifyWith(...) }
+			// deferred.resolve = function() { deferred.resolveWith(...) }
+			// deferred.reject = function() { deferred.rejectWith(...) }
+			deferred[ tuple[ 0 ] ] = function() {
+				deferred[ tuple[ 0 ] + "With" ]( this === deferred ? undefined : this, arguments );
+				return this;
+			};
+
+			// deferred.notifyWith = list.fireWith
+			// deferred.resolveWith = list.fireWith
+			// deferred.rejectWith = list.fireWith
+			deferred[ tuple[ 0 ] + "With" ] = list.fireWith;
+		} );
+
+		// Make the deferred a promise
+		promise.promise( deferred );
+
+		// Call given func if any
+		if ( func ) {
+			func.call( deferred, deferred );
+		}
+
+		// All done!
+		return deferred;
+	},
+
+	// Deferred helper
+	when: function( singleValue ) {
+		var
+
+			// count of uncompleted subordinates
+			remaining = arguments.length,
+
+			// count of unprocessed arguments
+			i = remaining,
+
+			// subordinate fulfillment data
+			resolveContexts = Array( i ),
+			resolveValues = slice.call( arguments ),
+
+			// the primary Deferred
+			primary = jQuery.Deferred(),
+
+			// subordinate callback factory
+			updateFunc = function( i ) {
+				return function( value ) {
+					resolveContexts[ i ] = this;
+					resolveValues[ i ] = arguments.length > 1 ? slice.call( arguments ) : value;
+					if ( !( --remaining ) ) {
+						primary.resolveWith( resolveContexts, resolveValues );
+					}
+				};
+			};
+
+		// Single- and empty arguments are adopted like Promise.resolve
+		if ( remaining <= 1 ) {
+			adoptValue( singleValue, primary.done( updateFunc( i ) ).resolve, primary.reject,
+				!remaining );
+
+			// Use .then() to unwrap secondary thenables (cf. gh-3000)
+			if ( primary.state() === "pending" ||
+				isFunction( resolveValues[ i ] && resolveValues[ i ].then ) ) {
+
+				return primary.then();
+			}
+		}
+
+		// Multiple arguments are aggregated like Promise.all array elements
+		while ( i-- ) {
+			adoptValue( resolveValues[ i ], updateFunc( i ), primary.reject );
+		}
+
+		return primary.promise();
+	}
+} );
+
+
+// These usually indicate a programmer mistake during development,
+// warn about them ASAP rather than swallowing them by default.
+var rerrorNames = /^(Eval|Internal|Range|Reference|Syntax|Type|URI)Error$/;
+
+jQuery.Deferred.exceptionHook = function( error, stack ) {
+
+	// Support: IE 8 - 9 only
+	// Console exists when dev tools are open, which can happen at any time
+	if ( window.console && window.console.warn && error && rerrorNames.test( error.name ) ) {
+		window.console.warn( "jQuery.Deferred exception: " + error.message, error.stack, stack );
+	}
+};
+
+
+
+
+jQuery.readyException = function( error ) {
+	window.setTimeout( function() {
+		throw error;
+	} );
+};
+
+
+
+
+// The deferred used on DOM ready
+var readyList = jQuery.Deferred();
+
+jQuery.fn.ready = function( fn ) {
+
+	readyList
+		.then( fn )
+
+		// Wrap jQuery.readyException in a function so that the lookup
+		// happens at the time of error handling instead of callback
+		// registration.
+		.catch( function( error ) {
+			jQuery.readyException( error );
+		} );
+
+	return this;
+};
+
+jQuery.extend( {
+
+	// Is the DOM ready to be used? Set to true once it occurs.
+	isReady: false,
+
+	// A counter to track how many items to wait for before
+	// the ready event fires. See #6781
+	readyWait: 1,
+
+	// Handle when the DOM is ready
+	ready: function( wait ) {
+
+		// Abort if there are pending holds or we're already ready
+		if ( wait === true ? --jQuery.readyWait : jQuery.isReady ) {
+			return;
+		}
+
+		// Remember that the DOM is ready
+		jQuery.isReady = true;
+
+		// If a normal DOM Ready event fired, decrement, and wait if need be
+		if ( wait !== true && --jQuery.readyWait > 0 ) {
+			return;
+		}
+
+		// If there are functions bound, to execute
+		readyList.resolveWith( document, [ jQuery ] );
+	}
+} );
+
+jQuery.ready.then = readyList.then;
+
+// The ready event handler and self cleanup method
+function completed() {
+	document.removeEventListener( "DOMContentLoaded", completed );
+	window.removeEventListener( "load", completed );
+	jQuery.ready();
+}
+
+// Catch cases where $(document).ready() is called
+// after the browser event has already occurred.
+// Support: IE <=9 - 10 only
+// Older IE sometimes signals "interactive" too soon
+if ( document.readyState === "complete" ||
+	( document.readyState !== "loading" && !document.documentElement.doScroll ) ) {
+
+	// Handle it asynchronously to allow scripts the opportunity to delay ready
+	window.setTimeout( jQuery.ready );
+
+} else {
+
+	// Use the handy event callback
+	document.addEventListener( "DOMContentLoaded", completed );
+
+	// A fallback to window.onload, that will always work
+	window.addEventListener( "load", completed );
+}
+
+
+
+
+// Multifunctional method to get and set values of a collection
+// The value/s can optionally be executed if it's a function
+var access = function( elems, fn, key, value, chainable, emptyGet, raw ) {
+	var i = 0,
+		len = elems.length,
+		bulk = key == null;
+
+	// Sets many values
+	if ( toType( key ) === "object" ) {
+		chainable = true;
+		for ( i in key ) {
+			access( elems, fn, i, key[ i ], true, emptyGet, raw );
+		}
+
+	// Sets one value
+	} else if ( value !== undefined ) {
+		chainable = true;
+
+		if ( !isFunction( value ) ) {
+			raw = true;
+		}
+
+		if ( bulk ) {
+
+			// Bulk operations run against the entire set
+			if ( raw ) {
+				fn.call( elems, value );
+				fn = null;
+
+			// ...except when executing function values
+			} else {
+				bulk = fn;
+				fn = function( elem, _key, value ) {
+					return bulk.call( jQuery( elem ), value );
+				};
+			}
+		}
+
+		if ( fn ) {
+			for ( ; i < len; i++ ) {
+				fn(
+					elems[ i ], key, raw ?
+						value :
+						value.call( elems[ i ], i, fn( elems[ i ], key ) )
+				);
+			}
+		}
+	}
+
+	if ( chainable ) {
+		return elems;
+	}
+
+	// Gets
+	if ( bulk ) {
+		return fn.call( elems );
+	}
+
+	return len ? fn( elems[ 0 ], key ) : emptyGet;
+};
+
+
+// Matches dashed string for camelizing
+var rmsPrefix = /^-ms-/,
+	rdashAlpha = /-([a-z])/g;
+
+// Used by camelCase as callback to replace()
+function fcamelCase( _all, letter ) {
+	return letter.toUpperCase();
+}
+
+// Convert dashed to camelCase; used by the css and data modules
+// Support: IE <=9 - 11, Edge 12 - 15
+// Microsoft forgot to hump their vendor prefix (#9572)
+function camelCase( string ) {
+	return string.replace( rmsPrefix, "ms-" ).replace( rdashAlpha, fcamelCase );
+}
+var acceptData = function( owner ) {
+
+	// Accepts only:
+	//  - Node
+	//    - Node.ELEMENT_NODE
+	//    - Node.DOCUMENT_NODE
+	//  - Object
+	//    - Any
+	return owner.nodeType === 1 || owner.nodeType === 9 || !( +owner.nodeType );
+};
+
+
+
+
+function Data() {
+	this.expando = jQuery.expando + Data.uid++;
+}
+
+Data.uid = 1;
+
+Data.prototype = {
+
+	cache: function( owner ) {
+
+		// Check if the owner object already has a cache
+		var value = owner[ this.expando ];
+
+		// If not, create one
+		if ( !value ) {
+			value = {};
+
+			// We can accept data for non-element nodes in modern browsers,
+			// but we should not, see #8335.
+			// Always return an empty object.
+			if ( acceptData( owner ) ) {
+
+				// If it is a node unlikely to be stringify-ed or looped over
+				// use plain assignment
+				if ( owner.nodeType ) {
+					owner[ this.expando ] = value;
+
+				// Otherwise secure it in a non-enumerable property
+				// configurable must be true to allow the property to be
+				// deleted when data is removed
+				} else {
+					Object.defineProperty( owner, this.expando, {
+						value: value,
+						configurable: true
+					} );
+				}
+			}
+		}
+
+		return value;
+	},
+	set: function( owner, data, value ) {
+		var prop,
+			cache = this.cache( owner );
+
+		// Handle: [ owner, key, value ] args
+		// Always use camelCase key (gh-2257)
+		if ( typeof data === "string" ) {
+			cache[ camelCase( data ) ] = value;
+
+		// Handle: [ owner, { properties } ] args
+		} else {
+
+			// Copy the properties one-by-one to the cache object
+			for ( prop in data ) {
+				cache[ camelCase( prop ) ] = data[ prop ];
+			}
+		}
+		return cache;
+	},
+	get: function( owner, key ) {
+		return key === undefined ?
+			this.cache( owner ) :
+
+			// Always use camelCase key (gh-2257)
+			owner[ this.expando ] && owner[ this.expando ][ camelCase( key ) ];
+	},
+	access: function( owner, key, value ) {
+
+		// In cases where either:
+		//
+		//   1. No key was specified
+		//   2. A string key was specified, but no value provided
+		//
+		// Take the "read" path and allow the get method to determine
+		// which value to return, respectively either:
+		//
+		//   1. The entire cache object
+		//   2. The data stored at the key
+		//
+		if ( key === undefined ||
+				( ( key && typeof key === "string" ) && value === undefined ) ) {
+
+			return this.get( owner, key );
+		}
+
+		// When the key is not a string, or both a key and value
+		// are specified, set or extend (existing objects) with either:
+		//
+		//   1. An object of properties
+		//   2. A key and value
+		//
+		this.set( owner, key, value );
+
+		// Since the "set" path can have two possible entry points
+		// return the expected data based on which path was taken[*]
+		return value !== undefined ? value : key;
+	},
+	remove: function( owner, key ) {
+		var i,
+			cache = owner[ this.expando ];
+
+		if ( cache === undefined ) {
+			return;
+		}
+
+		if ( key !== undefined ) {
+
+			// Support array or space separated string of keys
+			if ( Array.isArray( key ) ) {
+
+				// If key is an array of keys...
+				// We always set camelCase keys, so remove that.
+				key = key.map( camelCase );
+			} else {
+				key = camelCase( key );
+
+				// If a key with the spaces exists, use it.
+				// Otherwise, create an array by matching non-whitespace
+				key = key in cache ?
+					[ key ] :
+					( key.match( rnothtmlwhite ) || [] );
+			}
+
+			i = key.length;
+
+			while ( i-- ) {
+				delete cache[ key[ i ] ];
+			}
+		}
+
+		// Remove the expando if there's no more data
+		if ( key === undefined || jQuery.isEmptyObject( cache ) ) {
+
+			// Support: Chrome <=35 - 45
+			// Webkit & Blink performance suffers when deleting properties
+			// from DOM nodes, so set to undefined instead
+			// https://bugs.chromium.org/p/chromium/issues/detail?id=378607 (bug restricted)
+			if ( owner.nodeType ) {
+				owner[ this.expando ] = undefined;
+			} else {
+				delete owner[ this.expando ];
+			}
+		}
+	},
+	hasData: function( owner ) {
+		var cache = owner[ this.expando ];
+		return cache !== undefined && !jQuery.isEmptyObject( cache );
+	}
+};
+var dataPriv = new Data();
+
+var dataUser = new Data();
+
+
+
+//	Implementation Summary
+//
+//	1. Enforce API surface and semantic compatibility with 1.9.x branch
+//	2. Improve the module's maintainability by reducing the storage
+//		paths to a single mechanism.
+//	3. Use the same single mechanism to support "private" and "user" data.
+//	4. _Never_ expose "private" data to user code (TODO: Drop _data, _removeData)
+//	5. Avoid exposing implementation details on user objects (eg. expando properties)
+//	6. Provide a clear path for implementation upgrade to WeakMap in 2014
+
+var rbrace = /^(?:\{[\w\W]*\}|\[[\w\W]*\])$/,
+	rmultiDash = /[A-Z]/g;
+
+function getData( data ) {
+	if ( data === "true" ) {
+		return true;
+	}
+
+	if ( data === "false" ) {
+		return false;
+	}
+
+	if ( data === "null" ) {
+		return null;
+	}
+
+	// Only convert to a number if it doesn't change the string
+	if ( data === +data + "" ) {
+		return +data;
+	}
+
+	if ( rbrace.test( data ) ) {
+		return JSON.parse( data );
+	}
+
+	return data;
+}
+
+function dataAttr( elem, key, data ) {
+	var name;
+
+	// If nothing was found internally, try to fetch any
+	// data from the HTML5 data-* attribute
+	if ( data === undefined && elem.nodeType === 1 ) {
+		name = "data-" + key.replace( rmultiDash, "-$&" ).toLowerCase();
+		data = elem.getAttribute( name );
+
+		if ( typeof data === "string" ) {
+			try {
+				data = getData( data );
+			} catch ( e ) {}
+
+			// Make sure we set the data so it isn't changed later
+			dataUser.set( elem, key, data );
+		} else {
+			data = undefined;
+		}
+	}
+	return data;
+}
+
+jQuery.extend( {
+	hasData: function( elem ) {
+		return dataUser.hasData( elem ) || dataPriv.hasData( elem );
+	},
+
+	data: function( elem, name, data ) {
+		return dataUser.access( elem, name, data );
+	},
+
+	removeData: function( elem, name ) {
+		dataUser.remove( elem, name );
+	},
+
+	// TODO: Now that all calls to _data and _removeData have been replaced
+	// with direct calls to dataPriv methods, these can be deprecated.
+	_data: function( elem, name, data ) {
+		return dataPriv.access( elem, name, data );
+	},
+
+	_removeData: function( elem, name ) {
+		dataPriv.remove( elem, name );
+	}
+} );
+
+jQuery.fn.extend( {
+	data: function( key, value ) {
+		var i, name, data,
+			elem = this[ 0 ],
+			attrs = elem && elem.attributes;
+
+		// Gets all values
+		if ( key === undefined ) {
+			if ( this.length ) {
+				data = dataUser.get( elem );
+
+				if ( elem.nodeType === 1 && !dataPriv.get( elem, "hasDataAttrs" ) ) {
+					i = attrs.length;
+					while ( i-- ) {
+
+						// Support: IE 11 only
+						// The attrs elements can be null (#14894)
+						if ( attrs[ i ] ) {
+							name = attrs[ i ].name;
+							if ( name.indexOf( "data-" ) === 0 ) {
+								name = camelCase( name.slice( 5 ) );
+								dataAttr( elem, name, data[ name ] );
+							}
+						}
+					}
+					dataPriv.set( elem, "hasDataAttrs", true );
+				}
+			}
+
+			return data;
+		}
+
+		// Sets multiple values
+		if ( typeof key === "object" ) {
+			return this.each( function() {
+				dataUser.set( this, key );
+			} );
+		}
+
+		return access( this, function( value ) {
+			var data;
+
+			// The calling jQuery object (element matches) is not empty
+			// (and therefore has an element appears at this[ 0 ]) and the
+			// `value` parameter was not undefined. An empty jQuery object
+			// will result in `undefined` for elem = this[ 0 ] which will
+			// throw an exception if an attempt to read a data cache is made.
+			if ( elem && value === undefined ) {
+
+				// Attempt to get data from the cache
+				// The key will always be camelCased in Data
+				data = dataUser.get( elem, key );
+				if ( data !== undefined ) {
+					return data;
+				}
+
+				// Attempt to "discover" the data in
+				// HTML5 custom data-* attrs
+				data = dataAttr( elem, key );
+				if ( data !== undefined ) {
+					return data;
+				}
+
+				// We tried really hard, but the data doesn't exist.
+				return;
+			}
+
+			// Set the data...
+			this.each( function() {
+
+				// We always store the camelCased key
+				dataUser.set( this, key, value );
+			} );
+		}, null, value, arguments.length > 1, null, true );
+	},
+
+	removeData: function( key ) {
+		return this.each( function() {
+			dataUser.remove( this, key );
+		} );
+	}
+} );
+
+
+jQuery.extend( {
+	queue: function( elem, type, data ) {
+		var queue;
+
+		if ( elem ) {
+			type = ( type || "fx" ) + "queue";
+			queue = dataPriv.get( elem, type );
+
+			// Speed up dequeue by getting out quickly if this is just a lookup
+			if ( data ) {
+				if ( !queue || Array.isArray( data ) ) {
+					queue = dataPriv.access( elem, type, jQuery.makeArray( data ) );
+				} else {
+					queue.push( data );
+				}
+			}
+			return queue || [];
+		}
+	},
+
+	dequeue: function( elem, type ) {
+		type = type || "fx";
+
+		var queue = jQuery.queue( elem, type ),
+			startLength = queue.length,
+			fn = queue.shift(),
+			hooks = jQuery._queueHooks( elem, type ),
+			next = function() {
+				jQuery.dequeue( elem, type );
+			};
+
+		// If the fx queue is dequeued, always remove the progress sentinel
+		if ( fn === "inprogress" ) {
+			fn = queue.shift();
+			startLength--;
+		}
+
+		if ( fn ) {
+
+			// Add a progress sentinel to prevent the fx queue from being
+			// automatically dequeued
+			if ( type === "fx" ) {
+				queue.unshift( "inprogress" );
+			}
+
+			// Clear up the last queue stop function
+			delete hooks.stop;
+			fn.call( elem, next, hooks );
+		}
+
+		if ( !startLength && hooks ) {
+			hooks.empty.fire();
+		}
+	},
+
+	// Not public - generate a queueHooks object, or return the current one
+	_queueHooks: function( elem, type ) {
+		var key = type + "queueHooks";
+		return dataPriv.get( elem, key ) || dataPriv.access( elem, key, {
+			empty: jQuery.Callbacks( "once memory" ).add( function() {
+				dataPriv.remove( elem, [ type + "queue", key ] );
+			} )
+		} );
+	}
+} );
+
+jQuery.fn.extend( {
+	queue: function( type, data ) {
+		var setter = 2;
+
+		if ( typeof type !== "string" ) {
+			data = type;
+			type = "fx";
+			setter--;
+		}
+
+		if ( arguments.length < setter ) {
+			return jQuery.queue( this[ 0 ], type );
+		}
+
+		return data === undefined ?
+			this :
+			this.each( function() {
+				var queue = jQuery.queue( this, type, data );
+
+				// Ensure a hooks for this queue
+				jQuery._queueHooks( this, type );
+
+				if ( type === "fx" && queue[ 0 ] !== "inprogress" ) {
+					jQuery.dequeue( this, type );
+				}
+			} );
+	},
+	dequeue: function( type ) {
+		return this.each( function() {
+			jQuery.dequeue( this, type );
+		} );
+	},
+	clearQueue: function( type ) {
+		return this.queue( type || "fx", [] );
+	},
+
+	// Get a promise resolved when queues of a certain type
+	// are emptied (fx is the type by default)
+	promise: function( type, obj ) {
+		var tmp,
+			count = 1,
+			defer = jQuery.Deferred(),
+			elements = this,
+			i = this.length,
+			resolve = function() {
+				if ( !( --count ) ) {
+					defer.resolveWith( elements, [ elements ] );
+				}
+			};
+
+		if ( typeof type !== "string" ) {
+			obj = type;
+			type = undefined;
+		}
+		type = type || "fx";
+
+		while ( i-- ) {
+			tmp = dataPriv.get( elements[ i ], type + "queueHooks" );
+			if ( tmp && tmp.empty ) {
+				count++;
+				tmp.empty.add( resolve );
+			}
+		}
+		resolve();
+		return defer.promise( obj );
+	}
+} );
+var pnum = ( /[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/ ).source;
+
+var rcssNum = new RegExp( "^(?:([+-])=|)(" + pnum + ")([a-z%]*)$", "i" );
+
+
+var cssExpand = [ "Top", "Right", "Bottom", "Left" ];
+
+var documentElement = document.documentElement;
+
+
+
+	var isAttached = function( elem ) {
+			return jQuery.contains( elem.ownerDocument, elem );
+		},
+		composed = { composed: true };
+
+	// Support: IE 9 - 11+, Edge 12 - 18+, iOS 10.0 - 10.2 only
+	// Check attachment across shadow DOM boundaries when possible (gh-3504)
+	// Support: iOS 10.0-10.2 only
+	// Early iOS 10 versions support `attachShadow` but not `getRootNode`,
+	// leading to errors. We need to check for `getRootNode`.
+	if ( documentElement.getRootNode ) {
+		isAttached = function( elem ) {
+			return jQuery.contains( elem.ownerDocument, elem ) ||
+				elem.getRootNode( composed ) === elem.ownerDocument;
+		};
+	}
+var isHiddenWithinTree = function( elem, el ) {
+
+		// isHiddenWithinTree might be called from jQuery#filter function;
+		// in that case, element will be second argument
+		elem = el || elem;
+
+		// Inline style trumps all
+		return elem.style.display === "none" ||
+			elem.style.display === "" &&
+
+			// Otherwise, check computed style
+			// Support: Firefox <=43 - 45
+			// Disconnected elements can have computed display: none, so first confirm that elem is
+			// in the document.
+			isAttached( elem ) &&
+
+			jQuery.css( elem, "display" ) === "none";
+	};
+
+
+
+function adjustCSS( elem, prop, valueParts, tween ) {
+	var adjusted, scale,
+		maxIterations = 20,
+		currentValue = tween ?
+			function() {
+				return tween.cur();
+			} :
+			function() {
+				return jQuery.css( elem, prop, "" );
+			},
+		initial = currentValue(),
+		unit = valueParts && valueParts[ 3 ] || ( jQuery.cssNumber[ prop ] ? "" : "px" ),
+
+		// Starting value computation is required for potential unit mismatches
+		initialInUnit = elem.nodeType &&
+			( jQuery.cssNumber[ prop ] || unit !== "px" && +initial ) &&
+			rcssNum.exec( jQuery.css( elem, prop ) );
+
+	if ( initialInUnit && initialInUnit[ 3 ] !== unit ) {
+
+		// Support: Firefox <=54
+		// Halve the iteration target value to prevent interference from CSS upper bounds (gh-2144)
+		initial = initial / 2;
+
+		// Trust units reported by jQuery.css
+		unit = unit || initialInUnit[ 3 ];
+
+		// Iteratively approximate from a nonzero starting point
+		initialInUnit = +initial || 1;
+
+		while ( maxIterations-- ) {
+
+			// Evaluate and update our best guess (doubling guesses that zero out).
+			// Finish if the scale equals or crosses 1 (making the old*new product non-positive).
+			jQuery.style( elem, prop, initialInUnit + unit );
+			if ( ( 1 - scale ) * ( 1 - ( scale = currentValue() / initial || 0.5 ) ) <= 0 ) {
+				maxIterations = 0;
+			}
+			initialInUnit = initialInUnit / scale;
+
+		}
+
+		initialInUnit = initialInUnit * 2;
+		jQuery.style( elem, prop, initialInUnit + unit );
+
+		// Make sure we update the tween properties later on
+		valueParts = valueParts || [];
+	}
+
+	if ( valueParts ) {
+		initialInUnit = +initialInUnit || +initial || 0;
+
+		// Apply relative offset (+=/-=) if specified
+		adjusted = valueParts[ 1 ] ?
+			initialInUnit + ( valueParts[ 1 ] + 1 ) * valueParts[ 2 ] :
+			+valueParts[ 2 ];
+		if ( tween ) {
+			tween.unit = unit;
+			tween.start = initialInUnit;
+			tween.end = adjusted;
+		}
+	}
+	return adjusted;
+}
+
+
+var defaultDisplayMap = {};
+
+function getDefaultDisplay( elem ) {
+	var temp,
+		doc = elem.ownerDocument,
+		nodeName = elem.nodeName,
+		display = defaultDisplayMap[ nodeName ];
+
+	if ( display ) {
+		return display;
+	}
+
+	temp = doc.body.appendChild( doc.createElement( nodeName ) );
+	display = jQuery.css( temp, "display" );
+
+	temp.parentNode.removeChild( temp );
+
+	if ( display === "none" ) {
+		display = "block";
+	}
+	defaultDisplayMap[ nodeName ] = display;
+
+	return display;
+}
+
+function showHide( elements, show ) {
+	var display, elem,
+		values = [],
+		index = 0,
+		length = elements.length;
+
+	// Determine new display value for elements that need to change
+	for ( ; index < length; index++ ) {
+		elem = elements[ index ];
+		if ( !elem.style ) {
+			continue;
+		}
+
+		display = elem.style.display;
+		if ( show ) {
+
+			// Since we force visibility upon cascade-hidden elements, an immediate (and slow)
+			// check is required in this first loop unless we have a nonempty display value (either
+			// inline or about-to-be-restored)
+			if ( display === "none" ) {
+				values[ index ] = dataPriv.get( elem, "display" ) || null;
+				if ( !values[ index ] ) {
+					elem.style.display = "";
+				}
+			}
+			if ( elem.style.display === "" && isHiddenWithinTree( elem ) ) {
+				values[ index ] = getDefaultDisplay( elem );
+			}
+		} else {
+			if ( display !== "none" ) {
+				values[ index ] = "none";
+
+				// Remember what we're overwriting
+				dataPriv.set( elem, "display", display );
+			}
+		}
+	}
+
+	// Set the display of the elements in a second loop to avoid constant reflow
+	for ( index = 0; index < length; index++ ) {
+		if ( values[ index ] != null ) {
+			elements[ index ].style.display = values[ index ];
+		}
+	}
+
+	return elements;
+}
+
+jQuery.fn.extend( {
+	show: function() {
+		return showHide( this, true );
+	},
+	hide: function() {
+		return showHide( this );
+	},
+	toggle: function( state ) {
+		if ( typeof state === "boolean" ) {
+			return state ? this.show() : this.hide();
+		}
+
+		return this.each( function() {
+			if ( isHiddenWithinTree( this ) ) {
+				jQuery( this ).show();
+			} else {
+				jQuery( this ).hide();
+			}
+		} );
+	}
+} );
+var rcheckableType = ( /^(?:checkbox|radio)$/i );
+
+var rtagName = ( /<([a-z][^\/\0>\x20\t\r\n\f]*)/i );
+
+var rscriptType = ( /^$|^module$|\/(?:java|ecma)script/i );
+
+
+
+( function() {
+	var fragment = document.createDocumentFragment(),
+		div = fragment.appendChild( document.createElement( "div" ) ),
+		input = document.createElement( "input" );
+
+	// Support: Android 4.0 - 4.3 only
+	// Check state lost if the name is set (#11217)
+	// Support: Windows Web Apps (WWA)
+	// `name` and `type` must use .setAttribute for WWA (#14901)
+	input.setAttribute( "type", "radio" );
+	input.setAttribute( "checked", "checked" );
+	input.setAttribute( "name", "t" );
+
+	div.appendChild( input );
+
+	// Support: Android <=4.1 only
+	// Older WebKit doesn't clone checked state correctly in fragments
+	support.checkClone = div.cloneNode( true ).cloneNode( true ).lastChild.checked;
+
+	// Support: IE <=11 only
+	// Make sure textarea (and checkbox) defaultValue is properly cloned
+	div.innerHTML = "";
+	support.noCloneChecked = !!div.cloneNode( true ).lastChild.defaultValue;
+
+	// Support: IE <=9 only
+	// IE <=9 replaces ";
+	support.option = !!div.lastChild;
+} )();
+
+
+// We have to close these tags to support XHTML (#13200)
+var wrapMap = {
+
+	// XHTML parsers do not magically insert elements in the
+	// same way that tag soup parsers do. So we cannot shorten
+	// this by omitting  or other required elements.
+	thead: [ 1, "", "
      " ],
+	col: [ 2, "", "
      " ],
+	tr: [ 2, "", "
      " ],
+	td: [ 3, "", "
      " ],
+
+	_default: [ 0, "", "" ]
+};
+
+wrapMap.tbody = wrapMap.tfoot = wrapMap.colgroup = wrapMap.caption = wrapMap.thead;
+wrapMap.th = wrapMap.td;
+
+// Support: IE <=9 only
+if ( !support.option ) {
+	wrapMap.optgroup = wrapMap.option = [ 1, "" ];
+}
+
+
+function getAll( context, tag ) {
+
+	// Support: IE <=9 - 11 only
+	// Use typeof to avoid zero-argument method invocation on host objects (#15151)
+	var ret;
+
+	if ( typeof context.getElementsByTagName !== "undefined" ) {
+		ret = context.getElementsByTagName( tag || "*" );
+
+	} else if ( typeof context.querySelectorAll !== "undefined" ) {
+		ret = context.querySelectorAll( tag || "*" );
+
+	} else {
+		ret = [];
+	}
+
+	if ( tag === undefined || tag && nodeName( context, tag ) ) {
+		return jQuery.merge( [ context ], ret );
+	}
+
+	return ret;
+}
+
+
+// Mark scripts as having already been evaluated
+function setGlobalEval( elems, refElements ) {
+	var i = 0,
+		l = elems.length;
+
+	for ( ; i < l; i++ ) {
+		dataPriv.set(
+			elems[ i ],
+			"globalEval",
+			!refElements || dataPriv.get( refElements[ i ], "globalEval" )
+		);
+	}
+}
+
+
+var rhtml = /<|&#?\w+;/;
+
+function buildFragment( elems, context, scripts, selection, ignored ) {
+	var elem, tmp, tag, wrap, attached, j,
+		fragment = context.createDocumentFragment(),
+		nodes = [],
+		i = 0,
+		l = elems.length;
+
+	for ( ; i < l; i++ ) {
+		elem = elems[ i ];
+
+		if ( elem || elem === 0 ) {
+
+			// Add nodes directly
+			if ( toType( elem ) === "object" ) {
+
+				// Support: Android <=4.0 only, PhantomJS 1 only
+				// push.apply(_, arraylike) throws on ancient WebKit
+				jQuery.merge( nodes, elem.nodeType ? [ elem ] : elem );
+
+			// Convert non-html into a text node
+			} else if ( !rhtml.test( elem ) ) {
+				nodes.push( context.createTextNode( elem ) );
+
+			// Convert html into DOM nodes
+			} else {
+				tmp = tmp || fragment.appendChild( context.createElement( "div" ) );
+
+				// Deserialize a standard representation
+				tag = ( rtagName.exec( elem ) || [ "", "" ] )[ 1 ].toLowerCase();
+				wrap = wrapMap[ tag ] || wrapMap._default;
+				tmp.innerHTML = wrap[ 1 ] + jQuery.htmlPrefilter( elem ) + wrap[ 2 ];
+
+				// Descend through wrappers to the right content
+				j = wrap[ 0 ];
+				while ( j-- ) {
+					tmp = tmp.lastChild;
+				}
+
+				// Support: Android <=4.0 only, PhantomJS 1 only
+				// push.apply(_, arraylike) throws on ancient WebKit
+				jQuery.merge( nodes, tmp.childNodes );
+
+				// Remember the top-level container
+				tmp = fragment.firstChild;
+
+				// Ensure the created nodes are orphaned (#12392)
+				tmp.textContent = "";
+			}
+		}
+	}
+
+	// Remove wrapper from fragment
+	fragment.textContent = "";
+
+	i = 0;
+	while ( ( elem = nodes[ i++ ] ) ) {
+
+		// Skip elements already in the context collection (trac-4087)
+		if ( selection && jQuery.inArray( elem, selection ) > -1 ) {
+			if ( ignored ) {
+				ignored.push( elem );
+			}
+			continue;
+		}
+
+		attached = isAttached( elem );
+
+		// Append to fragment
+		tmp = getAll( fragment.appendChild( elem ), "script" );
+
+		// Preserve script evaluation history
+		if ( attached ) {
+			setGlobalEval( tmp );
+		}
+
+		// Capture executables
+		if ( scripts ) {
+			j = 0;
+			while ( ( elem = tmp[ j++ ] ) ) {
+				if ( rscriptType.test( elem.type || "" ) ) {
+					scripts.push( elem );
+				}
+			}
+		}
+	}
+
+	return fragment;
+}
+
+
+var rtypenamespace = /^([^.]*)(?:\.(.+)|)/;
+
+function returnTrue() {
+	return true;
+}
+
+function returnFalse() {
+	return false;
+}
+
+// Support: IE <=9 - 11+
+// focus() and blur() are asynchronous, except when they are no-op.
+// So expect focus to be synchronous when the element is already active,
+// and blur to be synchronous when the element is not already active.
+// (focus and blur are always synchronous in other supported browsers,
+// this just defines when we can count on it).
+function expectSync( elem, type ) {
+	return ( elem === safeActiveElement() ) === ( type === "focus" );
+}
+
+// Support: IE <=9 only
+// Accessing document.activeElement can throw unexpectedly
+// https://bugs.jquery.com/ticket/13393
+function safeActiveElement() {
+	try {
+		return document.activeElement;
+	} catch ( err ) { }
+}
+
+function on( elem, types, selector, data, fn, one ) {
+	var origFn, type;
+
+	// Types can be a map of types/handlers
+	if ( typeof types === "object" ) {
+
+		// ( types-Object, selector, data )
+		if ( typeof selector !== "string" ) {
+
+			// ( types-Object, data )
+			data = data || selector;
+			selector = undefined;
+		}
+		for ( type in types ) {
+			on( elem, type, selector, data, types[ type ], one );
+		}
+		return elem;
+	}
+
+	if ( data == null && fn == null ) {
+
+		// ( types, fn )
+		fn = selector;
+		data = selector = undefined;
+	} else if ( fn == null ) {
+		if ( typeof selector === "string" ) {
+
+			// ( types, selector, fn )
+			fn = data;
+			data = undefined;
+		} else {
+
+			// ( types, data, fn )
+			fn = data;
+			data = selector;
+			selector = undefined;
+		}
+	}
+	if ( fn === false ) {
+		fn = returnFalse;
+	} else if ( !fn ) {
+		return elem;
+	}
+
+	if ( one === 1 ) {
+		origFn = fn;
+		fn = function( event ) {
+
+			// Can use an empty set, since event contains the info
+			jQuery().off( event );
+			return origFn.apply( this, arguments );
+		};
+
+		// Use same guid so caller can remove using origFn
+		fn.guid = origFn.guid || ( origFn.guid = jQuery.guid++ );
+	}
+	return elem.each( function() {
+		jQuery.event.add( this, types, fn, data, selector );
+	} );
+}
+
+/*
+ * Helper functions for managing events -- not part of the public interface.
+ * Props to Dean Edwards' addEvent library for many of the ideas.
+ */
+jQuery.event = {
+
+	global: {},
+
+	add: function( elem, types, handler, data, selector ) {
+
+		var handleObjIn, eventHandle, tmp,
+			events, t, handleObj,
+			special, handlers, type, namespaces, origType,
+			elemData = dataPriv.get( elem );
+
+		// Only attach events to objects that accept data
+		if ( !acceptData( elem ) ) {
+			return;
+		}
+
+		// Caller can pass in an object of custom data in lieu of the handler
+		if ( handler.handler ) {
+			handleObjIn = handler;
+			handler = handleObjIn.handler;
+			selector = handleObjIn.selector;
+		}
+
+		// Ensure that invalid selectors throw exceptions at attach time
+		// Evaluate against documentElement in case elem is a non-element node (e.g., document)
+		if ( selector ) {
+			jQuery.find.matchesSelector( documentElement, selector );
+		}
+
+		// Make sure that the handler has a unique ID, used to find/remove it later
+		if ( !handler.guid ) {
+			handler.guid = jQuery.guid++;
+		}
+
+		// Init the element's event structure and main handler, if this is the first
+		if ( !( events = elemData.events ) ) {
+			events = elemData.events = Object.create( null );
+		}
+		if ( !( eventHandle = elemData.handle ) ) {
+			eventHandle = elemData.handle = function( e ) {
+
+				// Discard the second event of a jQuery.event.trigger() and
+				// when an event is called after a page has unloaded
+				return typeof jQuery !== "undefined" && jQuery.event.triggered !== e.type ?
+					jQuery.event.dispatch.apply( elem, arguments ) : undefined;
+			};
+		}
+
+		// Handle multiple events separated by a space
+		types = ( types || "" ).match( rnothtmlwhite ) || [ "" ];
+		t = types.length;
+		while ( t-- ) {
+			tmp = rtypenamespace.exec( types[ t ] ) || [];
+			type = origType = tmp[ 1 ];
+			namespaces = ( tmp[ 2 ] || "" ).split( "." ).sort();
+
+			// There *must* be a type, no attaching namespace-only handlers
+			if ( !type ) {
+				continue;
+			}
+
+			// If event changes its type, use the special event handlers for the changed type
+			special = jQuery.event.special[ type ] || {};
+
+			// If selector defined, determine special event api type, otherwise given type
+			type = ( selector ? special.delegateType : special.bindType ) || type;
+
+			// Update special based on newly reset type
+			special = jQuery.event.special[ type ] || {};
+
+			// handleObj is passed to all event handlers
+			handleObj = jQuery.extend( {
+				type: type,
+				origType: origType,
+				data: data,
+				handler: handler,
+				guid: handler.guid,
+				selector: selector,
+				needsContext: selector && jQuery.expr.match.needsContext.test( selector ),
+				namespace: namespaces.join( "." )
+			}, handleObjIn );
+
+			// Init the event handler queue if we're the first
+			if ( !( handlers = events[ type ] ) ) {
+				handlers = events[ type ] = [];
+				handlers.delegateCount = 0;
+
+				// Only use addEventListener if the special events handler returns false
+				if ( !special.setup ||
+					special.setup.call( elem, data, namespaces, eventHandle ) === false ) {
+
+					if ( elem.addEventListener ) {
+						elem.addEventListener( type, eventHandle );
+					}
+				}
+			}
+
+			if ( special.add ) {
+				special.add.call( elem, handleObj );
+
+				if ( !handleObj.handler.guid ) {
+					handleObj.handler.guid = handler.guid;
+				}
+			}
+
+			// Add to the element's handler list, delegates in front
+			if ( selector ) {
+				handlers.splice( handlers.delegateCount++, 0, handleObj );
+			} else {
+				handlers.push( handleObj );
+			}
+
+			// Keep track of which events have ever been used, for event optimization
+			jQuery.event.global[ type ] = true;
+		}
+
+	},
+
+	// Detach an event or set of events from an element
+	remove: function( elem, types, handler, selector, mappedTypes ) {
+
+		var j, origCount, tmp,
+			events, t, handleObj,
+			special, handlers, type, namespaces, origType,
+			elemData = dataPriv.hasData( elem ) && dataPriv.get( elem );
+
+		if ( !elemData || !( events = elemData.events ) ) {
+			return;
+		}
+
+		// Once for each type.namespace in types; type may be omitted
+		types = ( types || "" ).match( rnothtmlwhite ) || [ "" ];
+		t = types.length;
+		while ( t-- ) {
+			tmp = rtypenamespace.exec( types[ t ] ) || [];
+			type = origType = tmp[ 1 ];
+			namespaces = ( tmp[ 2 ] || "" ).split( "." ).sort();
+
+			// Unbind all events (on this namespace, if provided) for the element
+			if ( !type ) {
+				for ( type in events ) {
+					jQuery.event.remove( elem, type + types[ t ], handler, selector, true );
+				}
+				continue;
+			}
+
+			special = jQuery.event.special[ type ] || {};
+			type = ( selector ? special.delegateType : special.bindType ) || type;
+			handlers = events[ type ] || [];
+			tmp = tmp[ 2 ] &&
+				new RegExp( "(^|\\.)" + namespaces.join( "\\.(?:.*\\.|)" ) + "(\\.|$)" );
+
+			// Remove matching events
+			origCount = j = handlers.length;
+			while ( j-- ) {
+				handleObj = handlers[ j ];
+
+				if ( ( mappedTypes || origType === handleObj.origType ) &&
+					( !handler || handler.guid === handleObj.guid ) &&
+					( !tmp || tmp.test( handleObj.namespace ) ) &&
+					( !selector || selector === handleObj.selector ||
+						selector === "**" && handleObj.selector ) ) {
+					handlers.splice( j, 1 );
+
+					if ( handleObj.selector ) {
+						handlers.delegateCount--;
+					}
+					if ( special.remove ) {
+						special.remove.call( elem, handleObj );
+					}
+				}
+			}
+
+			// Remove generic event handler if we removed something and no more handlers exist
+			// (avoids potential for endless recursion during removal of special event handlers)
+			if ( origCount && !handlers.length ) {
+				if ( !special.teardown ||
+					special.teardown.call( elem, namespaces, elemData.handle ) === false ) {
+
+					jQuery.removeEvent( elem, type, elemData.handle );
+				}
+
+				delete events[ type ];
+			}
+		}
+
+		// Remove data and the expando if it's no longer used
+		if ( jQuery.isEmptyObject( events ) ) {
+			dataPriv.remove( elem, "handle events" );
+		}
+	},
+
+	dispatch: function( nativeEvent ) {
+
+		var i, j, ret, matched, handleObj, handlerQueue,
+			args = new Array( arguments.length ),
+
+			// Make a writable jQuery.Event from the native event object
+			event = jQuery.event.fix( nativeEvent ),
+
+			handlers = (
+				dataPriv.get( this, "events" ) || Object.create( null )
+			)[ event.type ] || [],
+			special = jQuery.event.special[ event.type ] || {};
+
+		// Use the fix-ed jQuery.Event rather than the (read-only) native event
+		args[ 0 ] = event;
+
+		for ( i = 1; i < arguments.length; i++ ) {
+			args[ i ] = arguments[ i ];
+		}
+
+		event.delegateTarget = this;
+
+		// Call the preDispatch hook for the mapped type, and let it bail if desired
+		if ( special.preDispatch && special.preDispatch.call( this, event ) === false ) {
+			return;
+		}
+
+		// Determine handlers
+		handlerQueue = jQuery.event.handlers.call( this, event, handlers );
+
+		// Run delegates first; they may want to stop propagation beneath us
+		i = 0;
+		while ( ( matched = handlerQueue[ i++ ] ) && !event.isPropagationStopped() ) {
+			event.currentTarget = matched.elem;
+
+			j = 0;
+			while ( ( handleObj = matched.handlers[ j++ ] ) &&
+				!event.isImmediatePropagationStopped() ) {
+
+				// If the event is namespaced, then each handler is only invoked if it is
+				// specially universal or its namespaces are a superset of the event's.
+				if ( !event.rnamespace || handleObj.namespace === false ||
+					event.rnamespace.test( handleObj.namespace ) ) {
+
+					event.handleObj = handleObj;
+					event.data = handleObj.data;
+
+					ret = ( ( jQuery.event.special[ handleObj.origType ] || {} ).handle ||
+						handleObj.handler ).apply( matched.elem, args );
+
+					if ( ret !== undefined ) {
+						if ( ( event.result = ret ) === false ) {
+							event.preventDefault();
+							event.stopPropagation();
+						}
+					}
+				}
+			}
+		}
+
+		// Call the postDispatch hook for the mapped type
+		if ( special.postDispatch ) {
+			special.postDispatch.call( this, event );
+		}
+
+		return event.result;
+	},
+
+	handlers: function( event, handlers ) {
+		var i, handleObj, sel, matchedHandlers, matchedSelectors,
+			handlerQueue = [],
+			delegateCount = handlers.delegateCount,
+			cur = event.target;
+
+		// Find delegate handlers
+		if ( delegateCount &&
+
+			// Support: IE <=9
+			// Black-hole SVG  instance trees (trac-13180)
+			cur.nodeType &&
+
+			// Support: Firefox <=42
+			// Suppress spec-violating clicks indicating a non-primary pointer button (trac-3861)
+			// https://www.w3.org/TR/DOM-Level-3-Events/#event-type-click
+			// Support: IE 11 only
+			// ...but not arrow key "clicks" of radio inputs, which can have `button` -1 (gh-2343)
+			!( event.type === "click" && event.button >= 1 ) ) {
+
+			for ( ; cur !== this; cur = cur.parentNode || this ) {
+
+				// Don't check non-elements (#13208)
+				// Don't process clicks on disabled elements (#6911, #8165, #11382, #11764)
+				if ( cur.nodeType === 1 && !( event.type === "click" && cur.disabled === true ) ) {
+					matchedHandlers = [];
+					matchedSelectors = {};
+					for ( i = 0; i < delegateCount; i++ ) {
+						handleObj = handlers[ i ];
+
+						// Don't conflict with Object.prototype properties (#13203)
+						sel = handleObj.selector + " ";
+
+						if ( matchedSelectors[ sel ] === undefined ) {
+							matchedSelectors[ sel ] = handleObj.needsContext ?
+								jQuery( sel, this ).index( cur ) > -1 :
+								jQuery.find( sel, this, null, [ cur ] ).length;
+						}
+						if ( matchedSelectors[ sel ] ) {
+							matchedHandlers.push( handleObj );
+						}
+					}
+					if ( matchedHandlers.length ) {
+						handlerQueue.push( { elem: cur, handlers: matchedHandlers } );
+					}
+				}
+			}
+		}
+
+		// Add the remaining (directly-bound) handlers
+		cur = this;
+		if ( delegateCount < handlers.length ) {
+			handlerQueue.push( { elem: cur, handlers: handlers.slice( delegateCount ) } );
+		}
+
+		return handlerQueue;
+	},
+
+	addProp: function( name, hook ) {
+		Object.defineProperty( jQuery.Event.prototype, name, {
+			enumerable: true,
+			configurable: true,
+
+			get: isFunction( hook ) ?
+				function() {
+					if ( this.originalEvent ) {
+						return hook( this.originalEvent );
+					}
+				} :
+				function() {
+					if ( this.originalEvent ) {
+						return this.originalEvent[ name ];
+					}
+				},
+
+			set: function( value ) {
+				Object.defineProperty( this, name, {
+					enumerable: true,
+					configurable: true,
+					writable: true,
+					value: value
+				} );
+			}
+		} );
+	},
+
+	fix: function( originalEvent ) {
+		return originalEvent[ jQuery.expando ] ?
+			originalEvent :
+			new jQuery.Event( originalEvent );
+	},
+
+	special: {
+		load: {
+
+			// Prevent triggered image.load events from bubbling to window.load
+			noBubble: true
+		},
+		click: {
+
+			// Utilize native event to ensure correct state for checkable inputs
+			setup: function( data ) {
+
+				// For mutual compressibility with _default, replace `this` access with a local var.
+				// `|| data` is dead code meant only to preserve the variable through minification.
+				var el = this || data;
+
+				// Claim the first handler
+				if ( rcheckableType.test( el.type ) &&
+					el.click && nodeName( el, "input" ) ) {
+
+					// dataPriv.set( el, "click", ... )
+					leverageNative( el, "click", returnTrue );
+				}
+
+				// Return false to allow normal processing in the caller
+				return false;
+			},
+			trigger: function( data ) {
+
+				// For mutual compressibility with _default, replace `this` access with a local var.
+				// `|| data` is dead code meant only to preserve the variable through minification.
+				var el = this || data;
+
+				// Force setup before triggering a click
+				if ( rcheckableType.test( el.type ) &&
+					el.click && nodeName( el, "input" ) ) {
+
+					leverageNative( el, "click" );
+				}
+
+				// Return non-false to allow normal event-path propagation
+				return true;
+			},
+
+			// For cross-browser consistency, suppress native .click() on links
+			// Also prevent it if we're currently inside a leveraged native-event stack
+			_default: function( event ) {
+				var target = event.target;
+				return rcheckableType.test( target.type ) &&
+					target.click && nodeName( target, "input" ) &&
+					dataPriv.get( target, "click" ) ||
+					nodeName( target, "a" );
+			}
+		},
+
+		beforeunload: {
+			postDispatch: function( event ) {
+
+				// Support: Firefox 20+
+				// Firefox doesn't alert if the returnValue field is not set.
+				if ( event.result !== undefined && event.originalEvent ) {
+					event.originalEvent.returnValue = event.result;
+				}
+			}
+		}
+	}
+};
+
+// Ensure the presence of an event listener that handles manually-triggered
+// synthetic events by interrupting progress until reinvoked in response to
+// *native* events that it fires directly, ensuring that state changes have
+// already occurred before other listeners are invoked.
+function leverageNative( el, type, expectSync ) {
+
+	// Missing expectSync indicates a trigger call, which must force setup through jQuery.event.add
+	if ( !expectSync ) {
+		if ( dataPriv.get( el, type ) === undefined ) {
+			jQuery.event.add( el, type, returnTrue );
+		}
+		return;
+	}
+
+	// Register the controller as a special universal handler for all event namespaces
+	dataPriv.set( el, type, false );
+	jQuery.event.add( el, type, {
+		namespace: false,
+		handler: function( event ) {
+			var notAsync, result,
+				saved = dataPriv.get( this, type );
+
+			if ( ( event.isTrigger & 1 ) && this[ type ] ) {
+
+				// Interrupt processing of the outer synthetic .trigger()ed event
+				// Saved data should be false in such cases, but might be a leftover capture object
+				// from an async native handler (gh-4350)
+				if ( !saved.length ) {
+
+					// Store arguments for use when handling the inner native event
+					// There will always be at least one argument (an event object), so this array
+					// will not be confused with a leftover capture object.
+					saved = slice.call( arguments );
+					dataPriv.set( this, type, saved );
+
+					// Trigger the native event and capture its result
+					// Support: IE <=9 - 11+
+					// focus() and blur() are asynchronous
+					notAsync = expectSync( this, type );
+					this[ type ]();
+					result = dataPriv.get( this, type );
+					if ( saved !== result || notAsync ) {
+						dataPriv.set( this, type, false );
+					} else {
+						result = {};
+					}
+					if ( saved !== result ) {
+
+						// Cancel the outer synthetic event
+						event.stopImmediatePropagation();
+						event.preventDefault();
+
+						// Support: Chrome 86+
+						// In Chrome, if an element having a focusout handler is blurred by
+						// clicking outside of it, it invokes the handler synchronously. If
+						// that handler calls `.remove()` on the element, the data is cleared,
+						// leaving `result` undefined. We need to guard against this.
+						return result && result.value;
+					}
+
+				// If this is an inner synthetic event for an event with a bubbling surrogate
+				// (focus or blur), assume that the surrogate already propagated from triggering the
+				// native event and prevent that from happening again here.
+				// This technically gets the ordering wrong w.r.t. to `.trigger()` (in which the
+				// bubbling surrogate propagates *after* the non-bubbling base), but that seems
+				// less bad than duplication.
+				} else if ( ( jQuery.event.special[ type ] || {} ).delegateType ) {
+					event.stopPropagation();
+				}
+
+			// If this is a native event triggered above, everything is now in order
+			// Fire an inner synthetic event with the original arguments
+			} else if ( saved.length ) {
+
+				// ...and capture the result
+				dataPriv.set( this, type, {
+					value: jQuery.event.trigger(
+
+						// Support: IE <=9 - 11+
+						// Extend with the prototype to reset the above stopImmediatePropagation()
+						jQuery.extend( saved[ 0 ], jQuery.Event.prototype ),
+						saved.slice( 1 ),
+						this
+					)
+				} );
+
+				// Abort handling of the native event
+				event.stopImmediatePropagation();
+			}
+		}
+	} );
+}
+
+jQuery.removeEvent = function( elem, type, handle ) {
+
+	// This "if" is needed for plain objects
+	if ( elem.removeEventListener ) {
+		elem.removeEventListener( type, handle );
+	}
+};
+
+jQuery.Event = function( src, props ) {
+
+	// Allow instantiation without the 'new' keyword
+	if ( !( this instanceof jQuery.Event ) ) {
+		return new jQuery.Event( src, props );
+	}
+
+	// Event object
+	if ( src && src.type ) {
+		this.originalEvent = src;
+		this.type = src.type;
+
+		// Events bubbling up the document may have been marked as prevented
+		// by a handler lower down the tree; reflect the correct value.
+		this.isDefaultPrevented = src.defaultPrevented ||
+				src.defaultPrevented === undefined &&
+
+				// Support: Android <=2.3 only
+				src.returnValue === false ?
+			returnTrue :
+			returnFalse;
+
+		// Create target properties
+		// Support: Safari <=6 - 7 only
+		// Target should not be a text node (#504, #13143)
+		this.target = ( src.target && src.target.nodeType === 3 ) ?
+			src.target.parentNode :
+			src.target;
+
+		this.currentTarget = src.currentTarget;
+		this.relatedTarget = src.relatedTarget;
+
+	// Event type
+	} else {
+		this.type = src;
+	}
+
+	// Put explicitly provided properties onto the event object
+	if ( props ) {
+		jQuery.extend( this, props );
+	}
+
+	// Create a timestamp if incoming event doesn't have one
+	this.timeStamp = src && src.timeStamp || Date.now();
+
+	// Mark it as fixed
+	this[ jQuery.expando ] = true;
+};
+
+// jQuery.Event is based on DOM3 Events as specified by the ECMAScript Language Binding
+// https://www.w3.org/TR/2003/WD-DOM-Level-3-Events-20030331/ecma-script-binding.html
+jQuery.Event.prototype = {
+	constructor: jQuery.Event,
+	isDefaultPrevented: returnFalse,
+	isPropagationStopped: returnFalse,
+	isImmediatePropagationStopped: returnFalse,
+	isSimulated: false,
+
+	preventDefault: function() {
+		var e = this.originalEvent;
+
+		this.isDefaultPrevented = returnTrue;
+
+		if ( e && !this.isSimulated ) {
+			e.preventDefault();
+		}
+	},
+	stopPropagation: function() {
+		var e = this.originalEvent;
+
+		this.isPropagationStopped = returnTrue;
+
+		if ( e && !this.isSimulated ) {
+			e.stopPropagation();
+		}
+	},
+	stopImmediatePropagation: function() {
+		var e = this.originalEvent;
+
+		this.isImmediatePropagationStopped = returnTrue;
+
+		if ( e && !this.isSimulated ) {
+			e.stopImmediatePropagation();
+		}
+
+		this.stopPropagation();
+	}
+};
+
+// Includes all common event props including KeyEvent and MouseEvent specific props
+jQuery.each( {
+	altKey: true,
+	bubbles: true,
+	cancelable: true,
+	changedTouches: true,
+	ctrlKey: true,
+	detail: true,
+	eventPhase: true,
+	metaKey: true,
+	pageX: true,
+	pageY: true,
+	shiftKey: true,
+	view: true,
+	"char": true,
+	code: true,
+	charCode: true,
+	key: true,
+	keyCode: true,
+	button: true,
+	buttons: true,
+	clientX: true,
+	clientY: true,
+	offsetX: true,
+	offsetY: true,
+	pointerId: true,
+	pointerType: true,
+	screenX: true,
+	screenY: true,
+	targetTouches: true,
+	toElement: true,
+	touches: true,
+	which: true
+}, jQuery.event.addProp );
+
+jQuery.each( { focus: "focusin", blur: "focusout" }, function( type, delegateType ) {
+	jQuery.event.special[ type ] = {
+
+		// Utilize native event if possible so blur/focus sequence is correct
+		setup: function() {
+
+			// Claim the first handler
+			// dataPriv.set( this, "focus", ... )
+			// dataPriv.set( this, "blur", ... )
+			leverageNative( this, type, expectSync );
+
+			// Return false to allow normal processing in the caller
+			return false;
+		},
+		trigger: function() {
+
+			// Force setup before trigger
+			leverageNative( this, type );
+
+			// Return non-false to allow normal event-path propagation
+			return true;
+		},
+
+		// Suppress native focus or blur as it's already being fired
+		// in leverageNative.
+		_default: function() {
+			return true;
+		},
+
+		delegateType: delegateType
+	};
+} );
+
+// Create mouseenter/leave events using mouseover/out and event-time checks
+// so that event delegation works in jQuery.
+// Do the same for pointerenter/pointerleave and pointerover/pointerout
+//
+// Support: Safari 7 only
+// Safari sends mouseenter too often; see:
+// https://bugs.chromium.org/p/chromium/issues/detail?id=470258
+// for the description of the bug (it existed in older Chrome versions as well).
+jQuery.each( {
+	mouseenter: "mouseover",
+	mouseleave: "mouseout",
+	pointerenter: "pointerover",
+	pointerleave: "pointerout"
+}, function( orig, fix ) {
+	jQuery.event.special[ orig ] = {
+		delegateType: fix,
+		bindType: fix,
+
+		handle: function( event ) {
+			var ret,
+				target = this,
+				related = event.relatedTarget,
+				handleObj = event.handleObj;
+
+			// For mouseenter/leave call the handler if related is outside the target.
+			// NB: No relatedTarget if the mouse left/entered the browser window
+			if ( !related || ( related !== target && !jQuery.contains( target, related ) ) ) {
+				event.type = handleObj.origType;
+				ret = handleObj.handler.apply( this, arguments );
+				event.type = fix;
+			}
+			return ret;
+		}
+	};
+} );
+
+jQuery.fn.extend( {
+
+	on: function( types, selector, data, fn ) {
+		return on( this, types, selector, data, fn );
+	},
+	one: function( types, selector, data, fn ) {
+		return on( this, types, selector, data, fn, 1 );
+	},
+	off: function( types, selector, fn ) {
+		var handleObj, type;
+		if ( types && types.preventDefault && types.handleObj ) {
+
+			// ( event )  dispatched jQuery.Event
+			handleObj = types.handleObj;
+			jQuery( types.delegateTarget ).off(
+				handleObj.namespace ?
+					handleObj.origType + "." + handleObj.namespace :
+					handleObj.origType,
+				handleObj.selector,
+				handleObj.handler
+			);
+			return this;
+		}
+		if ( typeof types === "object" ) {
+
+			// ( types-object [, selector] )
+			for ( type in types ) {
+				this.off( type, selector, types[ type ] );
+			}
+			return this;
+		}
+		if ( selector === false || typeof selector === "function" ) {
+
+			// ( types [, fn] )
+			fn = selector;
+			selector = undefined;
+		}
+		if ( fn === false ) {
+			fn = returnFalse;
+		}
+		return this.each( function() {
+			jQuery.event.remove( this, types, fn, selector );
+		} );
+	}
+} );
+
+
+var
+
+	// Support: IE <=10 - 11, Edge 12 - 13 only
+	// In IE/Edge using regex groups here causes severe slowdowns.
+	// See https://connect.microsoft.com/IE/feedback/details/1736512/
+	rnoInnerhtml = /\s*$/g;
+
+// Prefer a tbody over its parent table for containing new rows
+function manipulationTarget( elem, content ) {
+	if ( nodeName( elem, "table" ) &&
+		nodeName( content.nodeType !== 11 ? content : content.firstChild, "tr" ) ) {
+
+		return jQuery( elem ).children( "tbody" )[ 0 ] || elem;
+	}
+
+	return elem;
+}
+
+// Replace/restore the type attribute of script elements for safe DOM manipulation
+function disableScript( elem ) {
+	elem.type = ( elem.getAttribute( "type" ) !== null ) + "/" + elem.type;
+	return elem;
+}
+function restoreScript( elem ) {
+	if ( ( elem.type || "" ).slice( 0, 5 ) === "true/" ) {
+		elem.type = elem.type.slice( 5 );
+	} else {
+		elem.removeAttribute( "type" );
+	}
+
+	return elem;
+}
+
+function cloneCopyEvent( src, dest ) {
+	var i, l, type, pdataOld, udataOld, udataCur, events;
+
+	if ( dest.nodeType !== 1 ) {
+		return;
+	}
+
+	// 1. Copy private data: events, handlers, etc.
+	if ( dataPriv.hasData( src ) ) {
+		pdataOld = dataPriv.get( src );
+		events = pdataOld.events;
+
+		if ( events ) {
+			dataPriv.remove( dest, "handle events" );
+
+			for ( type in events ) {
+				for ( i = 0, l = events[ type ].length; i < l; i++ ) {
+					jQuery.event.add( dest, type, events[ type ][ i ] );
+				}
+			}
+		}
+	}
+
+	// 2. Copy user data
+	if ( dataUser.hasData( src ) ) {
+		udataOld = dataUser.access( src );
+		udataCur = jQuery.extend( {}, udataOld );
+
+		dataUser.set( dest, udataCur );
+	}
+}
+
+// Fix IE bugs, see support tests
+function fixInput( src, dest ) {
+	var nodeName = dest.nodeName.toLowerCase();
+
+	// Fails to persist the checked state of a cloned checkbox or radio button.
+	if ( nodeName === "input" && rcheckableType.test( src.type ) ) {
+		dest.checked = src.checked;
+
+	// Fails to return the selected option to the default selected state when cloning options
+	} else if ( nodeName === "input" || nodeName === "textarea" ) {
+		dest.defaultValue = src.defaultValue;
+	}
+}
+
+function domManip( collection, args, callback, ignored ) {
+
+	// Flatten any nested arrays
+	args = flat( args );
+
+	var fragment, first, scripts, hasScripts, node, doc,
+		i = 0,
+		l = collection.length,
+		iNoClone = l - 1,
+		value = args[ 0 ],
+		valueIsFunction = isFunction( value );
+
+	// We can't cloneNode fragments that contain checked, in WebKit
+	if ( valueIsFunction ||
+			( l > 1 && typeof value === "string" &&
+				!support.checkClone && rchecked.test( value ) ) ) {
+		return collection.each( function( index ) {
+			var self = collection.eq( index );
+			if ( valueIsFunction ) {
+				args[ 0 ] = value.call( this, index, self.html() );
+			}
+			domManip( self, args, callback, ignored );
+		} );
+	}
+
+	if ( l ) {
+		fragment = buildFragment( args, collection[ 0 ].ownerDocument, false, collection, ignored );
+		first = fragment.firstChild;
+
+		if ( fragment.childNodes.length === 1 ) {
+			fragment = first;
+		}
+
+		// Require either new content or an interest in ignored elements to invoke the callback
+		if ( first || ignored ) {
+			scripts = jQuery.map( getAll( fragment, "script" ), disableScript );
+			hasScripts = scripts.length;
+
+			// Use the original fragment for the last item
+			// instead of the first because it can end up
+			// being emptied incorrectly in certain situations (#8070).
+			for ( ; i < l; i++ ) {
+				node = fragment;
+
+				if ( i !== iNoClone ) {
+					node = jQuery.clone( node, true, true );
+
+					// Keep references to cloned scripts for later restoration
+					if ( hasScripts ) {
+
+						// Support: Android <=4.0 only, PhantomJS 1 only
+						// push.apply(_, arraylike) throws on ancient WebKit
+						jQuery.merge( scripts, getAll( node, "script" ) );
+					}
+				}
+
+				callback.call( collection[ i ], node, i );
+			}
+
+			if ( hasScripts ) {
+				doc = scripts[ scripts.length - 1 ].ownerDocument;
+
+				// Reenable scripts
+				jQuery.map( scripts, restoreScript );
+
+				// Evaluate executable scripts on first document insertion
+				for ( i = 0; i < hasScripts; i++ ) {
+					node = scripts[ i ];
+					if ( rscriptType.test( node.type || "" ) &&
+						!dataPriv.access( node, "globalEval" ) &&
+						jQuery.contains( doc, node ) ) {
+
+						if ( node.src && ( node.type || "" ).toLowerCase()  !== "module" ) {
+
+							// Optional AJAX dependency, but won't run scripts if not present
+							if ( jQuery._evalUrl && !node.noModule ) {
+								jQuery._evalUrl( node.src, {
+									nonce: node.nonce || node.getAttribute( "nonce" )
+								}, doc );
+							}
+						} else {
+							DOMEval( node.textContent.replace( rcleanScript, "" ), node, doc );
+						}
+					}
+				}
+			}
+		}
+	}
+
+	return collection;
+}
+
+function remove( elem, selector, keepData ) {
+	var node,
+		nodes = selector ? jQuery.filter( selector, elem ) : elem,
+		i = 0;
+
+	for ( ; ( node = nodes[ i ] ) != null; i++ ) {
+		if ( !keepData && node.nodeType === 1 ) {
+			jQuery.cleanData( getAll( node ) );
+		}
+
+		if ( node.parentNode ) {
+			if ( keepData && isAttached( node ) ) {
+				setGlobalEval( getAll( node, "script" ) );
+			}
+			node.parentNode.removeChild( node );
+		}
+	}
+
+	return elem;
+}
+
+jQuery.extend( {
+	htmlPrefilter: function( html ) {
+		return html;
+	},
+
+	clone: function( elem, dataAndEvents, deepDataAndEvents ) {
+		var i, l, srcElements, destElements,
+			clone = elem.cloneNode( true ),
+			inPage = isAttached( elem );
+
+		// Fix IE cloning issues
+		if ( !support.noCloneChecked && ( elem.nodeType === 1 || elem.nodeType === 11 ) &&
+				!jQuery.isXMLDoc( elem ) ) {
+
+			// We eschew Sizzle here for performance reasons: https://jsperf.com/getall-vs-sizzle/2
+			destElements = getAll( clone );
+			srcElements = getAll( elem );
+
+			for ( i = 0, l = srcElements.length; i < l; i++ ) {
+				fixInput( srcElements[ i ], destElements[ i ] );
+			}
+		}
+
+		// Copy the events from the original to the clone
+		if ( dataAndEvents ) {
+			if ( deepDataAndEvents ) {
+				srcElements = srcElements || getAll( elem );
+				destElements = destElements || getAll( clone );
+
+				for ( i = 0, l = srcElements.length; i < l; i++ ) {
+					cloneCopyEvent( srcElements[ i ], destElements[ i ] );
+				}
+			} else {
+				cloneCopyEvent( elem, clone );
+			}
+		}
+
+		// Preserve script evaluation history
+		destElements = getAll( clone, "script" );
+		if ( destElements.length > 0 ) {
+			setGlobalEval( destElements, !inPage && getAll( elem, "script" ) );
+		}
+
+		// Return the cloned set
+		return clone;
+	},
+
+	cleanData: function( elems ) {
+		var data, elem, type,
+			special = jQuery.event.special,
+			i = 0;
+
+		for ( ; ( elem = elems[ i ] ) !== undefined; i++ ) {
+			if ( acceptData( elem ) ) {
+				if ( ( data = elem[ dataPriv.expando ] ) ) {
+					if ( data.events ) {
+						for ( type in data.events ) {
+							if ( special[ type ] ) {
+								jQuery.event.remove( elem, type );
+
+							// This is a shortcut to avoid jQuery.event.remove's overhead
+							} else {
+								jQuery.removeEvent( elem, type, data.handle );
+							}
+						}
+					}
+
+					// Support: Chrome <=35 - 45+
+					// Assign undefined instead of using delete, see Data#remove
+					elem[ dataPriv.expando ] = undefined;
+				}
+				if ( elem[ dataUser.expando ] ) {
+
+					// Support: Chrome <=35 - 45+
+					// Assign undefined instead of using delete, see Data#remove
+					elem[ dataUser.expando ] = undefined;
+				}
+			}
+		}
+	}
+} );
+
+jQuery.fn.extend( {
+	detach: function( selector ) {
+		return remove( this, selector, true );
+	},
+
+	remove: function( selector ) {
+		return remove( this, selector );
+	},
+
+	text: function( value ) {
+		return access( this, function( value ) {
+			return value === undefined ?
+				jQuery.text( this ) :
+				this.empty().each( function() {
+					if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) {
+						this.textContent = value;
+					}
+				} );
+		}, null, value, arguments.length );
+	},
+
+	append: function() {
+		return domManip( this, arguments, function( elem ) {
+			if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) {
+				var target = manipulationTarget( this, elem );
+				target.appendChild( elem );
+			}
+		} );
+	},
+
+	prepend: function() {
+		return domManip( this, arguments, function( elem ) {
+			if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) {
+				var target = manipulationTarget( this, elem );
+				target.insertBefore( elem, target.firstChild );
+			}
+		} );
+	},
+
+	before: function() {
+		return domManip( this, arguments, function( elem ) {
+			if ( this.parentNode ) {
+				this.parentNode.insertBefore( elem, this );
+			}
+		} );
+	},
+
+	after: function() {
+		return domManip( this, arguments, function( elem ) {
+			if ( this.parentNode ) {
+				this.parentNode.insertBefore( elem, this.nextSibling );
+			}
+		} );
+	},
+
+	empty: function() {
+		var elem,
+			i = 0;
+
+		for ( ; ( elem = this[ i ] ) != null; i++ ) {
+			if ( elem.nodeType === 1 ) {
+
+				// Prevent memory leaks
+				jQuery.cleanData( getAll( elem, false ) );
+
+				// Remove any remaining nodes
+				elem.textContent = "";
+			}
+		}
+
+		return this;
+	},
+
+	clone: function( dataAndEvents, deepDataAndEvents ) {
+		dataAndEvents = dataAndEvents == null ? false : dataAndEvents;
+		deepDataAndEvents = deepDataAndEvents == null ? dataAndEvents : deepDataAndEvents;
+
+		return this.map( function() {
+			return jQuery.clone( this, dataAndEvents, deepDataAndEvents );
+		} );
+	},
+
+	html: function( value ) {
+		return access( this, function( value ) {
+			var elem = this[ 0 ] || {},
+				i = 0,
+				l = this.length;
+
+			if ( value === undefined && elem.nodeType === 1 ) {
+				return elem.innerHTML;
+			}
+
+			// See if we can take a shortcut and just use innerHTML
+			if ( typeof value === "string" && !rnoInnerhtml.test( value ) &&
+				!wrapMap[ ( rtagName.exec( value ) || [ "", "" ] )[ 1 ].toLowerCase() ] ) {
+
+				value = jQuery.htmlPrefilter( value );
+
+				try {
+					for ( ; i < l; i++ ) {
+						elem = this[ i ] || {};
+
+						// Remove element nodes and prevent memory leaks
+						if ( elem.nodeType === 1 ) {
+							jQuery.cleanData( getAll( elem, false ) );
+							elem.innerHTML = value;
+						}
+					}
+
+					elem = 0;
+
+				// If using innerHTML throws an exception, use the fallback method
+				} catch ( e ) {}
+			}
+
+			if ( elem ) {
+				this.empty().append( value );
+			}
+		}, null, value, arguments.length );
+	},
+
+	replaceWith: function() {
+		var ignored = [];
+
+		// Make the changes, replacing each non-ignored context element with the new content
+		return domManip( this, arguments, function( elem ) {
+			var parent = this.parentNode;
+
+			if ( jQuery.inArray( this, ignored ) < 0 ) {
+				jQuery.cleanData( getAll( this ) );
+				if ( parent ) {
+					parent.replaceChild( elem, this );
+				}
+			}
+
+		// Force callback invocation
+		}, ignored );
+	}
+} );
+
+jQuery.each( {
+	appendTo: "append",
+	prependTo: "prepend",
+	insertBefore: "before",
+	insertAfter: "after",
+	replaceAll: "replaceWith"
+}, function( name, original ) {
+	jQuery.fn[ name ] = function( selector ) {
+		var elems,
+			ret = [],
+			insert = jQuery( selector ),
+			last = insert.length - 1,
+			i = 0;
+
+		for ( ; i <= last; i++ ) {
+			elems = i === last ? this : this.clone( true );
+			jQuery( insert[ i ] )[ original ]( elems );
+
+			// Support: Android <=4.0 only, PhantomJS 1 only
+			// .get() because push.apply(_, arraylike) throws on ancient WebKit
+			push.apply( ret, elems.get() );
+		}
+
+		return this.pushStack( ret );
+	};
+} );
+var rnumnonpx = new RegExp( "^(" + pnum + ")(?!px)[a-z%]+$", "i" );
+
+var getStyles = function( elem ) {
+
+		// Support: IE <=11 only, Firefox <=30 (#15098, #14150)
+		// IE throws on elements created in popups
+		// FF meanwhile throws on frame elements through "defaultView.getComputedStyle"
+		var view = elem.ownerDocument.defaultView;
+
+		if ( !view || !view.opener ) {
+			view = window;
+		}
+
+		return view.getComputedStyle( elem );
+	};
+
+var swap = function( elem, options, callback ) {
+	var ret, name,
+		old = {};
+
+	// Remember the old values, and insert the new ones
+	for ( name in options ) {
+		old[ name ] = elem.style[ name ];
+		elem.style[ name ] = options[ name ];
+	}
+
+	ret = callback.call( elem );
+
+	// Revert the old values
+	for ( name in options ) {
+		elem.style[ name ] = old[ name ];
+	}
+
+	return ret;
+};
+
+
+var rboxStyle = new RegExp( cssExpand.join( "|" ), "i" );
+
+
+
+( function() {
+
+	// Executing both pixelPosition & boxSizingReliable tests require only one layout
+	// so they're executed at the same time to save the second computation.
+	function computeStyleTests() {
+
+		// This is a singleton, we need to execute it only once
+		if ( !div ) {
+			return;
+		}
+
+		container.style.cssText = "position:absolute;left:-11111px;width:60px;" +
+			"margin-top:1px;padding:0;border:0";
+		div.style.cssText =
+			"position:relative;display:block;box-sizing:border-box;overflow:scroll;" +
+			"margin:auto;border:1px;padding:1px;" +
+			"width:60%;top:1%";
+		documentElement.appendChild( container ).appendChild( div );
+
+		var divStyle = window.getComputedStyle( div );
+		pixelPositionVal = divStyle.top !== "1%";
+
+		// Support: Android 4.0 - 4.3 only, Firefox <=3 - 44
+		reliableMarginLeftVal = roundPixelMeasures( divStyle.marginLeft ) === 12;
+
+		// Support: Android 4.0 - 4.3 only, Safari <=9.1 - 10.1, iOS <=7.0 - 9.3
+		// Some styles come back with percentage values, even though they shouldn't
+		div.style.right = "60%";
+		pixelBoxStylesVal = roundPixelMeasures( divStyle.right ) === 36;
+
+		// Support: IE 9 - 11 only
+		// Detect misreporting of content dimensions for box-sizing:border-box elements
+		boxSizingReliableVal = roundPixelMeasures( divStyle.width ) === 36;
+
+		// Support: IE 9 only
+		// Detect overflow:scroll screwiness (gh-3699)
+		// Support: Chrome <=64
+		// Don't get tricked when zoom affects offsetWidth (gh-4029)
+		div.style.position = "absolute";
+		scrollboxSizeVal = roundPixelMeasures( div.offsetWidth / 3 ) === 12;
+
+		documentElement.removeChild( container );
+
+		// Nullify the div so it wouldn't be stored in the memory and
+		// it will also be a sign that checks already performed
+		div = null;
+	}
+
+	function roundPixelMeasures( measure ) {
+		return Math.round( parseFloat( measure ) );
+	}
+
+	var pixelPositionVal, boxSizingReliableVal, scrollboxSizeVal, pixelBoxStylesVal,
+		reliableTrDimensionsVal, reliableMarginLeftVal,
+		container = document.createElement( "div" ),
+		div = document.createElement( "div" );
+
+	// Finish early in limited (non-browser) environments
+	if ( !div.style ) {
+		return;
+	}
+
+	// Support: IE <=9 - 11 only
+	// Style of cloned element affects source element cloned (#8908)
+	div.style.backgroundClip = "content-box";
+	div.cloneNode( true ).style.backgroundClip = "";
+	support.clearCloneStyle = div.style.backgroundClip === "content-box";
+
+	jQuery.extend( support, {
+		boxSizingReliable: function() {
+			computeStyleTests();
+			return boxSizingReliableVal;
+		},
+		pixelBoxStyles: function() {
+			computeStyleTests();
+			return pixelBoxStylesVal;
+		},
+		pixelPosition: function() {
+			computeStyleTests();
+			return pixelPositionVal;
+		},
+		reliableMarginLeft: function() {
+			computeStyleTests();
+			return reliableMarginLeftVal;
+		},
+		scrollboxSize: function() {
+			computeStyleTests();
+			return scrollboxSizeVal;
+		},
+
+		// Support: IE 9 - 11+, Edge 15 - 18+
+		// IE/Edge misreport `getComputedStyle` of table rows with width/height
+		// set in CSS while `offset*` properties report correct values.
+		// Behavior in IE 9 is more subtle than in newer versions & it passes
+		// some versions of this test; make sure not to make it pass there!
+		//
+		// Support: Firefox 70+
+		// Only Firefox includes border widths
+		// in computed dimensions. (gh-4529)
+		reliableTrDimensions: function() {
+			var table, tr, trChild, trStyle;
+			if ( reliableTrDimensionsVal == null ) {
+				table = document.createElement( "table" );
+				tr = document.createElement( "tr" );
+				trChild = document.createElement( "div" );
+
+				table.style.cssText = "position:absolute;left:-11111px;border-collapse:separate";
+				tr.style.cssText = "border:1px solid";
+
+				// Support: Chrome 86+
+				// Height set through cssText does not get applied.
+				// Computed height then comes back as 0.
+				tr.style.height = "1px";
+				trChild.style.height = "9px";
+
+				// Support: Android 8 Chrome 86+
+				// In our bodyBackground.html iframe,
+				// display for all div elements is set to "inline",
+				// which causes a problem only in Android 8 Chrome 86.
+				// Ensuring the div is display: block
+				// gets around this issue.
+				trChild.style.display = "block";
+
+				documentElement
+					.appendChild( table )
+					.appendChild( tr )
+					.appendChild( trChild );
+
+				trStyle = window.getComputedStyle( tr );
+				reliableTrDimensionsVal = ( parseInt( trStyle.height, 10 ) +
+					parseInt( trStyle.borderTopWidth, 10 ) +
+					parseInt( trStyle.borderBottomWidth, 10 ) ) === tr.offsetHeight;
+
+				documentElement.removeChild( table );
+			}
+			return reliableTrDimensionsVal;
+		}
+	} );
+} )();
+
+
+function curCSS( elem, name, computed ) {
+	var width, minWidth, maxWidth, ret,
+
+		// Support: Firefox 51+
+		// Retrieving style before computed somehow
+		// fixes an issue with getting wrong values
+		// on detached elements
+		style = elem.style;
+
+	computed = computed || getStyles( elem );
+
+	// getPropertyValue is needed for:
+	//   .css('filter') (IE 9 only, #12537)
+	//   .css('--customProperty) (#3144)
+	if ( computed ) {
+		ret = computed.getPropertyValue( name ) || computed[ name ];
+
+		if ( ret === "" && !isAttached( elem ) ) {
+			ret = jQuery.style( elem, name );
+		}
+
+		// A tribute to the "awesome hack by Dean Edwards"
+		// Android Browser returns percentage for some values,
+		// but width seems to be reliably pixels.
+		// This is against the CSSOM draft spec:
+		// https://drafts.csswg.org/cssom/#resolved-values
+		if ( !support.pixelBoxStyles() && rnumnonpx.test( ret ) && rboxStyle.test( name ) ) {
+
+			// Remember the original values
+			width = style.width;
+			minWidth = style.minWidth;
+			maxWidth = style.maxWidth;
+
+			// Put in the new values to get a computed value out
+			style.minWidth = style.maxWidth = style.width = ret;
+			ret = computed.width;
+
+			// Revert the changed values
+			style.width = width;
+			style.minWidth = minWidth;
+			style.maxWidth = maxWidth;
+		}
+	}
+
+	return ret !== undefined ?
+
+		// Support: IE <=9 - 11 only
+		// IE returns zIndex value as an integer.
+		ret + "" :
+		ret;
+}
+
+
+function addGetHookIf( conditionFn, hookFn ) {
+
+	// Define the hook, we'll check on the first run if it's really needed.
+	return {
+		get: function() {
+			if ( conditionFn() ) {
+
+				// Hook not needed (or it's not possible to use it due
+				// to missing dependency), remove it.
+				delete this.get;
+				return;
+			}
+
+			// Hook needed; redefine it so that the support test is not executed again.
+			return ( this.get = hookFn ).apply( this, arguments );
+		}
+	};
+}
+
+
+var cssPrefixes = [ "Webkit", "Moz", "ms" ],
+	emptyStyle = document.createElement( "div" ).style,
+	vendorProps = {};
+
+// Return a vendor-prefixed property or undefined
+function vendorPropName( name ) {
+
+	// Check for vendor prefixed names
+	var capName = name[ 0 ].toUpperCase() + name.slice( 1 ),
+		i = cssPrefixes.length;
+
+	while ( i-- ) {
+		name = cssPrefixes[ i ] + capName;
+		if ( name in emptyStyle ) {
+			return name;
+		}
+	}
+}
+
+// Return a potentially-mapped jQuery.cssProps or vendor prefixed property
+function finalPropName( name ) {
+	var final = jQuery.cssProps[ name ] || vendorProps[ name ];
+
+	if ( final ) {
+		return final;
+	}
+	if ( name in emptyStyle ) {
+		return name;
+	}
+	return vendorProps[ name ] = vendorPropName( name ) || name;
+}
+
+
+var
+
+	// Swappable if display is none or starts with table
+	// except "table", "table-cell", or "table-caption"
+	// See here for display values: https://developer.mozilla.org/en-US/docs/CSS/display
+	rdisplayswap = /^(none|table(?!-c[ea]).+)/,
+	rcustomProp = /^--/,
+	cssShow = { position: "absolute", visibility: "hidden", display: "block" },
+	cssNormalTransform = {
+		letterSpacing: "0",
+		fontWeight: "400"
+	};
+
+function setPositiveNumber( _elem, value, subtract ) {
+
+	// Any relative (+/-) values have already been
+	// normalized at this point
+	var matches = rcssNum.exec( value );
+	return matches ?
+
+		// Guard against undefined "subtract", e.g., when used as in cssHooks
+		Math.max( 0, matches[ 2 ] - ( subtract || 0 ) ) + ( matches[ 3 ] || "px" ) :
+		value;
+}
+
+function boxModelAdjustment( elem, dimension, box, isBorderBox, styles, computedVal ) {
+	var i = dimension === "width" ? 1 : 0,
+		extra = 0,
+		delta = 0;
+
+	// Adjustment may not be necessary
+	if ( box === ( isBorderBox ? "border" : "content" ) ) {
+		return 0;
+	}
+
+	for ( ; i < 4; i += 2 ) {
+
+		// Both box models exclude margin
+		if ( box === "margin" ) {
+			delta += jQuery.css( elem, box + cssExpand[ i ], true, styles );
+		}
+
+		// If we get here with a content-box, we're seeking "padding" or "border" or "margin"
+		if ( !isBorderBox ) {
+
+			// Add padding
+			delta += jQuery.css( elem, "padding" + cssExpand[ i ], true, styles );
+
+			// For "border" or "margin", add border
+			if ( box !== "padding" ) {
+				delta += jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles );
+
+			// But still keep track of it otherwise
+			} else {
+				extra += jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles );
+			}
+
+		// If we get here with a border-box (content + padding + border), we're seeking "content" or
+		// "padding" or "margin"
+		} else {
+
+			// For "content", subtract padding
+			if ( box === "content" ) {
+				delta -= jQuery.css( elem, "padding" + cssExpand[ i ], true, styles );
+			}
+
+			// For "content" or "padding", subtract border
+			if ( box !== "margin" ) {
+				delta -= jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles );
+			}
+		}
+	}
+
+	// Account for positive content-box scroll gutter when requested by providing computedVal
+	if ( !isBorderBox && computedVal >= 0 ) {
+
+		// offsetWidth/offsetHeight is a rounded sum of content, padding, scroll gutter, and border
+		// Assuming integer scroll gutter, subtract the rest and round down
+		delta += Math.max( 0, Math.ceil(
+			elem[ "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ) ] -
+			computedVal -
+			delta -
+			extra -
+			0.5
+
+		// If offsetWidth/offsetHeight is unknown, then we can't determine content-box scroll gutter
+		// Use an explicit zero to avoid NaN (gh-3964)
+		) ) || 0;
+	}
+
+	return delta;
+}
+
+function getWidthOrHeight( elem, dimension, extra ) {
+
+	// Start with computed style
+	var styles = getStyles( elem ),
+
+		// To avoid forcing a reflow, only fetch boxSizing if we need it (gh-4322).
+		// Fake content-box until we know it's needed to know the true value.
+		boxSizingNeeded = !support.boxSizingReliable() || extra,
+		isBorderBox = boxSizingNeeded &&
+			jQuery.css( elem, "boxSizing", false, styles ) === "border-box",
+		valueIsBorderBox = isBorderBox,
+
+		val = curCSS( elem, dimension, styles ),
+		offsetProp = "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 );
+
+	// Support: Firefox <=54
+	// Return a confounding non-pixel value or feign ignorance, as appropriate.
+	if ( rnumnonpx.test( val ) ) {
+		if ( !extra ) {
+			return val;
+		}
+		val = "auto";
+	}
+
+
+	// Support: IE 9 - 11 only
+	// Use offsetWidth/offsetHeight for when box sizing is unreliable.
+	// In those cases, the computed value can be trusted to be border-box.
+	if ( ( !support.boxSizingReliable() && isBorderBox ||
+
+		// Support: IE 10 - 11+, Edge 15 - 18+
+		// IE/Edge misreport `getComputedStyle` of table rows with width/height
+		// set in CSS while `offset*` properties report correct values.
+		// Interestingly, in some cases IE 9 doesn't suffer from this issue.
+		!support.reliableTrDimensions() && nodeName( elem, "tr" ) ||
+
+		// Fall back to offsetWidth/offsetHeight when value is "auto"
+		// This happens for inline elements with no explicit setting (gh-3571)
+		val === "auto" ||
+
+		// Support: Android <=4.1 - 4.3 only
+		// Also use offsetWidth/offsetHeight for misreported inline dimensions (gh-3602)
+		!parseFloat( val ) && jQuery.css( elem, "display", false, styles ) === "inline" ) &&
+
+		// Make sure the element is visible & connected
+		elem.getClientRects().length ) {
+
+		isBorderBox = jQuery.css( elem, "boxSizing", false, styles ) === "border-box";
+
+		// Where available, offsetWidth/offsetHeight approximate border box dimensions.
+		// Where not available (e.g., SVG), assume unreliable box-sizing and interpret the
+		// retrieved value as a content box dimension.
+		valueIsBorderBox = offsetProp in elem;
+		if ( valueIsBorderBox ) {
+			val = elem[ offsetProp ];
+		}
+	}
+
+	// Normalize "" and auto
+	val = parseFloat( val ) || 0;
+
+	// Adjust for the element's box model
+	return ( val +
+		boxModelAdjustment(
+			elem,
+			dimension,
+			extra || ( isBorderBox ? "border" : "content" ),
+			valueIsBorderBox,
+			styles,
+
+			// Provide the current computed size to request scroll gutter calculation (gh-3589)
+			val
+		)
+	) + "px";
+}
+
+jQuery.extend( {
+
+	// Add in style property hooks for overriding the default
+	// behavior of getting and setting a style property
+	cssHooks: {
+		opacity: {
+			get: function( elem, computed ) {
+				if ( computed ) {
+
+					// We should always get a number back from opacity
+					var ret = curCSS( elem, "opacity" );
+					return ret === "" ? "1" : ret;
+				}
+			}
+		}
+	},
+
+	// Don't automatically add "px" to these possibly-unitless properties
+	cssNumber: {
+		"animationIterationCount": true,
+		"columnCount": true,
+		"fillOpacity": true,
+		"flexGrow": true,
+		"flexShrink": true,
+		"fontWeight": true,
+		"gridArea": true,
+		"gridColumn": true,
+		"gridColumnEnd": true,
+		"gridColumnStart": true,
+		"gridRow": true,
+		"gridRowEnd": true,
+		"gridRowStart": true,
+		"lineHeight": true,
+		"opacity": true,
+		"order": true,
+		"orphans": true,
+		"widows": true,
+		"zIndex": true,
+		"zoom": true
+	},
+
+	// Add in properties whose names you wish to fix before
+	// setting or getting the value
+	cssProps: {},
+
+	// Get and set the style property on a DOM Node
+	style: function( elem, name, value, extra ) {
+
+		// Don't set styles on text and comment nodes
+		if ( !elem || elem.nodeType === 3 || elem.nodeType === 8 || !elem.style ) {
+			return;
+		}
+
+		// Make sure that we're working with the right name
+		var ret, type, hooks,
+			origName = camelCase( name ),
+			isCustomProp = rcustomProp.test( name ),
+			style = elem.style;
+
+		// Make sure that we're working with the right name. We don't
+		// want to query the value if it is a CSS custom property
+		// since they are user-defined.
+		if ( !isCustomProp ) {
+			name = finalPropName( origName );
+		}
+
+		// Gets hook for the prefixed version, then unprefixed version
+		hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ];
+
+		// Check if we're setting a value
+		if ( value !== undefined ) {
+			type = typeof value;
+
+			// Convert "+=" or "-=" to relative numbers (#7345)
+			if ( type === "string" && ( ret = rcssNum.exec( value ) ) && ret[ 1 ] ) {
+				value = adjustCSS( elem, name, ret );
+
+				// Fixes bug #9237
+				type = "number";
+			}
+
+			// Make sure that null and NaN values aren't set (#7116)
+			if ( value == null || value !== value ) {
+				return;
+			}
+
+			// If a number was passed in, add the unit (except for certain CSS properties)
+			// The isCustomProp check can be removed in jQuery 4.0 when we only auto-append
+			// "px" to a few hardcoded values.
+			if ( type === "number" && !isCustomProp ) {
+				value += ret && ret[ 3 ] || ( jQuery.cssNumber[ origName ] ? "" : "px" );
+			}
+
+			// background-* props affect original clone's values
+			if ( !support.clearCloneStyle && value === "" && name.indexOf( "background" ) === 0 ) {
+				style[ name ] = "inherit";
+			}
+
+			// If a hook was provided, use that value, otherwise just set the specified value
+			if ( !hooks || !( "set" in hooks ) ||
+				( value = hooks.set( elem, value, extra ) ) !== undefined ) {
+
+				if ( isCustomProp ) {
+					style.setProperty( name, value );
+				} else {
+					style[ name ] = value;
+				}
+			}
+
+		} else {
+
+			// If a hook was provided get the non-computed value from there
+			if ( hooks && "get" in hooks &&
+				( ret = hooks.get( elem, false, extra ) ) !== undefined ) {
+
+				return ret;
+			}
+
+			// Otherwise just get the value from the style object
+			return style[ name ];
+		}
+	},
+
+	css: function( elem, name, extra, styles ) {
+		var val, num, hooks,
+			origName = camelCase( name ),
+			isCustomProp = rcustomProp.test( name );
+
+		// Make sure that we're working with the right name. We don't
+		// want to modify the value if it is a CSS custom property
+		// since they are user-defined.
+		if ( !isCustomProp ) {
+			name = finalPropName( origName );
+		}
+
+		// Try prefixed name followed by the unprefixed name
+		hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ];
+
+		// If a hook was provided get the computed value from there
+		if ( hooks && "get" in hooks ) {
+			val = hooks.get( elem, true, extra );
+		}
+
+		// Otherwise, if a way to get the computed value exists, use that
+		if ( val === undefined ) {
+			val = curCSS( elem, name, styles );
+		}
+
+		// Convert "normal" to computed value
+		if ( val === "normal" && name in cssNormalTransform ) {
+			val = cssNormalTransform[ name ];
+		}
+
+		// Make numeric if forced or a qualifier was provided and val looks numeric
+		if ( extra === "" || extra ) {
+			num = parseFloat( val );
+			return extra === true || isFinite( num ) ? num || 0 : val;
+		}
+
+		return val;
+	}
+} );
+
+jQuery.each( [ "height", "width" ], function( _i, dimension ) {
+	jQuery.cssHooks[ dimension ] = {
+		get: function( elem, computed, extra ) {
+			if ( computed ) {
+
+				// Certain elements can have dimension info if we invisibly show them
+				// but it must have a current display style that would benefit
+				return rdisplayswap.test( jQuery.css( elem, "display" ) ) &&
+
+					// Support: Safari 8+
+					// Table columns in Safari have non-zero offsetWidth & zero
+					// getBoundingClientRect().width unless display is changed.
+					// Support: IE <=11 only
+					// Running getBoundingClientRect on a disconnected node
+					// in IE throws an error.
+					( !elem.getClientRects().length || !elem.getBoundingClientRect().width ) ?
+					swap( elem, cssShow, function() {
+						return getWidthOrHeight( elem, dimension, extra );
+					} ) :
+					getWidthOrHeight( elem, dimension, extra );
+			}
+		},
+
+		set: function( elem, value, extra ) {
+			var matches,
+				styles = getStyles( elem ),
+
+				// Only read styles.position if the test has a chance to fail
+				// to avoid forcing a reflow.
+				scrollboxSizeBuggy = !support.scrollboxSize() &&
+					styles.position === "absolute",
+
+				// To avoid forcing a reflow, only fetch boxSizing if we need it (gh-3991)
+				boxSizingNeeded = scrollboxSizeBuggy || extra,
+				isBorderBox = boxSizingNeeded &&
+					jQuery.css( elem, "boxSizing", false, styles ) === "border-box",
+				subtract = extra ?
+					boxModelAdjustment(
+						elem,
+						dimension,
+						extra,
+						isBorderBox,
+						styles
+					) :
+					0;
+
+			// Account for unreliable border-box dimensions by comparing offset* to computed and
+			// faking a content-box to get border and padding (gh-3699)
+			if ( isBorderBox && scrollboxSizeBuggy ) {
+				subtract -= Math.ceil(
+					elem[ "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ) ] -
+					parseFloat( styles[ dimension ] ) -
+					boxModelAdjustment( elem, dimension, "border", false, styles ) -
+					0.5
+				);
+			}
+
+			// Convert to pixels if value adjustment is needed
+			if ( subtract && ( matches = rcssNum.exec( value ) ) &&
+				( matches[ 3 ] || "px" ) !== "px" ) {
+
+				elem.style[ dimension ] = value;
+				value = jQuery.css( elem, dimension );
+			}
+
+			return setPositiveNumber( elem, value, subtract );
+		}
+	};
+} );
+
+jQuery.cssHooks.marginLeft = addGetHookIf( support.reliableMarginLeft,
+	function( elem, computed ) {
+		if ( computed ) {
+			return ( parseFloat( curCSS( elem, "marginLeft" ) ) ||
+				elem.getBoundingClientRect().left -
+					swap( elem, { marginLeft: 0 }, function() {
+						return elem.getBoundingClientRect().left;
+					} )
+			) + "px";
+		}
+	}
+);
+
+// These hooks are used by animate to expand properties
+jQuery.each( {
+	margin: "",
+	padding: "",
+	border: "Width"
+}, function( prefix, suffix ) {
+	jQuery.cssHooks[ prefix + suffix ] = {
+		expand: function( value ) {
+			var i = 0,
+				expanded = {},
+
+				// Assumes a single number if not a string
+				parts = typeof value === "string" ? value.split( " " ) : [ value ];
+
+			for ( ; i < 4; i++ ) {
+				expanded[ prefix + cssExpand[ i ] + suffix ] =
+					parts[ i ] || parts[ i - 2 ] || parts[ 0 ];
+			}
+
+			return expanded;
+		}
+	};
+
+	if ( prefix !== "margin" ) {
+		jQuery.cssHooks[ prefix + suffix ].set = setPositiveNumber;
+	}
+} );
+
+jQuery.fn.extend( {
+	css: function( name, value ) {
+		return access( this, function( elem, name, value ) {
+			var styles, len,
+				map = {},
+				i = 0;
+
+			if ( Array.isArray( name ) ) {
+				styles = getStyles( elem );
+				len = name.length;
+
+				for ( ; i < len; i++ ) {
+					map[ name[ i ] ] = jQuery.css( elem, name[ i ], false, styles );
+				}
+
+				return map;
+			}
+
+			return value !== undefined ?
+				jQuery.style( elem, name, value ) :
+				jQuery.css( elem, name );
+		}, name, value, arguments.length > 1 );
+	}
+} );
+
+
+function Tween( elem, options, prop, end, easing ) {
+	return new Tween.prototype.init( elem, options, prop, end, easing );
+}
+jQuery.Tween = Tween;
+
+Tween.prototype = {
+	constructor: Tween,
+	init: function( elem, options, prop, end, easing, unit ) {
+		this.elem = elem;
+		this.prop = prop;
+		this.easing = easing || jQuery.easing._default;
+		this.options = options;
+		this.start = this.now = this.cur();
+		this.end = end;
+		this.unit = unit || ( jQuery.cssNumber[ prop ] ? "" : "px" );
+	},
+	cur: function() {
+		var hooks = Tween.propHooks[ this.prop ];
+
+		return hooks && hooks.get ?
+			hooks.get( this ) :
+			Tween.propHooks._default.get( this );
+	},
+	run: function( percent ) {
+		var eased,
+			hooks = Tween.propHooks[ this.prop ];
+
+		if ( this.options.duration ) {
+			this.pos = eased = jQuery.easing[ this.easing ](
+				percent, this.options.duration * percent, 0, 1, this.options.duration
+			);
+		} else {
+			this.pos = eased = percent;
+		}
+		this.now = ( this.end - this.start ) * eased + this.start;
+
+		if ( this.options.step ) {
+			this.options.step.call( this.elem, this.now, this );
+		}
+
+		if ( hooks && hooks.set ) {
+			hooks.set( this );
+		} else {
+			Tween.propHooks._default.set( this );
+		}
+		return this;
+	}
+};
+
+Tween.prototype.init.prototype = Tween.prototype;
+
+Tween.propHooks = {
+	_default: {
+		get: function( tween ) {
+			var result;
+
+			// Use a property on the element directly when it is not a DOM element,
+			// or when there is no matching style property that exists.
+			if ( tween.elem.nodeType !== 1 ||
+				tween.elem[ tween.prop ] != null && tween.elem.style[ tween.prop ] == null ) {
+				return tween.elem[ tween.prop ];
+			}
+
+			// Passing an empty string as a 3rd parameter to .css will automatically
+			// attempt a parseFloat and fallback to a string if the parse fails.
+			// Simple values such as "10px" are parsed to Float;
+			// complex values such as "rotate(1rad)" are returned as-is.
+			result = jQuery.css( tween.elem, tween.prop, "" );
+
+			// Empty strings, null, undefined and "auto" are converted to 0.
+			return !result || result === "auto" ? 0 : result;
+		},
+		set: function( tween ) {
+
+			// Use step hook for back compat.
+			// Use cssHook if its there.
+			// Use .style if available and use plain properties where available.
+			if ( jQuery.fx.step[ tween.prop ] ) {
+				jQuery.fx.step[ tween.prop ]( tween );
+			} else if ( tween.elem.nodeType === 1 && (
+				jQuery.cssHooks[ tween.prop ] ||
+					tween.elem.style[ finalPropName( tween.prop ) ] != null ) ) {
+				jQuery.style( tween.elem, tween.prop, tween.now + tween.unit );
+			} else {
+				tween.elem[ tween.prop ] = tween.now;
+			}
+		}
+	}
+};
+
+// Support: IE <=9 only
+// Panic based approach to setting things on disconnected nodes
+Tween.propHooks.scrollTop = Tween.propHooks.scrollLeft = {
+	set: function( tween ) {
+		if ( tween.elem.nodeType && tween.elem.parentNode ) {
+			tween.elem[ tween.prop ] = tween.now;
+		}
+	}
+};
+
+jQuery.easing = {
+	linear: function( p ) {
+		return p;
+	},
+	swing: function( p ) {
+		return 0.5 - Math.cos( p * Math.PI ) / 2;
+	},
+	_default: "swing"
+};
+
+jQuery.fx = Tween.prototype.init;
+
+// Back compat <1.8 extension point
+jQuery.fx.step = {};
+
+
+
+
+var
+	fxNow, inProgress,
+	rfxtypes = /^(?:toggle|show|hide)$/,
+	rrun = /queueHooks$/;
+
+function schedule() {
+	if ( inProgress ) {
+		if ( document.hidden === false && window.requestAnimationFrame ) {
+			window.requestAnimationFrame( schedule );
+		} else {
+			window.setTimeout( schedule, jQuery.fx.interval );
+		}
+
+		jQuery.fx.tick();
+	}
+}
+
+// Animations created synchronously will run synchronously
+function createFxNow() {
+	window.setTimeout( function() {
+		fxNow = undefined;
+	} );
+	return ( fxNow = Date.now() );
+}
+
+// Generate parameters to create a standard animation
+function genFx( type, includeWidth ) {
+	var which,
+		i = 0,
+		attrs = { height: type };
+
+	// If we include width, step value is 1 to do all cssExpand values,
+	// otherwise step value is 2 to skip over Left and Right
+	includeWidth = includeWidth ? 1 : 0;
+	for ( ; i < 4; i += 2 - includeWidth ) {
+		which = cssExpand[ i ];
+		attrs[ "margin" + which ] = attrs[ "padding" + which ] = type;
+	}
+
+	if ( includeWidth ) {
+		attrs.opacity = attrs.width = type;
+	}
+
+	return attrs;
+}
+
+function createTween( value, prop, animation ) {
+	var tween,
+		collection = ( Animation.tweeners[ prop ] || [] ).concat( Animation.tweeners[ "*" ] ),
+		index = 0,
+		length = collection.length;
+	for ( ; index < length; index++ ) {
+		if ( ( tween = collection[ index ].call( animation, prop, value ) ) ) {
+
+			// We're done with this property
+			return tween;
+		}
+	}
+}
+
+function defaultPrefilter( elem, props, opts ) {
+	var prop, value, toggle, hooks, oldfire, propTween, restoreDisplay, display,
+		isBox = "width" in props || "height" in props,
+		anim = this,
+		orig = {},
+		style = elem.style,
+		hidden = elem.nodeType && isHiddenWithinTree( elem ),
+		dataShow = dataPriv.get( elem, "fxshow" );
+
+	// Queue-skipping animations hijack the fx hooks
+	if ( !opts.queue ) {
+		hooks = jQuery._queueHooks( elem, "fx" );
+		if ( hooks.unqueued == null ) {
+			hooks.unqueued = 0;
+			oldfire = hooks.empty.fire;
+			hooks.empty.fire = function() {
+				if ( !hooks.unqueued ) {
+					oldfire();
+				}
+			};
+		}
+		hooks.unqueued++;
+
+		anim.always( function() {
+
+			// Ensure the complete handler is called before this completes
+			anim.always( function() {
+				hooks.unqueued--;
+				if ( !jQuery.queue( elem, "fx" ).length ) {
+					hooks.empty.fire();
+				}
+			} );
+		} );
+	}
+
+	// Detect show/hide animations
+	for ( prop in props ) {
+		value = props[ prop ];
+		if ( rfxtypes.test( value ) ) {
+			delete props[ prop ];
+			toggle = toggle || value === "toggle";
+			if ( value === ( hidden ? "hide" : "show" ) ) {
+
+				// Pretend to be hidden if this is a "show" and
+				// there is still data from a stopped show/hide
+				if ( value === "show" && dataShow && dataShow[ prop ] !== undefined ) {
+					hidden = true;
+
+				// Ignore all other no-op show/hide data
+				} else {
+					continue;
+				}
+			}
+			orig[ prop ] = dataShow && dataShow[ prop ] || jQuery.style( elem, prop );
+		}
+	}
+
+	// Bail out if this is a no-op like .hide().hide()
+	propTween = !jQuery.isEmptyObject( props );
+	if ( !propTween && jQuery.isEmptyObject( orig ) ) {
+		return;
+	}
+
+	// Restrict "overflow" and "display" styles during box animations
+	if ( isBox && elem.nodeType === 1 ) {
+
+		// Support: IE <=9 - 11, Edge 12 - 15
+		// Record all 3 overflow attributes because IE does not infer the shorthand
+		// from identically-valued overflowX and overflowY and Edge just mirrors
+		// the overflowX value there.
+		opts.overflow = [ style.overflow, style.overflowX, style.overflowY ];
+
+		// Identify a display type, preferring old show/hide data over the CSS cascade
+		restoreDisplay = dataShow && dataShow.display;
+		if ( restoreDisplay == null ) {
+			restoreDisplay = dataPriv.get( elem, "display" );
+		}
+		display = jQuery.css( elem, "display" );
+		if ( display === "none" ) {
+			if ( restoreDisplay ) {
+				display = restoreDisplay;
+			} else {
+
+				// Get nonempty value(s) by temporarily forcing visibility
+				showHide( [ elem ], true );
+				restoreDisplay = elem.style.display || restoreDisplay;
+				display = jQuery.css( elem, "display" );
+				showHide( [ elem ] );
+			}
+		}
+
+		// Animate inline elements as inline-block
+		if ( display === "inline" || display === "inline-block" && restoreDisplay != null ) {
+			if ( jQuery.css( elem, "float" ) === "none" ) {
+
+				// Restore the original display value at the end of pure show/hide animations
+				if ( !propTween ) {
+					anim.done( function() {
+						style.display = restoreDisplay;
+					} );
+					if ( restoreDisplay == null ) {
+						display = style.display;
+						restoreDisplay = display === "none" ? "" : display;
+					}
+				}
+				style.display = "inline-block";
+			}
+		}
+	}
+
+	if ( opts.overflow ) {
+		style.overflow = "hidden";
+		anim.always( function() {
+			style.overflow = opts.overflow[ 0 ];
+			style.overflowX = opts.overflow[ 1 ];
+			style.overflowY = opts.overflow[ 2 ];
+		} );
+	}
+
+	// Implement show/hide animations
+	propTween = false;
+	for ( prop in orig ) {
+
+		// General show/hide setup for this element animation
+		if ( !propTween ) {
+			if ( dataShow ) {
+				if ( "hidden" in dataShow ) {
+					hidden = dataShow.hidden;
+				}
+			} else {
+				dataShow = dataPriv.access( elem, "fxshow", { display: restoreDisplay } );
+			}
+
+			// Store hidden/visible for toggle so `.stop().toggle()` "reverses"
+			if ( toggle ) {
+				dataShow.hidden = !hidden;
+			}
+
+			// Show elements before animating them
+			if ( hidden ) {
+				showHide( [ elem ], true );
+			}
+
+			/* eslint-disable no-loop-func */
+
+			anim.done( function() {
+
+				/* eslint-enable no-loop-func */
+
+				// The final step of a "hide" animation is actually hiding the element
+				if ( !hidden ) {
+					showHide( [ elem ] );
+				}
+				dataPriv.remove( elem, "fxshow" );
+				for ( prop in orig ) {
+					jQuery.style( elem, prop, orig[ prop ] );
+				}
+			} );
+		}
+
+		// Per-property setup
+		propTween = createTween( hidden ? dataShow[ prop ] : 0, prop, anim );
+		if ( !( prop in dataShow ) ) {
+			dataShow[ prop ] = propTween.start;
+			if ( hidden ) {
+				propTween.end = propTween.start;
+				propTween.start = 0;
+			}
+		}
+	}
+}
+
+function propFilter( props, specialEasing ) {
+	var index, name, easing, value, hooks;
+
+	// camelCase, specialEasing and expand cssHook pass
+	for ( index in props ) {
+		name = camelCase( index );
+		easing = specialEasing[ name ];
+		value = props[ index ];
+		if ( Array.isArray( value ) ) {
+			easing = value[ 1 ];
+			value = props[ index ] = value[ 0 ];
+		}
+
+		if ( index !== name ) {
+			props[ name ] = value;
+			delete props[ index ];
+		}
+
+		hooks = jQuery.cssHooks[ name ];
+		if ( hooks && "expand" in hooks ) {
+			value = hooks.expand( value );
+			delete props[ name ];
+
+			// Not quite $.extend, this won't overwrite existing keys.
+			// Reusing 'index' because we have the correct "name"
+			for ( index in value ) {
+				if ( !( index in props ) ) {
+					props[ index ] = value[ index ];
+					specialEasing[ index ] = easing;
+				}
+			}
+		} else {
+			specialEasing[ name ] = easing;
+		}
+	}
+}
+
+function Animation( elem, properties, options ) {
+	var result,
+		stopped,
+		index = 0,
+		length = Animation.prefilters.length,
+		deferred = jQuery.Deferred().always( function() {
+
+			// Don't match elem in the :animated selector
+			delete tick.elem;
+		} ),
+		tick = function() {
+			if ( stopped ) {
+				return false;
+			}
+			var currentTime = fxNow || createFxNow(),
+				remaining = Math.max( 0, animation.startTime + animation.duration - currentTime ),
+
+				// Support: Android 2.3 only
+				// Archaic crash bug won't allow us to use `1 - ( 0.5 || 0 )` (#12497)
+				temp = remaining / animation.duration || 0,
+				percent = 1 - temp,
+				index = 0,
+				length = animation.tweens.length;
+
+			for ( ; index < length; index++ ) {
+				animation.tweens[ index ].run( percent );
+			}
+
+			deferred.notifyWith( elem, [ animation, percent, remaining ] );
+
+			// If there's more to do, yield
+			if ( percent < 1 && length ) {
+				return remaining;
+			}
+
+			// If this was an empty animation, synthesize a final progress notification
+			if ( !length ) {
+				deferred.notifyWith( elem, [ animation, 1, 0 ] );
+			}
+
+			// Resolve the animation and report its conclusion
+			deferred.resolveWith( elem, [ animation ] );
+			return false;
+		},
+		animation = deferred.promise( {
+			elem: elem,
+			props: jQuery.extend( {}, properties ),
+			opts: jQuery.extend( true, {
+				specialEasing: {},
+				easing: jQuery.easing._default
+			}, options ),
+			originalProperties: properties,
+			originalOptions: options,
+			startTime: fxNow || createFxNow(),
+			duration: options.duration,
+			tweens: [],
+			createTween: function( prop, end ) {
+				var tween = jQuery.Tween( elem, animation.opts, prop, end,
+					animation.opts.specialEasing[ prop ] || animation.opts.easing );
+				animation.tweens.push( tween );
+				return tween;
+			},
+			stop: function( gotoEnd ) {
+				var index = 0,
+
+					// If we are going to the end, we want to run all the tweens
+					// otherwise we skip this part
+					length = gotoEnd ? animation.tweens.length : 0;
+				if ( stopped ) {
+					return this;
+				}
+				stopped = true;
+				for ( ; index < length; index++ ) {
+					animation.tweens[ index ].run( 1 );
+				}
+
+				// Resolve when we played the last frame; otherwise, reject
+				if ( gotoEnd ) {
+					deferred.notifyWith( elem, [ animation, 1, 0 ] );
+					deferred.resolveWith( elem, [ animation, gotoEnd ] );
+				} else {
+					deferred.rejectWith( elem, [ animation, gotoEnd ] );
+				}
+				return this;
+			}
+		} ),
+		props = animation.props;
+
+	propFilter( props, animation.opts.specialEasing );
+
+	for ( ; index < length; index++ ) {
+		result = Animation.prefilters[ index ].call( animation, elem, props, animation.opts );
+		if ( result ) {
+			if ( isFunction( result.stop ) ) {
+				jQuery._queueHooks( animation.elem, animation.opts.queue ).stop =
+					result.stop.bind( result );
+			}
+			return result;
+		}
+	}
+
+	jQuery.map( props, createTween, animation );
+
+	if ( isFunction( animation.opts.start ) ) {
+		animation.opts.start.call( elem, animation );
+	}
+
+	// Attach callbacks from options
+	animation
+		.progress( animation.opts.progress )
+		.done( animation.opts.done, animation.opts.complete )
+		.fail( animation.opts.fail )
+		.always( animation.opts.always );
+
+	jQuery.fx.timer(
+		jQuery.extend( tick, {
+			elem: elem,
+			anim: animation,
+			queue: animation.opts.queue
+		} )
+	);
+
+	return animation;
+}
+
+jQuery.Animation = jQuery.extend( Animation, {
+
+	tweeners: {
+		"*": [ function( prop, value ) {
+			var tween = this.createTween( prop, value );
+			adjustCSS( tween.elem, prop, rcssNum.exec( value ), tween );
+			return tween;
+		} ]
+	},
+
+	tweener: function( props, callback ) {
+		if ( isFunction( props ) ) {
+			callback = props;
+			props = [ "*" ];
+		} else {
+			props = props.match( rnothtmlwhite );
+		}
+
+		var prop,
+			index = 0,
+			length = props.length;
+
+		for ( ; index < length; index++ ) {
+			prop = props[ index ];
+			Animation.tweeners[ prop ] = Animation.tweeners[ prop ] || [];
+			Animation.tweeners[ prop ].unshift( callback );
+		}
+	},
+
+	prefilters: [ defaultPrefilter ],
+
+	prefilter: function( callback, prepend ) {
+		if ( prepend ) {
+			Animation.prefilters.unshift( callback );
+		} else {
+			Animation.prefilters.push( callback );
+		}
+	}
+} );
+
+jQuery.speed = function( speed, easing, fn ) {
+	var opt = speed && typeof speed === "object" ? jQuery.extend( {}, speed ) : {
+		complete: fn || !fn && easing ||
+			isFunction( speed ) && speed,
+		duration: speed,
+		easing: fn && easing || easing && !isFunction( easing ) && easing
+	};
+
+	// Go to the end state if fx are off
+	if ( jQuery.fx.off ) {
+		opt.duration = 0;
+
+	} else {
+		if ( typeof opt.duration !== "number" ) {
+			if ( opt.duration in jQuery.fx.speeds ) {
+				opt.duration = jQuery.fx.speeds[ opt.duration ];
+
+			} else {
+				opt.duration = jQuery.fx.speeds._default;
+			}
+		}
+	}
+
+	// Normalize opt.queue - true/undefined/null -> "fx"
+	if ( opt.queue == null || opt.queue === true ) {
+		opt.queue = "fx";
+	}
+
+	// Queueing
+	opt.old = opt.complete;
+
+	opt.complete = function() {
+		if ( isFunction( opt.old ) ) {
+			opt.old.call( this );
+		}
+
+		if ( opt.queue ) {
+			jQuery.dequeue( this, opt.queue );
+		}
+	};
+
+	return opt;
+};
+
+jQuery.fn.extend( {
+	fadeTo: function( speed, to, easing, callback ) {
+
+		// Show any hidden elements after setting opacity to 0
+		return this.filter( isHiddenWithinTree ).css( "opacity", 0 ).show()
+
+			// Animate to the value specified
+			.end().animate( { opacity: to }, speed, easing, callback );
+	},
+	animate: function( prop, speed, easing, callback ) {
+		var empty = jQuery.isEmptyObject( prop ),
+			optall = jQuery.speed( speed, easing, callback ),
+			doAnimation = function() {
+
+				// Operate on a copy of prop so per-property easing won't be lost
+				var anim = Animation( this, jQuery.extend( {}, prop ), optall );
+
+				// Empty animations, or finishing resolves immediately
+				if ( empty || dataPriv.get( this, "finish" ) ) {
+					anim.stop( true );
+				}
+			};
+
+		doAnimation.finish = doAnimation;
+
+		return empty || optall.queue === false ?
+			this.each( doAnimation ) :
+			this.queue( optall.queue, doAnimation );
+	},
+	stop: function( type, clearQueue, gotoEnd ) {
+		var stopQueue = function( hooks ) {
+			var stop = hooks.stop;
+			delete hooks.stop;
+			stop( gotoEnd );
+		};
+
+		if ( typeof type !== "string" ) {
+			gotoEnd = clearQueue;
+			clearQueue = type;
+			type = undefined;
+		}
+		if ( clearQueue ) {
+			this.queue( type || "fx", [] );
+		}
+
+		return this.each( function() {
+			var dequeue = true,
+				index = type != null && type + "queueHooks",
+				timers = jQuery.timers,
+				data = dataPriv.get( this );
+
+			if ( index ) {
+				if ( data[ index ] && data[ index ].stop ) {
+					stopQueue( data[ index ] );
+				}
+			} else {
+				for ( index in data ) {
+					if ( data[ index ] && data[ index ].stop && rrun.test( index ) ) {
+						stopQueue( data[ index ] );
+					}
+				}
+			}
+
+			for ( index = timers.length; index--; ) {
+				if ( timers[ index ].elem === this &&
+					( type == null || timers[ index ].queue === type ) ) {
+
+					timers[ index ].anim.stop( gotoEnd );
+					dequeue = false;
+					timers.splice( index, 1 );
+				}
+			}
+
+			// Start the next in the queue if the last step wasn't forced.
+			// Timers currently will call their complete callbacks, which
+			// will dequeue but only if they were gotoEnd.
+			if ( dequeue || !gotoEnd ) {
+				jQuery.dequeue( this, type );
+			}
+		} );
+	},
+	finish: function( type ) {
+		if ( type !== false ) {
+			type = type || "fx";
+		}
+		return this.each( function() {
+			var index,
+				data = dataPriv.get( this ),
+				queue = data[ type + "queue" ],
+				hooks = data[ type + "queueHooks" ],
+				timers = jQuery.timers,
+				length = queue ? queue.length : 0;
+
+			// Enable finishing flag on private data
+			data.finish = true;
+
+			// Empty the queue first
+			jQuery.queue( this, type, [] );
+
+			if ( hooks && hooks.stop ) {
+				hooks.stop.call( this, true );
+			}
+
+			// Look for any active animations, and finish them
+			for ( index = timers.length; index--; ) {
+				if ( timers[ index ].elem === this && timers[ index ].queue === type ) {
+					timers[ index ].anim.stop( true );
+					timers.splice( index, 1 );
+				}
+			}
+
+			// Look for any animations in the old queue and finish them
+			for ( index = 0; index < length; index++ ) {
+				if ( queue[ index ] && queue[ index ].finish ) {
+					queue[ index ].finish.call( this );
+				}
+			}
+
+			// Turn off finishing flag
+			delete data.finish;
+		} );
+	}
+} );
+
+jQuery.each( [ "toggle", "show", "hide" ], function( _i, name ) {
+	var cssFn = jQuery.fn[ name ];
+	jQuery.fn[ name ] = function( speed, easing, callback ) {
+		return speed == null || typeof speed === "boolean" ?
+			cssFn.apply( this, arguments ) :
+			this.animate( genFx( name, true ), speed, easing, callback );
+	};
+} );
+
+// Generate shortcuts for custom animations
+jQuery.each( {
+	slideDown: genFx( "show" ),
+	slideUp: genFx( "hide" ),
+	slideToggle: genFx( "toggle" ),
+	fadeIn: { opacity: "show" },
+	fadeOut: { opacity: "hide" },
+	fadeToggle: { opacity: "toggle" }
+}, function( name, props ) {
+	jQuery.fn[ name ] = function( speed, easing, callback ) {
+		return this.animate( props, speed, easing, callback );
+	};
+} );
+
+jQuery.timers = [];
+jQuery.fx.tick = function() {
+	var timer,
+		i = 0,
+		timers = jQuery.timers;
+
+	fxNow = Date.now();
+
+	for ( ; i < timers.length; i++ ) {
+		timer = timers[ i ];
+
+		// Run the timer and safely remove it when done (allowing for external removal)
+		if ( !timer() && timers[ i ] === timer ) {
+			timers.splice( i--, 1 );
+		}
+	}
+
+	if ( !timers.length ) {
+		jQuery.fx.stop();
+	}
+	fxNow = undefined;
+};
+
+jQuery.fx.timer = function( timer ) {
+	jQuery.timers.push( timer );
+	jQuery.fx.start();
+};
+
+jQuery.fx.interval = 13;
+jQuery.fx.start = function() {
+	if ( inProgress ) {
+		return;
+	}
+
+	inProgress = true;
+	schedule();
+};
+
+jQuery.fx.stop = function() {
+	inProgress = null;
+};
+
+jQuery.fx.speeds = {
+	slow: 600,
+	fast: 200,
+
+	// Default speed
+	_default: 400
+};
+
+
+// Based off of the plugin by Clint Helfers, with permission.
+// https://web.archive.org/web/20100324014747/http://blindsignals.com/index.php/2009/07/jquery-delay/
+jQuery.fn.delay = function( time, type ) {
+	time = jQuery.fx ? jQuery.fx.speeds[ time ] || time : time;
+	type = type || "fx";
+
+	return this.queue( type, function( next, hooks ) {
+		var timeout = window.setTimeout( next, time );
+		hooks.stop = function() {
+			window.clearTimeout( timeout );
+		};
+	} );
+};
+
+
+( function() {
+	var input = document.createElement( "input" ),
+		select = document.createElement( "select" ),
+		opt = select.appendChild( document.createElement( "option" ) );
+
+	input.type = "checkbox";
+
+	// Support: Android <=4.3 only
+	// Default value for a checkbox should be "on"
+	support.checkOn = input.value !== "";
+
+	// Support: IE <=11 only
+	// Must access selectedIndex to make default options select
+	support.optSelected = opt.selected;
+
+	// Support: IE <=11 only
+	// An input loses its value after becoming a radio
+	input = document.createElement( "input" );
+	input.value = "t";
+	input.type = "radio";
+	support.radioValue = input.value === "t";
+} )();
+
+
+var boolHook,
+	attrHandle = jQuery.expr.attrHandle;
+
+jQuery.fn.extend( {
+	attr: function( name, value ) {
+		return access( this, jQuery.attr, name, value, arguments.length > 1 );
+	},
+
+	removeAttr: function( name ) {
+		return this.each( function() {
+			jQuery.removeAttr( this, name );
+		} );
+	}
+} );
+
+jQuery.extend( {
+	attr: function( elem, name, value ) {
+		var ret, hooks,
+			nType = elem.nodeType;
+
+		// Don't get/set attributes on text, comment and attribute nodes
+		if ( nType === 3 || nType === 8 || nType === 2 ) {
+			return;
+		}
+
+		// Fallback to prop when attributes are not supported
+		if ( typeof elem.getAttribute === "undefined" ) {
+			return jQuery.prop( elem, name, value );
+		}
+
+		// Attribute hooks are determined by the lowercase version
+		// Grab necessary hook if one is defined
+		if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) {
+			hooks = jQuery.attrHooks[ name.toLowerCase() ] ||
+				( jQuery.expr.match.bool.test( name ) ? boolHook : undefined );
+		}
+
+		if ( value !== undefined ) {
+			if ( value === null ) {
+				jQuery.removeAttr( elem, name );
+				return;
+			}
+
+			if ( hooks && "set" in hooks &&
+				( ret = hooks.set( elem, value, name ) ) !== undefined ) {
+				return ret;
+			}
+
+			elem.setAttribute( name, value + "" );
+			return value;
+		}
+
+		if ( hooks && "get" in hooks && ( ret = hooks.get( elem, name ) ) !== null ) {
+			return ret;
+		}
+
+		ret = jQuery.find.attr( elem, name );
+
+		// Non-existent attributes return null, we normalize to undefined
+		return ret == null ? undefined : ret;
+	},
+
+	attrHooks: {
+		type: {
+			set: function( elem, value ) {
+				if ( !support.radioValue && value === "radio" &&
+					nodeName( elem, "input" ) ) {
+					var val = elem.value;
+					elem.setAttribute( "type", value );
+					if ( val ) {
+						elem.value = val;
+					}
+					return value;
+				}
+			}
+		}
+	},
+
+	removeAttr: function( elem, value ) {
+		var name,
+			i = 0,
+
+			// Attribute names can contain non-HTML whitespace characters
+			// https://html.spec.whatwg.org/multipage/syntax.html#attributes-2
+			attrNames = value && value.match( rnothtmlwhite );
+
+		if ( attrNames && elem.nodeType === 1 ) {
+			while ( ( name = attrNames[ i++ ] ) ) {
+				elem.removeAttribute( name );
+			}
+		}
+	}
+} );
+
+// Hooks for boolean attributes
+boolHook = {
+	set: function( elem, value, name ) {
+		if ( value === false ) {
+
+			// Remove boolean attributes when set to false
+			jQuery.removeAttr( elem, name );
+		} else {
+			elem.setAttribute( name, name );
+		}
+		return name;
+	}
+};
+
+jQuery.each( jQuery.expr.match.bool.source.match( /\w+/g ), function( _i, name ) {
+	var getter = attrHandle[ name ] || jQuery.find.attr;
+
+	attrHandle[ name ] = function( elem, name, isXML ) {
+		var ret, handle,
+			lowercaseName = name.toLowerCase();
+
+		if ( !isXML ) {
+
+			// Avoid an infinite loop by temporarily removing this function from the getter
+			handle = attrHandle[ lowercaseName ];
+			attrHandle[ lowercaseName ] = ret;
+			ret = getter( elem, name, isXML ) != null ?
+				lowercaseName :
+				null;
+			attrHandle[ lowercaseName ] = handle;
+		}
+		return ret;
+	};
+} );
+
+
+
+
+var rfocusable = /^(?:input|select|textarea|button)$/i,
+	rclickable = /^(?:a|area)$/i;
+
+jQuery.fn.extend( {
+	prop: function( name, value ) {
+		return access( this, jQuery.prop, name, value, arguments.length > 1 );
+	},
+
+	removeProp: function( name ) {
+		return this.each( function() {
+			delete this[ jQuery.propFix[ name ] || name ];
+		} );
+	}
+} );
+
+jQuery.extend( {
+	prop: function( elem, name, value ) {
+		var ret, hooks,
+			nType = elem.nodeType;
+
+		// Don't get/set properties on text, comment and attribute nodes
+		if ( nType === 3 || nType === 8 || nType === 2 ) {
+			return;
+		}
+
+		if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) {
+
+			// Fix name and attach hooks
+			name = jQuery.propFix[ name ] || name;
+			hooks = jQuery.propHooks[ name ];
+		}
+
+		if ( value !== undefined ) {
+			if ( hooks && "set" in hooks &&
+				( ret = hooks.set( elem, value, name ) ) !== undefined ) {
+				return ret;
+			}
+
+			return ( elem[ name ] = value );
+		}
+
+		if ( hooks && "get" in hooks && ( ret = hooks.get( elem, name ) ) !== null ) {
+			return ret;
+		}
+
+		return elem[ name ];
+	},
+
+	propHooks: {
+		tabIndex: {
+			get: function( elem ) {
+
+				// Support: IE <=9 - 11 only
+				// elem.tabIndex doesn't always return the
+				// correct value when it hasn't been explicitly set
+				// https://web.archive.org/web/20141116233347/http://fluidproject.org/blog/2008/01/09/getting-setting-and-removing-tabindex-values-with-javascript/
+				// Use proper attribute retrieval(#12072)
+				var tabindex = jQuery.find.attr( elem, "tabindex" );
+
+				if ( tabindex ) {
+					return parseInt( tabindex, 10 );
+				}
+
+				if (
+					rfocusable.test( elem.nodeName ) ||
+					rclickable.test( elem.nodeName ) &&
+					elem.href
+				) {
+					return 0;
+				}
+
+				return -1;
+			}
+		}
+	},
+
+	propFix: {
+		"for": "htmlFor",
+		"class": "className"
+	}
+} );
+
+// Support: IE <=11 only
+// Accessing the selectedIndex property
+// forces the browser to respect setting selected
+// on the option
+// The getter ensures a default option is selected
+// when in an optgroup
+// eslint rule "no-unused-expressions" is disabled for this code
+// since it considers such accessions noop
+if ( !support.optSelected ) {
+	jQuery.propHooks.selected = {
+		get: function( elem ) {
+
+			/* eslint no-unused-expressions: "off" */
+
+			var parent = elem.parentNode;
+			if ( parent && parent.parentNode ) {
+				parent.parentNode.selectedIndex;
+			}
+			return null;
+		},
+		set: function( elem ) {
+
+			/* eslint no-unused-expressions: "off" */
+
+			var parent = elem.parentNode;
+			if ( parent ) {
+				parent.selectedIndex;
+
+				if ( parent.parentNode ) {
+					parent.parentNode.selectedIndex;
+				}
+			}
+		}
+	};
+}
+
+jQuery.each( [
+	"tabIndex",
+	"readOnly",
+	"maxLength",
+	"cellSpacing",
+	"cellPadding",
+	"rowSpan",
+	"colSpan",
+	"useMap",
+	"frameBorder",
+	"contentEditable"
+], function() {
+	jQuery.propFix[ this.toLowerCase() ] = this;
+} );
+
+
+
+
+	// Strip and collapse whitespace according to HTML spec
+	// https://infra.spec.whatwg.org/#strip-and-collapse-ascii-whitespace
+	function stripAndCollapse( value ) {
+		var tokens = value.match( rnothtmlwhite ) || [];
+		return tokens.join( " " );
+	}
+
+
+function getClass( elem ) {
+	return elem.getAttribute && elem.getAttribute( "class" ) || "";
+}
+
+function classesToArray( value ) {
+	if ( Array.isArray( value ) ) {
+		return value;
+	}
+	if ( typeof value === "string" ) {
+		return value.match( rnothtmlwhite ) || [];
+	}
+	return [];
+}
+
+jQuery.fn.extend( {
+	addClass: function( value ) {
+		var classes, elem, cur, curValue, clazz, j, finalValue,
+			i = 0;
+
+		if ( isFunction( value ) ) {
+			return this.each( function( j ) {
+				jQuery( this ).addClass( value.call( this, j, getClass( this ) ) );
+			} );
+		}
+
+		classes = classesToArray( value );
+
+		if ( classes.length ) {
+			while ( ( elem = this[ i++ ] ) ) {
+				curValue = getClass( elem );
+				cur = elem.nodeType === 1 && ( " " + stripAndCollapse( curValue ) + " " );
+
+				if ( cur ) {
+					j = 0;
+					while ( ( clazz = classes[ j++ ] ) ) {
+						if ( cur.indexOf( " " + clazz + " " ) < 0 ) {
+							cur += clazz + " ";
+						}
+					}
+
+					// Only assign if different to avoid unneeded rendering.
+					finalValue = stripAndCollapse( cur );
+					if ( curValue !== finalValue ) {
+						elem.setAttribute( "class", finalValue );
+					}
+				}
+			}
+		}
+
+		return this;
+	},
+
+	removeClass: function( value ) {
+		var classes, elem, cur, curValue, clazz, j, finalValue,
+			i = 0;
+
+		if ( isFunction( value ) ) {
+			return this.each( function( j ) {
+				jQuery( this ).removeClass( value.call( this, j, getClass( this ) ) );
+			} );
+		}
+
+		if ( !arguments.length ) {
+			return this.attr( "class", "" );
+		}
+
+		classes = classesToArray( value );
+
+		if ( classes.length ) {
+			while ( ( elem = this[ i++ ] ) ) {
+				curValue = getClass( elem );
+
+				// This expression is here for better compressibility (see addClass)
+				cur = elem.nodeType === 1 && ( " " + stripAndCollapse( curValue ) + " " );
+
+				if ( cur ) {
+					j = 0;
+					while ( ( clazz = classes[ j++ ] ) ) {
+
+						// Remove *all* instances
+						while ( cur.indexOf( " " + clazz + " " ) > -1 ) {
+							cur = cur.replace( " " + clazz + " ", " " );
+						}
+					}
+
+					// Only assign if different to avoid unneeded rendering.
+					finalValue = stripAndCollapse( cur );
+					if ( curValue !== finalValue ) {
+						elem.setAttribute( "class", finalValue );
+					}
+				}
+			}
+		}
+
+		return this;
+	},
+
+	toggleClass: function( value, stateVal ) {
+		var type = typeof value,
+			isValidValue = type === "string" || Array.isArray( value );
+
+		if ( typeof stateVal === "boolean" && isValidValue ) {
+			return stateVal ? this.addClass( value ) : this.removeClass( value );
+		}
+
+		if ( isFunction( value ) ) {
+			return this.each( function( i ) {
+				jQuery( this ).toggleClass(
+					value.call( this, i, getClass( this ), stateVal ),
+					stateVal
+				);
+			} );
+		}
+
+		return this.each( function() {
+			var className, i, self, classNames;
+
+			if ( isValidValue ) {
+
+				// Toggle individual class names
+				i = 0;
+				self = jQuery( this );
+				classNames = classesToArray( value );
+
+				while ( ( className = classNames[ i++ ] ) ) {
+
+					// Check each className given, space separated list
+					if ( self.hasClass( className ) ) {
+						self.removeClass( className );
+					} else {
+						self.addClass( className );
+					}
+				}
+
+			// Toggle whole class name
+			} else if ( value === undefined || type === "boolean" ) {
+				className = getClass( this );
+				if ( className ) {
+
+					// Store className if set
+					dataPriv.set( this, "__className__", className );
+				}
+
+				// If the element has a class name or if we're passed `false`,
+				// then remove the whole classname (if there was one, the above saved it).
+				// Otherwise bring back whatever was previously saved (if anything),
+				// falling back to the empty string if nothing was stored.
+				if ( this.setAttribute ) {
+					this.setAttribute( "class",
+						className || value === false ?
+							"" :
+							dataPriv.get( this, "__className__" ) || ""
+					);
+				}
+			}
+		} );
+	},
+
+	hasClass: function( selector ) {
+		var className, elem,
+			i = 0;
+
+		className = " " + selector + " ";
+		while ( ( elem = this[ i++ ] ) ) {
+			if ( elem.nodeType === 1 &&
+				( " " + stripAndCollapse( getClass( elem ) ) + " " ).indexOf( className ) > -1 ) {
+				return true;
+			}
+		}
+
+		return false;
+	}
+} );
+
+
+
+
+var rreturn = /\r/g;
+
+jQuery.fn.extend( {
+	val: function( value ) {
+		var hooks, ret, valueIsFunction,
+			elem = this[ 0 ];
+
+		if ( !arguments.length ) {
+			if ( elem ) {
+				hooks = jQuery.valHooks[ elem.type ] ||
+					jQuery.valHooks[ elem.nodeName.toLowerCase() ];
+
+				if ( hooks &&
+					"get" in hooks &&
+					( ret = hooks.get( elem, "value" ) ) !== undefined
+				) {
+					return ret;
+				}
+
+				ret = elem.value;
+
+				// Handle most common string cases
+				if ( typeof ret === "string" ) {
+					return ret.replace( rreturn, "" );
+				}
+
+				// Handle cases where value is null/undef or number
+				return ret == null ? "" : ret;
+			}
+
+			return;
+		}
+
+		valueIsFunction = isFunction( value );
+
+		return this.each( function( i ) {
+			var val;
+
+			if ( this.nodeType !== 1 ) {
+				return;
+			}
+
+			if ( valueIsFunction ) {
+				val = value.call( this, i, jQuery( this ).val() );
+			} else {
+				val = value;
+			}
+
+			// Treat null/undefined as ""; convert numbers to string
+			if ( val == null ) {
+				val = "";
+
+			} else if ( typeof val === "number" ) {
+				val += "";
+
+			} else if ( Array.isArray( val ) ) {
+				val = jQuery.map( val, function( value ) {
+					return value == null ? "" : value + "";
+				} );
+			}
+
+			hooks = jQuery.valHooks[ this.type ] || jQuery.valHooks[ this.nodeName.toLowerCase() ];
+
+			// If set returns undefined, fall back to normal setting
+			if ( !hooks || !( "set" in hooks ) || hooks.set( this, val, "value" ) === undefined ) {
+				this.value = val;
+			}
+		} );
+	}
+} );
+
+jQuery.extend( {
+	valHooks: {
+		option: {
+			get: function( elem ) {
+
+				var val = jQuery.find.attr( elem, "value" );
+				return val != null ?
+					val :
+
+					// Support: IE <=10 - 11 only
+					// option.text throws exceptions (#14686, #14858)
+					// Strip and collapse whitespace
+					// https://html.spec.whatwg.org/#strip-and-collapse-whitespace
+					stripAndCollapse( jQuery.text( elem ) );
+			}
+		},
+		select: {
+			get: function( elem ) {
+				var value, option, i,
+					options = elem.options,
+					index = elem.selectedIndex,
+					one = elem.type === "select-one",
+					values = one ? null : [],
+					max = one ? index + 1 : options.length;
+
+				if ( index < 0 ) {
+					i = max;
+
+				} else {
+					i = one ? index : 0;
+				}
+
+				// Loop through all the selected options
+				for ( ; i < max; i++ ) {
+					option = options[ i ];
+
+					// Support: IE <=9 only
+					// IE8-9 doesn't update selected after form reset (#2551)
+					if ( ( option.selected || i === index ) &&
+
+							// Don't return options that are disabled or in a disabled optgroup
+							!option.disabled &&
+							( !option.parentNode.disabled ||
+								!nodeName( option.parentNode, "optgroup" ) ) ) {
+
+						// Get the specific value for the option
+						value = jQuery( option ).val();
+
+						// We don't need an array for one selects
+						if ( one ) {
+							return value;
+						}
+
+						// Multi-Selects return an array
+						values.push( value );
+					}
+				}
+
+				return values;
+			},
+
+			set: function( elem, value ) {
+				var optionSet, option,
+					options = elem.options,
+					values = jQuery.makeArray( value ),
+					i = options.length;
+
+				while ( i-- ) {
+					option = options[ i ];
+
+					/* eslint-disable no-cond-assign */
+
+					if ( option.selected =
+						jQuery.inArray( jQuery.valHooks.option.get( option ), values ) > -1
+					) {
+						optionSet = true;
+					}
+
+					/* eslint-enable no-cond-assign */
+				}
+
+				// Force browsers to behave consistently when non-matching value is set
+				if ( !optionSet ) {
+					elem.selectedIndex = -1;
+				}
+				return values;
+			}
+		}
+	}
+} );
+
+// Radios and checkboxes getter/setter
+jQuery.each( [ "radio", "checkbox" ], function() {
+	jQuery.valHooks[ this ] = {
+		set: function( elem, value ) {
+			if ( Array.isArray( value ) ) {
+				return ( elem.checked = jQuery.inArray( jQuery( elem ).val(), value ) > -1 );
+			}
+		}
+	};
+	if ( !support.checkOn ) {
+		jQuery.valHooks[ this ].get = function( elem ) {
+			return elem.getAttribute( "value" ) === null ? "on" : elem.value;
+		};
+	}
+} );
+
+
+
+
+// Return jQuery for attributes-only inclusion
+
+
+support.focusin = "onfocusin" in window;
+
+
+var rfocusMorph = /^(?:focusinfocus|focusoutblur)$/,
+	stopPropagationCallback = function( e ) {
+		e.stopPropagation();
+	};
+
+jQuery.extend( jQuery.event, {
+
+	trigger: function( event, data, elem, onlyHandlers ) {
+
+		var i, cur, tmp, bubbleType, ontype, handle, special, lastElement,
+			eventPath = [ elem || document ],
+			type = hasOwn.call( event, "type" ) ? event.type : event,
+			namespaces = hasOwn.call( event, "namespace" ) ? event.namespace.split( "." ) : [];
+
+		cur = lastElement = tmp = elem = elem || document;
+
+		// Don't do events on text and comment nodes
+		if ( elem.nodeType === 3 || elem.nodeType === 8 ) {
+			return;
+		}
+
+		// focus/blur morphs to focusin/out; ensure we're not firing them right now
+		if ( rfocusMorph.test( type + jQuery.event.triggered ) ) {
+			return;
+		}
+
+		if ( type.indexOf( "." ) > -1 ) {
+
+			// Namespaced trigger; create a regexp to match event type in handle()
+			namespaces = type.split( "." );
+			type = namespaces.shift();
+			namespaces.sort();
+		}
+		ontype = type.indexOf( ":" ) < 0 && "on" + type;
+
+		// Caller can pass in a jQuery.Event object, Object, or just an event type string
+		event = event[ jQuery.expando ] ?
+			event :
+			new jQuery.Event( type, typeof event === "object" && event );
+
+		// Trigger bitmask: & 1 for native handlers; & 2 for jQuery (always true)
+		event.isTrigger = onlyHandlers ? 2 : 3;
+		event.namespace = namespaces.join( "." );
+		event.rnamespace = event.namespace ?
+			new RegExp( "(^|\\.)" + namespaces.join( "\\.(?:.*\\.|)" ) + "(\\.|$)" ) :
+			null;
+
+		// Clean up the event in case it is being reused
+		event.result = undefined;
+		if ( !event.target ) {
+			event.target = elem;
+		}
+
+		// Clone any incoming data and prepend the event, creating the handler arg list
+		data = data == null ?
+			[ event ] :
+			jQuery.makeArray( data, [ event ] );
+
+		// Allow special events to draw outside the lines
+		special = jQuery.event.special[ type ] || {};
+		if ( !onlyHandlers && special.trigger && special.trigger.apply( elem, data ) === false ) {
+			return;
+		}
+
+		// Determine event propagation path in advance, per W3C events spec (#9951)
+		// Bubble up to document, then to window; watch for a global ownerDocument var (#9724)
+		if ( !onlyHandlers && !special.noBubble && !isWindow( elem ) ) {
+
+			bubbleType = special.delegateType || type;
+			if ( !rfocusMorph.test( bubbleType + type ) ) {
+				cur = cur.parentNode;
+			}
+			for ( ; cur; cur = cur.parentNode ) {
+				eventPath.push( cur );
+				tmp = cur;
+			}
+
+			// Only add window if we got to document (e.g., not plain obj or detached DOM)
+			if ( tmp === ( elem.ownerDocument || document ) ) {
+				eventPath.push( tmp.defaultView || tmp.parentWindow || window );
+			}
+		}
+
+		// Fire handlers on the event path
+		i = 0;
+		while ( ( cur = eventPath[ i++ ] ) && !event.isPropagationStopped() ) {
+			lastElement = cur;
+			event.type = i > 1 ?
+				bubbleType :
+				special.bindType || type;
+
+			// jQuery handler
+			handle = ( dataPriv.get( cur, "events" ) || Object.create( null ) )[ event.type ] &&
+				dataPriv.get( cur, "handle" );
+			if ( handle ) {
+				handle.apply( cur, data );
+			}
+
+			// Native handler
+			handle = ontype && cur[ ontype ];
+			if ( handle && handle.apply && acceptData( cur ) ) {
+				event.result = handle.apply( cur, data );
+				if ( event.result === false ) {
+					event.preventDefault();
+				}
+			}
+		}
+		event.type = type;
+
+		// If nobody prevented the default action, do it now
+		if ( !onlyHandlers && !event.isDefaultPrevented() ) {
+
+			if ( ( !special._default ||
+				special._default.apply( eventPath.pop(), data ) === false ) &&
+				acceptData( elem ) ) {
+
+				// Call a native DOM method on the target with the same name as the event.
+				// Don't do default actions on window, that's where global variables be (#6170)
+				if ( ontype && isFunction( elem[ type ] ) && !isWindow( elem ) ) {
+
+					// Don't re-trigger an onFOO event when we call its FOO() method
+					tmp = elem[ ontype ];
+
+					if ( tmp ) {
+						elem[ ontype ] = null;
+					}
+
+					// Prevent re-triggering of the same event, since we already bubbled it above
+					jQuery.event.triggered = type;
+
+					if ( event.isPropagationStopped() ) {
+						lastElement.addEventListener( type, stopPropagationCallback );
+					}
+
+					elem[ type ]();
+
+					if ( event.isPropagationStopped() ) {
+						lastElement.removeEventListener( type, stopPropagationCallback );
+					}
+
+					jQuery.event.triggered = undefined;
+
+					if ( tmp ) {
+						elem[ ontype ] = tmp;
+					}
+				}
+			}
+		}
+
+		return event.result;
+	},
+
+	// Piggyback on a donor event to simulate a different one
+	// Used only for `focus(in | out)` events
+	simulate: function( type, elem, event ) {
+		var e = jQuery.extend(
+			new jQuery.Event(),
+			event,
+			{
+				type: type,
+				isSimulated: true
+			}
+		);
+
+		jQuery.event.trigger( e, null, elem );
+	}
+
+} );
+
+jQuery.fn.extend( {
+
+	trigger: function( type, data ) {
+		return this.each( function() {
+			jQuery.event.trigger( type, data, this );
+		} );
+	},
+	triggerHandler: function( type, data ) {
+		var elem = this[ 0 ];
+		if ( elem ) {
+			return jQuery.event.trigger( type, data, elem, true );
+		}
+	}
+} );
+
+
+// Support: Firefox <=44
+// Firefox doesn't have focus(in | out) events
+// Related ticket - https://bugzilla.mozilla.org/show_bug.cgi?id=687787
+//
+// Support: Chrome <=48 - 49, Safari <=9.0 - 9.1
+// focus(in | out) events fire after focus & blur events,
+// which is spec violation - http://www.w3.org/TR/DOM-Level-3-Events/#events-focusevent-event-order
+// Related ticket - https://bugs.chromium.org/p/chromium/issues/detail?id=449857
+if ( !support.focusin ) {
+	jQuery.each( { focus: "focusin", blur: "focusout" }, function( orig, fix ) {
+
+		// Attach a single capturing handler on the document while someone wants focusin/focusout
+		var handler = function( event ) {
+			jQuery.event.simulate( fix, event.target, jQuery.event.fix( event ) );
+		};
+
+		jQuery.event.special[ fix ] = {
+			setup: function() {
+
+				// Handle: regular nodes (via `this.ownerDocument`), window
+				// (via `this.document`) & document (via `this`).
+				var doc = this.ownerDocument || this.document || this,
+					attaches = dataPriv.access( doc, fix );
+
+				if ( !attaches ) {
+					doc.addEventListener( orig, handler, true );
+				}
+				dataPriv.access( doc, fix, ( attaches || 0 ) + 1 );
+			},
+			teardown: function() {
+				var doc = this.ownerDocument || this.document || this,
+					attaches = dataPriv.access( doc, fix ) - 1;
+
+				if ( !attaches ) {
+					doc.removeEventListener( orig, handler, true );
+					dataPriv.remove( doc, fix );
+
+				} else {
+					dataPriv.access( doc, fix, attaches );
+				}
+			}
+		};
+	} );
+}
+var location = window.location;
+
+var nonce = { guid: Date.now() };
+
+var rquery = ( /\?/ );
+
+
+
+// Cross-browser xml parsing
+jQuery.parseXML = function( data ) {
+	var xml, parserErrorElem;
+	if ( !data || typeof data !== "string" ) {
+		return null;
+	}
+
+	// Support: IE 9 - 11 only
+	// IE throws on parseFromString with invalid input.
+	try {
+		xml = ( new window.DOMParser() ).parseFromString( data, "text/xml" );
+	} catch ( e ) {}
+
+	parserErrorElem = xml && xml.getElementsByTagName( "parsererror" )[ 0 ];
+	if ( !xml || parserErrorElem ) {
+		jQuery.error( "Invalid XML: " + (
+			parserErrorElem ?
+				jQuery.map( parserErrorElem.childNodes, function( el ) {
+					return el.textContent;
+				} ).join( "\n" ) :
+				data
+		) );
+	}
+	return xml;
+};
+
+
+var
+	rbracket = /\[\]$/,
+	rCRLF = /\r?\n/g,
+	rsubmitterTypes = /^(?:submit|button|image|reset|file)$/i,
+	rsubmittable = /^(?:input|select|textarea|keygen)/i;
+
+function buildParams( prefix, obj, traditional, add ) {
+	var name;
+
+	if ( Array.isArray( obj ) ) {
+
+		// Serialize array item.
+		jQuery.each( obj, function( i, v ) {
+			if ( traditional || rbracket.test( prefix ) ) {
+
+				// Treat each array item as a scalar.
+				add( prefix, v );
+
+			} else {
+
+				// Item is non-scalar (array or object), encode its numeric index.
+				buildParams(
+					prefix + "[" + ( typeof v === "object" && v != null ? i : "" ) + "]",
+					v,
+					traditional,
+					add
+				);
+			}
+		} );
+
+	} else if ( !traditional && toType( obj ) === "object" ) {
+
+		// Serialize object item.
+		for ( name in obj ) {
+			buildParams( prefix + "[" + name + "]", obj[ name ], traditional, add );
+		}
+
+	} else {
+
+		// Serialize scalar item.
+		add( prefix, obj );
+	}
+}
+
+// Serialize an array of form elements or a set of
+// key/values into a query string
+jQuery.param = function( a, traditional ) {
+	var prefix,
+		s = [],
+		add = function( key, valueOrFunction ) {
+
+			// If value is a function, invoke it and use its return value
+			var value = isFunction( valueOrFunction ) ?
+				valueOrFunction() :
+				valueOrFunction;
+
+			s[ s.length ] = encodeURIComponent( key ) + "=" +
+				encodeURIComponent( value == null ? "" : value );
+		};
+
+	if ( a == null ) {
+		return "";
+	}
+
+	// If an array was passed in, assume that it is an array of form elements.
+	if ( Array.isArray( a ) || ( a.jquery && !jQuery.isPlainObject( a ) ) ) {
+
+		// Serialize the form elements
+		jQuery.each( a, function() {
+			add( this.name, this.value );
+		} );
+
+	} else {
+
+		// If traditional, encode the "old" way (the way 1.3.2 or older
+		// did it), otherwise encode params recursively.
+		for ( prefix in a ) {
+			buildParams( prefix, a[ prefix ], traditional, add );
+		}
+	}
+
+	// Return the resulting serialization
+	return s.join( "&" );
+};
+
+jQuery.fn.extend( {
+	serialize: function() {
+		return jQuery.param( this.serializeArray() );
+	},
+	serializeArray: function() {
+		return this.map( function() {
+
+			// Can add propHook for "elements" to filter or add form elements
+			var elements = jQuery.prop( this, "elements" );
+			return elements ? jQuery.makeArray( elements ) : this;
+		} ).filter( function() {
+			var type = this.type;
+
+			// Use .is( ":disabled" ) so that fieldset[disabled] works
+			return this.name && !jQuery( this ).is( ":disabled" ) &&
+				rsubmittable.test( this.nodeName ) && !rsubmitterTypes.test( type ) &&
+				( this.checked || !rcheckableType.test( type ) );
+		} ).map( function( _i, elem ) {
+			var val = jQuery( this ).val();
+
+			if ( val == null ) {
+				return null;
+			}
+
+			if ( Array.isArray( val ) ) {
+				return jQuery.map( val, function( val ) {
+					return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) };
+				} );
+			}
+
+			return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) };
+		} ).get();
+	}
+} );
+
+
+var
+	r20 = /%20/g,
+	rhash = /#.*$/,
+	rantiCache = /([?&])_=[^&]*/,
+	rheaders = /^(.*?):[ \t]*([^\r\n]*)$/mg,
+
+	// #7653, #8125, #8152: local protocol detection
+	rlocalProtocol = /^(?:about|app|app-storage|.+-extension|file|res|widget):$/,
+	rnoContent = /^(?:GET|HEAD)$/,
+	rprotocol = /^\/\//,
+
+	/* Prefilters
+	 * 1) They are useful to introduce custom dataTypes (see ajax/jsonp.js for an example)
+	 * 2) These are called:
+	 *    - BEFORE asking for a transport
+	 *    - AFTER param serialization (s.data is a string if s.processData is true)
+	 * 3) key is the dataType
+	 * 4) the catchall symbol "*" can be used
+	 * 5) execution will start with transport dataType and THEN continue down to "*" if needed
+	 */
+	prefilters = {},
+
+	/* Transports bindings
+	 * 1) key is the dataType
+	 * 2) the catchall symbol "*" can be used
+	 * 3) selection will start with transport dataType and THEN go to "*" if needed
+	 */
+	transports = {},
+
+	// Avoid comment-prolog char sequence (#10098); must appease lint and evade compression
+	allTypes = "*/".concat( "*" ),
+
+	// Anchor tag for parsing the document origin
+	originAnchor = document.createElement( "a" );
+
+originAnchor.href = location.href;
+
+// Base "constructor" for jQuery.ajaxPrefilter and jQuery.ajaxTransport
+function addToPrefiltersOrTransports( structure ) {
+
+	// dataTypeExpression is optional and defaults to "*"
+	return function( dataTypeExpression, func ) {
+
+		if ( typeof dataTypeExpression !== "string" ) {
+			func = dataTypeExpression;
+			dataTypeExpression = "*";
+		}
+
+		var dataType,
+			i = 0,
+			dataTypes = dataTypeExpression.toLowerCase().match( rnothtmlwhite ) || [];
+
+		if ( isFunction( func ) ) {
+
+			// For each dataType in the dataTypeExpression
+			while ( ( dataType = dataTypes[ i++ ] ) ) {
+
+				// Prepend if requested
+				if ( dataType[ 0 ] === "+" ) {
+					dataType = dataType.slice( 1 ) || "*";
+					( structure[ dataType ] = structure[ dataType ] || [] ).unshift( func );
+
+				// Otherwise append
+				} else {
+					( structure[ dataType ] = structure[ dataType ] || [] ).push( func );
+				}
+			}
+		}
+	};
+}
+
+// Base inspection function for prefilters and transports
+function inspectPrefiltersOrTransports( structure, options, originalOptions, jqXHR ) {
+
+	var inspected = {},
+		seekingTransport = ( structure === transports );
+
+	function inspect( dataType ) {
+		var selected;
+		inspected[ dataType ] = true;
+		jQuery.each( structure[ dataType ] || [], function( _, prefilterOrFactory ) {
+			var dataTypeOrTransport = prefilterOrFactory( options, originalOptions, jqXHR );
+			if ( typeof dataTypeOrTransport === "string" &&
+				!seekingTransport && !inspected[ dataTypeOrTransport ] ) {
+
+				options.dataTypes.unshift( dataTypeOrTransport );
+				inspect( dataTypeOrTransport );
+				return false;
+			} else if ( seekingTransport ) {
+				return !( selected = dataTypeOrTransport );
+			}
+		} );
+		return selected;
+	}
+
+	return inspect( options.dataTypes[ 0 ] ) || !inspected[ "*" ] && inspect( "*" );
+}
+
+// A special extend for ajax options
+// that takes "flat" options (not to be deep extended)
+// Fixes #9887
+function ajaxExtend( target, src ) {
+	var key, deep,
+		flatOptions = jQuery.ajaxSettings.flatOptions || {};
+
+	for ( key in src ) {
+		if ( src[ key ] !== undefined ) {
+			( flatOptions[ key ] ? target : ( deep || ( deep = {} ) ) )[ key ] = src[ key ];
+		}
+	}
+	if ( deep ) {
+		jQuery.extend( true, target, deep );
+	}
+
+	return target;
+}
+
+/* Handles responses to an ajax request:
+ * - finds the right dataType (mediates between content-type and expected dataType)
+ * - returns the corresponding response
+ */
+function ajaxHandleResponses( s, jqXHR, responses ) {
+
+	var ct, type, finalDataType, firstDataType,
+		contents = s.contents,
+		dataTypes = s.dataTypes;
+
+	// Remove auto dataType and get content-type in the process
+	while ( dataTypes[ 0 ] === "*" ) {
+		dataTypes.shift();
+		if ( ct === undefined ) {
+			ct = s.mimeType || jqXHR.getResponseHeader( "Content-Type" );
+		}
+	}
+
+	// Check if we're dealing with a known content-type
+	if ( ct ) {
+		for ( type in contents ) {
+			if ( contents[ type ] && contents[ type ].test( ct ) ) {
+				dataTypes.unshift( type );
+				break;
+			}
+		}
+	}
+
+	// Check to see if we have a response for the expected dataType
+	if ( dataTypes[ 0 ] in responses ) {
+		finalDataType = dataTypes[ 0 ];
+	} else {
+
+		// Try convertible dataTypes
+		for ( type in responses ) {
+			if ( !dataTypes[ 0 ] || s.converters[ type + " " + dataTypes[ 0 ] ] ) {
+				finalDataType = type;
+				break;
+			}
+			if ( !firstDataType ) {
+				firstDataType = type;
+			}
+		}
+
+		// Or just use first one
+		finalDataType = finalDataType || firstDataType;
+	}
+
+	// If we found a dataType
+	// We add the dataType to the list if needed
+	// and return the corresponding response
+	if ( finalDataType ) {
+		if ( finalDataType !== dataTypes[ 0 ] ) {
+			dataTypes.unshift( finalDataType );
+		}
+		return responses[ finalDataType ];
+	}
+}
+
+/* Chain conversions given the request and the original response
+ * Also sets the responseXXX fields on the jqXHR instance
+ */
+function ajaxConvert( s, response, jqXHR, isSuccess ) {
+	var conv2, current, conv, tmp, prev,
+		converters = {},
+
+		// Work with a copy of dataTypes in case we need to modify it for conversion
+		dataTypes = s.dataTypes.slice();
+
+	// Create converters map with lowercased keys
+	if ( dataTypes[ 1 ] ) {
+		for ( conv in s.converters ) {
+			converters[ conv.toLowerCase() ] = s.converters[ conv ];
+		}
+	}
+
+	current = dataTypes.shift();
+
+	// Convert to each sequential dataType
+	while ( current ) {
+
+		if ( s.responseFields[ current ] ) {
+			jqXHR[ s.responseFields[ current ] ] = response;
+		}
+
+		// Apply the dataFilter if provided
+		if ( !prev && isSuccess && s.dataFilter ) {
+			response = s.dataFilter( response, s.dataType );
+		}
+
+		prev = current;
+		current = dataTypes.shift();
+
+		if ( current ) {
+
+			// There's only work to do if current dataType is non-auto
+			if ( current === "*" ) {
+
+				current = prev;
+
+			// Convert response if prev dataType is non-auto and differs from current
+			} else if ( prev !== "*" && prev !== current ) {
+
+				// Seek a direct converter
+				conv = converters[ prev + " " + current ] || converters[ "* " + current ];
+
+				// If none found, seek a pair
+				if ( !conv ) {
+					for ( conv2 in converters ) {
+
+						// If conv2 outputs current
+						tmp = conv2.split( " " );
+						if ( tmp[ 1 ] === current ) {
+
+							// If prev can be converted to accepted input
+							conv = converters[ prev + " " + tmp[ 0 ] ] ||
+								converters[ "* " + tmp[ 0 ] ];
+							if ( conv ) {
+
+								// Condense equivalence converters
+								if ( conv === true ) {
+									conv = converters[ conv2 ];
+
+								// Otherwise, insert the intermediate dataType
+								} else if ( converters[ conv2 ] !== true ) {
+									current = tmp[ 0 ];
+									dataTypes.unshift( tmp[ 1 ] );
+								}
+								break;
+							}
+						}
+					}
+				}
+
+				// Apply converter (if not an equivalence)
+				if ( conv !== true ) {
+
+					// Unless errors are allowed to bubble, catch and return them
+					if ( conv && s.throws ) {
+						response = conv( response );
+					} else {
+						try {
+							response = conv( response );
+						} catch ( e ) {
+							return {
+								state: "parsererror",
+								error: conv ? e : "No conversion from " + prev + " to " + current
+							};
+						}
+					}
+				}
+			}
+		}
+	}
+
+	return { state: "success", data: response };
+}
+
+jQuery.extend( {
+
+	// Counter for holding the number of active queries
+	active: 0,
+
+	// Last-Modified header cache for next request
+	lastModified: {},
+	etag: {},
+
+	ajaxSettings: {
+		url: location.href,
+		type: "GET",
+		isLocal: rlocalProtocol.test( location.protocol ),
+		global: true,
+		processData: true,
+		async: true,
+		contentType: "application/x-www-form-urlencoded; charset=UTF-8",
+
+		/*
+		timeout: 0,
+		data: null,
+		dataType: null,
+		username: null,
+		password: null,
+		cache: null,
+		throws: false,
+		traditional: false,
+		headers: {},
+		*/
+
+		accepts: {
+			"*": allTypes,
+			text: "text/plain",
+			html: "text/html",
+			xml: "application/xml, text/xml",
+			json: "application/json, text/javascript"
+		},
+
+		contents: {
+			xml: /\bxml\b/,
+			html: /\bhtml/,
+			json: /\bjson\b/
+		},
+
+		responseFields: {
+			xml: "responseXML",
+			text: "responseText",
+			json: "responseJSON"
+		},
+
+		// Data converters
+		// Keys separate source (or catchall "*") and destination types with a single space
+		converters: {
+
+			// Convert anything to text
+			"* text": String,
+
+			// Text to html (true = no transformation)
+			"text html": true,
+
+			// Evaluate text as a json expression
+			"text json": JSON.parse,
+
+			// Parse text as xml
+			"text xml": jQuery.parseXML
+		},
+
+		// For options that shouldn't be deep extended:
+		// you can add your own custom options here if
+		// and when you create one that shouldn't be
+		// deep extended (see ajaxExtend)
+		flatOptions: {
+			url: true,
+			context: true
+		}
+	},
+
+	// Creates a full fledged settings object into target
+	// with both ajaxSettings and settings fields.
+	// If target is omitted, writes into ajaxSettings.
+	ajaxSetup: function( target, settings ) {
+		return settings ?
+
+			// Building a settings object
+			ajaxExtend( ajaxExtend( target, jQuery.ajaxSettings ), settings ) :
+
+			// Extending ajaxSettings
+			ajaxExtend( jQuery.ajaxSettings, target );
+	},
+
+	ajaxPrefilter: addToPrefiltersOrTransports( prefilters ),
+	ajaxTransport: addToPrefiltersOrTransports( transports ),
+
+	// Main method
+	ajax: function( url, options ) {
+
+		// If url is an object, simulate pre-1.5 signature
+		if ( typeof url === "object" ) {
+			options = url;
+			url = undefined;
+		}
+
+		// Force options to be an object
+		options = options || {};
+
+		var transport,
+
+			// URL without anti-cache param
+			cacheURL,
+
+			// Response headers
+			responseHeadersString,
+			responseHeaders,
+
+			// timeout handle
+			timeoutTimer,
+
+			// Url cleanup var
+			urlAnchor,
+
+			// Request state (becomes false upon send and true upon completion)
+			completed,
+
+			// To know if global events are to be dispatched
+			fireGlobals,
+
+			// Loop variable
+			i,
+
+			// uncached part of the url
+			uncached,
+
+			// Create the final options object
+			s = jQuery.ajaxSetup( {}, options ),
+
+			// Callbacks context
+			callbackContext = s.context || s,
+
+			// Context for global events is callbackContext if it is a DOM node or jQuery collection
+			globalEventContext = s.context &&
+				( callbackContext.nodeType || callbackContext.jquery ) ?
+				jQuery( callbackContext ) :
+				jQuery.event,
+
+			// Deferreds
+			deferred = jQuery.Deferred(),
+			completeDeferred = jQuery.Callbacks( "once memory" ),
+
+			// Status-dependent callbacks
+			statusCode = s.statusCode || {},
+
+			// Headers (they are sent all at once)
+			requestHeaders = {},
+			requestHeadersNames = {},
+
+			// Default abort message
+			strAbort = "canceled",
+
+			// Fake xhr
+			jqXHR = {
+				readyState: 0,
+
+				// Builds headers hashtable if needed
+				getResponseHeader: function( key ) {
+					var match;
+					if ( completed ) {
+						if ( !responseHeaders ) {
+							responseHeaders = {};
+							while ( ( match = rheaders.exec( responseHeadersString ) ) ) {
+								responseHeaders[ match[ 1 ].toLowerCase() + " " ] =
+									( responseHeaders[ match[ 1 ].toLowerCase() + " " ] || [] )
+										.concat( match[ 2 ] );
+							}
+						}
+						match = responseHeaders[ key.toLowerCase() + " " ];
+					}
+					return match == null ? null : match.join( ", " );
+				},
+
+				// Raw string
+				getAllResponseHeaders: function() {
+					return completed ? responseHeadersString : null;
+				},
+
+				// Caches the header
+				setRequestHeader: function( name, value ) {
+					if ( completed == null ) {
+						name = requestHeadersNames[ name.toLowerCase() ] =
+							requestHeadersNames[ name.toLowerCase() ] || name;
+						requestHeaders[ name ] = value;
+					}
+					return this;
+				},
+
+				// Overrides response content-type header
+				overrideMimeType: function( type ) {
+					if ( completed == null ) {
+						s.mimeType = type;
+					}
+					return this;
+				},
+
+				// Status-dependent callbacks
+				statusCode: function( map ) {
+					var code;
+					if ( map ) {
+						if ( completed ) {
+
+							// Execute the appropriate callbacks
+							jqXHR.always( map[ jqXHR.status ] );
+						} else {
+
+							// Lazy-add the new callbacks in a way that preserves old ones
+							for ( code in map ) {
+								statusCode[ code ] = [ statusCode[ code ], map[ code ] ];
+							}
+						}
+					}
+					return this;
+				},
+
+				// Cancel the request
+				abort: function( statusText ) {
+					var finalText = statusText || strAbort;
+					if ( transport ) {
+						transport.abort( finalText );
+					}
+					done( 0, finalText );
+					return this;
+				}
+			};
+
+		// Attach deferreds
+		deferred.promise( jqXHR );
+
+		// Add protocol if not provided (prefilters might expect it)
+		// Handle falsy url in the settings object (#10093: consistency with old signature)
+		// We also use the url parameter if available
+		s.url = ( ( url || s.url || location.href ) + "" )
+			.replace( rprotocol, location.protocol + "//" );
+
+		// Alias method option to type as per ticket #12004
+		s.type = options.method || options.type || s.method || s.type;
+
+		// Extract dataTypes list
+		s.dataTypes = ( s.dataType || "*" ).toLowerCase().match( rnothtmlwhite ) || [ "" ];
+
+		// A cross-domain request is in order when the origin doesn't match the current origin.
+		if ( s.crossDomain == null ) {
+			urlAnchor = document.createElement( "a" );
+
+			// Support: IE <=8 - 11, Edge 12 - 15
+			// IE throws exception on accessing the href property if url is malformed,
+			// e.g. http://example.com:80x/
+			try {
+				urlAnchor.href = s.url;
+
+				// Support: IE <=8 - 11 only
+				// Anchor's host property isn't correctly set when s.url is relative
+				urlAnchor.href = urlAnchor.href;
+				s.crossDomain = originAnchor.protocol + "//" + originAnchor.host !==
+					urlAnchor.protocol + "//" + urlAnchor.host;
+			} catch ( e ) {
+
+				// If there is an error parsing the URL, assume it is crossDomain,
+				// it can be rejected by the transport if it is invalid
+				s.crossDomain = true;
+			}
+		}
+
+		// Convert data if not already a string
+		if ( s.data && s.processData && typeof s.data !== "string" ) {
+			s.data = jQuery.param( s.data, s.traditional );
+		}
+
+		// Apply prefilters
+		inspectPrefiltersOrTransports( prefilters, s, options, jqXHR );
+
+		// If request was aborted inside a prefilter, stop there
+		if ( completed ) {
+			return jqXHR;
+		}
+
+		// We can fire global events as of now if asked to
+		// Don't fire events if jQuery.event is undefined in an AMD-usage scenario (#15118)
+		fireGlobals = jQuery.event && s.global;
+
+		// Watch for a new set of requests
+		if ( fireGlobals && jQuery.active++ === 0 ) {
+			jQuery.event.trigger( "ajaxStart" );
+		}
+
+		// Uppercase the type
+		s.type = s.type.toUpperCase();
+
+		// Determine if request has content
+		s.hasContent = !rnoContent.test( s.type );
+
+		// Save the URL in case we're toying with the If-Modified-Since
+		// and/or If-None-Match header later on
+		// Remove hash to simplify url manipulation
+		cacheURL = s.url.replace( rhash, "" );
+
+		// More options handling for requests with no content
+		if ( !s.hasContent ) {
+
+			// Remember the hash so we can put it back
+			uncached = s.url.slice( cacheURL.length );
+
+			// If data is available and should be processed, append data to url
+			if ( s.data && ( s.processData || typeof s.data === "string" ) ) {
+				cacheURL += ( rquery.test( cacheURL ) ? "&" : "?" ) + s.data;
+
+				// #9682: remove data so that it's not used in an eventual retry
+				delete s.data;
+			}
+
+			// Add or update anti-cache param if needed
+			if ( s.cache === false ) {
+				cacheURL = cacheURL.replace( rantiCache, "$1" );
+				uncached = ( rquery.test( cacheURL ) ? "&" : "?" ) + "_=" + ( nonce.guid++ ) +
+					uncached;
+			}
+
+			// Put hash and anti-cache on the URL that will be requested (gh-1732)
+			s.url = cacheURL + uncached;
+
+		// Change '%20' to '+' if this is encoded form body content (gh-2658)
+		} else if ( s.data && s.processData &&
+			( s.contentType || "" ).indexOf( "application/x-www-form-urlencoded" ) === 0 ) {
+			s.data = s.data.replace( r20, "+" );
+		}
+
+		// Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode.
+		if ( s.ifModified ) {
+			if ( jQuery.lastModified[ cacheURL ] ) {
+				jqXHR.setRequestHeader( "If-Modified-Since", jQuery.lastModified[ cacheURL ] );
+			}
+			if ( jQuery.etag[ cacheURL ] ) {
+				jqXHR.setRequestHeader( "If-None-Match", jQuery.etag[ cacheURL ] );
+			}
+		}
+
+		// Set the correct header, if data is being sent
+		if ( s.data && s.hasContent && s.contentType !== false || options.contentType ) {
+			jqXHR.setRequestHeader( "Content-Type", s.contentType );
+		}
+
+		// Set the Accepts header for the server, depending on the dataType
+		jqXHR.setRequestHeader(
+			"Accept",
+			s.dataTypes[ 0 ] && s.accepts[ s.dataTypes[ 0 ] ] ?
+				s.accepts[ s.dataTypes[ 0 ] ] +
+					( s.dataTypes[ 0 ] !== "*" ? ", " + allTypes + "; q=0.01" : "" ) :
+				s.accepts[ "*" ]
+		);
+
+		// Check for headers option
+		for ( i in s.headers ) {
+			jqXHR.setRequestHeader( i, s.headers[ i ] );
+		}
+
+		// Allow custom headers/mimetypes and early abort
+		if ( s.beforeSend &&
+			( s.beforeSend.call( callbackContext, jqXHR, s ) === false || completed ) ) {
+
+			// Abort if not done already and return
+			return jqXHR.abort();
+		}
+
+		// Aborting is no longer a cancellation
+		strAbort = "abort";
+
+		// Install callbacks on deferreds
+		completeDeferred.add( s.complete );
+		jqXHR.done( s.success );
+		jqXHR.fail( s.error );
+
+		// Get transport
+		transport = inspectPrefiltersOrTransports( transports, s, options, jqXHR );
+
+		// If no transport, we auto-abort
+		if ( !transport ) {
+			done( -1, "No Transport" );
+		} else {
+			jqXHR.readyState = 1;
+
+			// Send global event
+			if ( fireGlobals ) {
+				globalEventContext.trigger( "ajaxSend", [ jqXHR, s ] );
+			}
+
+			// If request was aborted inside ajaxSend, stop there
+			if ( completed ) {
+				return jqXHR;
+			}
+
+			// Timeout
+			if ( s.async && s.timeout > 0 ) {
+				timeoutTimer = window.setTimeout( function() {
+					jqXHR.abort( "timeout" );
+				}, s.timeout );
+			}
+
+			try {
+				completed = false;
+				transport.send( requestHeaders, done );
+			} catch ( e ) {
+
+				// Rethrow post-completion exceptions
+				if ( completed ) {
+					throw e;
+				}
+
+				// Propagate others as results
+				done( -1, e );
+			}
+		}
+
+		// Callback for when everything is done
+		function done( status, nativeStatusText, responses, headers ) {
+			var isSuccess, success, error, response, modified,
+				statusText = nativeStatusText;
+
+			// Ignore repeat invocations
+			if ( completed ) {
+				return;
+			}
+
+			completed = true;
+
+			// Clear timeout if it exists
+			if ( timeoutTimer ) {
+				window.clearTimeout( timeoutTimer );
+			}
+
+			// Dereference transport for early garbage collection
+			// (no matter how long the jqXHR object will be used)
+			transport = undefined;
+
+			// Cache response headers
+			responseHeadersString = headers || "";
+
+			// Set readyState
+			jqXHR.readyState = status > 0 ? 4 : 0;
+
+			// Determine if successful
+			isSuccess = status >= 200 && status < 300 || status === 304;
+
+			// Get response data
+			if ( responses ) {
+				response = ajaxHandleResponses( s, jqXHR, responses );
+			}
+
+			// Use a noop converter for missing script but not if jsonp
+			if ( !isSuccess &&
+				jQuery.inArray( "script", s.dataTypes ) > -1 &&
+				jQuery.inArray( "json", s.dataTypes ) < 0 ) {
+				s.converters[ "text script" ] = function() {};
+			}
+
+			// Convert no matter what (that way responseXXX fields are always set)
+			response = ajaxConvert( s, response, jqXHR, isSuccess );
+
+			// If successful, handle type chaining
+			if ( isSuccess ) {
+
+				// Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode.
+				if ( s.ifModified ) {
+					modified = jqXHR.getResponseHeader( "Last-Modified" );
+					if ( modified ) {
+						jQuery.lastModified[ cacheURL ] = modified;
+					}
+					modified = jqXHR.getResponseHeader( "etag" );
+					if ( modified ) {
+						jQuery.etag[ cacheURL ] = modified;
+					}
+				}
+
+				// if no content
+				if ( status === 204 || s.type === "HEAD" ) {
+					statusText = "nocontent";
+
+				// if not modified
+				} else if ( status === 304 ) {
+					statusText = "notmodified";
+
+				// If we have data, let's convert it
+				} else {
+					statusText = response.state;
+					success = response.data;
+					error = response.error;
+					isSuccess = !error;
+				}
+			} else {
+
+				// Extract error from statusText and normalize for non-aborts
+				error = statusText;
+				if ( status || !statusText ) {
+					statusText = "error";
+					if ( status < 0 ) {
+						status = 0;
+					}
+				}
+			}
+
+			// Set data for the fake xhr object
+			jqXHR.status = status;
+			jqXHR.statusText = ( nativeStatusText || statusText ) + "";
+
+			// Success/Error
+			if ( isSuccess ) {
+				deferred.resolveWith( callbackContext, [ success, statusText, jqXHR ] );
+			} else {
+				deferred.rejectWith( callbackContext, [ jqXHR, statusText, error ] );
+			}
+
+			// Status-dependent callbacks
+			jqXHR.statusCode( statusCode );
+			statusCode = undefined;
+
+			if ( fireGlobals ) {
+				globalEventContext.trigger( isSuccess ? "ajaxSuccess" : "ajaxError",
+					[ jqXHR, s, isSuccess ? success : error ] );
+			}
+
+			// Complete
+			completeDeferred.fireWith( callbackContext, [ jqXHR, statusText ] );
+
+			if ( fireGlobals ) {
+				globalEventContext.trigger( "ajaxComplete", [ jqXHR, s ] );
+
+				// Handle the global AJAX counter
+				if ( !( --jQuery.active ) ) {
+					jQuery.event.trigger( "ajaxStop" );
+				}
+			}
+		}
+
+		return jqXHR;
+	},
+
+	getJSON: function( url, data, callback ) {
+		return jQuery.get( url, data, callback, "json" );
+	},
+
+	getScript: function( url, callback ) {
+		return jQuery.get( url, undefined, callback, "script" );
+	}
+} );
+
+jQuery.each( [ "get", "post" ], function( _i, method ) {
+	jQuery[ method ] = function( url, data, callback, type ) {
+
+		// Shift arguments if data argument was omitted
+		if ( isFunction( data ) ) {
+			type = type || callback;
+			callback = data;
+			data = undefined;
+		}
+
+		// The url can be an options object (which then must have .url)
+		return jQuery.ajax( jQuery.extend( {
+			url: url,
+			type: method,
+			dataType: type,
+			data: data,
+			success: callback
+		}, jQuery.isPlainObject( url ) && url ) );
+	};
+} );
+
+jQuery.ajaxPrefilter( function( s ) {
+	var i;
+	for ( i in s.headers ) {
+		if ( i.toLowerCase() === "content-type" ) {
+			s.contentType = s.headers[ i ] || "";
+		}
+	}
+} );
+
+
+jQuery._evalUrl = function( url, options, doc ) {
+	return jQuery.ajax( {
+		url: url,
+
+		// Make this explicit, since user can override this through ajaxSetup (#11264)
+		type: "GET",
+		dataType: "script",
+		cache: true,
+		async: false,
+		global: false,
+
+		// Only evaluate the response if it is successful (gh-4126)
+		// dataFilter is not invoked for failure responses, so using it instead
+		// of the default converter is kludgy but it works.
+		converters: {
+			"text script": function() {}
+		},
+		dataFilter: function( response ) {
+			jQuery.globalEval( response, options, doc );
+		}
+	} );
+};
+
+
+jQuery.fn.extend( {
+	wrapAll: function( html ) {
+		var wrap;
+
+		if ( this[ 0 ] ) {
+			if ( isFunction( html ) ) {
+				html = html.call( this[ 0 ] );
+			}
+
+			// The elements to wrap the target around
+			wrap = jQuery( html, this[ 0 ].ownerDocument ).eq( 0 ).clone( true );
+
+			if ( this[ 0 ].parentNode ) {
+				wrap.insertBefore( this[ 0 ] );
+			}
+
+			wrap.map( function() {
+				var elem = this;
+
+				while ( elem.firstElementChild ) {
+					elem = elem.firstElementChild;
+				}
+
+				return elem;
+			} ).append( this );
+		}
+
+		return this;
+	},
+
+	wrapInner: function( html ) {
+		if ( isFunction( html ) ) {
+			return this.each( function( i ) {
+				jQuery( this ).wrapInner( html.call( this, i ) );
+			} );
+		}
+
+		return this.each( function() {
+			var self = jQuery( this ),
+				contents = self.contents();
+
+			if ( contents.length ) {
+				contents.wrapAll( html );
+
+			} else {
+				self.append( html );
+			}
+		} );
+	},
+
+	wrap: function( html ) {
+		var htmlIsFunction = isFunction( html );
+
+		return this.each( function( i ) {
+			jQuery( this ).wrapAll( htmlIsFunction ? html.call( this, i ) : html );
+		} );
+	},
+
+	unwrap: function( selector ) {
+		this.parent( selector ).not( "body" ).each( function() {
+			jQuery( this ).replaceWith( this.childNodes );
+		} );
+		return this;
+	}
+} );
+
+
+jQuery.expr.pseudos.hidden = function( elem ) {
+	return !jQuery.expr.pseudos.visible( elem );
+};
+jQuery.expr.pseudos.visible = function( elem ) {
+	return !!( elem.offsetWidth || elem.offsetHeight || elem.getClientRects().length );
+};
+
+
+
+
+jQuery.ajaxSettings.xhr = function() {
+	try {
+		return new window.XMLHttpRequest();
+	} catch ( e ) {}
+};
+
+var xhrSuccessStatus = {
+
+		// File protocol always yields status code 0, assume 200
+		0: 200,
+
+		// Support: IE <=9 only
+		// #1450: sometimes IE returns 1223 when it should be 204
+		1223: 204
+	},
+	xhrSupported = jQuery.ajaxSettings.xhr();
+
+support.cors = !!xhrSupported && ( "withCredentials" in xhrSupported );
+support.ajax = xhrSupported = !!xhrSupported;
+
+jQuery.ajaxTransport( function( options ) {
+	var callback, errorCallback;
+
+	// Cross domain only allowed if supported through XMLHttpRequest
+	if ( support.cors || xhrSupported && !options.crossDomain ) {
+		return {
+			send: function( headers, complete ) {
+				var i,
+					xhr = options.xhr();
+
+				xhr.open(
+					options.type,
+					options.url,
+					options.async,
+					options.username,
+					options.password
+				);
+
+				// Apply custom fields if provided
+				if ( options.xhrFields ) {
+					for ( i in options.xhrFields ) {
+						xhr[ i ] = options.xhrFields[ i ];
+					}
+				}
+
+				// Override mime type if needed
+				if ( options.mimeType && xhr.overrideMimeType ) {
+					xhr.overrideMimeType( options.mimeType );
+				}
+
+				// X-Requested-With header
+				// For cross-domain requests, seeing as conditions for a preflight are
+				// akin to a jigsaw puzzle, we simply never set it to be sure.
+				// (it can always be set on a per-request basis or even using ajaxSetup)
+				// For same-domain requests, won't change header if already provided.
+				if ( !options.crossDomain && !headers[ "X-Requested-With" ] ) {
+					headers[ "X-Requested-With" ] = "XMLHttpRequest";
+				}
+
+				// Set headers
+				for ( i in headers ) {
+					xhr.setRequestHeader( i, headers[ i ] );
+				}
+
+				// Callback
+				callback = function( type ) {
+					return function() {
+						if ( callback ) {
+							callback = errorCallback = xhr.onload =
+								xhr.onerror = xhr.onabort = xhr.ontimeout =
+									xhr.onreadystatechange = null;
+
+							if ( type === "abort" ) {
+								xhr.abort();
+							} else if ( type === "error" ) {
+
+								// Support: IE <=9 only
+								// On a manual native abort, IE9 throws
+								// errors on any property access that is not readyState
+								if ( typeof xhr.status !== "number" ) {
+									complete( 0, "error" );
+								} else {
+									complete(
+
+										// File: protocol always yields status 0; see #8605, #14207
+										xhr.status,
+										xhr.statusText
+									);
+								}
+							} else {
+								complete(
+									xhrSuccessStatus[ xhr.status ] || xhr.status,
+									xhr.statusText,
+
+									// Support: IE <=9 only
+									// IE9 has no XHR2 but throws on binary (trac-11426)
+									// For XHR2 non-text, let the caller handle it (gh-2498)
+									( xhr.responseType || "text" ) !== "text"  ||
+									typeof xhr.responseText !== "string" ?
+										{ binary: xhr.response } :
+										{ text: xhr.responseText },
+									xhr.getAllResponseHeaders()
+								);
+							}
+						}
+					};
+				};
+
+				// Listen to events
+				xhr.onload = callback();
+				errorCallback = xhr.onerror = xhr.ontimeout = callback( "error" );
+
+				// Support: IE 9 only
+				// Use onreadystatechange to replace onabort
+				// to handle uncaught aborts
+				if ( xhr.onabort !== undefined ) {
+					xhr.onabort = errorCallback;
+				} else {
+					xhr.onreadystatechange = function() {
+
+						// Check readyState before timeout as it changes
+						if ( xhr.readyState === 4 ) {
+
+							// Allow onerror to be called first,
+							// but that will not handle a native abort
+							// Also, save errorCallback to a variable
+							// as xhr.onerror cannot be accessed
+							window.setTimeout( function() {
+								if ( callback ) {
+									errorCallback();
+								}
+							} );
+						}
+					};
+				}
+
+				// Create the abort callback
+				callback = callback( "abort" );
+
+				try {
+
+					// Do send the request (this may raise an exception)
+					xhr.send( options.hasContent && options.data || null );
+				} catch ( e ) {
+
+					// #14683: Only rethrow if this hasn't been notified as an error yet
+					if ( callback ) {
+						throw e;
+					}
+				}
+			},
+
+			abort: function() {
+				if ( callback ) {
+					callback();
+				}
+			}
+		};
+	}
+} );
+
+
+
+
+// Prevent auto-execution of scripts when no explicit dataType was provided (See gh-2432)
+jQuery.ajaxPrefilter( function( s ) {
+	if ( s.crossDomain ) {
+		s.contents.script = false;
+	}
+} );
+
+// Install script dataType
+jQuery.ajaxSetup( {
+	accepts: {
+		script: "text/javascript, application/javascript, " +
+			"application/ecmascript, application/x-ecmascript"
+	},
+	contents: {
+		script: /\b(?:java|ecma)script\b/
+	},
+	converters: {
+		"text script": function( text ) {
+			jQuery.globalEval( text );
+			return text;
+		}
+	}
+} );
+
+// Handle cache's special case and crossDomain
+jQuery.ajaxPrefilter( "script", function( s ) {
+	if ( s.cache === undefined ) {
+		s.cache = false;
+	}
+	if ( s.crossDomain ) {
+		s.type = "GET";
+	}
+} );
+
+// Bind script tag hack transport
+jQuery.ajaxTransport( "script", function( s ) {
+
+	// This transport only deals with cross domain or forced-by-attrs requests
+	if ( s.crossDomain || s.scriptAttrs ) {
+		var script, callback;
+		return {
+			send: function( _, complete ) {
+				script = jQuery( "
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
 
-
 
-
-    
-
-    
      
-      
      
-  
      
 
-
      
+  
      
+
      
+
      
+  
      
 
      TreeDist
 
      
 
      Project Status: The project has reached a stable, usable state but is no longer being actively developed; support/maintenance will be provided as time allows. codecov CRAN Status Badge CRAN Downloads DOI
      
@@ -240,10 +178,7 @@ 
      ReferencesContributor Code of Conduct. By contributing to this project, you agree to abide by its terms.
      
 
      
 
-  
      
-
-  
 
-  
-
-
+
+
+
+
+  
 
diff --git a/dev/katex-auto.js b/dev/katex-auto.js
new file mode 100644
index 000000000..20651d9fd
--- /dev/null
+++ b/dev/katex-auto.js
@@ -0,0 +1,14 @@
+// https://github.com/jgm/pandoc/blob/29fa97ab96b8e2d62d48326e1b949a71dc41f47a/src/Text/Pandoc/Writers/HTML.hs#L332-L345
+document.addEventListener("DOMContentLoaded", function () {
+  var mathElements = document.getElementsByClassName("math");
+  var macros = [];
+  for (var i = 0; i < mathElements.length; i++) {
+    var texText = mathElements[i].firstChild;
+    if (mathElements[i].tagName == "SPAN") {
+      katex.render(texText.data, mathElements[i], {
+        displayMode: mathElements[i].classList.contains("display"),
+        throwOnError: false,
+        macros: macros,
+        fleqn: false
+      });
+    }}});
diff --git a/dev/lightswitch.js b/dev/lightswitch.js
new file mode 100644
index 000000000..9467125ae
--- /dev/null
+++ b/dev/lightswitch.js
@@ -0,0 +1,85 @@
+
+/*!
+ * Color mode toggler for Bootstrap's docs (https://getbootstrap.com/)
+ * Copyright 2011-2023 The Bootstrap Authors
+ * Licensed under the Creative Commons Attribution 3.0 Unported License.
+ * Updates for {pkgdown} by the {bslib} authors, also licensed under CC-BY-3.0.
+ */
+
+const getStoredTheme = () => localStorage.getItem('theme')
+const setStoredTheme = theme => localStorage.setItem('theme', theme)
+
+const getPreferredTheme = () => {
+  const storedTheme = getStoredTheme()
+  if (storedTheme) {
+    return storedTheme
+  }
+
+  return window.matchMedia('(prefers-color-scheme: dark)').matches ? 'dark' : 'light'
+}
+
+const setTheme = theme => {
+  if (theme === 'auto') {
+    document.documentElement.setAttribute('data-bs-theme', (window.matchMedia('(prefers-color-scheme: dark)').matches ? 'dark' : 'light'))
+  } else {
+    document.documentElement.setAttribute('data-bs-theme', theme)
+  }
+}
+
+function bsSetupThemeToggle () {
+  'use strict'
+
+  const showActiveTheme = (theme, focus = false) => {
+    var activeLabel, activeIcon;
+
+    document.querySelectorAll('[data-bs-theme-value]').forEach(element => {
+      const buttonTheme = element.getAttribute('data-bs-theme-value')
+      const isActive = buttonTheme == theme
+      
+      element.classList.toggle('active', isActive)
+      element.setAttribute('aria-pressed', isActive)
+
+      if (isActive) {
+        activeLabel = element.textContent;
+        activeIcon = element.querySelector('span').classList.value;
+      }
+    })
+
+    const themeSwitcher = document.querySelector('#dropdown-lightswitch')
+    if (!themeSwitcher) {
+      return
+    }
+
+    themeSwitcher.setAttribute('aria-label', activeLabel)
+    themeSwitcher.querySelector('span').classList.value = activeIcon;
+
+    if (focus) {
+      themeSwitcher.focus()
+    }
+  }
+
+  window.matchMedia('(prefers-color-scheme: dark)').addEventListener('change', () => {
+    const storedTheme = getStoredTheme()
+    if (storedTheme !== 'light' && storedTheme !== 'dark') {
+      setTheme(getPreferredTheme())
+    }
+  })
+
+  window.addEventListener('DOMContentLoaded', () => {
+    showActiveTheme(getPreferredTheme())
+
+    document
+      .querySelectorAll('[data-bs-theme-value]')
+      .forEach(toggle => {
+        toggle.addEventListener('click', () => {
+          const theme = toggle.getAttribute('data-bs-theme-value')
+          setTheme(theme)
+          setStoredTheme(theme)
+          showActiveTheme(theme, true)
+        })
+      })
+  })
+}
+
+setTheme(getPreferredTheme());
+bsSetupThemeToggle();
diff --git a/dev/news/index.html b/dev/news/index.html
index 5421f838d..1ba0663eb 100644
--- a/dev/news/index.html
+++ b/dev/news/index.html
@@ -1,153 +1,115 @@
 
-Changelog • TreeDist
-    
+
+    Skip to contents
 
-    
      
-      
      
-  
      
-    
      
-      
      Changelog 
      
-      Source: NEWS.md
+  
      
+
      
+
      
+  
      
+
+      
      Changelog
      
+      Source: NEWS.md
     
      
 
     
      
-
      TreeDist 2.7.1 (2024-06-13)
      
+
      TreeDist 2.8.0.9000 (development)
      
+
      
+    
      
+
      TreeDist 2.8.0 (2024-07-25)
      CRAN release: 2024-07-26
      
+
      • Islands() allows the identification of islands of trees.
        • 
+
      • Internal implementation of path and SPR distances, removing dependency on phangorn (and thus R 4.4).
        • 
+
      • Add progress bar within .MaxValue()
        • 
+
      
+    
      
+
      TreeDist 2.7.1 (2024-06-13)
      
 
      • Documentation improvements.
        • 
 
      • Fix KCDiameter.multiPhylo() for multiple trees.
        • 
 
      
     
      
-
      TreeDist 2.7.0 (2023-10-25)2023-10-25
      
+
      TreeDist 2.7.0 (2023-10-25)
      CRAN release: 2023-10-25
      
 
      • Fix calculation error in StrainCol().
        • 
 
      • App: Display strain in 3D tree space viewer.
        • 
 
      • Support for distances between larger trees.
        • 
 
      • Support unrooted trees in VisualizeMatching() (#103).
        • 
 
      
     
      
-
      TreeDist 2.6.3 (2023-08-25)2023-08-25
      
+
      TreeDist 2.6.3 (2023-08-25)
      CRAN release: 2023-08-25
      
 
      • Fix bug when comparing a “multiPhylo” object containing a single tree.
        • 
 
      • Documentation clarification: finding non-matching leaves.
        • 
 
      
     
      
-
      TreeDist 2.6.2 (2023-06-28)2023-06-29
      
+
      TreeDist 2.6.2 (2023-06-28)
      CRAN release: 2023-06-29
      
 
      • Support non-square matrices in LAPJV().
        • 
 
      
     
      
-
      TreeDist 2.6.1 (2023-04-25)2023-05-01
      
+
      TreeDist 2.6.1 (2023-04-25)
      CRAN release: 2023-05-01
      
 
      • StopParallel() gains quietly argument to suppress unnecessary messages.
        • 
 
      • Use “PlotTools” package for spectrum legends.
        • 
 
      • Minor documentation tweaks.
        • 
 
      
     
      
-
      TreeDist 2.6.0 (2023-02-20)2023-02-20
      
+
      TreeDist 2.6.0 (2023-02-20)
      CRAN release: 2023-02-20
      
 
      • Support comparison of trees with different tips.
        • 
 
      • Fix caching errors in MapDist() (#98).
        • 
 
      • Update tests for compatibility with ape 5.7.
        • 
 
      
     
      
-
      TreeDist 2.5.0 (2022-10-07)2022-10-07
      
+
      TreeDist 2.5.0 (2022-10-07)
      CRAN release: 2022-10-07
      
 
      
     
      
-
      TreeDist 2.4.1 (2022-07-20)2022-07-20
      
+
      TreeDist 2.4.1 (2022-07-20)
      CRAN release: 2022-07-20
      
 
      • New vignette on how to compare tree sets.
        • 
 
      • PathVector() now treats trees with a root node as rooted.
        • 
 
      • Fix plot layout in treespace vignette.
        • 
@@ -155,32 +117,32 @@ 
        TreeD
 
      • Replace throw with stop in C++.
        • 
 
      
     
      
-
      TreeDist 2.4.0 (2022-03-23)2022-03-23
      
+
      TreeDist 2.4.0 (2022-03-23)
      CRAN release: 2022-03-23
      
 
      • Correct calculation of trustworthiness and continuity metrics.
        • 
 
      • Depict strain in minimum spanning trees with StrainCol() and helper function MSTSegments().
        • 
 
      • Update tests for consistency with “TreeTools” v1.7.
        • 
 
      • Use lighter Rcpp headers.
        • 
 
      
     
      
-
      TreeDist 2.3.0 (2022-01-04)2022-01-03
      
+
      TreeDist 2.3.0 (2022-01-04)
      CRAN release: 2022-01-03
      
 
      • Support ConsensusInfo(p > 0.5).
        • 
 
      • Address hypervolume comparison in vignettes.
        • 
 
      • Support uniform manifold approximation and projection in app.
        • 
 
      
     
      
-
      TreeDist 2.2.0 (2021-09-13)2021-09-13
      
+
      TreeDist 2.2.0 (2021-09-13)
      CRAN release: 2021-09-13
      
 
      • Speed improvements, using optimizations suggested by Alexis Stamatakis’ Bioinformatics group.
        • 
 
      • Support for parallel computation via StartParallel().
        • 
 
      • Progress bars.
        • 
 
      
     
      
-
      TreeDist 2.1.1 (2021-07-13)2021-07-13
      
+
      TreeDist 2.1.1 (2021-07-13)
      CRAN release: 2021-07-13
      
 
      • Solaris compatibility.
        • 
 
      • Modest vignette improvements.
        • 
 
      • spic/scic abbreviation recognition.
        • 
 
      
     
      
-
      TreeDist 2.1.0 (2021-07-12)2021-07-12
      
+
      TreeDist 2.1.0 (2021-07-12)
      CRAN release: 2021-07-12
      
 
      
 
      New features
      
 
      • ConsensusInfo() quickly calculates the splitwise information content of the consensus of a set of trees, after Smith (forthcoming).
        • 
@@ -201,12 +163,12 @@ 
        Improvements
      
 
      
     
      
-
      TreeDist 2.0.3 (2021-01-31)2021-01-31
      
+
      TreeDist 2.0.3 (2021-01-31)
      CRAN release: 2021-01-31
      
 
      • Diagnose and fix memory leaks, including over-long reported matchings.
        • 
 
      • Explicitly import shiny/shinyjs functions.
        • 
 
      
     
      
-
      TreeDist 2.0.0 (2021-01-20)2021-01-20
      
+
      TreeDist 2.0.0 (2021-01-20)
      CRAN release: 2021-01-20
      
 
      • Project() launches ‘shiny’ app for projection and analysis of tree space.
        • 
 
      • ProjectionQuality() calculates trustworthiness and continuity of tree space mappings.
        • 
 
      • Faster calculation of Robinson–Foulds distance (using algorithm of Day (1985)) and clustering information distance.
        • 
@@ -216,11 +178,11 @@ 
        TreeD
 
      • Use package ‘vdiffr’ conditionally.
        • 
 
      
     
      
-
      TreeDist 1.2.1 (2020-09-17)2020-09-17
      
+
      TreeDist 1.2.1 (2020-09-17)
      CRAN release: 2020-09-17
      
 
      • Import RdMacros package ‘RdPack’.
        • 
 
      
     
      
-
      TreeDist 1.2.0 (2020-08-28)2020-08-28
      
+
      TreeDist 1.2.0 (2020-08-28)
      CRAN release: 2020-08-28
      
 
      • TreeDistance() and related functions now return a dist object when computing all distances between all pairs of trees in a list.
        • 
 
      • Improve floating-point arithmetic in TreeDistance() functions.
        • 
 
      • TreeDistance() now returns a distance (as documented), rather than a similarity.
        • 
@@ -228,11 +190,11 @@ 
        TreeD
 
      • Reduce precision of LAPJV so rounding errors do not result in interminable run times.
        • 
 
      
     
      
-
      TreeDist 1.1.1 (2020-07-10)2020-07-10
      
+
      TreeDist 1.1.1 (2020-07-10)
      CRAN release: 2020-07-10
      
 
      • Fix range errors when calculating tree distances.
        • 
 
      
     
      
-
      TreeDist 1.1.0
      
+
      TreeDist 1.1.0
      
 
      
     
      
-
      TreeDist 1.0.0 (2020-06-30)2020-06-30
      
+
      TreeDist 1.0.0 (2020-06-30)
      CRAN release: 2020-06-30
      
 
      • Initial release, building on some draft functions included in ‘TreeSearch’ 0.3.2.9005.
        • 
 
      
-  
      
+  
      
 
-  
 
+    
      
+
+
+
 
-      
      
 
-  
-
+  
 
diff --git a/dev/pkgdown.css b/dev/pkgdown.css
deleted file mode 100644
index 80ea5b838..000000000
--- a/dev/pkgdown.css
+++ /dev/null
@@ -1,384 +0,0 @@
-/* Sticky footer */
-
-/**
- * Basic idea: https://philipwalton.github.io/solved-by-flexbox/demos/sticky-footer/
- * Details: https://github.com/philipwalton/solved-by-flexbox/blob/master/assets/css/components/site.css
- *
- * .Site -> body > .container
- * .Site-content -> body > .container .row
- * .footer -> footer
- *
- * Key idea seems to be to ensure that .container and __all its parents__
- * have height set to 100%
- *
- */
-
-html, body {
-  height: 100%;
-}
-
-body {
-  position: relative;
-}
-
-body > .container {
-  display: flex;
-  height: 100%;
-  flex-direction: column;
-}
-
-body > .container .row {
-  flex: 1 0 auto;
-}
-
-footer {
-  margin-top: 45px;
-  padding: 35px 0 36px;
-  border-top: 1px solid #e5e5e5;
-  color: #666;
-  display: flex;
-  flex-shrink: 0;
-}
-footer p {
-  margin-bottom: 0;
-}
-footer div {
-  flex: 1;
-}
-footer .pkgdown {
-  text-align: right;
-}
-footer p {
-  margin-bottom: 0;
-}
-
-img.icon {
-  float: right;
-}
-
-/* Ensure in-page images don't run outside their container */
-.contents img {
-  max-width: 100%;
-  height: auto;
-}
-
-/* Fix bug in bootstrap (only seen in firefox) */
-summary {
-  display: list-item;
-}
-
-/* Typographic tweaking ---------------------------------*/
-
-.contents .page-header {
-  margin-top: calc(-60px + 1em);
-}
-
-dd {
-  margin-left: 3em;
-}
-
-/* Section anchors ---------------------------------*/
-
-a.anchor {
-  display: none;
-  margin-left: 5px;
-  width: 20px;
-  height: 20px;
-
-  background-image: url(./link.svg);
-  background-repeat: no-repeat;
-  background-size: 20px 20px;
-  background-position: center center;
-}
-
-h1:hover .anchor,
-h2:hover .anchor,
-h3:hover .anchor,
-h4:hover .anchor,
-h5:hover .anchor,
-h6:hover .anchor {
-  display: inline-block;
-}
-
-/* Fixes for fixed navbar --------------------------*/
-
-.contents h1, .contents h2, .contents h3, .contents h4 {
-  padding-top: 60px;
-  margin-top: -40px;
-}
-
-/* Navbar submenu --------------------------*/
-
-.dropdown-submenu {
-  position: relative;
-}
-
-.dropdown-submenu>.dropdown-menu {
-  top: 0;
-  left: 100%;
-  margin-top: -6px;
-  margin-left: -1px;
-  border-radius: 0 6px 6px 6px;
-}
-
-.dropdown-submenu:hover>.dropdown-menu {
-  display: block;
-}
-
-.dropdown-submenu>a:after {
-  display: block;
-  content: " ";
-  float: right;
-  width: 0;
-  height: 0;
-  border-color: transparent;
-  border-style: solid;
-  border-width: 5px 0 5px 5px;
-  border-left-color: #cccccc;
-  margin-top: 5px;
-  margin-right: -10px;
-}
-
-.dropdown-submenu:hover>a:after {
-  border-left-color: #ffffff;
-}
-
-.dropdown-submenu.pull-left {
-  float: none;
-}
-
-.dropdown-submenu.pull-left>.dropdown-menu {
-  left: -100%;
-  margin-left: 10px;
-  border-radius: 6px 0 6px 6px;
-}
-
-/* Sidebar --------------------------*/
-
-#pkgdown-sidebar {
-  margin-top: 30px;
-  position: -webkit-sticky;
-  position: sticky;
-  top: 70px;
-}
-
-#pkgdown-sidebar h2 {
-  font-size: 1.5em;
-  margin-top: 1em;
-}
-
-#pkgdown-sidebar h2:first-child {
-  margin-top: 0;
-}
-
-#pkgdown-sidebar .list-unstyled li {
-  margin-bottom: 0.5em;
-}
-
-/* bootstrap-toc tweaks ------------------------------------------------------*/
-
-/* All levels of nav */
-
-nav[data-toggle='toc'] .nav > li > a {
-  padding: 4px 20px 4px 6px;
-  font-size: 1.5rem;
-  font-weight: 400;
-  color: inherit;
-}
-
-nav[data-toggle='toc'] .nav > li > a:hover,
-nav[data-toggle='toc'] .nav > li > a:focus {
-  padding-left: 5px;
-  color: inherit;
-  border-left: 1px solid #878787;
-}
-
-nav[data-toggle='toc'] .nav > .active > a,
-nav[data-toggle='toc'] .nav > .active:hover > a,
-nav[data-toggle='toc'] .nav > .active:focus > a {
-  padding-left: 5px;
-  font-size: 1.5rem;
-  font-weight: 400;
-  color: inherit;
-  border-left: 2px solid #878787;
-}
-
-/* Nav: second level (shown on .active) */
-
-nav[data-toggle='toc'] .nav .nav {
-  display: none; /* Hide by default, but at >768px, show it */
-  padding-bottom: 10px;
-}
-
-nav[data-toggle='toc'] .nav .nav > li > a {
-  padding-left: 16px;
-  font-size: 1.35rem;
-}
-
-nav[data-toggle='toc'] .nav .nav > li > a:hover,
-nav[data-toggle='toc'] .nav .nav > li > a:focus {
-  padding-left: 15px;
-}
-
-nav[data-toggle='toc'] .nav .nav > .active > a,
-nav[data-toggle='toc'] .nav .nav > .active:hover > a,
-nav[data-toggle='toc'] .nav .nav > .active:focus > a {
-  padding-left: 15px;
-  font-weight: 500;
-  font-size: 1.35rem;
-}
-
-/* orcid ------------------------------------------------------------------- */
-
-.orcid {
-  font-size: 16px;
-  color: #A6CE39;
-  /* margins are required by official ORCID trademark and display guidelines */
-  margin-left:4px;
-  margin-right:4px;
-  vertical-align: middle;
-}
-
-/* Reference index & topics ----------------------------------------------- */
-
-.ref-index th {font-weight: normal;}
-
-.ref-index td {vertical-align: top; min-width: 100px}
-.ref-index .icon {width: 40px;}
-.ref-index .alias {width: 40%;}
-.ref-index-icons .alias {width: calc(40% - 40px);}
-.ref-index .title {width: 60%;}
-
-.ref-arguments th {text-align: right; padding-right: 10px;}
-.ref-arguments th, .ref-arguments td {vertical-align: top; min-width: 100px}
-.ref-arguments .name {width: 20%;}
-.ref-arguments .desc {width: 80%;}
-
-/* Nice scrolling for wide elements --------------------------------------- */
-
-table {
-  display: block;
-  overflow: auto;
-}
-
-/* Syntax highlighting ---------------------------------------------------- */
-
-pre, code, pre code {
-  background-color: #f8f8f8;
-  color: #333;
-}
-pre, pre code {
-  white-space: pre-wrap;
-  word-break: break-all;
-  overflow-wrap: break-word;
-}
-
-pre {
-  border: 1px solid #eee;
-}
-
-pre .img, pre .r-plt {
-  margin: 5px 0;
-}
-
-pre .img img, pre .r-plt img {
-  background-color: #fff;
-}
-
-code a, pre a {
-  color: #375f84;
-}
-
-a.sourceLine:hover {
-  text-decoration: none;
-}
-
-.fl      {color: #1514b5;}
-.fu      {color: #000000;} /* function */
-.ch,.st  {color: #036a07;} /* string */
-.kw      {color: #264D66;} /* keyword */
-.co      {color: #888888;} /* comment */
-
-.error   {font-weight: bolder;}
-.warning {font-weight: bolder;}
-
-/* Clipboard --------------------------*/
-
-.hasCopyButton {
-  position: relative;
-}
-
-.btn-copy-ex {
-  position: absolute;
-  right: 0;
-  top: 0;
-  visibility: hidden;
-}
-
-.hasCopyButton:hover button.btn-copy-ex {
-  visibility: visible;
-}
-
-/* headroom.js ------------------------ */
-
-.headroom {
-  will-change: transform;
-  transition: transform 200ms linear;
-}
-.headroom--pinned {
-  transform: translateY(0%);
-}
-.headroom--unpinned {
-  transform: translateY(-100%);
-}
-
-/* mark.js ----------------------------*/
-
-mark {
-  background-color: rgba(255, 255, 51, 0.5);
-  border-bottom: 2px solid rgba(255, 153, 51, 0.3);
-  padding: 1px;
-}
-
-/* vertical spacing after htmlwidgets */
-.html-widget {
-  margin-bottom: 10px;
-}
-
-/* fontawesome ------------------------ */
-
-.fab {
-    font-family: "Font Awesome 5 Brands" !important;
-}
-
-/* don't display links in code chunks when printing */
-/* source: https://stackoverflow.com/a/10781533 */
-@media print {
-  code a:link:after, code a:visited:after {
-    content: "";
-  }
-}
-
-/* Section anchors ---------------------------------
-   Added in pandoc 2.11: https://github.com/jgm/pandoc-templates/commit/9904bf71
-*/
-
-div.csl-bib-body { }
-div.csl-entry {
-  clear: both;
-}
-.hanging-indent div.csl-entry {
-  margin-left:2em;
-  text-indent:-2em;
-}
-div.csl-left-margin {
-  min-width:2em;
-  float:left;
-}
-div.csl-right-inline {
-  margin-left:2em;
-  padding-left:1em;
-}
-div.csl-indent {
-  margin-left: 2em;
-}
diff --git a/dev/pkgdown.js b/dev/pkgdown.js
index 6f0eee40b..9757bf9ef 100644
--- a/dev/pkgdown.js
+++ b/dev/pkgdown.js
@@ -2,83 +2,43 @@
 (function($) {
   $(function() {
 
-    $('.navbar-fixed-top').headroom();
+    $('nav.navbar').headroom();
 
-    $('body').css('padding-top', $('.navbar').height() + 10);
-    $(window).resize(function(){
-      $('body').css('padding-top', $('.navbar').height() + 10);
+    Toc.init({
+      $nav: $("#toc"),
+      $scope: $("main h2, main h3, main h4, main h5, main h6")
     });
 
-    $('[data-toggle="tooltip"]').tooltip();
-
-    var cur_path = paths(location.pathname);
-    var links = $("#navbar ul li a");
-    var max_length = -1;
-    var pos = -1;
-    for (var i = 0; i < links.length; i++) {
-      if (links[i].getAttribute("href") === "#")
-        continue;
-      // Ignore external links
-      if (links[i].host !== location.host)
-        continue;
-
-      var nav_path = paths(links[i].pathname);
-
-      var length = prefix_length(nav_path, cur_path);
-      if (length > max_length) {
-        max_length = length;
-        pos = i;
-      }
-    }
-
-    // Add class to parent 
    • , and enclosing 
    •  if in dropdown
-    if (pos >= 0) {
-      var menu_anchor = $(links[pos]);
-      menu_anchor.parent().addClass("active");
-      menu_anchor.closest("li.dropdown").addClass("active");
-    }
-  });
-
-  function paths(pathname) {
-    var pieces = pathname.split("/");
-    pieces.shift(); // always starts with /
-
-    var end = pieces[pieces.length - 1];
-    if (end === "index.html" || end === "")
-      pieces.pop();
-    return(pieces);
-  }
-
-  // Returns -1 if not found
-  function prefix_length(needle, haystack) {
-    if (needle.length > haystack.length)
-      return(-1);
-
-    // Special case for length-0 haystack, since for loop won't run
-    if (haystack.length === 0) {
-      return(needle.length === 0 ? 0 : -1);
+    if ($('#toc').length) {
+      $('body').scrollspy({
+        target: '#toc',
+        offset: $("nav.navbar").outerHeight() + 1
+      });
     }
 
-    for (var i = 0; i < haystack.length; i++) {
-      if (needle[i] != haystack[i])
-        return(i);
-    }
+    // Activate popovers
+    $('[data-bs-toggle="popover"]').popover({
+      container: 'body',
+      html: true,
+      trigger: 'focus',
+      placement: "top",
+      sanitize: false,
+    });
 
-    return(haystack.length);
-  }
+    $('[data-bs-toggle="tooltip"]').tooltip();
 
   /* Clipboard --------------------------*/
 
   function changeTooltipMessage(element, msg) {
-    var tooltipOriginalTitle=element.getAttribute('data-original-title');
-    element.setAttribute('data-original-title', msg);
+    var tooltipOriginalTitle=element.getAttribute('data-bs-original-title');
+    element.setAttribute('data-bs-original-title', msg);
     $(element).tooltip('show');
-    element.setAttribute('data-original-title', tooltipOriginalTitle);
+    element.setAttribute('data-bs-original-title', tooltipOriginalTitle);
   }
 
   if(ClipboardJS.isSupported()) {
     $(document).ready(function() {
-      var copyButton = "";
+      var copyButton = "";
 
       $("div.sourceCode").addClass("hasCopyButton");
 
@@ -89,20 +49,106 @@
       $('.btn-copy-ex').tooltip({container: 'body'});
 
       // Initialize clipboard:
-      var clipboardBtnCopies = new ClipboardJS('[data-clipboard-copy]', {
+      var clipboard = new ClipboardJS('[data-clipboard-copy]', {
         text: function(trigger) {
           return trigger.parentNode.textContent.replace(/\n#>[^\n]*/g, "");
         }
       });
 
-      clipboardBtnCopies.on('success', function(e) {
+      clipboard.on('success', function(e) {
         changeTooltipMessage(e.trigger, 'Copied!');
         e.clearSelection();
       });
 
-      clipboardBtnCopies.on('error', function() {
+      clipboard.on('error', function(e) {
         changeTooltipMessage(e.trigger,'Press Ctrl+C or Command+C to copy');
       });
+
     });
   }
+
+    /* Search marking --------------------------*/
+    var url = new URL(window.location.href);
+    var toMark = url.searchParams.get("q");
+    var mark = new Mark("main#main");
+    if (toMark) {
+      mark.mark(toMark, {
+        accuracy: {
+          value: "complementary",
+          limiters: [",", ".", ":", "/"],
+        }
+      });
+    }
+
+  /* Search --------------------------*/
+  /* Adapted from https://github.com/rstudio/bookdown/blob/2d692ba4b61f1e466c92e78fd712b0ab08c11d31/inst/resources/bs4_book/bs4_book.js#L25 */
+    // Initialise search index on focus
+  var fuse;
+  $("#search-input").focus(async function(e) {
+    if (fuse) {
+      return;
+    }
+
+    $(e.target).addClass("loading");
+    var response = await fetch($("#search-input").data("search-index"));
+    var data = await response.json();
+
+    var options = {
+      keys: ["what", "text", "code"],
+      ignoreLocation: true,
+      threshold: 0.1,
+      includeMatches: true,
+      includeScore: true,
+    };
+    fuse = new Fuse(data, options);
+
+    $(e.target).removeClass("loading");
+  });
+
+  // Use algolia autocomplete
+  var options = {
+    autoselect: true,
+    debug: true,
+    hint: false,
+    minLength: 2,
+  };
+  var q;
+async function searchFuse(query, callback) {
+  await fuse;
+
+  var items;
+  if (!fuse) {
+    items = [];
+  } else {
+    q = query;
+    var results = fuse.search(query, { limit: 20 });
+    items = results
+      .filter((x) => x.score <= 0.75)
+      .map((x) => x.item);
+    if (items.length === 0) {
+      items = [{dir:"Sorry 😿",previous_headings:"",title:"No results found.",what:"No results found.",path:window.location.href}];
+    }
+  }
+  callback(items);
+}
+  $("#search-input").autocomplete(options, [
+    {
+      name: "content",
+      source: searchFuse,
+      templates: {
+        suggestion: (s) => {
+          if (s.title == s.what) {
+            return `${s.dir} >	
       ${s.title}
      `;
+          } else if (s.previous_headings == "") {
+            return `${s.dir} >	
       ${s.title}
       > ${s.what}`;
+          } else {
+            return `${s.dir} >	
       ${s.title}
       > ${s.previous_headings} > ${s.what}`;
+          }
+        },
+      },
+    },
+  ]).on('autocomplete:selected', function(event, s) {
+    window.location.href = s.path + "?q=" + q + "#" + s.id;
+  });
+  });
 })(window.jQuery || window.$)
diff --git a/dev/pkgdown.yml b/dev/pkgdown.yml
index 5795cf095..e5a2527fd 100644
--- a/dev/pkgdown.yml
+++ b/dev/pkgdown.yml
@@ -1,5 +1,5 @@
 pandoc: 3.1.11
-pkgdown: 2.0.9
+pkgdown: 2.1.0
 pkgdown_sha: ~
 articles:
   compare-treesets: compare-treesets.html
@@ -11,8 +11,7 @@ articles:
   treespace: treespace.html
   using-distances: using-distances.html
   Using-TreeDist: Using-TreeDist.html
-last_built: 2024-06-27T13:09Z
+last_built: 2024-08-22T15:06Z
 urls:
   reference: https://ms609.github.io/TreeDist/reference
   article: https://ms609.github.io/TreeDist/articles
-
diff --git a/dev/reference/AllSplitPairings.html b/dev/reference/AllSplitPairings.html
index daa5e2946..7a44f64fd 100644
--- a/dev/reference/AllSplitPairings.html
+++ b/dev/reference/AllSplitPairings.html
@@ -1,119 +1,73 @@
 
-Variation of information for all split pairings — AllSplitPairings • TreeDistVariation of information for all split pairings — AllSplitPairings • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Variation of information for all split pairings
      
-    Source: R/Information.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Variation of information for all split pairings
      
+      Source: R/Information.R
+      
      AllSplitPairings.Rd
      
     
      
 
-    
      
+    
      
     
      Calculate the variation of clustering information
 (Meila 2007)
  for each possible pairing of
@@ -122,21 +76,22 @@ 
      Variation of information for all split pairings
      
 tabulating the number of pairings with each similarity.
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      AllSplitPairings(n)
      
     
      
 
-    
      
-    
      Arguments
      
-    
      n
      
+    
      
+    
      Arguments
      
+
+
+
      n
      
 
      Integer specifying the number of leaves in a tree.
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      AllSplitPairings() returns a named vector. The name of each
+    
      
+    
      Value
      
+    
      AllSplitPairings() returns a named vector. The name of each
 element corresponds to a certain variation of information, in bits; the
 value of each element specifies the number of pairings of non-trivial
 splits that give rise to that variation of information.
@@ -144,26 +99,26 @@ 
      Value
      
 AB|CD=CD|AB is considered equivalent to CD|AB=CD|AB (etc), then
 values should be divided by four.
      
     
      
-    
      
-    
      References
      
+    
      
+    
      References
      
     
      Meila M (2007).
-“Comparing clusterings---an information based distance.”
-Journal of Multivariate Analysis, 98(5), 873--895.
+“Comparing clusterings—an information based distance.”
+Journal of Multivariate Analysis, 98(5), 873–895.
 doi:10.1016/j.jmva.2006.11.013
 .

       Smith MR (2020).
 “Information theoretic Generalized Robinson-Foulds metrics for comparing phylogenetic trees.”
-Bioinformatics, 36(20), 5007--5013.
+Bioinformatics, 36(20), 5007–5013.
 doi:10.1093/bioinformatics/btaa614
 .
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
      AllSplitPairings(6)
 #>                0                1 1.33333333333333 1.74837083261218 
 #>              100              480              360              480 
@@ -177,37 +132,23 @@ 
      Examples
      
 #>               90              180 
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/CalculateTreeDistance.html b/dev/reference/CalculateTreeDistance.html
index f448d6c7b..c917df788 100644
--- a/dev/reference/CalculateTreeDistance.html
+++ b/dev/reference/CalculateTreeDistance.html
@@ -1,128 +1,80 @@
 
-Wrapper for tree distance calculations — CalculateTreeDistance • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Wrapper for tree distance calculations
      
-    Source: R/tree_distance_utilities.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Wrapper for tree distance calculations
      
+      Source: R/tree_distance_utilities.R
+      
      CalculateTreeDistance.Rd
      
     
      
 
-    
      
+    
      
     
      Calls tree distance functions from trees or lists of trees
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      CalculateTreeDistance(Func, tree1, tree2 = NULL, reportMatching = FALSE, ...)
      
     
      
 
-    
      
-    
      Arguments
      
-    
      Func
      
+    
      
+    
      Arguments
      
+
+
+
      Func
      
 
      Tree distance function.
      
 
 
-
      tree1, tree2
      
+
      tree1, tree2
      
 
      Trees of class phylo, with leaves labelled identically,
 or lists of such trees to undergo pairwise comparison.  Where implemented,
 tree2 = NULL will compute distances between each pair of trees in the list
@@ -131,52 +83,38 @@ 
      Arguments
      
 .
      
 
 
-
      reportMatching
      
+
      reportMatching
      
 
      Logical specifying whether to return the clade
 matchings as an attribute of the score.
      
 
 
-
      ...
      
+
      ...
      
 
      Additional arguments to Func.
      
 
 
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/ClusteringEntropy.Splits.html b/dev/reference/ClusteringEntropy.Splits.html
new file mode 100644
index 000000000..6e07f63b1
--- /dev/null
+++ b/dev/reference/ClusteringEntropy.Splits.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/ClusteringEntropy.html b/dev/reference/ClusteringEntropy.html
new file mode 100644
index 000000000..6e07f63b1
--- /dev/null
+++ b/dev/reference/ClusteringEntropy.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/ClusteringEntropy.list.html b/dev/reference/ClusteringEntropy.list.html
new file mode 100644
index 000000000..6e07f63b1
--- /dev/null
+++ b/dev/reference/ClusteringEntropy.list.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/ClusteringEntropy.multiPhylo.html b/dev/reference/ClusteringEntropy.multiPhylo.html
new file mode 100644
index 000000000..6e07f63b1
--- /dev/null
+++ b/dev/reference/ClusteringEntropy.multiPhylo.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/ClusteringEntropy.phylo.html b/dev/reference/ClusteringEntropy.phylo.html
new file mode 100644
index 000000000..6e07f63b1
--- /dev/null
+++ b/dev/reference/ClusteringEntropy.phylo.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/ClusteringInfo.Splits.html b/dev/reference/ClusteringInfo.Splits.html
new file mode 100644
index 000000000..6e07f63b1
--- /dev/null
+++ b/dev/reference/ClusteringInfo.Splits.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/ClusteringInfo.html b/dev/reference/ClusteringInfo.html
new file mode 100644
index 000000000..6e07f63b1
--- /dev/null
+++ b/dev/reference/ClusteringInfo.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/ClusteringInfo.list.html b/dev/reference/ClusteringInfo.list.html
new file mode 100644
index 000000000..6e07f63b1
--- /dev/null
+++ b/dev/reference/ClusteringInfo.list.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/ClusteringInfo.multiPhylo.html b/dev/reference/ClusteringInfo.multiPhylo.html
new file mode 100644
index 000000000..6e07f63b1
--- /dev/null
+++ b/dev/reference/ClusteringInfo.multiPhylo.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/ClusteringInfo.phylo.html b/dev/reference/ClusteringInfo.phylo.html
new file mode 100644
index 000000000..6e07f63b1
--- /dev/null
+++ b/dev/reference/ClusteringInfo.phylo.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/ClusteringInfoDist.html b/dev/reference/ClusteringInfoDist.html
new file mode 100644
index 000000000..e5fd28ddf
--- /dev/null
+++ b/dev/reference/ClusteringInfoDist.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/ClusteringInfoDistance.html b/dev/reference/ClusteringInfoDistance.html
new file mode 100644
index 000000000..e5fd28ddf
--- /dev/null
+++ b/dev/reference/ClusteringInfoDistance.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/CompareAll.html b/dev/reference/CompareAll.html
index 0ff86ff20..7370ad44c 100644
--- a/dev/reference/CompareAll.html
+++ b/dev/reference/CompareAll.html
@@ -1,164 +1,115 @@
 
-Distances between each pair of trees — CompareAll • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Distances between each pair of trees
      
-    Source: R/tree_distance_utilities.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Distances between each pair of trees
      
+      Source: R/tree_distance_utilities.R
+      
      CompareAll.Rd
      
     
      
 
-    
      
+    
      
     
      Calculate the distance between each tree in a list, and each other tree
 in the same list.
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      CompareAll(x, Func, FUN.VALUE = Func(x[[1]], x[[1]], ...), ...)
      
     
      
 
-    
      
-    
      Arguments
      
-    
      x
      
+    
      
+    
      Arguments
      
+
+
+
      x
      
 
      List of trees, in the format expected by Func().
      
 
 
-
      Func
      
+
      Func
      
 
      distance function returning distance between two trees,
 e.g. path.dist().
      
 
 
-
      FUN.VALUE
      
+
      FUN.VALUE
      
 
      Format of output of Func(), to be passed to vapply().
 If unspecified, calculated by running Func(x[[1]], x[[1]]).
      
 
 
-
      ...
      
+
      ...
      
 
      Additional parameters to pass to Func().
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      CompareAll() returns a distance matrix of class dist detailing
+    
      
+    
      Value
      
+    
      CompareAll() returns a distance matrix of class dist detailing
 the distance between each pair of trees.
 Identical trees are assumed to have zero distance.
      
     
      
-    
      
-    
      Details
      
+    
      
+    
      Details
      
     
      CompareAll() is not limited to tree comparisons:
 Func can be any symmetric function.
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
      # Generate a list of trees to compare
 library("TreeTools", quietly = TRUE)
 trees <- list(bal1 = BalancedTree(1:8), 
@@ -221,37 +172,23 @@ 
      Examples
      
 #> pec2    2    2    0
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/ConsensusInfo.html b/dev/reference/ConsensusInfo.html
new file mode 100644
index 000000000..6e07f63b1
--- /dev/null
+++ b/dev/reference/ConsensusInfo.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/DifferentPhylogeneticInfo.html b/dev/reference/DifferentPhylogeneticInfo.html
new file mode 100644
index 000000000..e5fd28ddf
--- /dev/null
+++ b/dev/reference/DifferentPhylogeneticInfo.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/DistFromMed.html b/dev/reference/DistFromMed.html
new file mode 100644
index 000000000..dd4934941
--- /dev/null
+++ b/dev/reference/DistFromMed.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/DistanceFromMedian.html b/dev/reference/DistanceFromMedian.html
new file mode 100644
index 000000000..dd4934941
--- /dev/null
+++ b/dev/reference/DistanceFromMedian.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/Entropy.html b/dev/reference/Entropy.html
index a9b681e36..b6453fcae 100644
--- a/dev/reference/Entropy.html
+++ b/dev/reference/Entropy.html
@@ -1,183 +1,121 @@
 
-Entropy in bits — Entropy • TreeDistEntropy in bits — Entropy • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Entropy in bits
      
-    Source: R/tree_distance_utilities.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Entropy in bits
      
+      Source: R/tree_distance_utilities.R
+      
      Entropy.Rd
      
     
      
 
-    
      
+    
      
     
      Calculate the entropy of a vector of probabilities, in bits.
 Probabilities should sum to one.
 Probabilities equalling zero will be ignored.
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      Entropy(...)
      
     
      
 
-    
      
-    
      Arguments
      
-    
      ...
      
+    
      
+    
      Arguments
      
+
+
+
      ...
      
 
      Numerics or numeric vector specifying probabilities of outcomes.
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      Entropy() returns the entropy of the specified probabilities,
+    
      
+    
      Value
      
+    
      Entropy() returns the entropy of the specified probabilities,
 in bits.
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
      Entropy(1/2, 0, 1/2) # = 1
 #> [1] 1
 Entropy(rep(1/4, 4)) # = 2
 #> [1] 2
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/ExpectedVariation.html b/dev/reference/ExpectedVariation.html
new file mode 100644
index 000000000..e5fd28ddf
--- /dev/null
+++ b/dev/reference/ExpectedVariation.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/GeneralizedRF.html b/dev/reference/GeneralizedRF.html
index c38cf88e9..d374bf75b 100644
--- a/dev/reference/GeneralizedRF.html
+++ b/dev/reference/GeneralizedRF.html
@@ -1,120 +1,71 @@
 
-Generalized Robinson–Foulds distance — GeneralizedRF • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Generalized Robinson–Foulds distance
      
-    Source: R/tree_distance.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Generalized Robinson–Foulds distance
      
+      Source: R/tree_distance.R
+      
      GeneralizedRF.Rd
      
     
      
 
-    
      
+    
      
     
      An internal function to calculate Generalized Robinson–Foulds
 distances from splits.
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      GeneralizedRF(
   splits1,
   splits2,
@@ -126,9 +77,11 @@ 
      Generalized Robinson–Foulds distance
      
 )
      
     
      
 
-    
      
-    
      Arguments
      
-    
      splits1, splits2
      
+    
      
+    
      Arguments
      
+
+
+
      splits1, splits2
      
 
      Logical matrices where each row corresponds to a leaf,
 either listed in the same order or bearing identical names (in any sequence),
 and each column corresponds to a split, such that each leaf is identified as
@@ -136,79 +89,63 @@ 
      Arguments
      
 split.
      
 
 
-
      nTip
      
+
      nTip
      
 
      Integer specifying the number of leaves in each split.
      
 
 
-
      PairScorer
      
+
      PairScorer
      
 
      function taking four arguments, splits1, splits2,
 nSplits1, nSplits2, which should return the score of each pair of splits
 in a two-dimensional matrix.  Additional parameters may be specified via
 ....
      
 
 
-
      reportMatching
      
+
      reportMatching
      
 
      Logical specifying whether to return the clade
 matchings as an attribute of the score.
      
 
 
-
      ...
      
+
      ...
      
 
      Additional parameters to PairScorer
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      A numeric value specifying the score of the tree pairs under the
+    
      
+    
      Value
      
+    
      A numeric value specifying the score of the tree pairs under the
 specified pair scorer. If reportMatching = TRUE, attribute also list:
      • matching: which split in splits2 is optimally matched to each split in
 split1 (NA if not matched);
        • 
 
      • pairScores: Calculated scores for each possible matching of each split.
        • 
 
      • matchedSplits: Textual representation of each match
        • 
 
      
-    
      
-    
      Details
      
+    
      
+    
      Details
      
     
      Note that no checks will be made to confirm that splits1 and splits2
 contain the same leaves in the same order.
 This is the responsibility of the calling function.
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/GetParallel.html b/dev/reference/GetParallel.html
new file mode 100644
index 000000000..127a223d8
--- /dev/null
+++ b/dev/reference/GetParallel.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/InfoRobinsonFoulds.html b/dev/reference/InfoRobinsonFoulds.html
new file mode 100644
index 000000000..c69ea0e41
--- /dev/null
+++ b/dev/reference/InfoRobinsonFoulds.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/InfoRobinsonFouldsSplits.html b/dev/reference/InfoRobinsonFouldsSplits.html
new file mode 100644
index 000000000..c69ea0e41
--- /dev/null
+++ b/dev/reference/InfoRobinsonFouldsSplits.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/Islands-1.png b/dev/reference/Islands-1.png
new file mode 100644
index 000000000..28053d111
Binary files /dev/null and b/dev/reference/Islands-1.png differ
diff --git a/dev/reference/Islands-2.png b/dev/reference/Islands-2.png
new file mode 100644
index 000000000..ca7668d01
Binary files /dev/null and b/dev/reference/Islands-2.png differ
diff --git a/dev/reference/Islands.html b/dev/reference/Islands.html
new file mode 100644
index 000000000..ebc5b83f8
--- /dev/null
+++ b/dev/reference/Islands.html
@@ -0,0 +1,199 @@
+
+Find islands from distance matrix — Islands • TreeDist
+    Skip to contents
+
+
+    
      
+
      
+  
      
+
+      
      Find islands from distance matrix
      
+      Source: R/Islands.R
+      
      Islands.Rd
      
+    
      
+
+    
      
+    
      Islands() assigns a set of objects to islands, such that all elements
+within an island can form a connected graph in which each edge is no longer
+than threshold distance units Silva AS, Wilkinson M (2021).
+“On Defining and Finding Islands of Trees and Mitigating Large Island Bias.”
+Systematic Biology, 70(6), 1282–1294.
+doi:10.1093/sysbio/syab015
+.
+.
      
+    
      
+
+    
      
+    
      Usage
      
+    
      Islands(D, threshold, dense = TRUE, smallest = 0)
      
+    
      
+
+    
      
+    
      Arguments
      
+
+
+
      D
      
+
      Square matrix or dist object containing Euclidean distances
+between data points.
      
+
+
+
      threshold
      
+
      Elements greater than threshold distance units will not be
+assigned to the same island.
      
+
+
+
      dense
      
+
      Logical; if FALSE, each island will be named according to the
+index of its lowest-indexed member; if TRUE, each island will be numbered
+sequentially from 1, ordered by the index of the lowest-indexed member.
      
+
+
+
      smallest
      
+
      Integer; Islands comprising no more than smallest elements
+will be assigned to island NA.
      
+
+
      
+    
      
+    
      Value
      
+    
      Islands() returns a vector listing the island to which
+each element is assigned.
      
+    
      
+    
      
+    
      References
      
+    
      There are no references for Rd macro \insertAllCites on this help page.
      
+    
      
+    
      
+    
      See also
      
+    
      Other tree space functions:
+MSTSegments(),
+MapTrees(),
+MappingQuality(),
+SpectralEigens(),
+cluster-statistics,
+median.multiPhylo()
      
+    
      
+    
      
+    
      Author
      
+    
      Martin R. Smith
+(martin.smith@durham.ac.uk)
      
+    
      
+
+    
      
+    
      Examples
      
+    
      library("TreeTools", quietly = TRUE)
+# Generate a set of trees
+trees <- as.phylo(as.TreeNumber(BalancedTree(16)) + c(-(40:20), 70:105), 16)
+
+# Calculate distances between trees
+distances <- ClusteringInfoDist(trees)
+summary(distances)
+#>    Min. 1st Qu.  Median    Mean 3rd Qu.    Max. 
+#>  0.8997  2.8945  4.5822  4.3967  6.1634  7.0885 
+
+# Assign trees to islands
+isle <- Islands(distances, quantile(distances, 0.1))
+table(isle)
+#> isle
+#>  1  2  3 
+#> 12  9 36 
+
+# Indicate island membership on 2D mapping of tree distances
+mapping <- cmdscale(distances, 2)
+plot(mapping, col = isle + 1,
+     asp = 1, # Preserve aspect ratio - do not distort distances
+     ann = FALSE, axes = FALSE, # Don't label axes: dimensions are meaningless)
+     pch = 16 # Plotting character: Filled circle
+)
+
+
+# Compare strict consensus with island consensus trees
+oPar <- par(mfrow = c(2, 2), mai = rep(0.1, 4))
+plot(Consensus(trees), main = "Strict")
+plot(Consensus(trees[isle == 1]), edge.col = 2, main = "Island 1")
+plot(Consensus(trees[isle == 2]), edge.col = 3, main = "Island 2")
+plot(Consensus(trees[isle == 3]), edge.col = 4, main = "Island 3")
+
+
+# Restore graphical parameters
+par(oPar)
+
      
+    
      
+  
      
+
+
+    
      
+
+
+
+
+
+  
+
diff --git a/dev/reference/JaccardRobinsonFoulds.html b/dev/reference/JaccardRobinsonFoulds.html
index 7c6b59db3..f348a8bd5 100644
--- a/dev/reference/JaccardRobinsonFoulds.html
+++ b/dev/reference/JaccardRobinsonFoulds.html
@@ -1,118 +1,71 @@
 
-Jaccard–Robinson–Foulds metric — JaccardRobinsonFoulds • TreeDistJaccard–Robinson–Foulds metric — JaccardRobinsonFoulds • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Jaccard–Robinson–Foulds metric
      
-    Source: R/tree_distance_nye.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Jaccard–Robinson–Foulds metric
      
+      Source: R/tree_distance_nye.R
+      
      JaccardRobinsonFoulds.Rd
      
     
      
 
-    
      
+    
      
     
      Calculate the
 Jaccard–Robinson–Foulds metric
 (Böcker et al. 2013)
@@ -120,7 +73,8 @@ 
      Jaccard–Robinson–Foulds metric
      
 Generalized Robinson–Foulds metric.
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      JaccardRobinsonFoulds(
   tree1,
   tree2 = NULL,
@@ -141,9 +95,11 @@ 
      Jaccard–Robinson–Foulds metric
      
 )
      
     
      
 
-    
      
-    
      Arguments
      
-    
      tree1, tree2
      
+    
      
+    
      Arguments
      
+
+
+
      tree1, tree2
      
 
      Trees of class phylo, with leaves labelled identically,
 or lists of such trees to undergo pairwise comparison.  Where implemented,
 tree2 = NULL will compute distances between each pair of trees in the list
@@ -152,7 +108,7 @@ 
      Arguments
      
 .
      
 
 
-
      k
      
+
      k
      
 
      An arbitrary exponent to which to raise the Jaccard index.
 Integer values greater than one are anticipated by Böcker et al.
 The Nye et al. metric uses k = 1.
@@ -160,18 +116,18 @@ 
      Arguments
      
 metric.
      
 
 
-
      allowConflict
      
+
      allowConflict
      
 
      Logical specifying whether to allow conflicting splits
 to be paired. If FALSE, such pairings will be allocated a similarity
 score of zero.
      
 
 
-
      similarity
      
+
      similarity
      
 
      Logical specifying whether to report the result as a tree
 similarity, rather than a difference.
      
 
 
-
      normalize
      
+
      normalize
      
 
      If a numeric value is provided, this will be used as a
 maximum value against which to rescale results.
 If TRUE, results will be rescaled against a maximum value calculated from
@@ -180,12 +136,12 @@ 
      Arguments
      
 If FALSE, results will not be rescaled.
      
 
 
-
      reportMatching
      
+
      reportMatching
      
 
      Logical specifying whether to return the clade
 matchings as an attribute of the score.
      
 
 
-
      splits1, splits2
      
+
      splits1, splits2
      
 
      Logical matrices where each row corresponds to a leaf,
 either listed in the same order or bearing identical names (in any sequence),
 and each column corresponds to a split, such that each leaf is identified as
@@ -193,20 +149,18 @@ 
      Arguments
      
 split.
      
 
 
-
      nTip
      
+
      nTip
      
 
      (Optional) Integer specifying the number of leaves in each split.
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      JaccardRobinsonFoulds() returns an array of numerics providing the
+    
      
+    
      Value
      
+    
      JaccardRobinsonFoulds() returns an array of numerics providing the
 distances between each  pair of trees in tree1 and tree2,
 or splits1 and splits2.
      
     
      
-    
      
-    
      Details
      
+    
      
+    
      Details
      
     
      In short, the Jaccard–Robinson–Foulds
 metric is a generalized Robinson-Foulds
 metric: it finds the optimal matching that pairs each split in one tree with
@@ -228,9 +182,9 @@ 
      Details
      
 trees hold in common.  Check for unexpected differences in tip labelling
 with setdiff(TipLabels(tree1), TipLabels(tree2)).
      
     
      
-    
      
-    
      Normalization
      
-    
+    
      
+    
      Normalization
      
+
 
 
 
      If normalize = TRUE, then results will be rescaled from zero to one by
@@ -240,26 +194,26 @@ 
      Normalization
      
 present in a pair of trees with n leaves, by specifying
 normalize = n - 3.
      
     
      
-    
      
-    
      References
      
+    
      
+    
      References
      
     
      Böcker S, Canzar S, Klau GW (2013).
 “The generalized Robinson-Foulds metric.”
-In Darling A, Stoye J (eds.), Algorithms in Bioinformatics. WABI 2013. Lecture Notes in Computer Science, vol 8126, 156--169.
+In Darling A, Stoye J (eds.), Algorithms in Bioinformatics. WABI 2013. Lecture Notes in Computer Science, vol 8126, 156–169.
 Springer, Berlin, Heidelberg.
 doi:10.1007/978-3-642-40453-5_13
 .

       Day WHE (1985).
 “Optimal algorithms for comparing trees with labeled leaves.”
-Journal of Classification, 2(1), 7--28.
+Journal of Classification, 2(1), 7–28.
 doi:10.1007/BF01908061
 .

       Nye TMW, Liò P, Gilks WR (2006).
 “A novel algorithm and web-based tool for comparing two alternative phylogenetic trees.”
-Bioinformatics, 22(1), 117--119.
+Bioinformatics, 22(1), 117–119.
 doi:10.1093/bioinformatics/bti720
 .
      
     
      
-    
      
-    
      See also
      
-    
      Other tree distances: 
+    
      
+    
      See also
      
+    
      Other tree distances:
 KendallColijn(),
 MASTSize(),
 MatchingSplitDistance(),
@@ -270,14 +224,14 @@ 
      See also
      
 SPRDist(),
 TreeDistance()
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
      set.seed(2)
 tree1 <- ape::rtree(10)
 tree2 <- ape::rtree(10)
@@ -293,37 +247,23 @@ 
      Examples
      
 
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/JaccardSplitSimilarity.html b/dev/reference/JaccardSplitSimilarity.html
new file mode 100644
index 000000000..24ed360b7
--- /dev/null
+++ b/dev/reference/JaccardSplitSimilarity.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/KCDiameter.html b/dev/reference/KCDiameter.html
new file mode 100644
index 000000000..fb4b9933d
--- /dev/null
+++ b/dev/reference/KCDiameter.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/KCVector.html b/dev/reference/KCVector.html
new file mode 100644
index 000000000..fb4b9933d
--- /dev/null
+++ b/dev/reference/KCVector.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/KMeansPP.html b/dev/reference/KMeansPP.html
index eac642167..0bd5b64b1 100644
--- a/dev/reference/KMeansPP.html
+++ b/dev/reference/KMeansPP.html
@@ -1,5 +1,5 @@
 
-k-means++ clustering — KMeansPP • TreeDistk-means++ clustering — KMeansPP • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      k-means++ clustering
      
-    Source: R/kmeanspp.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      k-means++ clustering
      
+      Source: R/kmeanspp.R
+      
      KMeansPP.Rd
      
     
      
 
-    
      
+    
      
     
      k-means++ clustering (Arthur and Vassilvitskii 2007)
  improves the speed and
 accuracy of standard kmeans clustering
@@ -128,58 +85,61 @@ 
      k-means++ clustering
      
 , but is not implemented here.
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      KMeansPP(x, k = 2, nstart = 10, ...)
      
     
      
 
-    
      
-    
      Arguments
      
-    
      x
      
+    
      
+    
      Arguments
      
+
+
+
      x
      
 
      Numeric matrix of data, or an object that can be coerced to such a
 matrix (such as a numeric vector or a data frame with all numeric columns).
      
 
 
-
      k
      
+
      k
      
 
      Integer specifying the number of clusters, k.
      
 
 
-
      nstart
      
+
      nstart
      
 
      Positive integer specifying how many random sets should be
 chosen
      
 
 
-
      ...
      
+
      ...
      
 
      additional arguments passed to kmeans
      
 
 
      
-    
      
-    
      References
      
+    
      
+    
      References
      
     
      Arthur D, Vassilvitskii S (2007).
 “K-Means++: The Advantages of Careful Seeding.”
-In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms,  SODA '07, 1027--1035.

       Bahmani B, Moseley B, Vattani A, Kumar R, Vassilvitskii S (2012).
+In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms,  SODA '07, 1027–1035.

       Bahmani B, Moseley B, Vattani A, Kumar R, Vassilvitskii S (2012).
 “Scalable K-Means++.”
 arXiv.
 doi:10.48550/arXiv.1203.6402
 , 1203.6402.

       Hartigan JA, Wong MA (1979).
 “Algorithm AS 136: a K-means clustering algorithm.”
-Journal of the Royal Statistical Society. Series C (Applied Statistics), 28(1), 100--108.
+Journal of the Royal Statistical Society. Series C (Applied Statistics), 28(1), 100–108.
 doi:10.2307/2346830
 .
      
     
      
-    
      
-    
      See also
      
+    
      
+    
      See also
      
     
      kmeans
      
-
      Other cluster functions: 
+
      Other cluster functions:
 cluster-statistics
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
      # Generate random points
 set.seed(1)
 x <- cbind(c(rnorm(10, -5), rnorm(5, 1), rnorm(10, 6)),
@@ -196,37 +156,23 @@ 
      Examples
      
 
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/KendallColijn.html b/dev/reference/KendallColijn.html
index 997ee138c..9699b5754 100644
--- a/dev/reference/KendallColijn.html
+++ b/dev/reference/KendallColijn.html
@@ -1,120 +1,71 @@
 
-Kendall–Colijn distance — KendallColijn • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Kendall–Colijn distance
      
-    Source: R/tree_distance_kendall-colijn.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Kendall–Colijn distance
      
+      Source: R/tree_distance_kendall-colijn.R
+      
      KendallColijn.Rd
      
     
      
 
-    
      
+    
      
     
      Calculate the Kendall–Colijn tree distance, a measure related to the
 path difference.
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      KendallColijn(tree1, tree2 = NULL, Vector = KCVector)
 
 KCVector(tree)
@@ -126,9 +77,11 @@ 
      Kendall–Colijn distance
      
 KCDiameter(tree)
      
     
      
 
-    
      
-    
      Arguments
      
-    
      tree1, tree2
      
+    
      
+    
      Arguments
      
+
+
+
      tree1, tree2
      
 
      Trees of class phylo, with leaves labelled identically,
 or lists of such trees to undergo pairwise comparison.  Where implemented,
 tree2 = NULL will compute distances between each pair of trees in the list
@@ -137,7 +90,7 @@ 
      Arguments
      
 .
      
 
 
-
      Vector
      
+
      Vector
      
 
      Function converting a tree to a numeric vector.
      
 
      KCVector, the default, returns the number of edges between the common
 ancestor of each pair of leaves and the root of the tree
@@ -151,27 +104,23 @@ 
      Arguments
      
 ).
      
 
 
-
      tree
      
+
      tree
      
 
      A tree of class phylo.
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      KendallColijn() returns an array of numerics providing the
+    
      
+    
      Value
      
+    
      KendallColijn() returns an array of numerics providing the
 distances between each  pair of trees in tree1 and tree2,
 or splits1 and splits2.
      
-
-
 
      KCDiameter() returns the value of the Kendall & Colijn's (2016)
 metric distance between two pectinate trees with n leaves ordered in
 the opposite direction, which I suggest (without any attempt at a proof) may
 be a useful proxy for the diameter (i.e. maximum value) of the K–C
 metric.
      
     
      
-    
      
-    
      Details
      
+    
      
+    
      Details
      
     
      The Kendall–Colijn distance works by measuring, for each pair of
 leaves, the distance from the most recent common ancestor of those leaves
 and the root node.
@@ -200,9 +149,9 @@ 
      Details
      
 for a suite of common applications (Smith 2022)
 .
      
     
      
-    
      
-    
      Functions
      
-    
+    
      
+    
      Functions
      
+
 
      • KCVector(): Creates a vector that characterises a rooted tree,
 as described in Kendall and Colijn (2016)
 .
        • 
@@ -215,36 +164,36 @@ 
        Functions
        
 Smith (2022)
 .
        
 
      
-    
      
-    
      References
      
+    
      
+    
      References
      
     
      Day WHE (1985).
 “Optimal algorithms for comparing trees with labeled leaves.”
-Journal of Classification, 2(1), 7--28.
+Journal of Classification, 2(1), 7–28.
 doi:10.1007/BF01908061
 .

       Kendall M, Colijn C (2016).
 “Mapping phylogenetic trees to reveal distinct patterns of evolution.”
-Molecular Biology and Evolution, 33(10), 2735--2743.
+Molecular Biology and Evolution, 33(10), 2735–2743.
 doi:10.1093/molbev/msw124
 .

       Smith MR (2020).
 “Information theoretic Generalized Robinson-Foulds metrics for comparing phylogenetic trees.”
-Bioinformatics, 36(20), 5007--5013.
+Bioinformatics, 36(20), 5007–5013.
 doi:10.1093/bioinformatics/btaa614
 .

       Smith MR (2022).
 “Robust analysis of phylogenetic tree space.”
-Systematic Biology, 71(5), 1255--1270.
+Systematic Biology, 71(5), 1255–1270.
 doi:10.1093/sysbio/syab100
 .

       Steel MA, Penny D (1993).
-“Distributions of tree comparison metrics---some new results.”
-Systematic Biology, 42(2), 126--141.
+“Distributions of tree comparison metrics—some new results.”
+Systematic Biology, 42(2), 126–141.
 doi:10.1093/sysbio/42.2.126
 .
      
     
      
-    
      
-    
      See also
      
+    
      
+    
      See also
      
     
      treespace::treeDist
 is a more sophisticated, if more cumbersome, implementation that supports
 lambda > 0, i.e. use of edge lengths in tree comparison.
      
-
      Other tree distances: 
+
      Other tree distances:
 JaccardRobinsonFoulds(),
 MASTSize(),
 MatchingSplitDistance(),
@@ -255,14 +204,14 @@ 
      See also
      
 SPRDist(),
 TreeDistance()
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
      KendallColijn(TreeTools::BalancedTree(8), TreeTools::PectinateTree(8))
 #> [1] 11.48913
 
@@ -301,37 +250,23 @@ 
      Examples
      
 #> [1] 15.87451 15.87451 15.87451
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/LAPJV.html b/dev/reference/LAPJV.html
index aa7a233bf..f2d2c2213 100644
--- a/dev/reference/LAPJV.html
+++ b/dev/reference/LAPJV.html
@@ -1,141 +1,93 @@
 
-Solve linear assignment problem using LAPJV — LAPJV • TreeDistSolve linear assignment problem using LAPJV — LAPJV • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Solve linear assignment problem using LAPJV
      
-    Source: R/lap.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Solve linear assignment problem using LAPJV
      
+      Source: R/lap.R
+      
      LAPJV.Rd
      
     
      
 
-    
      
+    
      
     
      Use the algorithm of Jonker and Volgenant (1987)
  to solve the
 Linear Sum Assignment Problem (LSAP).
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      LAPJV(x)
      
     
      
 
-    
      
-    
      Arguments
      
-    
      x
      
+    
      
+    
      Arguments
      
+
+
+
      x
      
 
      Matrix of costs.
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      LAPJV() returns a list with two entries: score, the score of the
+    
      
+    
      Value
      
+    
      LAPJV() returns a list with two entries: score, the score of the
 optimal matching;
 and matching, the columns matched to each row of the matrix in turn.
      
     
      
-    
      
-    
      Details
      
+    
      
+    
      Details
      
     
      The Linear Assignment Problem seeks to match each row of a matrix with a
 column, such that the cost of the matching is minimized.
      
 
      The Jonker & Volgenant approach is a faster alternative to the Hungarian
@@ -145,43 +97,43 @@ 
      Details
      
 
      Note: the JV algorithm expects integers. In order to apply the function
 to a non-integer n, as in the tree distance calculations in this package,
 each n is multiplied by the largest available integer before applying
-the JV algorithm.  If two values of n exhibit a trivial difference --
-e.g. due to floating point errors -- then this can lead to interminable
+the JV algorithm.  If two values of n exhibit a trivial difference –
+e.g. due to floating point errors – then this can lead to interminable
 run times.  (If numbers of the magnitude of billions differ only in their
 last significant digit, then the JV algorithm may undergo billions of
 iterations.)  To avoid this, integers over 2^22 that differ by a value of
 8 or less are treated as equal.
      
     
      
-    
      
-    
      References
      
+    
      
+    
      References
      
     
      Jonker R, Volgenant A (1987).
 “A shortest augmenting path algorithm for dense and sparse linear assignment problems.”
-Computing, 38, 325--340.
+Computing, 38, 325–340.
 doi:10.1007/BF02278710
 .

       Munkres J (1957).
 “Algorithms for the assignment and transportation problems.”
-Journal of the Society for Industrial and Applied Mathematics, 5(1), 32--38.
+Journal of the Society for Industrial and Applied Mathematics, 5(1), 32–38.
 doi:10.1137/0105003
 .
      
     
      
-    
      
-    
      See also
      
+    
      
+    
      See also
      
     
      Implementations of the Hungarian algorithm exist in adagio,
 RcppHungarian, and clue and lpSolve; for larger matrices,
 these are substantially slower. (See discussion at Stack Overflow.)
      
 
      The JV algorithm is implemented for square matrices in the Bioconductor
 package GraphAlignment::LinearAssignment().
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      C++ code
 by Roy Jonker, MagicLogic Optimization Inc. roy_jonker@magiclogic.com,
 with contributions from Yong Yang yongyanglink@gmail.com, after
 Yi Cao
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
      problem <- matrix(c(7, 9, 8, 9, 9,
                     2, 8, 5, 7, 9,
                     1, 6, 6, 9, 9,
@@ -196,37 +148,23 @@ 
      Examples
      
 #> 
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/LnTreesConsistentWithTwoSplits.html b/dev/reference/LnTreesConsistentWithTwoSplits.html
new file mode 100644
index 000000000..71bf81223
--- /dev/null
+++ b/dev/reference/LnTreesConsistentWithTwoSplits.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/Log2TreesConsistentWithTwoSplits.html b/dev/reference/Log2TreesConsistentWithTwoSplits.html
new file mode 100644
index 000000000..71bf81223
--- /dev/null
+++ b/dev/reference/Log2TreesConsistentWithTwoSplits.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/MASTInfo.html b/dev/reference/MASTInfo.html
new file mode 100644
index 000000000..d26a0cfbb
--- /dev/null
+++ b/dev/reference/MASTInfo.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/MASTSize.html b/dev/reference/MASTSize.html
index 72f98af97..e6711503f 100644
--- a/dev/reference/MASTSize.html
+++ b/dev/reference/MASTSize.html
@@ -1,121 +1,77 @@
 
-Maximum Agreement Subtree size — MASTSize • TreeDistMaximum Agreement Subtree size — MASTSize • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Maximum Agreement Subtree size
      
-    Source: R/tree_distance_mast.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Maximum Agreement Subtree size
      
+      Source: R/tree_distance_mast.R
+      
      MASTSize.Rd
      
     
      
 
-    
      
+    
      
     
      Calculate the size or phylogenetic information content
 (Steel and Penny 2006)
 
@@ -126,53 +82,52 @@ 
      Maximum Agreement Subtree size
      
 .
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      MASTSize(tree1, tree2 = tree1, rooted = TRUE)
 
 MASTInfo(tree1, tree2 = tree1, rooted = TRUE)
      
     
      
 
-    
      
-    
      Arguments
      
-    
      tree1, tree2
      
+    
      
+    
      Arguments
      
+
+
+
      tree1, tree2
      
 
      Trees of class phylo, or lists of such trees to undergo
 pairwise comparison.
      
 
 
-
      rooted
      
+
      rooted
      
 
      Logical specifying whether to treat the trees as rooted.
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      MASTSize() returns an integer specifying the number of leaves in
+    
      
+    
      Value
      
+    
      MASTSize() returns an integer specifying the number of leaves in
 the maximum agreement subtree.
      
-
-
 
      MASTInfo() returns a vector or matrix listing the phylogenetic
 information content, in bits, of the maximum agreement subtree.
      
     
      
-    
      
-    
      Details
      
+    
      
+    
      Details
      
     
      Implemented for trees with up to 4096 tips.  Contact the maintainer if you
 need to process larger trees.
      
     
      
-    
      
-    
      References
      
+    
      
+    
      References
      
     
      Steel MA, Penny D (2006).
 “Maximum parsimony and the phylogenetic information in multistate characters.”
-In Albert VA (ed.), Parsimony, Phylogeny, and Genomics, 163--178.
+In Albert VA (ed.), Parsimony, Phylogeny, and Genomics, 163–178.
 Oxford University Press, Oxford.

       Valiente G (2009).
 Combinatorial Pattern Matching Algorithms in Computational Biology using Perl and R,  CRC Mathematical and Computing Biology Series.
 CRC Press, Boca Raton.
      
     
      
-    
      
-    
      See also
      
+    
      
+    
      See also
      
     
      phangorn::mast(), a slower implementation that also lists the
 leaves contained within the subtree.
      
-
      Other tree distances: 
+
      Other tree distances:
 JaccardRobinsonFoulds(),
 KendallColijn(),
 MatchingSplitDistance(),
@@ -183,14 +138,14 @@ 
      See also
      
 SPRDist(),
 TreeDistance()
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
       # for as.phylo, BalancedTree, PectinateTree:
 library("TreeTools", quietly = TRUE)
 
@@ -236,37 +191,23 @@ 
      Examples
      
 #> 5  9.884171 13.343602  9.884171 13.343602          
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/MSTSegments.html b/dev/reference/MSTSegments.html
index 53134a27b..b1fddb07f 100644
--- a/dev/reference/MSTSegments.html
+++ b/dev/reference/MSTSegments.html
@@ -1,119 +1,73 @@
 
-Add minimum spanning tree to plot, colouring by stress — MSTSegments • TreeDistAdd minimum spanning tree to plot, colouring by stress — MSTSegments • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Add minimum spanning tree to plot, colouring by stress
      
-    Source: R/MSTSegments.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Add minimum spanning tree to plot, colouring by stress
      
+      Source: R/MSTSegments.R
+      
      MSTSegments.Rd
      
     
      
 
-    
      
+    
      
     
      To identify strain in a multidimensional scaling of distances, it can be
 useful to plot a minimum spanning tree
 (Gower 1966; Smith 2022)
@@ -122,7 +76,8 @@ 
      Add minimum spanning tree to plot, colouring by stress
      
 stretched or compressed.
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      MSTSegments(mapping, mstEnds, ...)
 
 StrainCol(
@@ -133,71 +88,72 @@ 
      Add minimum spanning tree to plot, colouring by stress
      
 )
      
     
      
 
-    
      
-    
      Arguments
      
-    
      mapping
      
+    
      
+    
      Arguments
      
+
+
+
      mapping
      
 
      Two-column matrix giving x and y coordinates of plotted
 points.
      
 
 
-
      mstEnds
      
+
      mstEnds
      
 
      Two-column matrix identifying rows of mapping at end of
 each edge of the MST, as output by TreeTools::MSTEdges().
      
 
 
-
      ...
      
+
      ...
      
 
      Additional arguments to segments().
      
 
 
-
      distances
      
+
      distances
      
 
      Matrix or dist object giving original distances between
 each pair of points.
      
 
 
-
      palette
      
+
      palette
      
 
      Vector of colours with which to colour edges.
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      StrainCol() returns a vector in which each entry is selected from
+    
      
+    
      Value
      
+    
      StrainCol() returns a vector in which each entry is selected from
 palette, with an attribute logStrain denoting the logarithm of the
 mapped over original distance, shifted such that the median value is zero.
 Palette colours are assigned centred on the median value, with entries
 early in palette assigned to edges in which the ratio of mapped
 distance to original distance is small.
      
     
      
-    
      
-    
      References
      
+    
      
+    
      References
      
     
      Gower JC (1966).
 “Some distance properties of latent root and vector methods used in multivariate analysis.”
-Biometrika, 53(3/4), 325--338.
+Biometrika, 53(3/4), 325–338.
 doi:10.2307/2333639
 .

       Smith MR (2022).
 “Robust analysis of phylogenetic tree space.”
-Systematic Biology, 71(5), 1255--1270.
+Systematic Biology, 71(5), 1255–1270.
 doi:10.1093/sysbio/syab100
 .
      
     
      
-    
      
-    
      See also
      
-    
      Other tree space functions: 
+    
      
+    
      See also
      
+    
      Other tree space functions:
+Islands(),
 MapTrees(),
 MappingQuality(),
 SpectralEigens(),
 cluster-statistics,
 median.multiPhylo()
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
      set.seed(0)
 library("TreeTools", quietly = TRUE)
 distances <- ClusteringInfoDist(as.phylo(5:16, 8))
@@ -222,37 +178,23 @@ 
      Examples
      
 
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/MapTrees.html b/dev/reference/MapTrees.html
index a3817a828..cf57e5779 100644
--- a/dev/reference/MapTrees.html
+++ b/dev/reference/MapTrees.html
@@ -1,127 +1,78 @@
 
-Graphical user interface for mapping distances and analysing tree space — MapTrees • TreeDist
-    
+
+    Skip to contents
 
-    
      
-      
      
+
      
+
      
+  
      
 
-      
      
-  
      
-    
      
-    
      Graphical user interface for mapping distances and analysing tree space
      
-    Source: R/shiny.R
-    
+      
      Graphical user interface for mapping distances and analysing tree space
      
+      Source: R/shiny.R
+      
      MapTrees.Rd
      
     
      
 
-    
      
+    
      
     
      MapTrees() launches a "Shiny" application for the visualization and
 evaluation of tree spaces.
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      MapTrees()
 
 Project()
      
     
      
 
-    
      
-    
      Input tab
      
+    
      
+    
      Input tab
      
     
      The input tab allows for the upload of sets of phylogenetic trees from file.
 Trees at the start or end of a file can be excluded, and the number of trees
 can be brought down to a manageable number by uniformly subsampling every
@@ -129,8 +80,8 @@ 
      Input tab
      
 analysis of larger samples will take longer, particularly with slower
 methods (e.g. quartet distances; Kruskal-1 MDS; large minimum spanning trees).
      
 
      Different batches can be plotted with different colours / symbols.
      
-
      If each tree is associated with a property -- for example, the data or method
-used to generate it, or its stratigraphic congruence -- a list of properties
+
      If each tree is associated with a property – for example, the data or method
+used to generate it, or its stratigraphic congruence – a list of properties
 for each tree, with one entry per line/row, can be uploaded along with
 the trees.  Points in tree space can then be styled according to the
 corresponding property.
      
@@ -140,12 +91,12 @@ 
      Input tab
      
 one file will be applied to all trees, in the sequence that they were added
 to memory.
      
     
      
-    
      
-    
      Analysis tab
      
+    
      
+    
      Analysis tab
      
     
      Select from a suite of distance methods: clustering information and
 phylogenetic information are quick and satisfactory; quartet is slow but
 gives slightly better mappings; path is very fast but may not reflect
-evolutionary signal very well; and Robinson--Foulds should probably never
+evolutionary signal very well; and Robinson–Foulds should probably never
 be used for analysis; it is included for comparison purposes.
      
 
      Principle components mappings should suffice for most purposes;
 Sammon and Kruskal mappings are slower and seldom differ by much,
@@ -160,10 +111,10 @@ 
      Analysis tab
      
 Clusterings with silhouette coefficients < 0.25 are unlikely to represent
 genuine structure and are not reported or depicted.
      
     
      
-    
      
-    
      Display tab
      
-    
      Up to 15 dimensions can be depicted; the quality of a mapping -- that is,
-the faithfulness of mapped distances to true tree-to-tree distances --
+    
      
+    
      Display tab
      
+    
      Up to 15 dimensions can be depicted; the quality of a mapping – that is,
+the faithfulness of mapped distances to true tree-to-tree distances –
 is quantified by the product of the Trustworthiness and Continuity metrics,
 which should exceed 0.9 (at least).
      
 
      An interactive 3D plot can be explored by dragging the mouse and scrolling,
@@ -181,83 +132,70 @@ 
      Display tab
      
 cluster membership or according to the file that contains the tree,
 with each click of "Add to existing" on the input tab constituting a
 new batch with a new symbol.
      
-
      Points can be coloured according to a category -- the cluster or batch to
+
      Points can be coloured according to a category – the cluster or batch to
 which they belong, or custom data provided in the Point Property File
-on the input tab -- or continuously, either by the sequence in which they
+on the input tab – or continuously, either by the sequence in which they
 were added to memory, or according to custom data.
      
     
      
-    
      
-    
      Exporting tree spaces
      
+    
      
+    
      Exporting tree spaces
      
     
      A mapping can be saved to PDF or as a PNG bitmap at the size selected.
      
     
      
-    
      
-    
      References
      
+    
      
+    
      References
      
     
      A list of references employed when constructing the tree space is populated
 according to the methods used; it would be appropriate to cite and briefly
 discuss these studies in any publication using figures generated using
 this application.  The application itself can be cited using
 Smith (2020, 2022)
      
     
      
-    
      
-    
      References
      
+    
      
+    
      References
      
     
      Smith MR (2020).
 “Information theoretic Generalized Robinson-Foulds metrics for comparing phylogenetic trees.”
-Bioinformatics, 36(20), 5007--5013.
+Bioinformatics, 36(20), 5007–5013.
 doi:10.1093/bioinformatics/btaa614
 .

       Smith MR (2022).
 “Robust analysis of phylogenetic tree space.”
-Systematic Biology, 71(5), 1255--1270.
+Systematic Biology, 71(5), 1255–1270.
 doi:10.1093/sysbio/syab100
 .
      
     
      
-    
      
-    
      See also
      
+    
      
+    
      See also
      
     
      Full detail of tree space analysis in R is provided in the accompanying
 vignette.
      
-
      Other tree space functions: 
+
      Other tree space functions:
+Islands(),
 MSTSegments(),
 MappingQuality(),
 SpectralEigens(),
 cluster-statistics,
 median.multiPhylo()
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-  
      
-  
-
      
+  
      
 
 
-      
      
+
+
+
+
 
-  
-
+  
 
diff --git a/dev/reference/MappingQuality.html b/dev/reference/MappingQuality.html
index b4b1bf289..588cd5c26 100644
--- a/dev/reference/MappingQuality.html
+++ b/dev/reference/MappingQuality.html
@@ -1,187 +1,142 @@
 
-Faithfulness of mapped distances — MappingQuality • TreeDistFaithfulness of mapped distances — MappingQuality • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Faithfulness of mapped distances
      
-    Source: R/trustworthiness.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Faithfulness of mapped distances
      
+      Source: R/trustworthiness.R
+      
      MappingQuality.Rd
      
     
      
 
-    
      
+    
      
     
      MappingQuality() calculates the trustworthiness and continuity
 of mapped distances (Venna and Kaski 2001; Kaski et al. 2003)
 .
-Trustworthiness measures, on a scale from 0--1,
+Trustworthiness measures, on a scale from 0–1,
 the degree to which points that are nearby in a mapping are truly close
 neighbours; continuity, the extent to which points that are truly nearby
 retain their close spatial proximity in a mapping.
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      MappingQuality(original, mapped, neighbours = 10L)
 
 ProjectionQuality(original, mapped, neighbours = 10L)
      
     
      
 
-    
      
-    
      Arguments
      
-    
      original, mapped
      
+    
      
+    
      Arguments
      
+
+
+
      original, mapped
      
 
      Square matrix or dist object containing
 original / mapped pairwise distances.
      
 
 
-
      neighbours
      
+
      neighbours
      
 
      Integer specifying number of nearest neighbours to use in
 calculation.  This should typically be small relative to the number of
 points.
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      MappingQuality() returns a named vector of length four,
-containing the entries: Trustworthiness, Continuity, TxC
      
-
-
-
      (the product of these values), and sqrtTxC (its square root).
      
+    
      
+    
      Value
      
+    
      MappingQuality() returns a named vector of length four,
+containing the entries: Trustworthiness, Continuity, TxC
+(the product of these values), and sqrtTxC (its square root).
      
     
      
-    
      
-    
      References
      
+    
      
+    
      References
      
     
      Kaski S, Nikkila J, Oja M, Venna J, Toronen P, Castren E (2003).
 “Trustworthiness and metrics in visualizing similarity of gene expression.”
 BMC Bioinformatics, 4, 48.
 doi:10.1186/1471-2105-4-48
 .

       Venna J, Kaski S (2001).
 “Neighborhood preservation in nonlinear projection methods: an experimental study.”
-In Dorffner G, Bischof H, Hornik K (eds.), Artificial Neural Networks --- ICANN 2001,  Lecture Notes in Computer Science, 485--491.
+In Dorffner G, Bischof H, Hornik K (eds.), Artificial Neural Networks — ICANN 2001,  Lecture Notes in Computer Science, 485–491.
 doi:10.1007/3-540-44668-0_68
 .
      
     
      
-    
      
-    
      See also
      
-    
      Other tree space functions: 
+    
      
+    
      See also
      
+    
      Other tree space functions:
+Islands(),
 MSTSegments(),
 MapTrees(),
 SpectralEigens(),
 cluster-statistics,
 median.multiPhylo()
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
      library("TreeTools", quietly = TRUE)
 trees <- as.phylo(0:10, nTip = 8)
 distances <- ClusteringInfoDistance(trees)
@@ -191,37 +146,23 @@ 
      Examples
      
 #>       0.7929293       0.8737374       0.6928120       0.8323533 
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/MatchingSplitDistance.html b/dev/reference/MatchingSplitDistance.html
index 89b534894..2417db625 100644
--- a/dev/reference/MatchingSplitDistance.html
+++ b/dev/reference/MatchingSplitDistance.html
@@ -1,124 +1,77 @@
 
-Matching Split Distance — MatchingSplitDistance • TreeDistMatching Split Distance — MatchingSplitDistance • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Matching Split Distance
      
-    Source: R/tree_distance_msd.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Matching Split Distance
      
+      Source: R/tree_distance_msd.R
+      
      MatchingSplitDistance.Rd
      
     
      
 
-    
      
+    
      
     
      Calculate the
 Matching Split Distance
 (Bogdanowicz and Giaro 2012; Lin et al. 2012)
  for unrooted binary trees.
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      MatchingSplitDistance(
   tree1,
   tree2 = NULL,
@@ -135,9 +88,11 @@ 
      Matching Split Distance
      
 )
      
     
      
 
-    
      
-    
      Arguments
      
-    
      tree1, tree2
      
+    
      
+    
      Arguments
      
+
+
+
      tree1, tree2
      
 
      Trees of class phylo, with leaves labelled identically,
 or lists of such trees to undergo pairwise comparison.  Where implemented,
 tree2 = NULL will compute distances between each pair of trees in the list
@@ -146,7 +101,7 @@ 
      Arguments
      
 .
      
 
 
-
      normalize
      
+
      normalize
      
 
      If a numeric value is provided, this will be used as a
 maximum value against which to rescale results.
 If TRUE, results will be rescaled against a maximum value calculated from
@@ -155,12 +110,12 @@ 
      Arguments
      
 If FALSE, results will not be rescaled.
      
 
 
-
      reportMatching
      
+
      reportMatching
      
 
      Logical specifying whether to return the clade
 matchings as an attribute of the score.
      
 
 
-
      splits1, splits2
      
+
      splits1, splits2
      
 
      Logical matrices where each row corresponds to a leaf,
 either listed in the same order or bearing identical names (in any sequence),
 and each column corresponds to a split, such that each leaf is identified as
@@ -168,27 +123,25 @@ 
      Arguments
      
 split.
      
 
 
-
      nTip
      
+
      nTip
      
 
      (Optional) Integer specifying the number of leaves in each split.
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      MatchingSplitDistance() returns an array of numerics providing the
+    
      
+    
      Value
      
+    
      MatchingSplitDistance() returns an array of numerics providing the
 distances between each  pair of trees in tree1 and tree2,
 or splits1 and splits2.
      
     
      
-    
      
-    
      Details
      
+    
      
+    
      Details
      
     
      Trees need not contain identical leaves; scores are based on the leaves that
 trees hold in common.  Check for unexpected differences in tip labelling
 with setdiff(TipLabels(tree1), TipLabels(tree2)).
      
     
      
-    
      
-    
      Normalization
      
-    
+    
      
+    
      Normalization
      
+
 
 
 
      A normalization value or function must be provided in order to return a
@@ -197,25 +150,25 @@ 
      Normalization
      
 creating a GitHub issue
 so that it can be implemented.
      
     
      
-    
      
-    
      References
      
+    
      
+    
      References
      
     
      Bogdanowicz D, Giaro K (2012).
 “Matching split distance for unrooted binary phylogenetic trees.”
-IEEE/ACM Transactions on Computational Biology and Bioinformatics, 9(1), 150--160.
+IEEE/ACM Transactions on Computational Biology and Bioinformatics, 9(1), 150–160.
 doi:10.1109/TCBB.2011.48
 .

       Day WHE (1985).
 “Optimal algorithms for comparing trees with labeled leaves.”
-Journal of Classification, 2(1), 7--28.
+Journal of Classification, 2(1), 7–28.
 doi:10.1007/BF01908061
 .

       Lin Y, Rajan V, Moret BME (2012).
 “A metric for phylogenetic trees based on matching.”
-IEEE/ACM Transactions on Computational Biology and Bioinformatics, 4(9), 1014--1022.
+IEEE/ACM Transactions on Computational Biology and Bioinformatics, 4(9), 1014–1022.
 doi:10.1109/TCBB.2011.157
 .
      
     
      
-    
      
-    
      See also
      
-    
      Other tree distances: 
+    
      
+    
      See also
      
+    
      Other tree distances:
 JaccardRobinsonFoulds(),
 KendallColijn(),
 MASTSize(),
@@ -226,14 +179,14 @@ 
      See also
      
 SPRDist(),
 TreeDistance()
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
      MatchingSplitDistance(lapply(rep(8, 5), ape::rtree), normalize = 16)
 #>        1      2      3      4
 #> 2 0.7500                     
@@ -262,37 +215,23 @@ 
      Examples
      
 
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/MatchingSplitDistanceSplits.html b/dev/reference/MatchingSplitDistanceSplits.html
new file mode 100644
index 000000000..fda9bfc87
--- /dev/null
+++ b/dev/reference/MatchingSplitDistanceSplits.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/MatchingSplitInfo.html b/dev/reference/MatchingSplitInfo.html
new file mode 100644
index 000000000..e5fd28ddf
--- /dev/null
+++ b/dev/reference/MatchingSplitInfo.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/MatchingSplitInfoDistance.html b/dev/reference/MatchingSplitInfoDistance.html
new file mode 100644
index 000000000..e5fd28ddf
--- /dev/null
+++ b/dev/reference/MatchingSplitInfoDistance.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/MatchingSplitInfoSplits.html b/dev/reference/MatchingSplitInfoSplits.html
new file mode 100644
index 000000000..e5fd28ddf
--- /dev/null
+++ b/dev/reference/MatchingSplitInfoSplits.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/MeanCentDist.html b/dev/reference/MeanCentDist.html
new file mode 100644
index 000000000..dd4934941
--- /dev/null
+++ b/dev/reference/MeanCentDist.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/MeanCentroidDist.html b/dev/reference/MeanCentroidDist.html
new file mode 100644
index 000000000..dd4934941
--- /dev/null
+++ b/dev/reference/MeanCentroidDist.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/MeanCentroidDistance.html b/dev/reference/MeanCentroidDistance.html
new file mode 100644
index 000000000..dd4934941
--- /dev/null
+++ b/dev/reference/MeanCentroidDistance.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/MeanMSTEdge.html b/dev/reference/MeanMSTEdge.html
new file mode 100644
index 000000000..dd4934941
--- /dev/null
+++ b/dev/reference/MeanMSTEdge.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/MeanNN.html b/dev/reference/MeanNN.html
new file mode 100644
index 000000000..dd4934941
--- /dev/null
+++ b/dev/reference/MeanNN.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/MeilaMutualInformation.html b/dev/reference/MeilaMutualInformation.html
new file mode 100644
index 000000000..2d44f06cf
--- /dev/null
+++ b/dev/reference/MeilaMutualInformation.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/MeilaVariationOfInformation.html b/dev/reference/MeilaVariationOfInformation.html
index 385e4c812..69038c1a8 100644
--- a/dev/reference/MeilaVariationOfInformation.html
+++ b/dev/reference/MeilaVariationOfInformation.html
@@ -1,173 +1,123 @@
 
-Use variation of clustering information to compare pairs of splits — MeilaVariationOfInformation • TreeDistUse variation of clustering information to compare pairs of splits — MeilaVariationOfInformation • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Use variation of clustering information to compare pairs of splits
      
-    Source: R/Information.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Use variation of clustering information to compare pairs of splits
      
+      Source: R/Information.R
+      
      MeilaVariationOfInformation.Rd
      
     
      
 
-    
      
+    
      
     
      Compare a pair of splits viewed as clusterings of taxa, using the variation
 of clustering information proposed by (Meila 2007)
 .
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      MeilaVariationOfInformation(split1, split2)
 
 MeilaMutualInformation(split1, split2)
      
     
      
 
-    
      
-    
      Arguments
      
-    
      split1, split2
      
+    
      
+    
      Arguments
      
+
+
+
      split1, split2
      
 
      Logical vectors listing leaves in a consistent order,
 identifying each leaf as a member of the ingroup (TRUE) or outgroup
 (FALSE) of the split in question.
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      MeilaVariationOfInformation() returns the variation of (clustering)
+    
      
+    
      Value
      
+    
      MeilaVariationOfInformation() returns the variation of (clustering)
 information, measured in bits.
      
-
-
 
      MeilaMutualInformation() returns the mutual information,
 measured in bits.
      
     
      
-    
      
-    
      Details
      
+    
      
+    
      Details
      
     
      This is equivalent to the mutual clustering information
 (Vinh et al. 2010)
 .
 For the total information content, multiply the VoI by the number of leaves.
      
     
      
-    
      
-    
      References
      
+    
      
+    
      References
      
     
      Meila M (2007).
-“Comparing clusterings---an information based distance.”
-Journal of Multivariate Analysis, 98(5), 873--895.
+“Comparing clusterings—an information based distance.”
+Journal of Multivariate Analysis, 98(5), 873–895.
 doi:10.1016/j.jmva.2006.11.013
 .

       Vinh NX, Epps J, Bailey J (2010).
 “Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance.”
-Journal of Machine Learning Research, 11, 2837--2854.
+Journal of Machine Learning Research, 11, 2837–2854.
 doi:10.1145/1553374.1553511
 .
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
      # Maximum variation = information content of each split separately
 A <- TRUE
 B <- FALSE
@@ -194,37 +144,23 @@ 
      Examples
      
 #> [1] 1.203213
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/MutualClusteringInfo.html b/dev/reference/MutualClusteringInfo.html
new file mode 100644
index 000000000..e5fd28ddf
--- /dev/null
+++ b/dev/reference/MutualClusteringInfo.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/MutualClusteringInfoSplits.html b/dev/reference/MutualClusteringInfoSplits.html
new file mode 100644
index 000000000..e5fd28ddf
--- /dev/null
+++ b/dev/reference/MutualClusteringInfoSplits.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/MutualClusteringInformation.html b/dev/reference/MutualClusteringInformation.html
new file mode 100644
index 000000000..e5fd28ddf
--- /dev/null
+++ b/dev/reference/MutualClusteringInformation.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/NNIDiameter.html b/dev/reference/NNIDiameter.html
new file mode 100644
index 000000000..2f8be8ce5
--- /dev/null
+++ b/dev/reference/NNIDiameter.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/NNIDist.html b/dev/reference/NNIDist.html
index 2d8f7fd5d..039341a63 100644
--- a/dev/reference/NNIDist.html
+++ b/dev/reference/NNIDist.html
@@ -1,118 +1,71 @@
 
-Approximate Nearest Neighbour Interchange distance — NNIDist • TreeDistApproximate Nearest Neighbour Interchange distance — NNIDist • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Approximate Nearest Neighbour Interchange distance
      
-    Source: R/tree_distance_nni.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Approximate Nearest Neighbour Interchange distance
      
+      Source: R/tree_distance_nni.R
+      
      NNIDist.Rd
      
     
      
 
-    
      
+    
      
     
      Use the approach of Li et al. (1996)
  to approximate the
 Nearest Neighbour Interchange distance (Robinson 1971)
@@ -120,28 +73,29 @@ 
      Approximate Nearest Neighbour Interchange distance
      
 between phylogenetic trees.
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      NNIDist(tree1, tree2 = tree1)
 
 NNIDiameter(tree)
      
     
      
 
-    
      
-    
      Arguments
      
-    
      tree1, tree2
      
+    
      
+    
      Arguments
      
+
+
+
      tree1, tree2
      
 
      Single trees of class phylo to undergo comparison.
      
 
 
-
      tree
      
+
      tree
      
 
      Object of supported class representing a tree or list of trees,
 or an integer specifying the number of leaves in a tree/trees.
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      NNIDist() returns, for each pair of trees, a named vector
+    
      
+    
      Value
      
+    
      NNIDist() returns, for each pair of trees, a named vector
 containing three integers:
      • lower is a lower bound on the NNI distance, and corresponds
 to the RF distance between the trees.
        • 
 
      • tight_upper is an upper bound on the distance, based on calculated
@@ -166,8 +120,8 @@ 
        Value
        
 
      where n is the number of leaves, and N the number of internal nodes,
 i.e. $$n - 2$$.
      
     
      
-    
      
-    
      Details
      
+    
      
+    
      Details
      
     
      In brief, this approximation algorithm works by identifying edges in one
 tree that do not match edges in the second.  Each of these edges must
 undergo at least one NNI operation in order to reconcile the trees.
@@ -187,26 +141,26 @@ 
      Details
      
 bound, but is unavailable for n > 12.
 NNIDiameter() reports the limits on this bound.
      
 
      Leaves:12345678910111213
      Diameter:00013571012151821?
      
-    
      
-    
      References
      
+    
      
+    
      References
      
     
      Fack V, Lievens S, Van der Jeugt J (2002).
 “On the diameter of the rotation graph of binary coupling trees.”
-Discrete Mathematics, 245(1-3), 1--18.
+Discrete Mathematics, 245(1-3), 1–18.
 doi:10.1016/S0012-365X(01)00418-6
 .

       Li M, Tromp J, Zhang L (1996).
 “Some notes on the nearest neighbour interchange distance.”
-In Goos G, Hartmanis J, Leeuwen J, Cai J, Wong CK (eds.), Computing and Combinatorics, volume 1090, 343--351.
+In Goos G, Hartmanis J, Leeuwen J, Cai J, Wong CK (eds.), Computing and Combinatorics, volume 1090, 343–351.
 Springer, Berlin, Heidelberg.
 ISBN 978-3-540-61332-9 978-3-540-68461-9, doi:10.1007/3-540-61332-3_168
 .

       Robinson DF (1971).
 “Comparison of labeled trees with valency three.”
-Journal of Combinatorial Theory, Series B, 11(2), 105--119.
+Journal of Combinatorial Theory, Series B, 11(2), 105–119.
 doi:10.1016/0095-8956(71)90020-7
 .
      
     
      
-    
      
-    
      See also
      
-    
      Other tree distances: 
+    
      
+    
      See also
      
+    
      Other tree distances:
 JaccardRobinsonFoulds(),
 KendallColijn(),
 MASTSize(),
@@ -217,14 +171,14 @@ 
      See also
      
 SPRDist(),
 TreeDistance()
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
      library("TreeTools", quietly = TRUE)
 
 NNIDist(BalancedTree(7), PectinateTree(7))
@@ -349,37 +303,23 @@ 
      Examples
      
 #> 
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/NormalizeInfo.html b/dev/reference/NormalizeInfo.html
index 2ae97eff0..b14d3ac1c 100644
--- a/dev/reference/NormalizeInfo.html
+++ b/dev/reference/NormalizeInfo.html
@@ -1,122 +1,74 @@
 
-Normalize tree distances — NormalizeInfo • TreeDistNormalize tree distances — NormalizeInfo • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Normalize tree distances
      
-    Source: R/tree_distance_utilities.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Normalize tree distances
      
+      Source: R/tree_distance_utilities.R
+      
      NormalizeInfo.Rd
      
     
      
 
-    
      
+    
      
     
      NormalizeInfo() is an internal function used to normalize information
 against a reference, such as the total information present in a pair of
 trees.
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      NormalizeInfo(
   unnormalized,
   tree1,
@@ -129,44 +81,44 @@ 
      Normalize tree distances
      
 )
      
     
      
 
-    
      
-    
      Arguments
      
-    
      unnormalized
      
+    
      
+    
      Arguments
      
+
+
+
      unnormalized
      
 
      Numeric value, vector or matrix to be normalized.
      
 
 
-
      tree1, tree2
      
+
      tree1, tree2
      
 
      Trees from which unnormalized was calculated.
      
 
 
-
      InfoInTree
      
+
      InfoInTree
      
 
      Function to calculate the information content of each tree.
      
 
 
-
      infoInBoth
      
+
      infoInBoth
      
 
      Optional numeric specifying information content of both
 trees independently. If unspecified (NULL), this will be calculated using
 the method specified by how.
      
 
 
-
      how
      
+
      how
      
 
      Method for normalization, perhaps specified using the normalize
 argument to a tree distance function.  See details for options.
      
 
 
-
      ...
      
+
      ...
      
 
      Additional parameters to InfoInTree() or how().
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      NormalizeInfo() returns an object corresponding to the normalized
+    
      
+    
      Value
      
+    
      NormalizeInfo() returns an object corresponding to the normalized
 values of unnormalized.
      
     
      
-    
      
-    
      Details
      
+    
      
+    
      Details
      
     
      The unnormalized value(s) are normalized by dividing by a denominator
 calculated based on the how parameter.  Valid options include:
      
 
      FALSE
      
@@ -190,14 +142,14 @@ 
      Details
      
 
 
 
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
      library("TreeTools", quietly = TRUE)
 pair1 <- c(BalancedTree(9), StarTree(9))
 pair2 <- c(BalancedTree(9), PectinateTree(9))
@@ -252,37 +204,23 @@ 
      Examples
      
 
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/NyeSimilarity.html b/dev/reference/NyeSimilarity.html
index 454ba993e..8bf173804 100644
--- a/dev/reference/NyeSimilarity.html
+++ b/dev/reference/NyeSimilarity.html
@@ -1,5 +1,5 @@
 
-Nye et al. (2006) tree comparison — NyeSimilarity • TreeDistNye et al. (2006) tree comparison — NyeSimilarity • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Nye et al. (2006) tree comparison
      
-    Source: R/tree_distance_nye.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Nye et al. (2006) tree comparison
      
+      Source: R/tree_distance_nye.R
+      
      NyeSimilarity.Rd
      
     
      
 
-    
      
+    
      
     
      NyeSimilarity() and NyeSplitSimilarity() implement the
 Generalized Robinson–Foulds
 tree comparison metric of Nye et al. (2006)
@@ -130,7 +88,8 @@ 
      Nye et al. (2006) tree comparison
      
 vignettes.
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      NyeSimilarity(
   tree1,
   tree2 = NULL,
@@ -149,9 +108,11 @@ 
      Nye et al. (2006) tree comparison
      
 )
      
     
      
 
-    
      
-    
      Arguments
      
-    
      tree1, tree2
      
+    
      
+    
      Arguments
      
+
+
+
      tree1, tree2
      
 
      Trees of class phylo, with leaves labelled identically,
 or lists of such trees to undergo pairwise comparison.  Where implemented,
 tree2 = NULL will compute distances between each pair of trees in the list
@@ -160,12 +121,12 @@ 
      Arguments
      
 .
      
 
 
-
      similarity
      
+
      similarity
      
 
      Logical specifying whether to report the result as a tree
 similarity, rather than a difference.
      
 
 
-
      normalize
      
+
      normalize
      
 
      If a numeric value is provided, this will be used as a
 maximum value against which to rescale results.
 If TRUE, results will be rescaled against a maximum value calculated from
@@ -174,7 +135,7 @@ 
      Arguments
      
 If FALSE, results will not be rescaled.
      
 
 
-
      normalizeMax
      
+
      normalizeMax
      
 
      When calculating similarity, normalize against the
 maximum number of splits that could have been present (TRUE),
 or the number of splits that were actually observed (FALSE)?
@@ -183,18 +144,18 @@ 
      Arguments
      
 tree.
      
 
 
-
      reportMatching
      
+
      reportMatching
      
 
      Logical specifying whether to return the clade
 matchings as an attribute of the score.
      
 
 
-
      diag
      
+
      diag
      
 
      Logical specifying whether to return similarities along the
 diagonal, i.e. of each tree with itself.  Applies only if tree2 is
 a list identical to tree1, or NULL.
      
 
 
-
      splits1, splits2
      
+
      splits1, splits2
      
 
      Logical matrices where each row corresponds to a leaf,
 either listed in the same order or bearing identical names (in any sequence),
 and each column corresponds to a split, such that each leaf is identified as
@@ -202,20 +163,18 @@ 
      Arguments
      
 split.
      
 
 
-
      nTip
      
+
      nTip
      
 
      (Optional) Integer specifying the number of leaves in each split.
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      NyeSimilarity() returns an array of numerics providing the
+    
      
+    
      Value
      
+    
      NyeSimilarity() returns an array of numerics providing the
 distances between each  pair of trees in tree1 and tree2,
 or splits1 and splits2.
      
     
      
-    
      
-    
      Details
      
+    
      
+    
      Details
      
     
      The measure is defined as a similarity score.  If similarity = FALSE, the
 similarity score will be converted into a distance by doubling it and
 subtracting it from the number of splits present in both trees.
@@ -224,9 +183,9 @@ 
      Details
      
 slightly faster than, JaccardRobinsonFoulds
 (tree1, tree2, k = 1, allowConflict = TRUE).
      
     
      
-    
      
-    
      Normalization
      
-    
+    
      
+    
      Normalization
      
+
 
 
 
      If normalize = TRUE and similarity = TRUE, then results will be rescaled
@@ -245,21 +204,21 @@ 
      Normalization
      
 trees hold in common.  Check for unexpected differences in tip labelling
 with setdiff(TipLabels(tree1), TipLabels(tree2)).
      
     
      
-    
      
-    
      References
      
+    
      
+    
      References
      
     
      Day WHE (1985).
 “Optimal algorithms for comparing trees with labeled leaves.”
-Journal of Classification, 2(1), 7--28.
+Journal of Classification, 2(1), 7–28.
 doi:10.1007/BF01908061
 .

       Nye TMW, Liò P, Gilks WR (2006).
 “A novel algorithm and web-based tool for comparing two alternative phylogenetic trees.”
-Bioinformatics, 22(1), 117--119.
+Bioinformatics, 22(1), 117–119.
 doi:10.1093/bioinformatics/bti720
 .
      
     
      
-    
      
-    
      See also
      
-    
      Other tree distances: 
+    
      
+    
      See also
      
+    
      Other tree distances:
 JaccardRobinsonFoulds(),
 KendallColijn(),
 MASTSize(),
@@ -270,14 +229,14 @@ 
      See also
      
 SPRDist(),
 TreeDistance()
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
      library("TreeTools")
 NyeSimilarity(BalancedTree(8), PectinateTree(8))
 #> [1] 3.8
@@ -294,37 +253,23 @@ 
      Examples
      
 #> 6 2.000000 2.000000 1.500000 1.500000 1.500000
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/NyeSplitSimilarity.html b/dev/reference/NyeSplitSimilarity.html
new file mode 100644
index 000000000..cc888913d
--- /dev/null
+++ b/dev/reference/NyeSplitSimilarity.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/PathDist.html b/dev/reference/PathDist.html
index 0352cca39..26b6a2353 100644
--- a/dev/reference/PathDist.html
+++ b/dev/reference/PathDist.html
@@ -1,124 +1,76 @@
 
-Path distance — PathDist • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Path distance
      
-    Source: R/tree_distance_path.R
-    
+  
      
+
      
+
      
+  
      
+
+      
      Path distance
      
+      Source: R/tree_distance_path.R
+      
      PathDist.Rd
      
     
      
 
-    
      
+    
      
     
      Calculate the path distance between rooted or unrooted trees.
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      PathDist(tree1, tree2 = NULL)
      
     
      
 
-    
      
-    
      Arguments
      
-    
      tree1, tree2
      
+    
      
+    
      Arguments
      
+
+
+
      tree1, tree2
      
 
      Trees of class phylo, with leaves labelled identically,
 or lists of such trees to undergo pairwise comparison.  Where implemented,
 tree2 = NULL will compute distances between each pair of trees in the list
@@ -127,15 +79,13 @@ 
      Arguments
      
 .
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      PathDist() returns a vector or distance matrix of distances
+    
      
+    
      Value
      
+    
      PathDist() returns a vector or distance matrix of distances
 between trees.
      
     
      
-    
      
-    
      Details
      
+    
      
+    
      Details
      
     
      This function is a faster alternative to the function
 path.dist() in the phangorn package,
 which can crash if the internal representation of trees does not conform to
@@ -163,37 +113,37 @@ 
      Details
      
 fundamental) relationships (Farris 1973)
 .
      
     
      
-    
      
-    
      References
      
+    
      
+    
      References
      
     
      Day WHE (1985).
 “Optimal algorithms for comparing trees with labeled leaves.”
-Journal of Classification, 2(1), 7--28.
+Journal of Classification, 2(1), 7–28.
 doi:10.1007/BF01908061
 .

       Farris JS (1969).
 “A successive approximations approach to character weighting.”
-Systematic Biology, 18(4), 374--385.
+Systematic Biology, 18(4), 374–385.
 doi:10.2307/2412182
 .

       Farris JS (1973).
 “On comparing the shapes of taxonomic trees.”
-Systematic Zoology, 22(1), 50--54.
+Systematic Zoology, 22(1), 50–54.
 doi:10.2307/2412378
 .

       Phipps JB (1971).
 “Dendrogram topology.”
 Systematic Zoology, 20(3), 306.
 doi:10.2307/2412343
 .

       Steel MA, Penny D (1993).
-“Distributions of tree comparison metrics---some new results.”
-Systematic Biology, 42(2), 126--141.
+“Distributions of tree comparison metrics—some new results.”
+Systematic Biology, 42(2), 126–141.
 doi:10.1093/sysbio/42.2.126
 .

       Williams WT, Clifford HT (1971).
 “On the comparison of two classifications of the same set of elements.”
-Taxon, 20(4), 519--522.
+Taxon, 20(4), 519–522.
 doi:10.2307/1218253
 .
      
     
      
-    
      
-    
      See also
      
-    
      Other tree distances: 
+    
      
+    
      See also
      
+    
      Other tree distances:
 JaccardRobinsonFoulds(),
 KendallColijn(),
 MASTSize(),
@@ -204,14 +154,14 @@ 
      See also
      
 SPRDist(),
 TreeDistance()
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
      library("TreeTools")
 
 # Treating the two edges to the root node as distinct
@@ -241,37 +191,23 @@ 
      Examples
      
  
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
+
+
+
+
 
-  
-
+  
 
diff --git a/dev/reference/PathVector.html b/dev/reference/PathVector.html
new file mode 100644
index 000000000..fb4b9933d
--- /dev/null
+++ b/dev/reference/PathVector.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/PhylogeneticInfoDistance.html b/dev/reference/PhylogeneticInfoDistance.html
new file mode 100644
index 000000000..e5fd28ddf
--- /dev/null
+++ b/dev/reference/PhylogeneticInfoDistance.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/Plot3.html b/dev/reference/Plot3.html
index b10ee0cb0..7cf62714b 100644
--- a/dev/reference/Plot3.html
+++ b/dev/reference/Plot3.html
@@ -1,124 +1,77 @@
 
-Pseudo-3D plotting — Plot3 • TreeDistPseudo-3D plotting — Plot3 • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Pseudo-3D plotting
      
-    Source: R/Plot3.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Pseudo-3D plotting
      
+      Source: R/Plot3.R
+      
      Plot3.Rd
      
     
      
 
-    
      
+    
      
     
      Plot3() displays three-dimensional data in two dimensions, reflecting the
 third dimension with point scaling, overlap and fogging.
 Points with a lower z value are smaller than, fainter than, and overlapped
 by points with a higher value.
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      Plot3(
   x,
   y = NULL,
@@ -137,40 +90,42 @@ 
      Pseudo-3D plotting
      
 )
      
     
      
 
-    
      
-    
      Arguments
      
-    
      x, y, z
      
+    
      
+    
      Arguments
      
+
+
+
      x, y, z
      
 
      Coordinates of points to plot.
      
 
 
-
      bg, cex, col, pch, add, axes, frame.plot, ...
      
+
      bg, cex, col, pch, add, axes, frame.plot, ...
      
 
      Parameters passed to
 plot.default().
      
 
 
-
      plot.bg
      
+
      plot.bg
      
 
      Colour with which to fill plot area, used as fog colour.
      
 
 
-
      fog
      
+
      fog
      
 
      Numeric from zero (no fading) to one (furthest points are
 invisible) specifying amount to fade distant points.
      
 
 
-
      shrink
      
+
      shrink
      
 
      Numeric specifying degree to which size of plotted point
 should reflect z position. 0 denotes no scaling; if 1, furthest
 point will have zero size.
      
 
 
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
      Plot3(1:10, 1:10, 1:10, cex = 7, pch = 16, axes = FALSE, asp = 1)
 
 # Extreme values of fog and shrink will cause smallest z values to
@@ -180,37 +135,23 @@ 
      Examples
      
 
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/Project.html b/dev/reference/Project.html
new file mode 100644
index 000000000..a9e6c17fb
--- /dev/null
+++ b/dev/reference/Project.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/ProjectionQuality.html b/dev/reference/ProjectionQuality.html
new file mode 100644
index 000000000..caab17e95
--- /dev/null
+++ b/dev/reference/ProjectionQuality.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/ReduceTrees-1.png b/dev/reference/ReduceTrees-1.png
new file mode 100644
index 000000000..6006a33a2
Binary files /dev/null and b/dev/reference/ReduceTrees-1.png differ
diff --git a/dev/reference/ReduceTrees.html b/dev/reference/ReduceTrees.html
new file mode 100644
index 000000000..67373c8fa
--- /dev/null
+++ b/dev/reference/ReduceTrees.html
@@ -0,0 +1,151 @@
+
+Collapse areas of agreement between two trees — ReduceTrees • TreeDist
+    Skip to contents
+
+
+    
      
+
      
+  
      
+
+      
      Collapse areas of agreement between two trees
      
+      Source: R/Reduce.R
+      
      ReduceTrees.Rd
      
+    
      
+
+    
      
+    
      ReduceTrees() reduces trees according to the tree reduction rules of
+Allen and Steel (2001)
+:
      • Collapse identical pendant subtrees;
        • 
+
      • Compress equivalent internal chains.
        • 
+
      
+
+    
      
+    
      Usage
      
+    
      ReduceTrees(tree1, tree2, check = TRUE)
      
+    
      
+
+    
      
+    
      Arguments
      
+
+
+
      tree1, tree2
      
+
      Single trees of class phylo to undergo comparison.
      
+
+
+
      check
      
+
      Logical specifying whether to validate input. Specify
+FALSE and you will encounter undefined behaviour if trees are not
+binary phylo objects with identical leaf labels, rooted on leaf 1.
      
+
+
      
+    
      
+    
      Value
      
+    
      ReduceTrees() returns a list of two trees, corresponding to
+tree1 and tree2 after any identical groupings have been collapsed,
+with tree edges listed in postorder; or NULL if the trees are equivalent.
      
+    
      
+    
      
+    
      Author
      
+    
      Martin R. Smith
+(martin.smith@durham.ac.uk)
      
+    
      
+
+    
      
+    
      Examples
      
+    
      tree1 <- TreeTools::BalancedTree(9)
+tree2 <- TreeTools::PectinateTree(9)
+
+# Set graphical parameters
+oPar <- par(mai = rep(0.1, 4), mfrow = c(2, 2))
+
+plot(tree1)
+plot(tree2)
+
+# Reduce trees by collapsing identical clades
+confl <- ReduceTrees(tree1, tree2)
+
+plot(confl[[1]])
+plot(confl[[2]])
+
+
+# Restore graphical parameters
+par(oPar)
+
      
+    
      
+  
      
+
+
+    
      
+
+
+
+
+
+  
+
diff --git a/dev/reference/ReportMatching.html b/dev/reference/ReportMatching.html
index 2f6887c05..67b9fc57b 100644
--- a/dev/reference/ReportMatching.html
+++ b/dev/reference/ReportMatching.html
@@ -1,176 +1,112 @@
 
-List clades as text — ReportMatching • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      List clades as text
      
-    Source: R/tree_distance_utilities.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      List clades as text
      
+      Source: R/tree_distance_utilities.R
+      
      ReportMatching.Rd
      
     
      
 
-    
      
+    
      
     
      List clades as text
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      ReportMatching(splits1, splits2, realMatch = TRUE)
      
     
      
 
-    
      
-    
      Arguments
      
-    
      splits1, splits2
      
+    
      
+    
      Arguments
      
+
+
+
      splits1, splits2
      
 
      Logical matrices with columns specifying membership
 of each corresponding matched clade.
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      ReportMatching returns a character vector describing each pairing
+    
      
+    
      Value
      
+    
      ReportMatching returns a character vector describing each pairing
 in a matching.
      
     
      
-    
      
-    
      See also
      
+    
      
+    
      See also
      
     
      VisualizeMatching
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/Robinson-Foulds.html b/dev/reference/Robinson-Foulds.html
index cfc06a642..afe928008 100644
--- a/dev/reference/Robinson-Foulds.html
+++ b/dev/reference/Robinson-Foulds.html
@@ -1,5 +1,5 @@
 
-Robinson–Foulds distances, with adjustments for phylogenetic information content — Robinson-Foulds • TreeDistRobinson–Foulds distances, with adjustments for phylogenetic information content — Robinson-Foulds • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Robinson–Foulds distances, with adjustments for phylogenetic information content
      
-    Source: R/tree_distance_rf.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Robinson–Foulds distances, with adjustments for phylogenetic information content
      
+      Source: R/tree_distance_rf.R
+      
      Robinson-Foulds.Rd
      
     
      
 
-    
      
+    
      
     
      RobinsonFoulds() calculates the Robinson–Foulds distance
 (Robinson and Foulds 1981)
 , or the corresponding similarity measure.
@@ -132,7 +91,8 @@ 
      Robinson–Foulds distances, with adjustments for phylogenetic information c
 .
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      InfoRobinsonFoulds(
   tree1,
   tree2 = NULL,
@@ -172,9 +132,11 @@ 
      Robinson–Foulds distances, with adjustments for phylogenetic information c
 )
      
     
      
 
-    
      
-    
      Arguments
      
-    
      tree1, tree2
      
+    
      
+    
      Arguments
      
+
+
+
      tree1, tree2
      
 
      Trees of class phylo, with leaves labelled identically,
 or lists of such trees to undergo pairwise comparison.  Where implemented,
 tree2 = NULL will compute distances between each pair of trees in the list
@@ -183,12 +145,12 @@ 
      Arguments
      
 .
      
 
 
-
      similarity
      
+
      similarity
      
 
      Logical specifying whether to report the result as a tree
 similarity, rather than a difference.
      
 
 
-
      normalize
      
+
      normalize
      
 
      If a numeric value is provided, this will be used as a
 maximum value against which to rescale results.
 If TRUE, results will be rescaled against a maximum value calculated from
@@ -197,12 +159,12 @@ 
      Arguments
      
 If FALSE, results will not be rescaled.
      
 
 
-
      reportMatching
      
+
      reportMatching
      
 
      Logical specifying whether to return the clade
 matchings as an attribute of the score.
      
 
 
-
      splits1, splits2
      
+
      splits1, splits2
      
 
      Logical matrices where each row corresponds to a leaf,
 either listed in the same order or bearing identical names (in any sequence),
 and each column corresponds to a split, such that each leaf is identified as
@@ -210,28 +172,24 @@ 
      Arguments
      
 split.
      
 
 
-
      nTip
      
+
      nTip
      
 
      (Optional) Integer specifying the number of leaves in each split.
      
 
 
-
      ...
      
+
      ...
      
 
      Not used.
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      RobinsonFoulds() and InfoRobinsonFoulds() return an array of numerics providing the
+    
      
+    
      Value
      
+    
      RobinsonFoulds() and InfoRobinsonFoulds() return an array of numerics providing the
 distances between each  pair of trees in tree1 and tree2,
 or splits1 and splits2.
      
-
-
 
      If reportMatching = TRUE, the pairScores attribute
 returns a logical matrix specifying whether each pair of splits is identical.
      
     
      
-    
      
-    
      Details
      
+    
      
+    
      Details
      
     
      RobinsonFoulds() calculates the standard Robinson–Foulds distance,
 i.e. the number of splits that occur in one tree but not the other.
 InfoRobinsonFoulds() calculates the tree similarity or distance by summing
@@ -243,45 +201,45 @@ 
      Details
      
 Day (1985)
  linear-time algorithm.
      
     
      
-    
      
-    
      Functions
      
-    
+    
      
+    
      Functions
      
+
 
      
-    
      
-    
      Normalization
      
-    
+    
      
+    
      Normalization
      
+
 
 
      • RobinsonFoulds() is normalized against the total number of splits that
 are present.
        • 
 
      • InfoRobinsonFoulds() is normalized against the sum of the phylogenetic
 information of all splits in each tree, treated independently.
        • 
 
      
-    
      
-    
      References
      
+    
      
+    
      References
      
     
      Day WHE (1985).
 “Optimal algorithms for comparing trees with labeled leaves.”
-Journal of Classification, 2(1), 7--28.
+Journal of Classification, 2(1), 7–28.
 doi:10.1007/BF01908061
 .

       Robinson DF, Foulds LR (1981).
 “Comparison of phylogenetic trees.”
-Mathematical Biosciences, 53(1-2), 131--147.
+Mathematical Biosciences, 53(1-2), 131–147.
 doi:10.1016/0025-5564(81)90043-2
 .

       Smith MR (2020).
 “Information theoretic Generalized Robinson-Foulds metrics for comparing phylogenetic trees.”
-Bioinformatics, 36(20), 5007--5013.
+Bioinformatics, 36(20), 5007–5013.
 doi:10.1093/bioinformatics/btaa614
 .

       Smith MR (2022).
 “Robust analysis of phylogenetic tree space.”
-Systematic Biology, 71(5), 1255--1270.
+Systematic Biology, 71(5), 1255–1270.
 doi:10.1093/sysbio/syab100
 .
      
     
      
-    
      
-    
      See also
      
+    
      
+    
      See also
      
     
      Display paired splits: VisualizeMatching()
      
-
      Other tree distances: 
+
      Other tree distances:
 JaccardRobinsonFoulds(),
 KendallColijn(),
 MASTSize(),
@@ -292,14 +250,14 @@ 
      See also
      
 SPRDist(),
 TreeDistance()
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
       # For BalancedTree, PectinateTree, as.phylo:
 library("TreeTools", quietly = TRUE)
 balanced7 <- BalancedTree(7)
@@ -317,37 +275,23 @@ 
      Examples
      
 
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/RobinsonFoulds.html b/dev/reference/RobinsonFoulds.html
new file mode 100644
index 000000000..c69ea0e41
--- /dev/null
+++ b/dev/reference/RobinsonFoulds.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/RobinsonFouldsInfo.html b/dev/reference/RobinsonFouldsInfo.html
new file mode 100644
index 000000000..c69ea0e41
--- /dev/null
+++ b/dev/reference/RobinsonFouldsInfo.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/RobinsonFouldsMatching.html b/dev/reference/RobinsonFouldsMatching.html
new file mode 100644
index 000000000..c69ea0e41
--- /dev/null
+++ b/dev/reference/RobinsonFouldsMatching.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/RobinsonFouldsSplits.html b/dev/reference/RobinsonFouldsSplits.html
new file mode 100644
index 000000000..c69ea0e41
--- /dev/null
+++ b/dev/reference/RobinsonFouldsSplits.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/SPRDist.html b/dev/reference/SPRDist.html
index da4d23c0f..00a6d7739 100644
--- a/dev/reference/SPRDist.html
+++ b/dev/reference/SPRDist.html
@@ -1,124 +1,100 @@
 
-Approximate Subtree Prune and Regraft distance — SPRDist • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Approximate Subtree Prune and Regraft distance
      
-    Source: R/tree_distance_spr.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Approximate the Subtree Prune and Regraft (SPR) distance.
      
+      Source: R/tree_distance_spr.R
+      
      SPRDist.Rd
      
     
      
 
-    
      
-    
      Approximate the Subtree Prune and Regraft (SPR) distance.
      
+    
      
+    
      SPRDist() calculates an upper bound on the SPR distance between trees
+using the heuristic method of de Oliveira Martins et al. (2008)
+.
+Other approximations are available
+(e.g. Hickey et al. 2008, Goloboff 2008, Whidden and Matsen 2018)
+.
      
     
      
 
-    
      
-    
      SPRDist(tree1, tree2 = NULL, symmetric = TRUE)
      
+    
      
+    
      Usage
      
+    
      SPRDist(tree1, tree2 = NULL, method = "deOliveira", symmetric)
+
+# S3 method for class 'phylo'
+SPRDist(tree1, tree2 = NULL, method = "deOliveira", symmetric)
+
+# S3 method for class 'list'
+SPRDist(tree1, tree2 = NULL, method = "deOliveira", symmetric)
+
+# S3 method for class 'multiPhylo'
+SPRDist(tree1, tree2 = NULL, method = "deOliveira", symmetric)
      
     
      
 
-    
      
-    
      Arguments
      
-    
      tree1, tree2
      
+    
      
+    
      Arguments
      
+
+
+
      tree1, tree2
      
 
      Trees of class phylo, with leaves labelled identically,
 or lists of such trees to undergo pairwise comparison.  Where implemented,
 tree2 = NULL will compute distances between each pair of trees in the list
@@ -127,36 +103,55 @@ 
      Arguments
      
 .
      
 
 
-
      symmetric
      
-
      Logical specifying whether to produce a better heuristic
-by calculating the minimum of SPRDist(t1, t2) and SPRDist(t2, t1),
-which are not guaranteed to be equal due to the heuristic nature of the
-approximation (see
-phangorn#97). Set to
-FALSE for the faster approximation, as implemented in "phangorn".
      
+
      method
      
+
      Character specifying which method to use to approximate the
+SPR distance.  Currently defaults to "deOliveira", the only available
+option; a new method will eventually become the default.
      
 
-
      
-    
      
-    
      Value
      
-    
 
-
      SPRDist() returns a vector or distance matrix of distances
+
      symmetric
      
+
      Ignored (redundant after fix of
+phangorn#97).
      
+
+
      
+    
      
+    
      Value
      
+    
      SPRDist() returns a vector or distance matrix of distances
 between trees.
      
     
      
-    
      
-    
      Details
      
-    
      SPRDist() is a wrapper for the function
-SPR.dist() in the phangorn package.
-It pre-processes trees to ensure that their internal representation does
-not cause the SPR.dist() function to crash R, and allows an improved
-(but slower) symmetric heuristic.
      
-
      A memory leak is present in phangorn v2.5.5.  To avoid a drain on system
-resources, install the latest version of phangorn with
-devtools::install_github("KlausVigo/phangorn").
      
+    
      
+    
      References
      
+    
      Day WHE (1985).
+“Optimal algorithms for comparing trees with labeled leaves.”
+Journal of Classification, 2(1), 7–28.
+doi:10.1007/BF01908061
+.

       de Oliveira Martins L, Leal E, Kishino H (2008).
+“Phylogenetic detection of recombination with a Bayesian prior on the distance between trees.”
+PLoS One, 3(7), e2651.
+doi:10.1371/journal.pone.0002651
+.

       Goloboff PA (2008).
+“Calculating SPR distances between trees.”
+Cladistics, 24(4), 591-597.
+doi:10.1111/j.1096-0031.2007.00189.x
+.

       Hickey G, Dehne F, Rau-Chaplin A, Blouin C (2008).
+“SPR distance computation for unrooted trees.”
+Evolutionary Bioinformatics, 4, EBO–S419.
+doi:10.4137/EBO.S419
+.

       Whidden C, Matsen FA (2018).
+“Efficiently Inferring Pairwise Subtree Prune-and-Regraft Adjacencies between Phylogenetic Trees.”
+2018 Proceedings of the Meeting on Analytic Algorithmics and Combinatorics (ANALCO), 77–91.
+doi:10.1137/1.9781611975062.8
+.
      
     
      
-    
      
-    
      See also
      
-    
      Other tree distances: 
+    
      
+    
      See also
      
+    
      Exact calculation with TBRDist
+functions USPRDist() and ReplugDist().
      
+
      phangorn function SPR.dist() employs
+the de Oliveira Martins et al. (2008)
+ algorithm but can crash
+when sent trees of certain formats, and tends to have a longer running time.
      
+
      Other tree distances:
 JaccardRobinsonFoulds(),
 KendallColijn(),
 MASTSize(),
@@ -167,20 +162,29 @@ 
      See also
      
 Robinson-Foulds,
 TreeDistance()
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
      library("TreeTools", quietly = TRUE)
 
+# Compare single pair of trees
 SPRDist(BalancedTree(7), PectinateTree(7))
-#> spr 
-#>   1 
+#> [1] 2
+
+# Compare all pairs of trees        
+SPRDist(as.phylo(30:33, 8))
+#>   1 2 3 4
+#> 1   1 1 1
+#> 2 1   1 1
+#> 3 1 1   1
+#> 4 1 1 1  
 
+# Compare each tree in one list with each tree in another
 SPRDist(BalancedTree(7), as.phylo(0:2, 7))
 #> [1] 2 2 2
 SPRDist(as.phylo(0:2, 7), PectinateTree(7))
@@ -191,46 +195,25 @@ 
      Examples
      
 #>     [,1] [,2] [,3]
 #> bal    2    2    2
 #> pec    1    2    2
-
-CompareAll(as.phylo(30:33, 8), SPRDist)
-#>   1 2 3 4
-#> 1   1 1 1
-#> 2 1   1 1
-#> 3 1 1   1
-#> 4 1 1 1  
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/SPRDist.list.html b/dev/reference/SPRDist.list.html
new file mode 100644
index 000000000..d69b68ad2
--- /dev/null
+++ b/dev/reference/SPRDist.list.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/SPRDist.multiPhylo.html b/dev/reference/SPRDist.multiPhylo.html
new file mode 100644
index 000000000..d69b68ad2
--- /dev/null
+++ b/dev/reference/SPRDist.multiPhylo.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/SPRDist.phylo.html b/dev/reference/SPRDist.phylo.html
new file mode 100644
index 000000000..d69b68ad2
--- /dev/null
+++ b/dev/reference/SPRDist.phylo.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/SetParallel.html b/dev/reference/SetParallel.html
new file mode 100644
index 000000000..127a223d8
--- /dev/null
+++ b/dev/reference/SetParallel.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/SharedPhylogeneticInfo.html b/dev/reference/SharedPhylogeneticInfo.html
new file mode 100644
index 000000000..e5fd28ddf
--- /dev/null
+++ b/dev/reference/SharedPhylogeneticInfo.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/SharedPhylogeneticInfoSplits.html b/dev/reference/SharedPhylogeneticInfoSplits.html
new file mode 100644
index 000000000..e5fd28ddf
--- /dev/null
+++ b/dev/reference/SharedPhylogeneticInfoSplits.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/SpectralClustering.html b/dev/reference/SpectralClustering.html
new file mode 100644
index 000000000..6db44fb1a
--- /dev/null
+++ b/dev/reference/SpectralClustering.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/SpectralEigens-1.png b/dev/reference/SpectralEigens-1.png
index 7f906e530..12a6a642c 100644
Binary files a/dev/reference/SpectralEigens-1.png and b/dev/reference/SpectralEigens-1.png differ
diff --git a/dev/reference/SpectralEigens-2.png b/dev/reference/SpectralEigens-2.png
index fe1a0094c..9995628c2 100644
Binary files a/dev/reference/SpectralEigens-2.png and b/dev/reference/SpectralEigens-2.png differ
diff --git a/dev/reference/SpectralEigens.html b/dev/reference/SpectralEigens.html
index 0d53b7ddb..127dbc64c 100644
--- a/dev/reference/SpectralEigens.html
+++ b/dev/reference/SpectralEigens.html
@@ -1,165 +1,118 @@
 
-Eigenvalues for spectral clustering — SpectralEigens • TreeDistEigenvalues for spectral clustering — SpectralEigens • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Eigenvalues for spectral clustering
      
-    Source: R/spectral_clustering.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Eigenvalues for spectral clustering
      
+      Source: R/spectral_clustering.R
+      
      SpectralEigens.Rd
      
     
      
 
-    
      
+    
      
     
      Spectral clustering emphasizes nearest neighbours when forming clusters;
 it avoids some of the issues that arise from clustering around means /
 medoids.
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      SpectralEigens(D, nn = 10L, nEig = 2L)
 
 SpectralClustering(D, nn = 10L, nEig = 2L)
      
     
      
 
-    
      
-    
      Arguments
      
-    
      D
      
+    
      
+    
      Arguments
      
+
+
+
      D
      
 
      Square matrix or dist object containing Euclidean distances
 between data points.
      
 
 
-
      nn
      
+
      nn
      
 
      Integer specifying number of nearest neighbours to consider
      
 
 
-
      nEig
      
+
      nEig
      
 
      Integer specifying number of eigenvectors to retain.
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      SpectralEigens() returns spectral eigenvalues that can then be
+    
      
+    
      Value
      
+    
      SpectralEigens() returns spectral eigenvalues that can then be
 clustered using a method of choice.
      
     
      
-    
      
-    
      See also
      
-    
      Other tree space functions: 
+    
      
+    
      See also
      
+    
      Other tree space functions:
+Islands(),
 MSTSegments(),
 MapTrees(),
 MappingQuality(),
 cluster-statistics,
 median.multiPhylo()
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Adapted by MRS from script by Nura Kawa
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
      library("TreeTools", quietly = TRUE)
 trees <- as.phylo(0:18, nTip = 8)
 distances <- ClusteringInfoDistance(trees)
@@ -172,37 +125,23 @@ 
      Examples
      
 
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/SplitDifferentInformation.html b/dev/reference/SplitDifferentInformation.html
new file mode 100644
index 000000000..71bf81223
--- /dev/null
+++ b/dev/reference/SplitDifferentInformation.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/SplitEntropy.html b/dev/reference/SplitEntropy.html
index 40ef29632..7b7f9e6de 100644
--- a/dev/reference/SplitEntropy.html
+++ b/dev/reference/SplitEntropy.html
@@ -1,5 +1,5 @@
 
-Entropy of two splits — SplitEntropy • TreeDistEntropy of two splits — SplitEntropy • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Entropy of two splits
      
-    Source: R/Information.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Entropy of two splits
      
+      Source: R/Information.R
+      
      SplitEntropy.Rd
      
     
      
 
-    
      
+    
      
     
      Calculate the entropy, joint entropy, entropy distance and information
 content of two splits, treating each split as a division of n leaves into
 two groups.
@@ -128,53 +85,54 @@ 
      Entropy of two splits
      
 .
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      SplitEntropy(split1, split2 = split1)
      
     
      
 
-    
      
-    
      Arguments
      
-    
      split1, split2
      
+    
      
+    
      Arguments
      
+
+
+
      split1, split2
      
 
      Logical vectors listing leaves in a consistent order,
 identifying each leaf as a member of the ingroup (TRUE) or outgroup
 (FALSE) of the split in question.
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      A numeric vector listing, in bits:
      • H1 The entropy of split 1;
        • 
+    
        
+    
        Value
        
+    
        A numeric vector listing, in bits:
        • H1 The entropy of split 1;
          • 
 
        • H2 The entropy of split 2;
          • 
 
        • H12 The joint entropy of both splits;
          • 
 
        • I The mutual information of the splits;
          • 
 
        • Hd The entropy distance (variation of information) of the splits.
          • 
 
        
-    
        
-    
        References
        
+    
        
+    
        References
        
     
        MacKay DJC (2003).
 Information Theory, Inference, and Learning Algorithms.
 Cambridge University Press, Cambridge.
 https://www.inference.org.uk/itprnn/book.pdf.

         Meila M (2007).
-“Comparing clusterings---an information based distance.”
-Journal of Multivariate Analysis, 98(5), 873--895.
+“Comparing clusterings—an information based distance.”
+Journal of Multivariate Analysis, 98(5), 873–895.
 doi:10.1016/j.jmva.2006.11.013
 .
        
     
        
-    
        
-    
        See also
        
-    
        Other information functions: 
+    
        
+    
        See also
        
+    
        Other information functions:
 SplitSharedInformation(),
 TreeInfo
        
     
        
-    
        
-    
        Author
        
+    
        
+    
        Author
        
     
        Martin R. Smith
 (martin.smith@durham.ac.uk)
        
     
        
 
-    
        
-    
        Examples
        
+    
        
+    
        Examples
        
     
        A <- TRUE
 B <- FALSE
 SplitEntropy(c(A, A, A, B, B, B), c(A, A, B, B, B, B))
@@ -182,37 +140,23 @@ 
        Examples
        
 #> 1.0000000 0.9182958 1.4591479 0.4591479 1.0000000 
 
        
     
        
-  
        
-  
-
        
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/SplitSharedInformation.html b/dev/reference/SplitSharedInformation.html
index 37be96233..7e2acb8ec 100644
--- a/dev/reference/SplitSharedInformation.html
+++ b/dev/reference/SplitSharedInformation.html
@@ -1,124 +1,77 @@
 
-Shared information content of two splits — SplitSharedInformation • TreeDistShared information content of two splits — SplitSharedInformation • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Shared information content of two splits
      
-    Source: R/Information.R
-    
+  
      
+
      
+
      
+  
      
+
+      
      Shared information content of two splits
      
+      Source: R/Information.R
+      
      SplitSharedInformation.Rd
      
     
      
 
-    
      
+    
      
     
      Calculate the phylogenetic information shared, or not shared, between two
 splits.
 See the accompanying vignette
 for definitions.
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      SplitSharedInformation(n, A1, A2 = A1)
 
 SplitDifferentInformation(n, A1, A2 = A1)
@@ -132,44 +85,40 @@ 
      Shared information content of two splits
      
 Log2TreesConsistentWithTwoSplits(n, A1, A2 = A1)
      
     
      
 
-    
      
-    
      Arguments
      
-    
      n
      
+    
      
+    
      Arguments
      
+
+
+
      n
      
 
      Integer specifying the number of leaves
      
 
 
-
      A1, A2
      
+
      A1, A2
      
 
      Integers specifying the number of taxa in A1 and A2,
 once the splits have been arranged such that A1 fully overlaps with A2.
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      TreesConsistentWithTwoSplits() returns the number of unrooted bifurcating
+    
      
+    
      Value
      
+    
      TreesConsistentWithTwoSplits() returns the number of unrooted bifurcating
 trees consistent with two splits.
      
-
-
 
      SplitSharedInformation() returns the phylogenetic information that two splits
 have in common (Meila 2007)
 , in bits.
      
-
-
 
      SplitDifferentInformation() returns the amount of phylogenetic information
 distinct to one of the two splits, in bits.
      
     
      
-    
      
-    
      Details
      
+    
      
+    
      Details
      
     
      Split S1 divides n leaves into two splits, A1 and B1.
 Split S2 divides the same leaves into the splits A2 and B2.
      
 
      Splits must be named such that A1 fully overlaps with A2:
 that is to say, all taxa in A1 are also in A2, or vice versa.
 Thus, all taxa in the smaller of A1 and A2 also occur in the larger.
      
     
      
-    
      
-    
      Functions
      
-    
+    
      
+    
      Functions
      
+
 
      • SplitDifferentInformation(): Different information between two splits.
        • 
 
      • TreesConsistentWithTwoSplits(): Number of trees consistent with two
 splits.
        • 
@@ -180,28 +129,28 @@ 
        Functions
        
 
      • Log2TreesConsistentWithTwoSplits(): Base 2 logarithm of
 TreesConsistentWithTwoSplits().
        • 
 
      
-    
      
-    
      References
      
+    
      
+    
      References
      
     
      Meila M (2007).
-“Comparing clusterings---an information based distance.”
-Journal of Multivariate Analysis, 98(5), 873--895.
+“Comparing clusterings—an information based distance.”
+Journal of Multivariate Analysis, 98(5), 873–895.
 doi:10.1016/j.jmva.2006.11.013
 .
      
     
      
-    
      
-    
      See also
      
-    
      Other information functions: 
+    
      
+    
      See also
      
+    
      Other information functions:
 SplitEntropy(),
 TreeInfo
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
        # Eight leaves, labelled A to H.
   # Split 1: ABCD|EFGH
   # Split 2: ABC|DEFGH
@@ -223,37 +172,23 @@ 
      Examples
      
 #> [1] 5.044394
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
+
+
+
+
 
-  
-
+  
 
diff --git a/dev/reference/SplitVector.html b/dev/reference/SplitVector.html
new file mode 100644
index 000000000..fb4b9933d
--- /dev/null
+++ b/dev/reference/SplitVector.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/SplitsCompatible.html b/dev/reference/SplitsCompatible.html
index d37934529..7059be4f2 100644
--- a/dev/reference/SplitsCompatible.html
+++ b/dev/reference/SplitsCompatible.html
@@ -1,146 +1,97 @@
 
-Are splits compatible? — SplitsCompatible • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Are splits compatible?
      
-    Source: R/tree_distance.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Are splits compatible?
      
+      Source: R/tree_distance.R
+      
      SplitsCompatible.Rd
      
     
      
 
-    
      
+    
      
     
      Determine whether splits are compatible (concave); i.e. they can both occur
 on a single tree.
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      SplitsCompatible(split1, split2)
      
     
      
 
-    
      
-    
      Arguments
      
-    
      split1, split2
      
+    
      
+    
      Arguments
      
+
+
+
      split1, split2
      
 
      Logical vectors listing leaves in a consistent order,
 identifying each leaf as a member of the ingroup (TRUE) or outgroup
 (FALSE) of the split in question.
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      SplitsCompatible() returns a logical specifying whether the splits
+    
      
+    
      Value
      
+    
      SplitsCompatible() returns a logical specifying whether the splits
 provided are compatible with one another.
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
      A <- TRUE
 B <- FALSE
 SplitsCompatible(c(A, A, A, B, B, B),
@@ -151,37 +102,23 @@ 
      Examples
      
 #> [1] FALSE
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/SplitwiseInfo.html b/dev/reference/SplitwiseInfo.html
new file mode 100644
index 000000000..6e07f63b1
--- /dev/null
+++ b/dev/reference/SplitwiseInfo.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/StartParallel.html b/dev/reference/StartParallel.html
index 5d4de93b5..ba953b698 100644
--- a/dev/reference/StartParallel.html
+++ b/dev/reference/StartParallel.html
@@ -1,118 +1,68 @@
 
-Calculate distances in parallel — StartParallel • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Calculate distances in parallel
      
-    Source: R/parallel.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Calculate distances in parallel
      
+      Source: R/parallel.R
+      
      StartParallel.Rd
      
     
      
 
-    
      
+    
      
     
      Accelerate distance calculation by employing multiple CPU workers.
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      StartParallel(...)
 
 SetParallel(cl)
@@ -122,36 +72,32 @@ 
      Calculate distances in parallel
      
 StopParallel(quietly = FALSE)
      
     
      
 
-    
      
-    
      Arguments
      
-    
      ...
      
+    
      
+    
      Arguments
      
+
+
+
      ...
      
 
      Parameters to pass to makeCluster().
      
 
 
-
      cl
      
+
      cl
      
 
      An existing cluster.
      
 
 
-
      quietly
      
+
      quietly
      
 
      Logical; if TRUE, do not warn when no cluster was running.
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      StartParallel() and SetParallel() return the previous value of
+    
      
+    
      Value
      
+    
      StartParallel() and SetParallel() return the previous value of
 options("TreeDist-cluster").
      
-
-
 
      GetParallel() returns the currently specified cluster.
      
-
-
 
      StopParallel() returns TRUE if a cluster was destroyed,
 FALSE otherwise.
      
     
      
-    
      
-    
      Details
      
+    
      
+    
      Details
      
     
      "TreeDist" parallelizes the calculation of tree to tree distances via
 the parCapply() function, using a user-defined cluster specified in
 options("TreeDist-cluster").
      
@@ -161,14 +107,14 @@ 
      Details
      
 cluster.
      
 
      StopParallel() stops the current TreeDist cluster.
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
      if (interactive()) { # Only run in terminal
   library("TreeTools", quietly = TRUE)
   nCores <- ceiling(parallel::detectCores() / 2)
@@ -179,37 +125,23 @@ 
      Examples
      
 }
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/StopParallel.html b/dev/reference/StopParallel.html
new file mode 100644
index 000000000..127a223d8
--- /dev/null
+++ b/dev/reference/StopParallel.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/StrainCol.html b/dev/reference/StrainCol.html
new file mode 100644
index 000000000..ccc5c0bb3
--- /dev/null
+++ b/dev/reference/StrainCol.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/SumOfRanges.html b/dev/reference/SumOfRanges.html
new file mode 100644
index 000000000..dd4934941
--- /dev/null
+++ b/dev/reference/SumOfRanges.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/SumOfVariances.html b/dev/reference/SumOfVariances.html
new file mode 100644
index 000000000..dd4934941
--- /dev/null
+++ b/dev/reference/SumOfVariances.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/SumOfVars.html b/dev/reference/SumOfVars.html
new file mode 100644
index 000000000..dd4934941
--- /dev/null
+++ b/dev/reference/SumOfVars.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/TreeDist-package.html b/dev/reference/TreeDist-package.html
index 43864682a..a9bc454f9 100644
--- a/dev/reference/TreeDist-package.html
+++ b/dev/reference/TreeDist-package.html
@@ -1,118 +1,71 @@
 
-TreeDist: Distances between Phylogenetic Trees — TreeDist-package • TreeDistTreeDist: Distances between Phylogenetic Trees — TreeDist-package • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      TreeDist: Distances between Phylogenetic Trees
      
-    Source: R/TreeDist-package.R
-    
+  
      
+
      
+
      
+  
      
+
+      
      TreeDist: Distances between Phylogenetic Trees
      
+      Source: R/TreeDist-package.R
+      
      TreeDist-package.Rd
      
     
      
 
-    
      
+    
      
     
      'TreeDist' is an R package that implements a suite of metrics that quantify the
 topological distance between pairs of unweighted phylogenetic trees.
 It also includes a simple "Shiny" application to allow the visualization of
@@ -121,8 +74,8 @@ 
      TreeDist: Distances between Phylogenetic Trees
      
     
      
 
 
-    
      
-    
      Details
      
+    
      
+    
      Details
      
     
      "TreeDist" primarily employs metrics in the category of
 "generalized Robinson–Foulds distances": they are based on comparing splits
 (bipartitions) between trees, and thus reflect the relationship data within
@@ -134,7 +87,7 @@ 
      Generalized RF distancesThe Robinson–Foulds distance
 simply tallies the number of non-trivial splits (sometimes inaccurately
-termed clades, nodes or edges) that occur in both trees -- any splits that are
+termed clades, nodes or edges) that occur in both trees – any splits that are
 not perfectly identical contributes one point to the distance score of zero,
 however similar or different they are.
 By overlooking potential similarities between almost-identical splits,
@@ -180,8 +133,8 @@ 
      Generalized RF distances
 
     
      
-    
      
-    
      Tree space analysis
      
+    
      
+    
      Tree space analysis
      
     
      Map tree spaces and readily visualize mapped landscapes, avoiding
 common analytical pitfalls (Smith, forthcoming),
 using the inbuilt graphical user interface:
      
@@ -190,54 +143,54 @@ 
      Tree space analysis
      
 vignette
 for a command-line interface.
      
     
      
-    
      
-    
      References
      
-    
+    
      
+    
      References
      
+
 
      • Böcker S, Canzar S, Klau GW (2013).
 “The generalized Robinson-Foulds metric.”
-In Darling A, Stoye J (eds.), Algorithms in Bioinformatics. WABI 2013. Lecture Notes in Computer Science, vol 8126, 156--169.
+In Darling A, Stoye J (eds.), Algorithms in Bioinformatics. WABI 2013. Lecture Notes in Computer Science, vol 8126, 156–169.
 Springer, Berlin, Heidelberg.
 doi:10.1007/978-3-642-40453-5_13
 .
        • 
 
      • Bogdanowicz D, Giaro K (2012).
 “Matching split distance for unrooted binary phylogenetic trees.”
-IEEE/ACM Transactions on Computational Biology and Bioinformatics, 9(1), 150--160.
+IEEE/ACM Transactions on Computational Biology and Bioinformatics, 9(1), 150–160.
 doi:10.1109/TCBB.2011.48
 .
        • 
 
      • Kendall M, Colijn C (2016).
 “Mapping phylogenetic trees to reveal distinct patterns of evolution.”
-Molecular Biology and Evolution, 33(10), 2735--2743.
+Molecular Biology and Evolution, 33(10), 2735–2743.
 doi:10.1093/molbev/msw124
 .
        • 
 
      • Li M, Tromp J, Zhang L (1996).
 “Some notes on the nearest neighbour interchange distance.”
-In Goos G, Hartmanis J, Leeuwen J, Cai J, Wong CK (eds.), Computing and Combinatorics, volume 1090, 343--351.
+In Goos G, Hartmanis J, Leeuwen J, Cai J, Wong CK (eds.), Computing and Combinatorics, volume 1090, 343–351.
 Springer, Berlin, Heidelberg.
 ISBN 978-3-540-61332-9 978-3-540-68461-9, doi:10.1007/3-540-61332-3_168
 .
        • 
 
      • Lin Y, Rajan V, Moret BME (2012).
 “A metric for phylogenetic trees based on matching.”
-IEEE/ACM Transactions on Computational Biology and Bioinformatics, 4(9), 1014--1022.
+IEEE/ACM Transactions on Computational Biology and Bioinformatics, 4(9), 1014–1022.
 doi:10.1109/TCBB.2011.157
 .
        • 
 
      • Nye TMW, Liò P, Gilks WR (2006).
 “A novel algorithm and web-based tool for comparing two alternative phylogenetic trees.”
-Bioinformatics, 22(1), 117--119.
+Bioinformatics, 22(1), 117–119.
 doi:10.1093/bioinformatics/bti720
 .
        • 
 
      • Smith MR (2020).
 “Information theoretic Generalized Robinson-Foulds metrics for comparing phylogenetic trees.”
-Bioinformatics, 36(20), 5007--5013.
+Bioinformatics, 36(20), 5007–5013.
 doi:10.1093/bioinformatics/btaa614
 .
        • 
 
      • Smith MR (2022).
 “Robust analysis of phylogenetic tree space.”
-Systematic Biology, 71(5), 1255--1270.
+Systematic Biology, 71(5), 1255–1270.
 doi:10.1093/sysbio/syab100
 .
        • 
 
      
-    
      
-    
      See also
      
+    
      
+    
      See also
      
     
      Further documentation is available in the
 package vignettes, visible from
 R using vignette(package = "TreeDist").
      
@@ -254,45 +207,31 @@ 
      See also
      
 Geodesic distance
      
 
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Maintainer: Martin R. Smith martin.smith@durham.ac.uk (ORCID) [copyright holder, programmer]
      
 
      Other contributors:
      
 
-  
      
-  
-
      
+  
      
 
 
-      
      
+
+
+
+
 
-  
-
+  
 
diff --git a/dev/reference/TreeDist.html b/dev/reference/TreeDist.html
new file mode 100644
index 000000000..37200665a
--- /dev/null
+++ b/dev/reference/TreeDist.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/TreeDistPlot.html b/dev/reference/TreeDistPlot.html
index bf70e1be6..21fa3c7b5 100644
--- a/dev/reference/TreeDistPlot.html
+++ b/dev/reference/TreeDistPlot.html
@@ -1,118 +1,68 @@
 
-Plot a simple tree — TreeDistPlot • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Plot a simple tree
      
-    Source: R/plot.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Plot a simple tree
      
+      Source: R/plot.R
+      
      TreeDistPlot.Rd
      
     
      
 
-    
      
+    
      
     
      Convenience plotting function used in vignettes and documentation.
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      TreeDistPlot(
   tr,
   title = NULL,
@@ -126,76 +76,64 @@ 
      Plot a simple tree
      
 )
      
     
      
 
-    
      
-    
      Arguments
      
-    
      tr
      
+    
      
+    
      Arguments
      
+
+
+
      tr
      
 
      A tree of class phylo, with leaves labelled as integers.
      
 
 
-
      title
      
+
      title
      
 
      main title for the plot.
      
 
 
-
      bold
      
+
      bold
      
 
      Integer specifying which leaves to print in bold.
      
 
 
-
      leaveRoom
      
+
      leaveRoom
      
 
      Logical specifying whether to leave space to print
 tree distances beneath the plotted tree.
      
 
 
-
      prune, graft
      
+
      prune, graft
      
 
      Integer vectors specifying which edges to highlight as
 pruned and grafted.
      
 
 
-
      edge.color
      
+
      edge.color
      
 
      Additional parameter to plot.phylo; will be overridden
 by prune and graft as requested.
      
 
 
-
      edge.width, ...
      
+
      edge.width, ...
      
 
      Additional parameters to plot.phylo.
      
 
 
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/TreeDistance.html b/dev/reference/TreeDistance.html
index 198280272..7dfac357a 100644
--- a/dev/reference/TreeDistance.html
+++ b/dev/reference/TreeDistance.html
@@ -1,122 +1,74 @@
 
-Information-based generalized Robinson–Foulds distances — TreeDistance • TreeDistInformation-based generalized Robinson–Foulds distances — TreeDistance • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Information-based generalized Robinson–Foulds distances
      
-    Source: R/tree_distance_info.R, R/tree_distance_msi.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Information-based generalized Robinson–Foulds distances
      
+      Source: R/tree_distance_info.R, R/tree_distance_msi.R
+      
      TreeDistance.Rd
      
     
      
 
-    
      
+    
      
     
      Calculate tree similarity and distance measures based on the amount of
 phylogenetic or clustering information that two trees hold in common, as
 proposed in Smith (2020).
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      TreeDistance(tree1, tree2 = NULL)
 
 SharedPhylogeneticInfo(
@@ -195,9 +147,11 @@ 
      Information-based generalized Robinson–Foulds distances
      
 )
      
     
      
 
-    
      
-    
      Arguments
      
-    
      tree1, tree2
      
+    
      
+    
      Arguments
      
+
+
+
      tree1, tree2
      
 
      Trees of class phylo, with leaves labelled identically,
 or lists of such trees to undergo pairwise comparison.  Where implemented,
 tree2 = NULL will compute distances between each pair of trees in the list
@@ -206,7 +160,7 @@ 
      Arguments
      
 .
      
 
 
-
      normalize
      
+
      normalize
      
 
      If a numeric value is provided, this will be used as a
 maximum value against which to rescale results.
 If TRUE, results will be rescaled against a maximum value calculated from
@@ -215,23 +169,23 @@ 
      Arguments
      
 If FALSE, results will not be rescaled.
      
 
 
-
      reportMatching
      
+
      reportMatching
      
 
      Logical specifying whether to return the clade
 matchings as an attribute of the score.
      
 
 
-
      diag
      
+
      diag
      
 
      Logical specifying whether to return similarities along the
 diagonal, i.e. of each tree with itself.  Applies only if tree2 is
 a list identical to tree1, or NULL.
      
 
 
-
      samples
      
+
      samples
      
 
      Integer specifying how many samplings to obtain;
 accuracy of estimate increases with sqrt(samples).
      
 
 
-
      splits1, splits2
      
+
      splits1, splits2
      
 
      Logical matrices where each row corresponds to a leaf,
 either listed in the same order or bearing identical names (in any sequence),
 and each column corresponds to a split, such that each leaf is identified as
@@ -239,30 +193,24 @@ 
      Arguments
      
 split.
      
 
 
-
      nTip
      
+
      nTip
      
 
      (Optional) Integer specifying the number of leaves in each split.
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      If reportMatching = FALSE, the functions return a numeric
+    
      
+    
      Value
      
+    
      If reportMatching = FALSE, the functions return a numeric
 vector specifying the requested similarities or differences.
      
-
-
 
      If reportMatching = TRUE, the functions additionally return an integer
 vector listing the index of the split in tree2 that is matched with
 each split in tree1 in the optimal matching.
 Unmatched splits are denoted NA.
 Use VisualizeMatching() to plot the optimal matching.
      
-
-
 
      TreeDistance() simply returns the clustering information distance (it is
 an alias of ClusteringInfoDistance()).
      
     
      
-    
      
-    
      Details
      
+    
      
+    
      Details
      
     
      Generalized Robinson–Foulds distances
 calculate tree similarity by finding an
 optimal matching that the similarity between a split on one tree
@@ -284,8 +232,8 @@ 
      Details
      
 other are removed before each comparison (as by definition, the trees neither
 hold information in common nor differ regarding these tips).
      
     
      
-    
      
-    
      Concepts of information
      
+    
      
+    
      Concepts of information
      
     
      The phylogenetic (Shannon) information content and entropy of a split are
 defined in
 a separate vignette.
      
@@ -311,8 +259,8 @@ 
      Concepts of information
      
 is the corresponding measure of tree difference.
 (More information here.)
      
     
      
-    
      
-    
      Conversion to distances
      
+    
      
+    
      Conversion to distances
      
     
      To convert similarity measures to distances, it is necessary to
 subtract the similarity score from a maximum value.  In order to generate
 distance metrics, these functions subtract the similarity twice from the
@@ -320,8 +268,8 @@ 
      Conversion to distances
      
 both trees (Smith 2020)
 .
      
     
      
-    
      
-    
      Normalization
      
+    
      
+    
      Normalization
      
     
      If normalize = TRUE, then results will be rescaled such that distance
 ranges from zero to (in principle) one.
 The maximum distance is the sum of the information content or entropy of
@@ -348,8 +296,8 @@ 
      Normalization
      
 called from distance functions with the parameter how = normalize.
 .
      
     
      
-    
      
-    
      Distances between large trees
      
+    
      
+    
      Distances between large trees
      
     
      To balance memory demands and runtime with flexibility, these functions are
 implemented for trees with up to 2048 leaves.
 To analyse trees with up to 8192 leaves, you will need to a modified version
@@ -371,32 +319,32 @@ 
      Distances between large trees
      
 
      Trees with over 8192 leaves require further modification of the source code,
 which the maintainer plans to attempt in the future; please comment on GitHub if you would find this useful.
      
     
      
-    
      
-    
      References
      
+    
      
+    
      References
      
     
      Day WHE (1985).
 “Optimal algorithms for comparing trees with labeled leaves.”
-Journal of Classification, 2(1), 7--28.
+Journal of Classification, 2(1), 7–28.
 doi:10.1007/BF01908061
 .

       MacKay DJC (2003).
 Information Theory, Inference, and Learning Algorithms.
 Cambridge University Press, Cambridge.
 https://www.inference.org.uk/itprnn/book.pdf.

       Meila M (2007).
-“Comparing clusterings---an information based distance.”
-Journal of Multivariate Analysis, 98(5), 873--895.
+“Comparing clusterings—an information based distance.”
+Journal of Multivariate Analysis, 98(5), 873–895.
 doi:10.1016/j.jmva.2006.11.013
 .

       Smith MR (2020).
 “Information theoretic Generalized Robinson-Foulds metrics for comparing phylogenetic trees.”
-Bioinformatics, 36(20), 5007--5013.
+Bioinformatics, 36(20), 5007–5013.
 doi:10.1093/bioinformatics/btaa614
 .

       Vinh NX, Epps J, Bailey J (2010).
 “Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance.”
-Journal of Machine Learning Research, 11, 2837--2854.
+Journal of Machine Learning Research, 11, 2837–2854.
 doi:10.1145/1553374.1553511
 .
      
     
      
-    
      
-    
      See also
      
-    
      Other tree distances: 
+    
      
+    
      See also
      
+    
      Other tree distances:
 JaccardRobinsonFoulds(),
 KendallColijn(),
 MASTSize(),
@@ -407,14 +355,14 @@ 
      See also
      
 Robinson-Foulds,
 SPRDist()
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
      tree1 <- ape::read.tree(text="((((a, b), c), d), (e, (f, (g, h))));")
 tree2 <- ape::read.tree(text="(((a, b), (c, d)), ((e, f), (g, h)));")
 tree3 <- ape::read.tree(text="((((h, b), c), d), (e, (f, (g, a))));")
@@ -471,37 +419,23 @@ 
      Examples
      
 #> [1] 3.031424
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/TreeInfo.html b/dev/reference/TreeInfo.html
index d245d0a4f..9c87bb76b 100644
--- a/dev/reference/TreeInfo.html
+++ b/dev/reference/TreeInfo.html
@@ -1,121 +1,77 @@
 
-Information content of splits within a tree — TreeInfo • TreeDistInformation content of splits within a tree — TreeInfo • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Information content of splits within a tree
      
-    Source: R/tree_information.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Information content of splits within a tree
      
+      Source: R/tree_information.R
+      
      TreeInfo.Rd
      
     
      
 
-    
      
+    
      
     
      Sum the entropy (ClusteringEntropy()), clustering information content
 (ClusteringInfo()), or phylogenetic information content (SplitwiseInfo())
 across each split within a phylogenetic tree,
@@ -126,87 +82,84 @@ 
      Information content of splits within a tree
      
 counted more than once
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      SplitwiseInfo(x, p = NULL, sum = TRUE)
 
 ClusteringEntropy(x, p = NULL, sum = TRUE)
 
 ClusteringInfo(x, p = NULL, sum = TRUE)
 
-# S3 method for phylo
+# S3 method for class 'phylo'
 ClusteringEntropy(x, p = NULL, sum = TRUE)
 
-# S3 method for list
+# S3 method for class 'list'
 ClusteringEntropy(x, p = NULL, sum = TRUE)
 
-# S3 method for multiPhylo
+# S3 method for class 'multiPhylo'
 ClusteringEntropy(x, p = NULL, sum = TRUE)
 
-# S3 method for Splits
+# S3 method for class 'Splits'
 ClusteringEntropy(x, p = NULL, sum = TRUE)
 
-# S3 method for phylo
+# S3 method for class 'phylo'
 ClusteringInfo(x, p = NULL, sum = TRUE)
 
-# S3 method for list
+# S3 method for class 'list'
 ClusteringInfo(x, p = NULL, sum = TRUE)
 
-# S3 method for multiPhylo
+# S3 method for class 'multiPhylo'
 ClusteringInfo(x, p = NULL, sum = TRUE)
 
-# S3 method for Splits
+# S3 method for class 'Splits'
 ClusteringInfo(x, p = NULL, sum = TRUE)
 
 ConsensusInfo(trees, info = "phylogenetic", p = 0.5, check.tips = TRUE)
      
     
      
 
-    
      
-    
      Arguments
      
-    
      x
      
+    
      
+    
      Arguments
      
+
+
+
      x
      
 
      A tree of class phylo, a list of trees, or a multiPhylo object.
      
 
 
-
      p
      
+
      p
      
 
      Scalar from 0.5 to 1 specifying minimum proportion of trees that
 must contain a split for it to appear within the consensus.
      
 
 
-
      sum
      
+
      sum
      
 
      Logical: if TRUE, sum the information content of each split to
 provide the total splitwise information content of the tree.
      
 
 
-
      trees
      
+
      trees
      
 
      List of phylo objects, optionally with class multiPhylo.
      
 
 
-
      info
      
+
      info
      
 
      Abbreviation of "phylogenetic" or "clustering", specifying
 the concept of information to employ.
      
 
 
-
      check.tips
      
+
      check.tips
      
 
      Logical specifying whether to renumber leaves such that
 leaf numbering is consistent in all trees.
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      SplitwiseInfo(), ClusteringInfo() and ClusteringEntropy()
      
-
-
-
      return the splitwise information content of the tree -- or of each split
-in turn, if sum = FALSE -- in bits.
      
-
-
+    
      
+    
      Value
      
+    
      SplitwiseInfo(), ClusteringInfo() and ClusteringEntropy()
+return the splitwise information content of the tree – or of each split
+in turn, if sum = FALSE – in bits.
      
 
      ConsensusInfo() returns the splitwise information content of the
 majority rule consensus of trees.
      
     
      
-    
      
-    
      Clustering information
      
-    
+    
      
+    
      Clustering information
      
+
 
 
 
      Clustering entropy addresses the question "how much information is contained
@@ -238,7 +191,7 @@ 
      Clustering information
      
 
    • 10 = 'First leaf in B, second in A`
      • 
 
      This code uses two bits to transmit the partition labels of two leaves.
 If partitions A and B are equiprobable, this is the optimal code; our
-entropy -- the average information content required per leaf -- is 1 bit.
      
+entropy – the average information content required per leaf – is 1 bit.
      
 
      Alternatively, we could use the (suboptimal) code
      • 0 = "Both leaves belong to partition A"
        • 
 
      • 111 = "Both leaves belong to partition B"
        • 
 
      • 101 = 'First leaf in A, second in B`
        • 
@@ -254,9 +207,9 @@ 
        Clustering information
        
 , the information content of
 a split is its entropy multiplied by the number of leaves.
        
     
      
-    
      
-    
      Phylogenetic information
      
-    
+    
      
+    
      Phylogenetic information
      
+
 
 
 
      Phylogenetic information expresses the information content of a split
@@ -264,9 +217,9 @@ 
      Phylogenetic information
      
 (Thorley et al. 1998)
 .
      
     
      
-    
      
-    
      Consensus information
      
-    
+    
      
+    
      Consensus information
      
+
 
 
 
      The information content of splits in a consensus tree is calculated by
@@ -275,40 +228,40 @@ 
      Consensus information
      
 that split, following Smith (2022)
 .
      
     
      
-    
      
-    
      References
      
+    
      
+    
      References
      
     
      Smith MR (2022).
 “Using information theory to detect rogue taxa and improve consensus trees.”
 Systematic Biology, syab099.
 doi:10.1093/sysbio/syab099
 .

       Thorley JL, Wilkinson M, Charleston M (1998).
 “The information content of consensus trees.”
-In Rizzi A, Vichi M, Bock H (eds.), Advances in Data Science and Classification, 91--98.
+In Rizzi A, Vichi M, Bock H (eds.), Advances in Data Science and Classification, 91–98.
 Springer, Berlin.
 doi:10.1007/978-3-642-72253-0_12
 .

       Vinh NX, Epps J, Bailey J (2010).
 “Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance.”
-Journal of Machine Learning Research, 11, 2837--2854.
+Journal of Machine Learning Research, 11, 2837–2854.
 doi:10.1145/1553374.1553511
 .
      
     
      
-    
      
-    
      See also
      
+    
      
+    
      See also
      
     
      An introduction to the phylogenetic information content of a split is given
 in SplitInformation()
 and in a package vignette.
      
-
      Other information functions: 
+
      Other information functions:
 SplitEntropy(),
 SplitSharedInformation()
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
      library("TreeTools", quietly = TRUE)
 
 SplitwiseInfo(PectinateTree(8))
@@ -369,37 +322,23 @@ 
      Examples
      
 #> [1] 18.31378
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/TreesConsistentWithTwoSplits.html b/dev/reference/TreesConsistentWithTwoSplits.html
new file mode 100644
index 000000000..71bf81223
--- /dev/null
+++ b/dev/reference/TreesConsistentWithTwoSplits.html
@@ -0,0 +1,8 @@
+
+  
+    
+    
+    
+  
+
+
diff --git a/dev/reference/VisualizeMatching.html b/dev/reference/VisualizeMatching.html
index d7f174a53..327658bf0 100644
--- a/dev/reference/VisualizeMatching.html
+++ b/dev/reference/VisualizeMatching.html
@@ -1,122 +1,74 @@
 
-Visualise a matching — VisualizeMatching • TreeDistVisualise a matching — VisualizeMatching • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Visualise a matching
      
-    Source: R/VisualizeMatching.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Visualise a matching
      
+      Source: R/VisualizeMatching.R
+      
      VisualizeMatching.Rd
      
     
      
 
-    
      
+    
      
     
      Depict the splits that are matched between two trees using a specified
 Generalized Robinson–Foulds
 similarity measure.
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      VisualizeMatching(
   Func,
   tree1,
@@ -132,61 +84,63 @@ 
      Visualise a matching
      
 )
      
     
      
 
-    
      
-    
      Arguments
      
-    
      Func
      
+    
      
+    
      Arguments
      
+
+
+
      Func
      
 
      Function used to construct tree similarity.
      
 
 
-
      tree1, tree2
      
+
      tree1, tree2
      
 
      Trees of class phylo, with identical leaf labels.
      
 
 
-
      setPar
      
+
      setPar
      
 
      Logical specifying whether graphical parameters should be
 set to display trees side by side.
      
 
 
-
      precision
      
+
      precision
      
 
      Integer specifying number of significant figures to display
 when reporting matching scores.
      
 
 
-
      Plot
      
+
      Plot
      
 
      Function to use to plot trees.
      
 
 
-
      matchZeros
      
+
      matchZeros
      
 
      Logical specifying whether to pair splits with zero
 similarity (TRUE), or leave them unpaired (FALSE).
      
 
 
-
      plainEdges
      
+
      plainEdges
      
 
      Logical specifying whether to plot edges with a uniform
 width and colour (TRUE), or whether to draw edge widths according to the
 similarity of the associated splits (FALSE).
      
 
 
-
      edge.width, edge.color, ...
      
+
      edge.width, edge.color, ...
      
 
      Additional parameters to send to Plot().
      
 
 
      
-    
      
-    
      Details
      
+    
      
+    
      Details
      
     
      Note that when visualizing a Robinson–Foulds distance (using
 Func = RobinsonFouldsMatching), matched splits are assigned a similarity
 score of 1, which is deducted from the total number of splits to calculate
 the Robinson–Foulds distance.  Unmatched splits thus contribute one to
 total tree distance.
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
      tree1 <- TreeTools::BalancedTree(6)
 tree2 <- TreeTools::PectinateTree(6)
 
@@ -196,37 +150,23 @@ 
      Examples
      
 
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/cluster-statistics.html b/dev/reference/cluster-statistics.html
index cd00f5dbf..d82cf0bbf 100644
--- a/dev/reference/cluster-statistics.html
+++ b/dev/reference/cluster-statistics.html
@@ -1,118 +1,68 @@
 
-Cluster size statistics — cluster-statistics • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Cluster size statistics
      
-    Source: R/cluster_stats.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Cluster size statistics
      
+      Source: R/cluster_stats.R
+      
      cluster-statistics.Rd
      
     
      
 
-    
      
+    
      
     
      Cluster size statistics
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      SumOfRanges(x, cluster = 1)
 
 SumOfVariances(x, cluster = 1)
@@ -134,65 +84,56 @@ 
      Cluster size statistics
      
 MeanMSTEdge(x, cluster = 1)
      
     
      
 
-    
      
-    
      Arguments
      
-    
      x
      
+    
      
+    
      Arguments
      
+
+
+
      x
      
 
      Matrix in which each row lists the coordinates of a point
 in a Euclidian space; or, where supported, dist object specifying
 distances between each pair of points.
      
 
 
-
      cluster
      
+
      cluster
      
 
      Optional integer vector specifying the cluster or group to
 which each row in x belongs.
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      SumOfRanges() returns a numeric specifying the sum of ranges
+    
      
+    
      Value
      
+    
      SumOfRanges() returns a numeric specifying the sum of ranges
 within each cluster across all dimensions.
      
-
-
 
      SumOfVariances() returns a numeric specifying the sum of variances
 within each cluster across all dimensions.
      
-
-
 
      MeanCentroidDistance() returns a numeric specifying the mean
 distance from the centroid to points in each cluster.
      
-
-
 
      DistanceFromMedian() returns a numeric specifying the mean distance
 of each point (except the median) from the median point of its cluster.
      
-
-
 
      MeanNN() returns a numeric specifying the mean distance from each
 point within a cluster to its nearest neighbour.
      
-
-
 
      MeanMSTEdge() returns a numeric specifying the mean length of an
 edge in the minimum spanning tree of points within each cluster.
      
     
      
-    
      
-    
      See also
      
-    
      Other tree space functions: 
+    
      
+    
      See also
      
+    
      Other tree space functions:
+Islands(),
 MSTSegments(),
 MapTrees(),
 MappingQuality(),
 SpectralEigens(),
 median.multiPhylo()
      
-
      Other cluster functions: 
+
      Other cluster functions:
 KMeansPP()
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
      points <- rbind(matrix(1:16, 4), rep(1, 4), matrix(1:32, 8, 4) / 10)
 cluster <- rep(1:3, c(4, 1, 8))
 
@@ -218,37 +159,23 @@ 
      Examples
      
 #> [1] 2.0  NA 0.2
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/dot-MASTSizeEdges.html b/dev/reference/dot-MASTSizeEdges.html
index ac0031bba..a9e486c47 100644
--- a/dev/reference/dot-MASTSizeEdges.html
+++ b/dev/reference/dot-MASTSizeEdges.html
@@ -1,167 +1,105 @@
 
-Calculate MAST size from edge matrices. — .MASTSizeEdges • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Calculate MAST size from edge matrices.
      
-    Source: R/tree_distance_mast.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Calculate MAST size from edge matrices.
      
+      Source: R/tree_distance_mast.R
+      
      dot-MASTSizeEdges.Rd
      
     
      
 
-    
      
+    
      
     
      Internal function.
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      .MASTSizeEdges(edge1, edge2, nTip)
      
     
      
 
-    
      
-    
      Arguments
      
-    
      edge1
      
+    
      
+    
      Arguments
      
+
+
+
      edge1
      
 
      Edge matrix of tree 1. Must be in postorder!
      
 
 
-
      edge2
      
+
      edge2
      
 
      Edge matrix of tree 2.
      
 
 
-
      nTip
      
+
      nTip
      
 
      Integer specifying the number of leaves in each split.
      
 
 
      
 
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/dot-PairMean.html b/dev/reference/dot-PairMean.html
index 27050cba7..7d7fc9322 100644
--- a/dev/reference/dot-PairMean.html
+++ b/dev/reference/dot-PairMean.html
@@ -1,153 +1,88 @@
 
-Mean of two numbers — .PairMean • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Mean of two numbers
      
-    Source: R/tree_distance_info.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Mean of two numbers
      
+      Source: R/tree_distance_info.R
+      
      dot-PairMean.Rd
      
     
      
 
-    
      
+    
      
     
      Used for normalization and range calculation
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      .PairMean(x, y)
      
     
      
 
 
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/dot-TreeDistance.html b/dev/reference/dot-TreeDistance.html
index 9cad3963b..108f50d50 100644
--- a/dev/reference/dot-TreeDistance.html
+++ b/dev/reference/dot-TreeDistance.html
@@ -1,169 +1,107 @@
 
-Calculate distance between trees, or lists of trees — .TreeDistance • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Calculate distance between trees, or lists of trees
      
-    Source: R/tree_distance_utilities.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Calculate distance between trees, or lists of trees
      
+      Source: R/tree_distance_utilities.R
+      
      dot-TreeDistance.Rd
      
     
      
 
-    
      
+    
      
     
      Calculate distance between trees, or lists of trees
      
     
      
 
-    
      
+    
      
+    
      Usage
      
     
      .TreeDistance(Func, tree1, tree2, checks = TRUE, ...)
      
     
      
 
-    
      
-    
      Arguments
      
-    
      checks
      
+    
      
+    
      Arguments
      
+
+
+
      checks
      
 
      Logical specifying whether to perform basic sanity checks to
 avoid crashes in C++.
      
 
 
      
-    
      
-    
      See also
      
+    
      
+    
      See also
      
     
      CalculateTreeDistance
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/index.html b/dev/reference/index.html
index f53d73a26..dc12c164d 100644
--- a/dev/reference/index.html
+++ b/dev/reference/index.html
@@ -1,295 +1,343 @@
 
-Function reference • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-      
      Reference
      
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Package index
      
     
      
 
-    
-      
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-      
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-      
-        
-      
-        
-      
-      
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-      
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
      
-          
      Tree distance measures 
      
-          
      Functions for calculating distances between pairs of trees.
      
-        
      
-          
      TreeDistance() SharedPhylogeneticInfo() DifferentPhylogeneticInfo() PhylogeneticInfoDistance() ClusteringInfoDistance() ExpectedVariation() MutualClusteringInfo() SharedPhylogeneticInfoSplits() MutualClusteringInfoSplits() MatchingSplitInfo() MatchingSplitInfoDistance() MatchingSplitInfoSplits() 
      
-        
      Information-based generalized Robinson–Foulds distances
      
-          
      NyeSimilarity() NyeSplitSimilarity() 
      
-        
      Nye et al. (2006) tree comparison
      
-          
      KendallColijn() KCVector() PathVector() SplitVector() KCDiameter() 
      
-        
      Kendall–Colijn distance
      
-          
      MatchingSplitDistance() MatchingSplitDistanceSplits() 
      
-        
      Matching Split Distance
      
-          
      JaccardRobinsonFoulds() JaccardSplitSimilarity() 
      
-        
      Jaccard–Robinson–Foulds metric
      
-          
      MASTSize() MASTInfo() 
      
-        
      Maximum Agreement Subtree size
      
-          
      NNIDist() NNIDiameter() 
      
-        
      Approximate Nearest Neighbour Interchange distance
      
-          
      PathDist() 
      
-        
      Path distance
      
-          
      InfoRobinsonFoulds() InfoRobinsonFouldsSplits() RobinsonFoulds() RobinsonFouldsMatching() RobinsonFouldsSplits() 
      
-        
      Robinson–Foulds distances, with adjustments for phylogenetic information content
      
-          
      SPRDist() 
      
-        
      Approximate Subtree Prune and Regraft distance
      
-          
      CompareAll() 
      
-        
      Distances between each pair of trees
      
-          
      VisualizeMatching() 
      
-        
      Visualise a matching
      
-          
      Tree space 
      
-          
      Functions for the construction, evaluation and exploration of tree space.
      
-        
      
-          
      MSTSegments() StrainCol() 
      
-        
      Add minimum spanning tree to plot, colouring by stress
      
-          
      MapTrees() Project() 
      
-        
      Graphical user interface for mapping distances and analysing tree space
      
-          
      MappingQuality() ProjectionQuality() 
      
-        
      Faithfulness of mapped distances
      
-          
      SpectralEigens() SpectralClustering() 
      
-        
      Eigenvalues for spectral clustering
      
-          
      SumOfRanges() SumOfVariances() SumOfVars() MeanCentroidDistance() MeanCentDist() MeanCentroidDist() DistanceFromMedian() DistFromMed() MeanNN() MeanMSTEdge() 
      
-        
      Cluster size statistics
      
-          
      median(<multiPhylo>) 
      
-        
      Median of a set of trees
      
-          
      Plot3() 
      
-        
      Pseudo-3D plotting
      
-          
      Cluster analysis 
      
-          
      Functions for identifying and interrogating clusters of trees.
      
-        
      
-          
      KMeansPP() 
      
-        
      k-means++ clustering
      
-          
      SumOfRanges() SumOfVariances() SumOfVars() MeanCentroidDistance() MeanCentDist() MeanCentroidDist() DistanceFromMedian() DistFromMed() MeanNN() MeanMSTEdge() 
      
-        
      Cluster size statistics
      
-          
      Information 
      
-          
      Functions addressing the information content and entropy of splits.
      
-        
      
-          
      AllSplitPairings() 
      
-        
      Variation of information for all split pairings
      
-          
      Entropy() 
      
-        
      Entropy in bits
      
-          
      MeilaVariationOfInformation() MeilaMutualInformation() 
      
-        
      Use variation of clustering information to compare pairs of splits
      
-          
      SplitsCompatible() 
      
-        
      Are splits compatible?
      
-          
      SplitEntropy() 
      
-        
      Entropy of two splits
      
-          
      SplitSharedInformation() SplitDifferentInformation() TreesConsistentWithTwoSplits() LnTreesConsistentWithTwoSplits() Log2TreesConsistentWithTwoSplits() 
      
-        
      Shared information content of two splits
      
-          
      SplitwiseInfo() ClusteringEntropy() ClusteringInfo() ConsensusInfo() 
      
-        
      Information content of splits within a tree
      
-          
      Utility functions 
      
-          
      Functions to facilitate interaction with the package.
      
-        
      
-          
      CompareAll() 
      
-        
      Distances between each pair of trees
      
-          
      LAPJV() 
      
-        
      Solve linear assignment problem using LAPJV
      
-          
      Plot3() 
      
-        
      Pseudo-3D plotting
      
-          
      StartParallel() SetParallel() GetParallel() StopParallel() 
      
-        
      Calculate distances in parallel
      
-          
      VisualizeMatching() 
      
-        
      Visualise a matching
      
-
-  
-
      
+    
      
+      
      Tree distance measures
      
+
+      
      Functions for calculating distances between pairs of trees.
      
+
+
+    
      
+
+
+
+
+      
      
+
+          TreeDistance() SharedPhylogeneticInfo() DifferentPhylogeneticInfo() PhylogeneticInfoDistance() ClusteringInfoDistance() ExpectedVariation() MutualClusteringInfo() SharedPhylogeneticInfoSplits() MutualClusteringInfoSplits() MatchingSplitInfo() MatchingSplitInfoDistance() MatchingSplitInfoSplits()
+
+        
      
+        
      Information-based generalized Robinson–Foulds distances
      
+      
      
+
+          NyeSimilarity() NyeSplitSimilarity()
+
+        
      
+        
      Nye et al. (2006) tree comparison
      
+      
      
+
+          KendallColijn() KCVector() PathVector() SplitVector() KCDiameter()
+
+        
      
+        
      Kendall–Colijn distance
      
+      
      
+
+          MatchingSplitDistance() MatchingSplitDistanceSplits()
+
+        
      
+        
      Matching Split Distance
      
+      
      
+
+          JaccardRobinsonFoulds() JaccardSplitSimilarity()
+
+        
      
+        
      Jaccard–Robinson–Foulds metric
      
+      
      
+
+          MASTSize() MASTInfo()
+
+        
      
+        
      Maximum Agreement Subtree size
      
+      
      
+
+          NNIDist() NNIDiameter()
+
+        
      
+        
      Approximate Nearest Neighbour Interchange distance
      
+      
      
+
+          PathDist()
+
+        
      
+        
      Path distance
      
+      
      
+
+          InfoRobinsonFoulds() InfoRobinsonFouldsSplits() RobinsonFoulds() RobinsonFouldsMatching() RobinsonFouldsSplits()
+
+        
      
+        
      Robinson–Foulds distances, with adjustments for phylogenetic information content
      
+      
      
+
+          SPRDist()
+
+        
      
+        
      Approximate the Subtree Prune and Regraft (SPR) distance.
      
+      
      
+
+          CompareAll()
+
+        
      
+        
      Distances between each pair of trees
      
+      
      
+
+          VisualizeMatching()
+
+        
      
+        
      Visualise a matching
      
+      
      
+      
      Tree space
      
+
+      
      Functions for the construction, evaluation and exploration of tree space.
      
+
+
+    
      
+
+
+
+
+      
      
+
+          Islands()
+
+        
      
+        
      Find islands from distance matrix
      
+      
      
+
+          MSTSegments() StrainCol()
+
+        
      
+        
      Add minimum spanning tree to plot, colouring by stress
      
+      
      
+
+          MapTrees() Project()
+
+        
      
+        
      Graphical user interface for mapping distances and analysing tree space
      
+      
      
+
+          MappingQuality() ProjectionQuality()
+
+        
      
+        
      Faithfulness of mapped distances
      
+      
      
+
+          SpectralEigens() SpectralClustering()
+
+        
      
+        
      Eigenvalues for spectral clustering
      
+      
      
+
+          SumOfRanges() SumOfVariances() SumOfVars() MeanCentroidDistance() MeanCentDist() MeanCentroidDist() DistanceFromMedian() DistFromMed() MeanNN() MeanMSTEdge()
+
+        
      
+        
      Cluster size statistics
      
+      
      
 
+          median(<multiPhylo>)
 
-      
      
+        
      Median of a set of trees
      
+      
      
+
+          Plot3()
+
+        
      
+        
      Pseudo-3D plotting
      
+      
      
+      
      Cluster analysis
      
+
+      
      Functions for identifying and interrogating clusters of trees.
      
+
+
+    
      
+
+
+
+
+      
      
+
+          KMeansPP()
+
+        
      
+        
      k-means++ clustering
      
+      
      
+
+          SumOfRanges() SumOfVariances() SumOfVars() MeanCentroidDistance() MeanCentDist() MeanCentroidDist() DistanceFromMedian() DistFromMed() MeanNN() MeanMSTEdge()
+
+        
      
+        
      Cluster size statistics
      
+      
      
+      
      Information
      
+
+      
      Functions addressing the information content and entropy of splits.
      
+
+
+    
      
+
+
+
+
+      
      
+
+          AllSplitPairings()
+
+        
      
+        
      Variation of information for all split pairings
      
+      
      
+
+          Entropy()
+
+        
      
+        
      Entropy in bits
      
+      
      
+
+          MeilaVariationOfInformation() MeilaMutualInformation()
+
+        
      
+        
      Use variation of clustering information to compare pairs of splits
      
+      
      
+
+          SplitsCompatible()
+
+        
      
+        
      Are splits compatible?
      
+      
      
+
+          SplitEntropy()
+
+        
      
+        
      Entropy of two splits
      
+      
      
+
+          SplitSharedInformation() SplitDifferentInformation() TreesConsistentWithTwoSplits() LnTreesConsistentWithTwoSplits() Log2TreesConsistentWithTwoSplits()
+
+        
      
+        
      Shared information content of two splits
      
+      
      
+
+          SplitwiseInfo() ClusteringEntropy() ClusteringInfo() ConsensusInfo()
+
+        
      
+        
      Information content of splits within a tree
      
+      
      
+      
      Utility functions
      
+
+      
      Functions to facilitate interaction with the package.
      
+
+
+    
      
+
+
+
+
+      
      
+
+          CompareAll()
+
+        
      
+        
      Distances between each pair of trees
      
+      
      
+
+          LAPJV()
+
+        
      
+        
      Solve linear assignment problem using LAPJV
      
+      
      
+
+          Plot3()
+
+        
      
+        
      Pseudo-3D plotting
      
+      
      
+
+          ReduceTrees()
+
+        
      
+        
      Collapse areas of agreement between two trees
      
+      
      
+
+          StartParallel() SetParallel() GetParallel() StopParallel()
+
+        
      
+        
      Calculate distances in parallel
      
+      
      
+
+          VisualizeMatching()
+
+        
      
+        
      Visualise a matching
      
+      
      
+  
      
+
+
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/reference/median.multiPhylo.html b/dev/reference/median.multiPhylo.html
index 9b0aa2ba1..bb2726f4a 100644
--- a/dev/reference/median.multiPhylo.html
+++ b/dev/reference/median.multiPhylo.html
@@ -1,121 +1,72 @@
 
-Median of a set of trees — median.multiPhylo • TreeDist
-    
-
-    
      
-      
      
-  
      
-    
      
-    
      Median of a set of trees
      
-    Source: R/median.R
-    
+
    • Changelog
      • 
+      
        • 
+      
      
+
+
+  
      
+
      
+
      
+  
      
+
+      
      Median of a set of trees
      
+      Source: R/median.R
+      
      median.multiPhylo.Rd
      
     
      
 
-    
      
-    
      Calculate the single binary tree that represents the geometric median --
-an "average" -- of a forest of tree topologies.
      
+    
      
+    
      Calculate the single binary tree that represents the geometric median –
+an "average" – of a forest of tree topologies.
      
     
      
 
-    
      
-    
      # S3 method for multiPhylo
+    
      
+    
      Usage
      
+    
      # S3 method for class 'multiPhylo'
 median(
   x,
   na.rm = FALSE,
@@ -126,81 +77,78 @@ 
      Median of a set of trees
      
 )
      
     
      
 
-    
      
-    
      Arguments
      
-    
      x
      
+    
      
+    
      Arguments
      
+
+
+
      x
      
 
      Object of class multiPhylo containing phylogenetic trees.
      
 
 
-
      na.rm, ...
      
+
      na.rm, ...
      
 
      Unused; included for consistency with default function..
      
 
 
-
      Distance
      
+
      Distance
      
 
      Function to calculate distances between each pair
 of trees in x.
      
 
 
-
      index
      
+
      index
      
 
      Logical: if TRUE, return the index of the median tree(s);
 if FALSE, return the tree itself.
      
 
 
-
      breakTies
      
+
      breakTies
      
 
      Logical: if TRUE, return a single tree with the minimum
 score; if FALSE, return all tied trees.
      
 
 
      
-    
      
-    
      Value
      
-    
-
-
      median() returns an object of class phylo
      
-
-
-
      corresponding to the geometric median of a set of trees:
+    
      
+    
      Value
      
+    
      median() returns an object of class phylo
+corresponding to the geometric median of a set of trees:
 that is, the tree whose average distance from all other trees in the set
 is lowest.
 If multiple trees tie in their average distance, the first will be returned,
-unless breakTies = FALSE, in which case an object of class multiPhylo
      
-
-
-
      containing all such trees will be returned.
      
+unless breakTies = FALSE, in which case an object of class multiPhylo
+containing all such trees will be returned.
      
     
      
-    
      
-    
      Details
      
+    
      
+    
      Details
      
     
      The geometric median is the tree that exhibits the shortest average distance
 from each other tree topology in the set.
 It represents an "average" of a set of trees, though note that an unsampled
-tree may be closer to the geometric "centre of gravity" of the input set --
+tree may be closer to the geometric "centre of gravity" of the input set –
 such a tree would not be considered.
      
 
      The result will depend on the metric chosen to calculate distances between
 tree topologies. In the absence of a natural metric of tree topologies,
-the default choice is ClusteringInfoDistance() -- which discards
+the default choice is ClusteringInfoDistance() – which discards
 branch length information.
 If specifying a different function, be sure that it returns a difference,
 rather than a similarity.
      
     
      
-    
      
-    
      See also
      
+    
      
+    
      See also
      
     
      Consensus methods:
 ape::consensus(),
 TreeTools::ConsensusWithout()
      
-
      Other tree space functions: 
+
      Other tree space functions:
+Islands(),
 MSTSegments(),
 MapTrees(),
 MappingQuality(),
 SpectralEigens(),
 cluster-statistics
      
     
      
-    
      
-    
      Author
      
+    
      
+    
      Author
      
     
      Martin R. Smith
 (martin.smith@durham.ac.uk)
      
     
      
 
-    
      
-    
      Examples
      
+    
      
+    
      Examples
      
     
      library("TreeTools", quietly = TRUE)
 tenTrees <- as.phylo(1:10, nTip = 8)
 
@@ -243,37 +191,23 @@ 
      Examples
      
 #> Rooted; no branch lengths.
 
      
     
      
-  
      
-  
-
      
+  
      
 
 
-      
      
-  
      Developed by Martin R. Smith.
      
+    
      
-
-  
-
+    
      
+
+
+
+
+
+  
 
diff --git a/dev/search.json b/dev/search.json
new file mode 100644
index 000000000..b4a21f1b6
--- /dev/null
+++ b/dev/search.json
@@ -0,0 +1 @@
+[{"path":"https://ms609.github.io/TreeDist/dev/CODE_OF_CONDUCT.html","id":null,"dir":"","previous_headings":"","what":"Contributor Code of Conduct","title":"Contributor Code of Conduct","text":"contributors maintainers project, pledge respect people contribute reporting issues, posting feature requests, updating documentation, submitting pull requests patches, activities. committed making participation project harassment-free experience everyone, regardless level experience, gender, gender identity expression, sexual orientation, disability, personal appearance, body size, race, ethnicity, age, religion. Examples unacceptable behavior participants include use sexual language imagery, derogatory comments personal attacks, trolling, public private harassment, insults, unprofessional conduct. Project maintainers right responsibility remove, edit, reject comments, commits, code, wiki edits, issues, contributions aligned Code Conduct. Project maintainers follow Code Conduct may removed project team. Instances abusive, harassing, otherwise unacceptable behavior may reported opening issue contacting one project maintainers. Code Conduct adapted Contributor Covenant (https://www.contributor-covenant.org), version 1.0.0, available https://contributor-covenant.org/version/1/0/0/.","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/CONTRIBUTING.html","id":"fixing-typos","dir":"","previous_headings":"","what":"Fixing typos","title":"CONTRIBUTING","text":"Small typos grammatical errors documentation may edited directly using GitHub web interface, long changes made source file. : edit roxygen comment .R file R/. DON’T: edit .Rd file man/.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/CONTRIBUTING.html","id":"prerequisites","dir":"","previous_headings":"","what":"Prerequisites","title":"CONTRIBUTING","text":"make substantial pull request, always file issue make sure someone team agrees ’s problem. ’ve found bug, create associated issue illustrate bug minimal reprex.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/CONTRIBUTING.html","id":"pull-request-process","dir":"","previous_headings":"","what":"Pull request process","title":"CONTRIBUTING","text":"recommend create Git branch pull request (PR). Look GitHub actions CodeCovr build status making changes. follow Google’s R style guide use camelCase variable names, TitleCase function names. use Oxford ending ‘ize’ (‘ise’), UK spelling (e.g. ‘colour’) possible avoid distinction (e.g. shortening ‘col’) use roxygen2 build documentation. use testthat. Contributions test cases included easier accept. use semantic versioning. user-facing changes, add bullet top NEWS.md current development version header describing changes made followed GitHub username, links relevant issue(s)/PR(s).","code":""},{"path":"https://ms609.github.io/TreeDist/dev/CONTRIBUTING.html","id":"contributor-license-agreement","dir":"","previous_headings":"","what":"Contributor license agreement","title":"CONTRIBUTING","text":"Contributors agree reassign copyright contributions maintainers package.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/CONTRIBUTING.html","id":"code-of-conduct","dir":"","previous_headings":"","what":"Code of Conduct","title":"CONTRIBUTING","text":"Please note project released Contributor Code Conduct. contributing project agree abide terms.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/CONTRIBUTING.html","id":"prefer-to-e-mail","dir":"","previous_headings":"","what":"Prefer to e-mail?","title":"CONTRIBUTING","text":"E-mail person listed maintainer DESCRIPTION file repo. Private discussions email don’t help others - course email totally warranted sensitive problems.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/CONTRIBUTING.html","id":"thanks-for-contributing","dir":"","previous_headings":"","what":"Thanks for contributing!","title":"CONTRIBUTING","text":"document adapted tidyverse contributing guide.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/articles/Generalized-RF.html","id":"shared-phylogenetic-information","dir":"Articles","previous_headings":"","what":"Shared phylogenetic information","title":"Generalized Robinson-Foulds distances","text":"shared phylogenetic information tree distance measure (Smith, 2020), pairs splits assigned similarity score corresponds amount phylogenetic information (sensu Steel & Penny, 2006) share common (see separate vignette), concept introduced (though developed) Nelson (1979).  distance measured bits; measure, total information content tree given ","code":"VisualizeMatching(SharedPhylogeneticInfo, tree1, tree2,                    Plot = TreeDistPlot, matchZeros = FALSE) SharedPhylogeneticInfo(tree1, tree2) ## [1] 12.32188 SplitwiseInfo(tree1) ## [1] 28.67404"},{"path":"https://ms609.github.io/TreeDist/dev/articles/Generalized-RF.html","id":"conflicting-splits-can-nevertheless-be-instructive","dir":"Articles","previous_headings":"Shared phylogenetic information","what":"Conflicting splits can nevertheless be instructive","title":"Generalized Robinson-Foulds distances","text":"Shared phylogenetic information assigns zero similarity incompatible splits, .e. occur single tree. leads problematic behaviour certain cases: example, swapping position two distant leaves (leaves ‘’ ‘J’ ) can disproportionately reduce similarity – example, zero.","code":"VisualizeMatching(SharedPhylogeneticInfo, AtoJ, swapAJ,                   Plot = TreeDistPlot, matchZeros = FALSE, prune = c(5, 18))"},{"path":"https://ms609.github.io/TreeDist/dev/articles/Generalized-RF.html","id":"mutual-clustering-information","dir":"Articles","previous_headings":"","what":"Mutual clustering information","title":"Generalized Robinson-Foulds distances","text":"Scoring pair splits according mutual clustering information (Smith, 2020) (see separate vignette) results information-based tree distance metric recognizes similarity tree structure even every possible pairing splits conflicts:  pair non-trivial splits zero mutual clustering information, even dissimilar pairing (HI|ABCDEFG ⇒ EI|ABCDFGH ) (slightly) preferable leaving split unpaired.  total mutual clustering information single tree given ","code":"VisualizeMatching(MutualClusteringInfo, AtoJ, swapAJ,                   Plot = TreeDistPlot, matchZeros = FALSE, prune = c(5, 18)) MutualClusteringInfo(AtoJ, swapAJ) ## [1] 1.348339 VisualizeMatching(MutualClusteringInfo, tree1, tree2,                    Plot = TreeDistPlot, matchZeros = FALSE) ClusteringEntropy(tree1) ## [1] 5.120281"},{"path":"https://ms609.github.io/TreeDist/dev/articles/Generalized-RF.html","id":"nye-et-al--tree-similarity-metric","dir":"Articles","previous_headings":"","what":"Nye et al. tree similarity metric","title":"Generalized Robinson-Foulds distances","text":"Nye et al. (2006) tree similarity metric scores pairs considering elements held common subsets split. Consider pair splits ABCDEF|GHIJ ABCDEIJ|FGH. can aligned thus: first pair subsets, ABCDEF ABCDEIJ, five elements common (ABCDE), together encompass eight elements (ABCDEFIJ). subset score thus 58\\frac{5}{8}. second pair subsets, GHIJ FGH, two elements (GH) common, five total (FGHIJ), hence receive subset score 25\\frac{2}{5}. split alignment receives alignment score corresponding lower two subset scores, 25\\frac{2}{5}. must now consider alignment pair splits, yields subset scores 18\\frac{1}{8} 29\\frac{2}{9}, thus alignment score 18\\frac{1}{8}. alignment gives lower score , disregarded. pair splits allocated similarity score corresponding better alignment: 25\\frac{2}{5}. , splits match exactly receive similarity score 1, manner analogous Robinson–Foulds distance. (despite fact splits likely match others.) possible pair splits receive zero similarity score.","code":"ABCDEF  | GHIJ ABCDE IJ|FGH ABCDEF  |     GHIJ      FGH|ABCDE  IJ VisualizeMatching(NyeSimilarity, tree1, tree2,                    Plot = TreeDistPlot, matchZeros = FALSE) NyeSimilarity(tree1, tree2, normalize = FALSE) ## [1] 3.5"},{"path":"https://ms609.github.io/TreeDist/dev/articles/Generalized-RF.html","id":"jaccardrobinsonfoulds-metric","dir":"Articles","previous_headings":"Nye et al. tree similarity metric","what":"Jaccard–Robinson–Foulds metric","title":"Generalized Robinson-Foulds distances","text":"Böcker et al. (2013) employ split similarity calculation Nye et al. (), suggest raised arbitrary exponent order -weight contribution paired splits identical. order metric converge Robinson–Foulds metric exponent grows towards infinity, resulting score doubled.   figure shows JRF distance two trees plotted varies value exponent k, relative Nye et al. Robinson–Foulds distances trees:  theoretical practical performance JRF metric, speed calculation, best lower values k (Smith, 2020), raising question whether exponent useful. Böcker et al. (2013) suggest ‘reasonable’ matchings exhibit property term arboreality. definition arboreal matching supposes trees rooted, case split corresponds clade. arboreal matching rooted tree, pairing splits conflicts pairing splits. Consider case splits ‘’ ‘B’ tree 1 paired respectively splits ‘C’ ‘D’ tree 2. ‘’ paired ‘C’ ‘B’ ‘D’, avoid conflict: nested within B, C must nested within D B nested within , D must nested within C B overlap, C D must overlap. Equivalent statements unrooted trees little harder express. Unfortunately, constructing arboreal matchings NP-complete, making optimal arboreal matching slow find. faster alternative prohibit pairings contradictory splits, though distances generated approach theoretically less coherent practically effective calculated contradictory splits may paired, advantage approach slight increase calculation speed (Smith, 2020).","code":"JaccardRobinsonFoulds(tree1, tree2, k = 1) ## [1] 4 VisualizeMatching(JaccardRobinsonFoulds, tree1, tree2,                   Plot = TreeDistPlot, matchZeros = FALSE) JRF2 <- function(...) JaccardRobinsonFoulds(k = 2, ...) JRF2(tree1, tree2) ## [1] 5.638889 VisualizeMatching(JRF2, tree1, tree2,                   Plot = TreeDistPlot, matchZeros = FALSE)"},{"path":"https://ms609.github.io/TreeDist/dev/articles/Generalized-RF.html","id":"matching-split-distance","dir":"Articles","previous_headings":"","what":"Matching Split Distance","title":"Generalized Robinson-Foulds distances","text":"Bogdanowicz & Giaro (2012) propose alternative distance, term Matching Split Distance. (approach independently proposed Lin et al. (2012).)  Note visualization shows difference, rather similarity, splits. Similar Nye et al. similarity metric, method compares subsets implied pair splits. , relevant quantity number elements must moved one subset another order make two splits identical. pair splits three leaves (‘F’, ‘’ ‘J’) must moved splits identical; , pair splits assigned difference score three. Formally, SiS_i splits nn leaves bipartitions AiA_i BiB_i, difference score calculated n−mn - m mm counts number leaves already match, defined m=max{|A1∩A2|+|B1∩B2|,|A1∩B2|+|B1∩A2|}m = \\max\\{|A_1 \\cap A_2| + |B_1 \\cap B_2|, |A_1 \\cap B_2| + |B_1 \\cap A_2|\\} distance difficult normalize, easy calculate maximum value.","code":"MatchingSplitDistance(tree1, tree2) ## [1] 5 VisualizeMatching(MatchingSplitDistance, tree1, tree2,                   Plot = TreeDistPlot, matchZeros = FALSE) ABCDEF  | GHIJ ABCDE IJ|FGH MatchingSplitDistance(read.tree(text='((a, b, c, d, e, f), (g, h, i, j));'),                       read.tree(text='((a, b, c, d, e, i, j), (g, h, f));')) ## [1] 3"},{"path":"https://ms609.github.io/TreeDist/dev/articles/Generalized-RF.html","id":"information-theoretic-alternative","dir":"Articles","previous_headings":"Matching Split Distance","what":"Information theoretic alternative","title":"Generalized Robinson-Foulds distances","text":"matching split distance, mm represents simple count number shared taxa. alternative measure phylogenetic information content largest split consistent S1S_1 S2S_2: m=max{h(A1∩A2|B1∩B2),h(A1∩B2|B1∩A2)}m = \\max\\{h(A_1 \\cap A_2 | B_1 \\cap B_2), h(A_1 \\cap B_2 | B_1 \\cap A_2)\\} information-rich split consistent ABCDE | GH, contains bits phylogenetic information. value can used similarity score pairing splits.","code":"ABCDEF  | GHIJ ABCDE IJ|FGH TreeTools::SplitInformation(5, 2) ## [1] 3.169925 MatchingSplitInfoDistance(tree1, tree2) ## [1] 17.27586 VisualizeMatching(MatchingSplitInfoDistance, tree1, tree2,                   Plot = TreeDistPlot, matchZeros = FALSE)"},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/articles/Robinson-Foulds.html","id":"the-robinsonfoulds-distance","dir":"Articles","previous_headings":"","what":"The Robinson–Foulds distance","title":"Extending the Robinson-Foulds metric","text":"intuitive way calculate similarity two trees calculate resolution strict consensus, corresponds number splits occur trees (Schuh & Polhemus, 1980). corresponding distance measure, Robinson–Foulds distance (Robinson & Foulds, 1981), counts number splits unique one two trees. important remember counting splits counting clades, edges nodes. tree drawn rooted (even without root edge), number splits one less number edges clades, two less number nodes. example, trees one split, two edges three nodes common.  simplicity counting splits appealing, limited underlying assumption splits equivalent. example, split separates eight leaves two sets four (right-hand tree ) 135\\frac{1}{35} chance compatible reference tree. contrast, split separates two leaves six 17\\frac{1}{7} chance matching reference tree: similarity observed five times likely arisen chance. words, failure match even split less noteworthy failure match uneven one. consequence, trees whose splits less even , average, exhibit higher Robinson–Foulds distances comparison trees. Compare balanced unbalanced eight-taxon tree:  tree divides eight taxa five splits. phylogenetic information content split function probability split match uniformly chosen random tree, .e. proportion eight-leaf binary trees contain split question. (Information content, bits, defined −log2(probability)-\\log_2(\\textrm{probability}).) , turn, function evenness split: first tree, split 1 even, dividing four taxa four others (4|4); splits 2–5 maximally uneven (2|6). split treated independent, total information content five splits 19.37 bits, whereas five splits second tree, sizes 2|6, 3|5, 4|4, 3|5 2|6, 22.54 bits. Put another way, random tree average share splits balanced tree (whose splits predominantly uneven thus likely matched) asymmetric tree (contains even splits less likely occur random tree). Indeed, 10 395 eight-leaf trees, many bear least one split common balanced tree asymmetric tree:","code":""},{"path":"https://ms609.github.io/TreeDist/dev/articles/Robinson-Foulds.html","id":"information-corrected-robinsonfoulds-distance","dir":"Articles","previous_headings":"","what":"Information-corrected Robinson–Foulds distance","title":"Extending the Robinson-Foulds metric","text":"differing information content can accommodated weighting split according amount phylogenetic information contains (Smith, 2020). two tree pairs Robinson–Foulds distance two, first pair differ regard uneven split (ABCDEF|GH), obtain total difference 22.54 − (3.46 + 5.04 + 5.53 + 5.04) = 3.46 bits:  whereas second pair differ resolution even, thus information-rich, split (ABCD|EFGH), receive distance score 5.53 bits:","code":"tree1 <- ape::read.tree(text='(1, (2, (3, (4, (5, (6, (7, 8)))))));') tree2 <- ape::read.tree(text='(1, (2, (3, (4, (5, (7, (6, 8)))))));') tree3 <- ape::read.tree(text='(1, (2, (3, (5, (4, (6, (7, 8)))))));')  VisualizeMatching(InfoRobinsonFoulds, tree1, tree2,                    Plot = TreeDistPlot, prune = 12) VisualizeMatching(InfoRobinsonFoulds, tree1, tree3,                    Plot = TreeDistPlot, prune = 8)"},{"path":"https://ms609.github.io/TreeDist/dev/articles/Robinson-Foulds.html","id":"generalized-robinsonfoulds-distances","dir":"Articles","previous_headings":"","what":"Generalized Robinson–Foulds distances","title":"Extending the Robinson-Foulds metric","text":"Even accounting information content splits way, Robinson–Foulds distance readily saturated: maximum value can obtained moving single leaf.  Generalized Robinson–Foulds distances (Böcker, Canzar, & Klau, 2013; Nye, Liò, & Gilks, 2006) seek address issue. category metrics aim acknowledge semblances similar---quite-identical pairs splits, contribute zero tree similarity standard Robinson–Foulds measure. Generalized RF distances work finding matching pairs splits one tree splits . pairing scored according similarity paired splits; sum scores score matching. tree distance given score optimal matching.","code":"tree1 <- ape::read.tree(text='(1, (2, (3, (4, (5, (6, (7, 8)))))));') tree2 <- ape::read.tree(text='(8, (1, (2, (3, (4, (5, (6, 7)))))));')  VisualizeMatching(RobinsonFouldsMatching, tree1, tree2, Plot = TreeDistPlot)"},{"path":"https://ms609.github.io/TreeDist/dev/articles/Robinson-Foulds.html","id":"constructing-a-matching","dir":"Articles","previous_headings":"Generalized Robinson–Foulds distances","what":"Constructing a matching","title":"Extending the Robinson-Foulds metric","text":"Let’s consider two trees differ position one wildcard leaf, resolution clade:  trees obtain Robinson–Foulds distance nine: large distances, maximum possible trees resolution eleven. AB|CDEFGHI split common two trees:  distance score higher might expected, given much trees common; removing single leaf ‘’ results two trees differ resolution single node:  hidden similarity can better reflected similar, non-identical, splits assigned non-zero similarity scores. various ways score similarity two splits. One build idea introduced , identical splits scored according phylogenetic information content. Non-matching splits can scored according amount phylogenetic information hold common, function proportion trees consistent splits. (full explanation provided discussion Generalized Robinson–Foulds distances.)  , split AB|CDEFGHI occurs trees, , happens, makes largest contribution tree similarity score (3.70) particular pair trees. contribution made information-corrected Robinson–Foulds similarity. split ABCDEF|GHI left-hand tree paired split ABCDEFI|GH right-hand tree. ABCDEF|GHI available right-hand tree, perfect match assigned similarity SplitInformation(3, 6) = 5.57 bits. partial match instead allocated lower score 2.12 bits. Pairings incompatible splits, .e. co-exist tree, ABCDEFG|HI - ABCDFGH|EI, phylogenetic information common. (clustering information alternative way think split similarity recognizes similarity even incompatible splits.) matching depicted one many. happens optimal: optimal matching can found considering similarity score possible pairing, solving linear assignment problem find optimal set pairings. can view splits tree, named according number associated node: can see similarity scores pair splits, along optimal matching: .. denotes fifth matching contributes zero similarity score; alternative optimal matching leave splits unpaired.","code":"tree1 <- ape::read.tree(text='((A, B), ((C, (D, E)), (F, (G, (H, I)))));') tree2 <- ape::read.tree(text='((A, B), ((C, D, (E, I)), (F, (G, H))));')  Plot(tree1, tree2, highlight = 'I', prune = list(8, integer(0))) TwoTreePlot() VisualizeMatching(RobinsonFouldsMatching, tree1, tree2) TwoTreePlot() VisualizeMatching(RobinsonFouldsMatching,                   drop.tip(tree1, 'I'),                   drop.tip(tree2, 'I')) TwoTreePlot() VisualizeMatching(SharedPhylogeneticInfo, tree1, tree2) summary(TreeTools::as.Splits(tree1, LETTERS[1:9])) ## 6 bipartition splits dividing 9 tips, A .. I ##      123456789 ##  11  **....... ##  13  ..***.... ##  14  ...**.... ##  15  .....**** ##  16  ......*** ##  17  .......** ##  ##  Tip 1: A     Tip 2: B    Tip 3: C    Tip 4: D    Tip 5: E    ##  Tip 6: F     Tip 7: G    Tip 8: H    Tip 9: I summary(TreeTools::as.Splits(tree2, LETTERS[1:9])) ## 5 bipartition splits dividing 9 tips, A .. I ##      123456789 ##  11  **....... ##  13  ..***...* ##  14  ....*...* ##  15  .....***. ##  16  ......**. ##  ##  Tip 1: A     Tip 2: B    Tip 3: C    Tip 4: D    Tip 5: E    ##  Tip 6: F     Tip 7: G    Tip 8: H    Tip 9: I attributes(SharedPhylogeneticInfo(tree1, tree2, reportMatching = TRUE)) ## $matching ## [1]  1  2 NA  4  5  3 ##  ## $pairScores ##           [,1]      [,2]      [,3]      [,4]      [,5] ## [1,] 3.7004397 0.8930848 0.2410081 0.5305147 0.2410081 ## [2,] 0.5305147 3.2529807 0.0000000 1.1825914 0.5305147 ## [3,] 0.2410081 1.3785116 0.0000000 0.5305147 0.2410081 ## [4,] 0.8930848 0.0000000 0.0000000 3.2529807 1.3785116 ## [5,] 0.5305147 0.0000000 0.0000000 0.0000000 2.1154772 ## [6,] 0.2410081 0.0000000 0.0000000 0.0000000 0.0000000 ##  ## $matchedSplits ## [1] \"A B | C D E F G H I => A B | C D E F G H I\" ## [2] \"C D E | A B F G H I => C D E I | A B F G H\" ## [3] \"F G H I | A B C D E => F G H | A B C D E I\" ## [4] \"G H I | A B C D E F => G H | A B C D E F I\" ## [5] \"H I | A B C D E F G .. E I | A B C D F G H\""},{"path":"https://ms609.github.io/TreeDist/dev/articles/Robinson-Foulds.html","id":"what-next","dir":"Articles","previous_headings":"Generalized Robinson–Foulds distances","what":"What next?","title":"Extending the Robinson-Foulds metric","text":"Alternatives measures split similarity, mutual clustering information, give rise Generalized Robinson–Foulds distances, can used generate meaningful tree spaces.","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/articles/Using-TreeDist.html","id":"loading-trees","dir":"Articles","previous_headings":"","what":"Loading trees","title":"Calculate tree similarity with 'TreeDist'","text":"Instructions loading phylogenetic trees R can found separate vignette. examples, ’ll enter two simple trees hand:","code":"tree1 <- ape::read.tree(text = '(A, ((B, (C, (D, E))), ((F, G), (H, I))));') tree2 <- ape::read.tree(text = '(A, ((B, (C, (D, (H, I)))), ((F, G), E)));')"},{"path":"https://ms609.github.io/TreeDist/dev/articles/Using-TreeDist.html","id":"calculating-distances","dir":"Articles","previous_headings":"","what":"Calculating distances","title":"Calculate tree similarity with 'TreeDist'","text":"can calculate distances pairs trees using ‘TreeDist’ package. First ’ll install package. can either install stable version CRAN repository: development version, GitHub – contain latest features may extensively tested: ’ll load package R’s working environment: Now package’s functions available within R. Let’s proceed calculate tree distances.","code":"install.packages('TreeDist') devtools::install_github('ms609/TreeDist') library('TreeDist')"},{"path":"https://ms609.github.io/TreeDist/dev/articles/Using-TreeDist.html","id":"pairs-of-trees","dir":"Articles","previous_headings":"Calculating distances","what":"Pairs of trees","title":"Calculate tree similarity with 'TreeDist'","text":"Calculating distance two trees simple : convenience function TreeDistance() returns variation clustering information two trees, normalized total information content splits.","code":"distance <- TreeDistance(tree1, tree2)"},{"path":"https://ms609.github.io/TreeDist/dev/articles/Using-TreeDist.html","id":"multiple-comparisons","dir":"Articles","previous_headings":"Calculating distances","what":"Multiple comparisons","title":"Calculate tree similarity with 'TreeDist'","text":"two trees compare, can send list trees (class: list multiPhylo) distance comparison function. function calculate distance tree first list tree second.","code":"oneTree <- ape::rtree(11) twoTrees <- structure(list(one = ape::rtree(11), two = ape::rtree(11)),                       class = 'multiPhylo') threeTrees <- list(a = ape::rtree(11), b = ape::rtree(11), c = ape::rtree(11))  TreeDistance(oneTree, twoTrees) ##       one       two  ## 0.7826864 0.6856279 TreeDistance(twoTrees, threeTrees) ##             a         b         c ## one 0.8620894 0.7514794 0.7861809 ## two 0.8556624 0.7150163 0.7658788"},{"path":"https://ms609.github.io/TreeDist/dev/articles/Using-TreeDist.html","id":"visualizing-a-matching","dir":"Articles","previous_headings":"","what":"Visualizing a matching","title":"Calculate tree similarity with 'TreeDist'","text":"Generalized Robinson–Foulds metrics, variation clustering information, rely matching split within tree another split tree. can view optimal matching:  shows six splits tree 1, paired splits tree two. split labelled measure similarity, contribution total tree similarity score. can view information format accessible examination R : , pairScores attribute lists score possible matching splits. can identify splits : names splits correspond number associated node original tree:  Note strictly, (informative) splits associated (internal) edges. avoid listing split twice, nodes close root (, 10 11) associated split.","code":"VisualizeMatching(ClusteringInfoDistance, tree1, tree2) ClusteringInfoDistance(tree1, tree2, reportMatching = TRUE) ## [1] 6.960578 ## attr(,\"matching\") ## [1] 1 2 3 5 6 4 ## attr(,\"pairScores\") ##             [,1]        [,2]       [,3]       [,4]       [,5]       [,6] ## [1,] 0.091091008 0.007214618 0.01831078 0.22478751 0.01831078 0.22478751 ## [2,] 0.018310782 0.072780226 0.00000000 0.15200728 0.00000000 0.15200728 ## [3,] 0.002565287 0.002565287 0.02475761 0.09288851 0.02475761 0.09288851 ## [4,] 0.007214618 0.007214618 0.07278023 0.31976006 0.07278023 0.31976006 ## [5,] 0.319760062 0.224787510 0.15200728 0.09288851 0.45810590 0.76420451 ## [6,] 0.224787510 0.319760062 0.45810590 0.76420451 0.15200728 0.09288851 ## attr(,\"matchedSplits\") ## [1] \"B C D E | A F G H I => B C D H I | A E F G\" ## [2] \"C D E | A B F G H I => C D H I | A B E F G\" ## [3] \"D E | A B C F G H I => D H I | A B C E F G\" ## [4] \"F G H I | A B C D E => E F G | A B C D H I\" ## [5] \"F G | A B C D E H I => F G | A B C D E H I\" ## [6] \"H I | A B C D E F G => H I | A B C D E F G\" splits <- as.character(TreeTools::as.Splits(tree2)) splits ##                    12                    13                    14  ## \"B C D H I | A F G E\" \"C D H I | A B F G E\" \"D H I | A B C F G E\"  ##                    15                    16                    17  ## \"H I | A B C D F G E\" \"F G E | A B C D H I\" \"F G | A B C D H I E\" oldPar <- par(mar = rep(0, 4)) plot(tree2) ape::nodelabels() ape::nodelabels(splits, as.integer(names(splits)),                  adj = c(1.1, -0.2), cex = 0.8, frame = 'none')"},{"path":"https://ms609.github.io/TreeDist/dev/articles/Using-TreeDist.html","id":"what-next","dir":"Articles","previous_headings":"","what":"What next?","title":"Calculate tree similarity with 'TreeDist'","text":"may wish : Provide context tree distances Compare trees different tips Review available distance measures corresponding functions Interpret tree distance metrics Visualize tree landscapes using distance-based tree spaces","code":""},{"path":"https://ms609.github.io/TreeDist/dev/articles/compare-treesets.html","id":"shiny-app","dir":"Articles","previous_headings":"","what":"Shiny app","title":"Comparing sets of trees from different analyses","text":"can accomplished quickly using MapTrees() graphical user interface: Load trees file: Select first tree file Select appropriate sample size Select Replace existing Load additional set trees file using Add batch existing Display tab, select Point symbols: One per batch, Colour points : Batch","code":""},{"path":"https://ms609.github.io/TreeDist/dev/articles/compare-treesets.html","id":"scripting-at-the-r-command-line","dir":"Articles","previous_headings":"","what":"Scripting at the R command line","title":"Comparing sets of trees from different analyses","text":"control mapping can obtained command line:  robust analyses (potentially misleading!) 2D plot , consult companion vignette. Note also mapped areas regions overlap may correspond reality; see warnings recommendations Smith (2022a).","code":"# Load trees library(\"TreeTools\", quietly = TRUE) batch1 <- as.phylo(1:60, 8) # Generate 60 similar trees  batch2 <- as.phylo(seq(200, 800, length.out = 30), 8) # A separate batch of 30 trees styles <- c(1, 2) # Select plotting colours / symbols treeStyle <- rep(styles, c(length(batch1), length(batch2)))  # Calculate distances library(\"TreeDist\") distances <- ClusteringInfoDistance(c(batch1, batch2))  # Construct over-simple 2D PCoA mapping mapping <- cmdscale(distances, k = 2) # Plot mapping par(mar = rep(0, 4)) plot(mapping,      asp = 1, # Preserve aspect ratio - do not distort distances      ann = FALSE, axes = FALSE, # Don't label axes: dimensions are meaningless      col = treeStyle, # Colour      pch = treeStyle # Plotting symbol      ) legend(\"left\", c(\"Batch 1\", \"Batch 2\"), col = styles, pch = styles)"},{"path":"https://ms609.github.io/TreeDist/dev/articles/compare-treesets.html","id":"comparing-trees-dispersal-hypervolume","dir":"Articles","previous_headings":"","what":"Comparing trees’ dispersal / hypervolume","title":"Comparing sets of trees from different analyses","text":"Interpreting comparing areas tree space projection can misleading – expanded apparent area Greenland Mercator projection familiar example. , always best work original distances interpreting whether sets trees occupy larger smaller regions tree space.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/articles/compare-treesets.html","id":"distances-from-median","dir":"Articles","previous_headings":"Comparing trees’ dispersal / hypervolume","what":"Distances from median","title":"Comparing sets of trees from different analyses","text":"One approach plot distances median tree:  plotted example, distances median tree greater batch 2 batch 1, indicating dispersed set trees occupies greater hypervolume. Note increased frequency higher distances expected: outer shell sphere contains volume layer equivalent thickness closer centre, phenomenon becomes pronounced dimensionality tree space increases.","code":"# Calculate median trees median1 <- median(batch1) median2 <- median(batch2)  # Compute distance from each tree to the median of its batch dist1 <- ClusteringInfoDist(batch1, median1) dist2 <- ClusteringInfoDist(batch2, median2)  # Set resolution of histogram nBreaks <- 10 breaks <- seq(0, max(dist1, dist2), length.out = nBreaks)  # Plot first distance set hist(dist1, col = \"#00000022\", breaks = breaks,      main = \"Distance from median of batch\",      xlab = \"Clustering information distance\",      ylim = c(0, 25) # Omit this line to infer Y axis limit from first batch.      )  # Add second distance set hist(dist2, col = \"#ff000022\", breaks = breaks, add = TRUE)  # Add legend legend(\"topleft\", c(\"Batch 1\", \"Batch 2\"),        fill = c(\"#00000022\",  \"#ff000022\"))"},{"path":"https://ms609.github.io/TreeDist/dev/articles/compare-treesets.html","id":"consensus-resolution","dir":"Articles","previous_headings":"Comparing trees’ dispersal / hypervolume","what":"Consensus resolution","title":"Comparing sets of trees from different analyses","text":"complementary approach identify resolution consensus batch trees. approach shares many problems Robinson–Foulds distance: particular, resolution can decimated single “rogue” taxon whose position poorly defined (Smith, 2022b). Detecting removing rogue taxa can provide meaningful point comparison.  Whereas direct interpretation analysis straightforward, can provide complementary way understanding distribution trees across tree space.","code":"# Create tree set with a rogue taxon batch3 <- AddTipEverywhere(as.phylo(7, 7), \"t8\")  # Set up plotting area par(mfrow = c(2, 2), mar = rep(0.4, 4))  # Plot naive strict consensus plot(consensus(batch1, p = 1)) plot(consensus(batch3, p = 1))  if (requireNamespace(\"Rogue\", quietly = TRUE)) {   cons1 <- ConsensusWithout(batch1, p = 1,                             Rogue::QuickRogue(batch1, p = 1)[-1, \"taxon\"])   cons3 <- ConsensusWithout(batch3, p = 1,                             Rogue::QuickRogue(batch3, p = 1)[-1, \"taxon\"])      # The information content of each tree gives a measure of its resolution,   # accounting for omitted rogue leaves   SplitwiseInfo(cons1) # 8.5 bits   SplitwiseInfo(cons3) # 15.1 bits: higher resolution indicates that these   # trees are more similar, notwithstanding rogue taxa.      # Plot the trees   plot(cons1)   plot(cons3) } else {   message(\"The package 'Rogue' is required to run this example.\") }"},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/articles/information.html","id":"splits","dir":"Articles","previous_headings":"","what":"Splits","title":"Comparing splits using information theory","text":"internal edge tree represents split divides leaves two partitions. Intuitively, splits instructive others. example, fact mammals reptiles represent two separate groups profound enough worth teaching schoolchildren; much less information represented split identifies two species bat closely related one another mammal reptile.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/articles/information.html","id":"quantifying-information","dir":"Articles","previous_headings":"","what":"Quantifying information","title":"Comparing splits using information theory","text":"can formalize intuition splits contain information others? generally, can quantify amount information? Information usually measured bits. One bit amount information generated tossing fair coin: record outcome coin toss, must record either H T, two symbols equally likely, way compress results multiple tosses. Shannon (1948) information content outcome xx defined h(x)=−log2P(x)h(x) = -\\log_2{P(x)}, simplifies log2n\\log_2{n} nn outcomes equally likely. Thus, outcome fair coin toss delivers log22=1 bit\\log_2{2} = 1\\textrm{ bit} information; outcome rolling fair six-sided die contains log26≈2.58 bits\\log_2{6} \\approx 2.58\\textrm{ bits} information; outcome selecting random one 105 unrooted binary six-leaf trees log2105≈6.71 bits\\log_2{105} \\approx 6.71\\textrm{ bits}. Unlikely outcomes surprising, thus contain information likely outcomes. information content rolling twelve two fair six-sided dice −log2136≈5.16 bits-\\log_2{\\frac{1}{36}} \\approx 5.16\\textrm{ bits}, whereas seven, produced six 36 possible rolls (1 & 6, 2 & 5, …), less surprising, thus contains less information: −log2636≈2.58 bits-\\log_2{\\frac{6}{36}} \\approx 2.58\\textrm{ bits}. additional 2.58 bits information required establish six possible rolls produced seven.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/articles/information.html","id":"application-to-splits","dir":"Articles","previous_headings":"Quantifying information","what":"Application to splits","title":"Comparing splits using information theory","text":"split S1=S_1 =AB|CDEF found 15 105 six-leaf trees; , probability randomly drawn tree contains S1S_1 P(S1)=15105P(S_1) = \\frac{15}{105}, information content h(S1)=−log215105≈2.81 bitsh(S_1) = -\\log_2{\\frac{15}{105}} \\approx 2.81\\textrm{ bits}. Steel & Penny (2006) dub quantity phylogenetic information content. Likewise, split S2=S_2 =ABC|DEF occurs nine 105 six-leaf trees, h(S2)=−log29105≈3.54 bitsh(S_2) = -\\log_2{\\frac{9}{105}} \\approx 3.54\\textrm{ bits}. Three six-leaf trees contain splits, combination splits deliver h(S1,S2)=−log23105≈5.13 bitsh(S_1,S_2) = -\\log_2{\\frac{3}{105}} \\approx 5.13\\textrm{ bits} information. h(S1,S2) 0.5 denotes good evidence clustering, > 0.7 strong evidence (Kaufman & Rousseeuw, 1990). evidence visually apparent clustering strong first appears. Let’s explore two-cluster hierarchical clustering solution anyway. can visualize clustering solution tree:  Another thing may wish take consensus cluster:  , learn two clusters distinguished position t7.","code":"possibleClusters <- 2:10  # Partitioning around medoids pamClusters <- lapply(possibleClusters, function(k) cluster::pam(distances, k = k)) pamSils <- vapply(pamClusters, function(pamCluster) {   mean(cluster::silhouette(pamCluster)[, 3]) }, double(1))  bestPam <- which.max(pamSils) pamSil <- pamSils[bestPam] pamCluster <- pamClusters[[bestPam]]$cluster  # Hierarchical clustering hTree <- protoclust(distances) hClusters <- lapply(possibleClusters, function(k) cutree(hTree, k = k)) hSils <- vapply(hClusters, function(hCluster) {   mean(cluster::silhouette(hCluster, distances)[, 3]) }, double(1))  bestH <- which.max(hSils) hSil <- hSils[bestH] hCluster <- hClusters[[bestH]]  # k-means++ clustering kClusters <- lapply(possibleClusters, function(k) KMeansPP(distances, k = k)) kSils <- vapply(kClusters, function(kCluster) {   mean(cluster::silhouette(kCluster$cluster, distances)[, 3]) }, double(1))  bestK <- which.max(kSils) kSil <- kSils[bestK] kCluster <- kClusters[[bestK]]$cluster  plot(pamSils ~ possibleClusters,      xlab = \"Number of clusters\", ylab = \"Silhouette coefficient\",      ylim = range(c(pamSils, hSils))) points(hSils ~ possibleClusters, pch = 2, col = 2) points(kSils ~ possibleClusters, pch = 3, col = 3) legend(\"topright\", c(\"PAM\", \"Hierarchical\", \"k-means++\"),        pch = 1:3, col = 1:3) nClusters <- 2 whichResult <- match(nClusters, possibleClusters) cluster <- hClusters[[whichResult]] class(hTree) <- \"hclust\" par(mar = c(0, 0, 0, 0)) plot(hTree, labels = FALSE, main = \"\") points(seq_along(trees), rep(1, length(trees)), pch = 16,        col = spectrum[hTree$order]) par(mfrow = c(1, 2), mar = rep(0.2, 4)) col1 <- spectrum[mean(treeNumbers[cluster == 1])] col2 <- spectrum[mean(treeNumbers[cluster == 2])] plot(consensus(trees[cluster == 1], p = 0.5),      edge.color = col1, edge.width = 2, tip.color = col1) plot(consensus(trees[cluster == 2], p = 0.5),      edge.color = col2, edge.width = 2, tip.color = col2)"},{"path":"https://ms609.github.io/TreeDist/dev/articles/treespace.html","id":"identifying-islands","dir":"Articles","previous_headings":"Avoiding common pitfalls in tree space analysis","what":"Identifying islands","title":"Tree space analysis","text":"Besides clustering, can also define ‘islands’ tree space separated ‘moat’, trees one island separated trees another least certain distance (Silva & Wilkinson, 2021).  Let’s view consensus large island cluster:","code":"par(mar = rep(0, 4)) # set a threshold corresponding to the width of the \"moat\" between islands threshold <- 1.8 island <- Islands(distances, threshold)  # See how many trees are on each island table(island) ## island ##  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26  ## 89  3  3  3  3  3  3  3  3  3  3 57  1  1  3  2  1  1  3  1  1  3  1  3  3  3  ## 27 28 29 30 31 32 33 34 35 36  ##  3  3  1  1  1  1  2  3  1  1 # Let's ignore the small islands for now largeIsle <- Islands(distances, threshold, smallest = 5)  # Colour trees according to their island plot(mapping,      asp = 1, # Preserve aspect ratio - do not distort distances      ann = FALSE, axes = FALSE, # Don't label axes: dimensions are meaningless      col = ifelse(is.na(largeIsle), \"grey\", largeIsle + 1),      pch = 16      ) par(mfrow = c(1, 2), mar = rep(0.2, 4)) plot(consensus(trees[!is.na(largeIsle) & largeIsle == 1], p = 0.5),      edge.color = 2, edge.width = 2, tip.color = 2) plot(consensus(trees[!is.na(largeIsle) & largeIsle == 2], p = 0.5),      edge.color = 3, edge.width = 2, tip.color = 3)"},{"path":"https://ms609.github.io/TreeDist/dev/articles/treespace.html","id":"validating-a-mapping","dir":"Articles","previous_headings":"Avoiding common pitfalls in tree space analysis","what":"Validating a mapping","title":"Tree space analysis","text":"Now let’s evaluate whether map tree space representative. First want know many dimensions necessary adequately represent true distances trees. hope trustworthiness × continuity score > 0.9 usable mapping, > 0.95 good one.  going need least five dimensions adequately represent distances trees. help establish visually structures likely genuine, might also choose calculate minimum spanning tree: Let’s plot first five dimensions tree space, highlighting convex hulls clusters:  clusters, distinct dimension 1, overlap strongly every dimension. fact minimum spanning tree moves clusters also underlines fact well defined appear eye. Note cluster membership, well precise shape tree space, function tree distance metric. phylogenetic information distance recovers different pair clusters, may correspond apparent simple visual inspection two-dimensional tree space plot:","code":"txc <- vapply(seq_len(ncol(mapping)), function(k) {   newDist <- dist(mapping[, seq_len(k)])   MappingQuality(distances, newDist, 10)[\"TxC\"] }, 0) plot(txc, xlab = \"Dimension\") abline(h = 0.9, lty = 2) mstEnds <- MSTEdges(distances) nDim <- which.max(txc > 0.9) plotSeq <- matrix(0, nDim, nDim) plotSeq[upper.tri(plotSeq)] <- seq_len(nDim * (nDim - 1) / 2) plotSeq <- t(plotSeq[-nDim, -1]) plotSeq[nDim * 1:3] <- (nDim * (nDim - 1) / 2) + 1:3 layout(plotSeq) par(mar = rep(0.1, 4))  for (i in 2:nDim) for (j in seq_len(i - 1)) {   # Set up blank plot   plot(mapping[, j], mapping[, i], ann = FALSE, axes = FALSE, frame.plot = TRUE,        type = \"n\", asp = 1, xlim = range(mapping), ylim = range(mapping))      # Plot MST   MSTSegments(mapping[, c(j, i)], mstEnds,               col = StrainCol(distances, mapping[, c(j, i)]))      # Add points   points(mapping[, j], mapping[, i], pch = 16, col = treeCols)    # Mark clusters   for (clI in unique(cluster)) {     inCluster <- cluster == clI     clusterX <- mapping[inCluster, j]     clusterY <- mapping[inCluster, i]     hull <- chull(clusterX, clusterY)     polygon(clusterX[hull], clusterY[hull], lty = 1, lwd = 2,             border = \"#54de25bb\")     text(mean(clusterX), mean(clusterY), clI, col = \"#54de25bb\", font = 2)   } } # Annotate dimensions plot(0, 0, type = \"n\", ann = FALSE, axes = FALSE) text(0, 0, \"Dimension 2\") plot(0, 0, type = \"n\", ann = FALSE, axes = FALSE) text(0, 0, \"Dimension 3\") plot(0, 0, type = \"n\", ann = FALSE, axes = FALSE) text(0, 0, \"Dimension 4\")"},{"path":"https://ms609.github.io/TreeDist/dev/articles/treespace.html","id":"comparing-cluster-size","dir":"Articles","previous_headings":"Avoiding common pitfalls in tree space analysis","what":"Comparing cluster size","title":"Tree space analysis","text":"tempting compare size clusters calculating area convex hulls two-dimensional mapping. However, mapped areas necessarily correspond true hypervolumes. Accuracy may improved comparing higher dimensions projections using “hypervolume” package, though considerations apply (Blonder et al., 2018). Interpretation overlap statistics detailed Mammola (2019). objective quantify spread different clusters, metrics may easier interpret clusters’ hypervolume (e.g. T. J. Smith & Donoghue (2022)). divergence outlying points can measures using sum ranges: overall size cluster can measured using sum variances, mean distance centroid median: density points within cluster can measured using mean nearest-neighbour distance mean minimum spanning tree edge length:","code":"hypervolumeInstalled <- requireNamespace(\"hypervolume\", quietly = TRUE) if (hypervolumeInstalled) {   library(\"hypervolume\")   hv1 <- hypervolume_gaussian(pid_mapping[pid_cluster == 1, 1:3],                               verbose = FALSE)   hv2 <- hypervolume_gaussian(pid_mapping[pid_cluster == 2, 1:3],                               verbose = FALSE)   hv_dist <- hypervolume_distance(hv1, hv2)   capture.output(     hyperset <- hypervolume_set(hv1, hv2, verbose = FALSE,                               check.memory = FALSE)   ) -> XX_VerboseNotRespected   hv_overlap <- hypervolume_overlap_statistics(hyperset)   hv_dist   hv_overlap } else {   print(\"Install the 'hypervolume' package to run this example\") } ##       jaccard      sorensen frac_unique_1 frac_unique_2  ##    0.02648093    0.05159556    0.94582792    0.95074700 SumOfRanges(pid_mapping, pid_cluster) ## [1] 132.0758 127.3610 SumOfVariances(pid_mapping, pid_cluster) ## [1] 173.0981 176.8212 MeanCentroidDistance(pid_mapping, pid_cluster) ## [1] 12.58064 12.80727 DistanceFromMedian(pid_mapping, pid_cluster) ## [1] 13.42931 13.48348 MeanNN(pid_mapping, pid_cluster) ## [1] 4.676416 5.274230 MeanMSTEdge(pid_mapping, pid_cluster) ## [1] 5.558778 5.804829"},{"path":"https://ms609.github.io/TreeDist/dev/articles/treespace.html","id":"self-organizing-maps","dir":"Articles","previous_headings":"","what":"Self-organizing maps","title":"Tree space analysis","text":"alternative approach visualizing tree space create emergent self-organizing maps (Kohonen, 1982; Thrun, Lerch, Lötsch, & Ultsch, 2016; Ultsch, 2003), map high-dimensional data two dimensions, add third dimension indicate distance data points: nearby points occur valleys, separated ridges distant data points.","code":"umatrixInstalled <- requireNamespace(\"Umatrix\", quietly = TRUE) if (umatrixInstalled) {   map <- Umatrix::esomTrain(as.matrix(distances), Key = seq_along(trees),                             Epochs = 5, # Increase for better results                             Lines = 42,                             Columns = 42,                             Toroid = FALSE)      Umatrix::plotMatrix(Matrix = map$Umatrix,                       Toroid = FALSE, FixedRatio = TRUE,                       TransparentContours = FALSE, Clean = TRUE) +   ggplot2::geom_point(data = data.frame(x = map$BestMatches[, 3],                                         y = map$BestMatches[, 2]),                       shape = 19, color = treeCols, size = 2)  } else {   message(\"Install the 'Umatrix' package to run this example\") } ## [1] \"Epoch: 1 started\" ## [1] \"Epoch: 1 finished. 220 datapoints changed bestmatch\" ## [1] \"Epoch: 2 started\" ## [1] \"Epoch: 2 finished. 216 datapoints changed bestmatch\" ## [1] \"Epoch: 3 started\" ## [1] \"Epoch: 3 finished. 212 datapoints changed bestmatch\" ## [1] \"Epoch: 4 started\" ## [1] \"Epoch: 4 finished. 203 datapoints changed bestmatch\" ## [1] \"Epoch: 5 started\" ## [1] \"Epoch: 5 finished. 165 datapoints changed bestmatch\" ## [1] \"---- Esom Training Finished ----\""},{"path":"https://ms609.github.io/TreeDist/dev/articles/treespace.html","id":"what-next","dir":"Articles","previous_headings":"","what":"What next?","title":"Tree space analysis","text":"may wish : Analyse landscapes phylogenetic trees Provide context tree distances Review available distance measures corresponding functions Interpret tree distance metrics Compare distribution different sets trees","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/articles/using-distances.html","id":"normalizing","dir":"Articles","previous_headings":"","what":"Normalizing","title":"Contextualizing tree distances","text":"maximum value tree distance metrics scales size trees compared. Typically, resolution trees also impacts range possible values. , can difficult interpret tree distance value without suitable context. Normalizing distance metric one way render meaning obvious. Selecting appropriate normalizing constant may require careful consideration purpose tree distance metric put. default normalization behaviour function normalize = TRUE listed function reference, can viewed typing ?FunctionName R terminal.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/articles/using-distances.html","id":"nye-et-al--tree-similarity","dir":"Articles","previous_headings":"Normalizing","what":"Nye et al. tree similarity","title":"Contextualizing tree distances","text":"Let’s work simple example using Nye et al. (2006) similarity metric compare two imperfectly-resolved trees.  nice metric start , maximum similarity pair splits defined one. (Astute readers might worry minimum similarity greater zero – ’s harder problem overcome.) , maximum similarity possible two 11-leaf trees NSplits(11) = 8. Normalizing value tells us similar two trees , compared two identical eleven-leaf binary trees. approach result similarity score less one two trees identical, fully resolved (.e. binary). , might prefer compare tree similarity maximum score possible two trees specified resolution. value given number splits least resolved two trees: concisely, can provide normalizing function: approach produce similarity one one tree less-resolved version another (thus identical). comparing lists trees, best value depend number splits pair trees. can use function pmin() select less resolved pair trees: avoid limitations, may instead opt normalize average number splits two trees. default normalization method NyeSimilarity(): Finally, tree1 “target” tree – perhaps one used simulate data , independently known true virtuous – may wish normalize best possible match tree. case, best possible score normalized score ","code":"library(\"TreeDist\") tree1 <- ape::read.tree(text = '(A, ((B, ((C, D), (E, F))), (G, (H, (I, J, K)))));') tree2 <- ape::read.tree(text = '(A, (B, (C, D, E, (J, K)), (F, (G, H, I))));') VisualizeMatching(NyeSimilarity, tree1, tree2,                   Plot = TreeDistPlot, matchZeros = FALSE) NyeSimilarity(tree1, tree2, normalize = FALSE) / 8 ## [1] 0.2744048 NyeSimilarity(tree1, tree2, normalize = 8) ## [1] 0.2744048 NyeSimilarity(tree1, tree2,                   normalize = min(TreeTools::NSplits(list(tree1, tree2)))) ## [1] 0.5488095 NyeSimilarity(tree1, tree2, normalize = min) ## [1] 0.2744048 NyeSimilarity(list(tree1, tree2), list(tree1, tree2), normalize = pmin) ##           [,1]      [,2] ## [1,] 0.8750000 0.2744048 ## [2,] 0.2744048 0.5000000 NyeSimilarity(tree1, tree2, normalize = TRUE) ## [1] 0.3991342 TreeTools::NSplits(tree1) ## [1] 7 NyeSimilarity(tree1, tree2, normalize = TreeTools::NSplits(tree1)) ## [1] 0.3136054"},{"path":"https://ms609.github.io/TreeDist/dev/articles/using-distances.html","id":"normalizing-to-random-similarity","dir":"Articles","previous_headings":"Normalizing","what":"Normalizing to random similarity","title":"Contextualizing tree distances","text":"diameter (maximum possible distance) Nye et al. tree similarity metric easy calculate, case metrics. example, clustering information distance metric (Smith, 2020) ranges principle zero total clustering entropy present pair trees. even modest number leaves, pairs trees exist every split one tree perfectly contradicted every split ; , pair trees necessarily degree similarity. context, can relevant normalize tree similarity expected distance pair random trees, rather maximum value (see Vinh, Epps, & Bailey, 2010). measure, distances greater one denote trees different expected chance, whereas distance zero denotes identity. quartet divergence, expected tree distance readily calculated: given quartet one three chance matching chance. expected distance difficult calculate metrics, can approximated sampling random pairs trees. Measured distances 10 000 pairs random bifurcating trees 200 leaves available data package ‘TreeDistData’. can view (normalized) distances selection methods:  use calculated values normalize tree distance:","code":"library(\"Quartet\", exclude = \"RobinsonFoulds\") expectedQD <- 2 / 3 normalizedQD <- QuartetDivergence(QuartetStatus(tree1, tree2),                                   similarity = FALSE) / expectedQD if (requireNamespace(\"TreeDistData\", quietly = TRUE)) {   library(\"TreeDistData\", exclude = \"PairwiseDistances\")   data(\"randomTreeDistances\", package = \"TreeDistData\")      methods <- c(\"pid\", \"cid\", \"nye\", \"qd\")   methodCol <- c(pid = \"#e15659\", cid = \"#58a14e\", nye = \"#edc949\",                  qd = \"#af7aa1\")      oldPar <- par(cex = 0.7, mar = c(5, 5, 0.01, 0.01))   nLeaves <- as.integer(dimnames(randomTreeDistances)[[3]])   plot(nLeaves, type = \"n\", randomTreeDistances[\"pid\", \"mean\", ],        ylim = c(0.54, 1),        xlab = \"Number of leaves\",        ylab = \"Normalized distance between random tree pairs\")      for (method in methods) {     dat <- randomTreeDistances[method, , ]     lines(nLeaves, dat[\"50%\", ], pch = 1, col = methodCol[method])     polygon(c(nLeaves, rev(nLeaves)), c(dat[\"25%\", ], rev(dat[\"75%\", ])),             border = NA, col = paste0(methodCol[method], \"55\"))        }      text(202, randomTreeDistances[methods, \"50%\", \"200\"] + 0.02,         c(\"Different phylogenetic information\",           \"Clustering information distance\",          expression(paste(plain(\"Nye \"), italic(\"et al.\"))),          \"Quartet divergence\"          ), col = methodCol[methods], pos = 2)   par(oldPar) } expectedCID <- randomTreeDistances[\"cid\", \"mean\", \"9\"] ClusteringInfoDistance(tree1, tree2, normalize = TRUE) / expectedCID"},{"path":"https://ms609.github.io/TreeDist/dev/articles/using-distances.html","id":"testing-similarity-to-a-known-tree","dir":"Articles","previous_headings":"","what":"Testing similarity to a known tree","title":"Contextualizing tree distances","text":"Similarity two components: precision accuracy (Smith, 2019). tree can 80% similar target tree contains 80% splits target tree, incorrect splits – binary tree 10% splits present resolved incorrectly thus positively misleading. comparison, course, sensible talk split information just number splits: even split may contain information two uneven splits, absence two information-poor splits may preferable absence one information-rich split. , instructive think proportion information correctly resolved: goal find tree informative possible true tree. Ternary diagrams allow us visualise quality reconstructed tree reference known “true” tree:    Better trees plot vertically towards “100% shared information” vertex. Resolution trees increases towards right; trees resolved may better less-resolved trees addition resolution introduces error.","code":"testTrees <- list(   trueTree = ape::read.tree(text = '(a, (b, (c, (d, (e, (f, (g, h)))))));'),   lackRes = ape::read.tree(text = '(a, (b, c, (d, e, (f, g, h))));'),   smallErr = ape::read.tree(text = '(a, (c, (b, (d, (f, (e, (g, h)))))));'),   bigErr = ape::read.tree(text = '(a, (c, (((b, d), (f, h)), (e, g))));') ) VisualizeMatching(MutualClusteringInfo, testTrees$trueTree, testTrees$lackRes) points(4, 7.5, pch = 2, cex = 3, col = \"#E69F00\", xpd = NA) VisualizeMatching(MutualClusteringInfo, testTrees$trueTree, testTrees$smallErr) points(4, 7.5, pch = 3, cex = 3, col = \"#56B4E9\", xpd = NA) VisualizeMatching(MutualClusteringInfo, testTrees$trueTree, testTrees$bigErr) points(4, 7.5, pch = 4, cex = 3, col = \"#009E73\", xpd = NA) if (requireNamespace(\"Ternary\", quietly = TRUE)) {   library(\"Ternary\")   oldPar <- par(mar = rep(0.1, 4))   TernaryPlot(alab = \"Absent information\", blab = \"Shared information\",               clab = \"Misinformation\",               lab.cex = 0.8, lab.offset = 0.18,               point = \"left\", clockwise = FALSE,               grid.col = \"#dedede\", grid.minor.lines = 0,               axis.labels = 0:10 / 10, axis.col = \"#aaaaaa\")      HorizontalGrid()   correct <- MutualClusteringInfo(testTrees$trueTree, testTrees)   resolved <- ClusteringEntropy(testTrees)   unresolved <- resolved[\"trueTree\"] - resolved   incorrect <- resolved - correct   TernaryPoints(cbind(unresolved, correct, incorrect),                  pch = 1:4, cex = 2, col = Ternary::cbPalette8[1:4])   par(oldPar) }"},{"path":"https://ms609.github.io/TreeDist/dev/articles/using-distances.html","id":"example","dir":"Articles","previous_headings":"Testing similarity to a known tree","what":"Example","title":"Contextualizing tree distances","text":"’s noddy real-world example applying simulation-style study. First, let’s generate starting tree, represent reference topology: , let’s generate 200 degraded trees. ’ll move away true tree making TBR move, reduce resolution taking consensus tree three trees immediate neighbourhood (one NNI move away). let’s generate 200 trees even degraded. time ’ll move (three TBR moves) true tree, reduce resolution taking consensus three trees wider neighbourhood (two NNI moves away). Now let’s calculate tree similarity scores. need calculate amount information tree common true tree: amount information degraded tree: amount information resolved, : amount information incorrectly resolved: preparation plot, let’s colour one-away trees  orange , three-away trees  blue : Now can plot information ternary diagram.  ternary plot, vertical direction corresponds normalized tree quality, depicted accompanying histogram.","code":"set.seed(0) trueTree <- TreeTools::RandomTree(20, root = TRUE) treeSearchInstalled <- requireNamespace(\"TreeSearch\", quietly = TRUE) if (treeSearchInstalled) {   library(\"TreeSearch\", quietly = TRUE) # for TBR, NNI   oneAway <- structure(lapply(seq_len(200), function(x) {     tbrTree <- TBR(trueTree)     ape::consensus(list(tbrTree,                         NNI(tbrTree),                         NNI(tbrTree),                         NNI(tbrTree)))   }), class = \"multiPhylo\") } else {   message(\"Install \\\"TreeSearch\\\" to run this example\") } if (treeSearchInstalled) {   threeAway <- structure(lapply(seq_len(200), function(x) {     tbrTree <- TBR(TBR(TBR(trueTree)))     ape::consensus(list(tbrTree,                          NNI(NNI(tbrTree)),                         NNI(NNI(tbrTree)),                         NNI(NNI(tbrTree))))   }), class = \"multiPhylo\") } if (treeSearchInstalled) {   correct1 <- MutualClusteringInfo(trueTree, oneAway)   correct3 <- MutualClusteringInfo(trueTree, threeAway) } if (treeSearchInstalled) {   infoInTree1 <- ClusteringEntropy(oneAway)   infoInTree3 <- ClusteringEntropy(threeAway) } if (treeSearchInstalled) {   unresolved1 <- ClusteringEntropy(trueTree) - infoInTree1   unresolved3 <- ClusteringEntropy(trueTree) - infoInTree3 } if (treeSearchInstalled) {   incorrect1 <- infoInTree1 - correct1   incorrect3 <- infoInTree3 - correct3 } col1 <- hcl(200, alpha = 0.9) col3 <- hcl(40, alpha = 0.9) spec1 <- matrix(col2rgb(col1, alpha = TRUE), nrow = 4, ncol = 181) spec3 <- matrix(col2rgb(col3, alpha = TRUE), nrow = 4, ncol = 181) spec1[4, ] <- spec3[4, ] <- 0:180 ColToHex <- function(x) rgb(x[1], x[2], x[3], x[4], maxColorValue = 255) spec1 <- apply(spec1, 2, ColToHex) spec3 <- apply(spec3, 2, ColToHex) if (treeSearchInstalled && requireNamespace(\"Ternary\", quietly = TRUE)) {   layout(matrix(c(1, 2), ncol = 2), widths = c(5, 2))   oldPar <- par(mar = rep(0, 4))   TernaryPlot(alab = \"Information absent in degraded tree\",                blab = \"\\n\\nCorrect information in degraded tree\",                clab = \"Misinformation in degraded tree\",               point = \"left\", clockwise = FALSE, grid.minor.lines = 0,               axis.labels = 0:10 / 10)      HorizontalGrid()      coords1 <- cbind(unresolved1, correct1, incorrect1)   coords3 <- cbind(unresolved3, correct3, incorrect3)      ColourTernary(TernaryDensity(coords1, resolution = 20), spectrum = spec1)   ColourTernary(TernaryDensity(coords3, resolution = 20), spectrum = spec3)      TernaryDensityContour(coords3, col = col3, nlevels = 4)   TernaryDensityContour(coords1, col = col1, nlevels = 4)      if (requireNamespace(\"kdensity\", quietly = TRUE)) {     library(\"kdensity\")     HorizontalKDE <- function(dat, col, add = FALSE) {       lty <- 1       lwd <- 2       kde <- kdensity(dat)       kdeRange <- kdensity:::get_range(kde)       if (add) {         lines(kde(kdeRange), kdeRange, col = col, lty = lty, lwd = lwd)       } else {         plot(kde(kdeRange), kdeRange, col = col, lty = lty, lwd = lwd,               ylim = c(0, 1), main = \"\", axes = FALSE, type = \"l\")       }       # abline(h = 0:10 / 10) # Useful for confirming alignment     }        par(mar = c(1.8, 0, 1.8, 0)) # align plot limits with ternary plot     HorizontalKDE(correct1 / infoInTree1, col1, add = FALSE)     HorizontalKDE(correct3 / infoInTree3, col3, add = TRUE)     mtext(\"\\u2192 Normalized tree quality \\u2192\", 2)   }   par(oldPar) } else {   message(\"Install \\\"TreeSearch\\\" and \\\"Ternary\\\" to generate this plot\") }"},{"path":"https://ms609.github.io/TreeDist/dev/articles/using-distances.html","id":"what-next","dir":"Articles","previous_headings":"","what":"What next?","title":"Contextualizing tree distances","text":"may wish : Explore Ternary package Interpret tree distance metrics Compare trees different tips Review available distance measures corresponding TreeDist functions Construct tree spaces visualize landscapes phylogenetic trees","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/authors.html","id":null,"dir":"","previous_headings":"","what":"Authors","title":"Authors and Citation","text":"Martin R. Smith. Author, maintainer, copyright holder, programmer. Roy Jonker. Programmer, copyright holder. Yong Yang. Contributor, copyright holder. Yi Cao. Contributor, copyright holder.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/authors.html","id":"citation","dir":"","previous_headings":"","what":"Citation","title":"Authors and Citation","text":"Smith, M.R. (2020a). Information theoretic Generalized Robinson-Foulds metrics comparing phylogenetic trees. Bioinformatics 36: 5007–5013. doi: 10.1093/bioinformatics/btaa614 Smith, M.R. (2022). Robust analysis phylogenetic tree space. Systematic Biology 71: 1255–1270. doi: 10.1093/sysbio/syab100 Smith, M.R. (2020b). TreeDist: Distances Phylogenetic Trees. R package version 2.8.0.9000. Comprehensive R Archive Network. doi:10.5281/zenodo.3528124","code":"@Article{Smith2020,   doi = {10.1093/bioinformatics/btaa614},   title = {Information theoretic Generalized Robinson-Foulds metrics for comparing phylogenetic trees},   author = {Martin R. Smith},   journal = {Bioinformatics},   volume = {36},   number = {20},   pages = {5007–5013},   year = {2020}, } @Article{Smith2022,   doi = {10.1093/sysbio/syab100},   title = {Robust analysis of phylogenetic tree space},   author = {Martin R. Smith},   journal = {Systematic Biology},   volume = {71},   number = {5},   pages = {1255-1270},   year = {2022}, } @Manual{TreeDist,   title = {TreeDist: Distances between Phylogenetic Trees. R package version 2.8.0.9000},   author = {Martin R. Smith},   doi = {10.5281/zenodo.3528124},   journal = {Comprehensive R Archive Network},   year = {2020}, }"},{"path":"https://ms609.github.io/TreeDist/dev/index.html","id":"treedist","dir":"","previous_headings":"","what":"Calculate and Map Distances Between Phylogenetic Trees","title":"Calculate and Map Distances Between Phylogenetic Trees","text":"‘TreeDist’ R package implements suite metrics quantify topological distance pairs unweighted phylogenetic trees. also includes simple ‘Shiny’ application allow visualization distance-based tree spaces, functions calculate information content trees splits. ‘TreeDist’ primarily employs metrics category ‘generalized Robinson–Foulds distances’: based comparing splits (bipartitions) trees, thus reflect relationship data within trees, reference branch lengths.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/index.html","id":"generalized-rf-distances","dir":"","previous_headings":"","what":"Generalized RF distances","title":"Calculate and Map Distances Between Phylogenetic Trees","text":"Robinson-Foulds distance simply tallies number non-trivial splits (sometimes inaccurately termed clades, nodes edges) occur trees – splits perfectly identical contribute one point distance score zero, however similar different . overlooking potential similarities almost-identical splits, conservative approach undesirable properties. ‘Generalized’ RF metrics generate matchings pair splits one tree similar splits . pair splits assigned similarity score; sum scores optimal matching quantifies similarity two trees. Different ways calculating similarity pair splits lead different tree distance metrics, implemented functions : MutualClusteringInfo(), SharedPhylogeneticInfo() Smith (2020) scores matchings based amount information one partition contains . Mutual Phylogenetic Information assigns zero similarity split pairs exist single tree; Mutual Clustering Information metric forgiving, exhibits desirable behaviour; recommended metric tree comparison. (complement, ClusteringInfoDistance(), returns tree distance.)  NyeSimilarity() Nye et al. (2006) score matchings according size largest split consistent , normalized Jaccard index. approach extended Böcker et al. (2013) Jaccard-Robinson-Foulds metric (function JaccardRobinsonFoulds()). MatchingSplitDistance() Bogdanowicz Giaro (2012) Lin et al. (2012) independently proposed counting number ‘mismatched’ leaves pair splits. MatchingSplitInfoDistance() provides information-based equivalent (Smith 2020). package also implements variation path distance proposed Kendal Colijn (2016) (function KendallColijn()), approximations Nearest-Neighbour Interchange (NNI) distance (function NNIDist(); following Li et al. (1996)), calculates size (function MASTSize()) information content (function MASTInfo()) Maximum Agreement Subtree. implementation Tree Bisection Reconnection (TBR) distance, see package ‘TBRDist’.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/index.html","id":"installation","dir":"","previous_headings":"","what":"Installation","title":"Calculate and Map Distances Between Phylogenetic Trees","text":"Install load library CRAN follows: can install development version package :","code":"install.packages('TreeDist') library('TreeDist') if(!require(\"curl\")) install.packages(\"curl\") if(!require(\"remotes\")) install.packages(\"remotes\") remotes::install_github(\"ms609/TreeDist\")"},{"path":"https://ms609.github.io/TreeDist/dev/index.html","id":"tree-space-analysis","dir":"","previous_headings":"","what":"Tree space analysis","title":"Calculate and Map Distances Between Phylogenetic Trees","text":"Construct tree spaces readily visualize projected landscapes, avoiding common analytical pitfalls (Smith, 2022), using inbuilt graphical user interface (Shiny GUI): Serious analysts consult vignette command-line interface.","code":"TreeDist::MapTrees()"},{"path":"https://ms609.github.io/TreeDist/dev/index.html","id":"documentation","dir":"","previous_headings":"","what":"Documentation","title":"Calculate and Map Distances Between Phylogenetic Trees","text":"Using ‘TreeDist’ Package functions Tree spaces ‘TreeDist’ vignettes","code":""},{"path":"https://ms609.github.io/TreeDist/dev/index.html","id":"see-also","dir":"","previous_headings":"","what":"See also","title":"Calculate and Map Distances Between Phylogenetic Trees","text":"R packages implementing tree distance functions include: cophenetic.phylo(): Cophenetic distance dist.topo(): Path (topological) distance, Robinson-Foulds distance. treedist(): Path, Robinson-Foulds approximate SPR distances. ‘Quartet’: Triplet Quartet distances, using tqDist algorithm. ‘TBRDist’: TBR SPR distances unrooted trees, using ‘uspr’ C library. ‘treespace’: Kendall-Colijn distance tree space visualizations. ‘distory’ (unmaintained): Geodesic distance","code":""},{"path":"https://ms609.github.io/TreeDist/dev/index.html","id":"references","dir":"","previous_headings":"","what":"References","title":"Calculate and Map Distances Between Phylogenetic Trees","text":"Böcker, S. et al. (2013) Generalized Robinson-Foulds metric. Algorithms Bioinformatics. WABI 2013. Lecture Notes Computer Science, 8126, 156–69. Bogdanowicz, D. Giaro, K. (2012) Matching split distance unrooted binary phylogenetic trees. IEEE/ACM Transactions Computational Biology Bioinformatics, 9, 150–160. Kendall, M. Colijn, C. (2016) Mapping phylogenetic trees reveal distinct patterns evolution. Mol Biol Evol, 33, 2735–2743. Li, M., Tromp, J. Zhang, L.-X. (1996) notes nearest neighbour interchange distance. Computing Combinatorics, Goos, G., Hartmanis, J., Leeuwen, J., Cai, J.-Y., Wong, C. K., eds. Springer, Berlin. 343–351. Nye, T.M.W. et al. (2006) novel algorithm web-based tool comparing two alternative phylogenetic trees. Bioinformatics, 22, 117–119. Smith, M.R. (2020) Information theoretic Generalized Robinson-Foulds metrics comparing phylogenetic trees. Bioinformatics, 36, 5007–5013. Smith, M.R. (2022) Robust analysis phylogenetic tree space. Systematic Biology, 71, 1255–1270. Please note ‘TreeDist’ project released Contributor Code Conduct. contributing project, agree abide terms.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/AllSplitPairings.html","id":null,"dir":"Reference","previous_headings":"","what":"Variation of information for all split pairings — AllSplitPairings","title":"Variation of information for all split pairings — AllSplitPairings","text":"Calculate variation clustering information (Meila 2007)  possible pairing non-trivial splits n leaves (Smith 2020) , tabulating number pairings similarity.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/AllSplitPairings.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Variation of information for all split pairings — AllSplitPairings","text":"","code":"AllSplitPairings(n)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/AllSplitPairings.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Variation of information for all split pairings — AllSplitPairings","text":"n Integer specifying number leaves tree.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/AllSplitPairings.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Variation of information for all split pairings — AllSplitPairings","text":"AllSplitPairings() returns named vector. name element corresponds certain variation information, bits; value element specifies number pairings non-trivial splits give rise variation information. Split AB|CD  treated distinct CD|AB.  pairing AB|CD=CD|AB considered equivalent CD|AB=CD|AB (etc), values divided four.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/AllSplitPairings.html","id":"references","dir":"Reference","previous_headings":"","what":"References","title":"Variation of information for all split pairings — AllSplitPairings","text":"Meila M (2007). “Comparing clusterings—information based distance.” Journal Multivariate Analysis, 98(5), 873–895. doi:10.1016/j.jmva.2006.11.013 . Smith MR (2020). “Information theoretic Generalized Robinson-Foulds metrics comparing phylogenetic trees.” Bioinformatics, 36(20), 5007–5013. doi:10.1093/bioinformatics/btaa614 .","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/AllSplitPairings.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Variation of information for all split pairings — AllSplitPairings","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/AllSplitPairings.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Variation of information for all split pairings — AllSplitPairings","text":"","code":"AllSplitPairings(6) #>                0                1 1.33333333333333 1.74837083261218  #>              100              480              360              480  #> 1.83659166810898 1.91829583405449  #>              360              720  # Treat equivalent splits as identical by dividing by four: AllSplitPairings(6) / 4L #>                0                1 1.33333333333333 1.74837083261218  #>               25              120               90              120  #> 1.83659166810898 1.91829583405449  #>               90              180"},{"path":"https://ms609.github.io/TreeDist/dev/reference/CalculateTreeDistance.html","id":null,"dir":"Reference","previous_headings":"","what":"Wrapper for tree distance calculations — CalculateTreeDistance","title":"Wrapper for tree distance calculations — CalculateTreeDistance","text":"Calls tree distance functions trees lists trees","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/CalculateTreeDistance.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Wrapper for tree distance calculations — CalculateTreeDistance","text":"","code":"CalculateTreeDistance(Func, tree1, tree2 = NULL, reportMatching = FALSE, ...)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/CalculateTreeDistance.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Wrapper for tree distance calculations — CalculateTreeDistance","text":"Func Tree distance function. tree1, tree2 Trees class phylo, leaves labelled identically, lists trees undergo pairwise comparison.  implemented, tree2 = NULL compute distances pair trees list tree1 using fast algorithm based Day (1985) . reportMatching Logical specifying whether return clade matchings attribute score. ... Additional arguments Func.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/CalculateTreeDistance.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Wrapper for tree distance calculations — CalculateTreeDistance","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/CompareAll.html","id":null,"dir":"Reference","previous_headings":"","what":"Distances between each pair of trees — CompareAll","title":"Distances between each pair of trees — CompareAll","text":"Calculate distance tree list, tree list.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/CompareAll.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Distances between each pair of trees — CompareAll","text":"","code":"CompareAll(x, Func, FUN.VALUE = Func(x[[1]], x[[1]], ...), ...)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/CompareAll.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Distances between each pair of trees — CompareAll","text":"x List trees, format expected Func(). Func distance function returning distance two trees, e.g. path.dist(). FUN.VALUE Format output Func(), passed vapply(). unspecified, calculated running Func(x[[1]], x[[1]]). ... Additional parameters pass Func().","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/CompareAll.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Distances between each pair of trees — CompareAll","text":"CompareAll() returns distance matrix class dist detailing distance pair trees. Identical trees assumed zero distance.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/CompareAll.html","id":"details","dir":"Reference","previous_headings":"","what":"Details","title":"Distances between each pair of trees — CompareAll","text":"CompareAll() limited tree comparisons: Func can symmetric function.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/CompareAll.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Distances between each pair of trees — CompareAll","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/CompareAll.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Distances between each pair of trees — CompareAll","text":"","code":"# Generate a list of trees to compare library(\"TreeTools\", quietly = TRUE) trees <- list(bal1 = BalancedTree(1:8),                pec1 = PectinateTree(1:8),               pec2 = PectinateTree(c(4:1, 5:8)))    # Compare each tree with each other tree CompareAll(trees, NNIDist) #> $lower #>      bal1 pec1 pec2 #> bal1         2    2 #> pec1    2         2 #> pec2    2    2      #>  #> $best_lower #>      bal1 pec1 pec2 #> bal1         2    2 #> pec1    2         3 #> pec2    2    3      #>  #> $tight_upper #>      bal1 pec1 pec2 #> bal1         2    2 #> pec1    2         3 #> pec2    2    3      #>  #> $best_upper #>      bal1 pec1 pec2 #> bal1         2    2 #> pec1    2         3 #> pec2    2    3      #>  #> $loose_upper #>      bal1 pec1 pec2 #> bal1         4    4 #> pec1    4         5 #> pec2    4    5      #>  #> $fack_upper #>      bal1 pec1 pec2 #> bal1         4    4 #> pec1    4         5 #> pec2    4    5      #>  #> $li_upper #>      bal1 pec1 pec2 #> bal1        10   10 #> pec1   10         8 #> pec2   10    8      #>     # Providing FUN.VALUE yields a modest speed gain: dist <- CompareAll(trees, NNIDist, FUN.VALUE = integer(7))    # View distances as a matrix as.matrix(dist$lower) #>      bal1 pec1 pec2 #> bal1    0    2    2 #> pec1    2    0    2 #> pec2    2    2    0"},{"path":"https://ms609.github.io/TreeDist/dev/reference/Entropy.html","id":null,"dir":"Reference","previous_headings":"","what":"Entropy in bits — Entropy","title":"Entropy in bits — Entropy","text":"Calculate entropy vector probabilities, bits. Probabilities sum one. Probabilities equalling zero ignored.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/Entropy.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Entropy in bits — Entropy","text":"","code":"Entropy(...)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/Entropy.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Entropy in bits — Entropy","text":"... Numerics numeric vector specifying probabilities outcomes.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/Entropy.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Entropy in bits — Entropy","text":"Entropy() returns entropy specified probabilities, bits.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/Entropy.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Entropy in bits — Entropy","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/Entropy.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Entropy in bits — Entropy","text":"","code":"Entropy(1/2, 0, 1/2) # = 1 #> [1] 1 Entropy(rep(1/4, 4)) # = 2 #> [1] 2"},{"path":"https://ms609.github.io/TreeDist/dev/reference/GeneralizedRF.html","id":null,"dir":"Reference","previous_headings":"","what":"Generalized Robinson–Foulds distance — GeneralizedRF","title":"Generalized Robinson–Foulds distance — GeneralizedRF","text":"internal function calculate Generalized Robinson–Foulds distances splits.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/GeneralizedRF.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Generalized Robinson–Foulds distance — GeneralizedRF","text":"","code":"GeneralizedRF(   splits1,   splits2,   nTip,   PairScorer,   maximize,   reportMatching,   ... )"},{"path":"https://ms609.github.io/TreeDist/dev/reference/GeneralizedRF.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Generalized Robinson–Foulds distance — GeneralizedRF","text":"splits1, splits2 Logical matrices row corresponds leaf, either listed order bearing identical names (sequence), column corresponds split, leaf identified member ingroup (TRUE) outgroup (FALSE) respective split. nTip Integer specifying number leaves split. PairScorer function taking four arguments, splits1, splits2, nSplits1, nSplits2, return score pair splits two-dimensional matrix.  Additional parameters may specified via .... reportMatching Logical specifying whether return clade matchings attribute score. ... Additional parameters PairScorer","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/GeneralizedRF.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Generalized Robinson–Foulds distance — GeneralizedRF","text":"numeric value specifying score tree pairs specified pair scorer. reportMatching = TRUE, attribute also list: matching: split splits2 optimally matched split split1 (NA matched); pairScores: Calculated scores possible matching split. matchedSplits: Textual representation match","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/GeneralizedRF.html","id":"details","dir":"Reference","previous_headings":"","what":"Details","title":"Generalized Robinson–Foulds distance — GeneralizedRF","text":"Note checks made confirm splits1 splits2 contain leaves order. responsibility calling function.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/GeneralizedRF.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Generalized Robinson–Foulds distance — GeneralizedRF","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/Islands.html","id":null,"dir":"Reference","previous_headings":"","what":"Find islands from distance matrix — Islands","title":"Find islands from distance matrix — Islands","text":"Islands() assigns set objects islands, elements within island can form connected graph edge longer threshold distance units Silva , Wilkinson M (2021). “Defining Finding Islands Trees Mitigating Large Island Bias.” Systematic Biology, 70(6), 1282–1294. doi:10.1093/sysbio/syab015 . .","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/Islands.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Find islands from distance matrix — Islands","text":"","code":"Islands(D, threshold, dense = TRUE, smallest = 0)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/Islands.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Find islands from distance matrix — Islands","text":"D Square matrix dist object containing Euclidean distances data points. threshold Elements greater threshold distance units assigned island. dense Logical; FALSE, island named according index lowest-indexed member; TRUE, island numbered sequentially 1, ordered index lowest-indexed member. smallest Integer; Islands comprising smallest elements assigned island NA.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/Islands.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Find islands from distance matrix — Islands","text":"Islands() returns vector listing island element assigned.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/Islands.html","id":"references","dir":"Reference","previous_headings":"","what":"References","title":"Find islands from distance matrix — Islands","text":"references Rd macro \\insertAllCites help page.","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/reference/Islands.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Find islands from distance matrix — Islands","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/Islands.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Find islands from distance matrix — Islands","text":"","code":"library(\"TreeTools\", quietly = TRUE) # Generate a set of trees trees <- as.phylo(as.TreeNumber(BalancedTree(16)) + c(-(40:20), 70:105), 16)  # Calculate distances between trees distances <- ClusteringInfoDist(trees) summary(distances) #>    Min. 1st Qu.  Median    Mean 3rd Qu.    Max.  #>  0.8997  2.8945  4.5822  4.3967  6.1634  7.0885   # Assign trees to islands isle <- Islands(distances, quantile(distances, 0.1)) table(isle) #> isle #>  1  2  3  #> 12  9 36   # Indicate island membership on 2D mapping of tree distances mapping <- cmdscale(distances, 2) plot(mapping, col = isle + 1,      asp = 1, # Preserve aspect ratio - do not distort distances      ann = FALSE, axes = FALSE, # Don't label axes: dimensions are meaningless)      pch = 16 # Plotting character: Filled circle )   # Compare strict consensus with island consensus trees oPar <- par(mfrow = c(2, 2), mai = rep(0.1, 4)) plot(Consensus(trees), main = \"Strict\") plot(Consensus(trees[isle == 1]), edge.col = 2, main = \"Island 1\") plot(Consensus(trees[isle == 2]), edge.col = 3, main = \"Island 2\") plot(Consensus(trees[isle == 3]), edge.col = 4, main = \"Island 3\")   # Restore graphical parameters par(oPar)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/JaccardRobinsonFoulds.html","id":null,"dir":"Reference","previous_headings":"","what":"Jaccard–Robinson–Foulds metric — JaccardRobinsonFoulds","title":"Jaccard–Robinson–Foulds metric — JaccardRobinsonFoulds","text":"Calculate Jaccard–Robinson–Foulds metric (Böcker et al. 2013) , Generalized Robinson–Foulds metric.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/JaccardRobinsonFoulds.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Jaccard–Robinson–Foulds metric — JaccardRobinsonFoulds","text":"","code":"JaccardRobinsonFoulds(   tree1,   tree2 = NULL,   k = 1L,   allowConflict = TRUE,   similarity = FALSE,   normalize = FALSE,   reportMatching = FALSE )  JaccardSplitSimilarity(   splits1,   splits2,   nTip = attr(splits1, \"nTip\"),   k = 1L,   allowConflict = TRUE,   reportMatching = FALSE )"},{"path":"https://ms609.github.io/TreeDist/dev/reference/JaccardRobinsonFoulds.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Jaccard–Robinson–Foulds metric — JaccardRobinsonFoulds","text":"tree1, tree2 Trees class phylo, leaves labelled identically, lists trees undergo pairwise comparison.  implemented, tree2 = NULL compute distances pair trees list tree1 using fast algorithm based Day (1985) . k arbitrary exponent raise Jaccard index. Integer values greater one anticipated Böcker et al. Nye et al. metric uses k = 1. k increases towards infinity, metric converges Robinson–Foulds metric. allowConflict Logical specifying whether allow conflicting splits paired. FALSE, pairings allocated similarity score zero. similarity Logical specifying whether report result tree similarity, rather difference. normalize numeric value provided, used maximum value rescale results. TRUE, results rescaled maximum value calculated specified tree sizes topology, specified \"Normalization\" section . FALSE, results rescaled. reportMatching Logical specifying whether return clade matchings attribute score. splits1, splits2 Logical matrices row corresponds leaf, either listed order bearing identical names (sequence), column corresponds split, leaf identified member ingroup (TRUE) outgroup (FALSE) respective split. nTip (Optional) Integer specifying number leaves split.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/JaccardRobinsonFoulds.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Jaccard–Robinson–Foulds metric — JaccardRobinsonFoulds","text":"JaccardRobinsonFoulds() returns array numerics providing distances  pair trees tree1 tree2, splits1 splits2.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/JaccardRobinsonFoulds.html","id":"details","dir":"Reference","previous_headings":"","what":"Details","title":"Jaccard–Robinson–Foulds metric — JaccardRobinsonFoulds","text":"short, Jaccard–Robinson–Foulds metric generalized Robinson-Foulds metric: finds optimal matching pairs split one tree similar split second. Matchings scored according size largest split consistent , normalized Jaccard index, raised arbitrary exponent. detailed explanation provided vignettes. default, conflicting splits may paired. Note settings k = 1, allowConflict = TRUE, similarity = TRUE give similarity metric Nye et al. (2006) ; slightly faster implementation metric available NyeSimilarity(). examples section details visualize matchings non-default parameter values. Trees need contain identical leaves; scores based leaves trees hold common.  Check unexpected differences tip labelling setdiff(TipLabels(tree1), TipLabels(tree2)).","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/JaccardRobinsonFoulds.html","id":"normalization","dir":"Reference","previous_headings":"","what":"Normalization","title":"Jaccard–Robinson–Foulds metric — JaccardRobinsonFoulds","text":"normalize = TRUE, results rescaled zero one dividing maximum possible value trees given topologies, equal sum number splits tree. may wish normalize instead maximum number splits present pair trees n leaves, specifying normalize = n - 3.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/JaccardRobinsonFoulds.html","id":"references","dir":"Reference","previous_headings":"","what":"References","title":"Jaccard–Robinson–Foulds metric — JaccardRobinsonFoulds","text":"Böcker S, Canzar S, Klau GW (2013). “generalized Robinson-Foulds metric.” Darling , Stoye J (eds.), Algorithms Bioinformatics. WABI 2013. Lecture Notes Computer Science, vol 8126, 156–169. Springer, Berlin, Heidelberg. doi:10.1007/978-3-642-40453-5_13 . Day WHE (1985). “Optimal algorithms comparing trees labeled leaves.” Journal Classification, 2(1), 7–28. doi:10.1007/BF01908061 . Nye TMW, Liò P, Gilks WR (2006). “novel algorithm web-based tool comparing two alternative phylogenetic trees.” Bioinformatics, 22(1), 117–119. doi:10.1093/bioinformatics/bti720 .","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/reference/JaccardRobinsonFoulds.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Jaccard–Robinson–Foulds metric — JaccardRobinsonFoulds","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/JaccardRobinsonFoulds.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Jaccard–Robinson–Foulds metric — JaccardRobinsonFoulds","text":"","code":"set.seed(2) tree1 <- ape::rtree(10) tree2 <- ape::rtree(10) JaccardRobinsonFoulds(tree1, tree2, k = 2, allowConflict = FALSE) #> [1] 12.0105 JaccardRobinsonFoulds(tree1, tree2, k = 2, allowConflict = TRUE) #> [1] 11.40222  JRF2 <- function(tree1, tree2, ...)    JaccardRobinsonFoulds(tree1, tree2, k = 2, allowConflict = FALSE, ...)    VisualizeMatching(JRF2, tree1, tree2, matchZeros = FALSE)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/KMeansPP.html","id":null,"dir":"Reference","previous_headings":"","what":"k-means++ clustering — KMeansPP","title":"k-means++ clustering — KMeansPP","text":"k-means++ clustering (Arthur Vassilvitskii 2007)  improves speed accuracy standard kmeans clustering (Hartigan Wong 1979)  preferring initial cluster centres far others. scalable version algorithm proposed larger data sets (Bahmani et al. 2012) , implemented .","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/KMeansPP.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"k-means++ clustering — KMeansPP","text":"","code":"KMeansPP(x, k = 2, nstart = 10, ...)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/KMeansPP.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"k-means++ clustering — KMeansPP","text":"x Numeric matrix data, object can coerced matrix (numeric vector data frame numeric columns). k Integer specifying number clusters, k. nstart Positive integer specifying many random sets chosen ... additional arguments passed kmeans","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/KMeansPP.html","id":"references","dir":"Reference","previous_headings":"","what":"References","title":"k-means++ clustering — KMeansPP","text":"Arthur D, Vassilvitskii S (2007). “K-Means++: Advantages Careful Seeding.” Proceedings Eighteenth Annual ACM-SIAM Symposium Discrete Algorithms,  SODA '07, 1027–1035. Bahmani B, Moseley B, Vattani , Kumar R, Vassilvitskii S (2012). “Scalable K-Means++.” arXiv. doi:10.48550/arXiv.1203.6402 , 1203.6402. Hartigan JA, Wong MA (1979). “Algorithm 136: K-means clustering algorithm.” Journal Royal Statistical Society. Series C (Applied Statistics), 28(1), 100–108. doi:10.2307/2346830 .","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/reference/KMeansPP.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"k-means++ clustering — KMeansPP","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/KMeansPP.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"k-means++ clustering — KMeansPP","text":"","code":"# Generate random points set.seed(1) x <- cbind(c(rnorm(10, -5), rnorm(5, 1), rnorm(10, 6)),            c(rnorm(5, 0), rnorm(15, 4), rnorm(5, 0)))  # Conventional k-means may perform poorly klusters <- kmeans(x, cent = 5) plot(x, col = klusters$cluster, pch = rep(15:19, each = 5))   # Here, k-means++ recovers a better clustering plusters <- KMeansPP(x, k = 5) plot(x, col = plusters$cluster, pch = rep(15:19, each = 5))"},{"path":"https://ms609.github.io/TreeDist/dev/reference/KendallColijn.html","id":null,"dir":"Reference","previous_headings":"","what":"Kendall–Colijn distance — KendallColijn","title":"Kendall–Colijn distance — KendallColijn","text":"Calculate Kendall–Colijn tree distance, measure related path difference.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/KendallColijn.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Kendall–Colijn distance — KendallColijn","text":"","code":"KendallColijn(tree1, tree2 = NULL, Vector = KCVector)  KCVector(tree)  PathVector(tree)  SplitVector(tree)  KCDiameter(tree)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/KendallColijn.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Kendall–Colijn distance — KendallColijn","text":"tree1, tree2 Trees class phylo, leaves labelled identically, lists trees undergo pairwise comparison.  implemented, tree2 = NULL compute distances pair trees list tree1 using fast algorithm based Day (1985) . Vector Function converting tree numeric vector. KCVector, default, returns number edges common ancestor pair leaves root tree (per Kendall Colijn 2016) . PathVector returns number edges pair leaves (per Steel Penny 1993) . SplitVector returns size smallest split contains pair leaves (per Smith 2022 ). tree tree class phylo.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/KendallColijn.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Kendall–Colijn distance — KendallColijn","text":"KendallColijn() returns array numerics providing distances  pair trees tree1 tree2, splits1 splits2. KCDiameter() returns value Kendall & Colijn's (2016) metric distance two pectinate trees n leaves ordered opposite direction, suggest (without attempt proof) may useful proxy diameter (.e. maximum value) K–C metric.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/KendallColijn.html","id":"details","dir":"Reference","previous_headings":"","what":"Details","title":"Kendall–Colijn distance — KendallColijn","text":"Kendall–Colijn distance works measuring, pair leaves, distance recent common ancestor leaves root node. given tree, produces vector values recording distance---root recent common ancestor pair leaves. Two trees compared taking Euclidean distance respective vectors.  calculated taking square root sum squares differences vectors. analogous distance can created vector representation tree. split size vector metric (Smith 2022)  attempt mimic Kendall Colijn metric situations position root afforded special significance; path distance (Steel Penny 1993)  familiar alternative whose underlying vector measures distance last common ancestor pair leaves leaves , .e. length path one leaf another. None vector-based methods performs well tree distances measuring similarities relationships implied pair trees (Smith 2020) ; particular, Kendall Colijn metric strongly influenced tree balance, may appropriate suite common applications (Smith 2022) .","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/KendallColijn.html","id":"functions","dir":"Reference","previous_headings":"","what":"Functions","title":"Kendall–Colijn distance — KendallColijn","text":"KCVector(): Creates vector characterises rooted tree, described Kendall Colijn (2016) . PathVector(): Creates vector reporting number edges pair leaves, per path metric Steel Penny (1993) . SplitVector(): Creates vector reporting smallest split containing pair leaves, per metric proposed Smith (2022) .","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/KendallColijn.html","id":"references","dir":"Reference","previous_headings":"","what":"References","title":"Kendall–Colijn distance — KendallColijn","text":"Day WHE (1985). “Optimal algorithms comparing trees labeled leaves.” Journal Classification, 2(1), 7–28. doi:10.1007/BF01908061 . Kendall M, Colijn C (2016). “Mapping phylogenetic trees reveal distinct patterns evolution.” Molecular Biology Evolution, 33(10), 2735–2743. doi:10.1093/molbev/msw124 . Smith MR (2020). “Information theoretic Generalized Robinson-Foulds metrics comparing phylogenetic trees.” Bioinformatics, 36(20), 5007–5013. doi:10.1093/bioinformatics/btaa614 . Smith MR (2022). “Robust analysis phylogenetic tree space.” Systematic Biology, 71(5), 1255–1270. doi:10.1093/sysbio/syab100 . Steel MA, Penny D (1993). “Distributions tree comparison metrics—new results.” Systematic Biology, 42(2), 126–141. doi:10.1093/sysbio/42.2.126 .","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/reference/KendallColijn.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Kendall–Colijn distance — KendallColijn","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/KendallColijn.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Kendall–Colijn distance — KendallColijn","text":"","code":"KendallColijn(TreeTools::BalancedTree(8), TreeTools::PectinateTree(8)) #> [1] 11.48913  set.seed(0) KendallColijn(TreeTools::BalancedTree(8), lapply(rep(8, 3), ape::rtree)) #> [1] 9.591663 5.567764 9.949874 KendallColijn(lapply(rep(8, 4), ape::rtree)) #>          1        2        3 #> 2 7.280110                   #> 3 7.874008 8.185353          #> 4 4.795832 7.071068 7.681146  KendallColijn(lapply(rep(8, 4), ape::rtree), Vector = SplitVector) #>           1         2         3 #> 2 10.862780                     #> 3 10.148892 12.124356           #> 4  8.000000 11.489125  8.185353  # Notice that changing tree shape close to the root results in much # larger differences tree1 <- ape::read.tree(text = \"(a, (b, (c, (d, (e, (f, (g, h)))))));\") tree2 <- ape::read.tree(text = \"(a, ((b, c), (d, (e, (f, (g, h))))));\") tree3 <- ape::read.tree(text = \"(a, (b, (c, (d, (e, ((f, g), h))))));\") trees <- c(tree1, tree2, tree3) KendallColijn(trees) #>          1        2 #> 2 4.000000          #> 3 1.414214 4.242641 KendallColijn(trees, Vector = SplitVector) #>          1        2 #> 2 2.449490          #> 3 2.449490 3.162278 KCDiameter(4) #> [1] 3.162278 KCDiameter(trees) #> [1] 15.87451 15.87451 15.87451"},{"path":"https://ms609.github.io/TreeDist/dev/reference/LAPJV.html","id":null,"dir":"Reference","previous_headings":"","what":"Solve linear assignment problem using LAPJV — LAPJV","title":"Solve linear assignment problem using LAPJV — LAPJV","text":"Use algorithm Jonker Volgenant (1987)  solve Linear Sum Assignment Problem (LSAP).","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/LAPJV.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Solve linear assignment problem using LAPJV — LAPJV","text":"","code":"LAPJV(x)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/LAPJV.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Solve linear assignment problem using LAPJV — LAPJV","text":"x Matrix costs.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/LAPJV.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Solve linear assignment problem using LAPJV — LAPJV","text":"LAPJV() returns list two entries: score, score optimal matching; matching, columns matched row matrix turn.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/LAPJV.html","id":"details","dir":"Reference","previous_headings":"","what":"Details","title":"Solve linear assignment problem using LAPJV — LAPJV","text":"Linear Assignment Problem seeks match row matrix column, cost matching minimized. Jonker & Volgenant approach faster alternative Hungarian algorithm (Munkres 1957) , implemented clue::solve_LSAP(). Note: JV algorithm expects integers. order apply function non-integer n, tree distance calculations package, n multiplied largest available integer applying JV algorithm.  two values n exhibit trivial difference – e.g. due floating point errors – can lead interminable run times.  (numbers magnitude billions differ last significant digit, JV algorithm may undergo billions iterations.)  avoid , integers 2^22 differ value 8 less treated equal.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/LAPJV.html","id":"references","dir":"Reference","previous_headings":"","what":"References","title":"Solve linear assignment problem using LAPJV — LAPJV","text":"Jonker R, Volgenant (1987). “shortest augmenting path algorithm dense sparse linear assignment problems.” Computing, 38, 325–340. doi:10.1007/BF02278710 . Munkres J (1957). “Algorithms assignment transportation problems.” Journal Society Industrial Applied Mathematics, 5(1), 32–38. doi:10.1137/0105003 .","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/reference/LAPJV.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Solve linear assignment problem using LAPJV — LAPJV","text":"C++ code Roy Jonker, MagicLogic Optimization Inc. roy_jonker@magiclogic.com, contributions Yong Yang yongyanglink@gmail.com, Yi Cao","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/LAPJV.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Solve linear assignment problem using LAPJV — LAPJV","text":"","code":"problem <- matrix(c(7, 9, 8, 9, 9,                     2, 8, 5, 7, 9,                     1, 6, 6, 9, 9,                     3, 6, 2, 2, 9), 4, 5, byrow = TRUE)  LAPJV(problem) #> $score #> [1] 17 #>  #> $matching #> [1] 2 3 1 4 #>"},{"path":"https://ms609.github.io/TreeDist/dev/reference/MASTSize.html","id":null,"dir":"Reference","previous_headings":"","what":"Maximum Agreement Subtree size — MASTSize","title":"Maximum Agreement Subtree size — MASTSize","text":"Calculate size phylogenetic information content (Steel Penny 2006)  maximum agreement subtree two phylogenetic trees, .e. largest tree can obtained tree1 tree2 deleting, rearranging, leaves, using algorithm Valiente (2009) .","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MASTSize.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Maximum Agreement Subtree size — MASTSize","text":"","code":"MASTSize(tree1, tree2 = tree1, rooted = TRUE)  MASTInfo(tree1, tree2 = tree1, rooted = TRUE)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/MASTSize.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Maximum Agreement Subtree size — MASTSize","text":"tree1, tree2 Trees class phylo, lists trees undergo pairwise comparison. rooted Logical specifying whether treat trees rooted.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MASTSize.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Maximum Agreement Subtree size — MASTSize","text":"MASTSize() returns integer specifying number leaves maximum agreement subtree. MASTInfo() returns vector matrix listing phylogenetic information content, bits, maximum agreement subtree.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MASTSize.html","id":"details","dir":"Reference","previous_headings":"","what":"Details","title":"Maximum Agreement Subtree size — MASTSize","text":"Implemented trees 4096 tips.  Contact maintainer need process larger trees.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MASTSize.html","id":"references","dir":"Reference","previous_headings":"","what":"References","title":"Maximum Agreement Subtree size — MASTSize","text":"Steel MA, Penny D (2006). “Maximum parsimony phylogenetic information multistate characters.” Albert VA (ed.), Parsimony, Phylogeny, Genomics, 163–178. Oxford University Press, Oxford. Valiente G (2009). Combinatorial Pattern Matching Algorithms Computational Biology using Perl R,  CRC Mathematical Computing Biology Series. CRC Press, Boca Raton.","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/reference/MASTSize.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Maximum Agreement Subtree size — MASTSize","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MASTSize.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Maximum Agreement Subtree size — MASTSize","text":"","code":"# for as.phylo, BalancedTree, PectinateTree: library(\"TreeTools\", quietly = TRUE)  MASTSize(PectinateTree(8), BalancedTree(8)) #> [1] 4 MASTInfo(PectinateTree(8), BalancedTree(8)) #> [1] 3.906891  MASTSize(BalancedTree(7), as.phylo(0:3, 7)) #> [1] 3 3 3 3 MASTSize(as.phylo(0:3, 7), PectinateTree(7)) #> [1] 6 5 5 5  MASTInfo(BalancedTree(7), as.phylo(0:3, 7)) #> [1] 1.584963 1.584963 1.584963 1.584963 MASTInfo(as.phylo(0:3, 7), PectinateTree(7)) #> [1] 9.884171 6.714246 6.714246 6.714246  MASTSize(list(Bal = BalancedTree(7), Pec = PectinateTree(7)),          as.phylo(0:3, 7)) #>     [,1] [,2] [,3] [,4] #> Bal    3    3    3    3 #> Pec    6    5    5    5 MASTInfo(list(Bal = BalancedTree(7), Pec = PectinateTree(7)),          as.phylo(0:3, 7)) #>         [,1]     [,2]     [,3]     [,4] #> Bal 1.584963 1.584963 1.584963 1.584963 #> Pec 9.884171 6.714246 6.714246 6.714246  CompareAll(as.phylo(0:4, 8), MASTSize) #>   1 2 3 4 5 #> 1   7 7 7 6 #> 2 7   7 6 7 #> 3 7 7   6 6 #> 4 7 6 6   7 #> 5 6 7 6 7   CompareAll(as.phylo(0:4, 8), MASTInfo) #>           1         2         3         4         5 #> 1           13.343602 13.343602 13.343602  9.884171 #> 2 13.343602           13.343602  9.884171 13.343602 #> 3 13.343602 13.343602            9.884171  9.884171 #> 4 13.343602  9.884171  9.884171           13.343602 #> 5  9.884171 13.343602  9.884171 13.343602"},{"path":"https://ms609.github.io/TreeDist/dev/reference/MSTSegments.html","id":null,"dir":"Reference","previous_headings":"","what":"Add minimum spanning tree to plot, colouring by stress — MSTSegments","title":"Add minimum spanning tree to plot, colouring by stress — MSTSegments","text":"identify strain multidimensional scaling distances, can useful plot minimum spanning tree (Gower 1966; Smith 2022) .  Colouring edge tree according strain can identify areas mapping stretched compressed.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MSTSegments.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Add minimum spanning tree to plot, colouring by stress — MSTSegments","text":"","code":"MSTSegments(mapping, mstEnds, ...)  StrainCol(   distances,   mapping,   mstEnds = MSTEdges(distances),   palette = rev(hcl.colors(256L, \"RdYlBu\")) )"},{"path":"https://ms609.github.io/TreeDist/dev/reference/MSTSegments.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Add minimum spanning tree to plot, colouring by stress — MSTSegments","text":"mapping Two-column matrix giving x y coordinates plotted points. mstEnds Two-column matrix identifying rows mapping end edge MST, output TreeTools::MSTEdges(). ... Additional arguments segments(). distances Matrix dist object giving original distances pair points. palette Vector colours colour edges.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MSTSegments.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Add minimum spanning tree to plot, colouring by stress — MSTSegments","text":"StrainCol() returns vector entry selected palette, attribute logStrain denoting logarithm mapped original distance, shifted median value zero. Palette colours assigned centred median value, entries early palette assigned edges ratio mapped distance original distance small.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MSTSegments.html","id":"references","dir":"Reference","previous_headings":"","what":"References","title":"Add minimum spanning tree to plot, colouring by stress — MSTSegments","text":"Gower JC (1966). “distance properties latent root vector methods used multivariate analysis.” Biometrika, 53(3/4), 325–338. doi:10.2307/2333639 . Smith MR (2022). “Robust analysis phylogenetic tree space.” Systematic Biology, 71(5), 1255–1270. doi:10.1093/sysbio/syab100 .","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/reference/MSTSegments.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Add minimum spanning tree to plot, colouring by stress — MSTSegments","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MSTSegments.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Add minimum spanning tree to plot, colouring by stress — MSTSegments","text":"","code":"set.seed(0) library(\"TreeTools\", quietly = TRUE) distances <- ClusteringInfoDist(as.phylo(5:16, 8)) mapping <- cmdscale(distances, k = 2) mstEnds <- MSTEdges(distances)  # Set up blank plot plot(mapping, asp = 1, frame.plot = FALSE, ann = FALSE, axes = FALSE,      type = \"n\") # Add MST MSTSegments(mapping, mstEnds,              col = StrainCol(distances, mapping, mstEnds)) # Add points at end so they overprint the MST points(mapping) PlotTools::SpectrumLegend(  \"bottomleft\",  legend = c(\"Extended\", \"Median\", \"Contracted\"),  bty = \"n\",     # No box  y.intersp = 2, # Expand in Y direction  palette = hcl.colors(256L, \"RdYlBu\", rev = TRUE) )"},{"path":"https://ms609.github.io/TreeDist/dev/reference/MapTrees.html","id":null,"dir":"Reference","previous_headings":"","what":"Graphical user interface for mapping distances and analysing tree space — MapTrees","title":"Graphical user interface for mapping distances and analysing tree space — MapTrees","text":"MapTrees() launches \"Shiny\" application visualization evaluation tree spaces.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MapTrees.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Graphical user interface for mapping distances and analysing tree space — MapTrees","text":"","code":"MapTrees()  Project()"},{"path":"https://ms609.github.io/TreeDist/dev/reference/MapTrees.html","id":"input-tab","dir":"Reference","previous_headings":"","what":"Input tab","title":"Graphical user interface for mapping distances and analysing tree space — MapTrees","text":"input tab allows upload sets phylogenetic trees file. Trees start end file can excluded, number trees can brought manageable number uniformly subsampling every _n_th tree.  Samples c. 100 trees can analysed seconds; analysis larger samples take longer, particularly slower methods (e.g. quartet distances; Kruskal-1 MDS; large minimum spanning trees). Different batches can plotted different colours / symbols. tree associated property – example, data method used generate , stratigraphic congruence – list properties tree, one entry per line/row, can uploaded along trees.  Points tree space can styled according corresponding property. trees subsampled (using \"Sample every\" slider), values tree properties file can also subsampled accordingly. Unfortunately yet support multiple point property files; one file applied trees, sequence added memory.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MapTrees.html","id":"analysis-tab","dir":"Reference","previous_headings":"","what":"Analysis tab","title":"Graphical user interface for mapping distances and analysing tree space — MapTrees","text":"Select suite distance methods: clustering information phylogenetic information quick satisfactory; quartet slow gives slightly better mappings; path fast may reflect evolutionary signal well; Robinson–Foulds probably never used analysis; included comparison purposes. Principle components mappings suffice purposes; Sammon Kruskal mappings slower seldom differ much, character quality, may emphasize outliers . Partitioning around medoids minimax-linkage hierarchical clustering typically find close--optimal clustering one exists; select additional methods exhaustive search. avoid redundant calculation, clusterings updated \"recalculate clustering\" clicked, \"maximum cluster number\" slider modified; clustering solutions using many clusters considered Clusterings silhouette coefficients < 0.25 unlikely represent genuine structure reported depicted.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MapTrees.html","id":"display-tab","dir":"Reference","previous_headings":"","what":"Display tab","title":"Graphical user interface for mapping distances and analysing tree space — MapTrees","text":"15 dimensions can depicted; quality mapping – , faithfulness mapped distances true tree--tree distances – quantified product Trustworthiness Continuity metrics, exceed 0.9 (least). interactive 3D plot can explored dragging mouse scrolling, careful check three dimensions enough depict data accurately. minimum spanning tree shortest possible line selecting chosen subsample trees; takes convoluted zig-zagging route, mapping poor job reflecting true tree tree distances. Convex hulls smallest polygons enclosing points cluster; handy spotting clusters, area correspond genuine quantity, interpreted. Tree numbers correspond sequence trees original input file, subsampling. tree denoted point, whose symbol can styled according cluster membership according file contains tree, click \"Add existing\" input tab constituting new batch new symbol. Points can coloured according category – cluster batch belong, custom data provided Point Property File input tab – continuously, either sequence added memory, according custom data.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MapTrees.html","id":"exporting-tree-spaces","dir":"Reference","previous_headings":"","what":"Exporting tree spaces","title":"Graphical user interface for mapping distances and analysing tree space — MapTrees","text":"mapping can saved PDF PNG bitmap size selected.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MapTrees.html","id":"references","dir":"Reference","previous_headings":"","what":"References","title":"Graphical user interface for mapping distances and analysing tree space — MapTrees","text":"list references employed constructing tree space populated according methods used; appropriate cite briefly discuss studies publication using figures generated using application.  application can cited using Smith (2020, 2022)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MapTrees.html","id":"references-1","dir":"Reference","previous_headings":"","what":"References","title":"Graphical user interface for mapping distances and analysing tree space — MapTrees","text":"Smith MR (2020). “Information theoretic Generalized Robinson-Foulds metrics comparing phylogenetic trees.” Bioinformatics, 36(20), 5007–5013. doi:10.1093/bioinformatics/btaa614 . Smith MR (2022). “Robust analysis phylogenetic tree space.” Systematic Biology, 71(5), 1255–1270. doi:10.1093/sysbio/syab100 .","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/reference/MapTrees.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Graphical user interface for mapping distances and analysing tree space — MapTrees","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MappingQuality.html","id":null,"dir":"Reference","previous_headings":"","what":"Faithfulness of mapped distances — MappingQuality","title":"Faithfulness of mapped distances — MappingQuality","text":"MappingQuality() calculates trustworthiness continuity mapped distances (Venna Kaski 2001; Kaski et al. 2003) . Trustworthiness measures, scale 0–1, degree points nearby mapping truly close neighbours; continuity, extent points truly nearby retain close spatial proximity mapping.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MappingQuality.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Faithfulness of mapped distances — MappingQuality","text":"","code":"MappingQuality(original, mapped, neighbours = 10L)  ProjectionQuality(original, mapped, neighbours = 10L)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/MappingQuality.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Faithfulness of mapped distances — MappingQuality","text":"original, mapped Square matrix dist object containing original / mapped pairwise distances. neighbours Integer specifying number nearest neighbours use calculation.  typically small relative number points.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MappingQuality.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Faithfulness of mapped distances — MappingQuality","text":"MappingQuality() returns named vector length four, containing entries: Trustworthiness, Continuity, TxC (product values), sqrtTxC (square root).","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MappingQuality.html","id":"references","dir":"Reference","previous_headings":"","what":"References","title":"Faithfulness of mapped distances — MappingQuality","text":"Kaski S, Nikkila J, Oja M, Venna J, Toronen P, Castren E (2003). “Trustworthiness metrics visualizing similarity gene expression.” BMC Bioinformatics, 4, 48. doi:10.1186/1471-2105-4-48 . Venna J, Kaski S (2001). “Neighborhood preservation nonlinear projection methods: experimental study.” Dorffner G, Bischof H, Hornik K (eds.), Artificial Neural Networks — ICANN 2001,  Lecture Notes Computer Science, 485–491. doi:10.1007/3-540-44668-0_68 .","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/reference/MappingQuality.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Faithfulness of mapped distances — MappingQuality","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MappingQuality.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Faithfulness of mapped distances — MappingQuality","text":"","code":"library(\"TreeTools\", quietly = TRUE) trees <- as.phylo(0:10, nTip = 8) distances <- ClusteringInfoDistance(trees) mapping <- cmdscale(distances) MappingQuality(distances, dist(mapping), 4) #> Trustworthiness      Continuity             TxC         sqrtTxC  #>       0.7929293       0.8737374       0.6928120       0.8323533"},{"path":"https://ms609.github.io/TreeDist/dev/reference/MatchingSplitDistance.html","id":null,"dir":"Reference","previous_headings":"","what":"Matching Split Distance — MatchingSplitDistance","title":"Matching Split Distance — MatchingSplitDistance","text":"Calculate Matching Split Distance (Bogdanowicz Giaro 2012; Lin et al. 2012)  unrooted binary trees.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MatchingSplitDistance.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Matching Split Distance — MatchingSplitDistance","text":"","code":"MatchingSplitDistance(   tree1,   tree2 = NULL,   normalize = FALSE,   reportMatching = FALSE )  MatchingSplitDistanceSplits(   splits1,   splits2,   nTip = attr(splits1, \"nTip\"),   normalize = TRUE,   reportMatching = FALSE )"},{"path":"https://ms609.github.io/TreeDist/dev/reference/MatchingSplitDistance.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Matching Split Distance — MatchingSplitDistance","text":"tree1, tree2 Trees class phylo, leaves labelled identically, lists trees undergo pairwise comparison.  implemented, tree2 = NULL compute distances pair trees list tree1 using fast algorithm based Day (1985) . normalize numeric value provided, used maximum value rescale results. TRUE, results rescaled maximum value calculated specified tree sizes topology, specified \"Normalization\" section . FALSE, results rescaled. reportMatching Logical specifying whether return clade matchings attribute score. splits1, splits2 Logical matrices row corresponds leaf, either listed order bearing identical names (sequence), column corresponds split, leaf identified member ingroup (TRUE) outgroup (FALSE) respective split. nTip (Optional) Integer specifying number leaves split.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MatchingSplitDistance.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Matching Split Distance — MatchingSplitDistance","text":"MatchingSplitDistance() returns array numerics providing distances  pair trees tree1 tree2, splits1 splits2.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MatchingSplitDistance.html","id":"details","dir":"Reference","previous_headings":"","what":"Details","title":"Matching Split Distance — MatchingSplitDistance","text":"Trees need contain identical leaves; scores based leaves trees hold common.  Check unexpected differences tip labelling setdiff(TipLabels(tree1), TipLabels(tree2)).","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MatchingSplitDistance.html","id":"normalization","dir":"Reference","previous_headings":"","what":"Normalization","title":"Matching Split Distance — MatchingSplitDistance","text":"normalization value function must provided order return normalized value.  aware generalised formula, please let know creating GitHub issue can implemented.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MatchingSplitDistance.html","id":"references","dir":"Reference","previous_headings":"","what":"References","title":"Matching Split Distance — MatchingSplitDistance","text":"Bogdanowicz D, Giaro K (2012). “Matching split distance unrooted binary phylogenetic trees.” IEEE/ACM Transactions Computational Biology Bioinformatics, 9(1), 150–160. doi:10.1109/TCBB.2011.48 . Day WHE (1985). “Optimal algorithms comparing trees labeled leaves.” Journal Classification, 2(1), 7–28. doi:10.1007/BF01908061 . Lin Y, Rajan V, Moret BME (2012). “metric phylogenetic trees based matching.” IEEE/ACM Transactions Computational Biology Bioinformatics, 4(9), 1014–1022. doi:10.1109/TCBB.2011.157 .","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/reference/MatchingSplitDistance.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Matching Split Distance — MatchingSplitDistance","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MatchingSplitDistance.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Matching Split Distance — MatchingSplitDistance","text":"","code":"MatchingSplitDistance(lapply(rep(8, 5), ape::rtree), normalize = 16) #>        1      2      3      4 #> 2 0.7500                      #> 3 0.8125 0.6875               #> 4 0.7500 0.7500 0.8125        #> 5 0.3750 0.7500 0.5625 0.8750  MatchingSplitDistance(TreeTools::BalancedTree(6),                       TreeTools::PectinateTree(6),                       reportMatching = TRUE) #> [1] 2 #> attr(,\"matching\") #> [1] 2 1 3 #> attr(,\"pairScores\") #>      [,1] [,2] [,3] #> [1,]    1    0    1 #> [2,]    0    1    2 #> [3,]    2    1    2 #> attr(,\"matchedSplits\") #> [1] \"t1 t2 t3 | t4 t5 t6 => t4 t5 t6 | t1 t2 t3\" #> [2] \"t1 t2 | t3 t4 t5 t6 => t3 t4 t5 t6 | t1 t2\" #> [3] \"t4 t5 | t1 t2 t3 t6 => t5 t6 | t1 t2 t3 t4\"  VisualizeMatching(MatchingSplitDistance, TreeTools::BalancedTree(6),                   TreeTools::PectinateTree(6))"},{"path":"https://ms609.github.io/TreeDist/dev/reference/MeilaVariationOfInformation.html","id":null,"dir":"Reference","previous_headings":"","what":"Use variation of clustering information to compare pairs of splits — MeilaVariationOfInformation","title":"Use variation of clustering information to compare pairs of splits — MeilaVariationOfInformation","text":"Compare pair splits viewed clusterings taxa, using variation clustering information proposed (Meila 2007) .","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MeilaVariationOfInformation.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Use variation of clustering information to compare pairs of splits — MeilaVariationOfInformation","text":"","code":"MeilaVariationOfInformation(split1, split2)  MeilaMutualInformation(split1, split2)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/MeilaVariationOfInformation.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Use variation of clustering information to compare pairs of splits — MeilaVariationOfInformation","text":"split1, split2 Logical vectors listing leaves consistent order, identifying leaf member ingroup (TRUE) outgroup (FALSE) split question.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MeilaVariationOfInformation.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Use variation of clustering information to compare pairs of splits — MeilaVariationOfInformation","text":"MeilaVariationOfInformation() returns variation (clustering) information, measured bits. MeilaMutualInformation() returns mutual information, measured bits.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MeilaVariationOfInformation.html","id":"details","dir":"Reference","previous_headings":"","what":"Details","title":"Use variation of clustering information to compare pairs of splits — MeilaVariationOfInformation","text":"equivalent mutual clustering information (Vinh et al. 2010) . total information content, multiply VoI number leaves.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MeilaVariationOfInformation.html","id":"references","dir":"Reference","previous_headings":"","what":"References","title":"Use variation of clustering information to compare pairs of splits — MeilaVariationOfInformation","text":"Meila M (2007). “Comparing clusterings—information based distance.” Journal Multivariate Analysis, 98(5), 873–895. doi:10.1016/j.jmva.2006.11.013 . Vinh NX, Epps J, Bailey J (2010). “Information theoretic measures clusterings comparison: variants, properties, normalization correction chance.” Journal Machine Learning Research, 11, 2837–2854. doi:10.1145/1553374.1553511 .","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MeilaVariationOfInformation.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Use variation of clustering information to compare pairs of splits — MeilaVariationOfInformation","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/MeilaVariationOfInformation.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Use variation of clustering information to compare pairs of splits — MeilaVariationOfInformation","text":"","code":"# Maximum variation = information content of each split separately A <- TRUE B <- FALSE MeilaVariationOfInformation(c(A, A, A, B, B, B), c(A, A, A, A, A, A)) #> [1] 1 Entropy(c(3, 3) / 6) + Entropy(c(0, 6) / 6) #> [1] 1  # Minimum variation = 0 MeilaVariationOfInformation(c(A, A, A, B, B, B), c(A, A, A, B, B, B)) #> [1] 0  # Not always possible for two evenly-sized splits to reach maximum # variation of information Entropy(c(3, 3) / 6) * 2  # = 2 #> [1] 2 MeilaVariationOfInformation(c(A, A, A,B ,B, B), c(A, B, A, B, A, B)) # < 2 #> [1] 1.836592  # Phylogenetically uninformative groupings contain spliting information Entropy(c(1, 5) / 6) #> [1] 0.6500224 MeilaVariationOfInformation(c(B, A, A, A, A, A), c(A, A, A, A, A, B)) #> [1] 1.203213"},{"path":"https://ms609.github.io/TreeDist/dev/reference/NNIDist.html","id":null,"dir":"Reference","previous_headings":"","what":"Approximate Nearest Neighbour Interchange distance — NNIDist","title":"Approximate Nearest Neighbour Interchange distance — NNIDist","text":"Use approach Li et al. (1996)  approximate Nearest Neighbour Interchange distance (Robinson 1971)  phylogenetic trees.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/NNIDist.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Approximate Nearest Neighbour Interchange distance — NNIDist","text":"","code":"NNIDist(tree1, tree2 = tree1)  NNIDiameter(tree)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/NNIDist.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Approximate Nearest Neighbour Interchange distance — NNIDist","text":"tree1, tree2 Single trees class phylo undergo comparison. tree Object supported class representing tree list trees, integer specifying number leaves tree/trees.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/NNIDist.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Approximate Nearest Neighbour Interchange distance — NNIDist","text":"NNIDist() returns, pair trees, named vector containing three integers: lower lower bound NNI distance, corresponds RF distance trees. tight_upper upper bound distance, based calculated maximum diameters trees < 13 leaves.  NA returned trees different employ approach. loose_upper looser upper bound distance, using n log n + O(n). NNIDiameter() returns matrix specifying (bounds ) diameter NNI distance metric specified tree(s). Columns correspond : liMin:  $$n - 3$$, lower bound diameter (Li et al. 1996); fackMin: Lower bound diameter following Fack et al. (2002), .e. $$\\log2{N!} / 4$$; min: larger liMin fackMin; exact: exact value diameter, n < 13; liMax: Upper bound diameter following Li et al. (1996), .e. $$n \\log2{n} + \\textrm{O}(n)$$; fackMax: Upper bound diameter following Fack et al. (2002), .e. ($$N - 2$$) ceiling($$\\log2{n}$$) N; max: smaller liMax fackMax; n number leaves, N number internal nodes, .e. $$n - 2$$.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/NNIDist.html","id":"details","dir":"Reference","previous_headings":"","what":"Details","title":"Approximate Nearest Neighbour Interchange distance — NNIDist","text":"brief, approximation algorithm works identifying edges one tree match edges second.  edges must undergo least one NNI operation order reconcile trees. Edges match trees need never undergo NNI operation, divide tree smaller regions.  \"cutting\" matched edges two, tree can divided number regions solely comprise unmatched edges. regions can viewed separate trees need reconciled. One way reconcile trees conduct series NNI operations reduce tree pectinate (caterpillar) tree, conduct analogue mergesort algorithm.  takes n log n + O(n) NNI operations, provides loose upper bound NNI score. maximum number moves n-leaf tree (OEIS A182136) can calculated exactly small trees (Fack et al. 2002) ; provides tighter upper bound, unavailable n > 12. NNIDiameter() reports limits bound.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/NNIDist.html","id":"references","dir":"Reference","previous_headings":"","what":"References","title":"Approximate Nearest Neighbour Interchange distance — NNIDist","text":"Fack V, Lievens S, Van der Jeugt J (2002). “diameter rotation graph binary coupling trees.” Discrete Mathematics, 245(1-3), 1–18. doi:10.1016/S0012-365X(01)00418-6 . Li M, Tromp J, Zhang L (1996). “notes nearest neighbour interchange distance.” Goos G, Hartmanis J, Leeuwen J, Cai J, Wong CK (eds.), Computing Combinatorics, volume 1090, 343–351. Springer, Berlin, Heidelberg. ISBN 978-3-540-61332-9 978-3-540-68461-9, doi:10.1007/3-540-61332-3_168 . Robinson DF (1971). “Comparison labeled trees valency three.” Journal Combinatorial Theory, Series B, 11(2), 105–119. doi:10.1016/0095-8956(71)90020-7 .","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/reference/NNIDist.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Approximate Nearest Neighbour Interchange distance — NNIDist","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/NNIDist.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Approximate Nearest Neighbour Interchange distance — NNIDist","text":"","code":"library(\"TreeTools\", quietly = TRUE)  NNIDist(BalancedTree(7), PectinateTree(7)) #>       lower  best_lower tight_upper  best_upper loose_upper  fack_upper  #>           2           2           2           2           4           4  #>    li_upper  #>          10   NNIDist(BalancedTree(7), as.phylo(0:2, 7)) #>             [,1] [,2] [,3] #> lower          4    3    4 #> best_lower     7    5    7 #> tight_upper    7    5    7 #> best_upper     7    5    7 #> loose_upper   14    8   14 #> fack_upper    14    8   14 #> li_upper      16   13   16 NNIDist(as.phylo(0:2, 7), PectinateTree(7)) #>             [,1] [,2] [,3] #> lower          4    4    4 #> best_lower     7    7    7 #> tight_upper    7    7    7 #> best_upper     7    7    7 #> loose_upper   14   14   14 #> fack_upper    14   14   14 #> li_upper      16   16   16  NNIDist(list(bal = BalancedTree(7), pec = PectinateTree(7)),         as.phylo(0:2, 7)) #> , , lower #>  #>     [,1] [,2] [,3] #> bal    4    3    4 #> pec    4    4    4 #>  #> , , best_lower #>  #>     [,1] [,2] [,3] #> bal    7    5    7 #> pec    7    7    7 #>  #> , , tight_upper #>  #>     [,1] [,2] [,3] #> bal    7    5    7 #> pec    7    7    7 #>  #> , , best_upper #>  #>     [,1] [,2] [,3] #> bal    7    5    7 #> pec    7    7    7 #>  #> , , loose_upper #>  #>     [,1] [,2] [,3] #> bal   14    8   14 #> pec   14   14   14 #>  #> , , fack_upper #>  #>     [,1] [,2] [,3] #> bal   14    8   14 #> pec   14   14   14 #>  #> , , li_upper #>  #>     [,1] [,2] [,3] #> bal   16   13   16 #> pec   16   16   16 #>   CompareAll(as.phylo(30:33, 8), NNIDist) #> $lower #>   1 2 3 4 #> 1   1 1 2 #> 2 1   1 2 #> 3 1 1   2 #> 4 2 2 2   #>  #> $best_lower #>   1 2 3 4 #> 1   1 1 3 #> 2 1   1 3 #> 3 1 1   3 #> 4 3 3 3   #>  #> $tight_upper #>   1 2 3 4 #> 1   1 1 3 #> 2 1   1 3 #> 3 1 1   3 #> 4 3 3 3   #>  #> $best_upper #>   1 2 3 4 #> 1   1 1 3 #> 2 1   1 3 #> 3 1 1   3 #> 4 3 3 3   #>  #> $loose_upper #>   1 2 3 4 #> 1   2 2 5 #> 2 2   2 5 #> 3 2 2   5 #> 4 5 5 5   #>  #> $fack_upper #>   1 2 3 4 #> 1   2 2 5 #> 2 2   2 5 #> 3 2 2   5 #> 4 5 5 5   #>  #> $li_upper #>   1 2 3 4 #> 1   5 5 8 #> 2 5   5 8 #> 3 5 5   8 #> 4 8 8 8   #>"},{"path":"https://ms609.github.io/TreeDist/dev/reference/NormalizeInfo.html","id":null,"dir":"Reference","previous_headings":"","what":"Normalize tree distances — NormalizeInfo","title":"Normalize tree distances — NormalizeInfo","text":"NormalizeInfo() internal function used normalize information reference, total information present pair trees.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/NormalizeInfo.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Normalize tree distances — NormalizeInfo","text":"","code":"NormalizeInfo(   unnormalized,   tree1,   tree2,   InfoInTree,   infoInBoth = NULL,   how = TRUE,   Combine = \"+\",   ... )"},{"path":"https://ms609.github.io/TreeDist/dev/reference/NormalizeInfo.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Normalize tree distances — NormalizeInfo","text":"unnormalized Numeric value, vector matrix normalized. tree1, tree2 Trees unnormalized calculated. InfoInTree Function calculate information content tree. infoInBoth Optional numeric specifying information content trees independently. unspecified (NULL), calculated using method specified . Method normalization, perhaps specified using normalize argument tree distance function.  See details options. ... Additional parameters InfoInTree() ().","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/NormalizeInfo.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Normalize tree distances — NormalizeInfo","text":"NormalizeInfo() returns object corresponding normalized values unnormalized.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/NormalizeInfo.html","id":"details","dir":"Reference","previous_headings":"","what":"Details","title":"Normalize tree distances — NormalizeInfo","text":"unnormalized value(s) normalized dividing denominator calculated based parameter.  Valid options include: FALSE normalization performed; unnormalized values returned. TRUE Unless infoInBoth specified, information tree computed using InfoInTree(), two values combined using Combine(). numeric value, vector matrix used denominator; returned value unnormalized / . function Unless infoInBoth specified, information tree computed using InfoInTree(), two values combined using .  NormalizeInfo(= Func) thus equivalent NormalizeInfo(= TRUE, Combine = Func).","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/NormalizeInfo.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Normalize tree distances — NormalizeInfo","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/NormalizeInfo.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Normalize tree distances — NormalizeInfo","text":"","code":"library(\"TreeTools\", quietly = TRUE) pair1 <- c(BalancedTree(9), StarTree(9)) pair2 <- c(BalancedTree(9), PectinateTree(9))  # We'll let the number of nodes define the total information in a tree Nnode(pair1) #> [1] 8 1 Nnode(pair2) #> [1] 8 8  # Let's normalize a unit distance rawDist <- cbind(c(1, 1), c(1, 1))  # With `Combine = \"+\"`, the maximum distance is the sum of # the information in each tree denominator <- outer(Nnode(pair1), Nnode(pair2), \"+\")  NormalizeInfo(rawDist, pair1, pair2, InfoInTree = ape::Nnode, Combine = \"+\") #>           [,1]      [,2] #> [1,] 0.0625000 0.0625000 #> [2,] 0.1111111 0.1111111 rawDist / denominator #>           [,1]      [,2] #> [1,] 0.0625000 0.0625000 #> [2,] 0.1111111 0.1111111   # A denominator can be specified manually using `how`: NormalizeInfo(rawDist, pair1, pair2, InfoInTree = ape::Nnode, how = 16) #>        [,1]   [,2] #> [1,] 0.0625 0.0625 #> [2,] 0.0625 0.0625 rawDist / 16 #>        [,1]   [,2] #> [1,] 0.0625 0.0625 #> [2,] 0.0625 0.0625   # `how` also allows the denominator to be computed from trees: outer(Nnode(pair1), Nnode(pair2), pmin) #>      [,1] [,2] #> [1,]    8    8 #> [2,]    1    1 NormalizeInfo(rawDist, pair1, pair2, InfoInTree = ape::Nnode, how = pmin) #>       [,1]  [,2] #> [1,] 0.125 0.125 #> [2,] 1.000 1.000 rawDist / outer(Nnode(pair1), Nnode(pair2), pmin) #>       [,1]  [,2] #> [1,] 0.125 0.125 #> [2,] 1.000 1.000"},{"path":"https://ms609.github.io/TreeDist/dev/reference/NyeSimilarity.html","id":null,"dir":"Reference","previous_headings":"","what":"Nye et al. (2006) tree comparison — NyeSimilarity","title":"Nye et al. (2006) tree comparison — NyeSimilarity","text":"NyeSimilarity() NyeSplitSimilarity() implement Generalized Robinson–Foulds tree comparison metric Nye et al. (2006) . short, finds optimal matching pairs branch one tree branch second, matchings scored according size largest split consistent , normalized Jaccard index. detailed account available vignettes.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/NyeSimilarity.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Nye et al. (2006) tree comparison — NyeSimilarity","text":"","code":"NyeSimilarity(   tree1,   tree2 = NULL,   similarity = TRUE,   normalize = FALSE,   normalizeMax = !is.logical(normalize),   reportMatching = FALSE,   diag = TRUE )  NyeSplitSimilarity(   splits1,   splits2,   nTip = attr(splits1, \"nTip\"),   reportMatching = FALSE )"},{"path":"https://ms609.github.io/TreeDist/dev/reference/NyeSimilarity.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Nye et al. (2006) tree comparison — NyeSimilarity","text":"tree1, tree2 Trees class phylo, leaves labelled identically, lists trees undergo pairwise comparison.  implemented, tree2 = NULL compute distances pair trees list tree1 using fast algorithm based Day (1985) . similarity Logical specifying whether report result tree similarity, rather difference. normalize numeric value provided, used maximum value rescale results. TRUE, results rescaled maximum value calculated specified tree sizes topology, specified \"Normalization\" section . FALSE, results rescaled. normalizeMax calculating similarity, normalize maximum number splits present (TRUE), number splits actually observed (FALSE)? Defaults number splits better-resolved tree; set normalize = pmin.int use number splits less resolved tree. reportMatching Logical specifying whether return clade matchings attribute score. diag Logical specifying whether return similarities along diagonal, .e. tree .  Applies tree2 list identical tree1, NULL. splits1, splits2 Logical matrices row corresponds leaf, either listed order bearing identical names (sequence), column corresponds split, leaf identified member ingroup (TRUE) outgroup (FALSE) respective split. nTip (Optional) Integer specifying number leaves split.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/NyeSimilarity.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Nye et al. (2006) tree comparison — NyeSimilarity","text":"NyeSimilarity() returns array numerics providing distances  pair trees tree1 tree2, splits1 splits2.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/NyeSimilarity.html","id":"details","dir":"Reference","previous_headings":"","what":"Details","title":"Nye et al. (2006) tree comparison — NyeSimilarity","text":"measure defined similarity score.  similarity = FALSE, similarity score converted distance doubling subtracting number splits present trees. ensures consistency JaccardRobinsonFoulds. Note NyeSimilarity(tree1, tree2) equivalent , slightly faster , JaccardRobinsonFoulds (tree1, tree2, k = 1, allowConflict = TRUE).","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/NyeSimilarity.html","id":"normalization","dir":"Reference","previous_headings":"","what":"Normalization","title":"Nye et al. (2006) tree comparison — NyeSimilarity","text":"normalize = TRUE similarity = TRUE, results rescaled zero one dividing mean number splits two trees compared. may wish normalize instead number splits present smaller tree, represents maximum value possible pair trees specified topologies (normalize = pmin.int); number splits resolved tree (normalize = pmax.int); maximum value possible pair trees  n leaves, n - 3 (normalize = TreeTools::NTip(tree1) - 3L). normalize = TRUE similarity = FALSE, results rescaled zero one dividing total number splits pair trees considered. Trees need contain identical leaves; scores based leaves trees hold common.  Check unexpected differences tip labelling setdiff(TipLabels(tree1), TipLabels(tree2)).","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/NyeSimilarity.html","id":"references","dir":"Reference","previous_headings":"","what":"References","title":"Nye et al. (2006) tree comparison — NyeSimilarity","text":"Day WHE (1985). “Optimal algorithms comparing trees labeled leaves.” Journal Classification, 2(1), 7–28. doi:10.1007/BF01908061 . Nye TMW, Liò P, Gilks WR (2006). “novel algorithm web-based tool comparing two alternative phylogenetic trees.” Bioinformatics, 22(1), 117–119. doi:10.1093/bioinformatics/bti720 .","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/reference/NyeSimilarity.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Nye et al. (2006) tree comparison — NyeSimilarity","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/NyeSimilarity.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Nye et al. (2006) tree comparison — NyeSimilarity","text":"","code":"library(\"TreeTools\") NyeSimilarity(BalancedTree(8), PectinateTree(8)) #> [1] 3.8 VisualizeMatching(NyeSimilarity, BalancedTree(8), PectinateTree(8))  NyeSimilarity(as.phylo(0:5, nTip = 8), PectinateTree(8)) #> [1] 3.166667 2.750000 2.750000 2.500000 2.450000 2.500000 NyeSimilarity(as.phylo(0:5, nTip = 8), similarity = FALSE) #>          1        2        3        4        5 #> 2 1.333333                                     #> 3 1.333333 1.333333                            #> 4 2.166667 2.333333 2.333333                   #> 5 2.333333 2.166667 2.333333 1.000000          #> 6 2.000000 2.000000 1.500000 1.500000 1.500000"},{"path":"https://ms609.github.io/TreeDist/dev/reference/PathDist.html","id":null,"dir":"Reference","previous_headings":"","what":"Path distance — PathDist","title":"Path distance — PathDist","text":"Calculate path distance rooted unrooted trees.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/PathDist.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Path distance — PathDist","text":"","code":"PathDist(tree1, tree2 = NULL)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/PathDist.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Path distance — PathDist","text":"tree1, tree2 Trees class phylo, leaves labelled identically, lists trees undergo pairwise comparison.  implemented, tree2 = NULL compute distances pair trees list tree1 using fast algorithm based Day (1985) .","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/PathDist.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Path distance — PathDist","text":"PathDist() returns vector distance matrix distances trees.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/PathDist.html","id":"details","dir":"Reference","previous_headings":"","what":"Details","title":"Path distance — PathDist","text":"function faster alternative function path.dist() phangorn package, can crash internal representation trees conform certain (unspecified) expectations, treats trees unrooted. path distance calculated tabulating cladistic difference (= topological distance) pair tips tree. precursor path distance (Farris 1969)  took mean squared difference elements tree's tabulation (Farris, 1973); method used proposed Steel Penny (1993) , takes square root sum. precursor measures described Williams Clifford (1971)  Phipps (1971) . root node present, trees treated rooted. avoid counting root edge twice, use UnrootTree(tree) calculating path distance. Use path distance discouraged emphasizes shallow relationships expense deeper (arguably fundamental) relationships (Farris 1973) .","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/PathDist.html","id":"references","dir":"Reference","previous_headings":"","what":"References","title":"Path distance — PathDist","text":"Day WHE (1985). “Optimal algorithms comparing trees labeled leaves.” Journal Classification, 2(1), 7–28. doi:10.1007/BF01908061 . Farris JS (1969). “successive approximations approach character weighting.” Systematic Biology, 18(4), 374–385. doi:10.2307/2412182 . Farris JS (1973). “comparing shapes taxonomic trees.” Systematic Zoology, 22(1), 50–54. doi:10.2307/2412378 . Phipps JB (1971). “Dendrogram topology.” Systematic Zoology, 20(3), 306. doi:10.2307/2412343 . Steel MA, Penny D (1993). “Distributions tree comparison metrics—new results.” Systematic Biology, 42(2), 126–141. doi:10.1093/sysbio/42.2.126 . Williams WT, Clifford HT (1971). “comparison two classifications set elements.” Taxon, 20(4), 519–522. doi:10.2307/1218253 .","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/reference/PathDist.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Path distance — PathDist","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/PathDist.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Path distance — PathDist","text":"","code":"library(\"TreeTools\")  # Treating the two edges to the root node as distinct PathDist(BalancedTree(7), PectinateTree(7)) #> [1] 5.656854  # Counting those two edges once PathDist(UnrootTree(BalancedTree(7)), UnrootTree(PectinateTree(7))) #> [1] 4.690416  PathDist(BalancedTree(7), as.phylo(0:2, 7)) #> [1] 8.944272 8.124038 8.944272 PathDist(as.phylo(0:2, 7), PectinateTree(7)) #> [1] 7.745967 8.246211 8.124038  PathDist(list(bal = BalancedTree(7), pec = PectinateTree(7)),         as.phylo(0:2, 7)) #>          [,1]     [,2]     [,3] #> [1,] 8.944272 8.124038 8.944272 #> [2,] 7.745967 8.246211 8.124038  PathDist(as.phylo(30:33, 8)) #>          1        2        3 #> 2 3.872983                   #> 3 3.872983 3.464102          #> 4 5.567764 6.928203 6.928203"},{"path":"https://ms609.github.io/TreeDist/dev/reference/Plot3.html","id":null,"dir":"Reference","previous_headings":"","what":"Pseudo-3D plotting — Plot3","title":"Pseudo-3D plotting — Plot3","text":"Plot3() displays three-dimensional data two dimensions, reflecting third dimension point scaling, overlap fogging. Points lower z value smaller , fainter , overlapped points higher value.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/Plot3.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Pseudo-3D plotting — Plot3","text":"","code":"Plot3(   x,   y = NULL,   z = NULL,   pch = par(\"pch\"),   col = par(\"col\"),   bg = NA,   cex = 1,   axes = TRUE,   frame.plot = axes,   plot.bg = NA,   fog = 1/2,   shrink = 1/2,   add = FALSE,   ... )"},{"path":"https://ms609.github.io/TreeDist/dev/reference/Plot3.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Pseudo-3D plotting — Plot3","text":"x, y, z Coordinates points plot. bg, cex, col, pch, add, axes, frame.plot, ... Parameters passed plot.default(). plot.bg Colour fill plot area, used fog colour. fog Numeric zero (fading) one (furthest points invisible) specifying amount fade distant points. shrink Numeric specifying degree size plotted point reflect z position. 0 denotes scaling; 1, furthest point zero size.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/Plot3.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Pseudo-3D plotting — Plot3","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/Plot3.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Pseudo-3D plotting — Plot3","text":"","code":"Plot3(1:10, 1:10, 1:10, cex = 7, pch = 16, axes = FALSE, asp = 1)  # Extreme values of fog and shrink will cause smallest z values to # become invisible. Plot3(1:10, 1:10, 1:10, cex = 7, pch = 16, axes = FALSE, asp = 1,       fog = 1, shrink = 1)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/ReduceTrees.html","id":null,"dir":"Reference","previous_headings":"","what":"Collapse areas of agreement between two trees — ReduceTrees","title":"Collapse areas of agreement between two trees — ReduceTrees","text":"ReduceTrees() reduces trees according tree reduction rules Allen Steel (2001) : Collapse identical pendant subtrees; Compress equivalent internal chains.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/ReduceTrees.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Collapse areas of agreement between two trees — ReduceTrees","text":"","code":"ReduceTrees(tree1, tree2, check = TRUE)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/ReduceTrees.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Collapse areas of agreement between two trees — ReduceTrees","text":"tree1, tree2 Single trees class phylo undergo comparison. check Logical specifying whether validate input. Specify FALSE encounter undefined behaviour trees binary phylo objects identical leaf labels, rooted leaf 1.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/ReduceTrees.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Collapse areas of agreement between two trees — ReduceTrees","text":"ReduceTrees() returns list two trees, corresponding tree1 tree2 identical groupings collapsed, tree edges listed postorder; NULL trees equivalent.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/ReduceTrees.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Collapse areas of agreement between two trees — ReduceTrees","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/ReduceTrees.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Collapse areas of agreement between two trees — ReduceTrees","text":"","code":"tree1 <- TreeTools::BalancedTree(9) tree2 <- TreeTools::PectinateTree(9)  # Set graphical parameters oPar <- par(mai = rep(0.1, 4), mfrow = c(2, 2))  plot(tree1) plot(tree2)  # Reduce trees by collapsing identical clades confl <- ReduceTrees(tree1, tree2)  plot(confl[[1]]) plot(confl[[2]])   # Restore graphical parameters par(oPar)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/ReportMatching.html","id":null,"dir":"Reference","previous_headings":"","what":"List clades as text — ReportMatching","title":"List clades as text — ReportMatching","text":"List clades text","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/ReportMatching.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"List clades as text — ReportMatching","text":"","code":"ReportMatching(splits1, splits2, realMatch = TRUE)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/ReportMatching.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"List clades as text — ReportMatching","text":"splits1, splits2 Logical matrices columns specifying membership corresponding matched clade.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/ReportMatching.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"List clades as text — ReportMatching","text":"ReportMatching returns character vector describing pairing matching.","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/reference/ReportMatching.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"List clades as text — ReportMatching","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/Robinson-Foulds.html","id":null,"dir":"Reference","previous_headings":"","what":"Robinson–Foulds distances, with adjustments for phylogenetic information content — Robinson-Foulds","title":"Robinson–Foulds distances, with adjustments for phylogenetic information content — Robinson-Foulds","text":"RobinsonFoulds() calculates Robinson–Foulds distance (Robinson Foulds 1981) , corresponding similarity measure. InfoRobinsonFoulds() weights splits according phylogenetic information content (§2.1 Smith 2020) . Optionally, matching identical splits may reported. Generalized Robinson–Foulds distances (see TreeDistance()) better suited use cases (Smith 2020, 2022) .","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/Robinson-Foulds.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Robinson–Foulds distances, with adjustments for phylogenetic information content — Robinson-Foulds","text":"","code":"InfoRobinsonFoulds(   tree1,   tree2 = NULL,   similarity = FALSE,   normalize = FALSE,   reportMatching = FALSE )  InfoRobinsonFouldsSplits(   splits1,   splits2,   nTip = attr(splits1, \"nTip\"),   reportMatching = FALSE )  RobinsonFoulds(   tree1,   tree2 = NULL,   similarity = FALSE,   normalize = FALSE,   reportMatching = FALSE )  RobinsonFouldsMatching(   tree1,   tree2,   similarity = FALSE,   normalize = FALSE,   ... )  RobinsonFouldsSplits(   splits1,   splits2,   nTip = attr(splits1, \"nTip\"),   reportMatching = FALSE )"},{"path":"https://ms609.github.io/TreeDist/dev/reference/Robinson-Foulds.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Robinson–Foulds distances, with adjustments for phylogenetic information content — Robinson-Foulds","text":"tree1, tree2 Trees class phylo, leaves labelled identically, lists trees undergo pairwise comparison.  implemented, tree2 = NULL compute distances pair trees list tree1 using fast algorithm based Day (1985) . similarity Logical specifying whether report result tree similarity, rather difference. normalize numeric value provided, used maximum value rescale results. TRUE, results rescaled maximum value calculated specified tree sizes topology, specified \"Normalization\" section . FALSE, results rescaled. reportMatching Logical specifying whether return clade matchings attribute score. splits1, splits2 Logical matrices row corresponds leaf, either listed order bearing identical names (sequence), column corresponds split, leaf identified member ingroup (TRUE) outgroup (FALSE) respective split. nTip (Optional) Integer specifying number leaves split. ... used.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/Robinson-Foulds.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Robinson–Foulds distances, with adjustments for phylogenetic information content — Robinson-Foulds","text":"RobinsonFoulds() InfoRobinsonFoulds() return array numerics providing distances  pair trees tree1 tree2, splits1 splits2. reportMatching = TRUE, pairScores attribute returns logical matrix specifying whether pair splits identical.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/Robinson-Foulds.html","id":"details","dir":"Reference","previous_headings":"","what":"Details","title":"Robinson–Foulds distances, with adjustments for phylogenetic information content — Robinson-Foulds","text":"RobinsonFoulds() calculates standard Robinson–Foulds distance, .e. number splits occur one tree . InfoRobinsonFoulds() calculates tree similarity distance summing phylogenetic information content splits () identical trees.  Consequently, splits likely identical chance alone make smaller contribution overall tree distance, similarity less remarkable. Rapid comparison multiple pairs trees employs Day (1985)  linear-time algorithm.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/Robinson-Foulds.html","id":"functions","dir":"Reference","previous_headings":"","what":"Functions","title":"Robinson–Foulds distances, with adjustments for phylogenetic information content — Robinson-Foulds","text":"RobinsonFouldsMatching(): Matched splits, intended use VisualizeMatching().","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/Robinson-Foulds.html","id":"normalization","dir":"Reference","previous_headings":"","what":"Normalization","title":"Robinson–Foulds distances, with adjustments for phylogenetic information content — Robinson-Foulds","text":"RobinsonFoulds() normalized total number splits present. InfoRobinsonFoulds() normalized sum phylogenetic information splits tree, treated independently.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/Robinson-Foulds.html","id":"references","dir":"Reference","previous_headings":"","what":"References","title":"Robinson–Foulds distances, with adjustments for phylogenetic information content — Robinson-Foulds","text":"Day WHE (1985). “Optimal algorithms comparing trees labeled leaves.” Journal Classification, 2(1), 7–28. doi:10.1007/BF01908061 . Robinson DF, Foulds LR (1981). “Comparison phylogenetic trees.” Mathematical Biosciences, 53(1-2), 131–147. doi:10.1016/0025-5564(81)90043-2 . Smith MR (2020). “Information theoretic Generalized Robinson-Foulds metrics comparing phylogenetic trees.” Bioinformatics, 36(20), 5007–5013. doi:10.1093/bioinformatics/btaa614 . Smith MR (2022). “Robust analysis phylogenetic tree space.” Systematic Biology, 71(5), 1255–1270. doi:10.1093/sysbio/syab100 .","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/reference/Robinson-Foulds.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Robinson–Foulds distances, with adjustments for phylogenetic information content — Robinson-Foulds","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/Robinson-Foulds.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Robinson–Foulds distances, with adjustments for phylogenetic information content — Robinson-Foulds","text":"","code":"# For BalancedTree, PectinateTree, as.phylo: library(\"TreeTools\", quietly = TRUE) balanced7 <- BalancedTree(7) pectinate7 <- PectinateTree(7) RobinsonFoulds(balanced7, pectinate7) #> [1] 4 RobinsonFoulds(balanced7, pectinate7, normalize = TRUE) #> [1] 0.5 VisualizeMatching(RobinsonFouldsMatching, balanced7, pectinate7)   InfoRobinsonFoulds(balanced7, pectinate7) #> [1] 13.90209 VisualizeMatching(InfoRobinsonFoulds, balanced7, pectinate7)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/SPRDist.html","id":null,"dir":"Reference","previous_headings":"","what":"Approximate the Subtree Prune and Regraft (SPR) distance. — SPRDist","title":"Approximate the Subtree Prune and Regraft (SPR) distance. — SPRDist","text":"SPRDist() calculates upper bound SPR distance trees using heuristic method de Oliveira Martins et al. (2008) . approximations available (e.g. Hickey et al. 2008, Goloboff 2008, Whidden Matsen 2018) .","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/SPRDist.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Approximate the Subtree Prune and Regraft (SPR) distance. — SPRDist","text":"","code":"SPRDist(tree1, tree2 = NULL, method = \"deOliveira\", symmetric)  # S3 method for class 'phylo' SPRDist(tree1, tree2 = NULL, method = \"deOliveira\", symmetric)  # S3 method for class 'list' SPRDist(tree1, tree2 = NULL, method = \"deOliveira\", symmetric)  # S3 method for class 'multiPhylo' SPRDist(tree1, tree2 = NULL, method = \"deOliveira\", symmetric)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/SPRDist.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Approximate the Subtree Prune and Regraft (SPR) distance. — SPRDist","text":"tree1, tree2 Trees class phylo, leaves labelled identically, lists trees undergo pairwise comparison.  implemented, tree2 = NULL compute distances pair trees list tree1 using fast algorithm based Day (1985) . method Character specifying method use approximate SPR distance.  Currently defaults \"deOliveira\", available option; new method eventually become default. symmetric Ignored (redundant fix phangorn#97).","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/SPRDist.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Approximate the Subtree Prune and Regraft (SPR) distance. — SPRDist","text":"SPRDist() returns vector distance matrix distances trees.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/SPRDist.html","id":"references","dir":"Reference","previous_headings":"","what":"References","title":"Approximate the Subtree Prune and Regraft (SPR) distance. — SPRDist","text":"Day WHE (1985). “Optimal algorithms comparing trees labeled leaves.” Journal Classification, 2(1), 7–28. doi:10.1007/BF01908061 . de Oliveira Martins L, Leal E, Kishino H (2008). “Phylogenetic detection recombination Bayesian prior distance trees.” PLoS One, 3(7), e2651. doi:10.1371/journal.pone.0002651 . Goloboff PA (2008). “Calculating SPR distances trees.” Cladistics, 24(4), 591-597. doi:10.1111/j.1096-0031.2007.00189.x . Hickey G, Dehne F, Rau-Chaplin , Blouin C (2008). “SPR distance computation unrooted trees.” Evolutionary Bioinformatics, 4, EBO–S419. doi:10.4137/EBO.S419 . Whidden C, Matsen FA (2018). “Efficiently Inferring Pairwise Subtree Prune--Regraft Adjacencies Phylogenetic Trees.” 2018 Proceedings Meeting Analytic Algorithmics Combinatorics (ANALCO), 77–91. doi:10.1137/1.9781611975062.8 .","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/reference/SPRDist.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Approximate the Subtree Prune and Regraft (SPR) distance. — SPRDist","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/SPRDist.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Approximate the Subtree Prune and Regraft (SPR) distance. — SPRDist","text":"","code":"library(\"TreeTools\", quietly = TRUE)  # Compare single pair of trees SPRDist(BalancedTree(7), PectinateTree(7)) #> [1] 2  # Compare all pairs of trees         SPRDist(as.phylo(30:33, 8)) #>   1 2 3 4 #> 1   1 1 1 #> 2 1   1 1 #> 3 1 1   1 #> 4 1 1 1    # Compare each tree in one list with each tree in another SPRDist(BalancedTree(7), as.phylo(0:2, 7)) #> [1] 2 2 2 SPRDist(as.phylo(0:2, 7), PectinateTree(7)) #> [1] 1 2 2  SPRDist(list(bal = BalancedTree(7), pec = PectinateTree(7)),         as.phylo(0:2, 7)) #>     [,1] [,2] [,3] #> bal    2    2    2 #> pec    1    2    2"},{"path":"https://ms609.github.io/TreeDist/dev/reference/SpectralEigens.html","id":null,"dir":"Reference","previous_headings":"","what":"Eigenvalues for spectral clustering — SpectralEigens","title":"Eigenvalues for spectral clustering — SpectralEigens","text":"Spectral clustering emphasizes nearest neighbours forming clusters; avoids issues arise clustering around means / medoids.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/SpectralEigens.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Eigenvalues for spectral clustering — SpectralEigens","text":"","code":"SpectralEigens(D, nn = 10L, nEig = 2L)  SpectralClustering(D, nn = 10L, nEig = 2L)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/SpectralEigens.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Eigenvalues for spectral clustering — SpectralEigens","text":"D Square matrix dist object containing Euclidean distances data points. nn Integer specifying number nearest neighbours consider nEig Integer specifying number eigenvectors retain.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/SpectralEigens.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Eigenvalues for spectral clustering — SpectralEigens","text":"SpectralEigens() returns spectral eigenvalues can clustered using method choice.","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/reference/SpectralEigens.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Eigenvalues for spectral clustering — SpectralEigens","text":"Adapted MRS script Nura Kawa","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/SpectralEigens.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Eigenvalues for spectral clustering — SpectralEigens","text":"","code":"library(\"TreeTools\", quietly = TRUE) trees <- as.phylo(0:18, nTip = 8) distances <- ClusteringInfoDistance(trees) eigens <- SpectralEigens(distances) # Perform clustering: clusts <- KMeansPP(dist(eigens), k = 3) plot(eigens, pch = 15, col = clusts$cluster)  plot(cmdscale(distances), pch = 15, col = clusts$cluster)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/SplitEntropy.html","id":null,"dir":"Reference","previous_headings":"","what":"Entropy of two splits — SplitEntropy","title":"Entropy of two splits — SplitEntropy","text":"Calculate entropy, joint entropy, entropy distance information content two splits, treating split division n leaves two groups. details available vignette, MacKay (2003)  Meila (2007) .","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/SplitEntropy.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Entropy of two splits — SplitEntropy","text":"","code":"SplitEntropy(split1, split2 = split1)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/SplitEntropy.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Entropy of two splits — SplitEntropy","text":"split1, split2 Logical vectors listing leaves consistent order, identifying leaf member ingroup (TRUE) outgroup (FALSE) split question.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/SplitEntropy.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Entropy of two splits — SplitEntropy","text":"numeric vector listing, bits: H1 entropy split 1; H2 entropy split 2; H12 joint entropy splits; mutual information splits; Hd entropy distance (variation information) splits.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/SplitEntropy.html","id":"references","dir":"Reference","previous_headings":"","what":"References","title":"Entropy of two splits — SplitEntropy","text":"MacKay DJC (2003). Information Theory, Inference, Learning Algorithms. Cambridge University Press, Cambridge. https://www.inference.org.uk/itprnn/book.pdf. Meila M (2007). “Comparing clusterings—information based distance.” Journal Multivariate Analysis, 98(5), 873–895. doi:10.1016/j.jmva.2006.11.013 .","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/reference/SplitEntropy.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Entropy of two splits — SplitEntropy","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/SplitEntropy.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Entropy of two splits — SplitEntropy","text":"","code":"A <- TRUE B <- FALSE SplitEntropy(c(A, A, A, B, B, B), c(A, A, B, B, B, B)) #>        H1        H2       H12         I        Hd  #> 1.0000000 0.9182958 1.4591479 0.4591479 1.0000000"},{"path":"https://ms609.github.io/TreeDist/dev/reference/SplitSharedInformation.html","id":null,"dir":"Reference","previous_headings":"","what":"Shared information content of two splits — SplitSharedInformation","title":"Shared information content of two splits — SplitSharedInformation","text":"Calculate phylogenetic information shared, shared, two splits. See accompanying vignette definitions.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/SplitSharedInformation.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Shared information content of two splits — SplitSharedInformation","text":"","code":"SplitSharedInformation(n, A1, A2 = A1)  SplitDifferentInformation(n, A1, A2 = A1)  TreesConsistentWithTwoSplits(n, A1, A2 = A1)  LnTreesConsistentWithTwoSplits(n, A1, A2 = A1)  Log2TreesConsistentWithTwoSplits(n, A1, A2 = A1)  Log2TreesConsistentWithTwoSplits(n, A1, A2 = A1)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/SplitSharedInformation.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Shared information content of two splits — SplitSharedInformation","text":"n Integer specifying number leaves A1, A2 Integers specifying number taxa A1 A2, splits arranged A1 fully overlaps A2.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/SplitSharedInformation.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Shared information content of two splits — SplitSharedInformation","text":"TreesConsistentWithTwoSplits() returns number unrooted bifurcating trees consistent two splits. SplitSharedInformation() returns phylogenetic information two splits common (Meila 2007) , bits. SplitDifferentInformation() returns amount phylogenetic information distinct one two splits, bits.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/SplitSharedInformation.html","id":"details","dir":"Reference","previous_headings":"","what":"Details","title":"Shared information content of two splits — SplitSharedInformation","text":"Split S1 divides n leaves two splits, A1 B1. Split S2 divides leaves splits A2 B2. Splits must named A1 fully overlaps A2: say, taxa A1 also A2, vice versa. Thus, taxa smaller A1 A2 also occur larger.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/SplitSharedInformation.html","id":"functions","dir":"Reference","previous_headings":"","what":"Functions","title":"Shared information content of two splits — SplitSharedInformation","text":"SplitDifferentInformation(): Different information two splits. TreesConsistentWithTwoSplits(): Number trees consistent two splits. LnTreesConsistentWithTwoSplits(): Natural logarithm TreesConsistentWithTwoSplits(). Log2TreesConsistentWithTwoSplits(): Base two logarithm TreesConsistentWithTwoSplits(). Log2TreesConsistentWithTwoSplits(): Base 2 logarithm TreesConsistentWithTwoSplits().","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/SplitSharedInformation.html","id":"references","dir":"Reference","previous_headings":"","what":"References","title":"Shared information content of two splits — SplitSharedInformation","text":"Meila M (2007). “Comparing clusterings—information based distance.” Journal Multivariate Analysis, 98(5), 873–895. doi:10.1016/j.jmva.2006.11.013 .","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/reference/SplitSharedInformation.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Shared information content of two splits — SplitSharedInformation","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/SplitSharedInformation.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Shared information content of two splits — SplitSharedInformation","text":"","code":"# Eight leaves, labelled A to H.   # Split 1: ABCD|EFGH   # Split 2: ABC|DEFGH   # Let A1 = ABCD (four taxa), and A2 = ABC (three taxa).   # A1 and A2 overlap (both contain ABC).      TreesConsistentWithTwoSplits(n = 8, A1 = 4, A2 = 3) #> [1] 45   SplitSharedInformation(n = 8, A1 = 4, A2 = 3) #> [1] 2.722466   SplitDifferentInformation(n = 8, A1 = 4, A2 = 3) #> [1] 5.129283    # If splits are identical, then their shared information is the same   # as the information of either split:   SplitSharedInformation(n = 8, A1 = 3, A2 = 3) #> [1] 5.044394   TreeTools::SplitInformation(3, 5) #> [1] 5.044394"},{"path":"https://ms609.github.io/TreeDist/dev/reference/SplitsCompatible.html","id":null,"dir":"Reference","previous_headings":"","what":"Are splits compatible? — SplitsCompatible","title":"Are splits compatible? — SplitsCompatible","text":"Determine whether splits compatible (concave); .e. can occur single tree.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/SplitsCompatible.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Are splits compatible? — SplitsCompatible","text":"","code":"SplitsCompatible(split1, split2)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/SplitsCompatible.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Are splits compatible? — SplitsCompatible","text":"split1, split2 Logical vectors listing leaves consistent order, identifying leaf member ingroup (TRUE) outgroup (FALSE) split question.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/SplitsCompatible.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Are splits compatible? — SplitsCompatible","text":"SplitsCompatible() returns logical specifying whether splits provided compatible one another.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/SplitsCompatible.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Are splits compatible? — SplitsCompatible","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/SplitsCompatible.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Are splits compatible? — SplitsCompatible","text":"","code":"A <- TRUE B <- FALSE SplitsCompatible(c(A, A, A, B, B, B),                  c(A, A, B, B, B, B)) #> [1] TRUE SplitsCompatible(c(A, A, A, B, B, B),                  c(A, A, B, B, B, A)) #> [1] FALSE"},{"path":"https://ms609.github.io/TreeDist/dev/reference/StartParallel.html","id":null,"dir":"Reference","previous_headings":"","what":"Calculate distances in parallel — StartParallel","title":"Calculate distances in parallel — StartParallel","text":"Accelerate distance calculation employing multiple CPU workers.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/StartParallel.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Calculate distances in parallel — StartParallel","text":"","code":"StartParallel(...)  SetParallel(cl)  GetParallel(cl)  StopParallel(quietly = FALSE)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/StartParallel.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Calculate distances in parallel — StartParallel","text":"... Parameters pass makeCluster(). cl existing cluster. quietly Logical; TRUE, warn cluster running.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/StartParallel.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Calculate distances in parallel — StartParallel","text":"StartParallel() SetParallel() return previous value options(\"TreeDist-cluster\"). GetParallel() returns currently specified cluster. StopParallel() returns TRUE cluster destroyed, FALSE otherwise.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/StartParallel.html","id":"details","dir":"Reference","previous_headings":"","what":"Details","title":"Calculate distances in parallel — StartParallel","text":"\"TreeDist\" parallelizes calculation tree tree distances via parCapply() function, using user-defined cluster specified options(\"TreeDist-cluster\"). StartParallel() calls parallel::makeCluster() tells \"TreeDist\" use created cluster. SetParallel() tells \"TreeDist\" use pre-existing user-specified cluster. StopParallel() stops current TreeDist cluster.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/StartParallel.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Calculate distances in parallel — StartParallel","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/StartParallel.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Calculate distances in parallel — StartParallel","text":"","code":"if (interactive()) { # Only run in terminal   library(\"TreeTools\", quietly = TRUE)   nCores <- ceiling(parallel::detectCores() / 2)   StartParallel(nCores) # Takes a few seconds to set up processes   GetParallel()   ClusteringInfoDistance(as.phylo(0:6, 100))   StopParallel() # Returns system resources }"},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeDist-package.html","id":null,"dir":"Reference","previous_headings":"","what":"TreeDist: Distances between Phylogenetic Trees — TreeDist-package","title":"TreeDist: Distances between Phylogenetic Trees — TreeDist-package","text":"'TreeDist' R package implements suite metrics quantify topological distance pairs unweighted phylogenetic trees. also includes simple \"Shiny\" application allow visualization distance-based tree spaces, functions calculate information content trees splits.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeDist-package.html","id":"details","dir":"Reference","previous_headings":"","what":"Details","title":"TreeDist: Distances between Phylogenetic Trees — TreeDist-package","text":"\"TreeDist\" primarily employs metrics category \"generalized Robinson–Foulds distances\": based comparing splits (bipartitions) trees, thus reflect relationship data within trees, reference branch lengths. Detailed documentation usage instructions available online vignettes.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeDist-package.html","id":"generalized-rf-distances","dir":"Reference","previous_headings":"","what":"Generalized RF distances","title":"TreeDist: Distances between Phylogenetic Trees — TreeDist-package","text":"Robinson–Foulds distance simply tallies number non-trivial splits (sometimes inaccurately termed clades, nodes edges) occur trees – splits perfectly identical contributes one point distance score zero, however similar different . overlooking potential similarities almost-identical splits, conservative approach undesirable properties. \"Generalized\" RF metrics generate matchings pair split one tree similar split . pair splits assigned similarity score; sum scores optimal matching quantifies similarity two trees. Different ways calculating similarity pair splits lead different tree distance metrics, implemented functions : MutualClusteringInfo(), SharedPhylogeneticInfo() Smith (2020) scores matchings based amount information one partition contains .  Mutual Phylogenetic Information assigns zero similarity split pairs exist single tree; Mutual Clustering Information metric forgiving, exhibits desirable behaviour; recommended metric tree comparison. (complement, ClusteringInfoDistance(), returns tree distance.) NyeSimilarity() Nye et al. (2006) score matchings according size largest split consistent , normalized Jaccard index.  approach extended Böcker et al. (2013) Jaccard–Robinson–Foulds metric (function JaccardRobinsonFoulds()). MatchingSplitDistance() Bogdanowicz Giaro (2012)  Lin et al. (2012) independently proposed counting number \"mismatched\" leaves pair splits. MatchingSplitInfoDistance() provides information-based equivalent (Smith 2020). package also implements variation path distance proposed Kendal Colijn (2016) (function KendallColijn()), approximations Nearest-Neighbour Interchange (NNI) distance (function NNIDist(); following Li et al. (1996)), calculates size (function MASTSize()) information content (function MASTInfo()) Maximum Agreement Subtree. implementation Tree Bisection Reconnection (TBR) distance, see package 'TBRDist'.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeDist-package.html","id":"tree-space-analysis","dir":"Reference","previous_headings":"","what":"Tree space analysis","title":"TreeDist: Distances between Phylogenetic Trees — TreeDist-package","text":"Map tree spaces readily visualize mapped landscapes, avoiding common analytical pitfalls (Smith, forthcoming), using inbuilt graphical user interface:   Serious analysts consult vignette command-line interface.","code":"TreeDist::MapTrees()"},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeDist-package.html","id":"references","dir":"Reference","previous_headings":"","what":"References","title":"TreeDist: Distances between Phylogenetic Trees — TreeDist-package","text":"Böcker S, Canzar S, Klau GW (2013). “generalized Robinson-Foulds metric.” Darling , Stoye J (eds.), Algorithms Bioinformatics. WABI 2013. Lecture Notes Computer Science, vol 8126, 156–169. Springer, Berlin, Heidelberg. doi:10.1007/978-3-642-40453-5_13 . Bogdanowicz D, Giaro K (2012). “Matching split distance unrooted binary phylogenetic trees.” IEEE/ACM Transactions Computational Biology Bioinformatics, 9(1), 150–160. doi:10.1109/TCBB.2011.48 . Kendall M, Colijn C (2016). “Mapping phylogenetic trees reveal distinct patterns evolution.” Molecular Biology Evolution, 33(10), 2735–2743. doi:10.1093/molbev/msw124 . Li M, Tromp J, Zhang L (1996). “notes nearest neighbour interchange distance.” Goos G, Hartmanis J, Leeuwen J, Cai J, Wong CK (eds.), Computing Combinatorics, volume 1090, 343–351. Springer, Berlin, Heidelberg. ISBN 978-3-540-61332-9 978-3-540-68461-9, doi:10.1007/3-540-61332-3_168 . Lin Y, Rajan V, Moret BME (2012). “metric phylogenetic trees based matching.” IEEE/ACM Transactions Computational Biology Bioinformatics, 4(9), 1014–1022. doi:10.1109/TCBB.2011.157 . Nye TMW, Liò P, Gilks WR (2006). “novel algorithm web-based tool comparing two alternative phylogenetic trees.” Bioinformatics, 22(1), 117–119. doi:10.1093/bioinformatics/bti720 . Smith MR (2020). “Information theoretic Generalized Robinson-Foulds metrics comparing phylogenetic trees.” Bioinformatics, 36(20), 5007–5013. doi:10.1093/bioinformatics/btaa614 . Smith MR (2022). “Robust analysis phylogenetic tree space.” Systematic Biology, 71(5), 1255–1270. doi:10.1093/sysbio/syab100 .","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeDist-package.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"TreeDist: Distances between Phylogenetic Trees — TreeDist-package","text":"Maintainer: Martin R. Smith martin.smith@durham.ac.uk (ORCID) [copyright holder, programmer] contributors: Roy Jonker roy_jonker@magiclogic.com [programmer, copyright holder] Yong Yang yongyanglink@gmail.com [contributor, copyright holder] Yi Cao [contributor, copyright holder]","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeDistPlot.html","id":null,"dir":"Reference","previous_headings":"","what":"Plot a simple tree — TreeDistPlot","title":"Plot a simple tree — TreeDistPlot","text":"Convenience plotting function used vignettes documentation.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeDistPlot.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Plot a simple tree — TreeDistPlot","text":"","code":"TreeDistPlot(   tr,   title = NULL,   bold = NULL,   leaveRoom = FALSE,   prune = integer(0),   graft = integer(0),   edge.color = \"black\",   edge.width = NULL,   ... )"},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeDistPlot.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Plot a simple tree — TreeDistPlot","text":"tr tree class phylo, leaves labelled integers. title main title plot. bold Integer specifying leaves print bold. leaveRoom Logical specifying whether leave space print tree distances beneath plotted tree. prune, graft Integer vectors specifying edges highlight pruned grafted. edge.color Additional parameter plot.phylo; overridden prune graft requested. edge.width, ... Additional parameters plot.phylo.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeDistPlot.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Plot a simple tree — TreeDistPlot","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeDistance.html","id":null,"dir":"Reference","previous_headings":"","what":"Information-based generalized Robinson–Foulds distances — TreeDistance","title":"Information-based generalized Robinson–Foulds distances — TreeDistance","text":"Calculate tree similarity distance measures based amount phylogenetic clustering information two trees hold common, proposed Smith (2020).","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeDistance.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Information-based generalized Robinson–Foulds distances — TreeDistance","text":"","code":"TreeDistance(tree1, tree2 = NULL)  SharedPhylogeneticInfo(   tree1,   tree2 = NULL,   normalize = FALSE,   reportMatching = FALSE,   diag = TRUE )  DifferentPhylogeneticInfo(   tree1,   tree2 = NULL,   normalize = FALSE,   reportMatching = FALSE )  PhylogeneticInfoDistance(   tree1,   tree2 = NULL,   normalize = FALSE,   reportMatching = FALSE )  ClusteringInfoDistance(   tree1,   tree2 = NULL,   normalize = FALSE,   reportMatching = FALSE )  ExpectedVariation(tree1, tree2, samples = 10000)  MutualClusteringInfo(   tree1,   tree2 = NULL,   normalize = FALSE,   reportMatching = FALSE,   diag = TRUE )  SharedPhylogeneticInfoSplits(   splits1,   splits2,   nTip = attr(splits1, \"nTip\"),   reportMatching = FALSE )  MutualClusteringInfoSplits(   splits1,   splits2,   nTip = attr(splits1, \"nTip\"),   reportMatching = FALSE )  MatchingSplitInfo(   tree1,   tree2 = NULL,   normalize = FALSE,   reportMatching = FALSE,   diag = TRUE )  MatchingSplitInfoDistance(   tree1,   tree2 = NULL,   normalize = FALSE,   reportMatching = FALSE )  MatchingSplitInfoSplits(   splits1,   splits2,   nTip = attr(splits1, \"nTip\"),   reportMatching = FALSE )"},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeDistance.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Information-based generalized Robinson–Foulds distances — TreeDistance","text":"tree1, tree2 Trees class phylo, leaves labelled identically, lists trees undergo pairwise comparison.  implemented, tree2 = NULL compute distances pair trees list tree1 using fast algorithm based Day (1985) . normalize numeric value provided, used maximum value rescale results. TRUE, results rescaled maximum value calculated specified tree sizes topology, specified \"Normalization\" section . FALSE, results rescaled. reportMatching Logical specifying whether return clade matchings attribute score. diag Logical specifying whether return similarities along diagonal, .e. tree .  Applies tree2 list identical tree1, NULL. samples Integer specifying many samplings obtain; accuracy estimate increases sqrt(samples). splits1, splits2 Logical matrices row corresponds leaf, either listed order bearing identical names (sequence), column corresponds split, leaf identified member ingroup (TRUE) outgroup (FALSE) respective split. nTip (Optional) Integer specifying number leaves split.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeDistance.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Information-based generalized Robinson–Foulds distances — TreeDistance","text":"reportMatching = FALSE, functions return numeric vector specifying requested similarities differences. reportMatching = TRUE, functions additionally return integer vector listing index split tree2 matched split tree1 optimal matching. Unmatched splits denoted NA. Use VisualizeMatching() plot optimal matching. TreeDistance() simply returns clustering information distance (alias ClusteringInfoDistance()).","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeDistance.html","id":"details","dir":"Reference","previous_headings":"","what":"Details","title":"Information-based generalized Robinson–Foulds distances — TreeDistance","text":"Generalized Robinson–Foulds distances calculate tree similarity finding optimal matching similarity split one tree pair second, considering possible ways pair splits trees (including leaving split unpaired). methods implemented use concepts entropy information (MacKay 2003)  assign similarity score pair splits. returned tree similarity measures state amount information, bits, splits two trees hold common optimally matched, following Smith (2020) . complementary tree distance measures state much information different splits two trees, optimal matching. trees contain different tips, tips present one tree removed comparison (definition, trees neither hold information common differ regarding tips).","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeDistance.html","id":"concepts-of-information","dir":"Reference","previous_headings":"","what":"Concepts of information","title":"Information-based generalized Robinson–Foulds distances — TreeDistance","text":"phylogenetic (Shannon) information content entropy split defined separate vignette. Using mutual (clustering) information (Meila 2007; Vinh et al. 2010)  two splits quantify similarity gives rise Mutual Clustering Information measure (MutualClusteringInfo(), MutualClusteringInfoSplits()); entropy distance gives Clustering Information Distance (ClusteringInfoDistance()). approach optimal many regards, implemented normalization convenience function TreeDistance(). Using amount phylogenetic information common two splits measure similarity gives rise Shared Phylogenetic Information similarity measure (SharedPhylogeneticInfo(), SharedPhylogeneticInfoSplits()). amount information distinct pair splits provides complementary Different Phylogenetic Information distance metric (DifferentPhylogeneticInfo()). Matching Split Information measure (MatchingSplitInfo(), MatchingSplitInfoSplits()) defines similarity pair splits phylogenetic information content informative split consistent input splits; MatchingSplitInfoDistance() corresponding measure tree difference. (information .)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeDistance.html","id":"conversion-to-distances","dir":"Reference","previous_headings":"","what":"Conversion to distances","title":"Information-based generalized Robinson–Foulds distances — TreeDistance","text":"convert similarity measures distances, necessary subtract similarity score maximum value.  order generate distance metrics, functions subtract similarity twice total information content (SPI, MSI) entropy (MCI) splits trees (Smith 2020) .","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeDistance.html","id":"normalization","dir":"Reference","previous_headings":"","what":"Normalization","title":"Information-based generalized Robinson–Foulds distances — TreeDistance","text":"normalize = TRUE, results rescaled distance ranges zero (principle) one. maximum distance sum information content entropy split tree; maximum similarity half value. (See Vinh et al. (2010, table 3) Smith (2020)  alternative normalization possibilities.) Note distance value one (= similarity zero) seldom achieved, even different trees exhibit similarity. may thus helpful rescale normalized value expected distance random pair trees equals one.  can calculated ExpectedVariation(); see package 'TreeDistData' compilation expected values different metrics trees 200 leaves. Alternatively, use normalize = pmax pmin scale information content entropy splits (pmax) least (pmin) informative tree pair. calculate relative similarity reference tree known \"correct\", use normalize = SplitwiseInfo(trueTree) (SPI, MSI) ClusteringEntropy(trueTree) (MCI). worked examples, see internal function NormalizeInfo(), called distance functions parameter = normalize. .","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeDistance.html","id":"distances-between-large-trees","dir":"Reference","previous_headings":"","what":"Distances between large trees","title":"Information-based generalized Robinson–Foulds distances — TreeDistance","text":"balance memory demands runtime flexibility, functions implemented trees 2048 leaves. analyse trees 8192 leaves, need modified version package: install.packages(\"BigTreeDist\", repos = \"https://ms609.github.io/packages/\") Use library(\"BigTreeDist\") instead library(\"TreeDist\") load modified package – prefix functions package name, e.g. BigTreeDist::TreeDistance(). alternative download method, uninstall TreeDist TreeTools using remove.packages(), use devtools::install_github(\"ms609/TreeTools\", ref = \"-leaves\") install modified TreeTools package; , install TreeDist using devtools::install_github(\"ms609/TreeDist\", ref = \"-leaves\"). (TreeDist need building source modified TreeTools package installed, code links values set TreeTools source code.) Trees 8192 leaves require modification source code, maintainer plans attempt future; please comment GitHub find useful.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeDistance.html","id":"references","dir":"Reference","previous_headings":"","what":"References","title":"Information-based generalized Robinson–Foulds distances — TreeDistance","text":"Day WHE (1985). “Optimal algorithms comparing trees labeled leaves.” Journal Classification, 2(1), 7–28. doi:10.1007/BF01908061 . MacKay DJC (2003). Information Theory, Inference, Learning Algorithms. Cambridge University Press, Cambridge. https://www.inference.org.uk/itprnn/book.pdf. Meila M (2007). “Comparing clusterings—information based distance.” Journal Multivariate Analysis, 98(5), 873–895. doi:10.1016/j.jmva.2006.11.013 . Smith MR (2020). “Information theoretic Generalized Robinson-Foulds metrics comparing phylogenetic trees.” Bioinformatics, 36(20), 5007–5013. doi:10.1093/bioinformatics/btaa614 . Vinh NX, Epps J, Bailey J (2010). “Information theoretic measures clusterings comparison: variants, properties, normalization correction chance.” Journal Machine Learning Research, 11, 2837–2854. doi:10.1145/1553374.1553511 .","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeDistance.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Information-based generalized Robinson–Foulds distances — TreeDistance","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeDistance.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Information-based generalized Robinson–Foulds distances — TreeDistance","text":"","code":"tree1 <- ape::read.tree(text=\"((((a, b), c), d), (e, (f, (g, h))));\") tree2 <- ape::read.tree(text=\"(((a, b), (c, d)), ((e, f), (g, h)));\") tree3 <- ape::read.tree(text=\"((((h, b), c), d), (e, (f, (g, a))));\")  # Best possible score is obtained by matching a tree with itself DifferentPhylogeneticInfo(tree1, tree1) # 0, by definition #> [1] 0 SharedPhylogeneticInfo(tree1, tree1) #> [1] 22.53747 SplitwiseInfo(tree1) # Maximum shared phylogenetic information #> [1] 22.53747  # Best possible score is a function of tree shape; the splits within # balanced trees are more independent and thus contain less information SplitwiseInfo(tree2) #> [1] 19.36755  # How similar are two trees? SharedPhylogeneticInfo(tree1, tree2) # Amount of phylogenetic information in common #> [1] 13.75284 attr(SharedPhylogeneticInfo(tree1, tree2, reportMatching = TRUE), \"matching\") #> [1] 1 4 2 3 5 VisualizeMatching(SharedPhylogeneticInfo, tree1, tree2) # Which clades are matched?   DifferentPhylogeneticInfo(tree1, tree2) # Distance measure #> [1] 14.39934 DifferentPhylogeneticInfo(tree2, tree1) # The metric is symmetric #> [1] 14.39934  # Are they more similar than two trees of this shape would be by chance? ExpectedVariation(tree1, tree2, sample=12)[\"DifferentPhylogeneticInfo\", \"Estimate\"] #> [1] 31.25202  # Every split in tree1 conflicts with every split in tree3 # Pairs of conflicting splits contain clustering, but not phylogenetic,  # information SharedPhylogeneticInfo(tree1, tree3) # = 0 #> [1] 0 MutualClusteringInfo(tree1, tree3) # > 0 #> [1] 0.6539805  # Distance functions internally convert trees to Splits objects. # Pre-conversion can reduce run time if the same trees will feature in # multiple comparisons splits1 <- TreeTools::as.Splits(tree1) splits2 <- TreeTools::as.Splits(tree2)  SharedPhylogeneticInfoSplits(splits1, splits2) #> [1] 13.75284 MatchingSplitInfoSplits(splits1, splits2) #> [1] 17.09254 MutualClusteringInfoSplits(splits1, splits2) #> [1] 3.031424"},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeInfo.html","id":null,"dir":"Reference","previous_headings":"","what":"Information content of splits within a tree — TreeInfo","title":"Information content of splits within a tree — TreeInfo","text":"Sum entropy (ClusteringEntropy()), clustering information content (ClusteringInfo()), phylogenetic information content (SplitwiseInfo()) across split within phylogenetic tree, consensus set phylogenetic trees (ConsensusInfo()). value greater total information content tree tree contains multiple splits, splits independent thus contain mutual information counted ","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeInfo.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Information content of splits within a tree — TreeInfo","text":"","code":"SplitwiseInfo(x, p = NULL, sum = TRUE)  ClusteringEntropy(x, p = NULL, sum = TRUE)  ClusteringInfo(x, p = NULL, sum = TRUE)  # S3 method for class 'phylo' ClusteringEntropy(x, p = NULL, sum = TRUE)  # S3 method for class 'list' ClusteringEntropy(x, p = NULL, sum = TRUE)  # S3 method for class 'multiPhylo' ClusteringEntropy(x, p = NULL, sum = TRUE)  # S3 method for class 'Splits' ClusteringEntropy(x, p = NULL, sum = TRUE)  # S3 method for class 'phylo' ClusteringInfo(x, p = NULL, sum = TRUE)  # S3 method for class 'list' ClusteringInfo(x, p = NULL, sum = TRUE)  # S3 method for class 'multiPhylo' ClusteringInfo(x, p = NULL, sum = TRUE)  # S3 method for class 'Splits' ClusteringInfo(x, p = NULL, sum = TRUE)  ConsensusInfo(trees, info = \"phylogenetic\", p = 0.5, check.tips = TRUE)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeInfo.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Information content of splits within a tree — TreeInfo","text":"x tree class phylo, list trees, multiPhylo object. p Scalar 0.5 1 specifying minimum proportion trees must contain split appear within consensus. sum Logical: TRUE, sum information content split provide total splitwise information content tree. trees List phylo objects, optionally class multiPhylo. info Abbreviation \"phylogenetic\" \"clustering\", specifying concept information employ. check.tips Logical specifying whether renumber leaves leaf numbering consistent trees.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeInfo.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Information content of splits within a tree — TreeInfo","text":"SplitwiseInfo(), ClusteringInfo() ClusteringEntropy() return splitwise information content tree – split turn, sum = FALSE – bits. ConsensusInfo() returns splitwise information content majority rule consensus trees.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeInfo.html","id":"clustering-information","dir":"Reference","previous_headings":"","what":"Clustering information","title":"Information content of splits within a tree — TreeInfo","text":"Clustering entropy addresses question \"much information contained splits within tree\". approach complementary phylogenetic information content, used SplitwiseInfo(). essence, asks, given split subdivides leaves tree two partitions, easy predict partition randomly drawn leaf belongs (Meila2007; Vinh et al. 2010) . Formally, entropy split S divides n leaves two partitions sizes b given H(S) = - /n log /n - b/n log b/n. Base 2 logarithms conventionally used, entropy measured bits. Entropy denotes number bits necessary encode outcome random variable: , random variable \"partition randomly selected leaf belong \". even split entropy 1 bit: better way encoding outcome using one bit specify two partitions randomly selected leaf belongs . uneven split lower entropy: membership larger partition common, thus less surprising; can signified using fewer bits optimal compression system. sounds confusing, consider creating code transmit cluster label two randomly selected leaves.  One straightforward option use 00 = \"leaves belong partition \" 11 = \"leaves belong partition B\" 01 = 'First leaf , second B` 10 = 'First leaf B, second ` code uses two bits transmit partition labels two leaves. partitions B equiprobable, optimal code; entropy – average information content required per leaf – 1 bit. Alternatively, use (suboptimal) code 0 = \"leaves belong partition \" 111 = \"leaves belong partition B\" 101 = 'First leaf , second B` 110 = 'First leaf B, second ` much larger B, pairs leaves require just single bit (code 0). additional bits 1+ leaf belongs B may required sufficiently rarely average message requires fewer two bits two leaves, entropy less 1 bit.  (optimal coding strategy depend exact sizes B.) entropy measures bits required transmit cluster label leaf (Vinh2010: p. 2840) , information content split entropy multiplied number leaves.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeInfo.html","id":"phylogenetic-information","dir":"Reference","previous_headings":"","what":"Phylogenetic information","title":"Information content of splits within a tree — TreeInfo","text":"Phylogenetic information expresses information content split terms probability uniformly selected tree contain (Thorley et al. 1998) .","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeInfo.html","id":"consensus-information","dir":"Reference","previous_headings":"","what":"Consensus information","title":"Information content of splits within a tree — TreeInfo","text":"information content splits consensus tree calculated interpreting support values (.e. proportion trees containing split consensus) probabilities true tree contains split, following Smith (2022) .","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeInfo.html","id":"references","dir":"Reference","previous_headings":"","what":"References","title":"Information content of splits within a tree — TreeInfo","text":"Smith MR (2022). “Using information theory detect rogue taxa improve consensus trees.” Systematic Biology, syab099. doi:10.1093/sysbio/syab099 . Thorley JL, Wilkinson M, Charleston M (1998). “information content consensus trees.” Rizzi , Vichi M, Bock H (eds.), Advances Data Science Classification, 91–98. Springer, Berlin. doi:10.1007/978-3-642-72253-0_12 . Vinh NX, Epps J, Bailey J (2010). “Information theoretic measures clusterings comparison: variants, properties, normalization correction chance.” Journal Machine Learning Research, 11, 2837–2854. doi:10.1145/1553374.1553511 .","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeInfo.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Information content of splits within a tree — TreeInfo","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/TreeInfo.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Information content of splits within a tree — TreeInfo","text":"","code":"library(\"TreeTools\", quietly = TRUE)  SplitwiseInfo(PectinateTree(8)) #> [1] 22.53747 tree <- read.tree(text = \"(a, b, (c, (d, e, (f, g)0.8))0.9);\") SplitwiseInfo(tree) #> [1] 10.73217 SplitwiseInfo(tree, TRUE) #> [1] 8.641244  # Clustering entropy of an even split = 1 bit ClusteringEntropy(TreeTools::as.Splits(c(rep(TRUE, 4), rep(FALSE, 4)))) #> [1] 1  # Clustering entropy of an uneven split < 1 bit ClusteringEntropy(TreeTools::as.Splits(c(rep(TRUE, 2), rep(FALSE, 6)))) #> [1] 0.8112781  tree1 <- TreeTools::BalancedTree(8) tree2 <- TreeTools::PectinateTree(8)  ClusteringInfo(tree1) #> [1] 33.9609 ClusteringEntropy(tree1) #> [1] 4.245112 ClusteringInfo(list(one = tree1, two = tree2)) #>      one      two  #> 33.96090 36.25139   ClusteringInfo(tree1) + ClusteringInfo(tree2) #> [1] 70.21229 ClusteringEntropy(tree1) + ClusteringEntropy(tree2) #> [1] 8.776537 ClusteringInfoDistance(tree1, tree2) #> [1] 2.713688 MutualClusteringInfo(tree1, tree2) #> [1] 3.031424  # Clustering entropy with uncertain splits tree <- ape::read.tree(text = \"(a, b, (c, (d, e, (f, g)0.8))0.9);\") ClusteringInfo(tree) #> [1] 18.98028 ClusteringInfo(tree, TRUE) #> [1] 17.16773  # Support-weighted information content of a consensus tree set.seed(0) trees <- list(RandomTree(8), RootTree(BalancedTree(8), 1), PectinateTree(8)) cons <- consensus(trees, p = 0.5) p <- SplitFrequency(cons, trees) / length(trees) plot(cons) LabelSplits(cons, signif(SplitwiseInfo(cons, p, sum = FALSE), 4)) ConsensusInfo(trees) #> [1] 7.080254 LabelSplits(cons, signif(ClusteringInfo(cons, p, sum = FALSE), 4))  ConsensusInfo(trees, \"clustering\") #> [1] 18.31378"},{"path":"https://ms609.github.io/TreeDist/dev/reference/VisualizeMatching.html","id":null,"dir":"Reference","previous_headings":"","what":"Visualise a matching — VisualizeMatching","title":"Visualise a matching — VisualizeMatching","text":"Depict splits matched two trees using specified Generalized Robinson–Foulds similarity measure.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/VisualizeMatching.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Visualise a matching — VisualizeMatching","text":"","code":"VisualizeMatching(   Func,   tree1,   tree2,   setPar = TRUE,   precision = 3L,   Plot = plot.phylo,   matchZeros = TRUE,   plainEdges = FALSE,   edge.width = 1,   edge.color = \"black\",   ... )"},{"path":"https://ms609.github.io/TreeDist/dev/reference/VisualizeMatching.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Visualise a matching — VisualizeMatching","text":"Func Function used construct tree similarity. tree1, tree2 Trees class phylo, identical leaf labels. setPar Logical specifying whether graphical parameters set display trees side side. precision Integer specifying number significant figures display reporting matching scores. Plot Function use plot trees. matchZeros Logical specifying whether pair splits zero similarity (TRUE), leave unpaired (FALSE). plainEdges Logical specifying whether plot edges uniform width colour (TRUE), whether draw edge widths according similarity associated splits (FALSE). edge.width, edge.color, ... Additional parameters send Plot().","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/VisualizeMatching.html","id":"details","dir":"Reference","previous_headings":"","what":"Details","title":"Visualise a matching — VisualizeMatching","text":"Note visualizing Robinson–Foulds distance (using Func = RobinsonFouldsMatching), matched splits assigned similarity score 1, deducted total number splits calculate Robinson–Foulds distance.  Unmatched splits thus contribute one total tree distance.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/VisualizeMatching.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Visualise a matching — VisualizeMatching","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/VisualizeMatching.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Visualise a matching — VisualizeMatching","text":"","code":"tree1 <- TreeTools::BalancedTree(6) tree2 <- TreeTools::PectinateTree(6)  VisualizeMatching(RobinsonFouldsMatching, tree1, tree2)  VisualizeMatching(SharedPhylogeneticInfo, tree1, tree2, matchZeros = FALSE)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/cluster-statistics.html","id":null,"dir":"Reference","previous_headings":"","what":"Cluster size statistics — cluster-statistics","title":"Cluster size statistics — cluster-statistics","text":"Cluster size statistics","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/cluster-statistics.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Cluster size statistics — cluster-statistics","text":"","code":"SumOfRanges(x, cluster = 1)  SumOfVariances(x, cluster = 1)  SumOfVars(x, cluster = 1)  MeanCentroidDistance(x, cluster = 1)  MeanCentDist(x, cluster = 1)  MeanCentroidDist(x, cluster = 1)  DistanceFromMedian(x, cluster = 1)  DistFromMed(x, cluster = 1)  MeanNN(x, cluster = 1)  MeanMSTEdge(x, cluster = 1)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/cluster-statistics.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Cluster size statistics — cluster-statistics","text":"x Matrix row lists coordinates point Euclidian space; , supported, dist object specifying distances pair points. cluster Optional integer vector specifying cluster group row x belongs.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/cluster-statistics.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Cluster size statistics — cluster-statistics","text":"SumOfRanges() returns numeric specifying sum ranges within cluster across dimensions. SumOfVariances() returns numeric specifying sum variances within cluster across dimensions. MeanCentroidDistance() returns numeric specifying mean distance centroid points cluster. DistanceFromMedian() returns numeric specifying mean distance point (except median) median point cluster. MeanNN() returns numeric specifying mean distance point within cluster nearest neighbour. MeanMSTEdge() returns numeric specifying mean length edge minimum spanning tree points within cluster.","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/reference/cluster-statistics.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Cluster size statistics — cluster-statistics","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/cluster-statistics.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Cluster size statistics — cluster-statistics","text":"","code":"points <- rbind(matrix(1:16, 4), rep(1, 4), matrix(1:32, 8, 4) / 10) cluster <- rep(1:3, c(4, 1, 8))  plot(   points[, 1:2], # Plot first two dimensions of four-dimensional space   col = cluster, pch = cluster, # Style by cluster membership   asp = 1, # Fix aspect ratio to avoid distortion   ann = FALSE, frame = FALSE # Simple axes )   SumOfRanges(points, cluster) #> [1] 12.0  0.0  2.8 SumOfVariances(points, cluster) #> [1] 6.666667       NA 0.240000 MeanCentroidDistance(points, cluster) #> [1] 2.0 0.0 0.4 DistanceFromMedian(points, cluster) #> [1] 2.6666667        NA 0.4571429 MeanNN(points, cluster) #> [1] 2.0  NA 0.2 MeanMSTEdge(points, cluster) #> [1] 2.0  NA 0.2"},{"path":"https://ms609.github.io/TreeDist/dev/reference/dot-MASTSizeEdges.html","id":null,"dir":"Reference","previous_headings":"","what":"Calculate MAST size from edge matrices. — .MASTSizeEdges","title":"Calculate MAST size from edge matrices. — .MASTSizeEdges","text":"Internal function.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/dot-MASTSizeEdges.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Calculate MAST size from edge matrices. — .MASTSizeEdges","text":"","code":".MASTSizeEdges(edge1, edge2, nTip)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/dot-MASTSizeEdges.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Calculate MAST size from edge matrices. — .MASTSizeEdges","text":"edge1 Edge matrix tree 1. Must postorder! edge2 Edge matrix tree 2. nTip Integer specifying number leaves split.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/dot-PairMean.html","id":null,"dir":"Reference","previous_headings":"","what":"Mean of two numbers — .PairMean","title":"Mean of two numbers — .PairMean","text":"Used normalization range calculation","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/dot-PairMean.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Mean of two numbers — .PairMean","text":"","code":".PairMean(x, y)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/dot-TreeDistance.html","id":null,"dir":"Reference","previous_headings":"","what":"Calculate distance between trees, or lists of trees — .TreeDistance","title":"Calculate distance between trees, or lists of trees — .TreeDistance","text":"Calculate distance trees, lists trees","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/dot-TreeDistance.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Calculate distance between trees, or lists of trees — .TreeDistance","text":"","code":".TreeDistance(Func, tree1, tree2, checks = TRUE, ...)"},{"path":"https://ms609.github.io/TreeDist/dev/reference/dot-TreeDistance.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Calculate distance between trees, or lists of trees — .TreeDistance","text":"checks Logical specifying whether perform basic sanity checks avoid crashes C++.","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/reference/dot-TreeDistance.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Calculate distance between trees, or lists of trees — .TreeDistance","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/median.multiPhylo.html","id":null,"dir":"Reference","previous_headings":"","what":"Median of a set of trees — median.multiPhylo","title":"Median of a set of trees — median.multiPhylo","text":"Calculate single binary tree represents geometric median – \"average\" – forest tree topologies.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/median.multiPhylo.html","id":"ref-usage","dir":"Reference","previous_headings":"","what":"Usage","title":"Median of a set of trees — median.multiPhylo","text":"","code":"# S3 method for class 'multiPhylo' median(   x,   na.rm = FALSE,   Distance = ClusteringInfoDistance,   index = FALSE,   breakTies = TRUE,   ... )"},{"path":"https://ms609.github.io/TreeDist/dev/reference/median.multiPhylo.html","id":"arguments","dir":"Reference","previous_headings":"","what":"Arguments","title":"Median of a set of trees — median.multiPhylo","text":"x Object class multiPhylo containing phylogenetic trees. na.rm, ... Unused; included consistency default function.. Distance Function calculate distances pair trees x. index Logical: TRUE, return index median tree(s); FALSE, return tree . breakTies Logical: TRUE, return single tree minimum score; FALSE, return tied trees.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/median.multiPhylo.html","id":"value","dir":"Reference","previous_headings":"","what":"Value","title":"Median of a set of trees — median.multiPhylo","text":"median() returns object class phylo corresponding geometric median set trees: , tree whose average distance trees set lowest. multiple trees tie average distance, first returned, unless breakTies = FALSE, case object class multiPhylo containing trees returned.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/median.multiPhylo.html","id":"details","dir":"Reference","previous_headings":"","what":"Details","title":"Median of a set of trees — median.multiPhylo","text":"geometric median tree exhibits shortest average distance tree topology set. represents \"average\" set trees, though note unsampled tree may closer geometric \"centre gravity\" input set – tree considered. result depend metric chosen calculate distances tree topologies. absence natural metric tree topologies, default choice ClusteringInfoDistance() – discards branch length information. specifying different function, sure returns difference, rather similarity.","code":""},{"path":[]},{"path":"https://ms609.github.io/TreeDist/dev/reference/median.multiPhylo.html","id":"author","dir":"Reference","previous_headings":"","what":"Author","title":"Median of a set of trees — median.multiPhylo","text":"Martin R. Smith (martin.smith@durham.ac.uk)","code":""},{"path":"https://ms609.github.io/TreeDist/dev/reference/median.multiPhylo.html","id":"ref-examples","dir":"Reference","previous_headings":"","what":"Examples","title":"Median of a set of trees — median.multiPhylo","text":"","code":"library(\"TreeTools\", quietly = TRUE) tenTrees <- as.phylo(1:10, nTip = 8)  # Default settings: median(tenTrees) #>  #> Phylogenetic tree with 8 tips and 7 internal nodes. #>  #> Tip labels: #>   t1, t2, t3, t4, t5, t6, ... #>  #> Rooted; no branch lengths.  # Robinson-Foulds distances include ties: median(tenTrees, Distance = RobinsonFoulds, breakTies = FALSE) #> 4 phylogenetic trees  # Be sure to use a distance function, rather than a similarity: NyeDistance <- function(...) NyeSimilarity(..., similarity = FALSE) median(tenTrees, Distance = NyeDistance) #>  #> Phylogenetic tree with 8 tips and 7 internal nodes. #>  #> Tip labels: #>   t1, t2, t3, t4, t5, t6, ... #>  #> Rooted; no branch lengths.  # To analyse a list of trees that is not of class multiPhylo: treeList <- lapply(1:10, as.phylo, nTip = 8) class(treeList) #> [1] \"list\" median(structure(treeList, class = \"multiPhylo\")) #>  #> Phylogenetic tree with 8 tips and 7 internal nodes. #>  #> Tip labels: #>   t1, t2, t3, t4, t5, t6, ... #>  #> Rooted; no branch lengths."},{"path":"https://ms609.github.io/TreeDist/dev/news/index.html","id":"treedist-2809000-development","dir":"Changelog","previous_headings":"","what":"TreeDist 2.8.0.9000 (development)","title":"TreeDist 2.8.0.9000 (development)","text":"SpectralEigens() returns correct eigenvalues (smallest overlooked) SpectralEigens() handles values nEig larger input","code":""},{"path":"https://ms609.github.io/TreeDist/dev/news/index.html","id":"treedist-280-2024-07-25","dir":"Changelog","previous_headings":"","what":"TreeDist 2.8.0 (2024-07-25)","title":"TreeDist 2.8.0 (2024-07-25)","text":"CRAN release: 2024-07-26 Islands() allows identification islands trees. Internal implementation path SPR distances, removing dependency phangorn (thus R 4.4). Add progress bar within .MaxValue()","code":""},{"path":"https://ms609.github.io/TreeDist/dev/news/index.html","id":"treedist-271-2024-06-13","dir":"Changelog","previous_headings":"","what":"TreeDist 2.7.1 (2024-06-13)","title":"TreeDist 2.7.1 (2024-06-13)","text":"Documentation improvements. Fix KCDiameter.multiPhylo() multiple trees.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/news/index.html","id":"treedist-270-2023-10-25","dir":"Changelog","previous_headings":"","what":"TreeDist 2.7.0 (2023-10-25)","title":"TreeDist 2.7.0 (2023-10-25)","text":"CRAN release: 2023-10-25 Fix calculation error StrainCol(). App: Display strain 3D tree space viewer. Support distances larger trees. Support unrooted trees VisualizeMatching() (#103).","code":""},{"path":"https://ms609.github.io/TreeDist/dev/news/index.html","id":"treedist-263-2023-08-25","dir":"Changelog","previous_headings":"","what":"TreeDist 2.6.3 (2023-08-25)","title":"TreeDist 2.6.3 (2023-08-25)","text":"CRAN release: 2023-08-25 Fix bug comparing “multiPhylo” object containing single tree. Documentation clarification: finding non-matching leaves.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/news/index.html","id":"treedist-262-2023-06-28","dir":"Changelog","previous_headings":"","what":"TreeDist 2.6.2 (2023-06-28)","title":"TreeDist 2.6.2 (2023-06-28)","text":"CRAN release: 2023-06-29 Support non-square matrices LAPJV().","code":""},{"path":"https://ms609.github.io/TreeDist/dev/news/index.html","id":"treedist-261-2023-04-25","dir":"Changelog","previous_headings":"","what":"TreeDist 2.6.1 (2023-04-25)","title":"TreeDist 2.6.1 (2023-04-25)","text":"CRAN release: 2023-05-01 StopParallel() gains quietly argument suppress unnecessary messages. Use “PlotTools” package spectrum legends. Minor documentation tweaks.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/news/index.html","id":"treedist-260-2023-02-20","dir":"Changelog","previous_headings":"","what":"TreeDist 2.6.0 (2023-02-20)","title":"TreeDist 2.6.0 (2023-02-20)","text":"CRAN release: 2023-02-20 Support comparison trees different tips. Fix caching errors MapDist() (#98). Update tests compatibility ape 5.7.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/news/index.html","id":"treedist-250-2022-10-07","dir":"Changelog","previous_headings":"","what":"TreeDist 2.5.0 (2022-10-07)","title":"TreeDist 2.5.0 (2022-10-07)","text":"CRAN release: 2022-10-07 New functions measure cluster sizes (see ?\"cluster-statistics\"). KMeansPP() conducts clustering using K-means++, replacing K-means app. New vignette tree landscape analysis.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/news/index.html","id":"treedist-241-2022-07-20","dir":"Changelog","previous_headings":"","what":"TreeDist 2.4.1 (2022-07-20)","title":"TreeDist 2.4.1 (2022-07-20)","text":"CRAN release: 2022-07-20 New vignette compare tree sets. PathVector() now treats trees root node rooted. Fix plot layout treespace vignette. Informative failure enough memory consensus_info(). Replace throw stop C++.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/news/index.html","id":"treedist-240-2022-03-23","dir":"Changelog","previous_headings":"","what":"TreeDist 2.4.0 (2022-03-23)","title":"TreeDist 2.4.0 (2022-03-23)","text":"CRAN release: 2022-03-23 Correct calculation trustworthiness continuity metrics. Depict strain minimum spanning trees StrainCol() helper function MSTSegments(). Update tests consistency “TreeTools” v1.7. Use lighter Rcpp headers.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/news/index.html","id":"treedist-230-2022-01-04","dir":"Changelog","previous_headings":"","what":"TreeDist 2.3.0 (2022-01-04)","title":"TreeDist 2.3.0 (2022-01-04)","text":"CRAN release: 2022-01-03 Support ConsensusInfo(p > 0.5). Address hypervolume comparison vignettes. Support uniform manifold approximation projection app.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/news/index.html","id":"treedist-220-2021-09-13","dir":"Changelog","previous_headings":"","what":"TreeDist 2.2.0 (2021-09-13)","title":"TreeDist 2.2.0 (2021-09-13)","text":"CRAN release: 2021-09-13 Speed improvements, using optimizations suggested Alexis Stamatakis’ Bioinformatics group. Support parallel computation via StartParallel(). Progress bars.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/news/index.html","id":"treedist-211-2021-07-13","dir":"Changelog","previous_headings":"","what":"TreeDist 2.1.1 (2021-07-13)","title":"TreeDist 2.1.1 (2021-07-13)","text":"CRAN release: 2021-07-13 Solaris compatibility. Modest vignette improvements. spic/scic abbreviation recognition.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/news/index.html","id":"treedist-210-2021-07-12","dir":"Changelog","previous_headings":"","what":"TreeDist 2.1.0 (2021-07-12)","title":"TreeDist 2.1.0 (2021-07-12)","text":"CRAN release: 2021-07-12","code":""},{"path":"https://ms609.github.io/TreeDist/dev/news/index.html","id":"new-features-2-1-0","dir":"Changelog","previous_headings":"","what":"New features","title":"TreeDist 2.1.0 (2021-07-12)","text":"ConsensusInfo() quickly calculates splitwise information content consensus set trees, Smith (forthcoming). SplitwiseInfo() ClusteringInfo() gain p parameter reflect reduced information content splits lower support values, sum parameter allow return individual split information content. KCDiameter() approximates diameter Kendall-Colijn metric. Plot3() (experimental) provides pseudo-3D plotting.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/news/index.html","id":"renamed-functions-2-1-0","dir":"Changelog","previous_headings":"","what":"Renamed functions","title":"TreeDist 2.1.0 (2021-07-12)","text":"Project()/ProjectionQuality() re-named MapTrees()/MappingQuality(). SpectralClustering() re-named SpectralEigens().","code":""},{"path":"https://ms609.github.io/TreeDist/dev/news/index.html","id":"improvements-2-1-0","dir":"Changelog","previous_headings":"","what":"Improvements","title":"TreeDist 2.1.0 (2021-07-12)","text":"Add self-organizing map example treespace vignette. Allow specification custom vectors Kendall–Colijn metric. Faster --tree distance calculation.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/news/index.html","id":"treedist-203-2021-01-31","dir":"Changelog","previous_headings":"","what":"TreeDist 2.0.3 (2021-01-31)","title":"TreeDist 2.0.3 (2021-01-31)","text":"CRAN release: 2021-01-31 Diagnose fix memory leaks, including -long reported matchings. Explicitly import shiny/shinyjs functions.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/news/index.html","id":"treedist-200-2021-01-20","dir":"Changelog","previous_headings":"","what":"TreeDist 2.0.0 (2021-01-20)","title":"TreeDist 2.0.0 (2021-01-20)","text":"CRAN release: 2021-01-20 Project() launches ‘shiny’ app projection analysis tree space. ProjectionQuality() calculates trustworthiness continuity tree space mappings. Faster calculation Robinson–Foulds distance (using algorithm Day (1985)) clustering information distance. New class ClusterTable allow faster distance computation Day (1985) algorithm. Improve error messages CalculateTreeDist(). Improvements vignettes. Use package ‘vdiffr’ conditionally.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/news/index.html","id":"treedist-121-2020-09-17","dir":"Changelog","previous_headings":"","what":"TreeDist 1.2.1 (2020-09-17)","title":"TreeDist 1.2.1 (2020-09-17)","text":"CRAN release: 2020-09-17 Import RdMacros package ‘RdPack’.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/news/index.html","id":"treedist-120-2020-08-28","dir":"Changelog","previous_headings":"","what":"TreeDist 1.2.0 (2020-08-28)","title":"TreeDist 1.2.0 (2020-08-28)","text":"CRAN release: 2020-08-28 TreeDistance() related functions now return dist object computing distances pairs trees list. Improve floating-point arithmetic TreeDistance() functions. TreeDistance() now returns distance (documented), rather similarity. Fix rounding error NNI ‘Li’ upper estimate, improve NNI performance. Reduce precision LAPJV rounding errors result interminable run times.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/news/index.html","id":"treedist-111-2020-07-10","dir":"Changelog","previous_headings":"","what":"TreeDist 1.1.1 (2020-07-10)","title":"TreeDist 1.1.1 (2020-07-10)","text":"CRAN release: 2020-07-10 Fix range errors calculating tree distances.","code":""},{"path":"https://ms609.github.io/TreeDist/dev/news/index.html","id":"treedist-110","dir":"Changelog","previous_headings":"","what":"TreeDist 1.1.0","title":"TreeDist 1.1.0","text":"Improvements NNIDist() light Fack et al. (2002). Add NNIDiameter(): approximate diameter NNI distance. Remove vignette ‘Interpreting tree distances’: duplicates https://ms609.github.io/TreeDistData/articles/09-expected-similarity.html. Remove redundant data object oneOverlap. Fix issue installing R 3.x (require C++11 ensure declaration UINT_FAST16_MAX). Fix memory-handling bug lapjv().","code":""},{"path":"https://ms609.github.io/TreeDist/dev/news/index.html","id":"treedist-100-2020-06-30","dir":"Changelog","previous_headings":"","what":"TreeDist 1.0.0 (2020-06-30)","title":"TreeDist 1.0.0 (2020-06-30)","text":"CRAN release: 2020-06-30 Initial release, building draft functions included ‘TreeSearch’ 0.3.2.9005.","code":""}]
diff --git a/dev/sitemap.xml b/dev/sitemap.xml
index 666dab49e..730b6dc93 100644
--- a/dev/sitemap.xml
+++ b/dev/sitemap.xml
@@ -1,165 +1,59 @@
-
-
-  
-    https://ms609.github.io/TreeDist/CODE_OF_CONDUCT.html
-  
-  
-    https://ms609.github.io/TreeDist/CONTRIBUTING.html
-  
-  
-    https://ms609.github.io/TreeDist/articles/Generalized-RF.html
-  
-  
-    https://ms609.github.io/TreeDist/articles/Robinson-Foulds.html
-  
-  
-    https://ms609.github.io/TreeDist/articles/Using-TreeDist.html
-  
-  
-    https://ms609.github.io/TreeDist/articles/compare-treesets.html
-  
-  
-    https://ms609.github.io/TreeDist/articles/different-leaves.html
-  
-  
-    https://ms609.github.io/TreeDist/articles/index.html
-  
-  
-    https://ms609.github.io/TreeDist/articles/information.html
-  
-  
-    https://ms609.github.io/TreeDist/articles/landscapes.html
-  
-  
-    https://ms609.github.io/TreeDist/articles/treespace.html
-  
-  
-    https://ms609.github.io/TreeDist/articles/using-distances.html
-  
-  
-    https://ms609.github.io/TreeDist/authors.html
-  
-  
-    https://ms609.github.io/TreeDist/index.html
-  
-  
-    https://ms609.github.io/TreeDist/news/index.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/AllSplitPairings.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/CalculateTreeDistance.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/CompareAll.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/Entropy.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/GeneralizedRF.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/JaccardRobinsonFoulds.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/KMeansPP.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/KendallColijn.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/LAPJV.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/MASTSize.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/MSTSegments.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/MapTrees.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/MappingQuality.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/MatchingSplitDistance.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/MeilaVariationOfInformation.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/NNIDist.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/NormalizeInfo.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/NyeSimilarity.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/PathDist.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/Plot3.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/ReportMatching.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/Robinson-Foulds.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/SPRDist.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/SpectralEigens.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/SplitEntropy.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/SplitSharedInformation.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/SplitsCompatible.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/StartParallel.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/TreeDist-package.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/TreeDistPlot.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/TreeDistance.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/TreeInfo.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/VisualizeMatching.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/cluster-statistics.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/dot-MASTSizeEdges.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/dot-PairMean.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/dot-TreeDistance.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/index.html
-  
-  
-    https://ms609.github.io/TreeDist/reference/median.multiPhylo.html
-  
+
+https://ms609.github.io/TreeDist/dev/CODE_OF_CONDUCT.html
+https://ms609.github.io/TreeDist/dev/CONTRIBUTING.html
+https://ms609.github.io/TreeDist/dev/articles/Generalized-RF.html
+https://ms609.github.io/TreeDist/dev/articles/Robinson-Foulds.html
+https://ms609.github.io/TreeDist/dev/articles/Using-TreeDist.html
+https://ms609.github.io/TreeDist/dev/articles/compare-treesets.html
+https://ms609.github.io/TreeDist/dev/articles/different-leaves.html
+https://ms609.github.io/TreeDist/dev/articles/index.html
+https://ms609.github.io/TreeDist/dev/articles/information.html
+https://ms609.github.io/TreeDist/dev/articles/landscapes.html
+https://ms609.github.io/TreeDist/dev/articles/treespace.html
+https://ms609.github.io/TreeDist/dev/articles/using-distances.html
+https://ms609.github.io/TreeDist/dev/authors.html
+https://ms609.github.io/TreeDist/dev/index.html
+https://ms609.github.io/TreeDist/dev/news/index.html
+https://ms609.github.io/TreeDist/dev/reference/AllSplitPairings.html
+https://ms609.github.io/TreeDist/dev/reference/CalculateTreeDistance.html
+https://ms609.github.io/TreeDist/dev/reference/CompareAll.html
+https://ms609.github.io/TreeDist/dev/reference/Entropy.html
+https://ms609.github.io/TreeDist/dev/reference/GeneralizedRF.html
+https://ms609.github.io/TreeDist/dev/reference/Islands.html
+https://ms609.github.io/TreeDist/dev/reference/JaccardRobinsonFoulds.html
+https://ms609.github.io/TreeDist/dev/reference/KMeansPP.html
+https://ms609.github.io/TreeDist/dev/reference/KendallColijn.html
+https://ms609.github.io/TreeDist/dev/reference/LAPJV.html
+https://ms609.github.io/TreeDist/dev/reference/MASTSize.html
+https://ms609.github.io/TreeDist/dev/reference/MSTSegments.html
+https://ms609.github.io/TreeDist/dev/reference/MapTrees.html
+https://ms609.github.io/TreeDist/dev/reference/MappingQuality.html
+https://ms609.github.io/TreeDist/dev/reference/MatchingSplitDistance.html
+https://ms609.github.io/TreeDist/dev/reference/MeilaVariationOfInformation.html
+https://ms609.github.io/TreeDist/dev/reference/NNIDist.html
+https://ms609.github.io/TreeDist/dev/reference/NormalizeInfo.html
+https://ms609.github.io/TreeDist/dev/reference/NyeSimilarity.html
+https://ms609.github.io/TreeDist/dev/reference/PathDist.html
+https://ms609.github.io/TreeDist/dev/reference/Plot3.html
+https://ms609.github.io/TreeDist/dev/reference/ReduceTrees.html
+https://ms609.github.io/TreeDist/dev/reference/ReportMatching.html
+https://ms609.github.io/TreeDist/dev/reference/Robinson-Foulds.html
+https://ms609.github.io/TreeDist/dev/reference/SPRDist.html
+https://ms609.github.io/TreeDist/dev/reference/SpectralEigens.html
+https://ms609.github.io/TreeDist/dev/reference/SplitEntropy.html
+https://ms609.github.io/TreeDist/dev/reference/SplitSharedInformation.html
+https://ms609.github.io/TreeDist/dev/reference/SplitsCompatible.html
+https://ms609.github.io/TreeDist/dev/reference/StartParallel.html
+https://ms609.github.io/TreeDist/dev/reference/TreeDist-package.html
+https://ms609.github.io/TreeDist/dev/reference/TreeDistPlot.html
+https://ms609.github.io/TreeDist/dev/reference/TreeDistance.html
+https://ms609.github.io/TreeDist/dev/reference/TreeInfo.html
+https://ms609.github.io/TreeDist/dev/reference/VisualizeMatching.html
+https://ms609.github.io/TreeDist/dev/reference/cluster-statistics.html
+https://ms609.github.io/TreeDist/dev/reference/dot-MASTSizeEdges.html
+https://ms609.github.io/TreeDist/dev/reference/dot-PairMean.html
+https://ms609.github.io/TreeDist/dev/reference/dot-TreeDistance.html
+https://ms609.github.io/TreeDist/dev/reference/index.html
+https://ms609.github.io/TreeDist/dev/reference/median.multiPhylo.html
 
+