diff --git a/.github/workflows/api-webpage-sitemap.yml b/.github/workflows/api-webpage-sitemap.yml index c583c817..62310272 100644 --- a/.github/workflows/api-webpage-sitemap.yml +++ b/.github/workflows/api-webpage-sitemap.yml @@ -26,7 +26,7 @@ jobs: echo "url-count = ${{ steps.sitemap.outputs.url-count }}" echo "excluded-count = ${{ steps.sitemap.outputs.excluded-count }}" - name: Create Pull Request - uses: peter-evans/create-pull-request@v3.3.0 + uses: peter-evans/create-pull-request@v3.4.0 with: title: "Automated sitemap update" body: > diff --git a/CHANGELOG.md b/CHANGELOG.md index c0e57aca..9134d852 100644 --- a/CHANGELOG.md +++ b/CHANGELOG.md @@ -4,10 +4,11 @@ All notable changes to this project will be documented in this file. The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/), and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html). -## [Unreleased] - 2020-09-15 +## [Unreleased] - 2020-09-18 ### Added ### Changed +* Modernized API documentation website (https://jpt.cicirello.org/) to html5 with search and no frames. ### Deprecated diff --git a/build/build.xml b/build/build.xml index 8113c8ef..3a5ef1b9 100644 --- a/build/build.xml +++ b/build/build.xml @@ -4,6 +4,7 @@ + @@ -30,13 +31,16 @@ - + + - + - + - + + additionalparam="-notimestamp --no-module-directories" + source="${JDKVERSION}"> https://www.cicirello.org/]]> diff --git a/dist/jpt-2.0.1.jar b/dist/jpt-2.0.1.jar index c835b568..cbb9723d 100644 Binary files a/dist/jpt-2.0.1.jar and b/dist/jpt-2.0.1.jar differ diff --git a/docs/api/allclasses-frame.html b/docs/api/allclasses-frame.html deleted file mode 100644 index 58d67810..00000000 --- a/docs/api/allclasses-frame.html +++ /dev/null @@ -1,61 +0,0 @@ - - - - - -All Classes (JavaPermutationTools - A Java API for computation on permutations) - - - - -

All Classes

-
- -
- - diff --git a/docs/api/allclasses-index.html b/docs/api/allclasses-index.html new file mode 100644 index 00000000..b8f1c382 --- /dev/null +++ b/docs/api/allclasses-index.html @@ -0,0 +1,441 @@ + + + + + +All Classes (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + + + + + + + +
+ +
+
+
+

All Classes

+
+
+
    +
  • + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    All Classes Interface Summary Class Summary 
    ClassDescription
    AcyclicEdgeDistance +
    Acyclic Edge Distance:
    +
    BlockInterchangeDistance +
    Block Interchange Distance:
    +
    Copyable<T extends Copyable<T>> +
    A simple interface for objects that can be copied.
    +
    CyclicEdgeDistance +
    Cyclic Edge Distance:
    +
    CyclicIndependentDistance +
    This class implements the concept of a cyclic independent distance measure.
    +
    CyclicIndependentDistanceDouble +
    This class implements the concept of a cyclic independent distance measure.
    +
    CyclicReversalIndependentDistance +
    This class implements the combination of cyclic independence and reversal independence.
    +
    CyclicReversalIndependentDistanceDouble +
    This class implements the combination of cyclic independence and reversal independence.
    +
    CyclicRTypeDistance +
    Cyclic RType Distance:
    +
    DeviationDistance +
    Deviation Distance:
    +
    DeviationDistanceNormalized +
    Normalized Deviation Distance:
    +
    DeviationDistanceNormalized2005 +
    Normalized Deviation Distance:
    +
    EditDistance +
    Edit Distance:
    +
    EditDistance +
    EditDistance is an implementation of Wagner and Fischer's dynamic programming algorithm for computing string edit distance.
    +
    ExactMatchDistance +
    Exact Match Distance:
    +
    ExactMatchDistance +
    ExactMatch distance (or Hamming Distance) of a pair of non-binary strings (or more generally sequences) is the number of + sequence (or string) positions where the two sequences differ.
    +
    InterchangeDistance +
    Interchange Distance:
    +
    JacobiDiagonalization +
    This class uses Jacobi iteration to compute the eigenvalues and eigenvectors of a symmetric matrix, provided as a 2-D Java array.
    +
    KendallTauDistance +
    Kendall Tau Distance:
    +
    KendallTauSequenceDistance +
    Kendall Tau Sequence Distance is + the minimum number of adjacent swaps necessary to transform one sequence into the other.
    +
    LeeDistance +
    Lee Distance:
    +
    LongestCommonSubsequenceDistance +
    LongestCommonSubsequenceDistance is a form of EditDistance, where the edit operations are limited to + deletions and insertions (i.e., no replacements or changes), and where the cost of an edit operation is simply 1.
    +
    MathFunctions +
    MathFunctions is a class of utility methods that implement various mathematical functions.
    +
    MatrixOps +
    Utility class of basic linear algebra matrix operations, where matrices are + represented as 2-D Java arrays.
    +
    NormalizedPermutationDistanceMeasurer +
    Implement this interface to define a distance metric for permutations that supports + normalizing the distance to the interval [0,1], but where the base distance is an integer value.
    +
    NormalizedPermutationDistanceMeasurerDouble +
    Implement this interface to define a distance metric for permutations that supports + normalizing the distance to the interval [0,1].
    +
    Permutation +
    Representation of a permutation of the integers from 0 to N-1, inclusive.
    +
    Permutation.Mechanic +
    The Permutation.Mechanic class provides a means of adding application-specific + operations on Permutations without the need to directly alter the Permutation + class.
    +
    PermutationDistanceMeasurer +
    Implement this interface, PermutationDistanceMeasurer, to define a distance metric for permutations.
    +
    PermutationDistanceMeasurerDouble +
    Implement this interface, PermutationDistanceMeasurerDouble, to define a distance metric for permutations, + where the distance is a floating-point value.
    +
    PermutationIterator +
    Iterator over all permutations of a specified length, n, of the integers in the interval [0,n).
    +
    RandomIndexer +
    RandomIndexer is a class of utility methods related to + efficiently generating random indexes, and combination of indexes, into arrays.
    +
    RandomVariates +
    This utility class provides methods for generating random variates from + different distributions.
    +
    ReinsertionDistance +
    Reinsertion Distance:
    +
    ReversalDistance +
    Reversal Distance:
    +
    ReversalIndependentDistance +
    This class implements the concept of a reversal independent distance measure.
    +
    ReversalIndependentDistanceDouble +
    This class implements the concept of a reversal independent distance measure.
    +
    RTypeDistance +
    RType Distance:
    +
    ScrambleDistance +
    Scramble Distance:
    +
    SequenceDistanceMeasurer +
    Implement this interface, SequenceDistanceMeasurer, to define a distance metric for sequences.
    +
    SequenceDistanceMeasurerDouble +
    Implement this interface, SequenceDistanceMeasurerDouble, to define a distance metric for sequences.
    +
    SequenceSampler +
    ArraySampler is a class of utility methods related to + efficiently generating random samples of array elements, without replacement.
    +
    SquaredDeviationDistance +
    Squared Deviation Distance:
    +
    Statistics +
    Utility class of basic statistics.
    +
    +
    • +
+
+
+ + + diff --git a/docs/api/allclasses-noframe.html b/docs/api/allclasses.html similarity index 91% rename from docs/api/allclasses-noframe.html rename to docs/api/allclasses.html index 71ef7da0..94410677 100644 --- a/docs/api/allclasses-noframe.html +++ b/docs/api/allclasses.html @@ -1,15 +1,25 @@ - + All Classes (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + +

All Classes

-
+
-
+ diff --git a/docs/api/allpackages-index.html b/docs/api/allpackages-index.html new file mode 100644 index 00000000..aabd81cf --- /dev/null +++ b/docs/api/allpackages-index.html @@ -0,0 +1,215 @@ + + + + + +All Packages (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + + + + + + + +
+ +
+
+
+

All Packages

+
+
+ +
+
+ + + diff --git a/docs/api/constant-values.html b/docs/api/constant-values.html index 87ed8f32..b69229d1 100644 --- a/docs/api/constant-values.html +++ b/docs/api/constant-values.html @@ -1,11 +1,21 @@ - + Constant Field Values (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "./"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
+ +
+

Constant Field Values

+

Contents

+
-
+
+

org.cicirello.*

+
+
+ diff --git a/docs/api/deprecated-list.html b/docs/api/deprecated-list.html index ea218cd2..d6883d29 100644 --- a/docs/api/deprecated-list.html +++ b/docs/api/deprecated-list.html @@ -1,11 +1,21 @@ - + Deprecated List (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "./"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
+ +
+

Deprecated API

Contents

+
+ diff --git a/docs/api/package-list b/docs/api/element-list similarity index 100% rename from docs/api/package-list rename to docs/api/element-list diff --git a/docs/api/help-doc.html b/docs/api/help-doc.html index 6fa855be..c91a6dd4 100644 --- a/docs/api/help-doc.html +++ b/docs/api/help-doc.html @@ -1,11 +1,21 @@ - + API Help (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "./"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
+ +
+

How This API Document Is Organized

This API (Application Programming Interface) document has pages corresponding to the items in the navigation bar, described as follows.
@@ -74,114 +99,142 @@

How This API Document Is Organized

  • +

    Overview

    -

    The Overview page is the front page of this API document and provides a list of all packages with a summary for each. This page can also contain an overall description of the set of packages.

    +

    The Overview page is the front page of this API document and provides a list of all packages with a summary for each. This page can also contain an overall description of the set of packages.

    +
  • +

    Package

    -

    Each package has a page that contains a list of its classes and interfaces, with a summary for each. This page can contain six categories:

    +

    Each package has a page that contains a list of its classes and interfaces, with a summary for each. These pages may contain six categories:

      -
    • Interfaces (italic)
      • +
    • Interfaces
    • Classes
    • Enums
    • Exceptions
    • Errors
    • Annotation Types
    +
  • -

    Class/Interface

    +
    +

    Class or Interface

    Each class, interface, nested class and nested interface has its own separate page. Each of these pages has three sections consisting of a class/interface description, summary tables, and detailed member descriptions:

      -
    • Class inheritance diagram
      • +
    • Class Inheritance Diagram
    • Direct Subclasses
    • All Known Subinterfaces
    • All Known Implementing Classes
      • -
    • Class/interface declaration
      • -
    • Class/interface description
      • +
    • Class or Interface Declaration
      • +
    • Class or Interface Description
    +
    • Nested Class Summary
    • Field Summary
      • +
    • Property Summary
    • Constructor Summary
    • Method Summary
    +
    • Field Detail
      • +
    • Property Detail
    • Constructor Detail
    • Method Detail

    Each summary entry contains the first sentence from the detailed description for that item. The summary entries are alphabetical, while the detailed descriptions are in the order they appear in the source code. This preserves the logical groupings established by the programmer.

    +
  • +

    Annotation Type

    Each annotation type has its own separate page with the following sections:

      -
    • Annotation Type declaration
      • -
    • Annotation Type description
      • +
    • Annotation Type Declaration
      • +
    • Annotation Type Description
    • Required Element Summary
    • Optional Element Summary
    • Element Detail
    +
  • +

    Enum

    Each enum has its own separate page with the following sections:

      -
    • Enum declaration
      • -
    • Enum description
      • +
    • Enum Declaration
      • +
    • Enum Description
    • Enum Constant Summary
    • Enum Constant Detail
    +
  • +

    Tree (Class Hierarchy)

    -

    There is a Class Hierarchy page for all packages, plus a hierarchy for each package. Each hierarchy page contains a list of classes and a list of interfaces. The classes are organized by inheritance structure starting with java.lang.Object. The interfaces do not inherit from java.lang.Object.

    +

    There is a Class Hierarchy page for all packages, plus a hierarchy for each package. Each hierarchy page contains a list of classes and a list of interfaces. Classes are organized by inheritance structure starting with java.lang.Object. Interfaces do not inherit from java.lang.Object.

    • When viewing the Overview page, clicking on "Tree" displays the hierarchy for all packages.
      • -
    • When viewing a particular package, class or interface page, clicking "Tree" displays the hierarchy for only that package.
      • +
    • When viewing a particular package, class or interface page, clicking on "Tree" displays the hierarchy for only that package.
    +
  • +

    Deprecated API

    The Deprecated API page lists all of the API that have been deprecated. A deprecated API is not recommended for use, generally due to improvements, and a replacement API is usually given. Deprecated APIs may be removed in future implementations.

    +
  • +

    Index

    -

    The Index contains an alphabetic list of all classes, interfaces, constructors, methods, and fields.

    +

    The Index contains an alphabetic index of all classes, interfaces, constructors, methods, and fields, as well as lists of all packages and all classes.

    +
  • -

    Prev/Next

    -

    These links take you to the next or previous class, interface, package, or related page.

    -
    • -
  • -

    Frames/No Frames

    -

    These links show and hide the HTML frames. All pages are available with or without frames.

    -
    • -
  • -

    All Classes

    -

    The All Classes link shows all classes and interfaces except non-static nested types.

    +
    +

    All Classes

    +

    The All Classes link shows all classes and interfaces except non-static nested types.

    +
  • +

    Serialized Form

    Each serializable or externalizable class has a description of its serialization fields and methods. This information is of interest to re-implementors, not to developers using the API. While there is no link in the navigation bar, you can get to this information by going to any serialized class and clicking "Serialized Form" in the "See also" section of the class description.

    +
  • +

    Constant Field Values

    The Constant Field Values page lists the static final fields and their values.

    +
    +
    • +
  • +
    +

    Search

    +

    You can search for definitions of modules, packages, types, fields, methods and other terms defined in the API, using some or all of the name. "Camel-case" abbreviations are supported: for example, "InpStr" will find "InputStream" and "InputStreamReader".

    +
-This help file applies to API documentation generated using the standard doclet.
+
+This help file applies to API documentation generated by the standard doclet.
+
+ diff --git a/docs/api/index-all.html b/docs/api/index-all.html index f64fff41..df558a29 100644 --- a/docs/api/index-all.html +++ b/docs/api/index-all.html @@ -1,11 +1,21 @@ - + Index (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "./"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
+ +
+
+
A B C D E G H I J K L M N O P R S T V 
All Classes All Packages

A

@@ -76,57 +101,57 @@

A

Acyclic Edge Distance:
-
AcyclicEdgeDistance() - Constructor for class org.cicirello.permutations.distance.AcyclicEdgeDistance
+
AcyclicEdgeDistance() - Constructor for class org.cicirello.permutations.distance.AcyclicEdgeDistance
Constructs the distance measurer as specified in the class documentation.
-
arrayMask(int) - Static method in class org.cicirello.math.rand.RandomIndexer
+
arrayMask(int) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates an "array mask" of a specified length, where an "array mask" is an array of boolean values of the same length as another array.
-
arrayMask(int, SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
+
arrayMask(int, double) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates an "array mask" of a specified length, where an "array mask" is an array of boolean values of the same length as another array.
-
arrayMask(int, Random) - Static method in class org.cicirello.math.rand.RandomIndexer
+
arrayMask(int, double, Random) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates an "array mask" of a specified length, where an "array mask" is an array of boolean values of the same length as another array.
-
arrayMask(int, int) - Static method in class org.cicirello.math.rand.RandomIndexer
+
arrayMask(int, double, SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
-
Generates an "array mask" of a specified length and specified number of true values, +
Generates an "array mask" of a specified length, where an "array mask" is an array of boolean values of the same length as another array.
-
arrayMask(int, int, SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
+
arrayMask(int, int) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates an "array mask" of a specified length and specified number of true values, where an "array mask" is an array of boolean values of the same length as another array.
-
arrayMask(int, int, Random) - Static method in class org.cicirello.math.rand.RandomIndexer
+
arrayMask(int, int, Random) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates an "array mask" of a specified length and specified number of true values, where an "array mask" is an array of boolean values of the same length as another array.
-
arrayMask(int, double) - Static method in class org.cicirello.math.rand.RandomIndexer
+
arrayMask(int, int, SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
-
Generates an "array mask" of a specified length, +
Generates an "array mask" of a specified length and specified number of true values, where an "array mask" is an array of boolean values of the same length as another array.
-
arrayMask(int, double, SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
+
arrayMask(int, Random) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates an "array mask" of a specified length, where an "array mask" is an array of boolean values of the same length as another array.
-
arrayMask(int, double, Random) - Static method in class org.cicirello.math.rand.RandomIndexer
+
arrayMask(int, SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates an "array mask" of a specified length, where an "array mask" is an array of boolean values of the same length as another array.
- +

B

@@ -135,35 +160,35 @@

B

Block Interchange Distance:
-
BlockInterchangeDistance() - Constructor for class org.cicirello.permutations.distance.BlockInterchangeDistance
+
BlockInterchangeDistance() - Constructor for class org.cicirello.permutations.distance.BlockInterchangeDistance
Constructs the distance measurer as specified in the class documentation.
- +

C

-
compute() - Method in class org.cicirello.math.la.JacobiDiagonalization
+
compute() - Method in class org.cicirello.math.la.JacobiDiagonalization
Computes the eigenvalues and eigenvectors using Jacobi Iteration.
-
compute(double) - Method in class org.cicirello.math.la.JacobiDiagonalization
+
compute(double) - Method in class org.cicirello.math.la.JacobiDiagonalization
Computes the eigenvalues and eigenvectors using Jacobi Iteration.
-
compute(int) - Method in class org.cicirello.math.la.JacobiDiagonalization
+
compute(double, int) - Method in class org.cicirello.math.la.JacobiDiagonalization
Computes the eigenvalues and eigenvectors using Jacobi Iteration.
-
compute(double, int) - Method in class org.cicirello.math.la.JacobiDiagonalization
+
compute(int) - Method in class org.cicirello.math.la.JacobiDiagonalization
Computes the eigenvalues and eigenvectors using Jacobi Iteration.
-
copy() - Method in class org.cicirello.permutations.Permutation
+
copy() - Method in class org.cicirello.permutations.Permutation
 
-
copy() - Method in interface org.cicirello.util.Copyable
+
copy() - Method in interface org.cicirello.util.Copyable
Creates an identical copy of this object.
@@ -171,27 +196,27 @@

C

A simple interface for objects that can be copied.
-
correlation(int[], int[]) - Static method in class org.cicirello.math.stats.Statistics
+
correlation(double[], double[]) - Static method in class org.cicirello.math.stats.Statistics
Computes correlation coefficient for a pair of random variables.
-
correlation(double[], double[]) - Static method in class org.cicirello.math.stats.Statistics
+
correlation(int[], int[]) - Static method in class org.cicirello.math.stats.Statistics
Computes correlation coefficient for a pair of random variables.
-
correlationMatrix(int[][]) - Static method in class org.cicirello.math.stats.Statistics
+
correlationMatrix(double[][]) - Static method in class org.cicirello.math.stats.Statistics
Computes correlation matrix.
-
correlationMatrix(double[][]) - Static method in class org.cicirello.math.stats.Statistics
+
correlationMatrix(int[][]) - Static method in class org.cicirello.math.stats.Statistics
Computes correlation matrix.
-
covariance(int[], int[]) - Static method in class org.cicirello.math.stats.Statistics
+
covariance(double[], double[]) - Static method in class org.cicirello.math.stats.Statistics
Computes covariance for a pair of random variables.
-
covariance(double[], double[]) - Static method in class org.cicirello.math.stats.Statistics
+
covariance(int[], int[]) - Static method in class org.cicirello.math.stats.Statistics
Computes covariance for a pair of random variables.
@@ -199,7 +224,7 @@

C

Cyclic Edge Distance:
-
CyclicEdgeDistance() - Constructor for class org.cicirello.permutations.distance.CyclicEdgeDistance
+
CyclicEdgeDistance() - Constructor for class org.cicirello.permutations.distance.CyclicEdgeDistance
Constructs the distance measurer as specified in the class documentation.
@@ -207,7 +232,7 @@

C

This class implements the concept of a cyclic independent distance measure.
-
CyclicIndependentDistance(PermutationDistanceMeasurer) - Constructor for class org.cicirello.permutations.distance.CyclicIndependentDistance
+
CyclicIndependentDistance(PermutationDistanceMeasurer) - Constructor for class org.cicirello.permutations.distance.CyclicIndependentDistance
Constructs a distance measure for measuring distance with cyclic independence, such that distance = min_{i in [0,N)} distance(p1,rotate(p2,i))
@@ -216,7 +241,7 @@

C

This class implements the concept of a cyclic independent distance measure.
-
CyclicIndependentDistanceDouble(PermutationDistanceMeasurerDouble) - Constructor for class org.cicirello.permutations.distance.CyclicIndependentDistanceDouble
+
CyclicIndependentDistanceDouble(PermutationDistanceMeasurerDouble) - Constructor for class org.cicirello.permutations.distance.CyclicIndependentDistanceDouble
Constructs a distance measure for measuring distance with cyclic independence, such that distance = min_{i in [0,N)} distance(p1,rotate(p2,i))
@@ -225,7 +250,7 @@

C

This class implements the combination of cyclic independence and reversal independence.
-
CyclicReversalIndependentDistance(PermutationDistanceMeasurer) - Constructor for class org.cicirello.permutations.distance.CyclicReversalIndependentDistance
+
CyclicReversalIndependentDistance(PermutationDistanceMeasurer) - Constructor for class org.cicirello.permutations.distance.CyclicReversalIndependentDistance
Constructs a distance measure for measuring distance with cyclic and reversal independence, such that distance = min_{i in [0,N)} { distance(p1,rotate(p2,i)), distance(p1,rotate(reverse(p2),i)) }
@@ -234,7 +259,7 @@

C

This class implements the combination of cyclic independence and reversal independence.
-
CyclicReversalIndependentDistanceDouble(PermutationDistanceMeasurerDouble) - Constructor for class org.cicirello.permutations.distance.CyclicReversalIndependentDistanceDouble
+
CyclicReversalIndependentDistanceDouble(PermutationDistanceMeasurerDouble) - Constructor for class org.cicirello.permutations.distance.CyclicReversalIndependentDistanceDouble
Constructs a distance measure for measuring distance with cyclic and reversal independence, such that distance = min_{i in [0,N)} { distance(p1,rotate(p2,i)), distance(p1,rotate(reverse(p2),i)) }
@@ -243,12 +268,12 @@

C

Cyclic RType Distance:
-
CyclicRTypeDistance() - Constructor for class org.cicirello.permutations.distance.CyclicRTypeDistance
+
CyclicRTypeDistance() - Constructor for class org.cicirello.permutations.distance.CyclicRTypeDistance
Constructs the distance measurer as specified in the class documentation.
- +

D

@@ -257,7 +282,7 @@

D

Deviation Distance:
-
DeviationDistance() - Constructor for class org.cicirello.permutations.distance.DeviationDistance
+
DeviationDistance() - Constructor for class org.cicirello.permutations.distance.DeviationDistance
Constructs the distance measurer as specified in the class documentation.
@@ -265,7 +290,7 @@

D

Normalized Deviation Distance:
-
DeviationDistanceNormalized() - Constructor for class org.cicirello.permutations.distance.DeviationDistanceNormalized
+
DeviationDistanceNormalized() - Constructor for class org.cicirello.permutations.distance.DeviationDistanceNormalized
Constructs the distance measurer as specified in the class documentation.
@@ -273,410 +298,410 @@

D

Normalized Deviation Distance:
-
DeviationDistanceNormalized2005() - Constructor for class org.cicirello.permutations.distance.DeviationDistanceNormalized2005
+
DeviationDistanceNormalized2005() - Constructor for class org.cicirello.permutations.distance.DeviationDistanceNormalized2005
Constructs the distance measurer as specified in the class documentation.
-
difference(int[][], int[][], int[][]) - Static method in class org.cicirello.math.la.MatrixOps
+
difference(double[][], double[][]) - Static method in class org.cicirello.math.la.MatrixOps
Computes C = A - B.
-
difference(double[][], double[][], double[][]) - Static method in class org.cicirello.math.la.MatrixOps
+
difference(double[][], double[][], double[][]) - Static method in class org.cicirello.math.la.MatrixOps
Computes C = A - B.
-
difference(int[][], int[][]) - Static method in class org.cicirello.math.la.MatrixOps
+
difference(int[][], int[][]) - Static method in class org.cicirello.math.la.MatrixOps
Computes C = A - B.
-
difference(double[][], double[][]) - Static method in class org.cicirello.math.la.MatrixOps
+
difference(int[][], int[][], int[][]) - Static method in class org.cicirello.math.la.MatrixOps
Computes C = A - B.
-
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.AcyclicEdgeDistance
+
distance(boolean[], boolean[]) - Method in class org.cicirello.sequences.distance.EditDistance
-
Measures the distance between two permutations.
-
-
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.BlockInterchangeDistance
-
-
Measures the distance between two permutations.
+
Measures the distance between two arrays.
-
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.CyclicEdgeDistance
+
distance(boolean[], boolean[]) - Method in class org.cicirello.sequences.distance.ExactMatchDistance
-
Measures the distance between two permutations.
+
Measures the distance between two arrays.
-
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.CyclicIndependentDistance
+
distance(boolean[], boolean[]) - Method in class org.cicirello.sequences.distance.KendallTauSequenceDistance
-
Measures the distance between two permutations, with cyclic independence: - distance = min_{i in [0,N)} distance(p1,rotate(p2,i))
+
Measures the distance between two arrays.
-
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.CyclicReversalIndependentDistance
+
distance(boolean[], boolean[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurer
-
Measures the distance between two permutations, with cyclic and reversal independence: - distance = min_{i in [0,N)} { distance(p1,rotate(p2,i)), distance(p1,rotate(reverse(p2),i)) }
+
Measures the distance between two arrays.
-
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.CyclicRTypeDistance
+
distance(byte[], byte[]) - Method in class org.cicirello.sequences.distance.EditDistance
-
Measures the distance between two permutations.
+
Measures the distance between two arrays.
-
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.DeviationDistance
+
distance(byte[], byte[]) - Method in class org.cicirello.sequences.distance.ExactMatchDistance
-
Measures the distance between two permutations.
+
Measures the distance between two arrays.
-
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.ExactMatchDistance
+
distance(byte[], byte[]) - Method in class org.cicirello.sequences.distance.KendallTauSequenceDistance
-
Measures the distance between two permutations.
+
Measures the distance between two arrays.
-
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.InterchangeDistance
+
distance(byte[], byte[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurer
-
Measures the distance between two permutations.
+
Measures the distance between two arrays.
-
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.KendallTauDistance
+
distance(char[], char[]) - Method in class org.cicirello.sequences.distance.EditDistance
-
Measures the distance between two permutations.
+
Measures the distance between two arrays.
-
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.LeeDistance
+
distance(char[], char[]) - Method in class org.cicirello.sequences.distance.ExactMatchDistance
-
Measures the distance between two permutations.
+
Measures the distance between two arrays.
-
distance(Permutation, Permutation) - Method in interface org.cicirello.permutations.distance.PermutationDistanceMeasurer
+
distance(char[], char[]) - Method in class org.cicirello.sequences.distance.KendallTauSequenceDistance
-
Measures the distance between two permutations.
+
Measures the distance between two arrays.
-
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.ReinsertionDistance
+
distance(char[], char[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurer
-
Measures the distance between two permutations.
+
Measures the distance between two arrays.
-
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.ReversalDistance
+
distance(double[], double[]) - Method in class org.cicirello.sequences.distance.EditDistance
-
Measures the distance between two permutations.
+
Measures the distance between two arrays.
-
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.ReversalIndependentDistance
+
distance(double[], double[]) - Method in class org.cicirello.sequences.distance.ExactMatchDistance
-
Measures the distance between two permutations, with reversal independence: - distance = min { distance(p1,p2), distance(p1,reverse(p2)) }
+
Measures the distance between two arrays.
-
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.RTypeDistance
+
distance(double[], double[]) - Method in class org.cicirello.sequences.distance.KendallTauSequenceDistance
-
Measures the distance between two permutations.
+
Measures the distance between two arrays.
-
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.ScrambleDistance
+
distance(double[], double[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurer
-
Measures the distance between two permutations.
+
Measures the distance between two arrays.
-
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.SquaredDeviationDistance
+
distance(float[], float[]) - Method in class org.cicirello.sequences.distance.EditDistance
-
Measures the distance between two permutations.
+
Measures the distance between two arrays.
-
distance(int[], int[]) - Method in class org.cicirello.sequences.distance.EditDistance
+
distance(float[], float[]) - Method in class org.cicirello.sequences.distance.ExactMatchDistance
Measures the distance between two arrays.
-
distance(long[], long[]) - Method in class org.cicirello.sequences.distance.EditDistance
+
distance(float[], float[]) - Method in class org.cicirello.sequences.distance.KendallTauSequenceDistance
Measures the distance between two arrays.
-
distance(short[], short[]) - Method in class org.cicirello.sequences.distance.EditDistance
+
distance(float[], float[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurer
Measures the distance between two arrays.
-
distance(byte[], byte[]) - Method in class org.cicirello.sequences.distance.EditDistance
+
distance(int[], int[]) - Method in class org.cicirello.sequences.distance.EditDistance
Measures the distance between two arrays.
-
distance(char[], char[]) - Method in class org.cicirello.sequences.distance.EditDistance
+
distance(int[], int[]) - Method in class org.cicirello.sequences.distance.ExactMatchDistance
Measures the distance between two arrays.
-
distance(boolean[], boolean[]) - Method in class org.cicirello.sequences.distance.EditDistance
+
distance(int[], int[]) - Method in class org.cicirello.sequences.distance.KendallTauSequenceDistance
Measures the distance between two arrays.
-
distance(double[], double[]) - Method in class org.cicirello.sequences.distance.EditDistance
+
distance(int[], int[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurer
Measures the distance between two arrays.
-
distance(float[], float[]) - Method in class org.cicirello.sequences.distance.EditDistance
+
distance(long[], long[]) - Method in class org.cicirello.sequences.distance.EditDistance
Measures the distance between two arrays.
-
distance(String, String) - Method in class org.cicirello.sequences.distance.EditDistance
+
distance(long[], long[]) - Method in class org.cicirello.sequences.distance.ExactMatchDistance
-
Measures the distance between two Strings.
+
Measures the distance between two arrays.
-
distance(Object[], Object[]) - Method in class org.cicirello.sequences.distance.EditDistance
+
distance(long[], long[]) - Method in class org.cicirello.sequences.distance.KendallTauSequenceDistance
-
Measures the distance between two arrays of objects.
+
Measures the distance between two arrays.
-
distance(List<T>, List<T>) - Method in class org.cicirello.sequences.distance.EditDistance
+
distance(long[], long[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurer
-
Measures the distance between two lists of objects.
+
Measures the distance between two arrays.
-
distance(int[], int[]) - Method in class org.cicirello.sequences.distance.ExactMatchDistance
+
distance(short[], short[]) - Method in class org.cicirello.sequences.distance.EditDistance
Measures the distance between two arrays.
-
distance(long[], long[]) - Method in class org.cicirello.sequences.distance.ExactMatchDistance
+
distance(short[], short[]) - Method in class org.cicirello.sequences.distance.ExactMatchDistance
Measures the distance between two arrays.
-
distance(short[], short[]) - Method in class org.cicirello.sequences.distance.ExactMatchDistance
+
distance(short[], short[]) - Method in class org.cicirello.sequences.distance.KendallTauSequenceDistance
Measures the distance between two arrays.
-
distance(byte[], byte[]) - Method in class org.cicirello.sequences.distance.ExactMatchDistance
+
distance(short[], short[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurer
Measures the distance between two arrays.
-
distance(char[], char[]) - Method in class org.cicirello.sequences.distance.ExactMatchDistance
+
distance(Object[], Object[]) - Method in class org.cicirello.sequences.distance.EditDistance
-
Measures the distance between two arrays.
+
Measures the distance between two arrays of objects.
-
distance(boolean[], boolean[]) - Method in class org.cicirello.sequences.distance.ExactMatchDistance
+
distance(Object[], Object[]) - Method in class org.cicirello.sequences.distance.ExactMatchDistance
-
Measures the distance between two arrays.
+
Measures the distance between two arrays of objects.
-
distance(double[], double[]) - Method in class org.cicirello.sequences.distance.ExactMatchDistance
+
distance(Object[], Object[]) - Method in class org.cicirello.sequences.distance.KendallTauSequenceDistance
-
Measures the distance between two arrays.
+
Measures the distance between two arrays of objects.
-
distance(float[], float[]) - Method in class org.cicirello.sequences.distance.ExactMatchDistance
+
distance(Object[], Object[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurer
-
Measures the distance between two arrays.
+
Measures the distance between two arrays of objects.
-
distance(String, String) - Method in class org.cicirello.sequences.distance.ExactMatchDistance
+
distance(String, String) - Method in class org.cicirello.sequences.distance.EditDistance
Measures the distance between two Strings.
-
distance(Object[], Object[]) - Method in class org.cicirello.sequences.distance.ExactMatchDistance
+
distance(String, String) - Method in class org.cicirello.sequences.distance.ExactMatchDistance
-
Measures the distance between two arrays of objects.
+
Measures the distance between two Strings.
-
distance(List<T>, List<T>) - Method in class org.cicirello.sequences.distance.ExactMatchDistance
+
distance(String, String) - Method in class org.cicirello.sequences.distance.KendallTauSequenceDistance
-
Measures the distance between two lists of objects.
+
Measures the distance between two Strings.
-
distance(int[], int[]) - Method in class org.cicirello.sequences.distance.KendallTauSequenceDistance
+
distance(String, String) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurer
-
Measures the distance between two arrays.
+
Measures the distance between two Strings.
-
distance(long[], long[]) - Method in class org.cicirello.sequences.distance.KendallTauSequenceDistance
+
distance(List<T>, List<T>) - Method in class org.cicirello.sequences.distance.EditDistance
-
Measures the distance between two arrays.
+
Measures the distance between two lists of objects.
-
distance(short[], short[]) - Method in class org.cicirello.sequences.distance.KendallTauSequenceDistance
+
distance(List<T>, List<T>) - Method in class org.cicirello.sequences.distance.ExactMatchDistance
-
Measures the distance between two arrays.
+
Measures the distance between two lists of objects.
-
distance(byte[], byte[]) - Method in class org.cicirello.sequences.distance.KendallTauSequenceDistance
+
distance(List<T>, List<T>) - Method in class org.cicirello.sequences.distance.KendallTauSequenceDistance
-
Measures the distance between two arrays.
+
Measures the distance between two lists of objects.
-
distance(char[], char[]) - Method in class org.cicirello.sequences.distance.KendallTauSequenceDistance
+
distance(List<T>, List<T>) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurer
-
Measures the distance between two arrays.
+
Measures the distance between two lists of objects.
-
distance(String, String) - Method in class org.cicirello.sequences.distance.KendallTauSequenceDistance
+
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.AcyclicEdgeDistance
-
Measures the distance between two Strings.
+
Measures the distance between two permutations.
-
distance(float[], float[]) - Method in class org.cicirello.sequences.distance.KendallTauSequenceDistance
+
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.BlockInterchangeDistance
-
Measures the distance between two arrays.
+
Measures the distance between two permutations.
-
distance(double[], double[]) - Method in class org.cicirello.sequences.distance.KendallTauSequenceDistance
+
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.CyclicEdgeDistance
-
Measures the distance between two arrays.
+
Measures the distance between two permutations.
-
distance(boolean[], boolean[]) - Method in class org.cicirello.sequences.distance.KendallTauSequenceDistance
+
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.CyclicIndependentDistance
-
Measures the distance between two arrays.
+
Measures the distance between two permutations, with cyclic independence: + distance = min_{i in [0,N)} distance(p1,rotate(p2,i))
-
distance(Object[], Object[]) - Method in class org.cicirello.sequences.distance.KendallTauSequenceDistance
+
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.CyclicReversalIndependentDistance
-
Measures the distance between two arrays of objects.
+
Measures the distance between two permutations, with cyclic and reversal independence: + distance = min_{i in [0,N)} { distance(p1,rotate(p2,i)), distance(p1,rotate(reverse(p2),i)) }
-
distance(List<T>, List<T>) - Method in class org.cicirello.sequences.distance.KendallTauSequenceDistance
+
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.CyclicRTypeDistance
-
Measures the distance between two lists of objects.
+
Measures the distance between two permutations.
-
distance(long[], long[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurer
+
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.DeviationDistance
-
Measures the distance between two arrays.
+
Measures the distance between two permutations.
-
distance(int[], int[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurer
+
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.ExactMatchDistance
-
Measures the distance between two arrays.
+
Measures the distance between two permutations.
-
distance(short[], short[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurer
+
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.InterchangeDistance
-
Measures the distance between two arrays.
+
Measures the distance between two permutations.
-
distance(byte[], byte[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurer
+
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.KendallTauDistance
-
Measures the distance between two arrays.
+
Measures the distance between two permutations.
-
distance(char[], char[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurer
+
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.LeeDistance
-
Measures the distance between two arrays.
+
Measures the distance between two permutations.
-
distance(double[], double[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurer
+
distance(Permutation, Permutation) - Method in interface org.cicirello.permutations.distance.PermutationDistanceMeasurer
-
Measures the distance between two arrays.
+
Measures the distance between two permutations.
-
distance(float[], float[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurer
+
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.ReinsertionDistance
-
Measures the distance between two arrays.
+
Measures the distance between two permutations.
-
distance(boolean[], boolean[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurer
+
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.ReversalDistance
-
Measures the distance between two arrays.
+
Measures the distance between two permutations.
-
distance(String, String) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurer
+
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.ReversalIndependentDistance
-
Measures the distance between two Strings.
+
Measures the distance between two permutations, with reversal independence: + distance = min { distance(p1,p2), distance(p1,reverse(p2)) }
-
distance(Object[], Object[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurer
+
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.RTypeDistance
-
Measures the distance between two arrays of objects.
+
Measures the distance between two permutations.
-
distance(List<T>, List<T>) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurer
+
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.ScrambleDistance
-
Measures the distance between two lists of objects.
+
Measures the distance between two permutations.
-
distancef(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.CyclicIndependentDistance
+
distance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.SquaredDeviationDistance
-
Measures the distance between two permutations
+
Measures the distance between two permutations.
-
distancef(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.CyclicIndependentDistanceDouble
+
distancef(boolean[], boolean[]) - Method in class org.cicirello.sequences.distance.EditDistance
-
Measures the distance between two permutations, with cyclic independence: - distance = min_{i in [0,N)} distance(p1,rotate(p2,i))
+
Measures the distance between two arrays.
-
distancef(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.CyclicReversalIndependentDistance
+
distancef(boolean[], boolean[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurerDouble
-
Measures the distance between two permutations
+
Measures the distance between two arrays.
-
distancef(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.CyclicReversalIndependentDistanceDouble
+
distancef(byte[], byte[]) - Method in class org.cicirello.sequences.distance.EditDistance
-
Measures the distance between two permutations, with cyclic and reversal independence: - distance = min_{i in [0,N)} { distance(p1,rotate(p2,i)), distance(p1,rotate(reverse(p2),i)) }
+
Measures the distance between two arrays.
-
distancef(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.DeviationDistanceNormalized
+
distancef(byte[], byte[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurerDouble
-
Measures the distance between two permutations
+
Measures the distance between two arrays.
-
distancef(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.DeviationDistanceNormalized2005
+
distancef(char[], char[]) - Method in class org.cicirello.sequences.distance.EditDistance
-
Measures the distance between two permutations
+
Measures the distance between two arrays.
-
distancef(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.EditDistance
+
distancef(char[], char[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurerDouble
-
Measures the distance between two permutations
+
Measures the distance between two arrays.
-
distancef(Permutation, Permutation) - Method in interface org.cicirello.permutations.distance.PermutationDistanceMeasurerDouble
+
distancef(double[], double[]) - Method in class org.cicirello.sequences.distance.EditDistance
-
Measures the distance between two permutations
+
Measures the distance between two arrays.
-
distancef(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.ReversalIndependentDistance
+
distancef(double[], double[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurerDouble
-
Measures the distance between two permutations
+
Measures the distance between two arrays.
-
distancef(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.ReversalIndependentDistanceDouble
+
distancef(float[], float[]) - Method in class org.cicirello.sequences.distance.EditDistance
-
Measures the distance between two permutations, with reversal independence: - distance = min { distance(p1,p2), distance(p1,reverse(p2)) }
+
Measures the distance between two arrays.
-
distancef(int[], int[]) - Method in class org.cicirello.sequences.distance.EditDistance
+
distancef(float[], float[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurerDouble
Measures the distance between two arrays.
-
distancef(long[], long[]) - Method in class org.cicirello.sequences.distance.EditDistance
+
distancef(int[], int[]) - Method in class org.cicirello.sequences.distance.EditDistance
Measures the distance between two arrays.
-
distancef(short[], short[]) - Method in class org.cicirello.sequences.distance.EditDistance
+
distancef(int[], int[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurerDouble
Measures the distance between two arrays.
-
distancef(byte[], byte[]) - Method in class org.cicirello.sequences.distance.EditDistance
+
distancef(long[], long[]) - Method in class org.cicirello.sequences.distance.EditDistance
Measures the distance between two arrays.
-
distancef(char[], char[]) - Method in class org.cicirello.sequences.distance.EditDistance
+
distancef(long[], long[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurerDouble
Measures the distance between two arrays.
-
distancef(boolean[], boolean[]) - Method in class org.cicirello.sequences.distance.EditDistance
+
distancef(short[], short[]) - Method in class org.cicirello.sequences.distance.EditDistance
Measures the distance between two arrays.
-
distancef(double[], double[]) - Method in class org.cicirello.sequences.distance.EditDistance
+
distancef(short[], short[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurerDouble
Measures the distance between two arrays.
-
distancef(float[], float[]) - Method in class org.cicirello.sequences.distance.EditDistance
+
distancef(Object[], Object[]) - Method in class org.cicirello.sequences.distance.EditDistance
-
Measures the distance between two arrays.
+
Measures the distance between two arrays of objects.
-
distancef(String, String) - Method in class org.cicirello.sequences.distance.EditDistance
+
distancef(Object[], Object[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurerDouble
+
+
Measures the distance between two arrays of objects.
+
+
distancef(String, String) - Method in class org.cicirello.sequences.distance.EditDistance
Measures the distance between two Strings.
-
distancef(Object[], Object[]) - Method in class org.cicirello.sequences.distance.EditDistance
+
distancef(String, String) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurerDouble
-
Measures the distance between two arrays of objects.
+
Measures the distance between two Strings.
-
distancef(List<T>, List<T>) - Method in class org.cicirello.sequences.distance.EditDistance
+
distancef(List<T>, List<T>) - Method in class org.cicirello.sequences.distance.EditDistance
Measures the distance between two lists of objects.
-
distancef(long[], long[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurerDouble
+
distancef(List<T>, List<T>) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurerDouble
-
Measures the distance between two arrays.
+
Measures the distance between two lists of objects.
-
distancef(int[], int[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurerDouble
+
distancef(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.CyclicIndependentDistance
-
Measures the distance between two arrays.
+
Measures the distance between two permutations
-
distancef(short[], short[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurerDouble
+
distancef(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.CyclicIndependentDistanceDouble
-
Measures the distance between two arrays.
+
Measures the distance between two permutations, with cyclic independence: + distance = min_{i in [0,N)} distance(p1,rotate(p2,i))
-
distancef(byte[], byte[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurerDouble
+
distancef(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.CyclicReversalIndependentDistance
-
Measures the distance between two arrays.
+
Measures the distance between two permutations
-
distancef(char[], char[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurerDouble
+
distancef(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.CyclicReversalIndependentDistanceDouble
-
Measures the distance between two arrays.
+
Measures the distance between two permutations, with cyclic and reversal independence: + distance = min_{i in [0,N)} { distance(p1,rotate(p2,i)), distance(p1,rotate(reverse(p2),i)) }
-
distancef(double[], double[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurerDouble
+
distancef(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.DeviationDistanceNormalized
-
Measures the distance between two arrays.
+
Measures the distance between two permutations
-
distancef(float[], float[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurerDouble
+
distancef(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.DeviationDistanceNormalized2005
-
Measures the distance between two arrays.
+
Measures the distance between two permutations
-
distancef(boolean[], boolean[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurerDouble
+
distancef(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.EditDistance
-
Measures the distance between two arrays.
+
Measures the distance between two permutations
-
distancef(String, String) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurerDouble
+
distancef(Permutation, Permutation) - Method in interface org.cicirello.permutations.distance.PermutationDistanceMeasurerDouble
-
Measures the distance between two Strings.
+
Measures the distance between two permutations
-
distancef(Object[], Object[]) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurerDouble
+
distancef(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.ReversalIndependentDistance
-
Measures the distance between two arrays of objects.
+
Measures the distance between two permutations
-
distancef(List<T>, List<T>) - Method in interface org.cicirello.sequences.distance.SequenceDistanceMeasurerDouble
+
distancef(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.ReversalIndependentDistanceDouble
-
Measures the distance between two lists of objects.
+
Measures the distance between two permutations, with reversal independence: + distance = min { distance(p1,p2), distance(p1,reverse(p2)) }
- +

E

@@ -685,32 +710,32 @@

E

Edit Distance:
-
EditDistance(double, double, double) - Constructor for class org.cicirello.permutations.distance.EditDistance
+
EditDistance - Class in org.cicirello.sequences.distance
-
Constructs an EditDistance function.
+
EditDistance is an implementation of Wagner and Fischer's dynamic programming algorithm for computing string edit distance.
-
EditDistance() - Constructor for class org.cicirello.permutations.distance.EditDistance
+
EditDistance() - Constructor for class org.cicirello.permutations.distance.EditDistance
Default edit distance computes number of remove and reinsert operations to transform one permutation into the other.
-
EditDistance - Class in org.cicirello.sequences.distance
+
EditDistance(double, double, double) - Constructor for class org.cicirello.permutations.distance.EditDistance
-
EditDistance is an implementation of Wagner and Fischer's dynamic programming algorithm for computing string edit distance.
+
Constructs an EditDistance function.
-
EditDistance(double, double, double) - Constructor for class org.cicirello.sequences.distance.EditDistance
+
EditDistance(double, double, double) - Constructor for class org.cicirello.sequences.distance.EditDistance
Constructs an edit distance measure with the specified edit operation costs.
-
EditDistance(int, int, int) - Constructor for class org.cicirello.sequences.distance.EditDistance
+
EditDistance(int, int, int) - Constructor for class org.cicirello.sequences.distance.EditDistance
Constructs an edit distance measure with the specified edit operation costs.
-
eigenvalues() - Method in class org.cicirello.math.la.JacobiDiagonalization
+
eigenvalues() - Method in class org.cicirello.math.la.JacobiDiagonalization
Gets the computed eigenvalues.
-
eigenvectors() - Method in class org.cicirello.math.la.JacobiDiagonalization
+
eigenvectors() - Method in class org.cicirello.math.la.JacobiDiagonalization
Gets the computed eigenvectors.
@@ -718,7 +743,7 @@

E

Default precision level for convergence check.
-
equals(Object) - Method in class org.cicirello.permutations.Permutation
+
equals(Object) - Method in class org.cicirello.permutations.Permutation
Equality test: Two permutations are equal if they are of the same length and contain the same elements in the same order.
@@ -727,58 +752,58 @@

E

Exact Match Distance:
-
ExactMatchDistance() - Constructor for class org.cicirello.permutations.distance.ExactMatchDistance
-
-
Constructs the distance measurer as specified in the class documentation.
-
ExactMatchDistance - Class in org.cicirello.sequences.distance
ExactMatch distance (or Hamming Distance) of a pair of non-binary strings (or more generally sequences) is the number of sequence (or string) positions where the two sequences differ.
-
ExactMatchDistance() - Constructor for class org.cicirello.sequences.distance.ExactMatchDistance
+
ExactMatchDistance() - Constructor for class org.cicirello.permutations.distance.ExactMatchDistance
+
+
Constructs the distance measurer as specified in the class documentation.
+
+
ExactMatchDistance() - Constructor for class org.cicirello.sequences.distance.ExactMatchDistance
Constructs the distance measurer as specified in the class documentation.
- +

G

-
get(int) - Method in class org.cicirello.permutations.Permutation
+
get(int) - Method in class org.cicirello.permutations.Permutation
Retrieves the i'th integer of the permutation.
-
get(int, int) - Method in class org.cicirello.permutations.Permutation
+
get(int, int) - Method in class org.cicirello.permutations.Permutation
Retrieves a range of elements from the permutation.
-
get(int, int, int[]) - Method in class org.cicirello.permutations.Permutation
+
get(int, int, int[]) - Method in class org.cicirello.permutations.Permutation
Retrieves a range of elements from the permutation.
-
getInverse() - Method in class org.cicirello.permutations.Permutation
+
getInverse() - Method in class org.cicirello.permutations.Permutation
Computes the inverse of the permutation.
-
getInversePermutation() - Method in class org.cicirello.permutations.Permutation
+
getInversePermutation() - Method in class org.cicirello.permutations.Permutation
Computes a Permutation that is the inverse of this Permutation.
- +

H

-
hashCode() - Method in class org.cicirello.permutations.Permutation
+
hashCode() - Method in class org.cicirello.permutations.Permutation
Uses Java's Arrays class's method for generating a hashCode from an array of ints.
-
hasNext() - Method in class org.cicirello.permutations.PermutationIterator
+
hasNext() - Method in class org.cicirello.permutations.PermutationIterator
- +

I

@@ -787,22 +812,22 @@

I

Interchange Distance:
-
InterchangeDistance() - Constructor for class org.cicirello.permutations.distance.InterchangeDistance
+
InterchangeDistance() - Constructor for class org.cicirello.permutations.distance.InterchangeDistance
Constructs the distance measurer as specified in the class documentation.
-
invert() - Method in class org.cicirello.permutations.Permutation
+
invert() - Method in class org.cicirello.permutations.Permutation
Inverts the Permutation, such that if p1 is the Permutation immediately prior to the call to invert, and if p2 is the Permutation immediately after the call to invert, then p1.get(i) == j iff p2.get(j) == i, for all i, j.
-
iterator() - Method in class org.cicirello.permutations.Permutation
+
iterator() - Method in class org.cicirello.permutations.Permutation
Returns an Iterator over all Permutations the length of this Permutation.
- +

J

@@ -811,16 +836,16 @@

J

This class uses Jacobi iteration to compute the eigenvalues and eigenvectors of a symmetric matrix, provided as a 2-D Java array.
-
JacobiDiagonalization(int[][]) - Constructor for class org.cicirello.math.la.JacobiDiagonalization
+
JacobiDiagonalization(double[][]) - Constructor for class org.cicirello.math.la.JacobiDiagonalization
Initializes a Jacobi iteration for finding eigenvalues and eigenvectors of a matrix.
-
JacobiDiagonalization(double[][]) - Constructor for class org.cicirello.math.la.JacobiDiagonalization
+
JacobiDiagonalization(int[][]) - Constructor for class org.cicirello.math.la.JacobiDiagonalization
Initializes a Jacobi iteration for finding eigenvalues and eigenvectors of a matrix.
- +

K

@@ -829,7 +854,7 @@

K

Kendall Tau Distance:
-
KendallTauDistance() - Constructor for class org.cicirello.permutations.distance.KendallTauDistance
+
KendallTauDistance() - Constructor for class org.cicirello.permutations.distance.KendallTauDistance
Constructs the distance measurer as specified in the class documentation.
@@ -838,16 +863,16 @@

K

Kendall Tau Sequence Distance is the minimum number of adjacent swaps necessary to transform one sequence into the other.
-
KendallTauSequenceDistance() - Constructor for class org.cicirello.sequences.distance.KendallTauSequenceDistance
+
KendallTauSequenceDistance() - Constructor for class org.cicirello.sequences.distance.KendallTauSequenceDistance
The KendallTauDistance class provides two algorithms.
-
KendallTauSequenceDistance(boolean) - Constructor for class org.cicirello.sequences.distance.KendallTauSequenceDistance
+
KendallTauSequenceDistance(boolean) - Constructor for class org.cicirello.sequences.distance.KendallTauSequenceDistance
The KendallTauDistance class provides two algorithms.
- +

L

@@ -856,15 +881,15 @@

L

Lee Distance:
-
LeeDistance() - Constructor for class org.cicirello.permutations.distance.LeeDistance
+
LeeDistance() - Constructor for class org.cicirello.permutations.distance.LeeDistance
Constructs the distance measurer as specified in the class documentation.
-
length() - Method in class org.cicirello.permutations.Permutation
+
length() - Method in class org.cicirello.permutations.Permutation
Retrieves the length of the permutation.
-
logGamma(double) - Static method in class org.cicirello.math.MathFunctions
+
logGamma(double) - Static method in class org.cicirello.math.MathFunctions
Implementation of the natural log of the absolute value of the gamma function.
@@ -874,12 +899,12 @@

L

LongestCommonSubsequenceDistance is a form of EditDistance, where the edit operations are limited to deletions and insertions (i.e., no replacements or changes), and where the cost of an edit operation is simply 1.
-
LongestCommonSubsequenceDistance() - Constructor for class org.cicirello.sequences.distance.LongestCommonSubsequenceDistance
+
LongestCommonSubsequenceDistance() - Constructor for class org.cicirello.sequences.distance.LongestCommonSubsequenceDistance
Constructs a longest common subsequence distance.
- +

M

@@ -893,77 +918,77 @@

M

Utility class of basic linear algebra matrix operations, where matrices are represented as 2-D Java arrays.
-
max(int) - Method in class org.cicirello.permutations.distance.AcyclicEdgeDistance
+
max(int) - Method in class org.cicirello.permutations.distance.AcyclicEdgeDistance
Computes the maximum possible distance between permutations of a specified length.
-
max(int) - Method in class org.cicirello.permutations.distance.BlockInterchangeDistance
+
max(int) - Method in class org.cicirello.permutations.distance.BlockInterchangeDistance
Computes the maximum possible distance between permutations of a specified length.
-
max(int) - Method in class org.cicirello.permutations.distance.CyclicEdgeDistance
+
max(int) - Method in class org.cicirello.permutations.distance.CyclicEdgeDistance
Computes the maximum possible distance between permutations of a specified length.
-
max(int) - Method in class org.cicirello.permutations.distance.CyclicRTypeDistance
+
max(int) - Method in class org.cicirello.permutations.distance.CyclicRTypeDistance
Computes the maximum possible distance between permutations of a specified length.
-
max(int) - Method in class org.cicirello.permutations.distance.DeviationDistance
+
max(int) - Method in class org.cicirello.permutations.distance.DeviationDistance
Computes the maximum possible distance between permutations of a specified length.
-
max(int) - Method in class org.cicirello.permutations.distance.ExactMatchDistance
+
max(int) - Method in class org.cicirello.permutations.distance.ExactMatchDistance
Computes the maximum possible distance between permutations of a specified length.
-
max(int) - Method in class org.cicirello.permutations.distance.InterchangeDistance
+
max(int) - Method in class org.cicirello.permutations.distance.InterchangeDistance
Computes the maximum possible distance between permutations of a specified length.
-
max(int) - Method in class org.cicirello.permutations.distance.KendallTauDistance
+
max(int) - Method in class org.cicirello.permutations.distance.KendallTauDistance
Computes the maximum possible distance between permutations of a specified length.
-
max(int) - Method in class org.cicirello.permutations.distance.LeeDistance
+
max(int) - Method in class org.cicirello.permutations.distance.LeeDistance
Computes the maximum possible distance between permutations of a specified length.
-
max(int) - Method in interface org.cicirello.permutations.distance.NormalizedPermutationDistanceMeasurer
+
max(int) - Method in interface org.cicirello.permutations.distance.NormalizedPermutationDistanceMeasurer
Computes the maximum possible distance between permutations of a specified length.
-
max(int) - Method in class org.cicirello.permutations.distance.ReinsertionDistance
+
max(int) - Method in class org.cicirello.permutations.distance.ReinsertionDistance
Computes the maximum possible distance between permutations of a specified length.
-
max(int) - Method in class org.cicirello.permutations.distance.ReversalDistance
+
max(int) - Method in class org.cicirello.permutations.distance.ReversalDistance
Computes the maximum possible distance between permutations of a specified length.
-
max(int) - Method in class org.cicirello.permutations.distance.RTypeDistance
+
max(int) - Method in class org.cicirello.permutations.distance.RTypeDistance
Computes the maximum possible distance between permutations of a specified length.
-
max(int) - Method in class org.cicirello.permutations.distance.ScrambleDistance
+
max(int) - Method in class org.cicirello.permutations.distance.ScrambleDistance
Computes the maximum possible distance between permutations of a specified length.
-
max(int) - Method in class org.cicirello.permutations.distance.SquaredDeviationDistance
+
max(int) - Method in class org.cicirello.permutations.distance.SquaredDeviationDistance
Computes the maximum possible distance between permutations of a specified length.
@@ -972,208 +997,208 @@

M

Default max number of iterations.
-
maxf(int) - Method in class org.cicirello.permutations.distance.DeviationDistanceNormalized
+
maxf(int) - Method in class org.cicirello.permutations.distance.DeviationDistanceNormalized
Computes the maximum possible distance between permutations of a specified length.
-
maxf(int) - Method in class org.cicirello.permutations.distance.DeviationDistanceNormalized2005
+
maxf(int) - Method in class org.cicirello.permutations.distance.DeviationDistanceNormalized2005
Computes the maximum possible distance between permutations of a specified length.
-
maxf(int) - Method in interface org.cicirello.permutations.distance.NormalizedPermutationDistanceMeasurerDouble
+
maxf(int) - Method in interface org.cicirello.permutations.distance.NormalizedPermutationDistanceMeasurerDouble
Computes the maximum possible distance between permutations of a specified length.
-
mean(int[]) - Static method in class org.cicirello.math.stats.Statistics
+
mean(double[]) - Static method in class org.cicirello.math.stats.Statistics
Computes mean of a dataset.
-
mean(double[]) - Static method in class org.cicirello.math.stats.Statistics
+
mean(int[]) - Static method in class org.cicirello.math.stats.Statistics
Computes mean of a dataset.
-
Mechanic() - Constructor for class org.cicirello.permutations.Permutation.Mechanic
+
Mechanic() - Constructor for class org.cicirello.permutations.Permutation.Mechanic
The default constructor can only be called by subclasses.
- +

N

-
next() - Method in class org.cicirello.permutations.PermutationIterator
-
nextBiasedInt(int) - Static method in class org.cicirello.math.rand.RandomIndexer
+
next() - Method in class org.cicirello.permutations.PermutationIterator
+
nextBiasedInt(int) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random integer in the interval: [0, bound).
-
nextBiasedInt(int, SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
+
nextBiasedInt(int, Random) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random integer in the interval: [0, bound).
-
nextBiasedInt(int, Random) - Static method in class org.cicirello.math.rand.RandomIndexer
+
nextBiasedInt(int, SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random integer in the interval: [0, bound).
-
nextBinomial(int, double) - Static method in class org.cicirello.math.rand.RandomVariates
+
nextBinomial(int, double) - Static method in class org.cicirello.math.rand.RandomVariates
Generates a pseudorandom integer from a binomial distribution.
-
nextBinomial(int, double, Random) - Static method in class org.cicirello.math.rand.RandomVariates
+
nextBinomial(int, double, Random) - Static method in class org.cicirello.math.rand.RandomVariates
Generates a pseudorandom integer from a binomial distribution.
-
nextBinomial(int, double, SplittableRandom) - Static method in class org.cicirello.math.rand.RandomVariates
+
nextBinomial(int, double, SplittableRandom) - Static method in class org.cicirello.math.rand.RandomVariates
Generates a pseudorandom integer from a binomial distribution.
-
nextCauchy(double, double) - Static method in class org.cicirello.math.rand.RandomVariates
-
-
Generates a pseudorandom number from a Cauchy distribution.
-
-
nextCauchy(double) - Static method in class org.cicirello.math.rand.RandomVariates
+
nextCauchy(double) - Static method in class org.cicirello.math.rand.RandomVariates
Generates a pseudorandom number from a Cauchy distribution with median 0 and chosen scale parameter.
-
nextCauchy(double, double, Random) - Static method in class org.cicirello.math.rand.RandomVariates
+
nextCauchy(double, double) - Static method in class org.cicirello.math.rand.RandomVariates
Generates a pseudorandom number from a Cauchy distribution.
-
nextCauchy(double, Random) - Static method in class org.cicirello.math.rand.RandomVariates
+
nextCauchy(double, double, Random) - Static method in class org.cicirello.math.rand.RandomVariates
-
Generates a pseudorandom number from a Cauchy distribution with median 0 - and chosen scale parameter.
+
Generates a pseudorandom number from a Cauchy distribution.
-
nextCauchy(double, double, SplittableRandom) - Static method in class org.cicirello.math.rand.RandomVariates
+
nextCauchy(double, double, SplittableRandom) - Static method in class org.cicirello.math.rand.RandomVariates
Generates a pseudorandom number from a Cauchy distribution.
-
nextCauchy(double, SplittableRandom) - Static method in class org.cicirello.math.rand.RandomVariates
+
nextCauchy(double, Random) - Static method in class org.cicirello.math.rand.RandomVariates
Generates a pseudorandom number from a Cauchy distribution with median 0 and chosen scale parameter.
-
nextInt(int) - Static method in class org.cicirello.math.rand.RandomIndexer
+
nextCauchy(double, SplittableRandom) - Static method in class org.cicirello.math.rand.RandomVariates
+
+
Generates a pseudorandom number from a Cauchy distribution with median 0 + and chosen scale parameter.
+
+
nextInt(int) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random integer uniformly distributed in the interval: [0, bound).
-
nextInt(int, SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
+
nextInt(int, Random) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random integer uniformly distributed in the interval: [0, bound).
-
nextInt(int, Random) - Static method in class org.cicirello.math.rand.RandomIndexer
+
nextInt(int, SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random integer uniformly distributed in the interval: [0, bound).
-
nextIntPair(int, int[]) - Static method in class org.cicirello.math.rand.RandomIndexer
+
nextIntPair(int, int[]) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of 2 integers, without replacement, from the set of integers in the interval [0, n).
-
nextIntPair(int, int[], SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
+
nextIntPair(int, int[], Random) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of 2 integers, without replacement, from the set of integers in the interval [0, n).
-
nextIntPair(int, int[], Random) - Static method in class org.cicirello.math.rand.RandomIndexer
+
nextIntPair(int, int[], SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of 2 integers, without replacement, from the set of integers in the interval [0, n).
-
nextIntTriple(int, int[]) - Static method in class org.cicirello.math.rand.RandomIndexer
+
nextIntTriple(int, int[]) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of 3 integers, without replacement, from the set of integers in the interval [0, n).
-
nextIntTriple(int, int[], boolean) - Static method in class org.cicirello.math.rand.RandomIndexer
+
nextIntTriple(int, int[], boolean) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of 3 integers, without replacement, from the set of integers in the interval [0, n).
-
nextIntTriple(int, int[], boolean, SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
+
nextIntTriple(int, int[], boolean, Random) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of 3 integers, without replacement, from the set of integers in the interval [0, n).
-
nextIntTriple(int, int[], boolean, Random) - Static method in class org.cicirello.math.rand.RandomIndexer
+
nextIntTriple(int, int[], boolean, SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of 3 integers, without replacement, from the set of integers in the interval [0, n).
-
nextIntTriple(int, int[], SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
+
nextIntTriple(int, int[], Random) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of 3 integers, without replacement, from the set of integers in the interval [0, n).
-
nextIntTriple(int, int[], Random) - Static method in class org.cicirello.math.rand.RandomIndexer
+
nextIntTriple(int, int[], SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of 3 integers, without replacement, from the set of integers in the interval [0, n).
-
nextWindowedIntPair(int, int, int[]) - Static method in class org.cicirello.math.rand.RandomIndexer
+
nextWindowedIntPair(int, int, int[]) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of 2 integers, i, j, without replacement, from the set of integers in the interval [0, n), such that |i-j| ≤ window.
-
nextWindowedIntPair(int, int, int[], SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
+
nextWindowedIntPair(int, int, int[], Random) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of 2 integers, i, j, without replacement, from the set of integers in the interval [0, n), such that |i-j| ≤ window.
-
nextWindowedIntPair(int, int, int[], Random) - Static method in class org.cicirello.math.rand.RandomIndexer
+
nextWindowedIntPair(int, int, int[], SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of 2 integers, i, j, without replacement, from the set of integers in the interval [0, n), such that |i-j| ≤ window.
-
nextWindowedIntTriple(int, int, int[]) - Static method in class org.cicirello.math.rand.RandomIndexer
+
nextWindowedIntTriple(int, int, int[]) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of 3 integers, i, j, k without replacement, from the set of integers in the interval [0, n), such that |i-j| ≤ window, and |i-k| ≤ window, and |k-j| ≤ window.
-
nextWindowedIntTriple(int, int, int[], boolean) - Static method in class org.cicirello.math.rand.RandomIndexer
+
nextWindowedIntTriple(int, int, int[], boolean) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of 3 integers, i, j, k without replacement, from the set of integers in the interval [0, n), such that |i-j| ≤ window, and |i-k| ≤ window, and |k-j| ≤ window.
-
nextWindowedIntTriple(int, int, int[], SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
+
nextWindowedIntTriple(int, int, int[], boolean, Random) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of 3 integers, i, j, k without replacement, from the set of integers in the interval [0, n), such that |i-j| ≤ window, and |i-k| ≤ window, and |k-j| ≤ window.
-
nextWindowedIntTriple(int, int, int[], boolean, SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
+
nextWindowedIntTriple(int, int, int[], boolean, SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of 3 integers, i, j, k without replacement, from the set of integers in the interval [0, n), such that |i-j| ≤ window, and |i-k| ≤ window, and |k-j| ≤ window.
-
nextWindowedIntTriple(int, int, int[], Random) - Static method in class org.cicirello.math.rand.RandomIndexer
+
nextWindowedIntTriple(int, int, int[], Random) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of 3 integers, i, j, k without replacement, from the set of integers in the interval [0, n), such that |i-j| ≤ window, and |i-k| ≤ window, and |k-j| ≤ window.
-
nextWindowedIntTriple(int, int, int[], boolean, Random) - Static method in class org.cicirello.math.rand.RandomIndexer
+
nextWindowedIntTriple(int, int, int[], SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of 3 integers, i, j, k without replacement, from the set of integers in the interval [0, n), such that |i-j| ≤ window, and |i-k| ≤ window, and |k-j| ≤ window.
-
normalizedDistance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.DeviationDistanceNormalized
+
normalizedDistance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.DeviationDistanceNormalized
Measures the distance between two permutations, normalized to the interval [0.0, 1.0].
-
normalizedDistance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.DeviationDistanceNormalized2005
+
normalizedDistance(Permutation, Permutation) - Method in class org.cicirello.permutations.distance.DeviationDistanceNormalized2005
Measures the distance between two permutations, normalized to the interval [0.0, 1.0].
-
normalizedDistance(Permutation, Permutation) - Method in interface org.cicirello.permutations.distance.NormalizedPermutationDistanceMeasurerDouble
+
normalizedDistance(Permutation, Permutation) - Method in interface org.cicirello.permutations.distance.NormalizedPermutationDistanceMeasurerDouble
Measures the distance between two permutations, normalized to the interval [0.0, 1.0].
@@ -1188,7 +1213,7 @@

N

normalizing the distance to the interval [0,1].
- +

O

@@ -1230,7 +1255,7 @@

O

This package includes classes and interfaces that serve some useful utility purpose.
- +

P

@@ -1239,38 +1264,38 @@

P

Representation of a permutation of the integers from 0 to N-1, inclusive.
-
Permutation(int) - Constructor for class org.cicirello.permutations.Permutation
+
Permutation(int) - Constructor for class org.cicirello.permutations.Permutation
Initializes a random permutation of n integers.
-
Permutation(int, SplittableRandom) - Constructor for class org.cicirello.permutations.Permutation
+
Permutation(int[]) - Constructor for class org.cicirello.permutations.Permutation
-
Initializes a random permutation of n integers.
-
-
Permutation(int, Random) - Constructor for class org.cicirello.permutations.Permutation
-
-
Initializes a random permutation of n integers.
+
Initializes a permutation of n integers to be identical to the elements of an array.
-
Permutation(int, int) - Constructor for class org.cicirello.permutations.Permutation
+
Permutation(int, int) - Constructor for class org.cicirello.permutations.Permutation
Initializes a specific permutation from an integer in mixed radix form representing the chosen permutation.
-
Permutation(int, BigInteger) - Constructor for class org.cicirello.permutations.Permutation
+
Permutation(int, BigInteger) - Constructor for class org.cicirello.permutations.Permutation
Initializes a specific permutation from an integer in mixed radix form representing the chosen permutation.
-
Permutation(int[]) - Constructor for class org.cicirello.permutations.Permutation
+
Permutation(int, Random) - Constructor for class org.cicirello.permutations.Permutation
-
Initializes a permutation of n integers to be identical to the elements of an array.
+
Initializes a random permutation of n integers.
-
Permutation(Permutation) - Constructor for class org.cicirello.permutations.Permutation
+
Permutation(int, SplittableRandom) - Constructor for class org.cicirello.permutations.Permutation
+
+
Initializes a random permutation of n integers.
+
+
Permutation(Permutation) - Constructor for class org.cicirello.permutations.Permutation
Initializes a permutation of n integers to be identical to a given permutation.
-
Permutation(Permutation, int) - Constructor for class org.cicirello.permutations.Permutation
+
Permutation(Permutation, int) - Constructor for class org.cicirello.permutations.Permutation
Initializes a permutation of the integers in the interval [0, length) based on their relative order in a permutation p.
@@ -1294,36 +1319,36 @@

P

Iterator over all permutations of a specified length, n, of the integers in the interval [0,n).
-
PermutationIterator(int) - Constructor for class org.cicirello.permutations.PermutationIterator
+
PermutationIterator(int) - Constructor for class org.cicirello.permutations.PermutationIterator
Initializes a PermutationIterator to iterate over all permutations of a given length.
-
PermutationIterator(Permutation) - Constructor for class org.cicirello.permutations.PermutationIterator
+
PermutationIterator(Permutation) - Constructor for class org.cicirello.permutations.PermutationIterator
Initializes a PermutationIterator to iterate over all permutations the same length as a given permutation.
-
pow(double, int) - Static method in class org.cicirello.math.MathFunctions
+
pow(double, int) - Static method in class org.cicirello.math.MathFunctions
Computes ab, where the exponent b is an integer.
-
product(int[][], int[][], int[][]) - Static method in class org.cicirello.math.la.MatrixOps
+
product(double[][], double[][]) - Static method in class org.cicirello.math.la.MatrixOps
Computes C = A * B.
-
product(double[][], double[][], double[][]) - Static method in class org.cicirello.math.la.MatrixOps
+
product(double[][], double[][], double[][]) - Static method in class org.cicirello.math.la.MatrixOps
Computes C = A * B.
-
product(int[][], int[][]) - Static method in class org.cicirello.math.la.MatrixOps
+
product(int[][], int[][]) - Static method in class org.cicirello.math.la.MatrixOps
Computes C = A * B.
-
product(double[][], double[][]) - Static method in class org.cicirello.math.la.MatrixOps
+
product(int[][], int[][], int[][]) - Static method in class org.cicirello.math.la.MatrixOps
Computes C = A * B.
- +

R

@@ -1342,16 +1367,16 @@

R

Reinsertion Distance:
-
ReinsertionDistance() - Constructor for class org.cicirello.permutations.distance.ReinsertionDistance
+
ReinsertionDistance() - Constructor for class org.cicirello.permutations.distance.ReinsertionDistance
Constructs the distance measurer as specified in the class documentation.
-
removeAndInsert(int, int) - Method in class org.cicirello.permutations.Permutation
+
removeAndInsert(int, int) - Method in class org.cicirello.permutations.Permutation
Removes integer from one position and then inserts it into a a new position shifting the rest of the permutation as necessary.
-
removeAndInsert(int, int, int) - Method in class org.cicirello.permutations.Permutation
+
removeAndInsert(int, int, int) - Method in class org.cicirello.permutations.Permutation
Removes a sub-array of integers from one position and then inserts it into a a new position shifting the rest of the permutation as necessary.
@@ -1360,11 +1385,11 @@

R

Reversal Distance:
-
ReversalDistance() - Constructor for class org.cicirello.permutations.distance.ReversalDistance
+
ReversalDistance() - Constructor for class org.cicirello.permutations.distance.ReversalDistance
Construct the distance measure.
-
ReversalDistance(int) - Constructor for class org.cicirello.permutations.distance.ReversalDistance
+
ReversalDistance(int) - Constructor for class org.cicirello.permutations.distance.ReversalDistance
Defines a distance measure for permutations of length n.
@@ -1372,7 +1397,7 @@

R

This class implements the concept of a reversal independent distance measure.
-
ReversalIndependentDistance(PermutationDistanceMeasurer) - Constructor for class org.cicirello.permutations.distance.ReversalIndependentDistance
+
ReversalIndependentDistance(PermutationDistanceMeasurer) - Constructor for class org.cicirello.permutations.distance.ReversalIndependentDistance
Constructs a distance measure for measuring distance with reversal independence, such that distance = min { distance(p1,p2), distance(p1,reverse(p2)) }
@@ -1381,20 +1406,20 @@

R

This class implements the concept of a reversal independent distance measure.
-
ReversalIndependentDistanceDouble(PermutationDistanceMeasurerDouble) - Constructor for class org.cicirello.permutations.distance.ReversalIndependentDistanceDouble
+
ReversalIndependentDistanceDouble(PermutationDistanceMeasurerDouble) - Constructor for class org.cicirello.permutations.distance.ReversalIndependentDistanceDouble
Constructs a distance measure for measuring distance with reversal independence, such that distance = min { distance(p1,p2), distance(p1,reverse(p2)) }
-
reverse() - Method in class org.cicirello.permutations.Permutation
+
reverse() - Method in class org.cicirello.permutations.Permutation
Reverses the order of the elements in the permutation.
-
reverse(int, int) - Method in class org.cicirello.permutations.Permutation
+
reverse(int, int) - Method in class org.cicirello.permutations.Permutation
Reverses the order of the elements of a subrange of the permutation.
-
rotate(int) - Method in class org.cicirello.permutations.Permutation
+
rotate(int) - Method in class org.cicirello.permutations.Permutation
Circular rotation of permutation (to the left).
@@ -1402,357 +1427,357 @@

R

RType Distance:
-
RTypeDistance() - Constructor for class org.cicirello.permutations.distance.RTypeDistance
+
RTypeDistance() - Constructor for class org.cicirello.permutations.distance.RTypeDistance
Constructs the distance measurer as specified in the class documentation.
- +

S

-
sample(int, double) - Static method in class org.cicirello.math.rand.RandomIndexer
+
sample(byte[], double) - Static method in class org.cicirello.sequences.SequenceSampler
-
Generates a random sample, without replacement, from the - set of integers in the interval [0, n).
+
Generates a random sample, without replacement, from a given source array + with a specified probability of an element's inclusion in the sample.
-
sample(int, double, SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
+
sample(byte[], int, byte[]) - Static method in class org.cicirello.sequences.SequenceSampler
-
Generates a random sample, without replacement, from the - set of integers in the interval [0, n).
+
Generates a random sample of k elements, without replacement, from a + given source array.
-
sample(int, double, Random) - Static method in class org.cicirello.math.rand.RandomIndexer
+
sample(char[], double) - Static method in class org.cicirello.sequences.SequenceSampler
-
Generates a random sample, without replacement, from the - set of integers in the interval [0, n).
+
Generates a random sample, without replacement, from a given source array + with a specified probability of an element's inclusion in the sample.
-
sample(int, int, int[]) - Static method in class org.cicirello.math.rand.RandomIndexer
+
sample(char[], int, char[]) - Static method in class org.cicirello.sequences.SequenceSampler
-
Generates a random sample of k integers, without replacement, from the - set of integers in the interval [0, n).
+
Generates a random sample of k elements, without replacement, from a + given source array.
-
sample(int, int, int[], SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
+
sample(double[], double) - Static method in class org.cicirello.sequences.SequenceSampler
-
Generates a random sample of k integers, without replacement, from the - set of integers in the interval [0, n).
+
Generates a random sample, without replacement, from a given source array + with a specified probability of an element's inclusion in the sample.
-
sample(int, int, int[], Random) - Static method in class org.cicirello.math.rand.RandomIndexer
+
sample(double[], int, double[]) - Static method in class org.cicirello.sequences.SequenceSampler
-
Generates a random sample of k integers, without replacement, from the - set of integers in the interval [0, n).
+
Generates a random sample of k elements, without replacement, from a + given source array.
-
sample(byte[], double) - Static method in class org.cicirello.sequences.SequenceSampler
+
sample(float[], double) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample, without replacement, from a given source array with a specified probability of an element's inclusion in the sample.
-
sample(char[], double) - Static method in class org.cicirello.sequences.SequenceSampler
+
sample(float[], int, float[]) - Static method in class org.cicirello.sequences.SequenceSampler
-
Generates a random sample, without replacement, from a given source array - with a specified probability of an element's inclusion in the sample.
+
Generates a random sample of k elements, without replacement, from a + given source array.
-
sample(double[], double) - Static method in class org.cicirello.sequences.SequenceSampler
+
sample(int[], double) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample, without replacement, from a given source array with a specified probability of an element's inclusion in the sample.
-
sample(float[], double) - Static method in class org.cicirello.sequences.SequenceSampler
+
sample(int[], int, int[]) - Static method in class org.cicirello.sequences.SequenceSampler
-
Generates a random sample, without replacement, from a given source array - with a specified probability of an element's inclusion in the sample.
+
Generates a random sample of k elements, without replacement, from a + given source array.
-
sample(int[], double) - Static method in class org.cicirello.sequences.SequenceSampler
+
sample(int, double) - Static method in class org.cicirello.math.rand.RandomIndexer
-
Generates a random sample, without replacement, from a given source array - with a specified probability of an element's inclusion in the sample.
+
Generates a random sample, without replacement, from the + set of integers in the interval [0, n).
-
sample(long[], double) - Static method in class org.cicirello.sequences.SequenceSampler
+
sample(int, double, Random) - Static method in class org.cicirello.math.rand.RandomIndexer
-
Generates a random sample, without replacement, from a given source array - with a specified probability of an element's inclusion in the sample.
+
Generates a random sample, without replacement, from the + set of integers in the interval [0, n).
-
sample(short[], double) - Static method in class org.cicirello.sequences.SequenceSampler
+
sample(int, double, SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
-
Generates a random sample, without replacement, from a given source array - with a specified probability of an element's inclusion in the sample.
+
Generates a random sample, without replacement, from the + set of integers in the interval [0, n).
-
sample(String, double) - Static method in class org.cicirello.sequences.SequenceSampler
+
sample(int, int, int[]) - Static method in class org.cicirello.math.rand.RandomIndexer
-
Generates a random sample, without replacement, from a given String - with a specified probability of a character's inclusion in the sample.
+
Generates a random sample of k integers, without replacement, from the + set of integers in the interval [0, n).
-
sample(T[], double) - Static method in class org.cicirello.sequences.SequenceSampler
+
sample(int, int, int[], Random) - Static method in class org.cicirello.math.rand.RandomIndexer
+
+
Generates a random sample of k integers, without replacement, from the + set of integers in the interval [0, n).
+
+
sample(int, int, int[], SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
+
+
Generates a random sample of k integers, without replacement, from the + set of integers in the interval [0, n).
+
+
sample(long[], double) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample, without replacement, from a given source array with a specified probability of an element's inclusion in the sample.
-
sample(int[], int, int[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
sample(long[], int, long[]) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample of k elements, without replacement, from a given source array.
-
sample(long[], int, long[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
sample(short[], double) - Static method in class org.cicirello.sequences.SequenceSampler
-
Generates a random sample of k elements, without replacement, from a - given source array.
+
Generates a random sample, without replacement, from a given source array + with a specified probability of an element's inclusion in the sample.
-
sample(short[], int, short[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
sample(short[], int, short[]) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample of k elements, without replacement, from a given source array.
-
sample(byte[], int, byte[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
sample(String, double) - Static method in class org.cicirello.sequences.SequenceSampler
+
+
Generates a random sample, without replacement, from a given String + with a specified probability of a character's inclusion in the sample.
+
+
sample(String, int, char[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
+
Generates a random sample of k chars, without replacement, from a + given source String.
+
+
sample(T[], double) - Static method in class org.cicirello.sequences.SequenceSampler
+
+
Generates a random sample, without replacement, from a given source array + with a specified probability of an element's inclusion in the sample.
+
+
sample(T[], int, T[]) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample of k elements, without replacement, from a given source array.
-
sample(char[], int, char[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
sampleInsertion(byte[], int, byte[]) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample of k elements, without replacement, from a given source array.
-
sample(String, int, char[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
sampleInsertion(char[], int, char[]) - Static method in class org.cicirello.sequences.SequenceSampler
-
Generates a random sample of k chars, without replacement, from a - given source String.
+
Generates a random sample of k elements, without replacement, from a + given source array.
-
sample(double[], int, double[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
sampleInsertion(double[], int, double[]) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample of k elements, without replacement, from a given source array.
-
sample(float[], int, float[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
sampleInsertion(float[], int, float[]) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample of k elements, without replacement, from a given source array.
-
sample(T[], int, T[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
sampleInsertion(int[], int, int[]) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample of k elements, without replacement, from a given source array.
-
sampleInsertion(int, int, int[]) - Static method in class org.cicirello.math.rand.RandomIndexer
+
sampleInsertion(int, int, int[]) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of k integers, without replacement, from the set of integers in the interval [0, n).
-
sampleInsertion(int, int, int[], SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
+
sampleInsertion(int, int, int[], Random) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of k integers, without replacement, from the set of integers in the interval [0, n).
-
sampleInsertion(int, int, int[], Random) - Static method in class org.cicirello.math.rand.RandomIndexer
+
sampleInsertion(int, int, int[], SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of k integers, without replacement, from the set of integers in the interval [0, n).
-
sampleInsertion(int[], int, int[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
sampleInsertion(long[], int, long[]) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample of k elements, without replacement, from a given source array.
-
sampleInsertion(long[], int, long[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
sampleInsertion(short[], int, short[]) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample of k elements, without replacement, from a given source array.
-
sampleInsertion(short[], int, short[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
sampleInsertion(String, int, char[]) - Static method in class org.cicirello.sequences.SequenceSampler
-
Generates a random sample of k elements, without replacement, from a - given source array.
+
Generates a random sample of k chars, without replacement, from a + given source String.
-
sampleInsertion(byte[], int, byte[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
sampleInsertion(T[], int, T[]) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample of k elements, without replacement, from a given source array.
-
sampleInsertion(char[], int, char[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
samplePool(byte[], int, byte[]) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample of k elements, without replacement, from a given source array.
-
sampleInsertion(String, int, char[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
samplePool(char[], int, char[]) - Static method in class org.cicirello.sequences.SequenceSampler
-
Generates a random sample of k chars, without replacement, from a - given source String.
+
Generates a random sample of k elements, without replacement, from a + given source array.
-
sampleInsertion(double[], int, double[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
samplePool(double[], int, double[]) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample of k elements, without replacement, from a given source array.
-
sampleInsertion(float[], int, float[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
samplePool(float[], int, float[]) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample of k elements, without replacement, from a given source array.
-
sampleInsertion(T[], int, T[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
samplePool(int[], int, int[]) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample of k elements, without replacement, from a given source array.
-
samplePool(int, int, int[]) - Static method in class org.cicirello.math.rand.RandomIndexer
+
samplePool(int, int, int[]) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of k integers, without replacement, from the set of integers in the interval [0, n).
-
samplePool(int, int, int[], SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
+
samplePool(int, int, int[], Random) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of k integers, without replacement, from the set of integers in the interval [0, n).
-
samplePool(int, int, int[], Random) - Static method in class org.cicirello.math.rand.RandomIndexer
+
samplePool(int, int, int[], SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of k integers, without replacement, from the set of integers in the interval [0, n).
-
samplePool(int[], int, int[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
samplePool(long[], int, long[]) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample of k elements, without replacement, from a given source array.
-
samplePool(long[], int, long[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
samplePool(short[], int, short[]) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample of k elements, without replacement, from a given source array.
-
samplePool(short[], int, short[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
samplePool(String, int, char[]) - Static method in class org.cicirello.sequences.SequenceSampler
-
Generates a random sample of k elements, without replacement, from a - given source array.
+
Generates a random sample of k chars, without replacement, from a + given source String.
-
samplePool(byte[], int, byte[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
samplePool(T[], int, T[]) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample of k elements, without replacement, from a given source array.
-
samplePool(char[], int, char[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
sampleReservoir(byte[], int, byte[]) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample of k elements, without replacement, from a given source array.
-
samplePool(String, int, char[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
sampleReservoir(char[], int, char[]) - Static method in class org.cicirello.sequences.SequenceSampler
-
Generates a random sample of k chars, without replacement, from a - given source String.
+
Generates a random sample of k elements, without replacement, from a + given source array.
-
samplePool(double[], int, double[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
sampleReservoir(double[], int, double[]) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample of k elements, without replacement, from a given source array.
-
samplePool(float[], int, float[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
sampleReservoir(float[], int, float[]) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample of k elements, without replacement, from a given source array.
-
samplePool(T[], int, T[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
sampleReservoir(int[], int, int[]) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample of k elements, without replacement, from a given source array.
-
sampleReservoir(int, int, int[]) - Static method in class org.cicirello.math.rand.RandomIndexer
+
sampleReservoir(int, int, int[]) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of k integers, without replacement, from the set of integers in the interval [0, n).
-
sampleReservoir(int, int, int[], Random) - Static method in class org.cicirello.math.rand.RandomIndexer
+
sampleReservoir(int, int, int[], Random) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of k integers, without replacement, from the set of integers in the interval [0, n).
-
sampleReservoir(int, int, int[], SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
+
sampleReservoir(int, int, int[], SplittableRandom) - Static method in class org.cicirello.math.rand.RandomIndexer
Generates a random sample of k integers, without replacement, from the set of integers in the interval [0, n).
-
sampleReservoir(int[], int, int[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
sampleReservoir(long[], int, long[]) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample of k elements, without replacement, from a given source array.
-
sampleReservoir(long[], int, long[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
sampleReservoir(short[], int, short[]) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample of k elements, without replacement, from a given source array.
-
sampleReservoir(short[], int, short[]) - Static method in class org.cicirello.sequences.SequenceSampler
-
-
Generates a random sample of k elements, without replacement, from a - given source array.
-
-
sampleReservoir(byte[], int, byte[]) - Static method in class org.cicirello.sequences.SequenceSampler
-
-
Generates a random sample of k elements, without replacement, from a - given source array.
-
-
sampleReservoir(char[], int, char[]) - Static method in class org.cicirello.sequences.SequenceSampler
-
-
Generates a random sample of k elements, without replacement, from a - given source array.
-
-
sampleReservoir(String, int, char[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
sampleReservoir(String, int, char[]) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample of k chars, without replacement, from a given source String.
-
sampleReservoir(double[], int, double[]) - Static method in class org.cicirello.sequences.SequenceSampler
+
sampleReservoir(T[], int, T[]) - Static method in class org.cicirello.sequences.SequenceSampler
Generates a random sample of k elements, without replacement, from a given source array.
-
sampleReservoir(float[], int, float[]) - Static method in class org.cicirello.sequences.SequenceSampler
-
-
Generates a random sample of k elements, without replacement, from a - given source array.
-
-
sampleReservoir(T[], int, T[]) - Static method in class org.cicirello.sequences.SequenceSampler
-
-
Generates a random sample of k elements, without replacement, from a - given source array.
-
-
scramble() - Method in class org.cicirello.permutations.Permutation
+
scramble() - Method in class org.cicirello.permutations.Permutation
Randomly shuffles the permutation.
-
scramble(Random) - Method in class org.cicirello.permutations.Permutation
+
scramble(boolean) - Method in class org.cicirello.permutations.Permutation
Randomly shuffles the permutation.
-
scramble(SplittableRandom) - Method in class org.cicirello.permutations.Permutation
+
scramble(int, int) - Method in class org.cicirello.permutations.Permutation
-
Randomly shuffles the permutation.
+
Randomly shuffles a segment.
-
scramble(boolean) - Method in class org.cicirello.permutations.Permutation
+
scramble(int, int, Random) - Method in class org.cicirello.permutations.Permutation
-
Randomly shuffles the permutation.
+
Randomly shuffles a segment.
-
scramble(Random, boolean) - Method in class org.cicirello.permutations.Permutation
+
scramble(int, int, SplittableRandom) - Method in class org.cicirello.permutations.Permutation
-
Randomly shuffles the permutation.
+
Randomly shuffles a segment.
-
scramble(SplittableRandom, boolean) - Method in class org.cicirello.permutations.Permutation
+
scramble(Random) - Method in class org.cicirello.permutations.Permutation
Randomly shuffles the permutation.
-
scramble(int, int) - Method in class org.cicirello.permutations.Permutation
+
scramble(Random, boolean) - Method in class org.cicirello.permutations.Permutation
-
Randomly shuffles a segment.
+
Randomly shuffles the permutation.
-
scramble(int, int, Random) - Method in class org.cicirello.permutations.Permutation
+
scramble(SplittableRandom) - Method in class org.cicirello.permutations.Permutation
-
Randomly shuffles a segment.
+
Randomly shuffles the permutation.
-
scramble(int, int, SplittableRandom) - Method in class org.cicirello.permutations.Permutation
+
scramble(SplittableRandom, boolean) - Method in class org.cicirello.permutations.Permutation
-
Randomly shuffles a segment.
+
Randomly shuffles the permutation.
ScrambleDistance - Class in org.cicirello.permutations.distance
Scramble Distance:
-
ScrambleDistance() - Constructor for class org.cicirello.permutations.distance.ScrambleDistance
+
ScrambleDistance() - Constructor for class org.cicirello.permutations.distance.ScrambleDistance
Constructs the distance measurer as specified in the class documentation.
@@ -1769,28 +1794,28 @@

S

ArraySampler is a class of utility methods related to efficiently generating random samples of array elements, without replacement.
-
set(Permutation, int[]) - Method in class org.cicirello.permutations.Permutation.Mechanic
+
set(int[]) - Method in class org.cicirello.permutations.Permutation
+
+
Changes the state of this permutation to be identical to the elements of an array.
+
+
set(Permutation, int[]) - Method in class org.cicirello.permutations.Permutation.Mechanic
Changes the state of the Permutation according to the contents of an array of int values.
-
set(Permutation, int, int) - Method in class org.cicirello.permutations.Permutation.Mechanic
+
set(Permutation, int, int) - Method in class org.cicirello.permutations.Permutation.Mechanic
Changes the integer in one specific location of a Permutation.
-
set(Permutation, int, int[]) - Method in class org.cicirello.permutations.Permutation.Mechanic
+
set(Permutation, int, int[]) - Method in class org.cicirello.permutations.Permutation.Mechanic
Changes a range of permutation elements.
-
set(int[]) - Method in class org.cicirello.permutations.Permutation
-
-
Changes the state of this permutation to be identical to the elements of an array.
-
SquaredDeviationDistance - Class in org.cicirello.permutations.distance
Squared Deviation Distance:
-
SquaredDeviationDistance() - Constructor for class org.cicirello.permutations.distance.SquaredDeviationDistance
+
SquaredDeviationDistance() - Constructor for class org.cicirello.permutations.distance.SquaredDeviationDistance
Constructs the distance measurer as specified in the class documentation.
@@ -1798,116 +1823,119 @@

S

Utility class of basic statistics.
-
sum(int[][], int[][], int[][]) - Static method in class org.cicirello.math.la.MatrixOps
+
sum(double[][], double[][]) - Static method in class org.cicirello.math.la.MatrixOps
Computes C = A + B.
-
sum(double[][], double[][], double[][]) - Static method in class org.cicirello.math.la.MatrixOps
+
sum(double[][], double[][], double[][]) - Static method in class org.cicirello.math.la.MatrixOps
Computes C = A + B.
-
sum(int[][], int[][]) - Static method in class org.cicirello.math.la.MatrixOps
+
sum(int[][], int[][]) - Static method in class org.cicirello.math.la.MatrixOps
Computes C = A + B.
-
sum(double[][], double[][]) - Static method in class org.cicirello.math.la.MatrixOps
+
sum(int[][], int[][], int[][]) - Static method in class org.cicirello.math.la.MatrixOps
Computes C = A + B.
-
swap(int, int) - Method in class org.cicirello.permutations.Permutation
+
swap(int, int) - Method in class org.cicirello.permutations.Permutation
Swaps 2 integers in the permutation.
-
swapBlocks(int, int, int, int) - Method in class org.cicirello.permutations.Permutation
+
swapBlocks(int, int, int, int) - Method in class org.cicirello.permutations.Permutation
Swaps 2 non-overlapping blocks, where a block is a subsequence.
- +

T

-
toArray() - Method in class org.cicirello.permutations.Permutation
+
toArray() - Method in class org.cicirello.permutations.Permutation
Generates an array of int values from the interval [0, n) in the same order that they occur in this Permutation.
-
toArray(int[]) - Method in class org.cicirello.permutations.Permutation
+
toArray(int[]) - Method in class org.cicirello.permutations.Permutation
Generates an array of int values from the interval [0, n) in the same order that they occur in this Permutation.
-
toBigInteger() - Method in class org.cicirello.permutations.Permutation
+
toBigInteger() - Method in class org.cicirello.permutations.Permutation
Generates a unique integer representing the permutation.
-
toInteger() - Method in class org.cicirello.permutations.Permutation
+
toInteger() - Method in class org.cicirello.permutations.Permutation
Generates a unique integer representing the permutation.
-
toString() - Method in class org.cicirello.permutations.Permutation
+
toString() - Method in class org.cicirello.permutations.Permutation
Creates a String representing the permutation.
-
transposeSquareMatrixInline(int[][]) - Static method in class org.cicirello.math.la.MatrixOps
+
transposeSquareMatrixInline(double[][]) - Static method in class org.cicirello.math.la.MatrixOps
Transpose a square matrix inline.
-
transposeSquareMatrixInline(double[][]) - Static method in class org.cicirello.math.la.MatrixOps
+
transposeSquareMatrixInline(int[][]) - Static method in class org.cicirello.math.la.MatrixOps
Transpose a square matrix inline.
-
tTestUnequalVariances(double[], double[]) - Static method in class org.cicirello.math.stats.Statistics
+
tTestUnequalVariances(double[], double[]) - Static method in class org.cicirello.math.stats.Statistics
Welch's t-test, also known as t-test with unequal variances.
-
tTestUnequalVariances(int[], int[]) - Static method in class org.cicirello.math.stats.Statistics
+
tTestUnequalVariances(int[], int[]) - Static method in class org.cicirello.math.stats.Statistics
Welch's t-test, also known as t-test with unequal variances.
-
tTestWelch(double[], double[]) - Static method in class org.cicirello.math.stats.Statistics
+
tTestWelch(double[], double[]) - Static method in class org.cicirello.math.stats.Statistics
Welch's t-test, also known as t-test with unequal variances.
-
tTestWelch(int[], int[]) - Static method in class org.cicirello.math.stats.Statistics
+
tTestWelch(int[], int[]) - Static method in class org.cicirello.math.stats.Statistics
Welch's t-test, also known as t-test with unequal variances.
- +

V

-
variance(int[]) - Static method in class org.cicirello.math.stats.Statistics
+
variance(double[]) - Static method in class org.cicirello.math.stats.Statistics
Computes variance of a population.
-
variance(double[]) - Static method in class org.cicirello.math.stats.Statistics
+
variance(int[]) - Static method in class org.cicirello.math.stats.Statistics
Computes variance of a population.
-
varianceSample(int[]) - Static method in class org.cicirello.math.stats.Statistics
+
varianceSample(double[]) - Static method in class org.cicirello.math.stats.Statistics
Computes variance of a sample.
-
varianceSample(double[]) - Static method in class org.cicirello.math.stats.Statistics
+
varianceSample(int[]) - Static method in class org.cicirello.math.stats.Statistics
Computes variance of a sample.
-A B C D E G H I J K L M N O P R S T V  +A B C D E G H I J K L M N O P R S T V 
All Classes All Packages +
+ diff --git a/docs/api/index.html b/docs/api/index.html index 4b4978c1..f9de351a 100644 --- a/docs/api/index.html +++ b/docs/api/index.html @@ -1,74 +1,228 @@ - + -JavaPermutationTools - A Java API for computation on permutations - + + + + + + + + + + +
+ +
+
+

JavaPermutationTools - A Java API for computation on permutations

+
+
+
+

The JavaPermutationTools (JPT) API provides Java classes for computation on +permutations and sequences. The current release enables representing +and generating permutations, implementations of a variety of permutation +distance metrics, as well as sequence distance metrics. The sequence distance +metrics support computing the distance between pairs of Strings, arrays of primitive values, +as well as arrays of objects. More computation on permutations +will be added in later releases.

+

The source code repository +is hosted on GitHub, and includes the source code, example programs, as well as programs +that reproduce results from published research papers that have either used this API or +earlier unreleased versions of it. The source code is licensed under the +GNU General Public License Version 3 (GPLv3).

+

For more information see the JavaPermutationTools website. +Potential contributors, please see the source repository, and/or +contact Vincent A. Cicirello.

+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Packages 
PackageDescription
org.cicirello.math +
Collection of classes related to a variety of mathematical concepts.
+
org.cicirello.math.la +
Collection of classes related to linear algebra.
+
org.cicirello.math.rand +
Collection of classes related to random number generation.
+
org.cicirello.math.stats +
Collection of classes related to statistics.
+
org.cicirello.permutations +
Collection of classes related to representing and manipulating permutations.
+
org.cicirello.permutations.distance +
Implementations of a variety of permutation distance measures.
+
org.cicirello.sequences +
Classes that perform a variety of operations on sequences (such as arrays, etc).
+
org.cicirello.sequences.distance +
Implementations of distance measures for general sequences of various forms, including Strings, arrays of primitive types, arrays of objects, etc.
+
org.cicirello.util +
This package includes classes and interfaces that serve some useful utility purpose.
+
+
+
+
+ +

Copyright © 2005-2019 Vincent A. Cicirello. https://www.cicirello.org/

+
+ diff --git a/docs/api/jquery/external/jquery/jquery.js b/docs/api/jquery/external/jquery/jquery.js new file mode 100644 index 00000000..9b5206bc --- /dev/null +++ b/docs/api/jquery/external/jquery/jquery.js @@ -0,0 +1,10364 @@ +/*! + * jQuery JavaScript Library v3.3.1 + * https://jquery.com/ + * + * Includes Sizzle.js + * https://sizzlejs.com/ + * + * Copyright JS Foundation and other contributors + * Released under the MIT license + * https://jquery.org/license + * + * Date: 2018-01-20T17:24Z + */ +( 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 document = window.document; + +var getProto = Object.getPrototypeOf; + +var slice = arr.slice; + +var concat = arr.concat; + +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. + return typeof obj === "function" && typeof obj.nodeType !== "number"; + }; + + +var isWindow = function isWindow( obj ) { + return obj != null && obj === obj.window; + }; + + + + + var preservedScriptAttributes = { + type: true, + src: true, + noModule: true + }; + + function DOMEval( code, doc, node ) { + doc = doc || document; + + var i, + script = doc.createElement( "script" ); + + script.text = code; + if ( node ) { + for ( i in preservedScriptAttributes ) { + if ( node[ i ] ) { + script[ i ] = node[ i ]; + } + } + } + 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.3.1", + + // 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 ); + }, + + // Support: Android <=4.0 only + // Make sure we trim BOM and NBSP + rtrim = /^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g; + +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 ); + }, + + 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 ) { + src = target[ name ]; + copy = options[ name ]; + + // Prevent never-ending loop + if ( target === copy ) { + continue; + } + + // Recurse if we're merging plain objects or arrays + if ( deep && copy && ( jQuery.isPlainObject( copy ) || + ( copyIsArray = Array.isArray( copy ) ) ) ) { + + if ( copyIsArray ) { + copyIsArray = false; + clone = src && Array.isArray( src ) ? src : []; + + } else { + clone = src && jQuery.isPlainObject( src ) ? src : {}; + } + + // 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 ) { + + /* eslint-disable no-unused-vars */ + // See https://github.com/eslint/eslint/issues/6125 + var name; + + for ( name in obj ) { + return false; + } + return true; + }, + + // Evaluates a script in a global context + globalEval: function( code ) { + DOMEval( code ); + }, + + 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; + }, + + // Support: Android <=4.0 only + trim: function( text ) { + return text == null ? + "" : + ( text + "" ).replace( rtrim, "" ); + }, + + // 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 concat.apply( [], 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.3 + * https://sizzlejs.com/ + * + * Copyright jQuery Foundation and other contributors + * Released under the MIT license + * http://jquery.org/license + * + * Date: 2016-08-08 + */ +(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(), + sortOrder = function( a, b ) { + if ( a === b ) { + hasDuplicate = true; + } + return 0; + }, + + // Instance methods + hasOwn = ({}).hasOwnProperty, + arr = [], + pop = arr.pop, + push_native = 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]", + + // http://www.w3.org/TR/CSS21/syndata.html#value-def-identifier + identifier = "(?:\\\\.|[\\w-]|[^\0-\\xa0])+", + + // 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 + "*" ), + + rattributeQuotes = new RegExp( "=" + whitespace + "*([^\\]'\"]*?)" + whitespace + "*\\]", "g" ), + + 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" ) + }, + + 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-f]{1,6}" + whitespace + "?|(" + whitespace + ")|.)", "ig" ), + funescape = function( _, escaped, escapedWhitespace ) { + var high = "0x" + escaped - 0x10000; + // NaN means non-codepoint + // Support: Firefox<24 + // Workaround erroneous numeric interpretation of +"0x" + return high !== high || escapedWhitespace ? + escaped : + high < 0 ? + // BMP codepoint + String.fromCharCode( high + 0x10000 ) : + // Supplemental Plane codepoint (surrogate pair) + 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(); + }, + + disabledAncestor = addCombinator( + function( elem ) { + return elem.disabled === true && ("form" in elem || "label" in elem); + }, + { 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 + arr[ preferredDoc.childNodes.length ].nodeType; +} catch ( e ) { + push = { apply: arr.length ? + + // Leverage slice if possible + function( target, els ) { + push_native.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 ) { + + if ( ( context ? context.ownerDocument || context : preferredDoc ) !== document ) { + 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 && + !compilerCache[ selector + " " ] && + (!rbuggyQSA || !rbuggyQSA.test( selector )) ) { + + if ( nodeType !== 1 ) { + newContext = context; + newSelector = selector; + + // qSA looks outside Element context, which is not what we want + // Thanks to Andrew Dupont for this workaround technique + // Support: IE <=8 + // Exclude object elements + } else if ( context.nodeName.toLowerCase() !== "object" ) { + + // 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 + " " + toSelector( groups[i] ); + } + newSelector = groups.join( "," ); + + // Expand context for sibling selectors + newContext = rsibling.test( selector ) && testContext( context.parentNode ) || + context; + } + + if ( newSelector ) { + try { + push.apply( results, + newContext.querySelectorAll( newSelector ) + ); + return results; + } catch ( qsaError ) { + } 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 && + disabledAncestor( 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 ) { + // documentElement is verified for cases where it doesn't yet exist + // (such as loading iframes in IE - #4833) + var documentElement = elem && (elem.ownerDocument || elem).documentElement; + return documentElement ? documentElement.nodeName !== "HTML" : false; +}; + +/** + * 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 + 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 + // Accessing iframe documents after unload throws "permission denied" errors (jQuery #13936) + 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 ); + } + } + + /* 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 ) { + // 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("~="); + } + + // 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(".#.+[+~]"); + } + }); + + 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" ); + } + + // 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 + 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 + if ( a === document || a.ownerDocument === preferredDoc && contains(preferredDoc, a) ) { + return -1; + } + 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 ) { + return a === document ? -1 : + b === document ? 1 : + 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 + ap[i] === preferredDoc ? -1 : + bp[i] === preferredDoc ? 1 : + 0; + }; + + return document; +}; + +Sizzle.matches = function( expr, elements ) { + return Sizzle( expr, null, null, elements ); +}; + +Sizzle.matchesSelector = function( elem, expr ) { + // Set document vars if needed + if ( ( elem.ownerDocument || elem ) !== document ) { + setDocument( elem ); + } + + // Make sure that attribute selectors are quoted + expr = expr.replace( rattributeQuotes, "='$1']" ); + + if ( support.matchesSelector && documentIsHTML && + !compilerCache[ 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) {} + } + + return Sizzle( expr, document, null, [ elem ] ).length > 0; +}; + +Sizzle.contains = function( context, elem ) { + // Set document vars if needed + if ( ( context.ownerDocument || context ) !== document ) { + setDocument( context ); + } + return contains( context, elem ); +}; + +Sizzle.attr = function( elem, name ) { + // Set document vars if needed + 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 += ""; + + 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; + }; + }, + + "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 || elem.innerText || 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 ) { + 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; + 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 ) { + 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; + 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 ( nodeName( elem, "iframe" ) ) { + 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 master Deferred + master = 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 ) ) { + master.resolveWith( resolveContexts, resolveValues ); + } + }; + }; + + // Single- and empty arguments are adopted like Promise.resolve + if ( remaining <= 1 ) { + adoptValue( singleValue, master.done( updateFunc( i ) ).resolve, master.reject, + !remaining ); + + // Use .then() to unwrap secondary thenables (cf. gh-3000) + if ( master.state() === "pending" || + isFunction( resolveValues[ i ] && resolveValues[ i ].then ) ) { + + return master.then(); + } + } + + // Multiple arguments are aggregated like Promise.all array elements + while ( i-- ) { + adoptValue( resolveValues[ i ], updateFunc( i ), master.reject ); + } + + return master.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 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. + jQuery.contains( elem.ownerDocument, elem ) && + + jQuery.css( elem, "display" ) === "none"; + }; + +var swap = function( elem, options, callback, args ) { + 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.apply( elem, args || [] ); + + // Revert the old values + for ( name in options ) { + elem.style[ name ] = old[ name ]; + } + + return ret; +}; + + + + +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 = ( 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 ); + + + +// We have to close these tags to support XHTML (#13200) +var wrapMap = { + + // Support: IE <=9 only + option: [ 1, "" ], + + // 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, "", "" ] +}; + +// Support: IE <=9 only +wrapMap.optgroup = wrapMap.option; + +wrapMap.tbody = wrapMap.tfoot = wrapMap.colgroup = wrapMap.caption = wrapMap.thead; +wrapMap.th = wrapMap.td; + + +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, contains, 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; + } + + contains = jQuery.contains( elem.ownerDocument, elem ); + + // Append to fragment + tmp = getAll( fragment.appendChild( elem ), "script" ); + + // Preserve script evaluation history + if ( contains ) { + setGlobalEval( tmp ); + } + + // Capture executables + if ( scripts ) { + j = 0; + while ( ( elem = tmp[ j++ ] ) ) { + if ( rscriptType.test( elem.type || "" ) ) { + scripts.push( elem ); + } + } + } + } + + return fragment; +} + + +( 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; +} )(); +var documentElement = document.documentElement; + + + +var + rkeyEvent = /^key/, + rmouseEvent = /^(?:mouse|pointer|contextmenu|drag|drop)|click/, + rtypenamespace = /^([^.]*)(?:\.(.+)|)/; + +function returnTrue() { + return true; +} + +function returnFalse() { + return false; +} + +// Support: IE <=9 only +// See #13393 for more info +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 ); + + // Don't attach events to noData or text/comment nodes (but allow plain objects) + if ( !elemData ) { + 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 = {}; + } + 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 ) { + + // Make a writable jQuery.Event from the native event object + var event = jQuery.event.fix( nativeEvent ); + + var i, j, ret, matched, handleObj, handlerQueue, + args = new Array( arguments.length ), + handlers = ( dataPriv.get( this, "events" ) || {} )[ 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() ) { + + // Triggered event must either 1) have no namespace, or 2) have namespace(s) + // a subset or equal to those in the bound event (both can have no namespace). + if ( !event.rnamespace || 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 + }, + focus: { + + // Fire native event if possible so blur/focus sequence is correct + trigger: function() { + if ( this !== safeActiveElement() && this.focus ) { + this.focus(); + return false; + } + }, + delegateType: "focusin" + }, + blur: { + trigger: function() { + if ( this === safeActiveElement() && this.blur ) { + this.blur(); + return false; + } + }, + delegateType: "focusout" + }, + click: { + + // For checkbox, fire native event so checked state will be right + trigger: function() { + if ( this.type === "checkbox" && this.click && nodeName( this, "input" ) ) { + this.click(); + return false; + } + }, + + // For cross-browser consistency, don't fire native .click() on links + _default: function( event ) { + return nodeName( event.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; + } + } + } + } +}; + +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, + 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: function( event ) { + var button = event.button; + + // Add which for key events + if ( event.which == null && rkeyEvent.test( event.type ) ) { + return event.charCode != null ? event.charCode : event.keyCode; + } + + // Add which for click: 1 === left; 2 === middle; 3 === right + if ( !event.which && button !== undefined && rmouseEvent.test( event.type ) ) { + if ( button & 1 ) { + return 1; + } + + if ( button & 2 ) { + return 3; + } + + if ( button & 4 ) { + return 2; + } + + return 0; + } + + return event.which; + } +}, jQuery.event.addProp ); + +// 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 + + /* eslint-disable max-len */ + + // See https://github.com/eslint/eslint/issues/3229 + rxhtmlTag = /<(?!area|br|col|embed|hr|img|input|link|meta|param)(([a-z][^\/\0>\x20\t\r\n\f]*)[^>]*)\/>/gi, + + /* eslint-enable */ + + // 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, pdataCur, udataOld, udataCur, events; + + if ( dest.nodeType !== 1 ) { + return; + } + + // 1. Copy private data: events, handlers, etc. + if ( dataPriv.hasData( src ) ) { + pdataOld = dataPriv.access( src ); + pdataCur = dataPriv.set( dest, pdataOld ); + events = pdataOld.events; + + if ( events ) { + delete pdataCur.handle; + pdataCur.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 = concat.apply( [], 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 ) { + jQuery._evalUrl( node.src ); + } + } else { + DOMEval( node.textContent.replace( rcleanScript, "" ), doc, node ); + } + } + } + } + } + } + + 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 && jQuery.contains( node.ownerDocument, node ) ) { + setGlobalEval( getAll( node, "script" ) ); + } + node.parentNode.removeChild( node ); + } + } + + return elem; +} + +jQuery.extend( { + htmlPrefilter: function( html ) { + return html.replace( rxhtmlTag, "<$1>" ); + }, + + clone: function( elem, dataAndEvents, deepDataAndEvents ) { + var i, l, srcElements, destElements, + clone = elem.cloneNode( true ), + inPage = jQuery.contains( elem.ownerDocument, 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 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) + div.style.position = "absolute"; + scrollboxSizeVal = div.offsetWidth === 36 || "absolute"; + + 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, + 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; + } + } ); +} )(); + + +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 === "" && !jQuery.contains( elem.ownerDocument, 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 + + // 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" + }, + + cssPrefixes = [ "Webkit", "Moz", "ms" ], + emptyStyle = document.createElement( "div" ).style; + +// Return a css property mapped to a potentially vendor prefixed property +function vendorPropName( name ) { + + // Shortcut for names that are not vendor prefixed + if ( name in emptyStyle ) { + return 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 property mapped along what jQuery.cssProps suggests or to +// a vendor prefixed property. +function finalPropName( name ) { + var ret = jQuery.cssProps[ name ]; + if ( !ret ) { + ret = jQuery.cssProps[ name ] = vendorPropName( name ) || name; + } + return ret; +} + +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 + ) ); + } + + return delta; +} + +function getWidthOrHeight( elem, dimension, extra ) { + + // Start with computed style + var styles = getStyles( elem ), + val = curCSS( elem, dimension, styles ), + isBorderBox = jQuery.css( elem, "boxSizing", false, styles ) === "border-box", + valueIsBorderBox = isBorderBox; + + // Support: Firefox <=54 + // Return a confounding non-pixel value or feign ignorance, as appropriate. + if ( rnumnonpx.test( val ) ) { + if ( !extra ) { + return val; + } + val = "auto"; + } + + // Check for style in case a browser which returns unreliable values + // for getComputedStyle silently falls back to the reliable elem.style + valueIsBorderBox = valueIsBorderBox && + ( support.boxSizingReliable() || val === elem.style[ dimension ] ); + + // Fall back to offsetWidth/offsetHeight when value is "auto" + // This happens for inline elements with no explicit setting (gh-3571) + // Support: Android <=4.1 - 4.3 only + // Also use offsetWidth/offsetHeight for misreported inline dimensions (gh-3602) + if ( val === "auto" || + !parseFloat( val ) && jQuery.css( elem, "display", false, styles ) === "inline" ) { + + val = elem[ "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ) ]; + + // offsetWidth/offsetHeight provide border-box values + valueIsBorderBox = true; + } + + // 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, + "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) + if ( type === "number" ) { + 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 ), + isBorderBox = jQuery.css( elem, "boxSizing", false, styles ) === "border-box", + subtract = extra && boxModelAdjustment( + elem, + dimension, + extra, + isBorderBox, + styles + ); + + // 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 && support.scrollboxSize() === styles.position ) { + 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 && + ( tween.elem.style[ jQuery.cssProps[ tween.prop ] ] != null || + jQuery.cssHooks[ tween.prop ] ) ) { + 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 && type !== false ) { + 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" ) || {} )[ 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() { + var doc = this.ownerDocument || 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, + 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 = Date.now(); + +var rquery = ( /\?/ ); + + + +// Cross-browser xml parsing +jQuery.parseXML = function( data ) { + var xml; + 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 ) { + xml = undefined; + } + + if ( !xml || xml.getElementsByTagName( "parsererror" ).length ) { + jQuery.error( "Invalid XML: " + 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 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() ] = match[ 2 ]; + } + } + match = responseHeaders[ key.toLowerCase() ]; + } + return match == null ? null : match; + }, + + // 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++ ) + 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 ); + } + + // 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._evalUrl = function( url ) { + 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, + "throws": true + } ); +}; + + +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 requests + if ( s.crossDomain ) { + var script, callback; + return { + send: function( _, complete ) { + script = jQuery( "\r\n"; + +// inject VBScript +document.write(IEBinaryToArray_ByteStr_Script); + +global.JSZipUtils._getBinaryFromXHR = function (xhr) { + var binary = xhr.responseBody; + var byteMapping = {}; + for ( var i = 0; i < 256; i++ ) { + for ( var j = 0; j < 256; j++ ) { + byteMapping[ String.fromCharCode( i + (j << 8) ) ] = + String.fromCharCode(i) + String.fromCharCode(j); + } + } + var rawBytes = IEBinaryToArray_ByteStr(binary); + var lastChr = IEBinaryToArray_ByteStr_Last(binary); + return rawBytes.replace(/[\s\S]/g, function( match ) { + return byteMapping[match]; + }) + lastChr; +}; + +// enforcing Stuk's coding style +// vim: set shiftwidth=4 softtabstop=4: + +},{}]},{},[1]) +; diff --git a/docs/api/jquery/jszip-utils/dist/jszip-utils-ie.min.js b/docs/api/jquery/jszip-utils/dist/jszip-utils-ie.min.js new file mode 100644 index 00000000..93d8bc8e --- /dev/null +++ b/docs/api/jquery/jszip-utils/dist/jszip-utils-ie.min.js @@ -0,0 +1,10 @@ +/*! + +JSZipUtils - A collection of cross-browser utilities to go along with JSZip. + + +(c) 2014 Stuart Knightley, David Duponchel +Dual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/jszip-utils/master/LICENSE.markdown. + +*/ +!function a(b,c,d){function e(g,h){if(!c[g]){if(!b[g]){var i="function"==typeof require&&require;if(!h&&i)return i(g,!0);if(f)return f(g,!0);throw new Error("Cannot find module '"+g+"'")}var j=c[g]={exports:{}};b[g][0].call(j.exports,function(a){var c=b[g][1][a];return e(c?c:a)},j,j.exports,a,b,c,d)}return c[g].exports}for(var f="function"==typeof require&&require,g=0;g\r\n";document.write(b),a.JSZipUtils._getBinaryFromXHR=function(a){for(var b=a.responseBody,c={},d=0;256>d;d++)for(var e=0;256>e;e++)c[String.fromCharCode(d+(e<<8))]=String.fromCharCode(d)+String.fromCharCode(e);var f=IEBinaryToArray_ByteStr(b),g=IEBinaryToArray_ByteStr_Last(b);return f.replace(/[\s\S]/g,function(a){return c[a]})+g}},{}]},{},[1]); diff --git a/docs/api/jquery/jszip-utils/dist/jszip-utils.js b/docs/api/jquery/jszip-utils/dist/jszip-utils.js new file mode 100644 index 00000000..775895ec --- /dev/null +++ b/docs/api/jquery/jszip-utils/dist/jszip-utils.js @@ -0,0 +1,118 @@ +/*! + +JSZipUtils - A collection of cross-browser utilities to go along with JSZip. + + +(c) 2014 Stuart Knightley, David Duponchel +Dual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/jszip-utils/master/LICENSE.markdown. + +*/ +!function(e){"object"==typeof exports?module.exports=e():"function"==typeof define&&define.amd?define(e):"undefined"!=typeof window?window.JSZipUtils=e():"undefined"!=typeof global?global.JSZipUtils=e():"undefined"!=typeof self&&(self.JSZipUtils=e())}(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);throw new Error("Cannot find module '"+o+"'")}var f=n[o]={exports:{}};t[o][0].call(f.exports,function(e){var n=t[o][1][e];return s(n?n:e)},f,f.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o + +(c) 2014 Stuart Knightley, David Duponchel +Dual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/jszip-utils/master/LICENSE.markdown. + +*/ +!function(a){"object"==typeof exports?module.exports=a():"function"==typeof define&&define.amd?define(a):"undefined"!=typeof window?window.JSZipUtils=a():"undefined"!=typeof global?global.JSZipUtils=a():"undefined"!=typeof self&&(self.JSZipUtils=a())}(function(){return function a(b,c,d){function e(g,h){if(!c[g]){if(!b[g]){var i="function"==typeof require&&require;if(!h&&i)return i(g,!0);if(f)return f(g,!0);throw new Error("Cannot find module '"+g+"'")}var j=c[g]={exports:{}};b[g][0].call(j.exports,function(a){var c=b[g][1][a];return e(c?c:a)},j,j.exports,a,b,c,d)}return c[g].exports}for(var f="function"==typeof require&&require,g=0;g + +(c) 2009-2016 Stuart Knightley +Dual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/jszip/master/LICENSE.markdown. + +JSZip uses the library pako released under the MIT license : +https://github.com/nodeca/pako/blob/master/LICENSE +*/ + +(function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}g.JSZip = f()}})(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o> 2; + enc2 = ((chr1 & 3) << 4) | (chr2 >> 4); + enc3 = remainingBytes > 1 ? (((chr2 & 15) << 2) | (chr3 >> 6)) : 64; + enc4 = remainingBytes > 2 ? (chr3 & 63) : 64; + + output.push(_keyStr.charAt(enc1) + _keyStr.charAt(enc2) + _keyStr.charAt(enc3) + _keyStr.charAt(enc4)); + + } + + return output.join(""); +}; + +// public method for decoding +exports.decode = function(input) { + var chr1, chr2, chr3; + var enc1, enc2, enc3, enc4; + var i = 0, resultIndex = 0; + + var dataUrlPrefix = "data:"; + + if (input.substr(0, dataUrlPrefix.length) === dataUrlPrefix) { + // This is a common error: people give a data url + // (data:image/png;base64,iVBOR...) with a {base64: true} and + // wonders why things don't work. + // We can detect that the string input looks like a data url but we + // *can't* be sure it is one: removing everything up to the comma would + // be too dangerous. + throw new Error("Invalid base64 input, it looks like a data url."); + } + + input = input.replace(/[^A-Za-z0-9\+\/\=]/g, ""); + + var totalLength = input.length * 3 / 4; + if(input.charAt(input.length - 1) === _keyStr.charAt(64)) { + totalLength--; + } + if(input.charAt(input.length - 2) === _keyStr.charAt(64)) { + totalLength--; + } + if (totalLength % 1 !== 0) { + // totalLength is not an integer, the length does not match a valid + // base64 content. That can happen if: + // - the input is not a base64 content + // - the input is *almost* a base64 content, with a extra chars at the + // beginning or at the end + // - the input uses a base64 variant (base64url for example) + throw new Error("Invalid base64 input, bad content length."); + } + var output; + if (support.uint8array) { + output = new Uint8Array(totalLength|0); + } else { + output = new Array(totalLength|0); + } + + while (i < input.length) { + + enc1 = _keyStr.indexOf(input.charAt(i++)); + enc2 = _keyStr.indexOf(input.charAt(i++)); + enc3 = _keyStr.indexOf(input.charAt(i++)); + enc4 = _keyStr.indexOf(input.charAt(i++)); + + chr1 = (enc1 << 2) | (enc2 >> 4); + chr2 = ((enc2 & 15) << 4) | (enc3 >> 2); + chr3 = ((enc3 & 3) << 6) | enc4; + + output[resultIndex++] = chr1; + + if (enc3 !== 64) { + output[resultIndex++] = chr2; + } + if (enc4 !== 64) { + output[resultIndex++] = chr3; + } + + } + + return output; +}; + +},{"./support":30,"./utils":32}],2:[function(require,module,exports){ +'use strict'; + +var external = require("./external"); +var DataWorker = require('./stream/DataWorker'); +var DataLengthProbe = require('./stream/DataLengthProbe'); +var Crc32Probe = require('./stream/Crc32Probe'); +var DataLengthProbe = require('./stream/DataLengthProbe'); + +/** + * Represent a compressed object, with everything needed to decompress it. + * @constructor + * @param {number} compressedSize the size of the data compressed. + * @param {number} uncompressedSize the size of the data after decompression. + * @param {number} crc32 the crc32 of the decompressed file. + * @param {object} compression the type of compression, see lib/compressions.js. + * @param {String|ArrayBuffer|Uint8Array|Buffer} data the compressed data. + */ +function CompressedObject(compressedSize, uncompressedSize, crc32, compression, data) { + this.compressedSize = compressedSize; + this.uncompressedSize = uncompressedSize; + this.crc32 = crc32; + this.compression = compression; + this.compressedContent = data; +} + +CompressedObject.prototype = { + /** + * Create a worker to get the uncompressed content. + * @return {GenericWorker} the worker. + */ + getContentWorker : function () { + var worker = new DataWorker(external.Promise.resolve(this.compressedContent)) + .pipe(this.compression.uncompressWorker()) + .pipe(new DataLengthProbe("data_length")); + + var that = this; + worker.on("end", function () { + if(this.streamInfo['data_length'] !== that.uncompressedSize) { + throw new Error("Bug : uncompressed data size mismatch"); + } + }); + return worker; + }, + /** + * Create a worker to get the compressed content. + * @return {GenericWorker} the worker. + */ + getCompressedWorker : function () { + return new DataWorker(external.Promise.resolve(this.compressedContent)) + .withStreamInfo("compressedSize", this.compressedSize) + .withStreamInfo("uncompressedSize", this.uncompressedSize) + .withStreamInfo("crc32", this.crc32) + .withStreamInfo("compression", this.compression) + ; + } +}; + +/** + * Chain the given worker with other workers to compress the content with the + * given compresion. + * @param {GenericWorker} uncompressedWorker the worker to pipe. + * @param {Object} compression the compression object. + * @param {Object} compressionOptions the options to use when compressing. + * @return {GenericWorker} the new worker compressing the content. + */ +CompressedObject.createWorkerFrom = function (uncompressedWorker, compression, compressionOptions) { + return uncompressedWorker + .pipe(new Crc32Probe()) + .pipe(new DataLengthProbe("uncompressedSize")) + .pipe(compression.compressWorker(compressionOptions)) + .pipe(new DataLengthProbe("compressedSize")) + .withStreamInfo("compression", compression); +}; + +module.exports = CompressedObject; + +},{"./external":6,"./stream/Crc32Probe":25,"./stream/DataLengthProbe":26,"./stream/DataWorker":27}],3:[function(require,module,exports){ +'use strict'; + +var GenericWorker = require("./stream/GenericWorker"); + +exports.STORE = { + magic: "\x00\x00", + compressWorker : function (compressionOptions) { + return new GenericWorker("STORE compression"); + }, + uncompressWorker : function () { + return new GenericWorker("STORE decompression"); + } +}; +exports.DEFLATE = require('./flate'); + +},{"./flate":7,"./stream/GenericWorker":28}],4:[function(require,module,exports){ +'use strict'; + +var utils = require('./utils'); + +/** + * The following functions come from pako, from pako/lib/zlib/crc32.js + * released under the MIT license, see pako https://github.com/nodeca/pako/ + */ + +// Use ordinary array, since untyped makes no boost here +function makeTable() { + var c, table = []; + + for(var n =0; n < 256; n++){ + c = n; + for(var k =0; k < 8; k++){ + c = ((c&1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1)); + } + table[n] = c; + } + + return table; +} + +// Create table on load. Just 255 signed longs. Not a problem. +var crcTable = makeTable(); + + +function crc32(crc, buf, len, pos) { + var t = crcTable, end = pos + len; + + crc = crc ^ (-1); + + for (var i = pos; i < end; i++ ) { + crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF]; + } + + return (crc ^ (-1)); // >>> 0; +} + +// That's all for the pako functions. + +/** + * Compute the crc32 of a string. + * This is almost the same as the function crc32, but for strings. Using the + * same function for the two use cases leads to horrible performances. + * @param {Number} crc the starting value of the crc. + * @param {String} str the string to use. + * @param {Number} len the length of the string. + * @param {Number} pos the starting position for the crc32 computation. + * @return {Number} the computed crc32. + */ +function crc32str(crc, str, len, pos) { + var t = crcTable, end = pos + len; + + crc = crc ^ (-1); + + for (var i = pos; i < end; i++ ) { + crc = (crc >>> 8) ^ t[(crc ^ str.charCodeAt(i)) & 0xFF]; + } + + return (crc ^ (-1)); // >>> 0; +} + +module.exports = function crc32wrapper(input, crc) { + if (typeof input === "undefined" || !input.length) { + return 0; + } + + var isArray = utils.getTypeOf(input) !== "string"; + + if(isArray) { + return crc32(crc|0, input, input.length, 0); + } else { + return crc32str(crc|0, input, input.length, 0); + } +}; + +},{"./utils":32}],5:[function(require,module,exports){ +'use strict'; +exports.base64 = false; +exports.binary = false; +exports.dir = false; +exports.createFolders = true; +exports.date = null; +exports.compression = null; +exports.compressionOptions = null; +exports.comment = null; +exports.unixPermissions = null; +exports.dosPermissions = null; + +},{}],6:[function(require,module,exports){ +/* global Promise */ +'use strict'; + +// load the global object first: +// - it should be better integrated in the system (unhandledRejection in node) +// - the environment may have a custom Promise implementation (see zone.js) +var ES6Promise = null; +if (typeof Promise !== "undefined") { + ES6Promise = Promise; +} else { + ES6Promise = require("lie"); +} + +/** + * Let the user use/change some implementations. + */ +module.exports = { + Promise: ES6Promise +}; + +},{"lie":37}],7:[function(require,module,exports){ +'use strict'; +var USE_TYPEDARRAY = (typeof Uint8Array !== 'undefined') && (typeof Uint16Array !== 'undefined') && (typeof Uint32Array !== 'undefined'); + +var pako = require("pako"); +var utils = require("./utils"); +var GenericWorker = require("./stream/GenericWorker"); + +var ARRAY_TYPE = USE_TYPEDARRAY ? "uint8array" : "array"; + +exports.magic = "\x08\x00"; + +/** + * Create a worker that uses pako to inflate/deflate. + * @constructor + * @param {String} action the name of the pako function to call : either "Deflate" or "Inflate". + * @param {Object} options the options to use when (de)compressing. + */ +function FlateWorker(action, options) { + GenericWorker.call(this, "FlateWorker/" + action); + + this._pako = null; + this._pakoAction = action; + this._pakoOptions = options; + // the `meta` object from the last chunk received + // this allow this worker to pass around metadata + this.meta = {}; +} + +utils.inherits(FlateWorker, GenericWorker); + +/** + * @see GenericWorker.processChunk + */ +FlateWorker.prototype.processChunk = function (chunk) { + this.meta = chunk.meta; + if (this._pako === null) { + this._createPako(); + } + this._pako.push(utils.transformTo(ARRAY_TYPE, chunk.data), false); +}; + +/** + * @see GenericWorker.flush + */ +FlateWorker.prototype.flush = function () { + GenericWorker.prototype.flush.call(this); + if (this._pako === null) { + this._createPako(); + } + this._pako.push([], true); +}; +/** + * @see GenericWorker.cleanUp + */ +FlateWorker.prototype.cleanUp = function () { + GenericWorker.prototype.cleanUp.call(this); + this._pako = null; +}; + +/** + * Create the _pako object. + * TODO: lazy-loading this object isn't the best solution but it's the + * quickest. The best solution is to lazy-load the worker list. See also the + * issue #446. + */ +FlateWorker.prototype._createPako = function () { + this._pako = new pako[this._pakoAction]({ + raw: true, + level: this._pakoOptions.level || -1 // default compression + }); + var self = this; + this._pako.onData = function(data) { + self.push({ + data : data, + meta : self.meta + }); + }; +}; + +exports.compressWorker = function (compressionOptions) { + return new FlateWorker("Deflate", compressionOptions); +}; +exports.uncompressWorker = function () { + return new FlateWorker("Inflate", {}); +}; + +},{"./stream/GenericWorker":28,"./utils":32,"pako":38}],8:[function(require,module,exports){ +'use strict'; + +var utils = require('../utils'); +var GenericWorker = require('../stream/GenericWorker'); +var utf8 = require('../utf8'); +var crc32 = require('../crc32'); +var signature = require('../signature'); + +/** + * Transform an integer into a string in hexadecimal. + * @private + * @param {number} dec the number to convert. + * @param {number} bytes the number of bytes to generate. + * @returns {string} the result. + */ +var decToHex = function(dec, bytes) { + var hex = "", i; + for (i = 0; i < bytes; i++) { + hex += String.fromCharCode(dec & 0xff); + dec = dec >>> 8; + } + return hex; +}; + +/** + * Generate the UNIX part of the external file attributes. + * @param {Object} unixPermissions the unix permissions or null. + * @param {Boolean} isDir true if the entry is a directory, false otherwise. + * @return {Number} a 32 bit integer. + * + * adapted from http://unix.stackexchange.com/questions/14705/the-zip-formats-external-file-attribute : + * + * TTTTsstrwxrwxrwx0000000000ADVSHR + * ^^^^____________________________ file type, see zipinfo.c (UNX_*) + * ^^^_________________________ setuid, setgid, sticky + * ^^^^^^^^^________________ permissions + * ^^^^^^^^^^______ not used ? + * ^^^^^^ DOS attribute bits : Archive, Directory, Volume label, System file, Hidden, Read only + */ +var generateUnixExternalFileAttr = function (unixPermissions, isDir) { + + var result = unixPermissions; + if (!unixPermissions) { + // I can't use octal values in strict mode, hence the hexa. + // 040775 => 0x41fd + // 0100664 => 0x81b4 + result = isDir ? 0x41fd : 0x81b4; + } + return (result & 0xFFFF) << 16; +}; + +/** + * Generate the DOS part of the external file attributes. + * @param {Object} dosPermissions the dos permissions or null. + * @param {Boolean} isDir true if the entry is a directory, false otherwise. + * @return {Number} a 32 bit integer. + * + * Bit 0 Read-Only + * Bit 1 Hidden + * Bit 2 System + * Bit 3 Volume Label + * Bit 4 Directory + * Bit 5 Archive + */ +var generateDosExternalFileAttr = function (dosPermissions, isDir) { + + // the dir flag is already set for compatibility + return (dosPermissions || 0) & 0x3F; +}; + +/** + * Generate the various parts used in the construction of the final zip file. + * @param {Object} streamInfo the hash with informations about the compressed file. + * @param {Boolean} streamedContent is the content streamed ? + * @param {Boolean} streamingEnded is the stream finished ? + * @param {number} offset the current offset from the start of the zip file. + * @param {String} platform let's pretend we are this platform (change platform dependents fields) + * @param {Function} encodeFileName the function to encode the file name / comment. + * @return {Object} the zip parts. + */ +var generateZipParts = function(streamInfo, streamedContent, streamingEnded, offset, platform, encodeFileName) { + var file = streamInfo['file'], + compression = streamInfo['compression'], + useCustomEncoding = encodeFileName !== utf8.utf8encode, + encodedFileName = utils.transformTo("string", encodeFileName(file.name)), + utfEncodedFileName = utils.transformTo("string", utf8.utf8encode(file.name)), + comment = file.comment, + encodedComment = utils.transformTo("string", encodeFileName(comment)), + utfEncodedComment = utils.transformTo("string", utf8.utf8encode(comment)), + useUTF8ForFileName = utfEncodedFileName.length !== file.name.length, + useUTF8ForComment = utfEncodedComment.length !== comment.length, + dosTime, + dosDate, + extraFields = "", + unicodePathExtraField = "", + unicodeCommentExtraField = "", + dir = file.dir, + date = file.date; + + + var dataInfo = { + crc32 : 0, + compressedSize : 0, + uncompressedSize : 0 + }; + + // if the content is streamed, the sizes/crc32 are only available AFTER + // the end of the stream. + if (!streamedContent || streamingEnded) { + dataInfo.crc32 = streamInfo['crc32']; + dataInfo.compressedSize = streamInfo['compressedSize']; + dataInfo.uncompressedSize = streamInfo['uncompressedSize']; + } + + var bitflag = 0; + if (streamedContent) { + // Bit 3: the sizes/crc32 are set to zero in the local header. + // The correct values are put in the data descriptor immediately + // following the compressed data. + bitflag |= 0x0008; + } + if (!useCustomEncoding && (useUTF8ForFileName || useUTF8ForComment)) { + // Bit 11: Language encoding flag (EFS). + bitflag |= 0x0800; + } + + + var extFileAttr = 0; + var versionMadeBy = 0; + if (dir) { + // dos or unix, we set the dos dir flag + extFileAttr |= 0x00010; + } + if(platform === "UNIX") { + versionMadeBy = 0x031E; // UNIX, version 3.0 + extFileAttr |= generateUnixExternalFileAttr(file.unixPermissions, dir); + } else { // DOS or other, fallback to DOS + versionMadeBy = 0x0014; // DOS, version 2.0 + extFileAttr |= generateDosExternalFileAttr(file.dosPermissions, dir); + } + + // date + // @see http://www.delorie.com/djgpp/doc/rbinter/it/52/13.html + // @see http://www.delorie.com/djgpp/doc/rbinter/it/65/16.html + // @see http://www.delorie.com/djgpp/doc/rbinter/it/66/16.html + + dosTime = date.getUTCHours(); + dosTime = dosTime << 6; + dosTime = dosTime | date.getUTCMinutes(); + dosTime = dosTime << 5; + dosTime = dosTime | date.getUTCSeconds() / 2; + + dosDate = date.getUTCFullYear() - 1980; + dosDate = dosDate << 4; + dosDate = dosDate | (date.getUTCMonth() + 1); + dosDate = dosDate << 5; + dosDate = dosDate | date.getUTCDate(); + + if (useUTF8ForFileName) { + // set the unicode path extra field. unzip needs at least one extra + // field to correctly handle unicode path, so using the path is as good + // as any other information. This could improve the situation with + // other archive managers too. + // This field is usually used without the utf8 flag, with a non + // unicode path in the header (winrar, winzip). This helps (a bit) + // with the messy Windows' default compressed folders feature but + // breaks on p7zip which doesn't seek the unicode path extra field. + // So for now, UTF-8 everywhere ! + unicodePathExtraField = + // Version + decToHex(1, 1) + + // NameCRC32 + decToHex(crc32(encodedFileName), 4) + + // UnicodeName + utfEncodedFileName; + + extraFields += + // Info-ZIP Unicode Path Extra Field + "\x75\x70" + + // size + decToHex(unicodePathExtraField.length, 2) + + // content + unicodePathExtraField; + } + + if(useUTF8ForComment) { + + unicodeCommentExtraField = + // Version + decToHex(1, 1) + + // CommentCRC32 + decToHex(crc32(encodedComment), 4) + + // UnicodeName + utfEncodedComment; + + extraFields += + // Info-ZIP Unicode Path Extra Field + "\x75\x63" + + // size + decToHex(unicodeCommentExtraField.length, 2) + + // content + unicodeCommentExtraField; + } + + var header = ""; + + // version needed to extract + header += "\x0A\x00"; + // general purpose bit flag + header += decToHex(bitflag, 2); + // compression method + header += compression.magic; + // last mod file time + header += decToHex(dosTime, 2); + // last mod file date + header += decToHex(dosDate, 2); + // crc-32 + header += decToHex(dataInfo.crc32, 4); + // compressed size + header += decToHex(dataInfo.compressedSize, 4); + // uncompressed size + header += decToHex(dataInfo.uncompressedSize, 4); + // file name length + header += decToHex(encodedFileName.length, 2); + // extra field length + header += decToHex(extraFields.length, 2); + + + var fileRecord = signature.LOCAL_FILE_HEADER + header + encodedFileName + extraFields; + + var dirRecord = signature.CENTRAL_FILE_HEADER + + // version made by (00: DOS) + decToHex(versionMadeBy, 2) + + // file header (common to file and central directory) + header + + // file comment length + decToHex(encodedComment.length, 2) + + // disk number start + "\x00\x00" + + // internal file attributes TODO + "\x00\x00" + + // external file attributes + decToHex(extFileAttr, 4) + + // relative offset of local header + decToHex(offset, 4) + + // file name + encodedFileName + + // extra field + extraFields + + // file comment + encodedComment; + + return { + fileRecord: fileRecord, + dirRecord: dirRecord + }; +}; + +/** + * Generate the EOCD record. + * @param {Number} entriesCount the number of entries in the zip file. + * @param {Number} centralDirLength the length (in bytes) of the central dir. + * @param {Number} localDirLength the length (in bytes) of the local dir. + * @param {String} comment the zip file comment as a binary string. + * @param {Function} encodeFileName the function to encode the comment. + * @return {String} the EOCD record. + */ +var generateCentralDirectoryEnd = function (entriesCount, centralDirLength, localDirLength, comment, encodeFileName) { + var dirEnd = ""; + var encodedComment = utils.transformTo("string", encodeFileName(comment)); + + // end of central dir signature + dirEnd = signature.CENTRAL_DIRECTORY_END + + // number of this disk + "\x00\x00" + + // number of the disk with the start of the central directory + "\x00\x00" + + // total number of entries in the central directory on this disk + decToHex(entriesCount, 2) + + // total number of entries in the central directory + decToHex(entriesCount, 2) + + // size of the central directory 4 bytes + decToHex(centralDirLength, 4) + + // offset of start of central directory with respect to the starting disk number + decToHex(localDirLength, 4) + + // .ZIP file comment length + decToHex(encodedComment.length, 2) + + // .ZIP file comment + encodedComment; + + return dirEnd; +}; + +/** + * Generate data descriptors for a file entry. + * @param {Object} streamInfo the hash generated by a worker, containing informations + * on the file entry. + * @return {String} the data descriptors. + */ +var generateDataDescriptors = function (streamInfo) { + var descriptor = ""; + descriptor = signature.DATA_DESCRIPTOR + + // crc-32 4 bytes + decToHex(streamInfo['crc32'], 4) + + // compressed size 4 bytes + decToHex(streamInfo['compressedSize'], 4) + + // uncompressed size 4 bytes + decToHex(streamInfo['uncompressedSize'], 4); + + return descriptor; +}; + + +/** + * A worker to concatenate other workers to create a zip file. + * @param {Boolean} streamFiles `true` to stream the content of the files, + * `false` to accumulate it. + * @param {String} comment the comment to use. + * @param {String} platform the platform to use, "UNIX" or "DOS". + * @param {Function} encodeFileName the function to encode file names and comments. + */ +function ZipFileWorker(streamFiles, comment, platform, encodeFileName) { + GenericWorker.call(this, "ZipFileWorker"); + // The number of bytes written so far. This doesn't count accumulated chunks. + this.bytesWritten = 0; + // The comment of the zip file + this.zipComment = comment; + // The platform "generating" the zip file. + this.zipPlatform = platform; + // the function to encode file names and comments. + this.encodeFileName = encodeFileName; + // Should we stream the content of the files ? + this.streamFiles = streamFiles; + // If `streamFiles` is false, we will need to accumulate the content of the + // files to calculate sizes / crc32 (and write them *before* the content). + // This boolean indicates if we are accumulating chunks (it will change a lot + // during the lifetime of this worker). + this.accumulate = false; + // The buffer receiving chunks when accumulating content. + this.contentBuffer = []; + // The list of generated directory records. + this.dirRecords = []; + // The offset (in bytes) from the beginning of the zip file for the current source. + this.currentSourceOffset = 0; + // The total number of entries in this zip file. + this.entriesCount = 0; + // the name of the file currently being added, null when handling the end of the zip file. + // Used for the emited metadata. + this.currentFile = null; + + + + this._sources = []; +} +utils.inherits(ZipFileWorker, GenericWorker); + +/** + * @see GenericWorker.push + */ +ZipFileWorker.prototype.push = function (chunk) { + + var currentFilePercent = chunk.meta.percent || 0; + var entriesCount = this.entriesCount; + var remainingFiles = this._sources.length; + + if(this.accumulate) { + this.contentBuffer.push(chunk); + } else { + this.bytesWritten += chunk.data.length; + + GenericWorker.prototype.push.call(this, { + data : chunk.data, + meta : { + currentFile : this.currentFile, + percent : entriesCount ? (currentFilePercent + 100 * (entriesCount - remainingFiles - 1)) / entriesCount : 100 + } + }); + } +}; + +/** + * The worker started a new source (an other worker). + * @param {Object} streamInfo the streamInfo object from the new source. + */ +ZipFileWorker.prototype.openedSource = function (streamInfo) { + this.currentSourceOffset = this.bytesWritten; + this.currentFile = streamInfo['file'].name; + + var streamedContent = this.streamFiles && !streamInfo['file'].dir; + + // don't stream folders (because they don't have any content) + if(streamedContent) { + var record = generateZipParts(streamInfo, streamedContent, false, this.currentSourceOffset, this.zipPlatform, this.encodeFileName); + this.push({ + data : record.fileRecord, + meta : {percent:0} + }); + } else { + // we need to wait for the whole file before pushing anything + this.accumulate = true; + } +}; + +/** + * The worker finished a source (an other worker). + * @param {Object} streamInfo the streamInfo object from the finished source. + */ +ZipFileWorker.prototype.closedSource = function (streamInfo) { + this.accumulate = false; + var streamedContent = this.streamFiles && !streamInfo['file'].dir; + var record = generateZipParts(streamInfo, streamedContent, true, this.currentSourceOffset, this.zipPlatform, this.encodeFileName); + + this.dirRecords.push(record.dirRecord); + if(streamedContent) { + // after the streamed file, we put data descriptors + this.push({ + data : generateDataDescriptors(streamInfo), + meta : {percent:100} + }); + } else { + // the content wasn't streamed, we need to push everything now + // first the file record, then the content + this.push({ + data : record.fileRecord, + meta : {percent:0} + }); + while(this.contentBuffer.length) { + this.push(this.contentBuffer.shift()); + } + } + this.currentFile = null; +}; + +/** + * @see GenericWorker.flush + */ +ZipFileWorker.prototype.flush = function () { + + var localDirLength = this.bytesWritten; + for(var i = 0; i < this.dirRecords.length; i++) { + this.push({ + data : this.dirRecords[i], + meta : {percent:100} + }); + } + var centralDirLength = this.bytesWritten - localDirLength; + + var dirEnd = generateCentralDirectoryEnd(this.dirRecords.length, centralDirLength, localDirLength, this.zipComment, this.encodeFileName); + + this.push({ + data : dirEnd, + meta : {percent:100} + }); +}; + +/** + * Prepare the next source to be read. + */ +ZipFileWorker.prototype.prepareNextSource = function () { + this.previous = this._sources.shift(); + this.openedSource(this.previous.streamInfo); + if (this.isPaused) { + this.previous.pause(); + } else { + this.previous.resume(); + } +}; + +/** + * @see GenericWorker.registerPrevious + */ +ZipFileWorker.prototype.registerPrevious = function (previous) { + this._sources.push(previous); + var self = this; + + previous.on('data', function (chunk) { + self.processChunk(chunk); + }); + previous.on('end', function () { + self.closedSource(self.previous.streamInfo); + if(self._sources.length) { + self.prepareNextSource(); + } else { + self.end(); + } + }); + previous.on('error', function (e) { + self.error(e); + }); + return this; +}; + +/** + * @see GenericWorker.resume + */ +ZipFileWorker.prototype.resume = function () { + if(!GenericWorker.prototype.resume.call(this)) { + return false; + } + + if (!this.previous && this._sources.length) { + this.prepareNextSource(); + return true; + } + if (!this.previous && !this._sources.length && !this.generatedError) { + this.end(); + return true; + } +}; + +/** + * @see GenericWorker.error + */ +ZipFileWorker.prototype.error = function (e) { + var sources = this._sources; + if(!GenericWorker.prototype.error.call(this, e)) { + return false; + } + for(var i = 0; i < sources.length; i++) { + try { + sources[i].error(e); + } catch(e) { + // the `error` exploded, nothing to do + } + } + return true; +}; + +/** + * @see GenericWorker.lock + */ +ZipFileWorker.prototype.lock = function () { + GenericWorker.prototype.lock.call(this); + var sources = this._sources; + for(var i = 0; i < sources.length; i++) { + sources[i].lock(); + } +}; + +module.exports = ZipFileWorker; + +},{"../crc32":4,"../signature":23,"../stream/GenericWorker":28,"../utf8":31,"../utils":32}],9:[function(require,module,exports){ +'use strict'; + +var compressions = require('../compressions'); +var ZipFileWorker = require('./ZipFileWorker'); + +/** + * Find the compression to use. + * @param {String} fileCompression the compression defined at the file level, if any. + * @param {String} zipCompression the compression defined at the load() level. + * @return {Object} the compression object to use. + */ +var getCompression = function (fileCompression, zipCompression) { + + var compressionName = fileCompression || zipCompression; + var compression = compressions[compressionName]; + if (!compression) { + throw new Error(compressionName + " is not a valid compression method !"); + } + return compression; +}; + +/** + * Create a worker to generate a zip file. + * @param {JSZip} zip the JSZip instance at the right root level. + * @param {Object} options to generate the zip file. + * @param {String} comment the comment to use. + */ +exports.generateWorker = function (zip, options, comment) { + + var zipFileWorker = new ZipFileWorker(options.streamFiles, comment, options.platform, options.encodeFileName); + var entriesCount = 0; + try { + + zip.forEach(function (relativePath, file) { + entriesCount++; + var compression = getCompression(file.options.compression, options.compression); + var compressionOptions = file.options.compressionOptions || options.compressionOptions || {}; + var dir = file.dir, date = file.date; + + file._compressWorker(compression, compressionOptions) + .withStreamInfo("file", { + name : relativePath, + dir : dir, + date : date, + comment : file.comment || "", + unixPermissions : file.unixPermissions, + dosPermissions : file.dosPermissions + }) + .pipe(zipFileWorker); + }); + zipFileWorker.entriesCount = entriesCount; + } catch (e) { + zipFileWorker.error(e); + } + + return zipFileWorker; +}; + +},{"../compressions":3,"./ZipFileWorker":8}],10:[function(require,module,exports){ +'use strict'; + +/** + * Representation a of zip file in js + * @constructor + */ +function JSZip() { + // if this constructor is used without `new`, it adds `new` before itself: + if(!(this instanceof JSZip)) { + return new JSZip(); + } + + if(arguments.length) { + throw new Error("The constructor with parameters has been removed in JSZip 3.0, please check the upgrade guide."); + } + + // object containing the files : + // { + // "folder/" : {...}, + // "folder/data.txt" : {...} + // } + this.files = {}; + + this.comment = null; + + // Where we are in the hierarchy + this.root = ""; + this.clone = function() { + var newObj = new JSZip(); + for (var i in this) { + if (typeof this[i] !== "function") { + newObj[i] = this[i]; + } + } + return newObj; + }; +} +JSZip.prototype = require('./object'); +JSZip.prototype.loadAsync = require('./load'); +JSZip.support = require('./support'); +JSZip.defaults = require('./defaults'); + +// TODO find a better way to handle this version, +// a require('package.json').version doesn't work with webpack, see #327 +JSZip.version = "3.2.0"; + +JSZip.loadAsync = function (content, options) { + return new JSZip().loadAsync(content, options); +}; + +JSZip.external = require("./external"); +module.exports = JSZip; + +},{"./defaults":5,"./external":6,"./load":11,"./object":15,"./support":30}],11:[function(require,module,exports){ +'use strict'; +var utils = require('./utils'); +var external = require("./external"); +var utf8 = require('./utf8'); +var utils = require('./utils'); +var ZipEntries = require('./zipEntries'); +var Crc32Probe = require('./stream/Crc32Probe'); +var nodejsUtils = require("./nodejsUtils"); + +/** + * Check the CRC32 of an entry. + * @param {ZipEntry} zipEntry the zip entry to check. + * @return {Promise} the result. + */ +function checkEntryCRC32(zipEntry) { + return new external.Promise(function (resolve, reject) { + var worker = zipEntry.decompressed.getContentWorker().pipe(new Crc32Probe()); + worker.on("error", function (e) { + reject(e); + }) + .on("end", function () { + if (worker.streamInfo.crc32 !== zipEntry.decompressed.crc32) { + reject(new Error("Corrupted zip : CRC32 mismatch")); + } else { + resolve(); + } + }) + .resume(); + }); +} + +module.exports = function(data, options) { + var zip = this; + options = utils.extend(options || {}, { + base64: false, + checkCRC32: false, + optimizedBinaryString: false, + createFolders: false, + decodeFileName: utf8.utf8decode + }); + + if (nodejsUtils.isNode && nodejsUtils.isStream(data)) { + return external.Promise.reject(new Error("JSZip can't accept a stream when loading a zip file.")); + } + + return utils.prepareContent("the loaded zip file", data, true, options.optimizedBinaryString, options.base64) + .then(function(data) { + var zipEntries = new ZipEntries(options); + zipEntries.load(data); + return zipEntries; + }).then(function checkCRC32(zipEntries) { + var promises = [external.Promise.resolve(zipEntries)]; + var files = zipEntries.files; + if (options.checkCRC32) { + for (var i = 0; i < files.length; i++) { + promises.push(checkEntryCRC32(files[i])); + } + } + return external.Promise.all(promises); + }).then(function addFiles(results) { + var zipEntries = results.shift(); + var files = zipEntries.files; + for (var i = 0; i < files.length; i++) { + var input = files[i]; + zip.file(input.fileNameStr, input.decompressed, { + binary: true, + optimizedBinaryString: true, + date: input.date, + dir: input.dir, + comment : input.fileCommentStr.length ? input.fileCommentStr : null, + unixPermissions : input.unixPermissions, + dosPermissions : input.dosPermissions, + createFolders: options.createFolders + }); + } + if (zipEntries.zipComment.length) { + zip.comment = zipEntries.zipComment; + } + + return zip; + }); +}; + +},{"./external":6,"./nodejsUtils":14,"./stream/Crc32Probe":25,"./utf8":31,"./utils":32,"./zipEntries":33}],12:[function(require,module,exports){ +"use strict"; + +var utils = require('../utils'); +var GenericWorker = require('../stream/GenericWorker'); + +/** + * A worker that use a nodejs stream as source. + * @constructor + * @param {String} filename the name of the file entry for this stream. + * @param {Readable} stream the nodejs stream. + */ +function NodejsStreamInputAdapter(filename, stream) { + GenericWorker.call(this, "Nodejs stream input adapter for " + filename); + this._upstreamEnded = false; + this._bindStream(stream); +} + +utils.inherits(NodejsStreamInputAdapter, GenericWorker); + +/** + * Prepare the stream and bind the callbacks on it. + * Do this ASAP on node 0.10 ! A lazy binding doesn't always work. + * @param {Stream} stream the nodejs stream to use. + */ +NodejsStreamInputAdapter.prototype._bindStream = function (stream) { + var self = this; + this._stream = stream; + stream.pause(); + stream + .on("data", function (chunk) { + self.push({ + data: chunk, + meta : { + percent : 0 + } + }); + }) + .on("error", function (e) { + if(self.isPaused) { + this.generatedError = e; + } else { + self.error(e); + } + }) + .on("end", function () { + if(self.isPaused) { + self._upstreamEnded = true; + } else { + self.end(); + } + }); +}; +NodejsStreamInputAdapter.prototype.pause = function () { + if(!GenericWorker.prototype.pause.call(this)) { + return false; + } + this._stream.pause(); + return true; +}; +NodejsStreamInputAdapter.prototype.resume = function () { + if(!GenericWorker.prototype.resume.call(this)) { + return false; + } + + if(this._upstreamEnded) { + this.end(); + } else { + this._stream.resume(); + } + + return true; +}; + +module.exports = NodejsStreamInputAdapter; + +},{"../stream/GenericWorker":28,"../utils":32}],13:[function(require,module,exports){ +'use strict'; + +var Readable = require('readable-stream').Readable; + +var utils = require('../utils'); +utils.inherits(NodejsStreamOutputAdapter, Readable); + +/** +* A nodejs stream using a worker as source. +* @see the SourceWrapper in http://nodejs.org/api/stream.html +* @constructor +* @param {StreamHelper} helper the helper wrapping the worker +* @param {Object} options the nodejs stream options +* @param {Function} updateCb the update callback. +*/ +function NodejsStreamOutputAdapter(helper, options, updateCb) { + Readable.call(this, options); + this._helper = helper; + + var self = this; + helper.on("data", function (data, meta) { + if (!self.push(data)) { + self._helper.pause(); + } + if(updateCb) { + updateCb(meta); + } + }) + .on("error", function(e) { + self.emit('error', e); + }) + .on("end", function () { + self.push(null); + }); +} + + +NodejsStreamOutputAdapter.prototype._read = function() { + this._helper.resume(); +}; + +module.exports = NodejsStreamOutputAdapter; + +},{"../utils":32,"readable-stream":16}],14:[function(require,module,exports){ +'use strict'; + +module.exports = { + /** + * True if this is running in Nodejs, will be undefined in a browser. + * In a browser, browserify won't include this file and the whole module + * will be resolved an empty object. + */ + isNode : typeof Buffer !== "undefined", + /** + * Create a new nodejs Buffer from an existing content. + * @param {Object} data the data to pass to the constructor. + * @param {String} encoding the encoding to use. + * @return {Buffer} a new Buffer. + */ + newBufferFrom: function(data, encoding) { + if (Buffer.from && Buffer.from !== Uint8Array.from) { + return Buffer.from(data, encoding); + } else { + if (typeof data === "number") { + // Safeguard for old Node.js versions. On newer versions, + // Buffer.from(number) / Buffer(number, encoding) already throw. + throw new Error("The \"data\" argument must not be a number"); + } + return new Buffer(data, encoding); + } + }, + /** + * Create a new nodejs Buffer with the specified size. + * @param {Integer} size the size of the buffer. + * @return {Buffer} a new Buffer. + */ + allocBuffer: function (size) { + if (Buffer.alloc) { + return Buffer.alloc(size); + } else { + var buf = new Buffer(size); + buf.fill(0); + return buf; + } + }, + /** + * Find out if an object is a Buffer. + * @param {Object} b the object to test. + * @return {Boolean} true if the object is a Buffer, false otherwise. + */ + isBuffer : function(b){ + return Buffer.isBuffer(b); + }, + + isStream : function (obj) { + return obj && + typeof obj.on === "function" && + typeof obj.pause === "function" && + typeof obj.resume === "function"; + } +}; + +},{}],15:[function(require,module,exports){ +'use strict'; +var utf8 = require('./utf8'); +var utils = require('./utils'); +var GenericWorker = require('./stream/GenericWorker'); +var StreamHelper = require('./stream/StreamHelper'); +var defaults = require('./defaults'); +var CompressedObject = require('./compressedObject'); +var ZipObject = require('./zipObject'); +var generate = require("./generate"); +var nodejsUtils = require("./nodejsUtils"); +var NodejsStreamInputAdapter = require("./nodejs/NodejsStreamInputAdapter"); + + +/** + * Add a file in the current folder. + * @private + * @param {string} name the name of the file + * @param {String|ArrayBuffer|Uint8Array|Buffer} data the data of the file + * @param {Object} originalOptions the options of the file + * @return {Object} the new file. + */ +var fileAdd = function(name, data, originalOptions) { + // be sure sub folders exist + var dataType = utils.getTypeOf(data), + parent; + + + /* + * Correct options. + */ + + var o = utils.extend(originalOptions || {}, defaults); + o.date = o.date || new Date(); + if (o.compression !== null) { + o.compression = o.compression.toUpperCase(); + } + + if (typeof o.unixPermissions === "string") { + o.unixPermissions = parseInt(o.unixPermissions, 8); + } + + // UNX_IFDIR 0040000 see zipinfo.c + if (o.unixPermissions && (o.unixPermissions & 0x4000)) { + o.dir = true; + } + // Bit 4 Directory + if (o.dosPermissions && (o.dosPermissions & 0x0010)) { + o.dir = true; + } + + if (o.dir) { + name = forceTrailingSlash(name); + } + if (o.createFolders && (parent = parentFolder(name))) { + folderAdd.call(this, parent, true); + } + + var isUnicodeString = dataType === "string" && o.binary === false && o.base64 === false; + if (!originalOptions || typeof originalOptions.binary === "undefined") { + o.binary = !isUnicodeString; + } + + + var isCompressedEmpty = (data instanceof CompressedObject) && data.uncompressedSize === 0; + + if (isCompressedEmpty || o.dir || !data || data.length === 0) { + o.base64 = false; + o.binary = true; + data = ""; + o.compression = "STORE"; + dataType = "string"; + } + + /* + * Convert content to fit. + */ + + var zipObjectContent = null; + if (data instanceof CompressedObject || data instanceof GenericWorker) { + zipObjectContent = data; + } else if (nodejsUtils.isNode && nodejsUtils.isStream(data)) { + zipObjectContent = new NodejsStreamInputAdapter(name, data); + } else { + zipObjectContent = utils.prepareContent(name, data, o.binary, o.optimizedBinaryString, o.base64); + } + + var object = new ZipObject(name, zipObjectContent, o); + this.files[name] = object; + /* + TODO: we can't throw an exception because we have async promises + (we can have a promise of a Date() for example) but returning a + promise is useless because file(name, data) returns the JSZip + object for chaining. Should we break that to allow the user + to catch the error ? + + return external.Promise.resolve(zipObjectContent) + .then(function () { + return object; + }); + */ +}; + +/** + * Find the parent folder of the path. + * @private + * @param {string} path the path to use + * @return {string} the parent folder, or "" + */ +var parentFolder = function (path) { + if (path.slice(-1) === '/') { + path = path.substring(0, path.length - 1); + } + var lastSlash = path.lastIndexOf('/'); + return (lastSlash > 0) ? path.substring(0, lastSlash) : ""; +}; + +/** + * Returns the path with a slash at the end. + * @private + * @param {String} path the path to check. + * @return {String} the path with a trailing slash. + */ +var forceTrailingSlash = function(path) { + // Check the name ends with a / + if (path.slice(-1) !== "/") { + path += "/"; // IE doesn't like substr(-1) + } + return path; +}; + +/** + * Add a (sub) folder in the current folder. + * @private + * @param {string} name the folder's name + * @param {boolean=} [createFolders] If true, automatically create sub + * folders. Defaults to false. + * @return {Object} the new folder. + */ +var folderAdd = function(name, createFolders) { + createFolders = (typeof createFolders !== 'undefined') ? createFolders : defaults.createFolders; + + name = forceTrailingSlash(name); + + // Does this folder already exist? + if (!this.files[name]) { + fileAdd.call(this, name, null, { + dir: true, + createFolders: createFolders + }); + } + return this.files[name]; +}; + +/** +* Cross-window, cross-Node-context regular expression detection +* @param {Object} object Anything +* @return {Boolean} true if the object is a regular expression, +* false otherwise +*/ +function isRegExp(object) { + return Object.prototype.toString.call(object) === "[object RegExp]"; +} + +// return the actual prototype of JSZip +var out = { + /** + * @see loadAsync + */ + load: function() { + throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide."); + }, + + + /** + * Call a callback function for each entry at this folder level. + * @param {Function} cb the callback function: + * function (relativePath, file) {...} + * It takes 2 arguments : the relative path and the file. + */ + forEach: function(cb) { + var filename, relativePath, file; + for (filename in this.files) { + if (!this.files.hasOwnProperty(filename)) { + continue; + } + file = this.files[filename]; + relativePath = filename.slice(this.root.length, filename.length); + if (relativePath && filename.slice(0, this.root.length) === this.root) { // the file is in the current root + cb(relativePath, file); // TODO reverse the parameters ? need to be clean AND consistent with the filter search fn... + } + } + }, + + /** + * Filter nested files/folders with the specified function. + * @param {Function} search the predicate to use : + * function (relativePath, file) {...} + * It takes 2 arguments : the relative path and the file. + * @return {Array} An array of matching elements. + */ + filter: function(search) { + var result = []; + this.forEach(function (relativePath, entry) { + if (search(relativePath, entry)) { // the file matches the function + result.push(entry); + } + + }); + return result; + }, + + /** + * Add a file to the zip file, or search a file. + * @param {string|RegExp} name The name of the file to add (if data is defined), + * the name of the file to find (if no data) or a regex to match files. + * @param {String|ArrayBuffer|Uint8Array|Buffer} data The file data, either raw or base64 encoded + * @param {Object} o File options + * @return {JSZip|Object|Array} this JSZip object (when adding a file), + * a file (when searching by string) or an array of files (when searching by regex). + */ + file: function(name, data, o) { + if (arguments.length === 1) { + if (isRegExp(name)) { + var regexp = name; + return this.filter(function(relativePath, file) { + return !file.dir && regexp.test(relativePath); + }); + } + else { // text + var obj = this.files[this.root + name]; + if (obj && !obj.dir) { + return obj; + } else { + return null; + } + } + } + else { // more than one argument : we have data ! + name = this.root + name; + fileAdd.call(this, name, data, o); + } + return this; + }, + + /** + * Add a directory to the zip file, or search. + * @param {String|RegExp} arg The name of the directory to add, or a regex to search folders. + * @return {JSZip} an object with the new directory as the root, or an array containing matching folders. + */ + folder: function(arg) { + if (!arg) { + return this; + } + + if (isRegExp(arg)) { + return this.filter(function(relativePath, file) { + return file.dir && arg.test(relativePath); + }); + } + + // else, name is a new folder + var name = this.root + arg; + var newFolder = folderAdd.call(this, name); + + // Allow chaining by returning a new object with this folder as the root + var ret = this.clone(); + ret.root = newFolder.name; + return ret; + }, + + /** + * Delete a file, or a directory and all sub-files, from the zip + * @param {string} name the name of the file to delete + * @return {JSZip} this JSZip object + */ + remove: function(name) { + name = this.root + name; + var file = this.files[name]; + if (!file) { + // Look for any folders + if (name.slice(-1) !== "/") { + name += "/"; + } + file = this.files[name]; + } + + if (file && !file.dir) { + // file + delete this.files[name]; + } else { + // maybe a folder, delete recursively + var kids = this.filter(function(relativePath, file) { + return file.name.slice(0, name.length) === name; + }); + for (var i = 0; i < kids.length; i++) { + delete this.files[kids[i].name]; + } + } + + return this; + }, + + /** + * Generate the complete zip file + * @param {Object} options the options to generate the zip file : + * - compression, "STORE" by default. + * - type, "base64" by default. Values are : string, base64, uint8array, arraybuffer, blob. + * @return {String|Uint8Array|ArrayBuffer|Buffer|Blob} the zip file + */ + generate: function(options) { + throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide."); + }, + + /** + * Generate the complete zip file as an internal stream. + * @param {Object} options the options to generate the zip file : + * - compression, "STORE" by default. + * - type, "base64" by default. Values are : string, base64, uint8array, arraybuffer, blob. + * @return {StreamHelper} the streamed zip file. + */ + generateInternalStream: function(options) { + var worker, opts = {}; + try { + opts = utils.extend(options || {}, { + streamFiles: false, + compression: "STORE", + compressionOptions : null, + type: "", + platform: "DOS", + comment: null, + mimeType: 'application/zip', + encodeFileName: utf8.utf8encode + }); + + opts.type = opts.type.toLowerCase(); + opts.compression = opts.compression.toUpperCase(); + + // "binarystring" is prefered but the internals use "string". + if(opts.type === "binarystring") { + opts.type = "string"; + } + + if (!opts.type) { + throw new Error("No output type specified."); + } + + utils.checkSupport(opts.type); + + // accept nodejs `process.platform` + if( + opts.platform === 'darwin' || + opts.platform === 'freebsd' || + opts.platform === 'linux' || + opts.platform === 'sunos' + ) { + opts.platform = "UNIX"; + } + if (opts.platform === 'win32') { + opts.platform = "DOS"; + } + + var comment = opts.comment || this.comment || ""; + worker = generate.generateWorker(this, opts, comment); + } catch (e) { + worker = new GenericWorker("error"); + worker.error(e); + } + return new StreamHelper(worker, opts.type || "string", opts.mimeType); + }, + /** + * Generate the complete zip file asynchronously. + * @see generateInternalStream + */ + generateAsync: function(options, onUpdate) { + return this.generateInternalStream(options).accumulate(onUpdate); + }, + /** + * Generate the complete zip file asynchronously. + * @see generateInternalStream + */ + generateNodeStream: function(options, onUpdate) { + options = options || {}; + if (!options.type) { + options.type = "nodebuffer"; + } + return this.generateInternalStream(options).toNodejsStream(onUpdate); + } +}; +module.exports = out; + +},{"./compressedObject":2,"./defaults":5,"./generate":9,"./nodejs/NodejsStreamInputAdapter":12,"./nodejsUtils":14,"./stream/GenericWorker":28,"./stream/StreamHelper":29,"./utf8":31,"./utils":32,"./zipObject":35}],16:[function(require,module,exports){ +/* + * This file is used by module bundlers (browserify/webpack/etc) when + * including a stream implementation. We use "readable-stream" to get a + * consistent behavior between nodejs versions but bundlers often have a shim + * for "stream". Using this shim greatly improve the compatibility and greatly + * reduce the final size of the bundle (only one stream implementation, not + * two). + */ +module.exports = require("stream"); + +},{"stream":undefined}],17:[function(require,module,exports){ +'use strict'; +var DataReader = require('./DataReader'); +var utils = require('../utils'); + +function ArrayReader(data) { + DataReader.call(this, data); + for(var i = 0; i < this.data.length; i++) { + data[i] = data[i] & 0xFF; + } +} +utils.inherits(ArrayReader, DataReader); +/** + * @see DataReader.byteAt + */ +ArrayReader.prototype.byteAt = function(i) { + return this.data[this.zero + i]; +}; +/** + * @see DataReader.lastIndexOfSignature + */ +ArrayReader.prototype.lastIndexOfSignature = function(sig) { + var sig0 = sig.charCodeAt(0), + sig1 = sig.charCodeAt(1), + sig2 = sig.charCodeAt(2), + sig3 = sig.charCodeAt(3); + for (var i = this.length - 4; i >= 0; --i) { + if (this.data[i] === sig0 && this.data[i + 1] === sig1 && this.data[i + 2] === sig2 && this.data[i + 3] === sig3) { + return i - this.zero; + } + } + + return -1; +}; +/** + * @see DataReader.readAndCheckSignature + */ +ArrayReader.prototype.readAndCheckSignature = function (sig) { + var sig0 = sig.charCodeAt(0), + sig1 = sig.charCodeAt(1), + sig2 = sig.charCodeAt(2), + sig3 = sig.charCodeAt(3), + data = this.readData(4); + return sig0 === data[0] && sig1 === data[1] && sig2 === data[2] && sig3 === data[3]; +}; +/** + * @see DataReader.readData + */ +ArrayReader.prototype.readData = function(size) { + this.checkOffset(size); + if(size === 0) { + return []; + } + var result = this.data.slice(this.zero + this.index, this.zero + this.index + size); + this.index += size; + return result; +}; +module.exports = ArrayReader; + +},{"../utils":32,"./DataReader":18}],18:[function(require,module,exports){ +'use strict'; +var utils = require('../utils'); + +function DataReader(data) { + this.data = data; // type : see implementation + this.length = data.length; + this.index = 0; + this.zero = 0; +} +DataReader.prototype = { + /** + * Check that the offset will not go too far. + * @param {string} offset the additional offset to check. + * @throws {Error} an Error if the offset is out of bounds. + */ + checkOffset: function(offset) { + this.checkIndex(this.index + offset); + }, + /** + * Check that the specified index will not be too far. + * @param {string} newIndex the index to check. + * @throws {Error} an Error if the index is out of bounds. + */ + checkIndex: function(newIndex) { + if (this.length < this.zero + newIndex || newIndex < 0) { + throw new Error("End of data reached (data length = " + this.length + ", asked index = " + (newIndex) + "). Corrupted zip ?"); + } + }, + /** + * Change the index. + * @param {number} newIndex The new index. + * @throws {Error} if the new index is out of the data. + */ + setIndex: function(newIndex) { + this.checkIndex(newIndex); + this.index = newIndex; + }, + /** + * Skip the next n bytes. + * @param {number} n the number of bytes to skip. + * @throws {Error} if the new index is out of the data. + */ + skip: function(n) { + this.setIndex(this.index + n); + }, + /** + * Get the byte at the specified index. + * @param {number} i the index to use. + * @return {number} a byte. + */ + byteAt: function(i) { + // see implementations + }, + /** + * Get the next number with a given byte size. + * @param {number} size the number of bytes to read. + * @return {number} the corresponding number. + */ + readInt: function(size) { + var result = 0, + i; + this.checkOffset(size); + for (i = this.index + size - 1; i >= this.index; i--) { + result = (result << 8) + this.byteAt(i); + } + this.index += size; + return result; + }, + /** + * Get the next string with a given byte size. + * @param {number} size the number of bytes to read. + * @return {string} the corresponding string. + */ + readString: function(size) { + return utils.transformTo("string", this.readData(size)); + }, + /** + * Get raw data without conversion, bytes. + * @param {number} size the number of bytes to read. + * @return {Object} the raw data, implementation specific. + */ + readData: function(size) { + // see implementations + }, + /** + * Find the last occurence of a zip signature (4 bytes). + * @param {string} sig the signature to find. + * @return {number} the index of the last occurence, -1 if not found. + */ + lastIndexOfSignature: function(sig) { + // see implementations + }, + /** + * Read the signature (4 bytes) at the current position and compare it with sig. + * @param {string} sig the expected signature + * @return {boolean} true if the signature matches, false otherwise. + */ + readAndCheckSignature: function(sig) { + // see implementations + }, + /** + * Get the next date. + * @return {Date} the date. + */ + readDate: function() { + var dostime = this.readInt(4); + return new Date(Date.UTC( + ((dostime >> 25) & 0x7f) + 1980, // year + ((dostime >> 21) & 0x0f) - 1, // month + (dostime >> 16) & 0x1f, // day + (dostime >> 11) & 0x1f, // hour + (dostime >> 5) & 0x3f, // minute + (dostime & 0x1f) << 1)); // second + } +}; +module.exports = DataReader; + +},{"../utils":32}],19:[function(require,module,exports){ +'use strict'; +var Uint8ArrayReader = require('./Uint8ArrayReader'); +var utils = require('../utils'); + +function NodeBufferReader(data) { + Uint8ArrayReader.call(this, data); +} +utils.inherits(NodeBufferReader, Uint8ArrayReader); + +/** + * @see DataReader.readData + */ +NodeBufferReader.prototype.readData = function(size) { + this.checkOffset(size); + var result = this.data.slice(this.zero + this.index, this.zero + this.index + size); + this.index += size; + return result; +}; +module.exports = NodeBufferReader; + +},{"../utils":32,"./Uint8ArrayReader":21}],20:[function(require,module,exports){ +'use strict'; +var DataReader = require('./DataReader'); +var utils = require('../utils'); + +function StringReader(data) { + DataReader.call(this, data); +} +utils.inherits(StringReader, DataReader); +/** + * @see DataReader.byteAt + */ +StringReader.prototype.byteAt = function(i) { + return this.data.charCodeAt(this.zero + i); +}; +/** + * @see DataReader.lastIndexOfSignature + */ +StringReader.prototype.lastIndexOfSignature = function(sig) { + return this.data.lastIndexOf(sig) - this.zero; +}; +/** + * @see DataReader.readAndCheckSignature + */ +StringReader.prototype.readAndCheckSignature = function (sig) { + var data = this.readData(4); + return sig === data; +}; +/** + * @see DataReader.readData + */ +StringReader.prototype.readData = function(size) { + this.checkOffset(size); + // this will work because the constructor applied the "& 0xff" mask. + var result = this.data.slice(this.zero + this.index, this.zero + this.index + size); + this.index += size; + return result; +}; +module.exports = StringReader; + +},{"../utils":32,"./DataReader":18}],21:[function(require,module,exports){ +'use strict'; +var ArrayReader = require('./ArrayReader'); +var utils = require('../utils'); + +function Uint8ArrayReader(data) { + ArrayReader.call(this, data); +} +utils.inherits(Uint8ArrayReader, ArrayReader); +/** + * @see DataReader.readData + */ +Uint8ArrayReader.prototype.readData = function(size) { + this.checkOffset(size); + if(size === 0) { + // in IE10, when using subarray(idx, idx), we get the array [0x00] instead of []. + return new Uint8Array(0); + } + var result = this.data.subarray(this.zero + this.index, this.zero + this.index + size); + this.index += size; + return result; +}; +module.exports = Uint8ArrayReader; + +},{"../utils":32,"./ArrayReader":17}],22:[function(require,module,exports){ +'use strict'; + +var utils = require('../utils'); +var support = require('../support'); +var ArrayReader = require('./ArrayReader'); +var StringReader = require('./StringReader'); +var NodeBufferReader = require('./NodeBufferReader'); +var Uint8ArrayReader = require('./Uint8ArrayReader'); + +/** + * Create a reader adapted to the data. + * @param {String|ArrayBuffer|Uint8Array|Buffer} data the data to read. + * @return {DataReader} the data reader. + */ +module.exports = function (data) { + var type = utils.getTypeOf(data); + utils.checkSupport(type); + if (type === "string" && !support.uint8array) { + return new StringReader(data); + } + if (type === "nodebuffer") { + return new NodeBufferReader(data); + } + if (support.uint8array) { + return new Uint8ArrayReader(utils.transformTo("uint8array", data)); + } + return new ArrayReader(utils.transformTo("array", data)); +}; + +},{"../support":30,"../utils":32,"./ArrayReader":17,"./NodeBufferReader":19,"./StringReader":20,"./Uint8ArrayReader":21}],23:[function(require,module,exports){ +'use strict'; +exports.LOCAL_FILE_HEADER = "PK\x03\x04"; +exports.CENTRAL_FILE_HEADER = "PK\x01\x02"; +exports.CENTRAL_DIRECTORY_END = "PK\x05\x06"; +exports.ZIP64_CENTRAL_DIRECTORY_LOCATOR = "PK\x06\x07"; +exports.ZIP64_CENTRAL_DIRECTORY_END = "PK\x06\x06"; +exports.DATA_DESCRIPTOR = "PK\x07\x08"; + +},{}],24:[function(require,module,exports){ +'use strict'; + +var GenericWorker = require('./GenericWorker'); +var utils = require('../utils'); + +/** + * A worker which convert chunks to a specified type. + * @constructor + * @param {String} destType the destination type. + */ +function ConvertWorker(destType) { + GenericWorker.call(this, "ConvertWorker to " + destType); + this.destType = destType; +} +utils.inherits(ConvertWorker, GenericWorker); + +/** + * @see GenericWorker.processChunk + */ +ConvertWorker.prototype.processChunk = function (chunk) { + this.push({ + data : utils.transformTo(this.destType, chunk.data), + meta : chunk.meta + }); +}; +module.exports = ConvertWorker; + +},{"../utils":32,"./GenericWorker":28}],25:[function(require,module,exports){ +'use strict'; + +var GenericWorker = require('./GenericWorker'); +var crc32 = require('../crc32'); +var utils = require('../utils'); + +/** + * A worker which calculate the crc32 of the data flowing through. + * @constructor + */ +function Crc32Probe() { + GenericWorker.call(this, "Crc32Probe"); + this.withStreamInfo("crc32", 0); +} +utils.inherits(Crc32Probe, GenericWorker); + +/** + * @see GenericWorker.processChunk + */ +Crc32Probe.prototype.processChunk = function (chunk) { + this.streamInfo.crc32 = crc32(chunk.data, this.streamInfo.crc32 || 0); + this.push(chunk); +}; +module.exports = Crc32Probe; + +},{"../crc32":4,"../utils":32,"./GenericWorker":28}],26:[function(require,module,exports){ +'use strict'; + +var utils = require('../utils'); +var GenericWorker = require('./GenericWorker'); + +/** + * A worker which calculate the total length of the data flowing through. + * @constructor + * @param {String} propName the name used to expose the length + */ +function DataLengthProbe(propName) { + GenericWorker.call(this, "DataLengthProbe for " + propName); + this.propName = propName; + this.withStreamInfo(propName, 0); +} +utils.inherits(DataLengthProbe, GenericWorker); + +/** + * @see GenericWorker.processChunk + */ +DataLengthProbe.prototype.processChunk = function (chunk) { + if(chunk) { + var length = this.streamInfo[this.propName] || 0; + this.streamInfo[this.propName] = length + chunk.data.length; + } + GenericWorker.prototype.processChunk.call(this, chunk); +}; +module.exports = DataLengthProbe; + + +},{"../utils":32,"./GenericWorker":28}],27:[function(require,module,exports){ +'use strict'; + +var utils = require('../utils'); +var GenericWorker = require('./GenericWorker'); + +// the size of the generated chunks +// TODO expose this as a public variable +var DEFAULT_BLOCK_SIZE = 16 * 1024; + +/** + * A worker that reads a content and emits chunks. + * @constructor + * @param {Promise} dataP the promise of the data to split + */ +function DataWorker(dataP) { + GenericWorker.call(this, "DataWorker"); + var self = this; + this.dataIsReady = false; + this.index = 0; + this.max = 0; + this.data = null; + this.type = ""; + + this._tickScheduled = false; + + dataP.then(function (data) { + self.dataIsReady = true; + self.data = data; + self.max = data && data.length || 0; + self.type = utils.getTypeOf(data); + if(!self.isPaused) { + self._tickAndRepeat(); + } + }, function (e) { + self.error(e); + }); +} + +utils.inherits(DataWorker, GenericWorker); + +/** + * @see GenericWorker.cleanUp + */ +DataWorker.prototype.cleanUp = function () { + GenericWorker.prototype.cleanUp.call(this); + this.data = null; +}; + +/** + * @see GenericWorker.resume + */ +DataWorker.prototype.resume = function () { + if(!GenericWorker.prototype.resume.call(this)) { + return false; + } + + if (!this._tickScheduled && this.dataIsReady) { + this._tickScheduled = true; + utils.delay(this._tickAndRepeat, [], this); + } + return true; +}; + +/** + * Trigger a tick a schedule an other call to this function. + */ +DataWorker.prototype._tickAndRepeat = function() { + this._tickScheduled = false; + if(this.isPaused || this.isFinished) { + return; + } + this._tick(); + if(!this.isFinished) { + utils.delay(this._tickAndRepeat, [], this); + this._tickScheduled = true; + } +}; + +/** + * Read and push a chunk. + */ +DataWorker.prototype._tick = function() { + + if(this.isPaused || this.isFinished) { + return false; + } + + var size = DEFAULT_BLOCK_SIZE; + var data = null, nextIndex = Math.min(this.max, this.index + size); + if (this.index >= this.max) { + // EOF + return this.end(); + } else { + switch(this.type) { + case "string": + data = this.data.substring(this.index, nextIndex); + break; + case "uint8array": + data = this.data.subarray(this.index, nextIndex); + break; + case "array": + case "nodebuffer": + data = this.data.slice(this.index, nextIndex); + break; + } + this.index = nextIndex; + return this.push({ + data : data, + meta : { + percent : this.max ? this.index / this.max * 100 : 0 + } + }); + } +}; + +module.exports = DataWorker; + +},{"../utils":32,"./GenericWorker":28}],28:[function(require,module,exports){ +'use strict'; + +/** + * A worker that does nothing but passing chunks to the next one. This is like + * a nodejs stream but with some differences. On the good side : + * - it works on IE 6-9 without any issue / polyfill + * - it weights less than the full dependencies bundled with browserify + * - it forwards errors (no need to declare an error handler EVERYWHERE) + * + * A chunk is an object with 2 attributes : `meta` and `data`. The former is an + * object containing anything (`percent` for example), see each worker for more + * details. The latter is the real data (String, Uint8Array, etc). + * + * @constructor + * @param {String} name the name of the stream (mainly used for debugging purposes) + */ +function GenericWorker(name) { + // the name of the worker + this.name = name || "default"; + // an object containing metadata about the workers chain + this.streamInfo = {}; + // an error which happened when the worker was paused + this.generatedError = null; + // an object containing metadata to be merged by this worker into the general metadata + this.extraStreamInfo = {}; + // true if the stream is paused (and should not do anything), false otherwise + this.isPaused = true; + // true if the stream is finished (and should not do anything), false otherwise + this.isFinished = false; + // true if the stream is locked to prevent further structure updates (pipe), false otherwise + this.isLocked = false; + // the event listeners + this._listeners = { + 'data':[], + 'end':[], + 'error':[] + }; + // the previous worker, if any + this.previous = null; +} + +GenericWorker.prototype = { + /** + * Push a chunk to the next workers. + * @param {Object} chunk the chunk to push + */ + push : function (chunk) { + this.emit("data", chunk); + }, + /** + * End the stream. + * @return {Boolean} true if this call ended the worker, false otherwise. + */ + end : function () { + if (this.isFinished) { + return false; + } + + this.flush(); + try { + this.emit("end"); + this.cleanUp(); + this.isFinished = true; + } catch (e) { + this.emit("error", e); + } + return true; + }, + /** + * End the stream with an error. + * @param {Error} e the error which caused the premature end. + * @return {Boolean} true if this call ended the worker with an error, false otherwise. + */ + error : function (e) { + if (this.isFinished) { + return false; + } + + if(this.isPaused) { + this.generatedError = e; + } else { + this.isFinished = true; + + this.emit("error", e); + + // in the workers chain exploded in the middle of the chain, + // the error event will go downward but we also need to notify + // workers upward that there has been an error. + if(this.previous) { + this.previous.error(e); + } + + this.cleanUp(); + } + return true; + }, + /** + * Add a callback on an event. + * @param {String} name the name of the event (data, end, error) + * @param {Function} listener the function to call when the event is triggered + * @return {GenericWorker} the current object for chainability + */ + on : function (name, listener) { + this._listeners[name].push(listener); + return this; + }, + /** + * Clean any references when a worker is ending. + */ + cleanUp : function () { + this.streamInfo = this.generatedError = this.extraStreamInfo = null; + this._listeners = []; + }, + /** + * Trigger an event. This will call registered callback with the provided arg. + * @param {String} name the name of the event (data, end, error) + * @param {Object} arg the argument to call the callback with. + */ + emit : function (name, arg) { + if (this._listeners[name]) { + for(var i = 0; i < this._listeners[name].length; i++) { + this._listeners[name][i].call(this, arg); + } + } + }, + /** + * Chain a worker with an other. + * @param {Worker} next the worker receiving events from the current one. + * @return {worker} the next worker for chainability + */ + pipe : function (next) { + return next.registerPrevious(this); + }, + /** + * Same as `pipe` in the other direction. + * Using an API with `pipe(next)` is very easy. + * Implementing the API with the point of view of the next one registering + * a source is easier, see the ZipFileWorker. + * @param {Worker} previous the previous worker, sending events to this one + * @return {Worker} the current worker for chainability + */ + registerPrevious : function (previous) { + if (this.isLocked) { + throw new Error("The stream '" + this + "' has already been used."); + } + + // sharing the streamInfo... + this.streamInfo = previous.streamInfo; + // ... and adding our own bits + this.mergeStreamInfo(); + this.previous = previous; + var self = this; + previous.on('data', function (chunk) { + self.processChunk(chunk); + }); + previous.on('end', function () { + self.end(); + }); + previous.on('error', function (e) { + self.error(e); + }); + return this; + }, + /** + * Pause the stream so it doesn't send events anymore. + * @return {Boolean} true if this call paused the worker, false otherwise. + */ + pause : function () { + if(this.isPaused || this.isFinished) { + return false; + } + this.isPaused = true; + + if(this.previous) { + this.previous.pause(); + } + return true; + }, + /** + * Resume a paused stream. + * @return {Boolean} true if this call resumed the worker, false otherwise. + */ + resume : function () { + if(!this.isPaused || this.isFinished) { + return false; + } + this.isPaused = false; + + // if true, the worker tried to resume but failed + var withError = false; + if(this.generatedError) { + this.error(this.generatedError); + withError = true; + } + if(this.previous) { + this.previous.resume(); + } + + return !withError; + }, + /** + * Flush any remaining bytes as the stream is ending. + */ + flush : function () {}, + /** + * Process a chunk. This is usually the method overridden. + * @param {Object} chunk the chunk to process. + */ + processChunk : function(chunk) { + this.push(chunk); + }, + /** + * Add a key/value to be added in the workers chain streamInfo once activated. + * @param {String} key the key to use + * @param {Object} value the associated value + * @return {Worker} the current worker for chainability + */ + withStreamInfo : function (key, value) { + this.extraStreamInfo[key] = value; + this.mergeStreamInfo(); + return this; + }, + /** + * Merge this worker's streamInfo into the chain's streamInfo. + */ + mergeStreamInfo : function () { + for(var key in this.extraStreamInfo) { + if (!this.extraStreamInfo.hasOwnProperty(key)) { + continue; + } + this.streamInfo[key] = this.extraStreamInfo[key]; + } + }, + + /** + * Lock the stream to prevent further updates on the workers chain. + * After calling this method, all calls to pipe will fail. + */ + lock: function () { + if (this.isLocked) { + throw new Error("The stream '" + this + "' has already been used."); + } + this.isLocked = true; + if (this.previous) { + this.previous.lock(); + } + }, + + /** + * + * Pretty print the workers chain. + */ + toString : function () { + var me = "Worker " + this.name; + if (this.previous) { + return this.previous + " -> " + me; + } else { + return me; + } + } +}; + +module.exports = GenericWorker; + +},{}],29:[function(require,module,exports){ +'use strict'; + +var utils = require('../utils'); +var ConvertWorker = require('./ConvertWorker'); +var GenericWorker = require('./GenericWorker'); +var base64 = require('../base64'); +var support = require("../support"); +var external = require("../external"); + +var NodejsStreamOutputAdapter = null; +if (support.nodestream) { + try { + NodejsStreamOutputAdapter = require('../nodejs/NodejsStreamOutputAdapter'); + } catch(e) {} +} + +/** + * Apply the final transformation of the data. If the user wants a Blob for + * example, it's easier to work with an U8intArray and finally do the + * ArrayBuffer/Blob conversion. + * @param {String} type the name of the final type + * @param {String|Uint8Array|Buffer} content the content to transform + * @param {String} mimeType the mime type of the content, if applicable. + * @return {String|Uint8Array|ArrayBuffer|Buffer|Blob} the content in the right format. + */ +function transformZipOutput(type, content, mimeType) { + switch(type) { + case "blob" : + return utils.newBlob(utils.transformTo("arraybuffer", content), mimeType); + case "base64" : + return base64.encode(content); + default : + return utils.transformTo(type, content); + } +} + +/** + * Concatenate an array of data of the given type. + * @param {String} type the type of the data in the given array. + * @param {Array} dataArray the array containing the data chunks to concatenate + * @return {String|Uint8Array|Buffer} the concatenated data + * @throws Error if the asked type is unsupported + */ +function concat (type, dataArray) { + var i, index = 0, res = null, totalLength = 0; + for(i = 0; i < dataArray.length; i++) { + totalLength += dataArray[i].length; + } + switch(type) { + case "string": + return dataArray.join(""); + case "array": + return Array.prototype.concat.apply([], dataArray); + case "uint8array": + res = new Uint8Array(totalLength); + for(i = 0; i < dataArray.length; i++) { + res.set(dataArray[i], index); + index += dataArray[i].length; + } + return res; + case "nodebuffer": + return Buffer.concat(dataArray); + default: + throw new Error("concat : unsupported type '" + type + "'"); + } +} + +/** + * Listen a StreamHelper, accumulate its content and concatenate it into a + * complete block. + * @param {StreamHelper} helper the helper to use. + * @param {Function} updateCallback a callback called on each update. Called + * with one arg : + * - the metadata linked to the update received. + * @return Promise the promise for the accumulation. + */ +function accumulate(helper, updateCallback) { + return new external.Promise(function (resolve, reject){ + var dataArray = []; + var chunkType = helper._internalType, + resultType = helper._outputType, + mimeType = helper._mimeType; + helper + .on('data', function (data, meta) { + dataArray.push(data); + if(updateCallback) { + updateCallback(meta); + } + }) + .on('error', function(err) { + dataArray = []; + reject(err); + }) + .on('end', function (){ + try { + var result = transformZipOutput(resultType, concat(chunkType, dataArray), mimeType); + resolve(result); + } catch (e) { + reject(e); + } + dataArray = []; + }) + .resume(); + }); +} + +/** + * An helper to easily use workers outside of JSZip. + * @constructor + * @param {Worker} worker the worker to wrap + * @param {String} outputType the type of data expected by the use + * @param {String} mimeType the mime type of the content, if applicable. + */ +function StreamHelper(worker, outputType, mimeType) { + var internalType = outputType; + switch(outputType) { + case "blob": + case "arraybuffer": + internalType = "uint8array"; + break; + case "base64": + internalType = "string"; + break; + } + + try { + // the type used internally + this._internalType = internalType; + // the type used to output results + this._outputType = outputType; + // the mime type + this._mimeType = mimeType; + utils.checkSupport(internalType); + this._worker = worker.pipe(new ConvertWorker(internalType)); + // the last workers can be rewired without issues but we need to + // prevent any updates on previous workers. + worker.lock(); + } catch(e) { + this._worker = new GenericWorker("error"); + this._worker.error(e); + } +} + +StreamHelper.prototype = { + /** + * Listen a StreamHelper, accumulate its content and concatenate it into a + * complete block. + * @param {Function} updateCb the update callback. + * @return Promise the promise for the accumulation. + */ + accumulate : function (updateCb) { + return accumulate(this, updateCb); + }, + /** + * Add a listener on an event triggered on a stream. + * @param {String} evt the name of the event + * @param {Function} fn the listener + * @return {StreamHelper} the current helper. + */ + on : function (evt, fn) { + var self = this; + + if(evt === "data") { + this._worker.on(evt, function (chunk) { + fn.call(self, chunk.data, chunk.meta); + }); + } else { + this._worker.on(evt, function () { + utils.delay(fn, arguments, self); + }); + } + return this; + }, + /** + * Resume the flow of chunks. + * @return {StreamHelper} the current helper. + */ + resume : function () { + utils.delay(this._worker.resume, [], this._worker); + return this; + }, + /** + * Pause the flow of chunks. + * @return {StreamHelper} the current helper. + */ + pause : function () { + this._worker.pause(); + return this; + }, + /** + * Return a nodejs stream for this helper. + * @param {Function} updateCb the update callback. + * @return {NodejsStreamOutputAdapter} the nodejs stream. + */ + toNodejsStream : function (updateCb) { + utils.checkSupport("nodestream"); + if (this._outputType !== "nodebuffer") { + // an object stream containing blob/arraybuffer/uint8array/string + // is strange and I don't know if it would be useful. + // I you find this comment and have a good usecase, please open a + // bug report ! + throw new Error(this._outputType + " is not supported by this method"); + } + + return new NodejsStreamOutputAdapter(this, { + objectMode : this._outputType !== "nodebuffer" + }, updateCb); + } +}; + + +module.exports = StreamHelper; + +},{"../base64":1,"../external":6,"../nodejs/NodejsStreamOutputAdapter":13,"../support":30,"../utils":32,"./ConvertWorker":24,"./GenericWorker":28}],30:[function(require,module,exports){ +'use strict'; + +exports.base64 = true; +exports.array = true; +exports.string = true; +exports.arraybuffer = typeof ArrayBuffer !== "undefined" && typeof Uint8Array !== "undefined"; +exports.nodebuffer = typeof Buffer !== "undefined"; +// contains true if JSZip can read/generate Uint8Array, false otherwise. +exports.uint8array = typeof Uint8Array !== "undefined"; + +if (typeof ArrayBuffer === "undefined") { + exports.blob = false; +} +else { + var buffer = new ArrayBuffer(0); + try { + exports.blob = new Blob([buffer], { + type: "application/zip" + }).size === 0; + } + catch (e) { + try { + var Builder = self.BlobBuilder || self.WebKitBlobBuilder || self.MozBlobBuilder || self.MSBlobBuilder; + var builder = new Builder(); + builder.append(buffer); + exports.blob = builder.getBlob('application/zip').size === 0; + } + catch (e) { + exports.blob = false; + } + } +} + +try { + exports.nodestream = !!require('readable-stream').Readable; +} catch(e) { + exports.nodestream = false; +} + +},{"readable-stream":16}],31:[function(require,module,exports){ +'use strict'; + +var utils = require('./utils'); +var support = require('./support'); +var nodejsUtils = require('./nodejsUtils'); +var GenericWorker = require('./stream/GenericWorker'); + +/** + * The following functions come from pako, from pako/lib/utils/strings + * released under the MIT license, see pako https://github.com/nodeca/pako/ + */ + +// Table with utf8 lengths (calculated by first byte of sequence) +// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS, +// because max possible codepoint is 0x10ffff +var _utf8len = new Array(256); +for (var i=0; i<256; i++) { + _utf8len[i] = (i >= 252 ? 6 : i >= 248 ? 5 : i >= 240 ? 4 : i >= 224 ? 3 : i >= 192 ? 2 : 1); +} +_utf8len[254]=_utf8len[254]=1; // Invalid sequence start + +// convert string to array (typed, when possible) +var string2buf = function (str) { + var buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0; + + // count binary size + for (m_pos = 0; m_pos < str_len; m_pos++) { + c = str.charCodeAt(m_pos); + if ((c & 0xfc00) === 0xd800 && (m_pos+1 < str_len)) { + c2 = str.charCodeAt(m_pos+1); + if ((c2 & 0xfc00) === 0xdc00) { + c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00); + m_pos++; + } + } + buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4; + } + + // allocate buffer + if (support.uint8array) { + buf = new Uint8Array(buf_len); + } else { + buf = new Array(buf_len); + } + + // convert + for (i=0, m_pos = 0; i < buf_len; m_pos++) { + c = str.charCodeAt(m_pos); + if ((c & 0xfc00) === 0xd800 && (m_pos+1 < str_len)) { + c2 = str.charCodeAt(m_pos+1); + if ((c2 & 0xfc00) === 0xdc00) { + c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00); + m_pos++; + } + } + if (c < 0x80) { + /* one byte */ + buf[i++] = c; + } else if (c < 0x800) { + /* two bytes */ + buf[i++] = 0xC0 | (c >>> 6); + buf[i++] = 0x80 | (c & 0x3f); + } else if (c < 0x10000) { + /* three bytes */ + buf[i++] = 0xE0 | (c >>> 12); + buf[i++] = 0x80 | (c >>> 6 & 0x3f); + buf[i++] = 0x80 | (c & 0x3f); + } else { + /* four bytes */ + buf[i++] = 0xf0 | (c >>> 18); + buf[i++] = 0x80 | (c >>> 12 & 0x3f); + buf[i++] = 0x80 | (c >>> 6 & 0x3f); + buf[i++] = 0x80 | (c & 0x3f); + } + } + + return buf; +}; + +// Calculate max possible position in utf8 buffer, +// that will not break sequence. If that's not possible +// - (very small limits) return max size as is. +// +// buf[] - utf8 bytes array +// max - length limit (mandatory); +var utf8border = function(buf, max) { + var pos; + + max = max || buf.length; + if (max > buf.length) { max = buf.length; } + + // go back from last position, until start of sequence found + pos = max-1; + while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; } + + // Fuckup - very small and broken sequence, + // return max, because we should return something anyway. + if (pos < 0) { return max; } + + // If we came to start of buffer - that means vuffer is too small, + // return max too. + if (pos === 0) { return max; } + + return (pos + _utf8len[buf[pos]] > max) ? pos : max; +}; + +// convert array to string +var buf2string = function (buf) { + var str, i, out, c, c_len; + var len = buf.length; + + // Reserve max possible length (2 words per char) + // NB: by unknown reasons, Array is significantly faster for + // String.fromCharCode.apply than Uint16Array. + var utf16buf = new Array(len*2); + + for (out=0, i=0; i 4) { utf16buf[out++] = 0xfffd; i += c_len-1; continue; } + + // apply mask on first byte + c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07; + // join the rest + while (c_len > 1 && i < len) { + c = (c << 6) | (buf[i++] & 0x3f); + c_len--; + } + + // terminated by end of string? + if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; } + + if (c < 0x10000) { + utf16buf[out++] = c; + } else { + c -= 0x10000; + utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff); + utf16buf[out++] = 0xdc00 | (c & 0x3ff); + } + } + + // shrinkBuf(utf16buf, out) + if (utf16buf.length !== out) { + if(utf16buf.subarray) { + utf16buf = utf16buf.subarray(0, out); + } else { + utf16buf.length = out; + } + } + + // return String.fromCharCode.apply(null, utf16buf); + return utils.applyFromCharCode(utf16buf); +}; + + +// That's all for the pako functions. + + +/** + * Transform a javascript string into an array (typed if possible) of bytes, + * UTF-8 encoded. + * @param {String} str the string to encode + * @return {Array|Uint8Array|Buffer} the UTF-8 encoded string. + */ +exports.utf8encode = function utf8encode(str) { + if (support.nodebuffer) { + return nodejsUtils.newBufferFrom(str, "utf-8"); + } + + return string2buf(str); +}; + + +/** + * Transform a bytes array (or a representation) representing an UTF-8 encoded + * string into a javascript string. + * @param {Array|Uint8Array|Buffer} buf the data de decode + * @return {String} the decoded string. + */ +exports.utf8decode = function utf8decode(buf) { + if (support.nodebuffer) { + return utils.transformTo("nodebuffer", buf).toString("utf-8"); + } + + buf = utils.transformTo(support.uint8array ? "uint8array" : "array", buf); + + return buf2string(buf); +}; + +/** + * A worker to decode utf8 encoded binary chunks into string chunks. + * @constructor + */ +function Utf8DecodeWorker() { + GenericWorker.call(this, "utf-8 decode"); + // the last bytes if a chunk didn't end with a complete codepoint. + this.leftOver = null; +} +utils.inherits(Utf8DecodeWorker, GenericWorker); + +/** + * @see GenericWorker.processChunk + */ +Utf8DecodeWorker.prototype.processChunk = function (chunk) { + + var data = utils.transformTo(support.uint8array ? "uint8array" : "array", chunk.data); + + // 1st step, re-use what's left of the previous chunk + if (this.leftOver && this.leftOver.length) { + if(support.uint8array) { + var previousData = data; + data = new Uint8Array(previousData.length + this.leftOver.length); + data.set(this.leftOver, 0); + data.set(previousData, this.leftOver.length); + } else { + data = this.leftOver.concat(data); + } + this.leftOver = null; + } + + var nextBoundary = utf8border(data); + var usableData = data; + if (nextBoundary !== data.length) { + if (support.uint8array) { + usableData = data.subarray(0, nextBoundary); + this.leftOver = data.subarray(nextBoundary, data.length); + } else { + usableData = data.slice(0, nextBoundary); + this.leftOver = data.slice(nextBoundary, data.length); + } + } + + this.push({ + data : exports.utf8decode(usableData), + meta : chunk.meta + }); +}; + +/** + * @see GenericWorker.flush + */ +Utf8DecodeWorker.prototype.flush = function () { + if(this.leftOver && this.leftOver.length) { + this.push({ + data : exports.utf8decode(this.leftOver), + meta : {} + }); + this.leftOver = null; + } +}; +exports.Utf8DecodeWorker = Utf8DecodeWorker; + +/** + * A worker to endcode string chunks into utf8 encoded binary chunks. + * @constructor + */ +function Utf8EncodeWorker() { + GenericWorker.call(this, "utf-8 encode"); +} +utils.inherits(Utf8EncodeWorker, GenericWorker); + +/** + * @see GenericWorker.processChunk + */ +Utf8EncodeWorker.prototype.processChunk = function (chunk) { + this.push({ + data : exports.utf8encode(chunk.data), + meta : chunk.meta + }); +}; +exports.Utf8EncodeWorker = Utf8EncodeWorker; + +},{"./nodejsUtils":14,"./stream/GenericWorker":28,"./support":30,"./utils":32}],32:[function(require,module,exports){ +'use strict'; + +var support = require('./support'); +var base64 = require('./base64'); +var nodejsUtils = require('./nodejsUtils'); +var setImmediate = require('set-immediate-shim'); +var external = require("./external"); + + +/** + * Convert a string that pass as a "binary string": it should represent a byte + * array but may have > 255 char codes. Be sure to take only the first byte + * and returns the byte array. + * @param {String} str the string to transform. + * @return {Array|Uint8Array} the string in a binary format. + */ +function string2binary(str) { + var result = null; + if (support.uint8array) { + result = new Uint8Array(str.length); + } else { + result = new Array(str.length); + } + return stringToArrayLike(str, result); +} + +/** + * Create a new blob with the given content and the given type. + * @param {String|ArrayBuffer} part the content to put in the blob. DO NOT use + * an Uint8Array because the stock browser of android 4 won't accept it (it + * will be silently converted to a string, "[object Uint8Array]"). + * + * Use only ONE part to build the blob to avoid a memory leak in IE11 / Edge: + * when a large amount of Array is used to create the Blob, the amount of + * memory consumed is nearly 100 times the original data amount. + * + * @param {String} type the mime type of the blob. + * @return {Blob} the created blob. + */ +exports.newBlob = function(part, type) { + exports.checkSupport("blob"); + + try { + // Blob constructor + return new Blob([part], { + type: type + }); + } + catch (e) { + + try { + // deprecated, browser only, old way + var Builder = self.BlobBuilder || self.WebKitBlobBuilder || self.MozBlobBuilder || self.MSBlobBuilder; + var builder = new Builder(); + builder.append(part); + return builder.getBlob(type); + } + catch (e) { + + // well, fuck ?! + throw new Error("Bug : can't construct the Blob."); + } + } + + +}; +/** + * The identity function. + * @param {Object} input the input. + * @return {Object} the same input. + */ +function identity(input) { + return input; +} + +/** + * Fill in an array with a string. + * @param {String} str the string to use. + * @param {Array|ArrayBuffer|Uint8Array|Buffer} array the array to fill in (will be mutated). + * @return {Array|ArrayBuffer|Uint8Array|Buffer} the updated array. + */ +function stringToArrayLike(str, array) { + for (var i = 0; i < str.length; ++i) { + array[i] = str.charCodeAt(i) & 0xFF; + } + return array; +} + +/** + * An helper for the function arrayLikeToString. + * This contains static informations and functions that + * can be optimized by the browser JIT compiler. + */ +var arrayToStringHelper = { + /** + * Transform an array of int into a string, chunk by chunk. + * See the performances notes on arrayLikeToString. + * @param {Array|ArrayBuffer|Uint8Array|Buffer} array the array to transform. + * @param {String} type the type of the array. + * @param {Integer} chunk the chunk size. + * @return {String} the resulting string. + * @throws Error if the chunk is too big for the stack. + */ + stringifyByChunk: function(array, type, chunk) { + var result = [], k = 0, len = array.length; + // shortcut + if (len <= chunk) { + return String.fromCharCode.apply(null, array); + } + while (k < len) { + if (type === "array" || type === "nodebuffer") { + result.push(String.fromCharCode.apply(null, array.slice(k, Math.min(k + chunk, len)))); + } + else { + result.push(String.fromCharCode.apply(null, array.subarray(k, Math.min(k + chunk, len)))); + } + k += chunk; + } + return result.join(""); + }, + /** + * Call String.fromCharCode on every item in the array. + * This is the naive implementation, which generate A LOT of intermediate string. + * This should be used when everything else fail. + * @param {Array|ArrayBuffer|Uint8Array|Buffer} array the array to transform. + * @return {String} the result. + */ + stringifyByChar: function(array){ + var resultStr = ""; + for(var i = 0; i < array.length; i++) { + resultStr += String.fromCharCode(array[i]); + } + return resultStr; + }, + applyCanBeUsed : { + /** + * true if the browser accepts to use String.fromCharCode on Uint8Array + */ + uint8array : (function () { + try { + return support.uint8array && String.fromCharCode.apply(null, new Uint8Array(1)).length === 1; + } catch (e) { + return false; + } + })(), + /** + * true if the browser accepts to use String.fromCharCode on nodejs Buffer. + */ + nodebuffer : (function () { + try { + return support.nodebuffer && String.fromCharCode.apply(null, nodejsUtils.allocBuffer(1)).length === 1; + } catch (e) { + return false; + } + })() + } +}; + +/** + * Transform an array-like object to a string. + * @param {Array|ArrayBuffer|Uint8Array|Buffer} array the array to transform. + * @return {String} the result. + */ +function arrayLikeToString(array) { + // Performances notes : + // -------------------- + // String.fromCharCode.apply(null, array) is the fastest, see + // see http://jsperf.com/converting-a-uint8array-to-a-string/2 + // but the stack is limited (and we can get huge arrays !). + // + // result += String.fromCharCode(array[i]); generate too many strings ! + // + // This code is inspired by http://jsperf.com/arraybuffer-to-string-apply-performance/2 + // TODO : we now have workers that split the work. Do we still need that ? + var chunk = 65536, + type = exports.getTypeOf(array), + canUseApply = true; + if (type === "uint8array") { + canUseApply = arrayToStringHelper.applyCanBeUsed.uint8array; + } else if (type === "nodebuffer") { + canUseApply = arrayToStringHelper.applyCanBeUsed.nodebuffer; + } + + if (canUseApply) { + while (chunk > 1) { + try { + return arrayToStringHelper.stringifyByChunk(array, type, chunk); + } catch (e) { + chunk = Math.floor(chunk / 2); + } + } + } + + // no apply or chunk error : slow and painful algorithm + // default browser on android 4.* + return arrayToStringHelper.stringifyByChar(array); +} + +exports.applyFromCharCode = arrayLikeToString; + + +/** + * Copy the data from an array-like to an other array-like. + * @param {Array|ArrayBuffer|Uint8Array|Buffer} arrayFrom the origin array. + * @param {Array|ArrayBuffer|Uint8Array|Buffer} arrayTo the destination array which will be mutated. + * @return {Array|ArrayBuffer|Uint8Array|Buffer} the updated destination array. + */ +function arrayLikeToArrayLike(arrayFrom, arrayTo) { + for (var i = 0; i < arrayFrom.length; i++) { + arrayTo[i] = arrayFrom[i]; + } + return arrayTo; +} + +// a matrix containing functions to transform everything into everything. +var transform = {}; + +// string to ? +transform["string"] = { + "string": identity, + "array": function(input) { + return stringToArrayLike(input, new Array(input.length)); + }, + "arraybuffer": function(input) { + return transform["string"]["uint8array"](input).buffer; + }, + "uint8array": function(input) { + return stringToArrayLike(input, new Uint8Array(input.length)); + }, + "nodebuffer": function(input) { + return stringToArrayLike(input, nodejsUtils.allocBuffer(input.length)); + } +}; + +// array to ? +transform["array"] = { + "string": arrayLikeToString, + "array": identity, + "arraybuffer": function(input) { + return (new Uint8Array(input)).buffer; + }, + "uint8array": function(input) { + return new Uint8Array(input); + }, + "nodebuffer": function(input) { + return nodejsUtils.newBufferFrom(input); + } +}; + +// arraybuffer to ? +transform["arraybuffer"] = { + "string": function(input) { + return arrayLikeToString(new Uint8Array(input)); + }, + "array": function(input) { + return arrayLikeToArrayLike(new Uint8Array(input), new Array(input.byteLength)); + }, + "arraybuffer": identity, + "uint8array": function(input) { + return new Uint8Array(input); + }, + "nodebuffer": function(input) { + return nodejsUtils.newBufferFrom(new Uint8Array(input)); + } +}; + +// uint8array to ? +transform["uint8array"] = { + "string": arrayLikeToString, + "array": function(input) { + return arrayLikeToArrayLike(input, new Array(input.length)); + }, + "arraybuffer": function(input) { + return input.buffer; + }, + "uint8array": identity, + "nodebuffer": function(input) { + return nodejsUtils.newBufferFrom(input); + } +}; + +// nodebuffer to ? +transform["nodebuffer"] = { + "string": arrayLikeToString, + "array": function(input) { + return arrayLikeToArrayLike(input, new Array(input.length)); + }, + "arraybuffer": function(input) { + return transform["nodebuffer"]["uint8array"](input).buffer; + }, + "uint8array": function(input) { + return arrayLikeToArrayLike(input, new Uint8Array(input.length)); + }, + "nodebuffer": identity +}; + +/** + * Transform an input into any type. + * The supported output type are : string, array, uint8array, arraybuffer, nodebuffer. + * If no output type is specified, the unmodified input will be returned. + * @param {String} outputType the output type. + * @param {String|Array|ArrayBuffer|Uint8Array|Buffer} input the input to convert. + * @throws {Error} an Error if the browser doesn't support the requested output type. + */ +exports.transformTo = function(outputType, input) { + if (!input) { + // undefined, null, etc + // an empty string won't harm. + input = ""; + } + if (!outputType) { + return input; + } + exports.checkSupport(outputType); + var inputType = exports.getTypeOf(input); + var result = transform[inputType][outputType](input); + return result; +}; + +/** + * Return the type of the input. + * The type will be in a format valid for JSZip.utils.transformTo : string, array, uint8array, arraybuffer. + * @param {Object} input the input to identify. + * @return {String} the (lowercase) type of the input. + */ +exports.getTypeOf = function(input) { + if (typeof input === "string") { + return "string"; + } + if (Object.prototype.toString.call(input) === "[object Array]") { + return "array"; + } + if (support.nodebuffer && nodejsUtils.isBuffer(input)) { + return "nodebuffer"; + } + if (support.uint8array && input instanceof Uint8Array) { + return "uint8array"; + } + if (support.arraybuffer && input instanceof ArrayBuffer) { + return "arraybuffer"; + } +}; + +/** + * Throw an exception if the type is not supported. + * @param {String} type the type to check. + * @throws {Error} an Error if the browser doesn't support the requested type. + */ +exports.checkSupport = function(type) { + var supported = support[type.toLowerCase()]; + if (!supported) { + throw new Error(type + " is not supported by this platform"); + } +}; + +exports.MAX_VALUE_16BITS = 65535; +exports.MAX_VALUE_32BITS = -1; // well, "\xFF\xFF\xFF\xFF\xFF\xFF\xFF\xFF" is parsed as -1 + +/** + * Prettify a string read as binary. + * @param {string} str the string to prettify. + * @return {string} a pretty string. + */ +exports.pretty = function(str) { + var res = '', + code, i; + for (i = 0; i < (str || "").length; i++) { + code = str.charCodeAt(i); + res += '\\x' + (code < 16 ? "0" : "") + code.toString(16).toUpperCase(); + } + return res; +}; + +/** + * Defer the call of a function. + * @param {Function} callback the function to call asynchronously. + * @param {Array} args the arguments to give to the callback. + */ +exports.delay = function(callback, args, self) { + setImmediate(function () { + callback.apply(self || null, args || []); + }); +}; + +/** + * Extends a prototype with an other, without calling a constructor with + * side effects. Inspired by nodejs' `utils.inherits` + * @param {Function} ctor the constructor to augment + * @param {Function} superCtor the parent constructor to use + */ +exports.inherits = function (ctor, superCtor) { + var Obj = function() {}; + Obj.prototype = superCtor.prototype; + ctor.prototype = new Obj(); +}; + +/** + * Merge the objects passed as parameters into a new one. + * @private + * @param {...Object} var_args All objects to merge. + * @return {Object} a new object with the data of the others. + */ +exports.extend = function() { + var result = {}, i, attr; + for (i = 0; i < arguments.length; i++) { // arguments is not enumerable in some browsers + for (attr in arguments[i]) { + if (arguments[i].hasOwnProperty(attr) && typeof result[attr] === "undefined") { + result[attr] = arguments[i][attr]; + } + } + } + return result; +}; + +/** + * Transform arbitrary content into a Promise. + * @param {String} name a name for the content being processed. + * @param {Object} inputData the content to process. + * @param {Boolean} isBinary true if the content is not an unicode string + * @param {Boolean} isOptimizedBinaryString true if the string content only has one byte per character. + * @param {Boolean} isBase64 true if the string content is encoded with base64. + * @return {Promise} a promise in a format usable by JSZip. + */ +exports.prepareContent = function(name, inputData, isBinary, isOptimizedBinaryString, isBase64) { + + // if inputData is already a promise, this flatten it. + var promise = external.Promise.resolve(inputData).then(function(data) { + + + var isBlob = support.blob && (data instanceof Blob || ['[object File]', '[object Blob]'].indexOf(Object.prototype.toString.call(data)) !== -1); + + if (isBlob && typeof FileReader !== "undefined") { + return new external.Promise(function (resolve, reject) { + var reader = new FileReader(); + + reader.onload = function(e) { + resolve(e.target.result); + }; + reader.onerror = function(e) { + reject(e.target.error); + }; + reader.readAsArrayBuffer(data); + }); + } else { + return data; + } + }); + + return promise.then(function(data) { + var dataType = exports.getTypeOf(data); + + if (!dataType) { + return external.Promise.reject( + new Error("Can't read the data of '" + name + "'. Is it " + + "in a supported JavaScript type (String, Blob, ArrayBuffer, etc) ?") + ); + } + // special case : it's way easier to work with Uint8Array than with ArrayBuffer + if (dataType === "arraybuffer") { + data = exports.transformTo("uint8array", data); + } else if (dataType === "string") { + if (isBase64) { + data = base64.decode(data); + } + else if (isBinary) { + // optimizedBinaryString === true means that the file has already been filtered with a 0xFF mask + if (isOptimizedBinaryString !== true) { + // this is a string, not in a base64 format. + // Be sure that this is a correct "binary string" + data = string2binary(data); + } + } + } + return data; + }); +}; + +},{"./base64":1,"./external":6,"./nodejsUtils":14,"./support":30,"set-immediate-shim":54}],33:[function(require,module,exports){ +'use strict'; +var readerFor = require('./reader/readerFor'); +var utils = require('./utils'); +var sig = require('./signature'); +var ZipEntry = require('./zipEntry'); +var utf8 = require('./utf8'); +var support = require('./support'); +// class ZipEntries {{{ +/** + * All the entries in the zip file. + * @constructor + * @param {Object} loadOptions Options for loading the stream. + */ +function ZipEntries(loadOptions) { + this.files = []; + this.loadOptions = loadOptions; +} +ZipEntries.prototype = { + /** + * Check that the reader is on the specified signature. + * @param {string} expectedSignature the expected signature. + * @throws {Error} if it is an other signature. + */ + checkSignature: function(expectedSignature) { + if (!this.reader.readAndCheckSignature(expectedSignature)) { + this.reader.index -= 4; + var signature = this.reader.readString(4); + throw new Error("Corrupted zip or bug: unexpected signature " + "(" + utils.pretty(signature) + ", expected " + utils.pretty(expectedSignature) + ")"); + } + }, + /** + * Check if the given signature is at the given index. + * @param {number} askedIndex the index to check. + * @param {string} expectedSignature the signature to expect. + * @return {boolean} true if the signature is here, false otherwise. + */ + isSignature: function(askedIndex, expectedSignature) { + var currentIndex = this.reader.index; + this.reader.setIndex(askedIndex); + var signature = this.reader.readString(4); + var result = signature === expectedSignature; + this.reader.setIndex(currentIndex); + return result; + }, + /** + * Read the end of the central directory. + */ + readBlockEndOfCentral: function() { + this.diskNumber = this.reader.readInt(2); + this.diskWithCentralDirStart = this.reader.readInt(2); + this.centralDirRecordsOnThisDisk = this.reader.readInt(2); + this.centralDirRecords = this.reader.readInt(2); + this.centralDirSize = this.reader.readInt(4); + this.centralDirOffset = this.reader.readInt(4); + + this.zipCommentLength = this.reader.readInt(2); + // warning : the encoding depends of the system locale + // On a linux machine with LANG=en_US.utf8, this field is utf8 encoded. + // On a windows machine, this field is encoded with the localized windows code page. + var zipComment = this.reader.readData(this.zipCommentLength); + var decodeParamType = support.uint8array ? "uint8array" : "array"; + // To get consistent behavior with the generation part, we will assume that + // this is utf8 encoded unless specified otherwise. + var decodeContent = utils.transformTo(decodeParamType, zipComment); + this.zipComment = this.loadOptions.decodeFileName(decodeContent); + }, + /** + * Read the end of the Zip 64 central directory. + * Not merged with the method readEndOfCentral : + * The end of central can coexist with its Zip64 brother, + * I don't want to read the wrong number of bytes ! + */ + readBlockZip64EndOfCentral: function() { + this.zip64EndOfCentralSize = this.reader.readInt(8); + this.reader.skip(4); + // this.versionMadeBy = this.reader.readString(2); + // this.versionNeeded = this.reader.readInt(2); + this.diskNumber = this.reader.readInt(4); + this.diskWithCentralDirStart = this.reader.readInt(4); + this.centralDirRecordsOnThisDisk = this.reader.readInt(8); + this.centralDirRecords = this.reader.readInt(8); + this.centralDirSize = this.reader.readInt(8); + this.centralDirOffset = this.reader.readInt(8); + + this.zip64ExtensibleData = {}; + var extraDataSize = this.zip64EndOfCentralSize - 44, + index = 0, + extraFieldId, + extraFieldLength, + extraFieldValue; + while (index < extraDataSize) { + extraFieldId = this.reader.readInt(2); + extraFieldLength = this.reader.readInt(4); + extraFieldValue = this.reader.readData(extraFieldLength); + this.zip64ExtensibleData[extraFieldId] = { + id: extraFieldId, + length: extraFieldLength, + value: extraFieldValue + }; + } + }, + /** + * Read the end of the Zip 64 central directory locator. + */ + readBlockZip64EndOfCentralLocator: function() { + this.diskWithZip64CentralDirStart = this.reader.readInt(4); + this.relativeOffsetEndOfZip64CentralDir = this.reader.readInt(8); + this.disksCount = this.reader.readInt(4); + if (this.disksCount > 1) { + throw new Error("Multi-volumes zip are not supported"); + } + }, + /** + * Read the local files, based on the offset read in the central part. + */ + readLocalFiles: function() { + var i, file; + for (i = 0; i < this.files.length; i++) { + file = this.files[i]; + this.reader.setIndex(file.localHeaderOffset); + this.checkSignature(sig.LOCAL_FILE_HEADER); + file.readLocalPart(this.reader); + file.handleUTF8(); + file.processAttributes(); + } + }, + /** + * Read the central directory. + */ + readCentralDir: function() { + var file; + + this.reader.setIndex(this.centralDirOffset); + while (this.reader.readAndCheckSignature(sig.CENTRAL_FILE_HEADER)) { + file = new ZipEntry({ + zip64: this.zip64 + }, this.loadOptions); + file.readCentralPart(this.reader); + this.files.push(file); + } + + if (this.centralDirRecords !== this.files.length) { + if (this.centralDirRecords !== 0 && this.files.length === 0) { + // We expected some records but couldn't find ANY. + // This is really suspicious, as if something went wrong. + throw new Error("Corrupted zip or bug: expected " + this.centralDirRecords + " records in central dir, got " + this.files.length); + } else { + // We found some records but not all. + // Something is wrong but we got something for the user: no error here. + // console.warn("expected", this.centralDirRecords, "records in central dir, got", this.files.length); + } + } + }, + /** + * Read the end of central directory. + */ + readEndOfCentral: function() { + var offset = this.reader.lastIndexOfSignature(sig.CENTRAL_DIRECTORY_END); + if (offset < 0) { + // Check if the content is a truncated zip or complete garbage. + // A "LOCAL_FILE_HEADER" is not required at the beginning (auto + // extractible zip for example) but it can give a good hint. + // If an ajax request was used without responseType, we will also + // get unreadable data. + var isGarbage = !this.isSignature(0, sig.LOCAL_FILE_HEADER); + + if (isGarbage) { + throw new Error("Can't find end of central directory : is this a zip file ? " + + "If it is, see https://stuk.github.io/jszip/documentation/howto/read_zip.html"); + } else { + throw new Error("Corrupted zip: can't find end of central directory"); + } + + } + this.reader.setIndex(offset); + var endOfCentralDirOffset = offset; + this.checkSignature(sig.CENTRAL_DIRECTORY_END); + this.readBlockEndOfCentral(); + + + /* extract from the zip spec : + 4) If one of the fields in the end of central directory + record is too small to hold required data, the field + should be set to -1 (0xFFFF or 0xFFFFFFFF) and the + ZIP64 format record should be created. + 5) The end of central directory record and the + Zip64 end of central directory locator record must + reside on the same disk when splitting or spanning + an archive. + */ + if (this.diskNumber === utils.MAX_VALUE_16BITS || this.diskWithCentralDirStart === utils.MAX_VALUE_16BITS || this.centralDirRecordsOnThisDisk === utils.MAX_VALUE_16BITS || this.centralDirRecords === utils.MAX_VALUE_16BITS || this.centralDirSize === utils.MAX_VALUE_32BITS || this.centralDirOffset === utils.MAX_VALUE_32BITS) { + this.zip64 = true; + + /* + Warning : the zip64 extension is supported, but ONLY if the 64bits integer read from + the zip file can fit into a 32bits integer. This cannot be solved : JavaScript represents + all numbers as 64-bit double precision IEEE 754 floating point numbers. + So, we have 53bits for integers and bitwise operations treat everything as 32bits. + see https://developer.mozilla.org/en-US/docs/JavaScript/Reference/Operators/Bitwise_Operators + and http://www.ecma-international.org/publications/files/ECMA-ST/ECMA-262.pdf section 8.5 + */ + + // should look for a zip64 EOCD locator + offset = this.reader.lastIndexOfSignature(sig.ZIP64_CENTRAL_DIRECTORY_LOCATOR); + if (offset < 0) { + throw new Error("Corrupted zip: can't find the ZIP64 end of central directory locator"); + } + this.reader.setIndex(offset); + this.checkSignature(sig.ZIP64_CENTRAL_DIRECTORY_LOCATOR); + this.readBlockZip64EndOfCentralLocator(); + + // now the zip64 EOCD record + if (!this.isSignature(this.relativeOffsetEndOfZip64CentralDir, sig.ZIP64_CENTRAL_DIRECTORY_END)) { + // console.warn("ZIP64 end of central directory not where expected."); + this.relativeOffsetEndOfZip64CentralDir = this.reader.lastIndexOfSignature(sig.ZIP64_CENTRAL_DIRECTORY_END); + if (this.relativeOffsetEndOfZip64CentralDir < 0) { + throw new Error("Corrupted zip: can't find the ZIP64 end of central directory"); + } + } + this.reader.setIndex(this.relativeOffsetEndOfZip64CentralDir); + this.checkSignature(sig.ZIP64_CENTRAL_DIRECTORY_END); + this.readBlockZip64EndOfCentral(); + } + + var expectedEndOfCentralDirOffset = this.centralDirOffset + this.centralDirSize; + if (this.zip64) { + expectedEndOfCentralDirOffset += 20; // end of central dir 64 locator + expectedEndOfCentralDirOffset += 12 /* should not include the leading 12 bytes */ + this.zip64EndOfCentralSize; + } + + var extraBytes = endOfCentralDirOffset - expectedEndOfCentralDirOffset; + + if (extraBytes > 0) { + // console.warn(extraBytes, "extra bytes at beginning or within zipfile"); + if (this.isSignature(endOfCentralDirOffset, sig.CENTRAL_FILE_HEADER)) { + // The offsets seem wrong, but we have something at the specified offset. + // So… we keep it. + } else { + // the offset is wrong, update the "zero" of the reader + // this happens if data has been prepended (crx files for example) + this.reader.zero = extraBytes; + } + } else if (extraBytes < 0) { + throw new Error("Corrupted zip: missing " + Math.abs(extraBytes) + " bytes."); + } + }, + prepareReader: function(data) { + this.reader = readerFor(data); + }, + /** + * Read a zip file and create ZipEntries. + * @param {String|ArrayBuffer|Uint8Array|Buffer} data the binary string representing a zip file. + */ + load: function(data) { + this.prepareReader(data); + this.readEndOfCentral(); + this.readCentralDir(); + this.readLocalFiles(); + } +}; +// }}} end of ZipEntries +module.exports = ZipEntries; + +},{"./reader/readerFor":22,"./signature":23,"./support":30,"./utf8":31,"./utils":32,"./zipEntry":34}],34:[function(require,module,exports){ +'use strict'; +var readerFor = require('./reader/readerFor'); +var utils = require('./utils'); +var CompressedObject = require('./compressedObject'); +var crc32fn = require('./crc32'); +var utf8 = require('./utf8'); +var compressions = require('./compressions'); +var support = require('./support'); + +var MADE_BY_DOS = 0x00; +var MADE_BY_UNIX = 0x03; + +/** + * Find a compression registered in JSZip. + * @param {string} compressionMethod the method magic to find. + * @return {Object|null} the JSZip compression object, null if none found. + */ +var findCompression = function(compressionMethod) { + for (var method in compressions) { + if (!compressions.hasOwnProperty(method)) { + continue; + } + if (compressions[method].magic === compressionMethod) { + return compressions[method]; + } + } + return null; +}; + +// class ZipEntry {{{ +/** + * An entry in the zip file. + * @constructor + * @param {Object} options Options of the current file. + * @param {Object} loadOptions Options for loading the stream. + */ +function ZipEntry(options, loadOptions) { + this.options = options; + this.loadOptions = loadOptions; +} +ZipEntry.prototype = { + /** + * say if the file is encrypted. + * @return {boolean} true if the file is encrypted, false otherwise. + */ + isEncrypted: function() { + // bit 1 is set + return (this.bitFlag & 0x0001) === 0x0001; + }, + /** + * say if the file has utf-8 filename/comment. + * @return {boolean} true if the filename/comment is in utf-8, false otherwise. + */ + useUTF8: function() { + // bit 11 is set + return (this.bitFlag & 0x0800) === 0x0800; + }, + /** + * Read the local part of a zip file and add the info in this object. + * @param {DataReader} reader the reader to use. + */ + readLocalPart: function(reader) { + var compression, localExtraFieldsLength; + + // we already know everything from the central dir ! + // If the central dir data are false, we are doomed. + // On the bright side, the local part is scary : zip64, data descriptors, both, etc. + // The less data we get here, the more reliable this should be. + // Let's skip the whole header and dash to the data ! + reader.skip(22); + // in some zip created on windows, the filename stored in the central dir contains \ instead of /. + // Strangely, the filename here is OK. + // I would love to treat these zip files as corrupted (see http://www.info-zip.org/FAQ.html#backslashes + // or APPNOTE#4.4.17.1, "All slashes MUST be forward slashes '/'") but there are a lot of bad zip generators... + // Search "unzip mismatching "local" filename continuing with "central" filename version" on + // the internet. + // + // I think I see the logic here : the central directory is used to display + // content and the local directory is used to extract the files. Mixing / and \ + // may be used to display \ to windows users and use / when extracting the files. + // Unfortunately, this lead also to some issues : http://seclists.org/fulldisclosure/2009/Sep/394 + this.fileNameLength = reader.readInt(2); + localExtraFieldsLength = reader.readInt(2); // can't be sure this will be the same as the central dir + // the fileName is stored as binary data, the handleUTF8 method will take care of the encoding. + this.fileName = reader.readData(this.fileNameLength); + reader.skip(localExtraFieldsLength); + + if (this.compressedSize === -1 || this.uncompressedSize === -1) { + throw new Error("Bug or corrupted zip : didn't get enough informations from the central directory " + "(compressedSize === -1 || uncompressedSize === -1)"); + } + + compression = findCompression(this.compressionMethod); + if (compression === null) { // no compression found + throw new Error("Corrupted zip : compression " + utils.pretty(this.compressionMethod) + " unknown (inner file : " + utils.transformTo("string", this.fileName) + ")"); + } + this.decompressed = new CompressedObject(this.compressedSize, this.uncompressedSize, this.crc32, compression, reader.readData(this.compressedSize)); + }, + + /** + * Read the central part of a zip file and add the info in this object. + * @param {DataReader} reader the reader to use. + */ + readCentralPart: function(reader) { + this.versionMadeBy = reader.readInt(2); + reader.skip(2); + // this.versionNeeded = reader.readInt(2); + this.bitFlag = reader.readInt(2); + this.compressionMethod = reader.readString(2); + this.date = reader.readDate(); + this.crc32 = reader.readInt(4); + this.compressedSize = reader.readInt(4); + this.uncompressedSize = reader.readInt(4); + var fileNameLength = reader.readInt(2); + this.extraFieldsLength = reader.readInt(2); + this.fileCommentLength = reader.readInt(2); + this.diskNumberStart = reader.readInt(2); + this.internalFileAttributes = reader.readInt(2); + this.externalFileAttributes = reader.readInt(4); + this.localHeaderOffset = reader.readInt(4); + + if (this.isEncrypted()) { + throw new Error("Encrypted zip are not supported"); + } + + // will be read in the local part, see the comments there + reader.skip(fileNameLength); + this.readExtraFields(reader); + this.parseZIP64ExtraField(reader); + this.fileComment = reader.readData(this.fileCommentLength); + }, + + /** + * Parse the external file attributes and get the unix/dos permissions. + */ + processAttributes: function () { + this.unixPermissions = null; + this.dosPermissions = null; + var madeBy = this.versionMadeBy >> 8; + + // Check if we have the DOS directory flag set. + // We look for it in the DOS and UNIX permissions + // but some unknown platform could set it as a compatibility flag. + this.dir = this.externalFileAttributes & 0x0010 ? true : false; + + if(madeBy === MADE_BY_DOS) { + // first 6 bits (0 to 5) + this.dosPermissions = this.externalFileAttributes & 0x3F; + } + + if(madeBy === MADE_BY_UNIX) { + this.unixPermissions = (this.externalFileAttributes >> 16) & 0xFFFF; + // the octal permissions are in (this.unixPermissions & 0x01FF).toString(8); + } + + // fail safe : if the name ends with a / it probably means a folder + if (!this.dir && this.fileNameStr.slice(-1) === '/') { + this.dir = true; + } + }, + + /** + * Parse the ZIP64 extra field and merge the info in the current ZipEntry. + * @param {DataReader} reader the reader to use. + */ + parseZIP64ExtraField: function(reader) { + + if (!this.extraFields[0x0001]) { + return; + } + + // should be something, preparing the extra reader + var extraReader = readerFor(this.extraFields[0x0001].value); + + // I really hope that these 64bits integer can fit in 32 bits integer, because js + // won't let us have more. + if (this.uncompressedSize === utils.MAX_VALUE_32BITS) { + this.uncompressedSize = extraReader.readInt(8); + } + if (this.compressedSize === utils.MAX_VALUE_32BITS) { + this.compressedSize = extraReader.readInt(8); + } + if (this.localHeaderOffset === utils.MAX_VALUE_32BITS) { + this.localHeaderOffset = extraReader.readInt(8); + } + if (this.diskNumberStart === utils.MAX_VALUE_32BITS) { + this.diskNumberStart = extraReader.readInt(4); + } + }, + /** + * Read the central part of a zip file and add the info in this object. + * @param {DataReader} reader the reader to use. + */ + readExtraFields: function(reader) { + var end = reader.index + this.extraFieldsLength, + extraFieldId, + extraFieldLength, + extraFieldValue; + + if (!this.extraFields) { + this.extraFields = {}; + } + + while (reader.index < end) { + extraFieldId = reader.readInt(2); + extraFieldLength = reader.readInt(2); + extraFieldValue = reader.readData(extraFieldLength); + + this.extraFields[extraFieldId] = { + id: extraFieldId, + length: extraFieldLength, + value: extraFieldValue + }; + } + }, + /** + * Apply an UTF8 transformation if needed. + */ + handleUTF8: function() { + var decodeParamType = support.uint8array ? "uint8array" : "array"; + if (this.useUTF8()) { + this.fileNameStr = utf8.utf8decode(this.fileName); + this.fileCommentStr = utf8.utf8decode(this.fileComment); + } else { + var upath = this.findExtraFieldUnicodePath(); + if (upath !== null) { + this.fileNameStr = upath; + } else { + // ASCII text or unsupported code page + var fileNameByteArray = utils.transformTo(decodeParamType, this.fileName); + this.fileNameStr = this.loadOptions.decodeFileName(fileNameByteArray); + } + + var ucomment = this.findExtraFieldUnicodeComment(); + if (ucomment !== null) { + this.fileCommentStr = ucomment; + } else { + // ASCII text or unsupported code page + var commentByteArray = utils.transformTo(decodeParamType, this.fileComment); + this.fileCommentStr = this.loadOptions.decodeFileName(commentByteArray); + } + } + }, + + /** + * Find the unicode path declared in the extra field, if any. + * @return {String} the unicode path, null otherwise. + */ + findExtraFieldUnicodePath: function() { + var upathField = this.extraFields[0x7075]; + if (upathField) { + var extraReader = readerFor(upathField.value); + + // wrong version + if (extraReader.readInt(1) !== 1) { + return null; + } + + // the crc of the filename changed, this field is out of date. + if (crc32fn(this.fileName) !== extraReader.readInt(4)) { + return null; + } + + return utf8.utf8decode(extraReader.readData(upathField.length - 5)); + } + return null; + }, + + /** + * Find the unicode comment declared in the extra field, if any. + * @return {String} the unicode comment, null otherwise. + */ + findExtraFieldUnicodeComment: function() { + var ucommentField = this.extraFields[0x6375]; + if (ucommentField) { + var extraReader = readerFor(ucommentField.value); + + // wrong version + if (extraReader.readInt(1) !== 1) { + return null; + } + + // the crc of the comment changed, this field is out of date. + if (crc32fn(this.fileComment) !== extraReader.readInt(4)) { + return null; + } + + return utf8.utf8decode(extraReader.readData(ucommentField.length - 5)); + } + return null; + } +}; +module.exports = ZipEntry; + +},{"./compressedObject":2,"./compressions":3,"./crc32":4,"./reader/readerFor":22,"./support":30,"./utf8":31,"./utils":32}],35:[function(require,module,exports){ +'use strict'; + +var StreamHelper = require('./stream/StreamHelper'); +var DataWorker = require('./stream/DataWorker'); +var utf8 = require('./utf8'); +var CompressedObject = require('./compressedObject'); +var GenericWorker = require('./stream/GenericWorker'); + +/** + * A simple object representing a file in the zip file. + * @constructor + * @param {string} name the name of the file + * @param {String|ArrayBuffer|Uint8Array|Buffer} data the data + * @param {Object} options the options of the file + */ +var ZipObject = function(name, data, options) { + this.name = name; + this.dir = options.dir; + this.date = options.date; + this.comment = options.comment; + this.unixPermissions = options.unixPermissions; + this.dosPermissions = options.dosPermissions; + + this._data = data; + this._dataBinary = options.binary; + // keep only the compression + this.options = { + compression : options.compression, + compressionOptions : options.compressionOptions + }; +}; + +ZipObject.prototype = { + /** + * Create an internal stream for the content of this object. + * @param {String} type the type of each chunk. + * @return StreamHelper the stream. + */ + internalStream: function (type) { + var result = null, outputType = "string"; + try { + if (!type) { + throw new Error("No output type specified."); + } + outputType = type.toLowerCase(); + var askUnicodeString = outputType === "string" || outputType === "text"; + if (outputType === "binarystring" || outputType === "text") { + outputType = "string"; + } + result = this._decompressWorker(); + + var isUnicodeString = !this._dataBinary; + + if (isUnicodeString && !askUnicodeString) { + result = result.pipe(new utf8.Utf8EncodeWorker()); + } + if (!isUnicodeString && askUnicodeString) { + result = result.pipe(new utf8.Utf8DecodeWorker()); + } + } catch (e) { + result = new GenericWorker("error"); + result.error(e); + } + + return new StreamHelper(result, outputType, ""); + }, + + /** + * Prepare the content in the asked type. + * @param {String} type the type of the result. + * @param {Function} onUpdate a function to call on each internal update. + * @return Promise the promise of the result. + */ + async: function (type, onUpdate) { + return this.internalStream(type).accumulate(onUpdate); + }, + + /** + * Prepare the content as a nodejs stream. + * @param {String} type the type of each chunk. + * @param {Function} onUpdate a function to call on each internal update. + * @return Stream the stream. + */ + nodeStream: function (type, onUpdate) { + return this.internalStream(type || "nodebuffer").toNodejsStream(onUpdate); + }, + + /** + * Return a worker for the compressed content. + * @private + * @param {Object} compression the compression object to use. + * @param {Object} compressionOptions the options to use when compressing. + * @return Worker the worker. + */ + _compressWorker: function (compression, compressionOptions) { + if ( + this._data instanceof CompressedObject && + this._data.compression.magic === compression.magic + ) { + return this._data.getCompressedWorker(); + } else { + var result = this._decompressWorker(); + if(!this._dataBinary) { + result = result.pipe(new utf8.Utf8EncodeWorker()); + } + return CompressedObject.createWorkerFrom(result, compression, compressionOptions); + } + }, + /** + * Return a worker for the decompressed content. + * @private + * @return Worker the worker. + */ + _decompressWorker : function () { + if (this._data instanceof CompressedObject) { + return this._data.getContentWorker(); + } else if (this._data instanceof GenericWorker) { + return this._data; + } else { + return new DataWorker(this._data); + } + } +}; + +var removedMethods = ["asText", "asBinary", "asNodeBuffer", "asUint8Array", "asArrayBuffer"]; +var removedFn = function () { + throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide."); +}; + +for(var i = 0; i < removedMethods.length; i++) { + ZipObject.prototype[removedMethods[i]] = removedFn; +} +module.exports = ZipObject; + +},{"./compressedObject":2,"./stream/DataWorker":27,"./stream/GenericWorker":28,"./stream/StreamHelper":29,"./utf8":31}],36:[function(require,module,exports){ +(function (global){ +'use strict'; +var Mutation = global.MutationObserver || global.WebKitMutationObserver; + +var scheduleDrain; + +{ + if (Mutation) { + var called = 0; + var observer = new Mutation(nextTick); + var element = global.document.createTextNode(''); + observer.observe(element, { + characterData: true + }); + scheduleDrain = function () { + element.data = (called = ++called % 2); + }; + } else if (!global.setImmediate && typeof global.MessageChannel !== 'undefined') { + var channel = new global.MessageChannel(); + channel.port1.onmessage = nextTick; + scheduleDrain = function () { + channel.port2.postMessage(0); + }; + } else if ('document' in global && 'onreadystatechange' in global.document.createElement('script')) { + scheduleDrain = function () { + + // Create a + + + + + + +var pathtoroot = "../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
+ +
+
-
org.cicirello.math
+
Package org.cicirello.math

Class MathFunctions

@@ -163,21 +192,22 @@

Methods inherited from class java.lang.
  • +
      -
    • +

    • Method Detail

      - +

      • pow

        -
        public static double pow(double a,
+
        public static double pow​(double a,
                          int b)
        
 
        Computes ab, where the exponent b is an integer.
- This is more efficient than using Math.pow(double, double) since
+ This is more efficient than using Math.pow(double, double) since
  it exploits the integer type of the exponent.
        
 
        
 
        Parameters:
        
@@ -188,13 +218,13 @@ 
        pow
      - +

      • logGamma

        -
        public static double logGamma(double n)
        +
        public static double logGamma​(double n)
        Implementation of the natural log of the absolute value of the gamma function.
        @@ -207,21 +237,25 @@

        logGamma

    +
    • +

    + diff --git a/docs/api/org/cicirello/math/la/JacobiDiagonalization.html b/docs/api/org/cicirello/math/la/JacobiDiagonalization.html index 5b8b113d..7464f836 100644 --- a/docs/api/org/cicirello/math/la/JacobiDiagonalization.html +++ b/docs/api/org/cicirello/math/la/JacobiDiagonalization.html @@ -1,11 +1,21 @@ - + JacobiDiagonalization (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.math.la
    +
    Package org.cicirello.math.la

    Class JacobiDiagonalization

    @@ -237,12 +280,13 @@

    Methods inherited from class java.lang.
  • +
      -
    • +

    • Field Detail

      - +
        @@ -256,7 +300,7 @@

        EPSILON

      - +
        @@ -272,19 +316,21 @@

        MAX_ITERATIONS

    +
    +
      -
    • +

    • Constructor Detail

      - +

      • JacobiDiagonalization

        -
        public JacobiDiagonalization(int[][] matrix)
        +
        public JacobiDiagonalization​(int[][] matrix)
        Initializes a Jacobi iteration for finding eigenvalues and eigenvectors of a matrix.
        Parameters:
        @@ -292,13 +338,13 @@

        JacobiDiagonalization

      - +

      • JacobiDiagonalization

        -
        public JacobiDiagonalization(double[][] matrix)
        +
        public JacobiDiagonalization​(double[][] matrix)
        Initializes a Jacobi iteration for finding eigenvalues and eigenvectors of a matrix.
        Parameters:
        @@ -308,19 +354,21 @@

        JacobiDiagonalization

    +
    +
      -
    • +

    • Method Detail

      - +

      • eigenvectors

        -
        public double[][] eigenvectors()
        +
        public double[][] eigenvectors()
        Gets the computed eigenvectors.
        Returns:
        @@ -328,13 +376,13 @@

        eigenvectors

      - +

      • eigenvalues

        -
        public double[] eigenvalues()
        +
        public double[] eigenvalues()
        Gets the computed eigenvalues.
        Returns:
        @@ -342,13 +390,13 @@

        eigenvalues

      - +

      • compute

        -
        public boolean compute()
        +
        public boolean compute()
        Computes the eigenvalues and eigenvectors using Jacobi Iteration. Uses the default precision level JacobiDiagonalization.EPSILON where off-diagonal elements less than JacobiDiagonalization.EPSILON in absolute value are set to 0. Uses the default max number of iterations JacobiDiagonalization.MAX_ITERATIONS.
        @@ -358,13 +406,13 @@

        compute

      - +

      • compute

        -
        public boolean compute(double epsilon)
        +
        public boolean compute​(double epsilon)
        Computes the eigenvalues and eigenvectors using Jacobi Iteration. Uses the default max number of iterations JacobiDiagonalization.MAX_ITERATIONS.
        Parameters:
        @@ -374,13 +422,13 @@

        compute

      - +

      • compute

        -
        public boolean compute(int maxIters)
        +
        public boolean compute​(int maxIters)
        Computes the eigenvalues and eigenvectors using Jacobi Iteration. Uses the default precision level JacobiDiagonalization.EPSILON where off-diagonal elements less than JacobiDiagonalization.EPSILON in absolute value are set to 0.
        @@ -391,13 +439,13 @@

        compute

      - +

      • compute

        -
        public boolean compute(double epsilon,
+
        public boolean compute​(double epsilon,
                        int maxIters)
        
 
        Computes the eigenvalues and eigenvectors using Jacobi Iteration.
        
 
        
@@ -411,21 +459,25 @@ 
        compute
    +
    • +

    + diff --git a/docs/api/org/cicirello/math/la/MatrixOps.html b/docs/api/org/cicirello/math/la/MatrixOps.html index 51358bea..23082a8c 100644 --- a/docs/api/org/cicirello/math/la/MatrixOps.html +++ b/docs/api/org/cicirello/math/la/MatrixOps.html @@ -1,11 +1,21 @@ - + MatrixOps (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.math.la
    +
    Package org.cicirello.math.la

    Class MatrixOps

      -
    • java.lang.Object
      • +
    • java.lang.Object
      • org.cicirello.math.la.MatrixOps
        • @@ -106,9 +131,8 @@

        Class MatrixOps

        • -
          public final class MatrixOps
-extends Object
          +extends Object
          Utility class of basic linear algebra matrix operations, where matrices are represented as 2-D Java arrays.
          @@ -122,129 +146,146 @@

          Class MatrixOps

    @@ -252,18 +293,19 @@

    Methods inherited from class java.lang.
  • +
      -
    • +

    • Method Detail

      - +

      • transposeSquareMatrixInline

        -
        public static int[][] transposeSquareMatrixInline(int[][] matrix)
        +
        public static int[][] transposeSquareMatrixInline​(int[][] matrix)
        Transpose a square matrix inline.
        Parameters:
        @@ -274,13 +316,13 @@

        transposeSquareMatrixInline

      - +

      • transposeSquareMatrixInline

        -
        public static double[][] transposeSquareMatrixInline(double[][] matrix)
        +
        public static double[][] transposeSquareMatrixInline​(double[][] matrix)
        Transpose a square matrix inline.
        Parameters:
        @@ -291,13 +333,13 @@

        transposeSquareMatrixInline

      - +

      • sum

        -
        public static int[][] sum(int[][] A,
+
        public static int[][] sum​(int[][] A,
                           int[][] B,
                           int[][] C)
        
 
        Computes C = A + B.
        
@@ -311,13 +353,13 @@ 
        sum
      - +

      • sum

        -
        public static double[][] sum(double[][] A,
+
        public static double[][] sum​(double[][] A,
                              double[][] B,
                              double[][] C)
        
 
        Computes C = A + B.
        
@@ -331,13 +373,13 @@ 
        sum
      - +

      • sum

        -
        public static int[][] sum(int[][] A,
+
        public static int[][] sum​(int[][] A,
                           int[][] B)
        
 
        Computes C = A + B.
        
 
        
@@ -349,13 +391,13 @@ 
        sum
      - +

      • sum

        -
        public static double[][] sum(double[][] A,
+
        public static double[][] sum​(double[][] A,
                              double[][] B)
        
 
        Computes C = A + B.
        
 
        
@@ -367,13 +409,13 @@ 
        sum
      - +

      • difference

        -
        public static int[][] difference(int[][] A,
+
        public static int[][] difference​(int[][] A,
                                  int[][] B,
                                  int[][] C)
        
 
        Computes C = A - B.
        
@@ -387,13 +429,13 @@ 
        difference
      - +

      • difference

        -
        public static double[][] difference(double[][] A,
+
        public static double[][] difference​(double[][] A,
                                     double[][] B,
                                     double[][] C)
        
 
        Computes C = A - B.
        
@@ -407,13 +449,13 @@ 
        difference
      - +

      • difference

        -
        public static int[][] difference(int[][] A,
+
        public static int[][] difference​(int[][] A,
                                  int[][] B)
        
 
        Computes C = A - B.
        
 
        
@@ -425,13 +467,13 @@ 
        difference
      - +

      • difference

        -
        public static double[][] difference(double[][] A,
+
        public static double[][] difference​(double[][] A,
                                     double[][] B)
        
 
        Computes C = A - B.
        
 
        
@@ -443,13 +485,13 @@ 
        difference
      - +

      • product

        -
        public static int[][] product(int[][] A,
+
        public static int[][] product​(int[][] A,
                               int[][] B,
                               int[][] C)
        
 
        Computes C = A * B.
        
@@ -463,13 +505,13 @@ 
        product
      - +

      • product

        -
        public static double[][] product(double[][] A,
+
        public static double[][] product​(double[][] A,
                                  double[][] B,
                                  double[][] C)
        
 
        Computes C = A * B.
        
@@ -483,13 +525,13 @@ 
        product
      - +

      • product

        -
        public static int[][] product(int[][] A,
+
        public static int[][] product​(int[][] A,
                               int[][] B)
        
 
        Computes C = A * B.
        
 
        
@@ -501,13 +543,13 @@ 
        product
      - +

      • product

        -
        public static double[][] product(double[][] A,
+
        public static double[][] product​(double[][] A,
                                  double[][] B)
        
 
        Computes C = A * B.
        
 
        
@@ -521,21 +563,25 @@ 
        product
    +
    • +

    + diff --git a/docs/api/org/cicirello/math/la/package-frame.html b/docs/api/org/cicirello/math/la/package-frame.html deleted file mode 100644 index b01f2730..00000000 --- a/docs/api/org/cicirello/math/la/package-frame.html +++ /dev/null @@ -1,20 +0,0 @@ - - - - - -org.cicirello.math.la (JavaPermutationTools - A Java API for computation on permutations) - - - - -

    org.cicirello.math.la

    -
    -

    Classes

    - -
    - - diff --git a/docs/api/org/cicirello/math/la/package-summary.html b/docs/api/org/cicirello/math/la/package-summary.html index 6e6d26b9..c4156b2e 100644 --- a/docs/api/org/cicirello/math/la/package-summary.html +++ b/docs/api/org/cicirello/math/la/package-summary.html @@ -1,11 +1,21 @@ - + org.cicirello.math.la (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +

    Package org.cicirello.math.la

    -
    -
    Collection of classes related to linear algebra.
    -
    -

    See: Description

    +
    + + +
    Collection of classes related to linear algebra.
    +
    +
    Since:
    +
    1.3
    +
    +
    • - +
      @@ -85,13 +115,13 @@

      Package org.cicirello.math.la

      - + - +
      Class Summary 
      Class
      JacobiDiagonalizationJacobiDiagonalization
      This class uses Jacobi iteration to compute the eigenvalues and eigenvectors of a symmetric matrix, provided as a 2-D Java array.
      MatrixOpsMatrixOps
      Utility class of basic linear algebra matrix operations, where matrices are represented as 2-D Java arrays.
      @@ -101,26 +131,20 @@

      Package org.cicirello.math.la

    - - - -

    Package org.cicirello.math.la Description

    -
    Collection of classes related to linear algebra.
    -
    -
    Since:
    -
    1.3
    -
    +
    + diff --git a/docs/api/org/cicirello/math/la/package-tree.html b/docs/api/org/cicirello/math/la/package-tree.html index 61f1da52..9f6d759f 100644 --- a/docs/api/org/cicirello/math/la/package-tree.html +++ b/docs/api/org/cicirello/math/la/package-tree.html @@ -1,11 +1,21 @@ - + org.cicirello.math.la Class Hierarchy (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +

    Hierarchy For Package org.cicirello.math.la

    Package Hierarchies: @@ -75,26 +100,31 @@

    Hierarchy For Package org.cicirello.math.la

    +

    Class Hierarchy

    +
    +
    + diff --git a/docs/api/org/cicirello/math/package-frame.html b/docs/api/org/cicirello/math/package-frame.html deleted file mode 100644 index f7597637..00000000 --- a/docs/api/org/cicirello/math/package-frame.html +++ /dev/null @@ -1,19 +0,0 @@ - - - - - -org.cicirello.math (JavaPermutationTools - A Java API for computation on permutations) - - - - -

    org.cicirello.math

    -
    -

    Classes

    - -
    - - diff --git a/docs/api/org/cicirello/math/package-summary.html b/docs/api/org/cicirello/math/package-summary.html index 05f85eb3..9a9b6205 100644 --- a/docs/api/org/cicirello/math/package-summary.html +++ b/docs/api/org/cicirello/math/package-summary.html @@ -1,11 +1,21 @@ - + org.cicirello.math (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +

    Package org.cicirello.math

    -
    -
    Collection of classes related to a variety of mathematical concepts.
    -
    -

    See: Description

    +
    + + +
    Collection of classes related to a variety of mathematical concepts.
    +
    +
    Since:
    +
    2.0
    +
    +
    • - +
      @@ -85,7 +115,7 @@

      Package org.cicirello.math

      - + @@ -94,26 +124,20 @@

      Package org.cicirello.math

      Class Summary 
      Class
      MathFunctionsMathFunctions
      MathFunctions is a class of utility methods that implement various mathematical functions.
    - - - -

    Package org.cicirello.math Description

    -
    Collection of classes related to a variety of mathematical concepts.
    -
    -
    Since:
    -
    2.0
    -
    +
    + diff --git a/docs/api/org/cicirello/math/package-tree.html b/docs/api/org/cicirello/math/package-tree.html index c10ffad1..50e3c889 100644 --- a/docs/api/org/cicirello/math/package-tree.html +++ b/docs/api/org/cicirello/math/package-tree.html @@ -1,11 +1,21 @@ - + org.cicirello.math Class Hierarchy (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +

    Hierarchy For Package org.cicirello.math

    Package Hierarchies: @@ -75,25 +100,30 @@

    Hierarchy For Package org.cicirello.math

    +

    Class Hierarchy

    +
    +
    + diff --git a/docs/api/org/cicirello/math/rand/RandomIndexer.html b/docs/api/org/cicirello/math/rand/RandomIndexer.html index 4d8d6f00..1d2d25e8 100644 --- a/docs/api/org/cicirello/math/rand/RandomIndexer.html +++ b/docs/api/org/cicirello/math/rand/RandomIndexer.html @@ -1,11 +1,21 @@ - + RandomIndexer (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.math.rand
    +
    Package org.cicirello.math.rand

    Class RandomIndexer

      -
    • java.lang.Object
      • +
    • java.lang.Object
      • org.cicirello.math.rand.RandomIndexer
        • @@ -106,9 +131,8 @@

        Class RandomIndexer

        • -
          public final class RandomIndexer
-extends Object
          +extends Object
          RandomIndexer is a class of utility methods related to efficiently generating random indexes, and combination of indexes, into arrays. The methods of this class neither directly operate, nor depend, on arrays, and can thus @@ -125,247 +149,277 @@

          Class RandomIndexer

          • +
              -
            • +

            • Method Summary

              - +
              - + + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - +
              All Methods Static Methods Concrete Methods 
              Modifier and TypeMethod and DescriptionMethodDescription
              static boolean[]arrayMask(int n) +arrayMask​(int n)
              Generates an "array mask" of a specified length, where an "array mask" is an array of boolean values of the same length as another array.
              static boolean[]arrayMask(int n, - double p) +arrayMask​(int n, + double p)
              Generates an "array mask" of a specified length, where an "array mask" is an array of boolean values of the same length as another array.
              static boolean[]arrayMask(int n, +arrayMask​(int n, double p, - Random gen) + Random gen)
              Generates an "array mask" of a specified length, where an "array mask" is an array of boolean values of the same length as another array.
              static boolean[]arrayMask(int n, +arrayMask​(int n, double p, - SplittableRandom gen) + SplittableRandom gen)
              Generates an "array mask" of a specified length, where an "array mask" is an array of boolean values of the same length as another array.
              static boolean[]arrayMask(int n, - int k) +arrayMask​(int n, + int k)
              Generates an "array mask" of a specified length and specified number of true values, where an "array mask" is an array of boolean values of the same length as another array.
              static boolean[]arrayMask(int n, +arrayMask​(int n, int k, - Random gen) + Random gen)
              Generates an "array mask" of a specified length and specified number of true values, where an "array mask" is an array of boolean values of the same length as another array.
              static boolean[]arrayMask(int n, +arrayMask​(int n, int k, - SplittableRandom gen) + SplittableRandom gen)
              Generates an "array mask" of a specified length and specified number of true values, where an "array mask" is an array of boolean values of the same length as another array.
              static boolean[]arrayMask(int n, - Random gen) +arrayMask​(int n, + Random gen)
              Generates an "array mask" of a specified length, where an "array mask" is an array of boolean values of the same length as another array.
              static boolean[]arrayMask(int n, - SplittableRandom gen) +arrayMask​(int n, + SplittableRandom gen)
              Generates an "array mask" of a specified length, where an "array mask" is an array of boolean values of the same length as another array.
              static intnextBiasedInt(int bound) +nextBiasedInt​(int bound)
              Generates a random integer in the interval: [0, bound).
              static intnextBiasedInt(int bound, - Random gen) +nextBiasedInt​(int bound, + Random gen)
              Generates a random integer in the interval: [0, bound).
              static intnextBiasedInt(int bound, - SplittableRandom gen) +nextBiasedInt​(int bound, + SplittableRandom gen)
              Generates a random integer in the interval: [0, bound).
              static intnextInt(int bound) +nextInt​(int bound)
              Generates a random integer uniformly distributed in the interval: [0, bound).
              static intnextInt(int bound, - Random gen) +nextInt​(int bound, + Random gen)
              Generates a random integer uniformly distributed in the interval: [0, bound).
              static intnextInt(int bound, - SplittableRandom gen) +nextInt​(int bound, + SplittableRandom gen)
              Generates a random integer uniformly distributed in the interval: [0, bound).
              static int[]nextIntPair(int n, - int[] result) +nextIntPair​(int n, + int[] result)
              Generates a random sample of 2 integers, without replacement, from the set of integers in the interval [0, n).
              static int[]nextIntPair(int n, +nextIntPair​(int n, int[] result, - Random gen) + Random gen)
              Generates a random sample of 2 integers, without replacement, from the set of integers in the interval [0, n).
              static int[]nextIntPair(int n, +nextIntPair​(int n, int[] result, - SplittableRandom gen) + SplittableRandom gen)
              Generates a random sample of 2 integers, without replacement, from the set of integers in the interval [0, n).
              static int[]nextIntTriple(int n, - int[] result) +nextIntTriple​(int n, + int[] result)
              Generates a random sample of 3 integers, without replacement, from the set of integers in the interval [0, n).
              static int[]nextIntTriple(int n, +nextIntTriple​(int n, int[] result, - boolean sort) + boolean sort)
              Generates a random sample of 3 integers, without replacement, from the set of integers in the interval [0, n).
              static int[]nextIntTriple(int n, +nextIntTriple​(int n, int[] result, boolean sort, - Random gen) + Random gen)
              Generates a random sample of 3 integers, without replacement, from the set of integers in the interval [0, n).
              static int[]nextIntTriple(int n, +nextIntTriple​(int n, int[] result, boolean sort, - SplittableRandom gen) + SplittableRandom gen)
              Generates a random sample of 3 integers, without replacement, from the set of integers in the interval [0, n).
              static int[]nextIntTriple(int n, +nextIntTriple​(int n, int[] result, - Random gen) + Random gen)
              Generates a random sample of 3 integers, without replacement, from the set of integers in the interval [0, n).
              static int[]nextIntTriple(int n, +nextIntTriple​(int n, int[] result, - SplittableRandom gen) + SplittableRandom gen)
              Generates a random sample of 3 integers, without replacement, from the set of integers in the interval [0, n).
              static int[]nextWindowedIntPair(int n, +nextWindowedIntPair​(int n, int window, - int[] result) + int[] result)
              Generates a random sample of 2 integers, i, j, without replacement, from the set of integers in the interval [0, n), such that |i-j| ≤ window.
              static int[]nextWindowedIntPair(int n, +nextWindowedIntPair​(int n, int window, int[] result, - Random gen) + Random gen)
              Generates a random sample of 2 integers, i, j, without replacement, from the set of integers in the interval [0, n), such that |i-j| ≤ window.
              static int[]nextWindowedIntPair(int n, +nextWindowedIntPair​(int n, int window, int[] result, - SplittableRandom gen) + SplittableRandom gen)
              Generates a random sample of 2 integers, i, j, without replacement, from the set of integers in the interval [0, n), such that |i-j| ≤ window.
              static int[]nextWindowedIntTriple(int n, +nextWindowedIntTriple​(int n, int window, - int[] result) + int[] result)
              Generates a random sample of 3 integers, i, j, k without replacement, from the set of integers in the interval [0, n), such that |i-j| ≤ window, and |i-k| ≤ window, and |k-j| ≤ window.
              @@ -373,10 +427,11 @@

              Method Summary

              static int[]nextWindowedIntTriple(int n, +nextWindowedIntTriple​(int n, int window, int[] result, - boolean sort) + boolean sort)
              Generates a random sample of 3 integers, i, j, k without replacement, from the set of integers in the interval [0, n), such that |i-j| ≤ window, and |i-k| ≤ window, and |k-j| ≤ window.
              @@ -384,11 +439,12 @@

              Method Summary

              static int[]nextWindowedIntTriple(int n, +nextWindowedIntTriple​(int n, int window, int[] result, boolean sort, - Random gen) + Random gen)
              Generates a random sample of 3 integers, i, j, k without replacement, from the set of integers in the interval [0, n), such that |i-j| ≤ window, and |i-k| ≤ window, and |k-j| ≤ window.
              @@ -396,11 +452,12 @@

              Method Summary

              static int[]nextWindowedIntTriple(int n, +nextWindowedIntTriple​(int n, int window, int[] result, boolean sort, - SplittableRandom gen) + SplittableRandom gen)
              Generates a random sample of 3 integers, i, j, k without replacement, from the set of integers in the interval [0, n), such that |i-j| ≤ window, and |i-k| ≤ window, and |k-j| ≤ window.
              @@ -408,10 +465,11 @@

              Method Summary

              static int[]nextWindowedIntTriple(int n, +nextWindowedIntTriple​(int n, int window, int[] result, - Random gen) + Random gen)
              Generates a random sample of 3 integers, i, j, k without replacement, from the set of integers in the interval [0, n), such that |i-j| ≤ window, and |i-k| ≤ window, and |k-j| ≤ window.
              @@ -419,10 +477,11 @@

              Method Summary

              static int[]nextWindowedIntTriple(int n, +nextWindowedIntTriple​(int n, int window, int[] result, - SplittableRandom gen) + SplittableRandom gen)
              Generates a random sample of 3 integers, i, j, k without replacement, from the set of integers in the interval [0, n), such that |i-j| ≤ window, and |i-k| ≤ window, and |k-j| ≤ window.
              @@ -430,156 +489,172 @@

              Method Summary

              static int[]sample(int n, - double p) +sample​(int n, + double p)
              Generates a random sample, without replacement, from the set of integers in the interval [0, n).
              static int[]sample(int n, +sample​(int n, double p, - Random r) + Random r)
              Generates a random sample, without replacement, from the set of integers in the interval [0, n).
              static int[]sample(int n, +sample​(int n, double p, - SplittableRandom r) + SplittableRandom r)
              Generates a random sample, without replacement, from the set of integers in the interval [0, n).
              static int[]sample(int n, +sample​(int n, int k, - int[] result) + int[] result)
              Generates a random sample of k integers, without replacement, from the set of integers in the interval [0, n).
              static int[]sample(int n, +sample​(int n, int k, int[] result, - Random gen) + Random gen)
              Generates a random sample of k integers, without replacement, from the set of integers in the interval [0, n).
              static int[]sample(int n, +sample​(int n, int k, int[] result, - SplittableRandom gen) + SplittableRandom gen)
              Generates a random sample of k integers, without replacement, from the set of integers in the interval [0, n).
              static int[]sampleInsertion(int n, +sampleInsertion​(int n, int k, - int[] result) + int[] result)
              Generates a random sample of k integers, without replacement, from the set of integers in the interval [0, n).
              static int[]sampleInsertion(int n, +sampleInsertion​(int n, int k, int[] result, - Random gen) + Random gen)
              Generates a random sample of k integers, without replacement, from the set of integers in the interval [0, n).
              static int[]sampleInsertion(int n, +sampleInsertion​(int n, int k, int[] result, - SplittableRandom gen) + SplittableRandom gen)
              Generates a random sample of k integers, without replacement, from the set of integers in the interval [0, n).
              static int[]samplePool(int n, +samplePool​(int n, int k, - int[] result) + int[] result)
              Generates a random sample of k integers, without replacement, from the set of integers in the interval [0, n).
              static int[]samplePool(int n, +samplePool​(int n, int k, int[] result, - Random gen) + Random gen)
              Generates a random sample of k integers, without replacement, from the set of integers in the interval [0, n).
              static int[]samplePool(int n, +samplePool​(int n, int k, int[] result, - SplittableRandom gen) + SplittableRandom gen)
              Generates a random sample of k integers, without replacement, from the set of integers in the interval [0, n).
              static int[]sampleReservoir(int n, +sampleReservoir​(int n, int k, - int[] result) + int[] result)
              Generates a random sample of k integers, without replacement, from the set of integers in the interval [0, n).
              static int[]sampleReservoir(int n, +sampleReservoir​(int n, int k, int[] result, - Random gen) + Random gen)
              Generates a random sample of k integers, without replacement, from the set of integers in the interval [0, n).
              static int[]sampleReservoir(int n, +sampleReservoir​(int n, int k, int[] result, - SplittableRandom gen) + SplittableRandom gen)
              Generates a random sample of k integers, without replacement, from the set of integers in the interval [0, n).
            +
          @@ -587,18 +662,19 @@

          Methods inherited from class java.lang.
        • +
            -
          • +

          • Method Detail

            - +

            • nextInt

              -
              public static int nextInt(int bound)
              +
              public static int nextInt​(int bound)

              Generates a random integer uniformly distributed in the interval: [0, bound).

              This method uses ThreadLocalRandom as the pseudorandom number generator, and is thus safe, and efficient (i.e., non-blocking), for use with threads. However, @@ -613,18 +689,18 @@

              nextInt

              Returns:
              a random integer between 0 (inclusive) and bound (exclusive).
              Throws:
              -
              IllegalArgumentException - if the bound is not positive
              +
              IllegalArgumentException - if the bound is not positive
            - +

            • nextInt

              -
              public static int nextInt(int bound,
-                          SplittableRandom gen)
              +
              public static int nextInt​(int bound,
+                          SplittableRandom gen)

              Generates a random integer uniformly distributed in the interval: [0, bound).

              This method uses a SplittableRandom object passed as a parameter as the pseudorandom number generator. @@ -640,18 +716,18 @@

              nextInt

              Returns:
              a random integer between 0 (inclusive) and bound (exclusive).
              Throws:
              -
              IllegalArgumentException - if the bound is not positive
              +
              IllegalArgumentException - if the bound is not positive
            - +

            • nextInt

              -
              public static int nextInt(int bound,
-                          Random gen)
              +
              public static int nextInt​(int bound,
+                          Random gen)

              Generates a random integer uniformly distributed in the interval: [0, bound).

              This method uses a Random object passed as a parameter as the pseudorandom number generator. @@ -667,17 +743,17 @@

              nextInt

              Returns:
              a random integer between 0 (inclusive) and bound (exclusive).
              Throws:
              -
              IllegalArgumentException - if the bound is not positive
              +
              IllegalArgumentException - if the bound is not positive
            - +

            • nextBiasedInt

              -
              public static int nextBiasedInt(int bound)
              +
              public static int nextBiasedInt​(int bound)

              Generates a random integer in the interval: [0, bound).

              This method uses ThreadLocalRandom as the pseudorandom number generator, and is thus safe, and efficient (i.e., non-blocking), for use with threads. @@ -699,18 +775,18 @@

              nextBiasedInt

              Returns:
              a random integer between 0 (inclusive) and bound (exclusive).
              Throws:
              -
              IllegalArgumentException - if the bound is not positive
              +
              IllegalArgumentException - if the bound is not positive
            - +

            • nextBiasedInt

              -
              public static int nextBiasedInt(int bound,
-                                SplittableRandom gen)
              +
              public static int nextBiasedInt​(int bound,
+                                SplittableRandom gen)

              Generates a random integer in the interval: [0, bound).

              This method uses SplittableRandom as the pseudorandom number generator, and is thus safe for use with threads. However, it does not use SplittableRandom.nextInt(int bound) @@ -732,18 +808,18 @@

              nextBiasedInt

              Returns:
              a random integer between 0 (inclusive) and bound (exclusive).
              Throws:
              -
              IllegalArgumentException - if the bound is not positive
              +
              IllegalArgumentException - if the bound is not positive
            - +

            • nextBiasedInt

              -
              public static int nextBiasedInt(int bound,
-                                Random gen)
              +
              public static int nextBiasedInt​(int bound,
+                                Random gen)

              Generates a random integer in the interval: [0, bound).

              This method uses Random as the pseudorandom number generator, and is thus safe for use with threads. However, it does not use Random.nextInt(int bound) @@ -772,17 +848,17 @@

              nextBiasedInt

              Returns:
              a random integer between 0 (inclusive) and bound (exclusive).
              Throws:
              -
              IllegalArgumentException - if the bound is not positive
              +
              IllegalArgumentException - if the bound is not positive
            - +

            • sampleReservoir

              -
              public static int[] sampleReservoir(int n,
+
              public static int[] sampleReservoir​(int n,
                                     int k,
                                     int[] result)
              
 
              Generates a random sample of k integers, without replacement, from the
@@ -807,21 +883,21 @@ 
              sampleReservoir
              
 
              Returns:
              
 
              An array containing the sample of k randomly chosen integers from the interval [0, n).
              
 
              Throws:
              
-
              IllegalArgumentException - if k > n.
              
-
              NegativeArraySizeException - if k < 0.
              
+
              IllegalArgumentException - if k > n.
              
+
              NegativeArraySizeException - if k < 0.
            - +

            • sampleReservoir

              -
              public static int[] sampleReservoir(int n,
+
              public static int[] sampleReservoir​(int n,
                                     int k,
                                     int[] result,
-                                    Random gen)
              
+                                    Random gen)

              Generates a random sample of k integers, without replacement, from the set of integers in the interval [0, n). All n choose k combinations are equally likely.

              @@ -842,21 +918,21 @@

              sampleReservoir

              Returns:
              An array containing the sample of k randomly chosen integers from the interval [0, n).
              Throws:
              -
              IllegalArgumentException - if k > n.
              -
              NegativeArraySizeException - if k < 0.
              +
              IllegalArgumentException - if k > n.
              +
              NegativeArraySizeException - if k < 0.
            - + - + - + - +

            • samplePool

              -
              public static int[] samplePool(int n,
+
              public static int[] samplePool​(int n,
                                int k,
                                int[] result,
-                               Random gen)
              
+                               Random gen)

              Generates a random sample of k integers, without replacement, from the set of integers in the interval [0, n). All n choose k combinations are equally likely.

              @@ -985,18 +1061,18 @@

              samplePool

              Returns:
              An array containing the sample of k randomly chosen integers from the interval [0, n).
              Throws:
              -
              IllegalArgumentException - if k > n.
              -
              NegativeArraySizeException - if k < 0.
              +
              IllegalArgumentException - if k > n.
              +
              NegativeArraySizeException - if k < 0.
            - +

            • sampleInsertion

              -
              public static int[] sampleInsertion(int n,
+
              public static int[] sampleInsertion​(int n,
                                     int k,
                                     int[] result)
              
 
              Generates a random sample of k integers, without replacement, from the
@@ -1019,21 +1095,21 @@ 
              sampleInsertion
              
 
              Returns:
              
 
              An array containing the sample of k randomly chosen integers from the interval [0, n).
              
 
              Throws:
              
-
              IllegalArgumentException - if k > n.
              
-
              NegativeArraySizeException - if k < 0.
              
+
              IllegalArgumentException - if k > n.
              
+
              NegativeArraySizeException - if k < 0.
            - + - +

            • sampleInsertion

              -
              public static int[] sampleInsertion(int n,
+
              public static int[] sampleInsertion​(int n,
                                     int k,
                                     int[] result,
-                                    Random gen)
              
+                                    Random gen)

              Generates a random sample of k integers, without replacement, from the set of integers in the interval [0, n). All n choose k combinations are equally likely.

              @@ -1085,18 +1161,18 @@

              sampleInsertion

              Returns:
              An array containing the sample of k randomly chosen integers from the interval [0, n).
              Throws:
              -
              IllegalArgumentException - if k > n.
              -
              NegativeArraySizeException - if k < 0.
              +
              IllegalArgumentException - if k > n.
              +
              NegativeArraySizeException - if k < 0.
            - +

            • sample

              -
              public static int[] sample(int n,
+
              public static int[] sample​(int n,
                            double p)
              
 
              Generates a random sample, without replacement, from the
  set of integers in the interval [0, n).  Each of the n integers 
@@ -1115,15 +1191,15 @@ 
              sample
            - +

            • sample

              -
              public static int[] sample(int n,
+
              public static int[] sample​(int n,
                            double p,
-                           SplittableRandom r)
              
+                           SplittableRandom r)

              Generates a random sample, without replacement, from the set of integers in the interval [0, n). Each of the n integers has a probability p of inclusion in the sample.

              @@ -1142,15 +1218,15 @@

              sample

            - +

            • sample

              -
              public static int[] sample(int n,
+
              public static int[] sample​(int n,
                            double p,
-                           Random r)
              
+                           Random r)

              Generates a random sample, without replacement, from the set of integers in the interval [0, n). Each of the n integers has a probability p of inclusion in the sample.

              @@ -1169,13 +1245,13 @@

              sample

            - + - + - +

            • sample

              -
              public static int[] sample(int n,
+
              public static int[] sample​(int n,
                            int k,
                            int[] result,
-                           Random gen)
              
+                           Random gen)

              Generates a random sample of k integers, without replacement, from the set of integers in the interval [0, n). All n choose k combinations are equally likely.

              @@ -1264,18 +1340,18 @@

              sample

              Returns:
              An array containing the sample of k randomly chosen integers from the interval [0, n).
              Throws:
              -
              IllegalArgumentException - if k > n.
              -
              NegativeArraySizeException - if k < 0.
              +
              IllegalArgumentException - if k > n.
              +
              NegativeArraySizeException - if k < 0.
            - +

            • nextIntPair

              -
              public static int[] nextIntPair(int n,
+
              public static int[] nextIntPair​(int n,
                                 int[] result)
              
 
              Generates a random sample of 2 integers, without replacement, from the
  set of integers in the interval [0, n).  All n choose 2 combinations are equally
@@ -1293,19 +1369,19 @@ 
              nextIntPair
              
 
              An array containing the pair of 
  randomly chosen integers from the interval [0, n).
              
 
              Throws:
              
-
              IllegalArgumentException - if n < 2.
              
+
              IllegalArgumentException - if n < 2.
            - +

            • nextIntPair

              -
              public static int[] nextIntPair(int n,
+
              public static int[] nextIntPair​(int n,
                                 int[] result,
-                                SplittableRandom gen)
              
+                                SplittableRandom gen)

              Generates a random sample of 2 integers, without replacement, from the set of integers in the interval [0, n). All n choose 2 combinations are equally likely.

              @@ -1320,19 +1396,19 @@

              nextIntPair

              An array containing the pair of randomly chosen integers from the interval [0, n).
              Throws:
              -
              IllegalArgumentException - if n < 2.
              +
              IllegalArgumentException - if n < 2.
            - +

            • nextIntPair

              -
              public static int[] nextIntPair(int n,
+
              public static int[] nextIntPair​(int n,
                                 int[] result,
-                                Random gen)
              
+                                Random gen)

              Generates a random sample of 2 integers, without replacement, from the set of integers in the interval [0, n). All n choose 2 combinations are equally likely.

              @@ -1347,17 +1423,17 @@

              nextIntPair

              An array containing the pair of randomly chosen integers from the interval [0, n).
              Throws:
              -
              IllegalArgumentException - if n < 2.
              +
              IllegalArgumentException - if n < 2.
            - +

            • nextIntTriple

              -
              public static int[] nextIntTriple(int n,
+
              public static int[] nextIntTriple​(int n,
                                   int[] result)
              
 
              Generates a random sample of 3 integers, without replacement, from the
  set of integers in the interval [0, n).  All n choose 3 combinations are equally
@@ -1375,17 +1451,17 @@ 
              nextIntTriple
              
 
              An array containing the pair of 
  randomly chosen integers from the interval [0, n).
              
 
              Throws:
              
-
              IllegalArgumentException - if n < 3.
              
+
              IllegalArgumentException - if n < 3.
            - +

            • nextIntTriple

              -
              public static int[] nextIntTriple(int n,
+
              public static int[] nextIntTriple​(int n,
                                   int[] result,
                                   boolean sort)
              
 
              Generates a random sample of 3 integers, without replacement, from the
@@ -1405,20 +1481,20 @@ 
              nextIntTriple
              
 
              An array containing the pair of 
  randomly chosen integers from the interval [0, n).
              
 
              Throws:
              
-
              IllegalArgumentException - if n < 3.
              
+
              IllegalArgumentException - if n < 3.
            - +

            • nextIntTriple

              -
              public static int[] nextIntTriple(int n,
+
              public static int[] nextIntTriple​(int n,
                                   int[] result,
                                   boolean sort,
-                                  SplittableRandom gen)
              
+                                  SplittableRandom gen)

              Generates a random sample of 3 integers, without replacement, from the set of integers in the interval [0, n). All n choose 3 combinations are equally likely.

              @@ -1434,20 +1510,20 @@

              nextIntTriple

              An array containing the pair of randomly chosen integers from the interval [0, n).
              Throws:
              -
              IllegalArgumentException - if n < 3.
              +
              IllegalArgumentException - if n < 3.
            - +

            • nextIntTriple

              -
              public static int[] nextIntTriple(int n,
+
              public static int[] nextIntTriple​(int n,
                                   int[] result,
                                   boolean sort,
-                                  Random gen)
              
+                                  Random gen)

              Generates a random sample of 3 integers, without replacement, from the set of integers in the interval [0, n). All n choose 3 combinations are equally likely.

              @@ -1463,19 +1539,19 @@

              nextIntTriple

              An array containing the pair of randomly chosen integers from the interval [0, n).
              Throws:
              -
              IllegalArgumentException - if n < 3.
              +
              IllegalArgumentException - if n < 3.
            - +

            • nextIntTriple

              -
              public static int[] nextIntTriple(int n,
+
              public static int[] nextIntTriple​(int n,
                                   int[] result,
-                                  SplittableRandom gen)
              
+                                  SplittableRandom gen)

              Generates a random sample of 3 integers, without replacement, from the set of integers in the interval [0, n). All n choose 3 combinations are equally likely.

              @@ -1490,19 +1566,19 @@

              nextIntTriple

              An array containing the pair of randomly chosen integers from the interval [0, n).
              Throws:
              -
              IllegalArgumentException - if n < 3.
              +
              IllegalArgumentException - if n < 3.
            - +

            • nextIntTriple

              -
              public static int[] nextIntTriple(int n,
+
              public static int[] nextIntTriple​(int n,
                                   int[] result,
-                                  Random gen)
              
+                                  Random gen)

              Generates a random sample of 3 integers, without replacement, from the set of integers in the interval [0, n). All n choose 3 combinations are equally likely.

              @@ -1517,17 +1593,17 @@

              nextIntTriple

              An array containing the pair of randomly chosen integers from the interval [0, n).
              Throws:
              -
              IllegalArgumentException - if n < 3.
              +
              IllegalArgumentException - if n < 3.
            - +

            • arrayMask

              -
              public static boolean[] arrayMask(int n)
              +
              public static boolean[] arrayMask​(int n)

              Generates an "array mask" of a specified length, where an "array mask" is an array of boolean values of the same length as another array. Each position in the result is equally likely true or false.

              @@ -1542,14 +1618,14 @@

              arrayMask

            - +

            • arrayMask

              -
              public static boolean[] arrayMask(int n,
-                                  SplittableRandom gen)
              +
              public static boolean[] arrayMask​(int n,
+                                  SplittableRandom gen)

              Generates an "array mask" of a specified length, where an "array mask" is an array of boolean values of the same length as another array. Each position in the result is equally likely true or false.

              @@ -1563,14 +1639,14 @@

              arrayMask

            - +

            • arrayMask

              -
              public static boolean[] arrayMask(int n,
-                                  Random gen)
              +
              public static boolean[] arrayMask​(int n,
+                                  Random gen)

              Generates an "array mask" of a specified length, where an "array mask" is an array of boolean values of the same length as another array. Each position in the result is equally likely true or false.

              @@ -1584,13 +1660,13 @@

              arrayMask

            - +

            • arrayMask

              -
              public static boolean[] arrayMask(int n,
+
              public static boolean[] arrayMask​(int n,
                                   int k)
              
 
              Generates an "array mask" of a specified length and specified number of true values,
  where an "array mask" is an array of boolean values of the same length as another array.
              
@@ -1607,15 +1683,15 @@ 
              arrayMask
            - +

            • arrayMask

              -
              public static boolean[] arrayMask(int n,
+
              public static boolean[] arrayMask​(int n,
                                   int k,
-                                  SplittableRandom gen)
              
+                                  SplittableRandom gen)

              Generates an "array mask" of a specified length and specified number of true values, where an "array mask" is an array of boolean values of the same length as another array.

              Runtime: O(min(n, k2)), and it uses O(min(k, n-k)) random numbers.

              @@ -1629,15 +1705,15 @@

              arrayMask

            - +

            • arrayMask

              -
              public static boolean[] arrayMask(int n,
+
              public static boolean[] arrayMask​(int n,
                                   int k,
-                                  Random gen)
              
+                                  Random gen)

              Generates an "array mask" of a specified length and specified number of true values, where an "array mask" is an array of boolean values of the same length as another array.

              Runtime: O(min(n, k2)), and it uses O(min(k, n-k)) random numbers.

              @@ -1651,13 +1727,13 @@

              arrayMask

            - +

            • arrayMask

              -
              public static boolean[] arrayMask(int n,
+
              public static boolean[] arrayMask​(int n,
                                   double p)
              
 
              Generates an "array mask" of a specified length,
  where an "array mask" is an array of boolean values of the same length as another array.
              
@@ -1676,15 +1752,15 @@ 
              arrayMask
            - +

            • arrayMask

              -
              public static boolean[] arrayMask(int n,
+
              public static boolean[] arrayMask​(int n,
                                   double p,
-                                  SplittableRandom gen)
              
+                                  SplittableRandom gen)

              Generates an "array mask" of a specified length, where an "array mask" is an array of boolean values of the same length as another array.

              Runtime: O(n), and it uses O(n) random doubles.

              @@ -1700,15 +1776,15 @@

              arrayMask

            - +

            • arrayMask

              -
              public static boolean[] arrayMask(int n,
+
              public static boolean[] arrayMask​(int n,
                                   double p,
-                                  Random gen)
              
+                                  Random gen)

              Generates an "array mask" of a specified length, where an "array mask" is an array of boolean values of the same length as another array.

              Runtime: O(n), and it uses O(n) random doubles.

              @@ -1724,13 +1800,13 @@

              arrayMask

            - +

            • nextWindowedIntPair

              -
              public static int[] nextWindowedIntPair(int n,
+
              public static int[] nextWindowedIntPair​(int n,
                                         int window,
                                         int[] result)
              
 
              Generates a random sample of 2 integers, i, j, without replacement, from the
@@ -1751,20 +1827,20 @@ 
              nextWindowedIntPair
              
  randomly chosen integers, i, j, 
  from the interval [0, n), such that |i-j| ≤ window.
 
              Throws:
              
-
              IllegalArgumentException - if window < 1 or n < 2.
              
+
              IllegalArgumentException - if window < 1 or n < 2.
            - +

            • nextWindowedIntPair

              -
              public static int[] nextWindowedIntPair(int n,
+
              public static int[] nextWindowedIntPair​(int n,
                                         int window,
                                         int[] result,
-                                        SplittableRandom gen)
              
+                                        SplittableRandom gen)

              Generates a random sample of 2 integers, i, j, without replacement, from the set of integers in the interval [0, n), such that |i-j| ≤ window. All pairs that satisfy the window constraint are equally likely.

              @@ -1781,20 +1857,20 @@

              nextWindowedIntPair

              randomly chosen integers, i, j, from the interval [0, n), such that |i-j| ≤ window.
              Throws:
              -
              IllegalArgumentException - if window < 1 or n < 2.
              +
              IllegalArgumentException - if window < 1 or n < 2.
            - +

            • nextWindowedIntPair

              -
              public static int[] nextWindowedIntPair(int n,
+
              public static int[] nextWindowedIntPair​(int n,
                                         int window,
                                         int[] result,
-                                        Random gen)
              
+                                        Random gen)

              Generates a random sample of 2 integers, i, j, without replacement, from the set of integers in the interval [0, n), such that |i-j| ≤ window. All pairs that satisfy the window constraint are equally likely.

              @@ -1811,17 +1887,17 @@

              nextWindowedIntPair

              randomly chosen integers, i, j, from the interval [0, n), such that |i-j| ≤ window.
              Throws:
              -
              IllegalArgumentException - if window < 1 or n < 2.
              +
              IllegalArgumentException - if window < 1 or n < 2.
            - +

            • nextWindowedIntTriple

              -
              public static int[] nextWindowedIntTriple(int n,
+
              public static int[] nextWindowedIntTriple​(int n,
                                           int window,
                                           int[] result)
              
 
              Generates a random sample of 3 integers, i, j, k without replacement, from the
@@ -1844,17 +1920,17 @@ 
              nextWindowedIntTriple
              
  from the interval [0, n), such that |i-j| ≤ window, and 
  |i-k| ≤ window, and |k-j| ≤ window.
 
              Throws:
              
-
              IllegalArgumentException - if window < 2 or n < 3.
              
+
              IllegalArgumentException - if window < 2 or n < 3.
            - +

            • nextWindowedIntTriple

              -
              public static int[] nextWindowedIntTriple(int n,
+
              public static int[] nextWindowedIntTriple​(int n,
                                           int window,
                                           int[] result,
                                           boolean sort)
              
@@ -1879,22 +1955,22 @@ 
              nextWindowedIntTriple
              
  from the interval [0, n), such that |i-j| ≤ window, and 
  |i-k| ≤ window, and |k-j| ≤ window.
 
              Throws:
              
-
              IllegalArgumentException - if window < 2 or n < 3.
              
+
              IllegalArgumentException - if window < 2 or n < 3.
              
 
              Since:
              
 
              2.0
            - +

            • nextWindowedIntTriple

              -
              public static int[] nextWindowedIntTriple(int n,
+
              public static int[] nextWindowedIntTriple​(int n,
                                           int window,
                                           int[] result,
-                                          SplittableRandom gen)
              
+                                          SplittableRandom gen)

              Generates a random sample of 3 integers, i, j, k without replacement, from the set of integers in the interval [0, n), such that |i-j| ≤ window, and |i-k| ≤ window, and |k-j| ≤ window. @@ -1913,21 +1989,21 @@

              nextWindowedIntTriple

              from the interval [0, n), such that |i-j| ≤ window, and |i-k| ≤ window, and |k-j| ≤ window.
              Throws:
              -
              IllegalArgumentException - if window < 2 or n < 3.
              +
              IllegalArgumentException - if window < 2 or n < 3.
            - +

            • nextWindowedIntTriple

              -
              public static int[] nextWindowedIntTriple(int n,
+
              public static int[] nextWindowedIntTriple​(int n,
                                           int window,
                                           int[] result,
                                           boolean sort,
-                                          SplittableRandom gen)
              
+                                          SplittableRandom gen)

              Generates a random sample of 3 integers, i, j, k without replacement, from the set of integers in the interval [0, n), such that |i-j| ≤ window, and |i-k| ≤ window, and |k-j| ≤ window. @@ -1947,22 +2023,22 @@

              nextWindowedIntTriple

              from the interval [0, n), such that |i-j| ≤ window, and |i-k| ≤ window, and |k-j| ≤ window.
              Throws:
              -
              IllegalArgumentException - if window < 2 or n < 3.
              +
              IllegalArgumentException - if window < 2 or n < 3.
              Since:
              2.0
            - +

            • nextWindowedIntTriple

              -
              public static int[] nextWindowedIntTriple(int n,
+
              public static int[] nextWindowedIntTriple​(int n,
                                           int window,
                                           int[] result,
-                                          Random gen)
              
+                                          Random gen)

              Generates a random sample of 3 integers, i, j, k without replacement, from the set of integers in the interval [0, n), such that |i-j| ≤ window, and |i-k| ≤ window, and |k-j| ≤ window. @@ -1981,21 +2057,21 @@

              nextWindowedIntTriple

              from the interval [0, n), such that |i-j| ≤ window, and |i-k| ≤ window, and |k-j| ≤ window.
              Throws:
              -
              IllegalArgumentException - if window < 2 or n < 3.
              +
              IllegalArgumentException - if window < 2 or n < 3.
            - +

            • nextWindowedIntTriple

              -
              public static int[] nextWindowedIntTriple(int n,
+
              public static int[] nextWindowedIntTriple​(int n,
                                           int window,
                                           int[] result,
                                           boolean sort,
-                                          Random gen)
              
+                                          Random gen)

              Generates a random sample of 3 integers, i, j, k without replacement, from the set of integers in the interval [0, n), such that |i-j| ≤ window, and |i-k| ≤ window, and |k-j| ≤ window. @@ -2015,7 +2091,7 @@

              nextWindowedIntTriple

              from the interval [0, n), such that |i-j| ≤ window, and |i-k| ≤ window, and |k-j| ≤ window.
              Throws:
              -
              IllegalArgumentException - if window < 2 or n < 3.
              +
              IllegalArgumentException - if window < 2 or n < 3.
              Since:
              2.0
              @@ -2023,21 +2099,25 @@

              nextWindowedIntTriple

          +

    +
    + diff --git a/docs/api/org/cicirello/math/rand/RandomVariates.html b/docs/api/org/cicirello/math/rand/RandomVariates.html index ec12eed7..9bc61826 100644 --- a/docs/api/org/cicirello/math/rand/RandomVariates.html +++ b/docs/api/org/cicirello/math/rand/RandomVariates.html @@ -1,11 +1,21 @@ - + RandomVariates (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.math.rand
    +
    Package org.cicirello.math.rand

    Class RandomVariates

    @@ -219,21 +255,22 @@

    Methods inherited from class java.lang.
  • +
      -
    • +

    • Method Detail

      - +

      • nextBinomial

        -
        public static int nextBinomial(int n,
+
        public static int nextBinomial​(int n,
                                double p)
        
 
        Generates a pseudorandom integer from a binomial distribution.
- The source of randomness is via the ThreadLocalRandom
+ The source of randomness is via the ThreadLocalRandom
  class, and thus this method is both safe and efficient for use with threads.
        
 
        
 
        Parameters:
        
@@ -244,15 +281,15 @@ 
        nextBinomial
      - +

      • nextBinomial

        -
        public static int nextBinomial(int n,
+
        public static int nextBinomial​(int n,
                                double p,
-                               Random r)
        
+                               Random r)
        Generates a pseudorandom integer from a binomial distribution.
        Parameters:
        @@ -264,15 +301,15 @@

        nextBinomial

      - +

      • nextBinomial

        -
        public static int nextBinomial(int n,
+
        public static int nextBinomial​(int n,
                                double p,
-                               SplittableRandom r)
        
+                               SplittableRandom r)
        Generates a pseudorandom integer from a binomial distribution.
        Parameters:
        @@ -284,13 +321,13 @@

        nextBinomial

      - +

      • nextCauchy

        -
        public static double nextCauchy(double median,
+
        public static double nextCauchy​(double median,
                                 double scale)
        
 
        Generates a pseudorandom number from a Cauchy distribution.
        
 
        
@@ -302,13 +339,13 @@ 
        nextCauchy
      - +

      • nextCauchy

        -
        public static double nextCauchy(double scale)
        +
        public static double nextCauchy​(double scale)
        Generates a pseudorandom number from a Cauchy distribution with median 0 and chosen scale parameter.
        @@ -319,15 +356,15 @@

        nextCauchy

      - +

      • nextCauchy

        -
        public static double nextCauchy(double median,
+
        public static double nextCauchy​(double median,
                                 double scale,
-                                Random r)
        
+                                Random r)
        Generates a pseudorandom number from a Cauchy distribution.
        Parameters:
        @@ -339,14 +376,14 @@

        nextCauchy

      - +

      • nextCauchy

        -
        public static double nextCauchy(double scale,
-                                Random r)
        +
        public static double nextCauchy​(double scale,
+                                Random r)
        Generates a pseudorandom number from a Cauchy distribution with median 0 and chosen scale parameter.
        @@ -358,15 +395,15 @@

        nextCauchy

      - +

      • nextCauchy

        -
        public static double nextCauchy(double median,
+
        public static double nextCauchy​(double median,
                                 double scale,
-                                SplittableRandom r)
        
+                                SplittableRandom r)
        Generates a pseudorandom number from a Cauchy distribution.
        Parameters:
        @@ -378,14 +415,14 @@

        nextCauchy

      - +

      • nextCauchy

        -
        public static double nextCauchy(double scale,
-                                SplittableRandom r)
        +
        public static double nextCauchy​(double scale,
+                                SplittableRandom r)
        Generates a pseudorandom number from a Cauchy distribution with median 0 and chosen scale parameter.
        @@ -399,21 +436,25 @@

        nextCauchy

    +
    • +

    + diff --git a/docs/api/org/cicirello/math/rand/package-frame.html b/docs/api/org/cicirello/math/rand/package-frame.html deleted file mode 100644 index 401d24fd..00000000 --- a/docs/api/org/cicirello/math/rand/package-frame.html +++ /dev/null @@ -1,20 +0,0 @@ - - - - - -org.cicirello.math.rand (JavaPermutationTools - A Java API for computation on permutations) - - - - -

    org.cicirello.math.rand

    -
    -

    Classes

    - -
    - - diff --git a/docs/api/org/cicirello/math/rand/package-summary.html b/docs/api/org/cicirello/math/rand/package-summary.html index b315abf6..1dc6fd13 100644 --- a/docs/api/org/cicirello/math/rand/package-summary.html +++ b/docs/api/org/cicirello/math/rand/package-summary.html @@ -1,11 +1,21 @@ - + org.cicirello.math.rand (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +

    Package org.cicirello.math.rand

    -
    -
    Collection of classes related to random number generation.
    -
    -

    See: Description

    +
    + + +
    Collection of classes related to random number generation.
    +
    +
    Since:
    +
    1.4
    +
    +
    • - +
      @@ -85,14 +115,14 @@

      Package org.cicirello.math.rand

      - + - +
      Class Summary 
      Class
      RandomIndexerRandomIndexer
      RandomIndexer is a class of utility methods related to efficiently generating random indexes, and combination of indexes, into arrays.
      RandomVariatesRandomVariates
      This utility class provides methods for generating random variates from different distributions.
      @@ -102,26 +132,20 @@

      Package org.cicirello.math.rand

    - - - -

    Package org.cicirello.math.rand Description

    -
    Collection of classes related to random number generation.
    -
    -
    Since:
    -
    1.4
    -
    +
    + diff --git a/docs/api/org/cicirello/math/rand/package-tree.html b/docs/api/org/cicirello/math/rand/package-tree.html index 88504a18..464fa662 100644 --- a/docs/api/org/cicirello/math/rand/package-tree.html +++ b/docs/api/org/cicirello/math/rand/package-tree.html @@ -1,11 +1,21 @@ - + org.cicirello.math.rand Class Hierarchy (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +

    Hierarchy For Package org.cicirello.math.rand

    Package Hierarchies: @@ -75,26 +100,31 @@

    Hierarchy For Package org.cicirello.math.rand

    +

    Class Hierarchy

    +
    +
    + diff --git a/docs/api/org/cicirello/math/stats/Statistics.html b/docs/api/org/cicirello/math/stats/Statistics.html index 186c1c96..d37eed64 100644 --- a/docs/api/org/cicirello/math/stats/Statistics.html +++ b/docs/api/org/cicirello/math/stats/Statistics.html @@ -1,11 +1,21 @@ - + Statistics (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.math.stats
    +
    Package org.cicirello.math.stats

    Class Statistics

      -
    • java.lang.Object
      • +
    • java.lang.Object
      • org.cicirello.math.stats.Statistics
        • @@ -106,14 +131,9 @@

        Class Statistics

        • -
          public final class Statistics
-extends Object
          +extends Object
          Utility class of basic statistics.
          -
          -
          Since:
          -
          1.0
          -
    @@ -121,131 +141,150 @@

    Class Statistics

    @@ -253,18 +292,19 @@

    Methods inherited from class java.lang.
  • +
      -
    • +

    • Method Detail

      - +

      • mean

        -
        public static double mean(int[] data)
        +
        public static double mean​(int[] data)
        Computes mean of a dataset.
        Parameters:
        @@ -274,13 +314,13 @@

        mean

      - +

      • mean

        -
        public static double mean(double[] data)
        +
        public static double mean​(double[] data)
        Computes mean of a dataset.
        Parameters:
        @@ -290,13 +330,13 @@

        mean

      - +

      • variance

        -
        public static double variance(int[] data)
        +
        public static double variance​(int[] data)
        Computes variance of a population.
        Parameters:
        @@ -306,13 +346,13 @@

        variance

      - +

      • variance

        -
        public static double variance(double[] data)
        +
        public static double variance​(double[] data)
        Computes variance of a population.
        Parameters:
        @@ -322,13 +362,13 @@

        variance

      - +

      • varianceSample

        -
        public static double varianceSample(int[] data)
        +
        public static double varianceSample​(int[] data)
        Computes variance of a sample.
        Parameters:
        @@ -338,13 +378,13 @@

        varianceSample

      - +

      • varianceSample

        -
        public static double varianceSample(double[] data)
        +
        public static double varianceSample​(double[] data)
        Computes variance of a sample.
        Parameters:
        @@ -354,13 +394,13 @@

        varianceSample

      - +

      • covariance

        -
        public static double covariance(int[] X,
+
        public static double covariance​(int[] X,
                                 int[] Y)
        
 
        Computes covariance for a pair of random variables.
        
 
        
@@ -372,13 +412,13 @@ 
        covariance
      - +

      • covariance

        -
        public static double covariance(double[] X,
+
        public static double covariance​(double[] X,
                                 double[] Y)
        
 
        Computes covariance for a pair of random variables.
        
 
        
@@ -390,13 +430,13 @@ 
        covariance
      - +

      • correlation

        -
        public static double correlation(int[] X,
+
        public static double correlation​(int[] X,
                                  int[] Y)
        
 
        Computes correlation coefficient for a pair of random variables.
        
 
        
@@ -408,13 +448,13 @@ 
        correlation
      - +

      • correlation

        -
        public static double correlation(double[] X,
+
        public static double correlation​(double[] X,
                                  double[] Y)
        
 
        Computes correlation coefficient for a pair of random variables.
        
 
        
@@ -426,13 +466,13 @@ 
        correlation
      - +

      • correlationMatrix

        -
        public static double[][] correlationMatrix(int[][] data)
        +
        public static double[][] correlationMatrix​(int[][] data)
        Computes correlation matrix.
        Parameters:
        @@ -442,13 +482,13 @@

        correlationMatrix

      - +

      • correlationMatrix

        -
        public static double[][] correlationMatrix(double[][] data)
        +
        public static double[][] correlationMatrix​(double[][] data)
        Computes correlation matrix.
        Parameters:
        @@ -458,13 +498,13 @@

        correlationMatrix

      - +

      • tTestUnequalVariances

        -
        public static double tTestUnequalVariances(double[] data1,
+
        public static double tTestUnequalVariances​(double[] data1,
                                            double[] data2)
        
 
        Welch's t-test, also known as t-test with unequal variances.
  The Welch's t-test can be used when variances are unequal and
@@ -480,13 +520,13 @@ 
        tTestUnequalVariances
      - +

      • tTestUnequalVariances

        -
        public static double tTestUnequalVariances(int[] data1,
+
        public static double tTestUnequalVariances​(int[] data1,
                                            int[] data2)
        
 
        Welch's t-test, also known as t-test with unequal variances.
  The Welch's t-test can be used when variances are unequal and
@@ -502,13 +542,13 @@ 
        tTestUnequalVariances
      - +

      • tTestWelch

        -
        public static Number[] tTestWelch(double[] data1,
+
        public static Number[] tTestWelch​(double[] data1,
                                   double[] data2)
        
 
        Welch's t-test, also known as t-test with unequal variances.
  The Welch's t-test can be used when variances are unequal and
@@ -526,13 +566,13 @@ 
        tTestWelch
      - +

      • tTestWelch

        -
        public static Number[] tTestWelch(int[] data1,
+
        public static Number[] tTestWelch​(int[] data1,
                                   int[] data2)
        
 
        Welch's t-test, also known as t-test with unequal variances.
  The Welch's t-test can be used when variances are unequal and
@@ -552,21 +592,25 @@ 
        tTestWelch
    +
    • +

    + diff --git a/docs/api/org/cicirello/math/stats/package-frame.html b/docs/api/org/cicirello/math/stats/package-frame.html deleted file mode 100644 index c3db4d88..00000000 --- a/docs/api/org/cicirello/math/stats/package-frame.html +++ /dev/null @@ -1,19 +0,0 @@ - - - - - -org.cicirello.math.stats (JavaPermutationTools - A Java API for computation on permutations) - - - - -

    org.cicirello.math.stats

    -
    -

    Classes

    - -
    - - diff --git a/docs/api/org/cicirello/math/stats/package-summary.html b/docs/api/org/cicirello/math/stats/package-summary.html index b1fad68b..f74c194a 100644 --- a/docs/api/org/cicirello/math/stats/package-summary.html +++ b/docs/api/org/cicirello/math/stats/package-summary.html @@ -1,11 +1,21 @@ - + org.cicirello.math.stats (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +

    Package org.cicirello.math.stats

    -
    -
    Collection of classes related to statistics.
    -
    -

    See: Description

    +
    + + +
    Collection of classes related to statistics.
    +
    +
    Since:
    +
    1.0
    +
    +
    • - +
      @@ -85,7 +115,7 @@

      Package org.cicirello.math.stats

      - + @@ -94,26 +124,20 @@

      Package org.cicirello.math.stats

      Class Summary 
      Class
      StatisticsStatistics
      Utility class of basic statistics.
    - - - -

    Package org.cicirello.math.stats Description

    -
    Collection of classes related to statistics.
    -
    -
    Since:
    -
    1.0
    -
    +
    + diff --git a/docs/api/org/cicirello/math/stats/package-tree.html b/docs/api/org/cicirello/math/stats/package-tree.html index 16c35507..2fd674f8 100644 --- a/docs/api/org/cicirello/math/stats/package-tree.html +++ b/docs/api/org/cicirello/math/stats/package-tree.html @@ -1,11 +1,21 @@ - + org.cicirello.math.stats Class Hierarchy (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +

    Hierarchy For Package org.cicirello.math.stats

    Package Hierarchies: @@ -75,25 +100,30 @@

    Hierarchy For Package org.cicirello.math.stats

    +

    Class Hierarchy

    +
    +
    + diff --git a/docs/api/org/cicirello/permutations/Permutation.Mechanic.html b/docs/api/org/cicirello/permutations/Permutation.Mechanic.html index 4005d4ad..f39c145c 100644 --- a/docs/api/org/cicirello/permutations/Permutation.Mechanic.html +++ b/docs/api/org/cicirello/permutations/Permutation.Mechanic.html @@ -1,11 +1,21 @@ - + Permutation.Mechanic (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations
    +
    Package org.cicirello.permutations

    Class Permutation.Mechanic

      -
    • java.lang.Object
      • +
    • java.lang.Object
      • org.cicirello.permutations.Permutation.Mechanic
        • @@ -107,12 +132,11 @@

        Class Permutation.Mechanic<
      • Enclosing class:
        -
        Permutation
        +
        Permutation
        -
        public static class Permutation.Mechanic
-extends Object
        +extends Object

        The Permutation.Mechanic class provides a means of adding application-specific operations on Permutations without the need to directly alter the Permutation class. It is similar to a Visitor from the Visitor pattern.

        @@ -153,72 +177,82 @@

        Class Permutation.Mechanic<

        @@ -226,12 +260,13 @@

        Methods inherited from class java.lang.
      • +
          -
        • +

        • Constructor Detail

          - +
            @@ -243,19 +278,21 @@

            Mechanic

        +
        +
          -
        • +

        • Method Detail

          - +

          • set

            -
            protected final void set(Permutation p,
+
            protected final void set​(Permutation p,
                          int[] permutation)
            
 
            Changes the state of the Permutation according to the contents 
  of an array of int values.  The caller of this method is responsible
@@ -271,13 +308,13 @@ 
            set
          - +

          • set

            -
            protected final void set(Permutation p,
+
            protected final void set​(Permutation p,
                          int index,
                          int value)
            
 
            Changes the integer in one specific location of a Permutation.  Individual calls
@@ -293,13 +330,13 @@ 
            set
          - +

          • set

            -
            protected final void set(Permutation p,
+
            protected final void set​(Permutation p,
                          int index,
                          int[] subpermutation)
            
 
            Changes a range of permutation elements.  This method does not verify that the
@@ -321,21 +358,25 @@ 
            set
        +

    +
    + diff --git a/docs/api/org/cicirello/permutations/Permutation.html b/docs/api/org/cicirello/permutations/Permutation.html index 5f22e67b..90a5c95c 100644 --- a/docs/api/org/cicirello/permutations/Permutation.html +++ b/docs/api/org/cicirello/permutations/Permutation.html @@ -1,11 +1,21 @@ - + Permutation (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations
    +
    Package org.cicirello.permutations

    Class Permutation

    @@ -474,18 +549,19 @@

    Methods inherited from interface java.lang.
  • +
      -
    • +

    • Constructor Detail

      - +

      • Permutation

        -
        public Permutation(int n)
        +
        public Permutation​(int n)
        Initializes a random permutation of n integers. Uses java.util.concurrent.ThreadLocalRandom as the source of efficient random number generation.
        @@ -494,14 +570,14 @@

        Permutation

      - +

      • Permutation

        -
        public Permutation(int n,
-                   SplittableRandom r)
        +
        public Permutation​(int n,
+                   SplittableRandom r)
        Initializes a random permutation of n integers.
        Parameters:
        @@ -510,14 +586,14 @@

        Permutation

      - +

      • Permutation

        -
        public Permutation(int n,
-                   Random r)
        +
        public Permutation​(int n,
+                   Random r)
        Initializes a random permutation of n integers.
        Parameters:
        @@ -526,13 +602,13 @@

        Permutation

      - +

      • Permutation

        -
        public Permutation(int n,
+
        public Permutation​(int n,
                    int value)
        
 
        Initializes a specific permutation from an integer in mixed radix form representing the chosen
  permutation.  See the toInteger() method which can be used to generate this value for a given
@@ -545,14 +621,14 @@ 
        Permutation
      - +

      • Permutation

        -
        public Permutation(int n,
-                   BigInteger value)
        +
        public Permutation​(int n,
+                   BigInteger value)

        Initializes a specific permutation from an integer in mixed radix form representing the chosen permutation. See the toInteger() method which can be used to generate this value for a given permutation. The n! permutations of the integers from 0 to n-1 are mapped to the integers from @@ -564,7 +640,7 @@

        Permutation

        most costly division (each division involves progressively smaller numbers). The largest number involved in a division is the parameter value, which can be at most n!. The number n! consists of O(log((n-1)!)) = O(n log n) digits. Java's BigInteger division method - currently implements the Burnikel-Ziegler algorithm, using the Toom–Cook multiplication algorithm. + currently implements the Burnikel-Ziegler algorithm, using the Toom–Cook multiplication algorithm. Dividing m-digit numbers with this combination has a runtime of O(m^1.465 log(m)). Substituting the number of digits for m, we have: O(n^1.465 log(n)^2.465). The cost of all of the divisions is thus less asymptotically than the cost of the primitive operations: O(n^2).

        @@ -577,31 +653,31 @@

        Permutation

      - +

      • Permutation

        -
        public Permutation(int[] p)
        +
        public Permutation​(int[] p)
        Initializes a permutation of n integers to be identical to the elements of an array.
        Parameters:
        p - An array of integers. Each of the integers in the interval [0, p.length) must occur exactly one time each.
        Throws:
        -
        IllegalArgumentException - if p either contains duplicates, or contains any negative elements, +
        IllegalArgumentException - if p either contains duplicates, or contains any negative elements, or contains any elements equal or greater than p.length.
      - +

      • Permutation

        -
        public Permutation(Permutation p)
        +
        public Permutation​(Permutation p)
        Initializes a permutation of n integers to be identical to a given permutation.
        @@ -610,13 +686,13 @@

        Permutation

      - +

      • Permutation

        -
        public Permutation(Permutation p,
+
        public Permutation​(Permutation p,
                    int length)
        
 
        Initializes a permutation of the integers in the interval [0, length) based on their relative order
  in a permutation p.  If length is greater than or equal to p.length, then this constructor generates a copy of p.
@@ -633,36 +709,38 @@ 
        Permutation
    +
    +
      -
    • +

    • Method Detail

      - + - +

      • toInteger

        -
        public int toInteger()
        +
        public int toInteger()
        Generates a unique integer representing the permutation. Maps the permutations of the integers, 0..(N-1), to the integers, 0..(N!-1), using a mixed radix representation. This method is only supported for permutations of length 12 or less. Runtime of this method is O(N^2).
        @@ -670,24 +748,24 @@

        toInteger

        Returns:
        a mixed radix representation of the permutation
        Throws:
        -
        UnsupportedOperationException - when permutation length is greater than 12.
        +
        UnsupportedOperationException - when permutation length is greater than 12.
      - +

      • toBigInteger

        -
        public BigInteger toBigInteger()
        +
        public BigInteger toBigInteger()

        Generates a unique integer representing the permutation. Maps the permutations of the integers, 0..(N-1), to the integers, 0..(N!-1), using a mixed radix representation.

        Even with the use of BigInteger objects, the runtime of this method is O(N^2). Specifically, it performs O(N^2) operations on primitives. And the sequence of operations on BigIntegers costs no more than the cost to compute N! using BigInteger objects, whose runtime bounded by that of the last multiplication of N * (N-1)! The number (N-1)! consists of O(log((N-1)!)) = O(N log N) digits. Java's - BigInteger.multiply currently implements the Toom–Cook algorithm, which has a runtime for M-digit numbers + BigInteger.multiply currently implements the Toom–Cook algorithm, which has a runtime for M-digit numbers of O(M^1.465). Thus, the cost of all of the BigInteger operations is O(N^1.465 log(N)^1.465). Therefore, the runtime is dominated by the cost of the primitive operations: O(N^2).

        @@ -698,13 +776,13 @@

        toBigInteger

      - +

      • getInverse

        -
        public int[] getInverse()
        +
        public int[] getInverse()
        Computes the inverse of the permutation.
        Returns:
        @@ -713,13 +791,13 @@

        getInverse

      - +

      • getInversePermutation

        -
        public Permutation getInversePermutation()
        +
        public Permutation getInversePermutation()
        Computes a Permutation that is the inverse of this Permutation. Specifically, this.get(i) == j iff inverse.get(j) == i.
        @@ -731,13 +809,13 @@

        getInversePermutation

      - +

      • invert

        -
        public void invert()
        +
        public void invert()
        Inverts the Permutation, such that if p1 is the Permutation immediately prior to the call to invert, and if p2 is the Permutation immediately after the call to invert, then p1.get(i) == j iff p2.get(j) == i, for all i, j.
        @@ -747,25 +825,25 @@

        invert

      - +

      • scramble

        -
        public void scramble()
        +
        public void scramble()
        Randomly shuffles the permutation. Uses java.util.concurrent.ThreadLocalRandom as the source of efficient random number generation.
      - +

      • scramble

        -
        public void scramble(Random r)
        +
        public void scramble​(Random r)
        Randomly shuffles the permutation.
        Parameters:
        @@ -773,13 +851,13 @@

        scramble

      - +

      • scramble

        -
        public void scramble(SplittableRandom r)
        +
        public void scramble​(SplittableRandom r)
        Randomly shuffles the permutation.
        Parameters:
        @@ -787,13 +865,13 @@

        scramble

      - +

      • scramble

        -
        public void scramble(boolean guaranteeDifferent)
        +
        public void scramble​(boolean guaranteeDifferent)
        Randomly shuffles the permutation. Uses java.util.concurrent.ThreadLocalRandom as the source of efficient random number generation.
        @@ -806,13 +884,13 @@

        scramble

      - +

      • scramble

        -
        public void scramble(Random r,
+
        public void scramble​(Random r,
                      boolean guaranteeDifferent)
        
 
        Randomly shuffles the permutation.
        
 
        
@@ -825,13 +903,13 @@ 
        scramble
      - +

      • scramble

        -
        public void scramble(SplittableRandom r,
+
        public void scramble​(SplittableRandom r,
                      boolean guaranteeDifferent)
        
 
        Randomly shuffles the permutation.
        
 
        
@@ -844,13 +922,13 @@ 
        scramble
      - +

      • scramble

        -
        public void scramble(int i,
+
        public void scramble​(int i,
                      int j)
        
 
        Randomly shuffles a segment. Uses
  java.util.concurrent.ThreadLocalRandom as 
@@ -862,20 +940,20 @@ 
        scramble
        
 
        j - endpoint of the segment
  (precondition: 0 ≤ j < length())
        
 
        Throws:
        
-
        ArrayIndexOutOfBoundsException - if either i or j are negative, 
+
        ArrayIndexOutOfBoundsException - if either i or j are negative, 
  or if either i or j are greater than or equal to length()
      - +

      • scramble

        -
        public void scramble(int i,
+
        public void scramble​(int i,
                      int j,
-                     Random r)
        
+                     Random r)
        Randomly shuffles a segment.
        Parameters:
        @@ -885,20 +963,20 @@

        scramble

        (precondition: 0 ≤ j < length())
        r - source of randomness
        Throws:
        -
        ArrayIndexOutOfBoundsException - if either i or j are negative, +
        ArrayIndexOutOfBoundsException - if either i or j are negative, or if either i or j are greater than or equal to length()
      - + - +

      • get

        -
        public int get(int i)
        +
        public int get​(int i)
        Retrieves the i'th integer of the permutation.
        Parameters:
        @@ -928,18 +1006,18 @@

        get

        Returns:
        the integer in the i'th position.
        Throws:
        -
        ArrayIndexOutOfBoundsException - if i is negative, +
        ArrayIndexOutOfBoundsException - if i is negative, or if i is greater than or equal to length()
      - +

      • get

        -
        public int[] get(int i,
+
        public int[] get​(int i,
                  int j)
        
 
        Retrieves a range of elements from the permutation.
        
 
        
@@ -949,20 +1027,20 @@ 
        get
        
 
        Returns:
        
 
        An array containing the permutation elements from positions i through j, inclusive.
        
 
        Throws:
        
-
        IllegalArgumentException - if j < i
        
-
        IndexOutOfBoundsException - if i is negative, or j ≥ Permutation.length()
        
+
        IllegalArgumentException - if j < i
        
+
        IndexOutOfBoundsException - if i is negative, or j ≥ Permutation.length()
        
 
        Since:
        
 
        2.0
      - +

      • get

        -
        public int[] get(int i,
+
        public int[] get​(int i,
                  int j,
                  int[] array)
        
 
        Retrieves a range of elements from the permutation.
        
@@ -975,20 +1053,20 @@ 
        get
        
 
        Returns:
        
 
        The array containing the permutation elements from positions i through j, inclusive.
        
 
        Throws:
        
-
        IllegalArgumentException - if j < i
        
-
        IndexOutOfBoundsException - if i is negative, or j ≥ Permutation.length()
        
+
        IllegalArgumentException - if j < i
        
+
        IndexOutOfBoundsException - if i is negative, or j ≥ Permutation.length()
        
 
        Since:
        
 
        2.0
      - +

      • toArray

        -
        public int[] toArray()
        +
        public int[] toArray()
        Generates an array of int values from the interval [0, n) in the same order that they occur in this Permutation. The array that is returned is independent of the object state (i.e., changes to its contents will not affect the Permutation).
        @@ -1001,13 +1079,13 @@

        toArray

      - +

      • toArray

        -
        public int[] toArray(int[] array)
        +
        public int[] toArray​(int[] array)

        Generates an array of int values from the interval [0, n) in the same order that they occur in this Permutation. The array that is returned is independent of the object state (i.e., changes to its contents will not affect the Permutation).

        @@ -1024,13 +1102,13 @@

        toArray

      - +

      • length

        -
        public int length()
        +
        public int length()
        Retrieves the length of the permutation.
        Returns:
        @@ -1038,13 +1116,13 @@

        length

      - +

      • swap

        -
        public void swap(int i,
+
        public void swap​(int i,
                  int j)
        
 
        Swaps 2 integers in the permutation.
        
 
        
@@ -1054,18 +1132,18 @@ 
        swap
        
 
        j - the position of the second to swap
  (precondition: 0 ≤ j < length() ∧ i != j)
        
 
        Throws:
        
-
        ArrayIndexOutOfBoundsException - if either i or j are negative, 
+
        ArrayIndexOutOfBoundsException - if either i or j are negative, 
  or if either i or j are greater than or equal to length()
      - +

      • swapBlocks

        -
        public void swapBlocks(int a,
+
        public void swapBlocks​(int a,
                        int b,
                        int i,
                        int j)
        
@@ -1077,30 +1155,30 @@ 
        swapBlocks
        
 
        i - Starting index of second block.
        
 
        j - Ending index, inclusive, of second block.
        
 
        Throws:
        
-
        IllegalArgumentException - if the following constraint is violated:
+
        IllegalArgumentException - if the following constraint is violated:
  0 ≤ a ≤ b < i ≤ j < length().
        
 
        Since:
        
 
        2.0
      - +

      • reverse

        -
        public void reverse()
        +
        public void reverse()
        Reverses the order of the elements in the permutation.
      - +

      • reverse

        -
        public void reverse(int i,
+
        public void reverse​(int i,
                     int j)
        
 
        Reverses the order of the elements of a subrange of  the permutation.
        
 
        
@@ -1110,18 +1188,18 @@ 
        reverse
        
 
        j - the position of the second index
  (precondition: 0 ≤ j < length() ∧ i != j)
        
 
        Throws:
        
-
        ArrayIndexOutOfBoundsException - if either i or j are negative, 
+
        ArrayIndexOutOfBoundsException - if either i or j are negative, 
  or if either i or j are greater than or equal to length()
      - +

      • removeAndInsert

        -
        public void removeAndInsert(int i,
+
        public void removeAndInsert​(int i,
                             int j)
        
 
        Removes integer from one position and then inserts it into a
  a new position shifting the rest of the permutation as necessary.
        
@@ -1132,18 +1210,18 @@ 
        removeAndInsert
        
 
        j - the position of the insertion point
  (precondition: 0 ≤ j < length())
        
 
        Throws:
        
-
        ArrayIndexOutOfBoundsException - if either i or j are negative, 
+
        ArrayIndexOutOfBoundsException - if either i or j are negative, 
  or if either i or j are greater than or equal to length()
      - +

      • rotate

        -
        public void rotate(int numPositions)
        +
        public void rotate​(int numPositions)
        Circular rotation of permutation (to the left).
        Parameters:
        @@ -1151,13 +1229,13 @@

        rotate

      - +

      • removeAndInsert

        -
        public void removeAndInsert(int i,
+
        public void removeAndInsert​(int i,
                             int size,
                             int j)
        
 
        Removes a sub-array of integers from one position and then inserts it into a
@@ -1171,45 +1249,45 @@ 
        removeAndInsert
        
 
        j - the position of the insertion point
  (precondition: 0 ≤ j < length())
        
 
        Throws:
        
-
        ArrayIndexOutOfBoundsException - if either i or j are negative, 
+
        ArrayIndexOutOfBoundsException - if either i or j are negative, 
  or if either i or j are greater than or equal to length().
      - +

      • set

        -
        public void set(int[] p)
        +
        public void set​(int[] p)
        Changes the state of this permutation to be identical to the elements of an array.
        Parameters:
        p - An array of integers. Each of the integers in the interval [0, p.length) must occur exactly one time each.
        Throws:
        -
        IllegalArgumentException - if p either contains duplicates, or contains any negative elements, +
        IllegalArgumentException - if p either contains duplicates, or contains any negative elements, or contains any elements equal or greater than p.length.
        Since:
        1.2.5
      - +

      • iterator

        -
        public Iterator<Permutation> iterator()
        +
        public Iterator<Permutation> iterator()
        Returns an Iterator over all Permutations the length of this Permutation. Iteration begins at this Permutation. This Iterator does not iterate over the integers within the Permutation. If you do need to iterate over all permutations of a given length, then this method is much more efficient than - using the Permutation(int,int) constructor repeatedly incrementing the value passed for the second parameter.
        + using the Permutation(int,int) constructor repeatedly incrementing the value passed for the second parameter.
        Specified by:
        -
        iterator in interface Iterable<Permutation>
        +
        iterator in interface Iterable<Permutation>
        Returns:
        an Iterator
        Since:
        @@ -1217,34 +1295,34 @@

        iterator

      - +

      • toString

        -
        public String toString()
        +
        public String toString()
        Creates a String representing the permutation.
        Overrides:
        -
        toString in class Object
        +
        toString in class Object
        Returns:
        a space separated sequence of the permutation's elements
      - +

      • equals

        -
        public boolean equals(Object other)
        +
        public boolean equals​(Object other)
        Equality test: Two permutations are equal if they are of the same length and contain the same elements in the same order.
        Overrides:
        -
        equals in class Object
        +
        equals in class Object
        Parameters:
        other - the permutation to which to compare
        Returns:
        @@ -1252,17 +1330,17 @@

        equals

      - +

      • hashCode

        -
        public int hashCode()
        +
        public int hashCode()
        Uses Java's Arrays class's method for generating a hashCode from an array of ints.
        Overrides:
        -
        hashCode in class Object
        +
        hashCode in class Object
        Returns:
        a hashCode for the permutation
        @@ -1270,21 +1348,25 @@

        hashCode

    +
    • +

    + diff --git a/docs/api/org/cicirello/permutations/PermutationIterator.html b/docs/api/org/cicirello/permutations/PermutationIterator.html index 051cb09d..336678b3 100644 --- a/docs/api/org/cicirello/permutations/PermutationIterator.html +++ b/docs/api/org/cicirello/permutations/PermutationIterator.html @@ -1,11 +1,21 @@ - + PermutationIterator (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations
    +
    Package org.cicirello.permutations

    Class PermutationIterator

    @@ -197,18 +229,19 @@

    Methods inherited from interface java.util.
  • +
      -
    • +

    • Constructor Detail

      - +

      • PermutationIterator

        -
        public PermutationIterator(int n)
        +
        public PermutationIterator​(int n)
        Initializes a PermutationIterator to iterate over all permutations of a given length. Specifically, it iterates over permutations of the first n integers, i.e., the integers in the interval [0, n-1]. The first permutation in the iteration is chosen randomly.
        @@ -218,13 +251,13 @@

        PermutationIterator

      - +

      • PermutationIterator

        -
        public PermutationIterator(Permutation p)
        +
        public PermutationIterator​(Permutation p)
        Initializes a PermutationIterator to iterate over all permutations the same length as a given permutation. Specifically, it iterates over permutations of the first n integers, i.e., the integers in the interval [0, n-1). The first permutation in the iteration is specified as a parameter.
        @@ -236,55 +269,61 @@

        PermutationIterator

    +
    +
    +
    • +

    + diff --git a/docs/api/org/cicirello/permutations/distance/AcyclicEdgeDistance.html b/docs/api/org/cicirello/permutations/distance/AcyclicEdgeDistance.html index 51c03715..f99f1c5c 100644 --- a/docs/api/org/cicirello/permutations/distance/AcyclicEdgeDistance.html +++ b/docs/api/org/cicirello/permutations/distance/AcyclicEdgeDistance.html @@ -1,11 +1,21 @@ - + AcyclicEdgeDistance (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Class AcyclicEdgeDistance

    Since:
    1.0
    @@ -142,81 +166,93 @@

    Class AcyclicEdgeDistance
  • +
      -
    • +

    • Constructor Summary

      - +
      - + + - +
      Constructors 
      Constructor and DescriptionConstructorDescription
      AcyclicEdgeDistance() +AcyclicEdgeDistance()
      Constructs the distance measurer as specified in the class documentation.
    +
    +
    +
    • @@ -224,12 +260,13 @@

    Methods inherited from class java.lang.
  • +
      -
    • +

    • Constructor Detail

      - +
        @@ -241,20 +278,22 @@

        AcyclicEdgeDistance

    +
    +
    +
    • +

    + diff --git a/docs/api/org/cicirello/permutations/distance/BlockInterchangeDistance.html b/docs/api/org/cicirello/permutations/distance/BlockInterchangeDistance.html index afe21e16..d4ef1013 100644 --- a/docs/api/org/cicirello/permutations/distance/BlockInterchangeDistance.html +++ b/docs/api/org/cicirello/permutations/distance/BlockInterchangeDistance.html @@ -1,11 +1,21 @@ - + BlockInterchangeDistance (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Class BlockInterchangeDistance

    +
    + diff --git a/docs/api/org/cicirello/permutations/distance/CyclicEdgeDistance.html b/docs/api/org/cicirello/permutations/distance/CyclicEdgeDistance.html index bca79b88..d30c790e 100644 --- a/docs/api/org/cicirello/permutations/distance/CyclicEdgeDistance.html +++ b/docs/api/org/cicirello/permutations/distance/CyclicEdgeDistance.html @@ -1,11 +1,21 @@ - + CyclicEdgeDistance (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Class CyclicEdgeDistance

    Since:
    1.0
    @@ -142,81 +166,93 @@

    Class CyclicEdgeDistance

    @@ -224,12 +260,13 @@

    Methods inherited from class java.lang.
  • +
      -
    • +

    • Constructor Detail

      - +
        @@ -241,20 +278,22 @@

        CyclicEdgeDistance

    +
    +
    +
    • +

    + diff --git a/docs/api/org/cicirello/permutations/distance/CyclicIndependentDistance.html b/docs/api/org/cicirello/permutations/distance/CyclicIndependentDistance.html index 6541549a..acd4f343 100644 --- a/docs/api/org/cicirello/permutations/distance/CyclicIndependentDistance.html +++ b/docs/api/org/cicirello/permutations/distance/CyclicIndependentDistance.html @@ -1,11 +1,21 @@ - + CyclicIndependentDistance (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Class CyclicIndependentDistance

    +
    + diff --git a/docs/api/org/cicirello/permutations/distance/CyclicIndependentDistanceDouble.html b/docs/api/org/cicirello/permutations/distance/CyclicIndependentDistanceDouble.html index b2953494..190773c0 100644 --- a/docs/api/org/cicirello/permutations/distance/CyclicIndependentDistanceDouble.html +++ b/docs/api/org/cicirello/permutations/distance/CyclicIndependentDistanceDouble.html @@ -1,11 +1,21 @@ - + CyclicIndependentDistanceDouble (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Class CyclicIndependentDistanceDouble

    +
    + diff --git a/docs/api/org/cicirello/permutations/distance/CyclicRTypeDistance.html b/docs/api/org/cicirello/permutations/distance/CyclicRTypeDistance.html index 60fe591a..5eb140b0 100644 --- a/docs/api/org/cicirello/permutations/distance/CyclicRTypeDistance.html +++ b/docs/api/org/cicirello/permutations/distance/CyclicRTypeDistance.html @@ -1,11 +1,21 @@ - + CyclicRTypeDistance (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Class CyclicRTypeDistance

    @@ -226,12 +262,13 @@

    Methods inherited from class java.lang.
  • +
      -
    • +

    • Constructor Detail

      - +
        @@ -243,20 +280,22 @@

        CyclicRTypeDistance

    +
    +
    +
    • +

    + diff --git a/docs/api/org/cicirello/permutations/distance/CyclicReversalIndependentDistance.html b/docs/api/org/cicirello/permutations/distance/CyclicReversalIndependentDistance.html index e0c0b4fc..9bb540a2 100644 --- a/docs/api/org/cicirello/permutations/distance/CyclicReversalIndependentDistance.html +++ b/docs/api/org/cicirello/permutations/distance/CyclicReversalIndependentDistance.html @@ -1,11 +1,21 @@ - + CyclicReversalIndependentDistance (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Class CyclicReversalIndependentDistance

    +
    + diff --git a/docs/api/org/cicirello/permutations/distance/CyclicReversalIndependentDistanceDouble.html b/docs/api/org/cicirello/permutations/distance/CyclicReversalIndependentDistanceDouble.html index 49268385..bfdc9363 100644 --- a/docs/api/org/cicirello/permutations/distance/CyclicReversalIndependentDistanceDouble.html +++ b/docs/api/org/cicirello/permutations/distance/CyclicReversalIndependentDistanceDouble.html @@ -1,11 +1,21 @@ - + CyclicReversalIndependentDistanceDouble (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Class CyclicReversalIndependentDistanceDouble

    +
    + diff --git a/docs/api/org/cicirello/permutations/distance/DeviationDistance.html b/docs/api/org/cicirello/permutations/distance/DeviationDistance.html index 85069535..4fb5c711 100644 --- a/docs/api/org/cicirello/permutations/distance/DeviationDistance.html +++ b/docs/api/org/cicirello/permutations/distance/DeviationDistance.html @@ -1,11 +1,21 @@ - + DeviationDistance (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Class DeviationDistance

    Since:
    1.0
    @@ -142,81 +166,93 @@

    Class DeviationDistance

    @@ -224,12 +260,13 @@

    Methods inherited from class java.lang.
  • +
      -
    • +

    • Constructor Detail

      - +
        @@ -241,20 +278,22 @@

        DeviationDistance

    +
    +
    +
    • +

    + diff --git a/docs/api/org/cicirello/permutations/distance/DeviationDistanceNormalized.html b/docs/api/org/cicirello/permutations/distance/DeviationDistanceNormalized.html index c0dca530..35220f96 100644 --- a/docs/api/org/cicirello/permutations/distance/DeviationDistanceNormalized.html +++ b/docs/api/org/cicirello/permutations/distance/DeviationDistanceNormalized.html @@ -1,11 +1,21 @@ - + DeviationDistanceNormalized (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Class DeviationDistanceNormalized

    Since:
    1.0
    @@ -148,67 +172,77 @@

    Class DeviationDista @@ -216,12 +250,13 @@

    Methods inherited from class java.lang.
  • +
      -
    • +

    • Constructor Detail

      - +
        @@ -233,24 +268,26 @@

        DeviationDistanceNormalized

    +
    +
    +
    • +

    + diff --git a/docs/api/org/cicirello/permutations/distance/DeviationDistanceNormalized2005.html b/docs/api/org/cicirello/permutations/distance/DeviationDistanceNormalized2005.html index be5e9afa..b7e880f9 100644 --- a/docs/api/org/cicirello/permutations/distance/DeviationDistanceNormalized2005.html +++ b/docs/api/org/cicirello/permutations/distance/DeviationDistanceNormalized2005.html @@ -1,11 +1,21 @@ - + DeviationDistanceNormalized2005 (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Class DeviationDistanceNormalized2005

    +
    + diff --git a/docs/api/org/cicirello/permutations/distance/EditDistance.html b/docs/api/org/cicirello/permutations/distance/EditDistance.html index 8400077e..cf3475ea 100644 --- a/docs/api/org/cicirello/permutations/distance/EditDistance.html +++ b/docs/api/org/cicirello/permutations/distance/EditDistance.html @@ -1,11 +1,21 @@ - + EditDistance (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Class EditDistance

    Since:
    1.0
    @@ -153,61 +177,70 @@

    Class EditDistance

    @@ -215,18 +248,19 @@

    Methods inherited from class java.lang.
  • +
      -
    • +

    • Constructor Detail

      - +

      • EditDistance

        -
        public EditDistance(double insertCost,
+
        public EditDistance​(double insertCost,
                     double deleteCost,
                     double changeCost)
        
 
        Constructs an EditDistance function.
        
@@ -238,7 +272,7 @@ 
        EditDistance

    • - +
      @@ -251,24 +285,26 @@

      EditDistance

    + +
    +
    +
    + diff --git a/docs/api/org/cicirello/permutations/distance/ExactMatchDistance.html b/docs/api/org/cicirello/permutations/distance/ExactMatchDistance.html index cc23aa05..fd9cb7ce 100644 --- a/docs/api/org/cicirello/permutations/distance/ExactMatchDistance.html +++ b/docs/api/org/cicirello/permutations/distance/ExactMatchDistance.html @@ -1,11 +1,21 @@ - + ExactMatchDistance (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Class ExactMatchDistance

    Since:
    1.0
    @@ -133,81 +157,93 @@

    Class ExactMatchDistance

    @@ -215,12 +251,13 @@

    Methods inherited from class java.lang.
  • +
      -
    • +

    • Constructor Detail

      - +
        @@ -232,20 +269,22 @@

        ExactMatchDistance

    +
    +
    +
    • +

    + diff --git a/docs/api/org/cicirello/permutations/distance/InterchangeDistance.html b/docs/api/org/cicirello/permutations/distance/InterchangeDistance.html index 8a10cbde..5e8d70bd 100644 --- a/docs/api/org/cicirello/permutations/distance/InterchangeDistance.html +++ b/docs/api/org/cicirello/permutations/distance/InterchangeDistance.html @@ -1,11 +1,21 @@ - + InterchangeDistance (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Class InterchangeDistance

    @@ -222,12 +258,13 @@

    Methods inherited from class java.lang.
  • +
      -
    • +

    • Constructor Detail

      - +
        @@ -239,20 +276,22 @@

        InterchangeDistance

    +
    +
    +
    • +

    + diff --git a/docs/api/org/cicirello/permutations/distance/KendallTauDistance.html b/docs/api/org/cicirello/permutations/distance/KendallTauDistance.html index b0c14f38..c6e94119 100644 --- a/docs/api/org/cicirello/permutations/distance/KendallTauDistance.html +++ b/docs/api/org/cicirello/permutations/distance/KendallTauDistance.html @@ -1,11 +1,21 @@ - + KendallTauDistance (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Class KendallTauDistance

    Since:
    1.0
    @@ -146,81 +170,93 @@

    Class KendallTauDistance

    @@ -228,12 +264,13 @@

    Methods inherited from class java.lang.
  • +
      -
    • +

    • Constructor Detail

      - +
        @@ -245,20 +282,22 @@

        KendallTauDistance

    +
    +
    +
    • +

    + diff --git a/docs/api/org/cicirello/permutations/distance/LeeDistance.html b/docs/api/org/cicirello/permutations/distance/LeeDistance.html index c677121a..76af8241 100644 --- a/docs/api/org/cicirello/permutations/distance/LeeDistance.html +++ b/docs/api/org/cicirello/permutations/distance/LeeDistance.html @@ -1,11 +1,21 @@ - + LeeDistance (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Class LeeDistance

    +
    + diff --git a/docs/api/org/cicirello/permutations/distance/NormalizedPermutationDistanceMeasurer.html b/docs/api/org/cicirello/permutations/distance/NormalizedPermutationDistanceMeasurer.html index 0fd418e2..7cc96880 100644 --- a/docs/api/org/cicirello/permutations/distance/NormalizedPermutationDistanceMeasurer.html +++ b/docs/api/org/cicirello/permutations/distance/NormalizedPermutationDistanceMeasurer.html @@ -1,11 +1,21 @@ - + NormalizedPermutationDistanceMeasurer (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Interface NormalizedPermutationDistanceMeasurer

    @@ -99,16 +124,15 @@

    Interf
  • All Superinterfaces:
    -
    NormalizedPermutationDistanceMeasurerDouble
    +
    NormalizedPermutationDistanceMeasurerDouble
    All Known Implementing Classes:
    -
    AcyclicEdgeDistance, BlockInterchangeDistance, CyclicEdgeDistance, CyclicRTypeDistance, DeviationDistance, ExactMatchDistance, InterchangeDistance, KendallTauDistance, LeeDistance, ReinsertionDistance, ReversalDistance, RTypeDistance, ScrambleDistance, SquaredDeviationDistance
    +
    AcyclicEdgeDistance, BlockInterchangeDistance, CyclicEdgeDistance, CyclicRTypeDistance, DeviationDistance, ExactMatchDistance, InterchangeDistance, KendallTauDistance, LeeDistance, ReinsertionDistance, ReversalDistance, RTypeDistance, ScrambleDistance, SquaredDeviationDistance
    -
    public interface NormalizedPermutationDistanceMeasurer
-extends NormalizedPermutationDistanceMeasurerDouble
    +extends NormalizedPermutationDistanceMeasurerDouble
    Implement this interface to define a distance metric for permutations that supports normalizing the distance to the interval [0,1], but where the base distance is an integer value.
    @@ -122,34 +146,38 @@

    Interf

    • @@ -157,18 +185,19 @@

    Methods inherited from interface org.cicirello.permutations.distance.
  • +
      -
    • +

    • Method Detail

      - +

      • max

        -
        int max(int length)
        +
        int max​(int length)
        Computes the maximum possible distance between permutations of a specified length.
        @@ -183,21 +212,25 @@

        max

    +
    • +

    + diff --git a/docs/api/org/cicirello/permutations/distance/NormalizedPermutationDistanceMeasurerDouble.html b/docs/api/org/cicirello/permutations/distance/NormalizedPermutationDistanceMeasurerDouble.html index e139a3f6..58801e82 100644 --- a/docs/api/org/cicirello/permutations/distance/NormalizedPermutationDistanceMeasurerDouble.html +++ b/docs/api/org/cicirello/permutations/distance/NormalizedPermutationDistanceMeasurerDouble.html @@ -1,11 +1,21 @@ - + NormalizedPermutationDistanceMeasurerDouble (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Interface NormalizedPermutationDistanceMeasurerDouble

    @@ -99,14 +124,13 @@

  • All Known Subinterfaces:
    -
    NormalizedPermutationDistanceMeasurer
    +
    NormalizedPermutationDistanceMeasurer
    All Known Implementing Classes:
    -
    AcyclicEdgeDistance, BlockInterchangeDistance, CyclicEdgeDistance, CyclicRTypeDistance, DeviationDistance, DeviationDistanceNormalized, DeviationDistanceNormalized2005, ExactMatchDistance, InterchangeDistance, KendallTauDistance, LeeDistance, ReinsertionDistance, ReversalDistance, RTypeDistance, ScrambleDistance, SquaredDeviationDistance
    +
    AcyclicEdgeDistance, BlockInterchangeDistance, CyclicEdgeDistance, CyclicRTypeDistance, DeviationDistance, DeviationDistanceNormalized, DeviationDistanceNormalized2005, ExactMatchDistance, InterchangeDistance, KendallTauDistance, LeeDistance, ReinsertionDistance, ReversalDistance, RTypeDistance, ScrambleDistance, SquaredDeviationDistance
    -
    public interface NormalizedPermutationDistanceMeasurerDouble
    Implement this interface to define a distance metric for permutations that supports normalizing the distance to the interval [0,1].
    @@ -121,34 +145,39 @@

    • @@ -156,19 +185,20 @@

    Method Summary

    • +
        -
      • +

      • Method Detail

        - +

        • normalizedDistance

          -
          double normalizedDistance(Permutation p1,
-                          Permutation p2)
          +
          double normalizedDistance​(Permutation p1,
+                          Permutation p2)

          Measures the distance between two permutations, normalized to the interval [0.0, 1.0].

          Parameters:
          @@ -181,13 +211,13 @@

          normalizedDistance

        - +

        • maxf

          -
          double maxf(int length)
          +
          double maxf​(int length)
          Computes the maximum possible distance between permutations of a specified length.
          @@ -202,21 +232,25 @@

          maxf

      +
    +
    + diff --git a/docs/api/org/cicirello/permutations/distance/PermutationDistanceMeasurer.html b/docs/api/org/cicirello/permutations/distance/PermutationDistanceMeasurer.html index e8781e9f..aa809be5 100644 --- a/docs/api/org/cicirello/permutations/distance/PermutationDistanceMeasurer.html +++ b/docs/api/org/cicirello/permutations/distance/PermutationDistanceMeasurer.html @@ -1,11 +1,21 @@ - + PermutationDistanceMeasurer (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Interface PermutationDistanceMeasurer

    @@ -99,16 +124,15 @@

    Interface Permut
  • All Superinterfaces:
    -
    PermutationDistanceMeasurerDouble
    +
    PermutationDistanceMeasurerDouble
    All Known Implementing Classes:
    -
    AcyclicEdgeDistance, BlockInterchangeDistance, CyclicEdgeDistance, CyclicIndependentDistance, CyclicReversalIndependentDistance, CyclicRTypeDistance, DeviationDistance, ExactMatchDistance, InterchangeDistance, KendallTauDistance, LeeDistance, ReinsertionDistance, ReversalDistance, ReversalIndependentDistance, RTypeDistance, ScrambleDistance, SquaredDeviationDistance
    +
    AcyclicEdgeDistance, BlockInterchangeDistance, CyclicEdgeDistance, CyclicIndependentDistance, CyclicReversalIndependentDistance, CyclicRTypeDistance, DeviationDistance, ExactMatchDistance, InterchangeDistance, KendallTauDistance, LeeDistance, ReinsertionDistance, ReversalDistance, ReversalIndependentDistance, RTypeDistance, ScrambleDistance, SquaredDeviationDistance
    -
    public interface PermutationDistanceMeasurer
-extends PermutationDistanceMeasurerDouble
    +extends PermutationDistanceMeasurerDouble
    Implement this interface, PermutationDistanceMeasurer, to define a distance metric for permutations.
    Since:
    @@ -121,34 +145,38 @@

    Interface Permut

    • @@ -156,19 +184,20 @@

    Methods inherited from interface org.cicirello.permutations.distance.
  • +
    +
    • +

    + diff --git a/docs/api/org/cicirello/permutations/distance/PermutationDistanceMeasurerDouble.html b/docs/api/org/cicirello/permutations/distance/PermutationDistanceMeasurerDouble.html index 44001170..6ef54baa 100644 --- a/docs/api/org/cicirello/permutations/distance/PermutationDistanceMeasurerDouble.html +++ b/docs/api/org/cicirello/permutations/distance/PermutationDistanceMeasurerDouble.html @@ -1,11 +1,21 @@ - + PermutationDistanceMeasurerDouble (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Interface PermutationDistanceMeasurerDouble

    @@ -99,14 +124,13 @@

    Interface
  • All Known Subinterfaces:
    -
    PermutationDistanceMeasurer
    +
    PermutationDistanceMeasurer
    All Known Implementing Classes:
    -
    AcyclicEdgeDistance, BlockInterchangeDistance, CyclicEdgeDistance, CyclicIndependentDistance, CyclicIndependentDistanceDouble, CyclicReversalIndependentDistance, CyclicReversalIndependentDistanceDouble, CyclicRTypeDistance, DeviationDistance, DeviationDistanceNormalized, DeviationDistanceNormalized2005, EditDistance, ExactMatchDistance, InterchangeDistance, KendallTauDistance, LeeDistance, ReinsertionDistance, ReversalDistance, ReversalIndependentDistance, ReversalIndependentDistanceDouble, RTypeDistance, ScrambleDistance, SquaredDeviationDistance
    +
    AcyclicEdgeDistance, BlockInterchangeDistance, CyclicEdgeDistance, CyclicIndependentDistance, CyclicIndependentDistanceDouble, CyclicReversalIndependentDistance, CyclicReversalIndependentDistanceDouble, CyclicRTypeDistance, DeviationDistance, DeviationDistanceNormalized, DeviationDistanceNormalized2005, EditDistance, ExactMatchDistance, InterchangeDistance, KendallTauDistance, LeeDistance, ReinsertionDistance, ReversalDistance, ReversalIndependentDistance, ReversalIndependentDistanceDouble, RTypeDistance, ScrambleDistance, SquaredDeviationDistance
    -
    public interface PermutationDistanceMeasurerDouble
    Implement this interface, PermutationDistanceMeasurerDouble, to define a distance metric for permutations, where the distance is a floating-point value.
    @@ -121,27 +145,31 @@

    Interface

    • @@ -149,19 +177,20 @@

    Method Summary

    +
    + diff --git a/docs/api/org/cicirello/permutations/distance/RTypeDistance.html b/docs/api/org/cicirello/permutations/distance/RTypeDistance.html index 8820bb9d..827c98d1 100644 --- a/docs/api/org/cicirello/permutations/distance/RTypeDistance.html +++ b/docs/api/org/cicirello/permutations/distance/RTypeDistance.html @@ -1,11 +1,21 @@ - + RTypeDistance (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Class RTypeDistance

    Since:
    1.0
    @@ -143,81 +167,93 @@

    Class RTypeDistance

    @@ -225,12 +261,13 @@

    Methods inherited from class java.lang.
  • +
      -
    • +

    • Constructor Detail

      - +
        @@ -242,20 +279,22 @@

        RTypeDistance

    +
    +
    +
    • +

    + diff --git a/docs/api/org/cicirello/permutations/distance/ReinsertionDistance.html b/docs/api/org/cicirello/permutations/distance/ReinsertionDistance.html index f25de577..5141cd43 100644 --- a/docs/api/org/cicirello/permutations/distance/ReinsertionDistance.html +++ b/docs/api/org/cicirello/permutations/distance/ReinsertionDistance.html @@ -1,11 +1,21 @@ - + ReinsertionDistance (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Class ReinsertionDistance

    @@ -239,12 +275,13 @@

    Methods inherited from class java.lang.
  • +
      -
    • +

    • Constructor Detail

      - +
        @@ -256,20 +293,22 @@

        ReinsertionDistance

    +
    +
    +
    • +

    + diff --git a/docs/api/org/cicirello/permutations/distance/ReversalDistance.html b/docs/api/org/cicirello/permutations/distance/ReversalDistance.html index 86d467fd..786fe583 100644 --- a/docs/api/org/cicirello/permutations/distance/ReversalDistance.html +++ b/docs/api/org/cicirello/permutations/distance/ReversalDistance.html @@ -1,11 +1,21 @@ - + ReversalDistance (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Class ReversalDistance

    +
    + diff --git a/docs/api/org/cicirello/permutations/distance/ReversalIndependentDistance.html b/docs/api/org/cicirello/permutations/distance/ReversalIndependentDistance.html index 98875d0b..94074850 100644 --- a/docs/api/org/cicirello/permutations/distance/ReversalIndependentDistance.html +++ b/docs/api/org/cicirello/permutations/distance/ReversalIndependentDistance.html @@ -1,11 +1,21 @@ - + ReversalIndependentDistance (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Class ReversalIndependentDistance

    +
    + diff --git a/docs/api/org/cicirello/permutations/distance/ReversalIndependentDistanceDouble.html b/docs/api/org/cicirello/permutations/distance/ReversalIndependentDistanceDouble.html index c056b7a0..8a3f3094 100644 --- a/docs/api/org/cicirello/permutations/distance/ReversalIndependentDistanceDouble.html +++ b/docs/api/org/cicirello/permutations/distance/ReversalIndependentDistanceDouble.html @@ -1,11 +1,21 @@ - + ReversalIndependentDistanceDouble (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Class ReversalIndependentDistanceDouble

    +
    + diff --git a/docs/api/org/cicirello/permutations/distance/ScrambleDistance.html b/docs/api/org/cicirello/permutations/distance/ScrambleDistance.html index 668ffce6..82139d00 100644 --- a/docs/api/org/cicirello/permutations/distance/ScrambleDistance.html +++ b/docs/api/org/cicirello/permutations/distance/ScrambleDistance.html @@ -1,11 +1,21 @@ - + ScrambleDistance (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Class ScrambleDistance

    +
    + diff --git a/docs/api/org/cicirello/permutations/distance/SquaredDeviationDistance.html b/docs/api/org/cicirello/permutations/distance/SquaredDeviationDistance.html index a527144d..d25f2729 100644 --- a/docs/api/org/cicirello/permutations/distance/SquaredDeviationDistance.html +++ b/docs/api/org/cicirello/permutations/distance/SquaredDeviationDistance.html @@ -1,11 +1,21 @@ - + SquaredDeviationDistance (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.permutations.distance
    +
    Package org.cicirello.permutations.distance

    Class SquaredDeviationDistance

    +
    + diff --git a/docs/api/org/cicirello/permutations/distance/package-frame.html b/docs/api/org/cicirello/permutations/distance/package-frame.html deleted file mode 100644 index 73c02e6a..00000000 --- a/docs/api/org/cicirello/permutations/distance/package-frame.html +++ /dev/null @@ -1,48 +0,0 @@ - - - - - -org.cicirello.permutations.distance (JavaPermutationTools - A Java API for computation on permutations) - - - - -

    org.cicirello.permutations.distance

    -
    -

    Interfaces

    - -

    Classes

    - -
    - - diff --git a/docs/api/org/cicirello/permutations/distance/package-summary.html b/docs/api/org/cicirello/permutations/distance/package-summary.html index ea748897..9705fb99 100644 --- a/docs/api/org/cicirello/permutations/distance/package-summary.html +++ b/docs/api/org/cicirello/permutations/distance/package-summary.html @@ -1,11 +1,21 @@ - + org.cicirello.permutations.distance (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +

    Package org.cicirello.permutations.distance

    -
    -
    Implementations of a variety of permutation distance measures.
    -
    -

    See: Description

    +
    + + +
    Implementations of a variety of permutation distance measures.
    +
    +
    Since:
    +
    1.0
    +
    +
    - - - -

    Package org.cicirello.permutations.distance Description

    -
    Implementations of a variety of permutation distance measures.
    -
    -
    Since:
    -
    1.0
    -
    +
    + diff --git a/docs/api/org/cicirello/permutations/distance/package-tree.html b/docs/api/org/cicirello/permutations/distance/package-tree.html index a80e75c2..e1dd7119 100644 --- a/docs/api/org/cicirello/permutations/distance/package-tree.html +++ b/docs/api/org/cicirello/permutations/distance/package-tree.html @@ -1,11 +1,21 @@ - + org.cicirello.permutations.distance Class Hierarchy (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +

    Hierarchy For Package org.cicirello.permutations.distance

    Package Hierarchies: @@ -75,60 +100,67 @@

    Hierarchy For Package org.cicirello.permutations.distance

    +

    Class Hierarchy

    +
    +

    Interface Hierarchy

    +
    +
    + diff --git a/docs/api/org/cicirello/permutations/package-frame.html b/docs/api/org/cicirello/permutations/package-frame.html deleted file mode 100644 index 6e6f2fbd..00000000 --- a/docs/api/org/cicirello/permutations/package-frame.html +++ /dev/null @@ -1,21 +0,0 @@ - - - - - -org.cicirello.permutations (JavaPermutationTools - A Java API for computation on permutations) - - - - -

    org.cicirello.permutations

    -
    -

    Classes

    - -
    - - diff --git a/docs/api/org/cicirello/permutations/package-summary.html b/docs/api/org/cicirello/permutations/package-summary.html index eecbcf12..a468bafc 100644 --- a/docs/api/org/cicirello/permutations/package-summary.html +++ b/docs/api/org/cicirello/permutations/package-summary.html @@ -1,11 +1,21 @@ - + org.cicirello.permutations (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +

    Package org.cicirello.permutations

    -
    -
    Collection of classes related to representing and manipulating permutations.
    -
    -

    See: Description

    +
    + + +
    Collection of classes related to representing and manipulating permutations.
    +
    +
    Since:
    +
    1.0
    +
    +
    • - +
      @@ -85,13 +115,13 @@

      Package org.cicirello.permutations

      - + - + - + @@ -108,26 +138,20 @@

      Package org.cicirello.permutations

      Class Summary 
      Class
      PermutationPermutation
      Representation of a permutation of the integers from 0 to N-1, inclusive.
      Permutation.MechanicPermutation.Mechanic
      The Permutation.Mechanic class provides a means of adding application-specific operations on Permutations without the need to directly alter the Permutation @@ -99,7 +129,7 @@

      Package org.cicirello.permutations
      PermutationIteratorPermutationIterator
      Iterator over all permutations of a specified length, n, of the integers in the interval [0,n).
    - - - -

    Package org.cicirello.permutations Description

    -
    Collection of classes related to representing and manipulating permutations.
    -
    -
    Since:
    -
    1.0
    -
    +
    + diff --git a/docs/api/org/cicirello/permutations/package-tree.html b/docs/api/org/cicirello/permutations/package-tree.html index ff154e83..bef4a666 100644 --- a/docs/api/org/cicirello/permutations/package-tree.html +++ b/docs/api/org/cicirello/permutations/package-tree.html @@ -1,11 +1,21 @@ - + org.cicirello.permutations Class Hierarchy (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +

    Hierarchy For Package org.cicirello.permutations

    Package Hierarchies: @@ -75,27 +100,32 @@

    Hierarchy For Package org.cicirello.permutations

    +

    Class Hierarchy

    +
    +
    + diff --git a/docs/api/org/cicirello/sequences/SequenceSampler.html b/docs/api/org/cicirello/sequences/SequenceSampler.html index bfc64338..963df481 100644 --- a/docs/api/org/cicirello/sequences/SequenceSampler.html +++ b/docs/api/org/cicirello/sequences/SequenceSampler.html @@ -1,11 +1,21 @@ - + SequenceSampler (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.sequences
    +
    Package org.cicirello.sequences

    Class SequenceSampler

      -
    • java.lang.Object
      • +
    • java.lang.Object
      • org.cicirello.sequences.SequenceSampler
        • @@ -106,9 +131,8 @@

        Class SequenceSampler

        • -
          public final class SequenceSampler
-extends Object
          +extends Object
          ArraySampler is a class of utility methods related to efficiently generating random samples of array elements, without replacement.
          @@ -122,423 +146,471 @@

          Class SequenceSampler

          • +
              -
            • +

            • Method Summary

              - +
              - + + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - +
              All Methods Static Methods Concrete Methods 
              Modifier and TypeMethod and DescriptionMethodDescription
              static byte[]sample(byte[] source, - double p) +sample​(byte[] source, + double p)
              Generates a random sample, without replacement, from a given source array with a specified probability of an element's inclusion in the sample.
              static byte[]sample(byte[] source, +sample​(byte[] source, int k, - byte[] target) + byte[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static char[]sample(char[] source, - double p) +sample​(char[] source, + double p)
              Generates a random sample, without replacement, from a given source array with a specified probability of an element's inclusion in the sample.
              static char[]sample(char[] source, +sample​(char[] source, int k, - char[] target) + char[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static double[]sample(double[] source, - double p) +sample​(double[] source, + double p)
              Generates a random sample, without replacement, from a given source array with a specified probability of an element's inclusion in the sample.
              static double[]sample(double[] source, +sample​(double[] source, int k, - double[] target) + double[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static float[]sample(float[] source, - double p) +sample​(float[] source, + double p)
              Generates a random sample, without replacement, from a given source array with a specified probability of an element's inclusion in the sample.
              static float[]sample(float[] source, +sample​(float[] source, int k, - float[] target) + float[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static int[]sample(int[] source, - double p) +sample​(int[] source, + double p)
              Generates a random sample, without replacement, from a given source array with a specified probability of an element's inclusion in the sample.
              static int[]sample(int[] source, +sample​(int[] source, int k, - int[] target) + int[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static long[]sample(long[] source, - double p) +sample​(long[] source, + double p)
              Generates a random sample, without replacement, from a given source array with a specified probability of an element's inclusion in the sample.
              static long[]sample(long[] source, +sample​(long[] source, int k, - long[] target) + long[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static short[]sample(short[] source, - double p) +sample​(short[] source, + double p)
              Generates a random sample, without replacement, from a given source array with a specified probability of an element's inclusion in the sample.
              static short[]sample(short[] source, +sample​(short[] source, int k, - short[] target) + short[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static char[]sample(String source, - double p) +sample​(String source, + double p)
              Generates a random sample, without replacement, from a given String with a specified probability of a character's inclusion in the sample.
              static char[]sample(String source, +sample​(String source, int k, - char[] target) + char[] target)
              Generates a random sample of k chars, without replacement, from a given source String.
              static <T> T[]sample(T[] source, - double p) +sample​(T[] source, + double p)
              Generates a random sample, without replacement, from a given source array with a specified probability of an element's inclusion in the sample.
              static <T> T[]sample(T[] source, +sample​(T[] source, int k, - T[] target) + T[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static byte[]sampleInsertion(byte[] source, +sampleInsertion​(byte[] source, int k, - byte[] target) + byte[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static char[]sampleInsertion(char[] source, +sampleInsertion​(char[] source, int k, - char[] target) + char[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static double[]sampleInsertion(double[] source, +sampleInsertion​(double[] source, int k, - double[] target) + double[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static float[]sampleInsertion(float[] source, +sampleInsertion​(float[] source, int k, - float[] target) + float[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static int[]sampleInsertion(int[] source, +sampleInsertion​(int[] source, int k, - int[] target) + int[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static long[]sampleInsertion(long[] source, +sampleInsertion​(long[] source, int k, - long[] target) + long[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static short[]sampleInsertion(short[] source, +sampleInsertion​(short[] source, int k, - short[] target) + short[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static char[]sampleInsertion(String source, +sampleInsertion​(String source, int k, - char[] target) + char[] target)
              Generates a random sample of k chars, without replacement, from a given source String.
              static <T> T[]sampleInsertion(T[] source, +sampleInsertion​(T[] source, int k, - T[] target) + T[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static byte[]samplePool(byte[] source, +samplePool​(byte[] source, int k, - byte[] target) + byte[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static char[]samplePool(char[] source, +samplePool​(char[] source, int k, - char[] target) + char[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static double[]samplePool(double[] source, +samplePool​(double[] source, int k, - double[] target) + double[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static float[]samplePool(float[] source, +samplePool​(float[] source, int k, - float[] target) + float[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static int[]samplePool(int[] source, +samplePool​(int[] source, int k, - int[] target) + int[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static long[]samplePool(long[] source, +samplePool​(long[] source, int k, - long[] target) + long[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static short[]samplePool(short[] source, +samplePool​(short[] source, int k, - short[] target) + short[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static char[]samplePool(String source, +samplePool​(String source, int k, - char[] target) + char[] target)
              Generates a random sample of k chars, without replacement, from a given source String.
              static <T> T[]samplePool(T[] source, +samplePool​(T[] source, int k, - T[] target) + T[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static byte[]sampleReservoir(byte[] source, +sampleReservoir​(byte[] source, int k, - byte[] target) + byte[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static char[]sampleReservoir(char[] source, +sampleReservoir​(char[] source, int k, - char[] target) + char[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static double[]sampleReservoir(double[] source, +sampleReservoir​(double[] source, int k, - double[] target) + double[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static float[]sampleReservoir(float[] source, +sampleReservoir​(float[] source, int k, - float[] target) + float[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static int[]sampleReservoir(int[] source, +sampleReservoir​(int[] source, int k, - int[] target) + int[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static long[]sampleReservoir(long[] source, +sampleReservoir​(long[] source, int k, - long[] target) + long[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static short[]sampleReservoir(short[] source, +sampleReservoir​(short[] source, int k, - short[] target) + short[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
              static char[]sampleReservoir(String source, +sampleReservoir​(String source, int k, - char[] target) + char[] target)
              Generates a random sample of k chars, without replacement, from a given source String.
              static <T> T[]sampleReservoir(T[] source, +sampleReservoir​(T[] source, int k, - T[] target) + T[] target)
              Generates a random sample of k elements, without replacement, from a given source array.
            +
    @@ -546,18 +618,19 @@

    Methods inherited from class java.lang.
  • +
      -
    • +

    • Method Detail

      - +

      • sample

        -
        public static byte[] sample(byte[] source,
+
        public static byte[] sample​(byte[] source,
                             double p)
        
 
        Generates a random sample, without replacement, from a given source array
  with a specified probability of an element's inclusion in the sample.
        
@@ -573,13 +646,13 @@ 
        sample
      - +

      • sample

        -
        public static char[] sample(char[] source,
+
        public static char[] sample​(char[] source,
                             double p)
        
 
        Generates a random sample, without replacement, from a given source array
  with a specified probability of an element's inclusion in the sample.
        
@@ -595,13 +668,13 @@ 
        sample
      - +

      • sample

        -
        public static double[] sample(double[] source,
+
        public static double[] sample​(double[] source,
                               double p)
        
 
        Generates a random sample, without replacement, from a given source array
  with a specified probability of an element's inclusion in the sample.
        
@@ -617,13 +690,13 @@ 
        sample
      - +

      • sample

        -
        public static float[] sample(float[] source,
+
        public static float[] sample​(float[] source,
                              double p)
        
 
        Generates a random sample, without replacement, from a given source array
  with a specified probability of an element's inclusion in the sample.
        
@@ -639,13 +712,13 @@ 
        sample
      - +

      • sample

        -
        public static int[] sample(int[] source,
+
        public static int[] sample​(int[] source,
                            double p)
        
 
        Generates a random sample, without replacement, from a given source array
  with a specified probability of an element's inclusion in the sample.
        
@@ -661,13 +734,13 @@ 
        sample
      - +

      • sample

        -
        public static long[] sample(long[] source,
+
        public static long[] sample​(long[] source,
                             double p)
        
 
        Generates a random sample, without replacement, from a given source array
  with a specified probability of an element's inclusion in the sample.
        
@@ -683,13 +756,13 @@ 
        sample
      - +

      • sample

        -
        public static short[] sample(short[] source,
+
        public static short[] sample​(short[] source,
                              double p)
        
 
        Generates a random sample, without replacement, from a given source array
  with a specified probability of an element's inclusion in the sample.
        
@@ -705,13 +778,13 @@ 
        sample
      - +

      • sample

        -
        public static char[] sample(String source,
+
        public static char[] sample​(String source,
                             double p)
        
 
        Generates a random sample, without replacement, from a given String
  with a specified probability of a character's inclusion in the sample.
        
@@ -727,15 +800,15 @@ 
        sample
      - + - +

      • sample

        -
        public static <T> T[] sample(T[] source,
+
        public static <T> T[] sample​(T[] source,
                              double p)
        
 
        Generates a random sample, without replacement, from a given source array
  with a specified probability of an element's inclusion in the sample.
        
@@ -753,13 +826,13 @@ 
        sample
      - + - + - + - + - + - + - + - + - + - + - + - + - +

      • sampleReservoir

        -
        public static short[] sampleReservoir(short[] source,
+
        public static short[] sampleReservoir​(short[] source,
                                       int k,
                                       short[] target)
        
 
        Generates a random sample of k elements, without replacement, from a
@@ -1154,18 +1227,18 @@ 
        sampleReservoir
        
 
        Returns:
        
 
        An array containing the random sample.
        
 
        Throws:
        
-
        IllegalArgumentException - if k > source.length
        
-
        NegativeArraySizeException - if k < 0
        
+
        IllegalArgumentException - if k > source.length
        
+
        NegativeArraySizeException - if k < 0
      - + - + - + - +

      • sampleReservoir

        -
        public static double[] sampleReservoir(double[] source,
+
        public static double[] sampleReservoir​(double[] source,
                                        int k,
                                        double[] target)
        
 
        Generates a random sample of k elements, without replacement, from a
@@ -1294,18 +1367,18 @@ 
        sampleReservoir
        
 
        Returns:
        
 
        An array containing the random sample.
        
 
        Throws:
        
-
        IllegalArgumentException - if k > source.length
        
-
        NegativeArraySizeException - if k < 0
        
+
        IllegalArgumentException - if k > source.length
        
+
        NegativeArraySizeException - if k < 0
      - +

      • sampleReservoir

        -
        public static float[] sampleReservoir(float[] source,
+
        public static float[] sampleReservoir​(float[] source,
                                       int k,
                                       float[] target)
        
 
        Generates a random sample of k elements, without replacement, from a
@@ -1329,20 +1402,20 @@ 
        sampleReservoir
        
 
        Returns:
        
 
        An array containing the random sample.
        
 
        Throws:
        
-
        IllegalArgumentException - if k > source.length
        
-
        NegativeArraySizeException - if k < 0
        
+
        IllegalArgumentException - if k > source.length
        
+
        NegativeArraySizeException - if k < 0
      - + - + - + - +

      • samplePool

        -
        public static long[] samplePool(long[] source,
+
        public static long[] samplePool​(long[] source,
                                 int k,
                                 long[] target)
        
 
        Generates a random sample of k elements, without replacement, from a
@@ -1423,7 +1496,7 @@ 
        samplePool
        
  likely, where n is the length of the source array.
         
  
        This implements the algorithm SELECT of S. Goodman and S. Hedetniemi, as described in:
  J Ernvall, O Nevalainen, "An Algorithm for Unbiased Random Sampling," The 
- Computer Journal, 25(1):45-47, 1982.
                
+ Computer Journal, 25(1):45-47, 1982.
                 
  
        The runtime is O(n)
  and it generates O(k) random numbers.  Thus, it is a better 
  choice than sampleReservoir when k < n-k.
@@ -1440,18 +1513,18 @@ 
        samplePool
        
 
        Returns:
        
 
        An array containing the random sample.
        
 
        Throws:
        
-
        IllegalArgumentException - if k > source.length
        
-
        NegativeArraySizeException - if k < 0
        
+
        IllegalArgumentException - if k > source.length
        
+
        NegativeArraySizeException - if k < 0
      - +

      • samplePool

        -
        public static short[] samplePool(short[] source,
+
        public static short[] samplePool​(short[] source,
                                  int k,
                                  short[] target)
        
 
        Generates a random sample of k elements, without replacement, from a
@@ -1459,7 +1532,7 @@ 
        samplePool
        
  likely, where n is the length of the source array.
        
  
        This implements the algorithm SELECT of S. Goodman and S. Hedetniemi, as described in:
  J Ernvall, O Nevalainen, "An Algorithm for Unbiased Random Sampling," The 
- Computer Journal, 25(1):45-47, 1982.
                
+ Computer Journal, 25(1):45-47, 1982.
                 
  
        The runtime is O(n)
  and it generates O(k) random numbers.  Thus, it is a better 
  choice than sampleReservoir when k < n-k.
@@ -1476,18 +1549,18 @@ 
        samplePool
        
 
        Returns:
        
 
        An array containing the random sample.
        
 
        Throws:
        
-
        IllegalArgumentException - if k > source.length
        
-
        NegativeArraySizeException - if k < 0
        
+
        IllegalArgumentException - if k > source.length
        
+
        NegativeArraySizeException - if k < 0
      - +

      • samplePool

        -
        public static byte[] samplePool(byte[] source,
+
        public static byte[] samplePool​(byte[] source,
                                 int k,
                                 byte[] target)
        
 
        Generates a random sample of k elements, without replacement, from a
@@ -1495,7 +1568,7 @@ 
        samplePool
        
  likely, where n is the length of the source array.
         
  
        This implements the algorithm SELECT of S. Goodman and S. Hedetniemi, as described in:
  J Ernvall, O Nevalainen, "An Algorithm for Unbiased Random Sampling," The 
- Computer Journal, 25(1):45-47, 1982.
                
+ Computer Journal, 25(1):45-47, 1982.
                 
  
        The runtime is O(n)
  and it generates O(k) random numbers.  Thus, it is a better 
  choice than sampleReservoir when k < n-k.
@@ -1512,18 +1585,18 @@ 
        samplePool
        
 
        Returns:
        
 
        An array containing the random sample.
        
 
        Throws:
        
-
        IllegalArgumentException - if k > source.length
        
-
        NegativeArraySizeException - if k < 0
        
+
        IllegalArgumentException - if k > source.length
        
+
        NegativeArraySizeException - if k < 0
      - +

      • samplePool

        -
        public static char[] samplePool(char[] source,
+
        public static char[] samplePool​(char[] source,
                                 int k,
                                 char[] target)
        
 
        Generates a random sample of k elements, without replacement, from a
@@ -1531,7 +1604,7 @@ 
        samplePool
        
  likely, where n is the length of the source array.
        
  
        This implements the algorithm SELECT of S. Goodman and S. Hedetniemi, as described in:
  J Ernvall, O Nevalainen, "An Algorithm for Unbiased Random Sampling," The 
- Computer Journal, 25(1):45-47, 1982.
                
+ Computer Journal, 25(1):45-47, 1982.
                 
  
        The runtime is O(n)
  and it generates O(k) random numbers.  Thus, it is a better 
  choice than sampleReservoir when k < n-k.
@@ -1548,18 +1621,18 @@ 
        samplePool
        
 
        Returns:
        
 
        An array containing the random sample.
        
 
        Throws:
        
-
        IllegalArgumentException - if k > source.length
        
-
        NegativeArraySizeException - if k < 0
        
+
        IllegalArgumentException - if k > source.length
        
+
        NegativeArraySizeException - if k < 0
      - +

      • samplePool

        -
        public static char[] samplePool(String source,
+
        public static char[] samplePool​(String source,
                                 int k,
                                 char[] target)
        
 
        Generates a random sample of k chars, without replacement, from a
@@ -1567,7 +1640,7 @@ 
        samplePool
        
  likely, where n is the length of the source String.
        
  
        This implements the algorithm SELECT of S. Goodman and S. Hedetniemi, as described in:
  J Ernvall, O Nevalainen, "An Algorithm for Unbiased Random Sampling," The 
- Computer Journal, 25(1):45-47, 1982.
                
+ Computer Journal, 25(1):45-47, 1982.
                 
  
        The runtime is O(n)
  and it generates O(k) random numbers.  Thus, it is a better 
  choice than sampleReservoir when k < n-k.
@@ -1584,18 +1657,18 @@ 
        samplePool
        
 
        Returns:
        
 
        An array containing the random sample.
        
 
        Throws:
        
-
        IllegalArgumentException - if k > source.length()
        
-
        NegativeArraySizeException - if k < 0
        
+
        IllegalArgumentException - if k > source.length()
        
+
        NegativeArraySizeException - if k < 0
      - +

      • samplePool

        -
        public static double[] samplePool(double[] source,
+
        public static double[] samplePool​(double[] source,
                                   int k,
                                   double[] target)
        
 
        Generates a random sample of k elements, without replacement, from a
@@ -1603,7 +1676,7 @@ 
        samplePool
        
  likely, where n is the length of the source array.
         
  
        This implements the algorithm SELECT of S. Goodman and S. Hedetniemi, as described in:
  J Ernvall, O Nevalainen, "An Algorithm for Unbiased Random Sampling," The 
- Computer Journal, 25(1):45-47, 1982.
                
+ Computer Journal, 25(1):45-47, 1982.
                 
  
        The runtime is O(n)
  and it generates O(k) random numbers.  Thus, it is a better 
  choice than sampleReservoir when k < n-k.
@@ -1620,18 +1693,18 @@ 
        samplePool
        
 
        Returns:
        
 
        An array containing the random sample.
        
 
        Throws:
        
-
        IllegalArgumentException - if k > source.length
        
-
        NegativeArraySizeException - if k < 0
        
+
        IllegalArgumentException - if k > source.length
        
+
        NegativeArraySizeException - if k < 0
      - +

      • samplePool

        -
        public static float[] samplePool(float[] source,
+
        public static float[] samplePool​(float[] source,
                                  int k,
                                  float[] target)
        
 
        Generates a random sample of k elements, without replacement, from a
@@ -1639,7 +1712,7 @@ 
        samplePool
        
  likely, where n is the length of the source array.
        
  
        This implements the algorithm SELECT of S. Goodman and S. Hedetniemi, as described in:
  J Ernvall, O Nevalainen, "An Algorithm for Unbiased Random Sampling," The 
- Computer Journal, 25(1):45-47, 1982.
                
+ Computer Journal, 25(1):45-47, 1982.
                 
  
        The runtime is O(n)
  and it generates O(k) random numbers.  Thus, it is a better 
  choice than sampleReservoir when k < n-k.
@@ -1656,20 +1729,20 @@ 
        samplePool
        
 
        Returns:
        
 
        An array containing the random sample.
        
 
        Throws:
        
-
        IllegalArgumentException - if k > source.length
        
-
        NegativeArraySizeException - if k < 0
        
+
        IllegalArgumentException - if k > source.length
        
+
        NegativeArraySizeException - if k < 0
      - + - +

      • samplePool

        -
        public static <T> T[] samplePool(T[] source,
+
        public static <T> T[] samplePool​(T[] source,
                                  int k,
                                  T[] target)
        
 
        Generates a random sample of k elements, without replacement, from a
@@ -1677,7 +1750,7 @@ 
        samplePool
        
  likely, where n is the length of the source array.
        
  
        This implements the algorithm SELECT of S. Goodman and S. Hedetniemi, as described in:
  J Ernvall, O Nevalainen, "An Algorithm for Unbiased Random Sampling," The 
- Computer Journal, 25(1):45-47, 1982.
                
+ Computer Journal, 25(1):45-47, 1982.
                 
  
        The runtime is O(n)
  and it generates O(k) random numbers.  Thus, it is a better 
  choice than sampleReservoir when k < n-k.
@@ -1696,18 +1769,18 @@ 
        samplePool
        
 
        Returns:
        
 
        An array containing the random sample.
        
 
        Throws:
        
-
        IllegalArgumentException - if k > source.length
        
-
        NegativeArraySizeException - if k < 0
        
+
        IllegalArgumentException - if k > source.length
        
+
        NegativeArraySizeException - if k < 0
      - + - + - +

      • sampleInsertion

        -
        public static short[] sampleInsertion(short[] source,
+
        public static short[] sampleInsertion​(short[] source,
                                       int k,
                                       short[] target)
        
 
        Generates a random sample of k elements, without replacement, from a
@@ -1797,18 +1870,18 @@ 
        sampleInsertion
        
 
        Returns:
        
 
        An array containing the random sample.
        
 
        Throws:
        
-
        IllegalArgumentException - if k > source.length
        
-
        NegativeArraySizeException - if k < 0
        
+
        IllegalArgumentException - if k > source.length
        
+
        NegativeArraySizeException - if k < 0
      - + - + - + - +

      • sampleInsertion

        -
        public static double[] sampleInsertion(double[] source,
+
        public static double[] sampleInsertion​(double[] source,
                                        int k,
                                        double[] target)
        
 
        Generates a random sample of k elements, without replacement, from a
@@ -1933,18 +2006,18 @@ 
        sampleInsertion
        
 
        Returns:
        
 
        An array containing the random sample.
        
 
        Throws:
        
-
        IllegalArgumentException - if k > source.length
        
-
        NegativeArraySizeException - if k < 0
        
+
        IllegalArgumentException - if k > source.length
        
+
        NegativeArraySizeException - if k < 0
      - +

      • sampleInsertion

        -
        public static float[] sampleInsertion(float[] source,
+
        public static float[] sampleInsertion​(float[] source,
                                       int k,
                                       float[] target)
        
 
        Generates a random sample of k elements, without replacement, from a
@@ -1967,20 +2040,20 @@ 
        sampleInsertion
        
 
        Returns:
        
 
        An array containing the random sample.
        
 
        Throws:
        
-
        IllegalArgumentException - if k > source.length
        
-
        NegativeArraySizeException - if k < 0
        
+
        IllegalArgumentException - if k > source.length
        
+
        NegativeArraySizeException - if k < 0
      - + - +
    +
    • +

    + diff --git a/docs/api/org/cicirello/sequences/distance/EditDistance.html b/docs/api/org/cicirello/sequences/distance/EditDistance.html index 6e28f0db..90fab37a 100644 --- a/docs/api/org/cicirello/sequences/distance/EditDistance.html +++ b/docs/api/org/cicirello/sequences/distance/EditDistance.html @@ -1,11 +1,21 @@ - + EditDistance (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.sequences.distance
    +
    Package org.cicirello.sequences.distance

    Class EditDistance

      -
    • java.lang.Object
      • +
    • java.lang.Object
      • org.cicirello.sequences.distance.EditDistance
        • @@ -107,17 +132,16 @@

        Class EditDistance

      • All Implemented Interfaces:
        -
        SequenceDistanceMeasurer, SequenceDistanceMeasurerDouble
        +
        SequenceDistanceMeasurer, SequenceDistanceMeasurerDouble
        Direct Known Subclasses:
        -
        LongestCommonSubsequenceDistance
        +
        LongestCommonSubsequenceDistance
        -
        public class EditDistance
-extends Object
-implements SequenceDistanceMeasurer, SequenceDistanceMeasurerDouble
        +extends Object +implements SequenceDistanceMeasurer, SequenceDistanceMeasurerDouble

        EditDistance is an implementation of Wagner and Fischer's dynamic programming algorithm for computing string edit distance.

        Edit distance is the minimum cost to transform one string (or sequence) into the other, which is the sum of the costs @@ -128,8 +152,8 @@

        Class EditDistance

        The edit distance is parameterized by costs for the edit operations. We provide two constructors which enable you to specify 3 costs, 1 for each type of edit operation. One of the constructors expects integer costs, and the other double valued costs. If you specify costs as integers, then all of the distance and distancef methods from the - SequenceDistanceMeasurer - and SequenceDistanceMeasurerDouble + SequenceDistanceMeasurer + and SequenceDistanceMeasurerDouble interfaces are available. If costs are specified as doubles, then only the distancef methods will function, while the distance methods will throw exceptions.

        @@ -138,13 +162,13 @@

        Class EditDistance

        the other of the sequences, or can be of different lengths.

        Another class (with same name but in different package) is available if you need to compute distance specifically between permutations, - rather than general sequences. That class is the EditDistance class which computes distance between permutations + rather than general sequences. That class is the EditDistance class which computes distance between permutations of the integers from 0 to N-1.

        Runtime: O(n*m), where n and m are the lengths of the two sequences (i.e., Strings or arrays).

        Wagner and Fischer's String Edit Distance was introduced in:
        - R. A. Wagner and M. J. Fischer, "The string-to-string correction problem," Journal of the ACM, vol. 21, no. 1, pp. 168–173, January 1974.

        + R. A. Wagner and M. J. Fischer, "The string-to-string correction problem," Journal of the ACM, vol. 21, no. 1, pp. 168–173, January 1974.

    Since:
    1.1
    @@ -156,209 +180,239 @@

    Class EditDistance

    • +
        -
      • +

      • Constructor Summary

        - +
        - + + - + - +
        Constructors 
        Constructor and DescriptionConstructorDescription
        EditDistance(double insertCost, +EditDistance​(double insertCost, double deleteCost, - double changeCost) + double changeCost)
        Constructs an edit distance measure with the specified edit operation costs.
        EditDistance(int insertCost, +EditDistance​(int insertCost, int deleteCost, - int changeCost) + int changeCost)
        Constructs an edit distance measure with the specified edit operation costs.
      +
      +
        -
      • +

      • Method Summary

        - +
        - + + - + - + - + - + - + - + - - + + - + - + - + - - + + - + - + - + - + - + - + - - + + - + - + - + - - + +
        All Methods Instance Methods Concrete Methods 
        Modifier and TypeMethod and DescriptionMethodDescription
        intdistance(boolean[] s1, - boolean[] s2) +distance​(boolean[] s1, + boolean[] s2)
        Measures the distance between two arrays.
        intdistance(byte[] s1, - byte[] s2) +distance​(byte[] s1, + byte[] s2)
        Measures the distance between two arrays.
        intdistance(char[] s1, - char[] s2) +distance​(char[] s1, + char[] s2)
        Measures the distance between two arrays.
        intdistance(double[] s1, - double[] s2) +distance​(double[] s1, + double[] s2)
        Measures the distance between two arrays.
        intdistance(float[] s1, - float[] s2) +distance​(float[] s1, + float[] s2)
        Measures the distance between two arrays.
        intdistance(int[] s1, - int[] s2) +distance​(int[] s1, + int[] s2)
        Measures the distance between two arrays.
        <T> intdistance(List<T> s1, - List<T> s2) -
        Measures the distance between two lists of objects.
        +        		intdistance​(long[] s1, + long[] s2) +
        Measures the distance between two arrays.
        intdistance(long[] s1, - long[] s2) +distance​(short[] s1, + short[] s2)
        Measures the distance between two arrays.
        intdistance(Object[] s1, - Object[] s2) +distance​(Object[] s1, + Object[] s2)
        Measures the distance between two arrays of objects.
        intdistance(short[] s1, - short[] s2) -
        Measures the distance between two arrays.
        +        		distance​(String s1, + String s2) +
        Measures the distance between two Strings.
        intdistance(String s1, - String s2) -
        Measures the distance between two Strings.
        +        		<T> intdistance​(List<T> s1, + List<T> s2) +
        Measures the distance between two lists of objects.
        doubledistancef(boolean[] s1, - boolean[] s2) +distancef​(boolean[] s1, + boolean[] s2)
        Measures the distance between two arrays.
        doubledistancef(byte[] s1, - byte[] s2) +distancef​(byte[] s1, + byte[] s2)
        Measures the distance between two arrays.
        doubledistancef(char[] s1, - char[] s2) +distancef​(char[] s1, + char[] s2)
        Measures the distance between two arrays.
        doubledistancef(double[] s1, - double[] s2) +distancef​(double[] s1, + double[] s2)
        Measures the distance between two arrays.
        doubledistancef(float[] s1, - float[] s2) +distancef​(float[] s1, + float[] s2)
        Measures the distance between two arrays.
        doubledistancef(int[] s1, - int[] s2) +distancef​(int[] s1, + int[] s2)
        Measures the distance between two arrays.
        <T> doubledistancef(List<T> s1, - List<T> s2) -
        Measures the distance between two lists of objects.
        +        		doubledistancef​(long[] s1, + long[] s2) +
        Measures the distance between two arrays.
        doubledistancef(long[] s1, - long[] s2) +distancef​(short[] s1, + short[] s2)
        Measures the distance between two arrays.
        doubledistancef(Object[] s1, - Object[] s2) +distancef​(Object[] s1, + Object[] s2)
        Measures the distance between two arrays of objects.
        doubledistancef(short[] s1, - short[] s2) -
        Measures the distance between two arrays.
        +        		distancef​(String s1, + String s2) +
        Measures the distance between two Strings.
        doubledistancef(String s1, - String s2) -
        Measures the distance between two Strings.
        +        		<T> doubledistancef​(List<T> s1, + List<T> s2) +
        Measures the distance between two lists of objects.
      +
    @@ -366,18 +420,19 @@

    Methods inherited from class java.lang.
  • +
      -
    • +

    • Constructor Detail

      - +

      • EditDistance

        -
        public EditDistance(double insertCost,
+
        public EditDistance​(double insertCost,
                     double deleteCost,
                     double changeCost)
        
 
        Constructs an edit distance measure with the specified edit operation costs.  With costs as doubles, all of the distancef methods that
@@ -393,13 +448,13 @@ 
        EditDistance

    • - +

    • EditDistance

      -
      public EditDistance(int insertCost,
+
      public EditDistance​(int insertCost,
                     int deleteCost,
                     int changeCost)
      
 
      Constructs an edit distance measure with the specified edit operation costs.  With integer costs, all of the distance and distancef methods
@@ -414,248 +469,250 @@ 
      EditDistance
    + +
    +
    +
    + diff --git a/docs/api/org/cicirello/sequences/distance/ExactMatchDistance.html b/docs/api/org/cicirello/sequences/distance/ExactMatchDistance.html index b6586e17..6020671e 100644 --- a/docs/api/org/cicirello/sequences/distance/ExactMatchDistance.html +++ b/docs/api/org/cicirello/sequences/distance/ExactMatchDistance.html @@ -1,11 +1,21 @@ - + ExactMatchDistance (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.sequences.distance
    +
    Package org.cicirello.sequences.distance

    Class ExactMatchDistance

      -
    • java.lang.Object
      • +
    • java.lang.Object
      • org.cicirello.sequences.distance.ExactMatchDistance
        • @@ -107,12 +132,11 @@

        Class ExactMatchDistance

      • All Implemented Interfaces:
        -
        SequenceDistanceMeasurer, SequenceDistanceMeasurerDouble
        +
        SequenceDistanceMeasurer, SequenceDistanceMeasurerDouble
        -
        public final class ExactMatchDistance
-extends Object
        +extends Object

        ExactMatch distance (or Hamming Distance) of a pair of non-binary strings (or more generally sequences) is the number of sequence (or string) positions where the two sequences differ. This class supports comparison of Java String objects, @@ -127,10 +151,10 @@

        Class ExactMatchDistance

        Runtime: O(n), where n is the length of the shorter of the two sequences.

        If your sequences are guaranteed not to have duplicates, and to contain the same set of elements, then consider instead using the - ExactMatchDistance class, which assumes permutations of the integers from 0 to N-1.

        + ExactMatchDistance class, which assumes permutations of the integers from 0 to N-1.

        Exact match distance was introduced specifically for permutations in:
        - S. Ronald, "More distance functions for order-based encodings," in Proc. IEEE CEC. IEEE Press, 1998, pp. 558–563.

        + S. Ronald, "More distance functions for order-based encodings," in Proc. IEEE CEC. IEEE Press, 1998, pp. 558–563.

    Since:
    1.1
    @@ -142,200 +166,229 @@

    Class ExactMatchDistance

    • +
        -
      • +

      • Constructor Summary

        - +
        - + + - +
        Constructors 
        Constructor and DescriptionConstructorDescription
        ExactMatchDistance() +ExactMatchDistance()
        Constructs the distance measurer as specified in the class documentation.
      +
      +
        -
      • +

      • Method Summary

        - +
        - + + - + - + - + - + - + - + - - + + - + - + - + - - + + - + - + - + - + - + - + - - + + - + - + - + - - + +
        All Methods Instance Methods Concrete Methods 
        Modifier and TypeMethod and DescriptionMethodDescription
        intdistance(boolean[] s1, - boolean[] s2) +distance​(boolean[] s1, + boolean[] s2)
        Measures the distance between two arrays.
        intdistance(byte[] s1, - byte[] s2) +distance​(byte[] s1, + byte[] s2)
        Measures the distance between two arrays.
        intdistance(char[] s1, - char[] s2) +distance​(char[] s1, + char[] s2)
        Measures the distance between two arrays.
        intdistance(double[] s1, - double[] s2) +distance​(double[] s1, + double[] s2)
        Measures the distance between two arrays.
        intdistance(float[] s1, - float[] s2) +distance​(float[] s1, + float[] s2)
        Measures the distance between two arrays.
        intdistance(int[] s1, - int[] s2) +distance​(int[] s1, + int[] s2)
        Measures the distance between two arrays.
        <T> intdistance(List<T> s1, - List<T> s2) -
        Measures the distance between two lists of objects.
        +        		intdistance​(long[] s1, + long[] s2) +
        Measures the distance between two arrays.
        intdistance(long[] s1, - long[] s2) +distance​(short[] s1, + short[] s2)
        Measures the distance between two arrays.
        intdistance(Object[] s1, - Object[] s2) +distance​(Object[] s1, + Object[] s2)
        Measures the distance between two arrays of objects.
        intdistance(short[] s1, - short[] s2) -
        Measures the distance between two arrays.
        +        		distance​(String s1, + String s2) +
        Measures the distance between two Strings.
        intdistance(String s1, - String s2) -
        Measures the distance between two Strings.
        +        		<T> intdistance​(List<T> s1, + List<T> s2) +
        Measures the distance between two lists of objects.
        doubledistancef(boolean[] s1, - boolean[] s2) +distancef​(boolean[] s1, + boolean[] s2)
        Measures the distance between two arrays.
        doubledistancef(byte[] s1, - byte[] s2) +distancef​(byte[] s1, + byte[] s2)
        Measures the distance between two arrays.
        doubledistancef(char[] s1, - char[] s2) +distancef​(char[] s1, + char[] s2)
        Measures the distance between two arrays.
        doubledistancef(double[] s1, - double[] s2) +distancef​(double[] s1, + double[] s2)
        Measures the distance between two arrays.
        doubledistancef(float[] s1, - float[] s2) +distancef​(float[] s1, + float[] s2)
        Measures the distance between two arrays.
        doubledistancef(int[] s1, - int[] s2) +distancef​(int[] s1, + int[] s2)
        Measures the distance between two arrays.
        <T> doubledistancef(List<T> s1, - List<T> s2) -
        Measures the distance between two lists of objects.
        +        		doubledistancef​(long[] s1, + long[] s2) +
        Measures the distance between two arrays.
        doubledistancef(long[] s1, - long[] s2) +distancef​(short[] s1, + short[] s2)
        Measures the distance between two arrays.
        doubledistancef(Object[] s1, - Object[] s2) +distancef​(Object[] s1, + Object[] s2)
        Measures the distance between two arrays of objects.
        doubledistancef(short[] s1, - short[] s2) -
        Measures the distance between two arrays.
        +        		distancef​(String s1, + String s2) +
        Measures the distance between two Strings.
        doubledistancef(String s1, - String s2) -
        Measures the distance between two Strings.
        +        		<T> doubledistancef​(List<T> s1, + List<T> s2) +
        Measures the distance between two lists of objects.
      +
    @@ -343,12 +396,13 @@

    Methods inherited from class java.lang.
  • +
      -
    • +

    • Constructor Detail

      - +
        @@ -360,19 +414,21 @@

        ExactMatchDistance

    +
    +
      -
    • +

    • Method Detail

      - +

      • distance

        -
        public int distance(int[] s1,
+
        public int distance​(int[] s1,
                     int[] s2)
        
 
        Measures the distance between two arrays.
        
 
        
@@ -384,13 +440,13 @@ 
        distance
      - +

      • distance

        -
        public int distance(long[] s1,
+
        public int distance​(long[] s1,
                     long[] s2)
        
 
        Measures the distance between two arrays.
        
 
        
@@ -402,13 +458,13 @@ 
        distance
      - +

      • distance

        -
        public int distance(short[] s1,
+
        public int distance​(short[] s1,
                     short[] s2)
        
 
        Measures the distance between two arrays.
        
 
        
@@ -420,13 +476,13 @@ 
        distance
      - +

      • distance

        -
        public int distance(byte[] s1,
+
        public int distance​(byte[] s1,
                     byte[] s2)
        
 
        Measures the distance between two arrays.
        
 
        
@@ -438,13 +494,13 @@ 
        distance
      - +

      • distance

        -
        public int distance(char[] s1,
+
        public int distance​(char[] s1,
                     char[] s2)
        
 
        Measures the distance between two arrays.
        
 
        
@@ -456,13 +512,13 @@ 
        distance
      - +

      • distance

        -
        public int distance(boolean[] s1,
+
        public int distance​(boolean[] s1,
                     boolean[] s2)
        
 
        Measures the distance between two arrays.
        
 
        
@@ -474,13 +530,13 @@ 
        distance
      - +

      • distance

        -
        public int distance(double[] s1,
+
        public int distance​(double[] s1,
                     double[] s2)
        
 
        Measures the distance between two arrays.
        
 
        
@@ -492,13 +548,13 @@ 
        distance
      - +

      • distance

        -
        public int distance(float[] s1,
+
        public int distance​(float[] s1,
                     float[] s2)
        
 
        Measures the distance between two arrays.
        
 
        
@@ -510,14 +566,14 @@ 
        distance
      - +

      • distance

        -
        public int distance(String s1,
-                    String s2)
        +
        public int distance​(String s1,
+                    String s2)
        Measures the distance between two Strings.
        Parameters:
        @@ -528,14 +584,14 @@

        distance

      - +

      • distance

        -
        public int distance(Object[] s1,
-                    Object[] s2)
        +
        public int distance​(Object[] s1,
+                    Object[] s2)
        Measures the distance between two arrays of objects. The objects in the arrays must be of a class that has overridden the Object.equals method.
        @@ -548,14 +604,14 @@

        distance

    • - +

    • distance

      -
      public <T> int distance(List<T> s1,
-                        List<T> s2)
      +
      public <T> int distance​(List<T> s1,
+                        List<T> s2)
      Measures the distance between two lists of objects. The objects in the lists must be of a class that has overridden the Object.equals method.
      @@ -570,18 +626,18 @@

      distance

    - + - + - + - + - + - + - + - + - + - + - +

    • distancef

      -
      public final <T> double distancef(List<T> s1,
-                                  List<T> s2)
      +
      public final <T> double distancef​(List<T> s1,
+                                  List<T> s2)
      Measures the distance between two lists of objects. The objects in the lists must be of a class that has overridden the Object.equals method.
      Specified by:
      -
      distancef in interface SequenceDistanceMeasurerDouble
      +
      distancef in interface SequenceDistanceMeasurerDouble
      Type Parameters:
      T - Type of List elements.
      Parameters:
      @@ -798,21 +854,25 @@

      distancef

    + +
    + diff --git a/docs/api/org/cicirello/sequences/distance/KendallTauSequenceDistance.html b/docs/api/org/cicirello/sequences/distance/KendallTauSequenceDistance.html index 2f2c1928..bc6be826 100644 --- a/docs/api/org/cicirello/sequences/distance/KendallTauSequenceDistance.html +++ b/docs/api/org/cicirello/sequences/distance/KendallTauSequenceDistance.html @@ -1,11 +1,21 @@ - + KendallTauSequenceDistance (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.sequences.distance
    +
    Package org.cicirello.sequences.distance

    Class KendallTauSequenceDistance

      -
    • java.lang.Object
      • +
    • java.lang.Object
      • org.cicirello.sequences.distance.KendallTauSequenceDistance
        • @@ -107,12 +132,11 @@

        Class KendallTauSeque
      • All Implemented Interfaces:
        -
        SequenceDistanceMeasurer, SequenceDistanceMeasurerDouble
        +
        SequenceDistanceMeasurer, SequenceDistanceMeasurerDouble
        -
        public final class KendallTauSequenceDistance
-extends Object
        +extends Object

        Kendall Tau Sequence Distance is the minimum number of adjacent swaps necessary to transform one sequence into the other. It is an edit distance with adjacent swap as the edit operation. It is applicable only @@ -138,9 +162,9 @@

        Class KendallTauSeque

        If you are computing the distance between two arrays of Objects, the two algorithms have the following restrictions. The default algorithm requires the objects to be of a class that - overrides the hashCode and equals methods of the Object class. The alternate - algorithm requires Objects to be of a class that implements the Comparable - interface, and overrides the equals method of the Object class. The runtime + overrides the hashCode and equals methods of the Object class. The alternate + algorithm requires Objects to be of a class that implements the Comparable + interface, and overrides the equals method of the Object class. The runtime for computing distance between arrays of objects via the default algorithm is O(h(m) n + n lg n), where n is the array length, m is the size of the objects in the array, and h(m) is the runtime to compute a hash of an object of size m. The runtime for the alternate algorithm for @@ -154,7 +178,7 @@

        Class KendallTauSeque

        If your sequences are guaranteed not to have duplicates, and to contain the same set of elements, then consider instead using the - KendallTauDistance class, which + KendallTauDistance class, which assumes permutations of the integers from 0 to N-1.

        This distance metric, and both algorithms, is first described in the paper:
        @@ -172,205 +196,235 @@

        Class KendallTauSeque
        • +
          +
          +
            -
          • +

          • Method Summary

            - +
            - + + - + - + - + - + - + - + - - + + - + - + - + - - + + - + - + - + - + - + - + - - + + - + - + - + - - + +
            All Methods Instance Methods Concrete Methods 
            Modifier and TypeMethod and DescriptionMethodDescription
            intdistance(boolean[] s1, - boolean[] s2) +distance​(boolean[] s1, + boolean[] s2)
            Measures the distance between two arrays.
            intdistance(byte[] s1, - byte[] s2) +distance​(byte[] s1, + byte[] s2)
            Measures the distance between two arrays.
            intdistance(char[] s1, - char[] s2) +distance​(char[] s1, + char[] s2)
            Measures the distance between two arrays.
            intdistance(double[] s1, - double[] s2) +distance​(double[] s1, + double[] s2)
            Measures the distance between two arrays.
            intdistance(float[] s1, - float[] s2) +distance​(float[] s1, + float[] s2)
            Measures the distance between two arrays.
            intdistance(int[] s1, - int[] s2) +distance​(int[] s1, + int[] s2)
            Measures the distance between two arrays.
            <T> intdistance(List<T> s1, - List<T> s2) -
            Measures the distance between two lists of objects.
            +            		intdistance​(long[] s1, + long[] s2) +
            Measures the distance between two arrays.
            intdistance(long[] s1, - long[] s2) +distance​(short[] s1, + short[] s2)
            Measures the distance between two arrays.
            intdistance(Object[] s1, - Object[] s2) +distance​(Object[] s1, + Object[] s2)
            Measures the distance between two arrays of objects.
            intdistance(short[] s1, - short[] s2) -
            Measures the distance between two arrays.
            +            		distance​(String s1, + String s2) +
            Measures the distance between two Strings.
            intdistance(String s1, - String s2) -
            Measures the distance between two Strings.
            +            		<T> intdistance​(List<T> s1, + List<T> s2) +
            Measures the distance between two lists of objects.
            doubledistancef(boolean[] s1, - boolean[] s2) +distancef​(boolean[] s1, + boolean[] s2)
            Measures the distance between two arrays.
            doubledistancef(byte[] s1, - byte[] s2) +distancef​(byte[] s1, + byte[] s2)
            Measures the distance between two arrays.
            doubledistancef(char[] s1, - char[] s2) +distancef​(char[] s1, + char[] s2)
            Measures the distance between two arrays.
            doubledistancef(double[] s1, - double[] s2) +distancef​(double[] s1, + double[] s2)
            Measures the distance between two arrays.
            doubledistancef(float[] s1, - float[] s2) +distancef​(float[] s1, + float[] s2)
            Measures the distance between two arrays.
            doubledistancef(int[] s1, - int[] s2) +distancef​(int[] s1, + int[] s2)
            Measures the distance between two arrays.
            <T> doubledistancef(List<T> s1, - List<T> s2) -
            Measures the distance between two lists of objects.
            +            		doubledistancef​(long[] s1, + long[] s2) +
            Measures the distance between two arrays.
            doubledistancef(long[] s1, - long[] s2) +distancef​(short[] s1, + short[] s2)
            Measures the distance between two arrays.
            doubledistancef(Object[] s1, - Object[] s2) +distancef​(Object[] s1, + Object[] s2)
            Measures the distance between two arrays of objects.
            doubledistancef(short[] s1, - short[] s2) -
            Measures the distance between two arrays.
            +            		distancef​(String s1, + String s2) +
            Measures the distance between two Strings.
            doubledistancef(String s1, - String s2) -
            Measures the distance between two Strings.
            +            		<T> doubledistancef​(List<T> s1, + List<T> s2) +
            Measures the distance between two lists of objects.
          +

        @@ -378,12 +432,13 @@

        Methods inherited from class java.lang.
      • +
          -
        • +

        • Constructor Detail

          - +
            @@ -393,27 +448,27 @@

            KendallTauSequenceDistance

            The KendallTauDistance class provides two algorithms. The default algorithm requires sequence elements to either be primitives (e.g., byte, short, int, long, char, float, double, boolean) or to be objects of a class that overrides - the hashCode and equals methods of the Object class.
            + the hashCode and equals methods of the Object class.

    - +

    • KendallTauSequenceDistance

      -
      public KendallTauSequenceDistance(boolean useAlternateAlg)
      +
      public KendallTauSequenceDistance​(boolean useAlternateAlg)

      The KendallTauDistance class provides two algorithms. This constructor enables you to select which algorithm to use.

      The default algorithm requires sequence elements to either be primitives (e.g., byte, short, int, long, char, float, double, boolean) or to be objects of a class that overrides - the hashCode and equals methods of the Object class.

      + the hashCode and equals methods of the Object class.

      The alternate algorithm requires sequence elements to either be primitives (e.g., byte, short, int, long, char, float, double, boolean) or to be objects of a class that implements - the Comparable interface, and overrides the equals method - of the Object class.

      + the Comparable interface, and overrides the equals method + of the Object class.

      Under most conditions, the preferred algorithm is the default. The alternate algorithm may be desirable if the cost to compare objects is significantly less than the @@ -429,19 +484,21 @@

      KendallTauSequenceDistance

    + +
      -
    • +

    • Method Detail

      - +

      • distance

        -
        public int distance(int[] s1,
+
        public int distance​(int[] s1,
                     int[] s2)
        
 
        Measures the distance between two arrays.
        
 
        
@@ -451,17 +508,17 @@ 
        distance
        
 
        Returns:
        
 
        distance between s1 and s2
        
 
        Throws:
        
-
        IllegalArgumentException - if sequences are of different lengths, or contain different elements
        
+
        IllegalArgumentException - if sequences are of different lengths, or contain different elements
      - +

      • distance

        -
        public int distance(long[] s1,
+
        public int distance​(long[] s1,
                     long[] s2)
        
 
        Measures the distance between two arrays.
        
 
        
@@ -471,17 +528,17 @@ 
        distance
        
 
        Returns:
        
 
        distance between s1 and s2
        
 
        Throws:
        
-
        IllegalArgumentException - if sequences are of different lengths, or contain different elements
        
+
        IllegalArgumentException - if sequences are of different lengths, or contain different elements
      - +

      • distance

        -
        public int distance(short[] s1,
+
        public int distance​(short[] s1,
                     short[] s2)
        
 
        Measures the distance between two arrays.
        
 
        
@@ -491,17 +548,17 @@ 
        distance
        
 
        Returns:
        
 
        distance between s1 and s2
        
 
        Throws:
        
-
        IllegalArgumentException - if sequences are of different lengths, or contain different elements
        
+
        IllegalArgumentException - if sequences are of different lengths, or contain different elements
      - +

      • distance

        -
        public int distance(byte[] s1,
+
        public int distance​(byte[] s1,
                     byte[] s2)
        
 
        Measures the distance between two arrays.
        
 
        
@@ -511,17 +568,17 @@ 
        distance
        
 
        Returns:
        
 
        distance between s1 and s2
        
 
        Throws:
        
-
        IllegalArgumentException - if sequences are of different lengths, or contain different elements
        
+
        IllegalArgumentException - if sequences are of different lengths, or contain different elements
      - +

      • distance

        -
        public int distance(char[] s1,
+
        public int distance​(char[] s1,
                     char[] s2)
        
 
        Measures the distance between two arrays.
        
 
        
@@ -531,18 +588,18 @@ 
        distance
        
 
        Returns:
        
 
        distance between s1 and s2
        
 
        Throws:
        
-
        IllegalArgumentException - if sequences are of different lengths, or contain different elements
        
+
        IllegalArgumentException - if sequences are of different lengths, or contain different elements
      - +

      • distance

        -
        public int distance(String s1,
-                    String s2)
        +
        public int distance​(String s1,
+                    String s2)
        Measures the distance between two Strings.
        Parameters:
        @@ -551,17 +608,17 @@

        distance

        Returns:
        distance between s1 and s2
        Throws:
        -
        IllegalArgumentException - if sequences are of different lengths, or contain different elements
        +
        IllegalArgumentException - if sequences are of different lengths, or contain different elements
      - +

      • distance

        -
        public int distance(float[] s1,
+
        public int distance​(float[] s1,
                     float[] s2)
        
 
        Measures the distance between two arrays.
        
 
        
@@ -571,17 +628,17 @@ 
        distance
        
 
        Returns:
        
 
        distance between s1 and s2
        
 
        Throws:
        
-
        IllegalArgumentException - if sequences are of different lengths, or contain different elements
        
+
        IllegalArgumentException - if sequences are of different lengths, or contain different elements
      - +

      • distance

        -
        public int distance(double[] s1,
+
        public int distance​(double[] s1,
                     double[] s2)
        
 
        Measures the distance between two arrays.
        
 
        
@@ -591,17 +648,17 @@ 
        distance
        
 
        Returns:
        
 
        distance between s1 and s2
        
 
        Throws:
        
-
        IllegalArgumentException - if sequences are of different lengths, or contain different elements
        
+
        IllegalArgumentException - if sequences are of different lengths, or contain different elements
      - +

      • distance

        -
        public int distance(boolean[] s1,
+
        public int distance​(boolean[] s1,
                     boolean[] s2)
        
 
        Measures the distance between two arrays.
        
 
        
@@ -611,18 +668,18 @@ 
        distance
        
 
        Returns:
        
 
        distance between s1 and s2
        
 
        Throws:
        
-
        IllegalArgumentException - if sequences are of different lengths, or contain different elements
        
+
        IllegalArgumentException - if sequences are of different lengths, or contain different elements
      - +

      • distance

        -
        public int distance(Object[] s1,
-                    Object[] s2)
        +
        public int distance​(Object[] s1,
+                    Object[] s2)
        Measures the distance between two arrays of objects. The objects in the arrays must be of a class that has overridden the Object.equals method. @@ -637,18 +694,18 @@

        distance

        Returns:
        distance between s1 and s2
        Throws:
        -
        IllegalArgumentException - if sequences are of different lengths, or contain different elements
        +
        IllegalArgumentException - if sequences are of different lengths, or contain different elements
      - +

      • distance

        -
        public <T> int distance(List<T> s1,
-                        List<T> s2)
        +
        public <T> int distance​(List<T> s1,
+                        List<T> s2)
        Measures the distance between two lists of objects. The objects in the lists must be of a class that has overridden the Object.equals method.
        @@ -663,18 +720,18 @@

        distance

      - + - + - + - + - + - + - + - + - + - + - +

      • distancef

        -
        public final <T> double distancef(List<T> s1,
-                                  List<T> s2)
        +
        public final <T> double distancef​(List<T> s1,
+                                  List<T> s2)
        Measures the distance between two lists of objects. The objects in the lists must be of a class that has overridden the Object.equals method.
        Specified by:
        -
        distancef in interface SequenceDistanceMeasurerDouble
        +
        distancef in interface SequenceDistanceMeasurerDouble
        Type Parameters:
        T - Type of List elements.
        Parameters:
        @@ -891,21 +948,25 @@

        distancef

    +
    +
    + diff --git a/docs/api/org/cicirello/sequences/distance/LongestCommonSubsequenceDistance.html b/docs/api/org/cicirello/sequences/distance/LongestCommonSubsequenceDistance.html index 39215b23..ab97d46b 100644 --- a/docs/api/org/cicirello/sequences/distance/LongestCommonSubsequenceDistance.html +++ b/docs/api/org/cicirello/sequences/distance/LongestCommonSubsequenceDistance.html @@ -1,11 +1,21 @@ - + LongestCommonSubsequenceDistance (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.sequences.distance
    +
    Package org.cicirello.sequences.distance

    Class LongestCommonSubsequenceDistance

      -
    • java.lang.Object
      • +
    • java.lang.Object
      • -
      • org.cicirello.sequences.distance.EditDistance
        • +
      • org.cicirello.sequences.distance.EditDistance
        • org.cicirello.sequences.distance.LongestCommonSubsequenceDistance
          • @@ -106,12 +131,11 @@

          Class LongestCo
        • All Implemented Interfaces:
          -
          SequenceDistanceMeasurer, SequenceDistanceMeasurerDouble
          +
          SequenceDistanceMeasurer, SequenceDistanceMeasurerDouble
          -
          public final class LongestCommonSubsequenceDistance
-extends EditDistance
          +extends EditDistance

          LongestCommonSubsequenceDistance is a form of EditDistance, where the edit operations are limited to deletions and insertions (i.e., no replacements or changes), and where the cost of an edit operation is simply 1. It is the minimum number of element insertions and deletions necessary to transform one sequence into the other. @@ -125,7 +149,7 @@

          Class LongestCo

          Runtime: O(n*m), where n and m are the lengths of the two sequences (i.e., Strings or arrays).

          If you need to compute this distance for permutations (i.e., same length, same set of elements, unique elements), then it - is recommended to instead use the ReinsertionDistance class. That class exploits the + is recommended to instead use the ReinsertionDistance class. That class exploits the common length, common set of elements, and unique elements properties of permutations to more efficiently (in O(n lg n) time) compute the longest common subpermutation (i.e., that class does not delegate the work to the edit distance algorithm). However, the result of ReinsertionDistance is half of what LongestCommonSunsequenceDistance would compute. This is because for permutations the elements that would be inserted are exactly the same as those that would be @@ -133,7 +157,7 @@

          Class LongestCo (i.e., a deletion is only half the operation, and the insertion is the other half of the operation).

          Wagner and Fischer's String Edit Distance was introduced in:
          - R. A. Wagner and M. J. Fischer, "The string-to-string correction problem," Journal of the ACM, vol. 21, no. 1, pp. 168–173, January 1974.

          + R. A. Wagner and M. J. Fischer, "The string-to-string correction problem," Journal of the ACM, vol. 21, no. 1, pp. 168–173, January 1974.

    Since:
    1.1
    @@ -145,46 +169,52 @@

    Class LongestCo @@ -192,12 +222,13 @@

    Methods inherited from class java.lang.
  • +
      -
    • +

    • Constructor Detail

      - +
        @@ -209,21 +240,25 @@

        LongestCommonSubsequenceDistance

    +
    • +

    + diff --git a/docs/api/org/cicirello/sequences/distance/SequenceDistanceMeasurer.html b/docs/api/org/cicirello/sequences/distance/SequenceDistanceMeasurer.html index d8965029..70b60339 100644 --- a/docs/api/org/cicirello/sequences/distance/SequenceDistanceMeasurer.html +++ b/docs/api/org/cicirello/sequences/distance/SequenceDistanceMeasurer.html @@ -1,11 +1,21 @@ - + SequenceDistanceMeasurer (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.sequences.distance
    +
    Package org.cicirello.sequences.distance

    Interface SequenceDistanceMeasurer

    @@ -99,10 +124,9 @@

    Interface SequenceD
  • All Known Implementing Classes:
    -
    EditDistance, ExactMatchDistance, KendallTauSequenceDistance, LongestCommonSubsequenceDistance
    +
    EditDistance, ExactMatchDistance, KendallTauSequenceDistance, LongestCommonSubsequenceDistance
    -
    public interface SequenceDistanceMeasurer

    Implement this interface, SequenceDistanceMeasurer, to define a distance metric for sequences. A sequence may have duplicate elements, unlike a Permutation which must have unique elements. Some SequenceDistanceMeasurers may require the pair of sequences to be the same length, while @@ -110,7 +134,7 @@

    Interface SequenceD others do not have that requirement. Implementations of this interface compute distances that are integer valued.

    If your sequences are guaranteed not to contain duplicates, and the pair is guaranteed to contain the same set of elements, and are of the same length, - then consider instead using the classes that implement the PermutationDistanceMeasurer + then consider instead using the classes that implement the PermutationDistanceMeasurer interface. Those classes are specifically for distance between permutations of the integers from 0 to N-1.

    Since:
    @@ -123,97 +147,111 @@

    Interface SequenceD
    • +
        -
      • +

      • Method Summary

        - +
        - + + - + - + - + - + - + - + - - + + - + - + - + - - + +
        All Methods Instance Methods Abstract Methods 
        Modifier and TypeMethod and DescriptionMethodDescription
        intdistance(boolean[] s1, - boolean[] s2) +distance​(boolean[] s1, + boolean[] s2)
        Measures the distance between two arrays.
        intdistance(byte[] s1, - byte[] s2) +distance​(byte[] s1, + byte[] s2)
        Measures the distance between two arrays.
        intdistance(char[] s1, - char[] s2) +distance​(char[] s1, + char[] s2)
        Measures the distance between two arrays.
        intdistance(double[] s1, - double[] s2) +distance​(double[] s1, + double[] s2)
        Measures the distance between two arrays.
        intdistance(float[] s1, - float[] s2) +distance​(float[] s1, + float[] s2)
        Measures the distance between two arrays.
        intdistance(int[] s1, - int[] s2) +distance​(int[] s1, + int[] s2)
        Measures the distance between two arrays.
        <T> intdistance(List<T> s1, - List<T> s2) -
        Measures the distance between two lists of objects.
        +        		intdistance​(long[] s1, + long[] s2) +
        Measures the distance between two arrays.
        intdistance(long[] s1, - long[] s2) +distance​(short[] s1, + short[] s2)
        Measures the distance between two arrays.
        intdistance(Object[] s1, - Object[] s2) +distance​(Object[] s1, + Object[] s2)
        Measures the distance between two arrays of objects.
        intdistance(short[] s1, - short[] s2) -
        Measures the distance between two arrays.
        +        		distance​(String s1, + String s2) +
        Measures the distance between two Strings.
        intdistance(String s1, - String s2) -
        Measures the distance between two Strings.
        +        		<T> intdistance​(List<T> s1, + List<T> s2) +
        Measures the distance between two lists of objects.
      +

    • @@ -221,18 +259,19 @@

    Method Summary

    • +
        -
      • +

      • Method Detail

        - +

        • distance

          -
          int distance(long[] s1,
+
          int distance​(long[] s1,
              long[] s2)
          
 
          Measures the distance between two arrays.
          
 
          
@@ -244,13 +283,13 @@ 
          distance
        - +

        • distance

          -
          int distance(int[] s1,
+
          int distance​(int[] s1,
              int[] s2)
          
 
          Measures the distance between two arrays.
          
 
          
@@ -262,13 +301,13 @@ 
          distance
        - +

        • distance

          -
          int distance(short[] s1,
+
          int distance​(short[] s1,
              short[] s2)
          
 
          Measures the distance between two arrays.
          
 
          
@@ -280,13 +319,13 @@ 
          distance
        - +

        • distance

          -
          int distance(byte[] s1,
+
          int distance​(byte[] s1,
              byte[] s2)
          
 
          Measures the distance between two arrays.
          
 
          
@@ -298,13 +337,13 @@ 
          distance
        - +

        • distance

          -
          int distance(char[] s1,
+
          int distance​(char[] s1,
              char[] s2)
          
 
          Measures the distance between two arrays.
          
 
          
@@ -316,13 +355,13 @@ 
          distance
        - +

        • distance

          -
          int distance(double[] s1,
+
          int distance​(double[] s1,
              double[] s2)
          
 
          Measures the distance between two arrays.
          
 
          
@@ -334,13 +373,13 @@ 
          distance
        - +

        • distance

          -
          int distance(float[] s1,
+
          int distance​(float[] s1,
              float[] s2)
          
 
          Measures the distance between two arrays.
          
 
          
@@ -352,13 +391,13 @@ 
          distance
        - +

        • distance

          -
          int distance(boolean[] s1,
+
          int distance​(boolean[] s1,
              boolean[] s2)
          
 
          Measures the distance between two arrays.
          
 
          
@@ -370,14 +409,14 @@ 
          distance
        - +

        • distance

          -
          int distance(String s1,
-             String s2)
          +
          int distance​(String s1,
+             String s2)
          Measures the distance between two Strings.
          Parameters:
          @@ -388,14 +427,14 @@

          distance

        - +

        • distance

          -
          int distance(Object[] s1,
-             Object[] s2)
          +
          int distance​(Object[] s1,
+             Object[] s2)
          Measures the distance between two arrays of objects. The objects in the arrays must be of a class that has overridden the Object.equals method.
          @@ -410,14 +449,14 @@

          distance

        - +

        • distance

          -
          <T> int distance(List<T> s1,
-                 List<T> s2)
          +
          <T> int distance​(List<T> s1,
+                 List<T> s2)
          Measures the distance between two lists of objects. The objects in the lists must be of a class that has overridden the Object.equals method.
          @@ -436,21 +475,25 @@

          distance

      +
    +
    + diff --git a/docs/api/org/cicirello/sequences/distance/SequenceDistanceMeasurerDouble.html b/docs/api/org/cicirello/sequences/distance/SequenceDistanceMeasurerDouble.html index 6372f32e..320dfa67 100644 --- a/docs/api/org/cicirello/sequences/distance/SequenceDistanceMeasurerDouble.html +++ b/docs/api/org/cicirello/sequences/distance/SequenceDistanceMeasurerDouble.html @@ -1,11 +1,21 @@ - + SequenceDistanceMeasurerDouble (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.sequences.distance
    +
    Package org.cicirello.sequences.distance

    Interface SequenceDistanceMeasurerDouble

    @@ -99,10 +124,9 @@

    Interface Seq
  • All Known Implementing Classes:
    -
    EditDistance, ExactMatchDistance, KendallTauSequenceDistance, LongestCommonSubsequenceDistance
    +
    EditDistance, ExactMatchDistance, KendallTauSequenceDistance, LongestCommonSubsequenceDistance
    -
    public interface SequenceDistanceMeasurerDouble

    Implement this interface, SequenceDistanceMeasurerDouble, to define a distance metric for sequences. A sequence may have duplicate elements, unlike a Permutation which must have unique elements. Some SequenceDistanceMeasurers may require the pair of sequences to be the same length, while @@ -110,7 +134,7 @@

    Interface Seq others do not have that requirement. Implementations of this interface compute distances that are floating-point valued.

    If your sequences are guaranteed not to contain duplicates, and the pair is guaranteed to contain the same set of elements, and are of the same length, - then consider instead using the classes that implement the PermutationDistanceMeasurerDouble + then consider instead using the classes that implement the PermutationDistanceMeasurerDouble interface. Those classes are specifically for distance between permutations of the integers from 0 to N-1.

    Since:
    @@ -123,97 +147,111 @@

    Interface Seq
    • +
        -
      • +

      • Method Summary

        - +
        - + + - + - + - + - + - + - + - - + + - + - + - + - - + +
        All Methods Instance Methods Abstract Methods 
        Modifier and TypeMethod and DescriptionMethodDescription
        doubledistancef(boolean[] s1, - boolean[] s2) +distancef​(boolean[] s1, + boolean[] s2)
        Measures the distance between two arrays.
        doubledistancef(byte[] s1, - byte[] s2) +distancef​(byte[] s1, + byte[] s2)
        Measures the distance between two arrays.
        doubledistancef(char[] s1, - char[] s2) +distancef​(char[] s1, + char[] s2)
        Measures the distance between two arrays.
        doubledistancef(double[] s1, - double[] s2) +distancef​(double[] s1, + double[] s2)
        Measures the distance between two arrays.
        doubledistancef(float[] s1, - float[] s2) +distancef​(float[] s1, + float[] s2)
        Measures the distance between two arrays.
        doubledistancef(int[] s1, - int[] s2) +distancef​(int[] s1, + int[] s2)
        Measures the distance between two arrays.
        <T> doubledistancef(List<T> s1, - List<T> s2) -
        Measures the distance between two lists of objects.
        +        		doubledistancef​(long[] s1, + long[] s2) +
        Measures the distance between two arrays.
        doubledistancef(long[] s1, - long[] s2) +distancef​(short[] s1, + short[] s2)
        Measures the distance between two arrays.
        doubledistancef(Object[] s1, - Object[] s2) +distancef​(Object[] s1, + Object[] s2)
        Measures the distance between two arrays of objects.
        doubledistancef(short[] s1, - short[] s2) -
        Measures the distance between two arrays.
        +        		distancef​(String s1, + String s2) +
        Measures the distance between two Strings.
        doubledistancef(String s1, - String s2) -
        Measures the distance between two Strings.
        +        		<T> doubledistancef​(List<T> s1, + List<T> s2) +
        Measures the distance between two lists of objects.
      +

    • @@ -221,18 +259,19 @@

    Method Summary

    • +
        -
      • +

      • Method Detail

        - +

        • distancef

          -
          double distancef(long[] s1,
+
          double distancef​(long[] s1,
                  long[] s2)
          
 
          Measures the distance between two arrays.
          
 
          
@@ -244,13 +283,13 @@ 
          distancef
        - +

        • distancef

          -
          double distancef(int[] s1,
+
          double distancef​(int[] s1,
                  int[] s2)
          
 
          Measures the distance between two arrays.
          
 
          
@@ -262,13 +301,13 @@ 
          distancef
        - +

        • distancef

          -
          double distancef(short[] s1,
+
          double distancef​(short[] s1,
                  short[] s2)
          
 
          Measures the distance between two arrays.
          
 
          
@@ -280,13 +319,13 @@ 
          distancef
        - +

        • distancef

          -
          double distancef(byte[] s1,
+
          double distancef​(byte[] s1,
                  byte[] s2)
          
 
          Measures the distance between two arrays.
          
 
          
@@ -298,13 +337,13 @@ 
          distancef
        - +

        • distancef

          -
          double distancef(char[] s1,
+
          double distancef​(char[] s1,
                  char[] s2)
          
 
          Measures the distance between two arrays.
          
 
          
@@ -316,13 +355,13 @@ 
          distancef
        - +

        • distancef

          -
          double distancef(double[] s1,
+
          double distancef​(double[] s1,
                  double[] s2)
          
 
          Measures the distance between two arrays.
          
 
          
@@ -334,13 +373,13 @@ 
          distancef
        - +

        • distancef

          -
          double distancef(float[] s1,
+
          double distancef​(float[] s1,
                  float[] s2)
          
 
          Measures the distance between two arrays.
          
 
          
@@ -352,13 +391,13 @@ 
          distancef
        - +

        • distancef

          -
          double distancef(boolean[] s1,
+
          double distancef​(boolean[] s1,
                  boolean[] s2)
          
 
          Measures the distance between two arrays.
          
 
          
@@ -370,14 +409,14 @@ 
          distancef
        - +

        • distancef

          -
          double distancef(String s1,
-                 String s2)
          +
          double distancef​(String s1,
+                 String s2)
          Measures the distance between two Strings.
          Parameters:
          @@ -388,14 +427,14 @@

          distancef

        - +

        • distancef

          -
          double distancef(Object[] s1,
-                 Object[] s2)
          +
          double distancef​(Object[] s1,
+                 Object[] s2)
          Measures the distance between two arrays of objects. The objects in the arrays must be of a class that has overridden the Object.equals method.
          @@ -410,14 +449,14 @@

          distancef

        - +

        • distancef

          -
          <T> double distancef(List<T> s1,
-                     List<T> s2)
          +
          <T> double distancef​(List<T> s1,
+                     List<T> s2)
          Measures the distance between two lists of objects. The objects in the lists must be of a class that has overridden the Object.equals method.
          @@ -436,21 +475,25 @@

          distancef

      +
    +
    + diff --git a/docs/api/org/cicirello/sequences/distance/package-frame.html b/docs/api/org/cicirello/sequences/distance/package-frame.html deleted file mode 100644 index 229ec6c4..00000000 --- a/docs/api/org/cicirello/sequences/distance/package-frame.html +++ /dev/null @@ -1,27 +0,0 @@ - - - - - -org.cicirello.sequences.distance (JavaPermutationTools - A Java API for computation on permutations) - - - - -

    org.cicirello.sequences.distance

    -
    -

    Interfaces

    - -

    Classes

    - -
    - - diff --git a/docs/api/org/cicirello/sequences/distance/package-summary.html b/docs/api/org/cicirello/sequences/distance/package-summary.html index 761e5654..b4d4788b 100644 --- a/docs/api/org/cicirello/sequences/distance/package-summary.html +++ b/docs/api/org/cicirello/sequences/distance/package-summary.html @@ -1,11 +1,21 @@ - + org.cicirello.sequences.distance (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +

    Package org.cicirello.sequences.distance

    -
    -
    Implementations of distance measures for general sequences of various forms, including Strings, arrays of primitive types, arrays of objects, etc.
    -
    -

    See: Description

    +
    + + +
    Implementations of distance measures for general sequences of various forms, including Strings, arrays of primitive types, arrays of objects, etc.
    +
    +
    Since:
    +
    1.1
    +
    +
    • - +
      @@ -85,13 +115,13 @@

      Package org.cicirello.sequences.distance<

      - + - + @@ -100,7 +130,7 @@

      Package org.cicirello.sequences.distance<

      Interface Summary 
      Interface
      SequenceDistanceMeasurerSequenceDistanceMeasurer
      Implement this interface, SequenceDistanceMeasurer, to define a distance metric for sequences.
      SequenceDistanceMeasurerDoubleSequenceDistanceMeasurerDouble
      Implement this interface, SequenceDistanceMeasurerDouble, to define a distance metric for sequences.
    • - +
      @@ -108,27 +138,27 @@

      Package org.cicirello.sequences.distance<

      - + - + - + - +
      Class Summary 
      Class
      EditDistanceEditDistance
      EditDistance is an implementation of Wagner and Fischer's dynamic programming algorithm for computing string edit distance.
      ExactMatchDistanceExactMatchDistance
      ExactMatch distance (or Hamming Distance) of a pair of non-binary strings (or more generally sequences) is the number of sequence (or string) positions where the two sequences differ.
      KendallTauSequenceDistanceKendallTauSequenceDistance
      Kendall Tau Sequence Distance is the minimum number of adjacent swaps necessary to transform one sequence into the other.
      LongestCommonSubsequenceDistanceLongestCommonSubsequenceDistance
      LongestCommonSubsequenceDistance is a form of EditDistance, where the edit operations are limited to deletions and insertions (i.e., no replacements or changes), and where the cost of an edit operation is simply 1.
      @@ -138,26 +168,20 @@

      Package org.cicirello.sequences.distance<

    - - - -

    Package org.cicirello.sequences.distance Description

    -
    Implementations of distance measures for general sequences of various forms, including Strings, arrays of primitive types, arrays of objects, etc.
    -
    -
    Since:
    -
    1.1
    -
    +
    + diff --git a/docs/api/org/cicirello/sequences/distance/package-tree.html b/docs/api/org/cicirello/sequences/distance/package-tree.html index 2e063036..287dfdb1 100644 --- a/docs/api/org/cicirello/sequences/distance/package-tree.html +++ b/docs/api/org/cicirello/sequences/distance/package-tree.html @@ -1,11 +1,21 @@ - + org.cicirello.sequences.distance Class Hierarchy (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +

    Hierarchy For Package org.cicirello.sequences.distance

    Package Hierarchies: @@ -75,36 +100,43 @@

    Hierarchy For Package org.cicirello.sequences.distance

    +

    Class Hierarchy

    +
    +

    Interface Hierarchy

    +
    +
    + diff --git a/docs/api/org/cicirello/sequences/package-frame.html b/docs/api/org/cicirello/sequences/package-frame.html deleted file mode 100644 index 1ef74802..00000000 --- a/docs/api/org/cicirello/sequences/package-frame.html +++ /dev/null @@ -1,19 +0,0 @@ - - - - - -org.cicirello.sequences (JavaPermutationTools - A Java API for computation on permutations) - - - - -

    org.cicirello.sequences

    -
    -

    Classes

    - -
    - - diff --git a/docs/api/org/cicirello/sequences/package-summary.html b/docs/api/org/cicirello/sequences/package-summary.html index ee9eb4ed..4a0f1e74 100644 --- a/docs/api/org/cicirello/sequences/package-summary.html +++ b/docs/api/org/cicirello/sequences/package-summary.html @@ -1,11 +1,21 @@ - + org.cicirello.sequences (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +

    Package org.cicirello.sequences

    -
    -
    Classes that perform a variety of operations on sequences (such as arrays, etc).
    -
    -

    See: Description

    +
    + + +
    Classes that perform a variety of operations on sequences (such as arrays, etc).
    +
    +
    Since:
    +
    1.5
    +
    +
    • - +
      @@ -85,7 +115,7 @@

      Package org.cicirello.sequences

      - +
      Class Summary 
      Class
      SequenceSamplerSequenceSampler
      ArraySampler is a class of utility methods related to efficiently generating random samples of array elements, without replacement.
      @@ -95,26 +125,20 @@

      Package org.cicirello.sequences

    - - - -

    Package org.cicirello.sequences Description

    -
    Classes that perform a variety of operations on sequences (such as arrays, etc).
    -
    -
    Since:
    -
    1.5
    -
    +
    + diff --git a/docs/api/org/cicirello/sequences/package-tree.html b/docs/api/org/cicirello/sequences/package-tree.html index 84977147..81b0a971 100644 --- a/docs/api/org/cicirello/sequences/package-tree.html +++ b/docs/api/org/cicirello/sequences/package-tree.html @@ -1,11 +1,21 @@ - + org.cicirello.sequences Class Hierarchy (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +

    Hierarchy For Package org.cicirello.sequences

    Package Hierarchies: @@ -75,25 +100,30 @@

    Hierarchy For Package org.cicirello.sequences

    +

    Class Hierarchy

    +
    +
    + diff --git a/docs/api/org/cicirello/util/Copyable.html b/docs/api/org/cicirello/util/Copyable.html index 4899e31c..37dcb570 100644 --- a/docs/api/org/cicirello/util/Copyable.html +++ b/docs/api/org/cicirello/util/Copyable.html @@ -1,11 +1,21 @@ - + Copyable (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +
    -
    org.cicirello.util
    +
    Package org.cicirello.util

    Interface Copyable<T extends Copyable<T>>

    @@ -99,10 +124,9 @@

    Interface Copyable<T extends Cop
  • All Known Implementing Classes:
    -
    Permutation
    +
    Permutation
    -
    public interface Copyable<T extends Copyable<T>>
    A simple interface for objects that can be copied.
    @@ -116,26 +140,30 @@

    Interface Copyable<T extends Cop

    • @@ -143,18 +171,19 @@

    Method Summary

    • +
        -
      • +

      • Method Detail

        - +

        • copy

          -
          T copy()
          +
          T copy()
          Creates an identical copy of this object.
          Returns:
          @@ -164,21 +193,25 @@

          copy

      +
    +
    + diff --git a/docs/api/org/cicirello/util/package-frame.html b/docs/api/org/cicirello/util/package-frame.html deleted file mode 100644 index 35ac8ad3..00000000 --- a/docs/api/org/cicirello/util/package-frame.html +++ /dev/null @@ -1,19 +0,0 @@ - - - - - -org.cicirello.util (JavaPermutationTools - A Java API for computation on permutations) - - - - -

    org.cicirello.util

    -
    -

    Interfaces

    - -
    - - diff --git a/docs/api/org/cicirello/util/package-summary.html b/docs/api/org/cicirello/util/package-summary.html index d520bdac..76fe72dc 100644 --- a/docs/api/org/cicirello/util/package-summary.html +++ b/docs/api/org/cicirello/util/package-summary.html @@ -1,11 +1,21 @@ - + org.cicirello.util (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +

    Package org.cicirello.util

    -
    -
    This package includes classes and interfaces that serve some useful utility purpose.
    -
    -

    See: Description

    +
    + + +
    This package includes classes and interfaces that serve some useful utility purpose.
    +
    +
    Since:
    +
    2.0
    +
    +
    • - +
      @@ -85,7 +115,7 @@

      Package org.cicirello.util

      - + @@ -94,26 +124,20 @@

      Package org.cicirello.util

      Interface Summary 
      Interface
      Copyable<T extends Copyable<T>>Copyable<T extends Copyable<T>>
      A simple interface for objects that can be copied.
    - - - -

    Package org.cicirello.util Description

    -
    This package includes classes and interfaces that serve some useful utility purpose.
    -
    -
    Since:
    -
    2.0
    -
    +
    + diff --git a/docs/api/org/cicirello/util/package-tree.html b/docs/api/org/cicirello/util/package-tree.html index 93246216..c81ed350 100644 --- a/docs/api/org/cicirello/util/package-tree.html +++ b/docs/api/org/cicirello/util/package-tree.html @@ -1,11 +1,21 @@ - + org.cicirello.util Class Hierarchy (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "../../../"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +

    Hierarchy For Package org.cicirello.util

    Package Hierarchies: @@ -75,21 +100,26 @@

    Hierarchy For Package org.cicirello.util

    +

    Interface Hierarchy

    +
    +
    + diff --git a/docs/api/overview-frame.html b/docs/api/overview-frame.html deleted file mode 100644 index e5394f1c..00000000 --- a/docs/api/overview-frame.html +++ /dev/null @@ -1,28 +0,0 @@ - - - - - -Overview List (JavaPermutationTools - A Java API for computation on permutations) - - - - -
    All Classes
    -
    -

    Packages

    - -
    -

     

    - - diff --git a/docs/api/overview-summary.html b/docs/api/overview-summary.html index ea7ffad4..dea7dc20 100644 --- a/docs/api/overview-summary.html +++ b/docs/api/overview-summary.html @@ -1,212 +1,23 @@ - + - -Overview (JavaPermutationTools - A Java API for computation on permutations) + +JavaPermutationTools - A Java API for computation on permutations + + + + - - +
    - -
    - - -
    Skip navigation links
    - - - - -
    -
    -
      -
    • Prev
      • -
    • Next
      • -
    - - -
    - -
    - - -
    - -
    -

    JavaPermutationTools - A Java API for computation on permutations

    -
    -
    -
    -
    The JavaPermutationTools (JPT) API provides Java classes for computation on -permutations and sequences.
    -
    -

    See: Description

    -
    -
    - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    Packages 
    PackageDescription
    org.cicirello.math -
    Collection of classes related to a variety of mathematical concepts.
    -
    org.cicirello.math.la -
    Collection of classes related to linear algebra.
    -
    org.cicirello.math.rand -
    Collection of classes related to random number generation.
    -
    org.cicirello.math.stats -
    Collection of classes related to statistics.
    -
    org.cicirello.permutations -
    Collection of classes related to representing and manipulating permutations.
    -
    org.cicirello.permutations.distance -
    Implementations of a variety of permutation distance measures.
    -
    org.cicirello.sequences -
    Classes that perform a variety of operations on sequences (such as arrays, etc).
    -
    org.cicirello.sequences.distance -
    Implementations of distance measures for general sequences of various forms, including Strings, arrays of primitive types, arrays of objects, etc.
    -
    org.cicirello.util -
    This package includes classes and interfaces that serve some useful utility purpose.
    -
    -
    -
    - - -

    The JavaPermutationTools (JPT) API provides Java classes for computation on -permutations and sequences. The current release enables representing -and generating permutations, implementations of a variety of permutation -distance metrics, as well as sequence distance metrics. The sequence distance -metrics support computing the distance between pairs of Strings, arrays of primitive values, -as well as arrays of objects. More computation on permutations -will be added in later releases.

    -

    The source code repository -is hosted on GitHub, and includes the source code, example programs, as well as programs -that reproduce results from published research papers that have either used this API or -earlier unreleased versions of it. The source code is licensed under the -GNU General Public License Version 3 (GPLv3).

    -

    For more information see the JavaPermutationTools website. -Potential contributors, please see the source repository, and/or -contact Vincent A. Cicirello.

    -
    - -
    - - -
    Skip navigation links
    - - - - -
    -
    -
      -
    • Prev
      • -
    • Next
      • -
    - - -
    - -
    - - -
    - -

    Copyright © 2005-2019 Vincent A. Cicirello. https://www.cicirello.org/

    +

    index.html

    +
    diff --git a/docs/api/overview-tree.html b/docs/api/overview-tree.html index 3cb0861b..b2449240 100644 --- a/docs/api/overview-tree.html +++ b/docs/api/overview-tree.html @@ -1,11 +1,21 @@ - + Class Hierarchy (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "./"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +

    Hierarchy For All Packages

    Package Hierarchies: @@ -83,80 +108,87 @@

    Hierarchy For All Packages

    +

    Class Hierarchy

    +
    +

    Interface Hierarchy

    +
    +
    + diff --git a/docs/api/package-search-index.js b/docs/api/package-search-index.js new file mode 100644 index 00000000..4026f47a --- /dev/null +++ b/docs/api/package-search-index.js @@ -0,0 +1 @@ +packageSearchIndex = [{"l":"All Packages","url":"allpackages-index.html"},{"l":"org.cicirello.math"},{"l":"org.cicirello.math.la"},{"l":"org.cicirello.math.rand"},{"l":"org.cicirello.math.stats"},{"l":"org.cicirello.permutations"},{"l":"org.cicirello.permutations.distance"},{"l":"org.cicirello.sequences"},{"l":"org.cicirello.sequences.distance"},{"l":"org.cicirello.util"}] \ No newline at end of file diff --git a/docs/api/package-search-index.zip b/docs/api/package-search-index.zip new file mode 100644 index 00000000..7b7235bb Binary files /dev/null and b/docs/api/package-search-index.zip differ diff --git a/docs/api/resources/glass.png b/docs/api/resources/glass.png new file mode 100644 index 00000000..a7f591f4 Binary files /dev/null and b/docs/api/resources/glass.png differ diff --git a/docs/api/resources/x.png b/docs/api/resources/x.png new file mode 100644 index 00000000..30548a75 Binary files /dev/null and b/docs/api/resources/x.png differ diff --git a/docs/api/script.js b/docs/api/script.js index b3463569..7dc93c48 100644 --- a/docs/api/script.js +++ b/docs/api/script.js @@ -1,9 +1,124 @@ -function show(type) -{ +/* + * Copyright (c) 2013, 2018, Oracle and/or its affiliates. All rights reserved. + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. + * + * This code is free software; you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 2 only, as + * published by the Free Software Foundation. Oracle designates this + * particular file as subject to the "Classpath" exception as provided + * by Oracle in the LICENSE file that accompanied this code. + * + * This code is distributed in the hope that it will be useful, but WITHOUT + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License + * version 2 for more details (a copy is included in the LICENSE file that + * accompanied this code). + * + * You should have received a copy of the GNU General Public License version + * 2 along with this work; if not, write to the Free Software Foundation, + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. + * + * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA + * or visit www.oracle.com if you need additional information or have any + * questions. + */ + +var moduleSearchIndex; +var packageSearchIndex; +var typeSearchIndex; +var memberSearchIndex; +var tagSearchIndex; +function loadScripts(doc, tag) { + createElem(doc, tag, 'jquery/jszip/dist/jszip.js'); + createElem(doc, tag, 'jquery/jszip-utils/dist/jszip-utils.js'); + if (window.navigator.userAgent.indexOf('MSIE ') > 0 || window.navigator.userAgent.indexOf('Trident/') > 0 || + window.navigator.userAgent.indexOf('Edge/') > 0) { + createElem(doc, tag, 'jquery/jszip-utils/dist/jszip-utils-ie.js'); + } + createElem(doc, tag, 'search.js'); + + $.get(pathtoroot + "module-search-index.zip") + .done(function() { + JSZipUtils.getBinaryContent(pathtoroot + "module-search-index.zip", function(e, data) { + JSZip.loadAsync(data).then(function(zip){ + zip.file("module-search-index.json").async("text").then(function(content){ + moduleSearchIndex = JSON.parse(content); + }); + }); + }); + }); + $.get(pathtoroot + "package-search-index.zip") + .done(function() { + JSZipUtils.getBinaryContent(pathtoroot + "package-search-index.zip", function(e, data) { + JSZip.loadAsync(data).then(function(zip){ + zip.file("package-search-index.json").async("text").then(function(content){ + packageSearchIndex = JSON.parse(content); + }); + }); + }); + }); + $.get(pathtoroot + "type-search-index.zip") + .done(function() { + JSZipUtils.getBinaryContent(pathtoroot + "type-search-index.zip", function(e, data) { + JSZip.loadAsync(data).then(function(zip){ + zip.file("type-search-index.json").async("text").then(function(content){ + typeSearchIndex = JSON.parse(content); + }); + }); + }); + }); + $.get(pathtoroot + "member-search-index.zip") + .done(function() { + JSZipUtils.getBinaryContent(pathtoroot + "member-search-index.zip", function(e, data) { + JSZip.loadAsync(data).then(function(zip){ + zip.file("member-search-index.json").async("text").then(function(content){ + memberSearchIndex = JSON.parse(content); + }); + }); + }); + }); + $.get(pathtoroot + "tag-search-index.zip") + .done(function() { + JSZipUtils.getBinaryContent(pathtoroot + "tag-search-index.zip", function(e, data) { + JSZip.loadAsync(data).then(function(zip){ + zip.file("tag-search-index.json").async("text").then(function(content){ + tagSearchIndex = JSON.parse(content); + }); + }); + }); + }); + if (!moduleSearchIndex) { + createElem(doc, tag, 'module-search-index.js'); + } + if (!packageSearchIndex) { + createElem(doc, tag, 'package-search-index.js'); + } + if (!typeSearchIndex) { + createElem(doc, tag, 'type-search-index.js'); + } + if (!memberSearchIndex) { + createElem(doc, tag, 'member-search-index.js'); + } + if (!tagSearchIndex) { + createElem(doc, tag, 'tag-search-index.js'); + } + $(window).resize(function() { + $('.navPadding').css('padding-top', $('.fixedNav').css("height")); + }); +} + +function createElem(doc, tag, path) { + var script = doc.createElement(tag); + var scriptElement = doc.getElementsByTagName(tag)[0]; + script.src = pathtoroot + path; + scriptElement.parentNode.insertBefore(script, scriptElement); +} + +function show(type) { count = 0; - for (var key in methods) { + for (var key in data) { var row = document.getElementById(key); - if ((methods[key] & type) != 0) { + if ((data[key] & type) !== 0) { row.style.display = ''; row.className = (count++ % 2) ? rowColor : altColor; } @@ -13,8 +128,7 @@ function show(type) updateTabs(type); } -function updateTabs(type) -{ +function updateTabs(type) { for (var value in tabs) { var sNode = document.getElementById(tabs[value][0]); var spanNode = sNode.firstChild; @@ -28,3 +142,8 @@ function updateTabs(type) } } } + +function updateModuleFrame(pFrame, cFrame) { + top.packageFrame.location = pFrame; + top.classFrame.location = cFrame; +} diff --git a/docs/api/search.js b/docs/api/search.js new file mode 100644 index 00000000..b773531b --- /dev/null +++ b/docs/api/search.js @@ -0,0 +1,326 @@ +/* + * Copyright (c) 2015, 2018, Oracle and/or its affiliates. All rights reserved. + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. + * + * This code is free software; you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 2 only, as + * published by the Free Software Foundation. Oracle designates this + * particular file as subject to the "Classpath" exception as provided + * by Oracle in the LICENSE file that accompanied this code. + * + * This code is distributed in the hope that it will be useful, but WITHOUT + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License + * version 2 for more details (a copy is included in the LICENSE file that + * accompanied this code). + * + * You should have received a copy of the GNU General Public License version + * 2 along with this work; if not, write to the Free Software Foundation, + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. + * + * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA + * or visit www.oracle.com if you need additional information or have any + * questions. + */ + +var noResult = {l: "No results found"}; +var catModules = "Modules"; +var catPackages = "Packages"; +var catTypes = "Types"; +var catMembers = "Members"; +var catSearchTags = "SearchTags"; +var highlight = "$&"; +var camelCaseRegexp = ""; +var secondaryMatcher = ""; +function getHighlightedText(item) { + var ccMatcher = new RegExp(camelCaseRegexp); + var label = item.replace(ccMatcher, highlight); + if (label === item) { + label = item.replace(secondaryMatcher, highlight); + } + return label; +} +function getURLPrefix(ui) { + var urlPrefix=""; + if (useModuleDirectories) { + var slash = "/"; + if (ui.item.category === catModules) { + return ui.item.l + slash; + } else if (ui.item.category === catPackages && ui.item.m) { + return ui.item.m + slash; + } else if ((ui.item.category === catTypes && ui.item.p) || ui.item.category === catMembers) { + $.each(packageSearchIndex, function(index, item) { + if (ui.item.p == item.l) { + urlPrefix = item.m + slash; + } + }); + return urlPrefix; + } else { + return urlPrefix; + } + } + return urlPrefix; +} +var watermark = 'Search'; +$(function() { + $("#search").val(''); + $("#search").prop("disabled", false); + $("#reset").prop("disabled", false); + $("#search").val(watermark).addClass('watermark'); + $("#search").blur(function() { + if ($(this).val().length == 0) { + $(this).val(watermark).addClass('watermark'); + } + }); + $("#search").on('click keydown', function() { + if ($(this).val() == watermark) { + $(this).val('').removeClass('watermark'); + } + }); + $("#reset").click(function() { + $("#search").val(''); + $("#search").focus(); + }); + $("#search").focus(); + $("#search")[0].setSelectionRange(0, 0); +}); +$.widget("custom.catcomplete", $.ui.autocomplete, { + _create: function() { + this._super(); + this.widget().menu("option", "items", "> :not(.ui-autocomplete-category)"); + }, + _renderMenu: function(ul, items) { + var rMenu = this, + currentCategory = ""; + rMenu.menu.bindings = $(); + $.each(items, function(index, item) { + var li; + if (item.l !== noResult.l && item.category !== currentCategory) { + ul.append("
  • " + item.category + "
    • "); + currentCategory = item.category; + } + li = rMenu._renderItemData(ul, item); + if (item.category) { + li.attr("aria-label", item.category + " : " + item.l); + li.attr("class", "resultItem"); + } else { + li.attr("aria-label", item.l); + li.attr("class", "resultItem"); + } + }); + }, + _renderItem: function(ul, item) { + var label = ""; + if (item.category === catModules) { + label = getHighlightedText(item.l); + } else if (item.category === catPackages) { + label = (item.m) + ? getHighlightedText(item.m + "/" + item.l) + : getHighlightedText(item.l); + } else if (item.category === catTypes) { + label = (item.p) + ? getHighlightedText(item.p + "." + item.l) + : getHighlightedText(item.l); + } else if (item.category === catMembers) { + label = getHighlightedText(item.p + "." + (item.c + "." + item.l)); + } else if (item.category === catSearchTags) { + label = getHighlightedText(item.l); + } else { + label = item.l; + } + var li = $("
  • ").appendTo(ul); + var div = $("
    ").appendTo(li); + if (item.category === catSearchTags) { + if (item.d) { + div.html(label + " (" + item.h + ")
    " + + item.d + "
    "); + } else { + div.html(label + " (" + item.h + ")"); + } + } else { + div.html(label); + } + return li; + } +}); +$(function() { + $("#search").catcomplete({ + minLength: 1, + delay: 100, + source: function(request, response) { + var result = new Array(); + var presult = new Array(); + var tresult = new Array(); + var mresult = new Array(); + var tgresult = new Array(); + var secondaryresult = new Array(); + var displayCount = 0; + var exactMatcher = new RegExp("^" + $.ui.autocomplete.escapeRegex(request.term) + "$", "i"); + camelCaseRegexp = ($.ui.autocomplete.escapeRegex(request.term)).split(/(?=[A-Z])/).join("([a-z0-9_$]*?)"); + var camelCaseMatcher = new RegExp("^" + camelCaseRegexp); + secondaryMatcher = new RegExp($.ui.autocomplete.escapeRegex(request.term), "i"); + + // Return the nested innermost name from the specified object + function nestedName(e) { + return e.l.substring(e.l.lastIndexOf(".") + 1); + } + + function concatResults(a1, a2) { + a1 = a1.concat(a2); + a2.length = 0; + return a1; + } + + if (moduleSearchIndex) { + var mdleCount = 0; + $.each(moduleSearchIndex, function(index, item) { + item.category = catModules; + if (exactMatcher.test(item.l)) { + result.push(item); + mdleCount++; + } else if (camelCaseMatcher.test(item.l)) { + result.push(item); + } else if (secondaryMatcher.test(item.l)) { + secondaryresult.push(item); + } + }); + displayCount = mdleCount; + result = concatResults(result, secondaryresult); + } + if (packageSearchIndex) { + var pCount = 0; + var pkg = ""; + $.each(packageSearchIndex, function(index, item) { + item.category = catPackages; + pkg = (item.m) + ? (item.m + "/" + item.l) + : item.l; + if (exactMatcher.test(item.l)) { + presult.push(item); + pCount++; + } else if (camelCaseMatcher.test(pkg)) { + presult.push(item); + } else if (secondaryMatcher.test(pkg)) { + secondaryresult.push(item); + } + }); + result = result.concat(concatResults(presult, secondaryresult)); + displayCount = (pCount > displayCount) ? pCount : displayCount; + } + if (typeSearchIndex) { + var tCount = 0; + $.each(typeSearchIndex, function(index, item) { + item.category = catTypes; + var s = nestedName(item); + if (exactMatcher.test(s)) { + tresult.push(item); + tCount++; + } else if (camelCaseMatcher.test(s)) { + tresult.push(item); + } else if (secondaryMatcher.test(item.p + "." + item.l)) { + secondaryresult.push(item); + } + }); + result = result.concat(concatResults(tresult, secondaryresult)); + displayCount = (tCount > displayCount) ? tCount : displayCount; + } + if (memberSearchIndex) { + var mCount = 0; + $.each(memberSearchIndex, function(index, item) { + item.category = catMembers; + var s = nestedName(item); + if (exactMatcher.test(s)) { + mresult.push(item); + mCount++; + } else if (camelCaseMatcher.test(s)) { + mresult.push(item); + } else if (secondaryMatcher.test(item.c + "." + item.l)) { + secondaryresult.push(item); + } + }); + result = result.concat(concatResults(mresult, secondaryresult)); + displayCount = (mCount > displayCount) ? mCount : displayCount; + } + if (tagSearchIndex) { + var tgCount = 0; + $.each(tagSearchIndex, function(index, item) { + item.category = catSearchTags; + if (exactMatcher.test(item.l)) { + tgresult.push(item); + tgCount++; + } else if (secondaryMatcher.test(item.l)) { + secondaryresult.push(item); + } + }); + result = result.concat(concatResults(tgresult, secondaryresult)); + displayCount = (tgCount > displayCount) ? tgCount : displayCount; + } + displayCount = (displayCount > 500) ? displayCount : 500; + var counter = function() { + var count = {Modules: 0, Packages: 0, Types: 0, Members: 0, SearchTags: 0}; + var f = function(item) { + count[item.category] += 1; + return (count[item.category] <= displayCount); + }; + return f; + }(); + response(result.filter(counter)); + }, + response: function(event, ui) { + if (!ui.content.length) { + ui.content.push(noResult); + } else { + $("#search").empty(); + } + }, + autoFocus: true, + position: { + collision: "flip" + }, + select: function(event, ui) { + if (ui.item.l !== noResult.l) { + var url = getURLPrefix(ui); + if (ui.item.category === catModules) { + if (useModuleDirectories) { + url += "module-summary.html"; + } else { + url = ui.item.l + "-summary.html"; + } + } else if (ui.item.category === catPackages) { + if (ui.item.url) { + url = ui.item.url; + } else { + url += ui.item.l.replace(/\./g, '/') + "/package-summary.html"; + } + } else if (ui.item.category === catTypes) { + if (ui.item.url) { + url = ui.item.url; + } else if (ui.item.p === "") { + url += ui.item.l + ".html"; + } else { + url += ui.item.p.replace(/\./g, '/') + "/" + ui.item.l + ".html"; + } + } else if (ui.item.category === catMembers) { + if (ui.item.p === "") { + url += ui.item.c + ".html" + "#"; + } else { + url += ui.item.p.replace(/\./g, '/') + "/" + ui.item.c + ".html" + "#"; + } + if (ui.item.url) { + url += ui.item.url; + } else { + url += ui.item.l; + } + } else if (ui.item.category === catSearchTags) { + url += ui.item.u; + } + if (top !== window) { + parent.classFrame.location = pathtoroot + url; + } else { + window.location.href = pathtoroot + url; + } + $("#search").focus(); + } + } + }); +}); diff --git a/docs/api/serialized-form.html b/docs/api/serialized-form.html index b80e5c0c..539bce2c 100644 --- a/docs/api/serialized-form.html +++ b/docs/api/serialized-form.html @@ -1,11 +1,21 @@ - + Serialized Form (JavaPermutationTools - A Java API for computation on permutations) + + + + + + + + +var pathtoroot = "./"; +var useModuleDirectories = false; +loadScripts(document, 'script'); +
    + +
    +

    Serialized Form

    +
    • + + diff --git a/docs/api/stylesheet.css b/docs/api/stylesheet.css index cebb4fd8..fa246765 100644 --- a/docs/api/stylesheet.css +++ b/docs/api/stylesheet.css @@ -1,35 +1,51 @@ -/* Javadoc style sheet */ -/* -Overall document style -*/ +/* + * Javadoc style sheet + */ @import url('resources/fonts/dejavu.css'); +/* + * Styles for individual HTML elements. + * + * These are styles that are specific to individual HTML elements. Changing them affects the style of a particular + * HTML element throughout the page. + */ + body { background-color:#ffffff; color:#353833; font-family:'DejaVu Sans', Arial, Helvetica, sans-serif; font-size:14px; margin:0; + padding:0; + height:100%; + width:100%; +} +iframe { + margin:0; + padding:0; + height:100%; + width:100%; + overflow-y:scroll; + border:none; } a:link, a:visited { text-decoration:none; color:#4A6782; } -a:hover, a:focus { +a[href]:hover, a[href]:focus { text-decoration:none; color:#bb7a2a; } -a:active { - text-decoration:none; - color:#4A6782; -} a[name] { color:#353833; } -a[name]:hover { - text-decoration:none; - color:#353833; +a[name]:before, a[name]:target, a[id]:before, a[id]:target { + content:""; + display:inline-block; + position:relative; + padding-top:129px; + margin-top:-129px; } pre { font-family:'DejaVu Sans Mono', monospace; @@ -78,9 +94,16 @@ table tr td dt code { sup { font-size:8px; } + +/* + * Styles for HTML generated by javadoc. + * + * These are style classes that are used by the standard doclet to generate HTML documentation. + */ + /* -Document title and Copyright styles -*/ + * Styles for document title and copyright. + */ .clear { clear:both; height:0px; @@ -111,8 +134,8 @@ Document title and Copyright styles font-weight:bold; } /* -Navigation bar styles -*/ + * Styles for navigation bar. + */ .bar { background-color:#4D7A97; color:#FFFFFF; @@ -121,6 +144,15 @@ Navigation bar styles font-size:11px; margin:0; } +.navPadding { + padding-top: 107px; +} +.fixedNav { + position:fixed; + width:100%; + z-index:999; + background-color:#ffffff; +} .topNav { background-color:#4D7A97; color:#FFFFFF; @@ -170,7 +202,22 @@ ul.navList li{ padding: 5px 6px; text-transform:uppercase; } -ul.subNavList li{ +ul.navListSearch { + float:right; + margin:0 0 0 0; + padding:0; +} +ul.navListSearch li { + list-style:none; + float:right; + padding: 5px 6px; + text-transform:uppercase; +} +ul.navListSearch li label { + position:relative; + right:-16px; +} +ul.subNavList li { list-style:none; float:left; } @@ -196,21 +243,29 @@ ul.subNavList li{ overflow:hidden; } /* -Page header and footer styles -*/ + * Styles for page header and footer. + */ .header, .footer { clear:both; margin:0 20px; padding:5px 0 0 0; } -.indexHeader { - margin:10px; +.indexNav { position:relative; + font-size:12px; + background-color:#dee3e9; +} +.indexNav ul { + margin-top:0; + padding:5px; } -.indexHeader span{ - margin-right:15px; +.indexNav ul li { + display:inline; + list-style-type:none; + padding-right:10px; + text-transform:uppercase; } -.indexHeader h1 { +.indexNav h1 { font-size:13px; } .title { @@ -232,8 +287,8 @@ Page header and footer styles font-size:13px; } /* -Heading styles -*/ + * Styles for headings. + */ div.details ul.blockList ul.blockList ul.blockList li.blockList h4, div.details ul.blockList ul.blockList ul.blockListLast li.blockList h4 { background-color:#dee3e9; border:1px solid #d0d9e0; @@ -254,9 +309,10 @@ ul.blockList li.blockList h2 { padding:0px 0 20px 0; } /* -Page layout container styles -*/ -.contentContainer, .sourceContainer, .classUseContainer, .serializedFormContainer, .constantValuesContainer { + * Styles for page layout containers. + */ +.contentContainer, .sourceContainer, .classUseContainer, .serializedFormContainer, .constantValuesContainer, +.allClassesContainer, .allPackagesContainer { clear:both; padding:10px 20px; position:relative; @@ -287,7 +343,7 @@ Page layout container styles .contentContainer .description dl dd, .contentContainer .details dl dd, .serializedFormContainer dl dd { margin:5px 0 10px 0px; font-size:14px; - font-family:'DejaVu Sans Mono',monospace; + font-family:'DejaVu Serif', Georgia, "Times New Roman", Times, serif; } .serializedFormContainer dl.nameValue dt { margin-left:1px; @@ -301,8 +357,11 @@ Page layout container styles display:inline; } /* -List styles -*/ + * Styles for lists. + */ +li.circle { + list-style:circle; +} ul.horizontal li { display:inline; font-size:0.9em; @@ -355,19 +414,22 @@ table tr td dl, table tr td dl dt, table tr td dl dd { margin-bottom:1px; } /* -Table styles -*/ -.overviewSummary, .memberSummary, .typeSummary, .useSummary, .constantsSummary, .deprecatedSummary { + * Styles for tables. + */ +.overviewSummary, .memberSummary, .typeSummary, .useSummary, .constantsSummary, .deprecatedSummary, +.requiresSummary, .packagesSummary, .providesSummary, .usesSummary { width:100%; + border-spacing:0; border-left:1px solid #EEE; border-right:1px solid #EEE; border-bottom:1px solid #EEE; } -.overviewSummary, .memberSummary { +.overviewSummary, .memberSummary, .requiresSummary, .packagesSummary, .providesSummary, .usesSummary { padding:0px; } .overviewSummary caption, .memberSummary caption, .typeSummary caption, -.useSummary caption, .constantsSummary caption, .deprecatedSummary caption { +.useSummary caption, .constantsSummary caption, .deprecatedSummary caption, +.requiresSummary caption, .packagesSummary caption, .providesSummary caption, .usesSummary caption { position:relative; text-align:left; background-repeat:no-repeat; @@ -382,17 +444,31 @@ Table styles white-space:pre; } .overviewSummary caption a:link, .memberSummary caption a:link, .typeSummary caption a:link, -.useSummary caption a:link, .constantsSummary caption a:link, .deprecatedSummary caption a:link, +.constantsSummary caption a:link, .deprecatedSummary caption a:link, +.requiresSummary caption a:link, .packagesSummary caption a:link, .providesSummary caption a:link, +.usesSummary caption a:link, .overviewSummary caption a:hover, .memberSummary caption a:hover, .typeSummary caption a:hover, -.useSummary caption a:hover, .constantsSummary caption a:hover, .deprecatedSummary caption a:hover, +.constantsSummary caption a:hover, .deprecatedSummary caption a:hover, +.requiresSummary caption a:hover, .packagesSummary caption a:hover, .providesSummary caption a:hover, +.usesSummary caption a:hover, .overviewSummary caption a:active, .memberSummary caption a:active, .typeSummary caption a:active, -.useSummary caption a:active, .constantsSummary caption a:active, .deprecatedSummary caption a:active, +.constantsSummary caption a:active, .deprecatedSummary caption a:active, +.requiresSummary caption a:active, .packagesSummary caption a:active, .providesSummary caption a:active, +.usesSummary caption a:active, .overviewSummary caption a:visited, .memberSummary caption a:visited, .typeSummary caption a:visited, -.useSummary caption a:visited, .constantsSummary caption a:visited, .deprecatedSummary caption a:visited { +.constantsSummary caption a:visited, .deprecatedSummary caption a:visited, +.requiresSummary caption a:visited, .packagesSummary caption a:visited, .providesSummary caption a:visited, +.usesSummary caption a:visited { color:#FFFFFF; } +.useSummary caption a:link, .useSummary caption a:hover, .useSummary caption a:active, +.useSummary caption a:visited { + color:#1f389c; +} .overviewSummary caption span, .memberSummary caption span, .typeSummary caption span, -.useSummary caption span, .constantsSummary caption span, .deprecatedSummary caption span { +.useSummary caption span, .constantsSummary caption span, .deprecatedSummary caption span, +.requiresSummary caption span, .packagesSummary caption span, .providesSummary caption span, +.usesSummary caption span { white-space:nowrap; padding-top:5px; padding-left:12px; @@ -404,7 +480,8 @@ Table styles border: none; height:16px; } -.memberSummary caption span.activeTableTab span { +.memberSummary caption span.activeTableTab span, .packagesSummary caption span.activeTableTab span, +.overviewSummary caption span.activeTableTab span, .typeSummary caption span.activeTableTab span { white-space:nowrap; padding-top:5px; padding-left:12px; @@ -415,7 +492,8 @@ Table styles background-color:#F8981D; height:16px; } -.memberSummary caption span.tableTab span { +.memberSummary caption span.tableTab span, .packagesSummary caption span.tableTab span, +.overviewSummary caption span.tableTab span, .typeSummary caption span.tableTab span { white-space:nowrap; padding-top:5px; padding-left:12px; @@ -426,7 +504,10 @@ Table styles background-color:#4D7A97; height:16px; } -.memberSummary caption span.tableTab, .memberSummary caption span.activeTableTab { +.memberSummary caption span.tableTab, .memberSummary caption span.activeTableTab, +.packagesSummary caption span.tableTab, .packagesSummary caption span.activeTableTab, +.overviewSummary caption span.tableTab, .overviewSummary caption span.activeTableTab, +.typeSummary caption span.tableTab, .typeSummary caption span.activeTableTab { padding-top:0px; padding-left:0px; padding-right:0px; @@ -435,14 +516,16 @@ Table styles display:inline; } .overviewSummary .tabEnd, .memberSummary .tabEnd, .typeSummary .tabEnd, -.useSummary .tabEnd, .constantsSummary .tabEnd, .deprecatedSummary .tabEnd { +.useSummary .tabEnd, .constantsSummary .tabEnd, .deprecatedSummary .tabEnd, +.requiresSummary .tabEnd, .packagesSummary .tabEnd, .providesSummary .tabEnd, .usesSummary .tabEnd { display:none; width:5px; position:relative; float:left; background-color:#F8981D; } -.memberSummary .activeTableTab .tabEnd { +.memberSummary .activeTableTab .tabEnd, .packagesSummary .activeTableTab .tabEnd, +.overviewSummary .activeTableTab .tabEnd, .typeSummary .activeTableTab .tabEnd { display:none; width:5px; margin-right:3px; @@ -450,66 +533,88 @@ Table styles float:left; background-color:#F8981D; } -.memberSummary .tableTab .tabEnd { +.memberSummary .tableTab .tabEnd, .packagesSummary .tableTab .tabEnd, +.overviewSummary .tableTab .tabEnd, .typeSummary .tableTab .tabEnd { display:none; width:5px; margin-right:3px; position:relative; background-color:#4D7A97; float:left; - +} +.rowColor th, .altColor th { + font-weight:normal; } .overviewSummary td, .memberSummary td, .typeSummary td, -.useSummary td, .constantsSummary td, .deprecatedSummary td { +.useSummary td, .constantsSummary td, .deprecatedSummary td, +.requiresSummary td, .packagesSummary td, .providesSummary td, .usesSummary td { text-align:left; padding:0px 0px 12px 10px; - width:100%; } -th.colOne, th.colFirst, th.colLast, .useSummary th, .constantsSummary th, -td.colOne, td.colFirst, td.colLast, .useSummary td, .constantsSummary td{ +th.colFirst, th.colSecond, th.colLast, th.colConstructorName, th.colDeprecatedItemName, .useSummary th, +.constantsSummary th, .packagesSummary th, td.colFirst, td.colSecond, td.colLast, .useSummary td, +.constantsSummary td { vertical-align:top; padding-right:0px; padding-top:8px; padding-bottom:3px; } -th.colFirst, th.colLast, th.colOne, .constantsSummary th { +th.colFirst, th.colSecond, th.colLast, th.colConstructorName, th.colDeprecatedItemName, .constantsSummary th, +.packagesSummary th { background:#dee3e9; text-align:left; padding:8px 3px 3px 7px; } td.colFirst, th.colFirst { - white-space:nowrap; font-size:13px; } -td.colLast, th.colLast { +td.colSecond, th.colSecond, td.colLast, th.colConstructorName, th.colDeprecatedItemName, th.colLast { font-size:13px; } -td.colOne, th.colOne { +.constantsSummary th, .packagesSummary th { + font-size:13px; +} +.providesSummary th.colFirst, .providesSummary th.colLast, .providesSummary td.colFirst, +.providesSummary td.colLast { + white-space:normal; font-size:13px; } .overviewSummary td.colFirst, .overviewSummary th.colFirst, -.overviewSummary td.colOne, .overviewSummary th.colOne, +.requiresSummary td.colFirst, .requiresSummary th.colFirst, +.packagesSummary td.colFirst, .packagesSummary td.colSecond, .packagesSummary th.colFirst, .packagesSummary th, +.usesSummary td.colFirst, .usesSummary th.colFirst, +.providesSummary td.colFirst, .providesSummary th.colFirst, .memberSummary td.colFirst, .memberSummary th.colFirst, -.memberSummary td.colOne, .memberSummary th.colOne, -.typeSummary td.colFirst{ - width:25%; +.memberSummary td.colSecond, .memberSummary th.colSecond, .memberSummary th.colConstructorName, +.typeSummary td.colFirst, .typeSummary th.colFirst { vertical-align:top; } -td.colOne a:link, td.colOne a:active, td.colOne a:visited, td.colOne a:hover, td.colFirst a:link, td.colFirst a:active, td.colFirst a:visited, td.colFirst a:hover, td.colLast a:link, td.colLast a:active, td.colLast a:visited, td.colLast a:hover, .constantValuesContainer td a:link, .constantValuesContainer td a:active, .constantValuesContainer td a:visited, .constantValuesContainer td a:hover { +.packagesSummary th.colLast, .packagesSummary td.colLast { + white-space:normal; +} +td.colFirst a:link, td.colFirst a:visited, +td.colSecond a:link, td.colSecond a:visited, +th.colFirst a:link, th.colFirst a:visited, +th.colSecond a:link, th.colSecond a:visited, +th.colConstructorName a:link, th.colConstructorName a:visited, +th.colDeprecatedItemName a:link, th.colDeprecatedItemName a:visited, +.constantValuesContainer td a:link, .constantValuesContainer td a:visited, +.allClassesContainer td a:link, .allClassesContainer td a:visited, +.allPackagesContainer td a:link, .allPackagesContainer td a:visited { font-weight:bold; } .tableSubHeadingColor { background-color:#EEEEFF; } -.altColor { +.altColor, .altColor th { background-color:#FFFFFF; } -.rowColor { +.rowColor, .rowColor th { background-color:#EEEEEF; } /* -Content styles -*/ + * Styles for contents. + */ .description pre { margin-top:0; } @@ -520,27 +625,22 @@ Content styles .docSummary { padding:0; } - ul.blockList ul.blockList ul.blockList li.blockList h3 { font-style:normal; } - div.block { font-size:14px; font-family:'DejaVu Serif', Georgia, "Times New Roman", Times, serif; } - td.colLast div { padding-top:0px; } - - td.colLast a { padding-bottom:3px; } /* -Formatting effect styles -*/ + * Styles for formatting effect. + */ .sourceLineNo { color:green; padding:0 30px 0 0; @@ -555,20 +655,252 @@ h1.hidden { margin:3px 10px 2px 0px; color:#474747; } -.deprecatedLabel, .descfrmTypeLabel, .memberNameLabel, .memberNameLink, -.overrideSpecifyLabel, .packageHierarchyLabel, .paramLabel, .returnLabel, -.seeLabel, .simpleTagLabel, .throwsLabel, .typeNameLabel, .typeNameLink { +.deprecatedLabel, .descfrmTypeLabel, .implementationLabel, .memberNameLabel, .memberNameLink, +.moduleLabelInPackage, .moduleLabelInType, .overrideSpecifyLabel, .packageLabelInType, +.packageHierarchyLabel, .paramLabel, .returnLabel, .seeLabel, .simpleTagLabel, +.throwsLabel, .typeNameLabel, .typeNameLink, .searchTagLink { font-weight:bold; } .deprecationComment, .emphasizedPhrase, .interfaceName { font-style:italic; } - -div.block div.block span.deprecationComment, div.block div.block span.emphasizedPhrase, +.deprecationBlock { + font-size:14px; + font-family:'DejaVu Serif', Georgia, "Times New Roman", Times, serif; + border-style:solid; + border-width:thin; + border-radius:10px; + padding:10px; + margin-bottom:10px; + margin-right:10px; + display:inline-block; +} +div.block div.deprecationComment, div.block div.block span.emphasizedPhrase, div.block div.block span.interfaceName { font-style:normal; } - -div.contentContainer ul.blockList li.blockList h2{ +div.contentContainer ul.blockList li.blockList h2 { padding-bottom:0px; } +/* + * Styles for IFRAME. + */ +.mainContainer { + margin:0 auto; + padding:0; + height:100%; + width:100%; + position:fixed; + top:0; + left:0; +} +.leftContainer { + height:100%; + position:fixed; + width:320px; +} +.leftTop { + position:relative; + float:left; + width:315px; + top:0; + left:0; + height:30%; + border-right:6px solid #ccc; + border-bottom:6px solid #ccc; +} +.leftBottom { + position:relative; + float:left; + width:315px; + bottom:0; + left:0; + height:70%; + border-right:6px solid #ccc; + border-top:1px solid #000; +} +.rightContainer { + position:absolute; + left:320px; + top:0; + bottom:0; + height:100%; + right:0; + border-left:1px solid #000; +} +.rightIframe { + margin:0; + padding:0; + height:100%; + right:30px; + width:100%; + overflow:visible; + margin-bottom:30px; +} +/* + * Styles specific to HTML5 elements. + */ +main, nav, header, footer, section { + display:block; +} +/* + * Styles for javadoc search. + */ +.ui-autocomplete-category { + font-weight:bold; + font-size:15px; + padding:7px 0 7px 3px; + background-color:#4D7A97; + color:#FFFFFF; +} +.resultItem { + font-size:13px; +} +.ui-autocomplete { + max-height:85%; + max-width:65%; + overflow-y:scroll; + overflow-x:scroll; + white-space:nowrap; + box-shadow: 0 3px 6px rgba(0,0,0,0.16), 0 3px 6px rgba(0,0,0,0.23); +} +ul.ui-autocomplete { + position:fixed; + z-index:999999; +} +ul.ui-autocomplete li { + float:left; + clear:both; + width:100%; +} +.resultHighlight { + font-weight:bold; +} +#search { + background-image:url('resources/glass.png'); + background-size:13px; + background-repeat:no-repeat; + background-position:2px 3px; + padding-left:20px; + position:relative; + right:-18px; +} +#reset { + background-color: rgb(255,255,255); + background-image:url('resources/x.png'); + background-position:center; + background-repeat:no-repeat; + background-size:12px; + border:0 none; + width:16px; + height:17px; + position:relative; + left:-4px; + top:-4px; + font-size:0px; +} +.watermark { + color:#545454; +} +.searchTagDescResult { + font-style:italic; + font-size:11px; +} +.searchTagHolderResult { + font-style:italic; + font-size:12px; +} +.searchTagResult:before, .searchTagResult:target { + color:red; +} +.moduleGraph span { + display:none; + position:absolute; +} +.moduleGraph:hover span { + display:block; + margin: -100px 0 0 100px; + z-index: 1; +} +.methodSignature { + white-space:normal; +} + +/* + * Styles for user-provided tables. + * + * borderless: + * No borders, vertical margins, styled caption. + * This style is provided for use with existing doc comments. + * In general, borderless tables should not be used for layout purposes. + * + * plain: + * Plain borders around table and cells, vertical margins, styled caption. + * Best for small tables or for complex tables for tables with cells that span + * rows and columns, when the "striped" style does not work well. + * + * striped: + * Borders around the table and vertical borders between cells, striped rows, + * vertical margins, styled caption. + * Best for tables that have a header row, and a body containing a series of simple rows. + */ + +table.borderless, +table.plain, +table.striped { + margin-top: 10px; + margin-bottom: 10px; +} +table.borderless > caption, +table.plain > caption, +table.striped > caption { + font-weight: bold; + font-size: smaller; +} +table.borderless th, table.borderless td, +table.plain th, table.plain td, +table.striped th, table.striped td { + padding: 2px 5px; +} +table.borderless, +table.borderless > thead > tr > th, table.borderless > tbody > tr > th, table.borderless > tr > th, +table.borderless > thead > tr > td, table.borderless > tbody > tr > td, table.borderless > tr > td { + border: none; +} +table.borderless > thead > tr, table.borderless > tbody > tr, table.borderless > tr { + background-color: transparent; +} +table.plain { + border-collapse: collapse; + border: 1px solid black; +} +table.plain > thead > tr, table.plain > tbody tr, table.plain > tr { + background-color: transparent; +} +table.plain > thead > tr > th, table.plain > tbody > tr > th, table.plain > tr > th, +table.plain > thead > tr > td, table.plain > tbody > tr > td, table.plain > tr > td { + border: 1px solid black; +} +table.striped { + border-collapse: collapse; + border: 1px solid black; +} +table.striped > thead { + background-color: #E3E3E3; +} +table.striped > thead > tr > th, table.striped > thead > tr > td { + border: 1px solid black; +} +table.striped > tbody > tr:nth-child(even) { + background-color: #EEE +} +table.striped > tbody > tr:nth-child(odd) { + background-color: #FFF +} +table.striped > tbody > tr > th, table.striped > tbody > tr > td { + border-left: 1px solid black; + border-right: 1px solid black; +} +table.striped > tbody > tr > th { + font-weight: normal; +} diff --git a/docs/api/type-search-index.js b/docs/api/type-search-index.js new file mode 100644 index 00000000..9cde2957 --- /dev/null +++ b/docs/api/type-search-index.js @@ -0,0 +1 @@ +typeSearchIndex = [{"p":"org.cicirello.permutations.distance","l":"AcyclicEdgeDistance"},{"l":"All Classes","url":"allclasses-index.html"},{"p":"org.cicirello.permutations.distance","l":"BlockInterchangeDistance"},{"p":"org.cicirello.util","l":"Copyable"},{"p":"org.cicirello.permutations.distance","l":"CyclicEdgeDistance"},{"p":"org.cicirello.permutations.distance","l":"CyclicIndependentDistance"},{"p":"org.cicirello.permutations.distance","l":"CyclicIndependentDistanceDouble"},{"p":"org.cicirello.permutations.distance","l":"CyclicReversalIndependentDistance"},{"p":"org.cicirello.permutations.distance","l":"CyclicReversalIndependentDistanceDouble"},{"p":"org.cicirello.permutations.distance","l":"CyclicRTypeDistance"},{"p":"org.cicirello.permutations.distance","l":"DeviationDistance"},{"p":"org.cicirello.permutations.distance","l":"DeviationDistanceNormalized"},{"p":"org.cicirello.permutations.distance","l":"DeviationDistanceNormalized2005"},{"p":"org.cicirello.permutations.distance","l":"EditDistance"},{"p":"org.cicirello.sequences.distance","l":"EditDistance"},{"p":"org.cicirello.permutations.distance","l":"ExactMatchDistance"},{"p":"org.cicirello.sequences.distance","l":"ExactMatchDistance"},{"p":"org.cicirello.permutations.distance","l":"InterchangeDistance"},{"p":"org.cicirello.math.la","l":"JacobiDiagonalization"},{"p":"org.cicirello.permutations.distance","l":"KendallTauDistance"},{"p":"org.cicirello.sequences.distance","l":"KendallTauSequenceDistance"},{"p":"org.cicirello.permutations.distance","l":"LeeDistance"},{"p":"org.cicirello.sequences.distance","l":"LongestCommonSubsequenceDistance"},{"p":"org.cicirello.math","l":"MathFunctions"},{"p":"org.cicirello.math.la","l":"MatrixOps"},{"p":"org.cicirello.permutations","l":"Permutation.Mechanic"},{"p":"org.cicirello.permutations.distance","l":"NormalizedPermutationDistanceMeasurer"},{"p":"org.cicirello.permutations.distance","l":"NormalizedPermutationDistanceMeasurerDouble"},{"p":"org.cicirello.permutations","l":"Permutation"},{"p":"org.cicirello.permutations.distance","l":"PermutationDistanceMeasurer"},{"p":"org.cicirello.permutations.distance","l":"PermutationDistanceMeasurerDouble"},{"p":"org.cicirello.permutations","l":"PermutationIterator"},{"p":"org.cicirello.math.rand","l":"RandomIndexer"},{"p":"org.cicirello.math.rand","l":"RandomVariates"},{"p":"org.cicirello.permutations.distance","l":"ReinsertionDistance"},{"p":"org.cicirello.permutations.distance","l":"ReversalDistance"},{"p":"org.cicirello.permutations.distance","l":"ReversalIndependentDistance"},{"p":"org.cicirello.permutations.distance","l":"ReversalIndependentDistanceDouble"},{"p":"org.cicirello.permutations.distance","l":"RTypeDistance"},{"p":"org.cicirello.permutations.distance","l":"ScrambleDistance"},{"p":"org.cicirello.sequences.distance","l":"SequenceDistanceMeasurer"},{"p":"org.cicirello.sequences.distance","l":"SequenceDistanceMeasurerDouble"},{"p":"org.cicirello.sequences","l":"SequenceSampler"},{"p":"org.cicirello.permutations.distance","l":"SquaredDeviationDistance"},{"p":"org.cicirello.math.stats","l":"Statistics"}] \ No newline at end of file diff --git a/docs/api/type-search-index.zip b/docs/api/type-search-index.zip new file mode 100644 index 00000000..7a4f8714 Binary files /dev/null and b/docs/api/type-search-index.zip differ diff --git a/docs/sitemap.xml b/docs/sitemap.xml index 0f3d3de9..a6cce202 100644 --- a/docs/sitemap.xml +++ b/docs/sitemap.xml @@ -6,330 +6,294 @@ https://jpt.cicirello.org/api/ -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 -https://jpt.cicirello.org/api/allclasses-frame.html -2020-07-22T13:05:04-04:00 +https://jpt.cicirello.org/api/allclasses- +2020-09-18T10:10:53-04:00 -https://jpt.cicirello.org/api/allclasses-noframe.html -2020-07-22T13:05:04-04:00 +https://jpt.cicirello.org/api/allclasses.html +2020-09-18T10:10:53-04:00 + + +https://jpt.cicirello.org/api/allpackages- +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/constant-values.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/deprecated-list.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/help-doc.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/index-all.html -2020-07-22T13:05:04-04:00 - - -https://jpt.cicirello.org/api/overview-frame.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/overview-summary.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:21:28-04:00 https://jpt.cicirello.org/api/overview-tree.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/serialized-form.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/math/MathFunctions.html -2020-07-22T13:05:04-04:00 - - -https://jpt.cicirello.org/api/org/cicirello/math/package-frame.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/math/package-summary.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/math/package-tree.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/Permutation.Mechanic.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/Permutation.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/PermutationIterator.html -2020-07-22T13:05:04-04:00 - - -https://jpt.cicirello.org/api/org/cicirello/permutations/package-frame.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/package-summary.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/package-tree.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/sequences/SequenceSampler.html -2020-07-22T13:05:04-04:00 - - -https://jpt.cicirello.org/api/org/cicirello/sequences/package-frame.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/sequences/package-summary.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/sequences/package-tree.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/util/Copyable.html -2020-07-22T13:05:04-04:00 - - -https://jpt.cicirello.org/api/org/cicirello/util/package-frame.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/util/package-summary.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/util/package-tree.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/math/la/JacobiDiagonalization.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/math/la/MatrixOps.html -2020-07-22T13:05:04-04:00 - - -https://jpt.cicirello.org/api/org/cicirello/math/la/package-frame.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/math/la/package-summary.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/math/la/package-tree.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/math/rand/RandomIndexer.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/math/rand/RandomVariates.html -2020-07-22T13:05:04-04:00 - - -https://jpt.cicirello.org/api/org/cicirello/math/rand/package-frame.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/math/rand/package-summary.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/math/rand/package-tree.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/math/stats/Statistics.html -2020-07-22T13:05:04-04:00 - - -https://jpt.cicirello.org/api/org/cicirello/math/stats/package-frame.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:21:28-04:00 https://jpt.cicirello.org/api/org/cicirello/math/stats/package-summary.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/math/stats/package-tree.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/AcyclicEdgeDistance.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/BlockInterchangeDistance.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/CyclicEdgeDistance.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/CyclicIndependentDistance.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/CyclicIndependentDistanceDouble.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/CyclicRTypeDistance.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/CyclicReversalIndependentDistance.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/CyclicReversalIndependentDistanceDouble.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/DeviationDistance.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/DeviationDistanceNormalized.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/DeviationDistanceNormalized2005.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/EditDistance.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/ExactMatchDistance.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/InterchangeDistance.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/KendallTauDistance.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/LeeDistance.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/NormalizedPermutationDistanceMeasurer.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/NormalizedPermutationDistanceMeasurerDouble.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/PermutationDistanceMeasurer.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/PermutationDistanceMeasurerDouble.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/RTypeDistance.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/ReinsertionDistance.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/ReversalDistance.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/ReversalIndependentDistance.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/ReversalIndependentDistanceDouble.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/ScrambleDistance.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/SquaredDeviationDistance.html -2020-07-22T13:05:04-04:00 - - -https://jpt.cicirello.org/api/org/cicirello/permutations/distance/package-frame.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/package-summary.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/permutations/distance/package-tree.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/sequences/distance/EditDistance.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/sequences/distance/ExactMatchDistance.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/sequences/distance/KendallTauSequenceDistance.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/sequences/distance/LongestCommonSubsequenceDistance.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/sequences/distance/SequenceDistanceMeasurer.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/sequences/distance/SequenceDistanceMeasurerDouble.html -2020-07-22T13:05:04-04:00 - - -https://jpt.cicirello.org/api/org/cicirello/sequences/distance/package-frame.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/sequences/distance/package-summary.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 https://jpt.cicirello.org/api/org/cicirello/sequences/distance/package-tree.html -2020-07-22T13:05:04-04:00 +2020-09-18T10:10:53-04:00 diff --git a/src/org/cicirello/math/stats/Statistics.java b/src/org/cicirello/math/stats/Statistics.java index 86b20131..0afcb576 100644 --- a/src/org/cicirello/math/stats/Statistics.java +++ b/src/org/cicirello/math/stats/Statistics.java @@ -1,5 +1,5 @@ /* - * Copyright 2018-2019 Vincent A. Cicirello, . + * Copyright 2018-2020 Vincent A. Cicirello, . * * This file is part of JavaPermutationTools (https://jpt.cicirello.org/). * @@ -27,8 +27,7 @@ * Utility class of basic statistics. * * @author Vincent A. Cicirello, https://www.cicirello.org/ - * @version 1.19.5.16 - * @since 1.0 + * @version 09-18-2020 */ public final class Statistics { @@ -308,9 +307,11 @@ public static Number[] tTestWelch(double[] data1, double[] data2) { double term2 = varianceSample(data2)/data2.length; double termSum = term1 + term2; double vDenom = term1*term1/(data1.length-1) + term2*term2/(data2.length-1); - double v = termSum*termSum/vDenom; - result[0] = new Double((mean(data1)-mean(data2)) / Math.sqrt(termSum)); - result[1] = new Integer((int)v); + double v = termSum*termSum/vDenom; + Double d = (mean(data1)-mean(data2)) / Math.sqrt(termSum); + result[0] = d; + Integer i = (int)v; + result[1] = i; return result; } @@ -332,9 +333,11 @@ public static Number[] tTestWelch(int[] data1, int[] data2) { double term2 = varianceSample(data2)/data2.length; double termSum = term1 + term2; double vDenom = term1*term1/(data1.length-1) + term2*term2/(data2.length-1); - double v = termSum*termSum/vDenom; - result[0] = new Double((mean(data1)-mean(data2)) / Math.sqrt(termSum)); - result[1] = new Integer((int)v); + double v = termSum*termSum/vDenom; + Double d = (mean(data1)-mean(data2)) / Math.sqrt(termSum); + result[0] = d; + Integer i = (int)v; + result[1] = i; return result; } }