From c95c2157abcef7465e026feb8bc6a60b4afbad97 Mon Sep 17 00:00:00 2001 From: micycle1 Date: Sat, 29 Jul 2023 16:58:49 +0000 Subject: [PATCH] =?UTF-8?q?Deploying=20to=20gh-pages=20from=20@=20micycle1?= =?UTF-8?q?/PGS@6505e70460af9c60c5a6997ca4d7dd1587a6cc5b=20=F0=9F=9A=80?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- allclasses-index.html | 533 - allclasses.html | 84 - allpackages-index.html | 179 - constant-values.html | 152 - deprecated-list.html | 199 - element-list | 2 - help-doc.html | 282 - index-all.html | 2274 ---- index.html | 175 - javadoc.sh | 1 + jquery-ui.overrides.css | 35 - jquery/external/jquery/jquery.js | 10872 --------------- jquery/jquery-3.6.0.min.js | 2 - jquery/jquery-ui.min.css | 6 - jquery/jquery-ui.min.js | 6 - jquery/jszip-utils/dist/jszip-utils-ie.js | 56 - jquery/jszip-utils/dist/jszip-utils-ie.min.js | 10 - jquery/jszip-utils/dist/jszip-utils.js | 118 - jquery/jszip-utils/dist/jszip-utils.min.js | 10 - jquery/jszip/dist/jszip.js | 11370 ---------------- jquery/jszip/dist/jszip.min.js | 13 - member-search-index.js | 1 - member-search-index.zip | Bin 6055 -> 0 bytes micycle/pgs/PGS_CirclePacking.html | 676 - .../pgs/PGS_Coloring.ColoringAlgorithm.html | 486 - micycle/pgs/PGS_Coloring.html | 525 - ...S_Construction.SierpinskiTriCurveType.html | 410 - micycle/pgs/PGS_Construction.html | 929 -- micycle/pgs/PGS_Contour.OffsetStyle.html | 398 - micycle/pgs/PGS_Contour.html | 656 - micycle/pgs/PGS_Conversion.html | 1280 -- micycle/pgs/PGS_Hull.html | 491 - micycle/pgs/PGS_Meshing.html | 603 - micycle/pgs/PGS_Morphology.html | 1092 -- micycle/pgs/PGS_Optimisation.html | 762 -- micycle/pgs/PGS_PointSet.html | 1261 -- micycle/pgs/PGS_Processing.html | 1058 -- micycle/pgs/PGS_SegmentSet.html | 736 - micycle/pgs/PGS_ShapeBoolean.html | 558 - micycle/pgs/PGS_ShapePredicates.html | 992 -- micycle/pgs/PGS_Tiling.html | 711 - micycle/pgs/PGS_Transformation.html | 919 -- micycle/pgs/PGS_Triangulation.html | 787 -- micycle/pgs/PGS_Voronoi.html | 464 - micycle/pgs/class-use/PGS_CirclePacking.html | 150 - .../PGS_Coloring.ColoringAlgorithm.html | 284 - micycle/pgs/class-use/PGS_Coloring.html | 150 - ...S_Construction.SierpinskiTriCurveType.html | 226 - micycle/pgs/class-use/PGS_Construction.html | 150 - .../class-use/PGS_Contour.OffsetStyle.html | 256 - micycle/pgs/class-use/PGS_Contour.html | 150 - micycle/pgs/class-use/PGS_Conversion.html | 150 - micycle/pgs/class-use/PGS_Hull.html | 150 - micycle/pgs/class-use/PGS_Meshing.html | 150 - micycle/pgs/class-use/PGS_Morphology.html | 150 - micycle/pgs/class-use/PGS_Optimisation.html | 150 - micycle/pgs/class-use/PGS_PointSet.html | 150 - micycle/pgs/class-use/PGS_Processing.html | 150 - micycle/pgs/class-use/PGS_SegmentSet.html | 150 - micycle/pgs/class-use/PGS_ShapeBoolean.html | 150 - .../pgs/class-use/PGS_ShapePredicates.html | 150 - micycle/pgs/class-use/PGS_Tiling.html | 150 - micycle/pgs/class-use/PGS_Transformation.html | 150 - micycle/pgs/class-use/PGS_Triangulation.html | 150 - micycle/pgs/class-use/PGS_Voronoi.html | 150 - micycle/pgs/commons/ChaikinCut.html | 279 - micycle/pgs/commons/ClosestPointPair.html | 339 - micycle/pgs/commons/CornerRounding.html | 281 - .../pgs/commons/DiscreteCurveEvolution.html | 344 - micycle/pgs/commons/DoyleSpiral.html | 336 - micycle/pgs/commons/FarthestPointPair.html | 358 - micycle/pgs/commons/FastAtan2.html | 307 - micycle/pgs/commons/FastPolygonizer.html | 291 - micycle/pgs/commons/FrontChainPacker.html | 376 - .../pgs/commons/GaussianLineSmoothing.html | 313 - micycle/pgs/commons/GeneticColoring.html | 389 - micycle/pgs/commons/HatchTiling.html | 348 - .../commons/IncrementalTinDual.DualEdge.html | 350 - micycle/pgs/commons/IncrementalTinDual.html | 426 - .../commons/MaximumInscribedAARectangle.html | 325 - .../pgs/commons/MaximumInscribedCircles.html | 335 - .../commons/MaximumInscribedRectangle.html | 321 - .../pgs/commons/MinimumBoundingEllipse.html | 380 - .../pgs/commons/MinimumBoundingTriangle.html | 352 - micycle/pgs/commons/Nullable.html | 252 - micycle/pgs/commons/PEdge.html | 500 - micycle/pgs/commons/PenroseTiling.html | 342 - micycle/pgs/commons/PoissonDistribution.html | 395 - .../pgs/commons/PoissonDistributionJRUS.html | 461 - micycle/pgs/commons/PolygonDecomposition.html | 282 - micycle/pgs/commons/RLFColoring.html | 366 - micycle/pgs/commons/RandomPolygon.html | 278 - .../pgs/commons/RectangularSubdivision.html | 345 - micycle/pgs/commons/RepulsionCirclePack.html | 348 - .../SeededRandomPointsInGridBuilder.html | 436 - micycle/pgs/commons/ShapeInterpolation.html | 330 - .../pgs/commons/SpiralQuadrangulation.html | 328 - micycle/pgs/commons/SquareTriangleTiling.html | 332 - micycle/pgs/commons/Star.html | 296 - micycle/pgs/commons/TangencyPack.html | 411 - micycle/pgs/commons/TriangleSubdivision.html | 320 - micycle/pgs/commons/class-use/ChaikinCut.html | 150 - .../commons/class-use/ClosestPointPair.html | 150 - .../pgs/commons/class-use/CornerRounding.html | 150 - .../class-use/DiscreteCurveEvolution.html | 150 - .../pgs/commons/class-use/DoyleSpiral.html | 150 - .../commons/class-use/FarthestPointPair.html | 150 - micycle/pgs/commons/class-use/FastAtan2.html | 150 - .../commons/class-use/FastPolygonizer.html | 150 - .../commons/class-use/FrontChainPacker.html | 150 - .../class-use/GaussianLineSmoothing.html | 150 - .../commons/class-use/GeneticColoring.html | 150 - .../pgs/commons/class-use/HatchTiling.html | 150 - .../IncrementalTinDual.DualEdge.html | 207 - .../commons/class-use/IncrementalTinDual.html | 150 - .../MaximumInscribedAARectangle.html | 150 - .../class-use/MaximumInscribedCircles.html | 150 - .../class-use/MaximumInscribedRectangle.html | 150 - .../class-use/MinimumBoundingEllipse.html | 150 - .../class-use/MinimumBoundingTriangle.html | 150 - micycle/pgs/commons/class-use/Nullable.html | 269 - micycle/pgs/commons/class-use/PEdge.html | 451 - .../pgs/commons/class-use/PenroseTiling.html | 150 - .../class-use/PoissonDistribution.html | 150 - .../class-use/PoissonDistributionJRUS.html | 150 - .../class-use/PolygonDecomposition.html | 150 - .../pgs/commons/class-use/RLFColoring.html | 150 - .../pgs/commons/class-use/RandomPolygon.html | 150 - .../class-use/RectangularSubdivision.html | 150 - .../class-use/RepulsionCirclePack.html | 150 - .../SeededRandomPointsInGridBuilder.html | 150 - .../commons/class-use/ShapeInterpolation.html | 150 - .../class-use/SpiralQuadrangulation.html | 150 - .../class-use/SquareTriangleTiling.html | 150 - micycle/pgs/commons/class-use/Star.html | 150 - .../pgs/commons/class-use/TangencyPack.html | 150 - .../class-use/TriangleSubdivision.html | 150 - micycle/pgs/commons/package-summary.html | 412 - micycle/pgs/commons/package-tree.html | 213 - micycle/pgs/commons/package-use.html | 229 - micycle/pgs/package-summary.html | 339 - micycle/pgs/package-tree.html | 198 - micycle/pgs/package-use.html | 201 - options | 29 + overview-summary.html | 23 - overview-tree.html | 248 - package-search-index.js | 1 - package-search-index.zip | Bin 236 -> 0 bytes resources/glass.png | Bin 499 -> 0 bytes resources/x.png | Bin 394 -> 0 bytes script.js | 149 - search.js | 326 - stylesheet.css | 910 -- type-search-index.js | 1 - type-search-index.zip | Bin 774 -> 0 bytes 155 files changed, 30 insertions(+), 67238 deletions(-) delete mode 100644 allclasses-index.html delete mode 100644 allclasses.html delete mode 100644 allpackages-index.html delete mode 100644 constant-values.html delete mode 100644 deprecated-list.html delete mode 100644 element-list delete mode 100644 help-doc.html delete mode 100644 index-all.html delete mode 100644 index.html create mode 100755 javadoc.sh delete mode 100644 jquery-ui.overrides.css delete mode 100644 jquery/external/jquery/jquery.js delete mode 100644 jquery/jquery-3.6.0.min.js delete mode 100644 jquery/jquery-ui.min.css delete mode 100644 jquery/jquery-ui.min.js delete mode 100644 jquery/jszip-utils/dist/jszip-utils-ie.js delete mode 100644 jquery/jszip-utils/dist/jszip-utils-ie.min.js delete mode 100644 jquery/jszip-utils/dist/jszip-utils.js delete mode 100644 jquery/jszip-utils/dist/jszip-utils.min.js delete mode 100644 jquery/jszip/dist/jszip.js delete mode 100644 jquery/jszip/dist/jszip.min.js delete mode 100644 member-search-index.js delete mode 100644 member-search-index.zip delete mode 100644 micycle/pgs/PGS_CirclePacking.html delete mode 100644 micycle/pgs/PGS_Coloring.ColoringAlgorithm.html delete mode 100644 micycle/pgs/PGS_Coloring.html delete mode 100644 micycle/pgs/PGS_Construction.SierpinskiTriCurveType.html delete mode 100644 micycle/pgs/PGS_Construction.html delete mode 100644 micycle/pgs/PGS_Contour.OffsetStyle.html delete mode 100644 micycle/pgs/PGS_Contour.html delete mode 100644 micycle/pgs/PGS_Conversion.html delete mode 100644 micycle/pgs/PGS_Hull.html delete mode 100644 micycle/pgs/PGS_Meshing.html delete mode 100644 micycle/pgs/PGS_Morphology.html delete mode 100644 micycle/pgs/PGS_Optimisation.html delete mode 100644 micycle/pgs/PGS_PointSet.html delete mode 100644 micycle/pgs/PGS_Processing.html delete mode 100644 micycle/pgs/PGS_SegmentSet.html delete mode 100644 micycle/pgs/PGS_ShapeBoolean.html delete mode 100644 micycle/pgs/PGS_ShapePredicates.html delete mode 100644 micycle/pgs/PGS_Tiling.html delete mode 100644 micycle/pgs/PGS_Transformation.html delete mode 100644 micycle/pgs/PGS_Triangulation.html delete mode 100644 micycle/pgs/PGS_Voronoi.html delete mode 100644 micycle/pgs/class-use/PGS_CirclePacking.html delete mode 100644 micycle/pgs/class-use/PGS_Coloring.ColoringAlgorithm.html delete mode 100644 micycle/pgs/class-use/PGS_Coloring.html delete mode 100644 micycle/pgs/class-use/PGS_Construction.SierpinskiTriCurveType.html delete mode 100644 micycle/pgs/class-use/PGS_Construction.html delete mode 100644 micycle/pgs/class-use/PGS_Contour.OffsetStyle.html delete mode 100644 micycle/pgs/class-use/PGS_Contour.html delete mode 100644 micycle/pgs/class-use/PGS_Conversion.html delete mode 100644 micycle/pgs/class-use/PGS_Hull.html delete mode 100644 micycle/pgs/class-use/PGS_Meshing.html delete mode 100644 micycle/pgs/class-use/PGS_Morphology.html delete mode 100644 micycle/pgs/class-use/PGS_Optimisation.html delete mode 100644 micycle/pgs/class-use/PGS_PointSet.html delete mode 100644 micycle/pgs/class-use/PGS_Processing.html delete mode 100644 micycle/pgs/class-use/PGS_SegmentSet.html delete mode 100644 micycle/pgs/class-use/PGS_ShapeBoolean.html delete mode 100644 micycle/pgs/class-use/PGS_ShapePredicates.html delete mode 100644 micycle/pgs/class-use/PGS_Tiling.html delete mode 100644 micycle/pgs/class-use/PGS_Transformation.html delete mode 100644 micycle/pgs/class-use/PGS_Triangulation.html delete mode 100644 micycle/pgs/class-use/PGS_Voronoi.html delete mode 100644 micycle/pgs/commons/ChaikinCut.html delete mode 100644 micycle/pgs/commons/ClosestPointPair.html delete mode 100644 micycle/pgs/commons/CornerRounding.html delete mode 100644 micycle/pgs/commons/DiscreteCurveEvolution.html delete mode 100644 micycle/pgs/commons/DoyleSpiral.html delete mode 100644 micycle/pgs/commons/FarthestPointPair.html delete mode 100644 micycle/pgs/commons/FastAtan2.html delete mode 100644 micycle/pgs/commons/FastPolygonizer.html delete mode 100644 micycle/pgs/commons/FrontChainPacker.html delete mode 100644 micycle/pgs/commons/GaussianLineSmoothing.html delete mode 100644 micycle/pgs/commons/GeneticColoring.html delete mode 100644 micycle/pgs/commons/HatchTiling.html delete mode 100644 micycle/pgs/commons/IncrementalTinDual.DualEdge.html delete mode 100644 micycle/pgs/commons/IncrementalTinDual.html delete mode 100644 micycle/pgs/commons/MaximumInscribedAARectangle.html delete mode 100644 micycle/pgs/commons/MaximumInscribedCircles.html delete mode 100644 micycle/pgs/commons/MaximumInscribedRectangle.html delete mode 100644 micycle/pgs/commons/MinimumBoundingEllipse.html delete mode 100644 micycle/pgs/commons/MinimumBoundingTriangle.html delete mode 100644 micycle/pgs/commons/Nullable.html delete mode 100644 micycle/pgs/commons/PEdge.html delete mode 100644 micycle/pgs/commons/PenroseTiling.html delete mode 100644 micycle/pgs/commons/PoissonDistribution.html delete mode 100644 micycle/pgs/commons/PoissonDistributionJRUS.html delete mode 100644 micycle/pgs/commons/PolygonDecomposition.html delete mode 100644 micycle/pgs/commons/RLFColoring.html delete mode 100644 micycle/pgs/commons/RandomPolygon.html delete mode 100644 micycle/pgs/commons/RectangularSubdivision.html delete mode 100644 micycle/pgs/commons/RepulsionCirclePack.html delete mode 100644 micycle/pgs/commons/SeededRandomPointsInGridBuilder.html delete mode 100644 micycle/pgs/commons/ShapeInterpolation.html delete mode 100644 micycle/pgs/commons/SpiralQuadrangulation.html delete mode 100644 micycle/pgs/commons/SquareTriangleTiling.html delete mode 100644 micycle/pgs/commons/Star.html delete mode 100644 micycle/pgs/commons/TangencyPack.html delete mode 100644 micycle/pgs/commons/TriangleSubdivision.html delete mode 100644 micycle/pgs/commons/class-use/ChaikinCut.html delete mode 100644 micycle/pgs/commons/class-use/ClosestPointPair.html delete mode 100644 micycle/pgs/commons/class-use/CornerRounding.html delete mode 100644 micycle/pgs/commons/class-use/DiscreteCurveEvolution.html delete mode 100644 micycle/pgs/commons/class-use/DoyleSpiral.html delete mode 100644 micycle/pgs/commons/class-use/FarthestPointPair.html delete mode 100644 micycle/pgs/commons/class-use/FastAtan2.html delete mode 100644 micycle/pgs/commons/class-use/FastPolygonizer.html delete mode 100644 micycle/pgs/commons/class-use/FrontChainPacker.html delete mode 100644 micycle/pgs/commons/class-use/GaussianLineSmoothing.html delete mode 100644 micycle/pgs/commons/class-use/GeneticColoring.html delete mode 100644 micycle/pgs/commons/class-use/HatchTiling.html delete mode 100644 micycle/pgs/commons/class-use/IncrementalTinDual.DualEdge.html delete mode 100644 micycle/pgs/commons/class-use/IncrementalTinDual.html delete mode 100644 micycle/pgs/commons/class-use/MaximumInscribedAARectangle.html delete mode 100644 micycle/pgs/commons/class-use/MaximumInscribedCircles.html delete mode 100644 micycle/pgs/commons/class-use/MaximumInscribedRectangle.html delete mode 100644 micycle/pgs/commons/class-use/MinimumBoundingEllipse.html delete mode 100644 micycle/pgs/commons/class-use/MinimumBoundingTriangle.html delete mode 100644 micycle/pgs/commons/class-use/Nullable.html delete mode 100644 micycle/pgs/commons/class-use/PEdge.html delete mode 100644 micycle/pgs/commons/class-use/PenroseTiling.html delete mode 100644 micycle/pgs/commons/class-use/PoissonDistribution.html delete mode 100644 micycle/pgs/commons/class-use/PoissonDistributionJRUS.html delete mode 100644 micycle/pgs/commons/class-use/PolygonDecomposition.html delete mode 100644 micycle/pgs/commons/class-use/RLFColoring.html delete mode 100644 micycle/pgs/commons/class-use/RandomPolygon.html delete mode 100644 micycle/pgs/commons/class-use/RectangularSubdivision.html delete mode 100644 micycle/pgs/commons/class-use/RepulsionCirclePack.html delete mode 100644 micycle/pgs/commons/class-use/SeededRandomPointsInGridBuilder.html delete mode 100644 micycle/pgs/commons/class-use/ShapeInterpolation.html delete mode 100644 micycle/pgs/commons/class-use/SpiralQuadrangulation.html delete mode 100644 micycle/pgs/commons/class-use/SquareTriangleTiling.html delete mode 100644 micycle/pgs/commons/class-use/Star.html delete mode 100644 micycle/pgs/commons/class-use/TangencyPack.html delete mode 100644 micycle/pgs/commons/class-use/TriangleSubdivision.html delete mode 100644 micycle/pgs/commons/package-summary.html delete mode 100644 micycle/pgs/commons/package-tree.html delete mode 100644 micycle/pgs/commons/package-use.html delete mode 100644 micycle/pgs/package-summary.html delete mode 100644 micycle/pgs/package-tree.html delete mode 100644 micycle/pgs/package-use.html create mode 100644 options delete mode 100644 overview-summary.html delete mode 100644 overview-tree.html delete mode 100644 package-search-index.js delete mode 100644 package-search-index.zip delete mode 100644 resources/glass.png delete mode 100644 resources/x.png delete mode 100644 script.js delete mode 100644 search.js delete mode 100644 stylesheet.css delete mode 100644 type-search-index.js delete mode 100644 type-search-index.zip diff --git a/allclasses-index.html b/allclasses-index.html deleted file mode 100644 index 532759ee..00000000 --- a/allclasses-index.html +++ /dev/null @@ -1,533 +0,0 @@ - - - - - -All Classes (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

All Classes

-
-
-
    -
  • - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    All Classes Class Summary Enum Summary Annotation Types Summary 
    ClassDescription
    ChaikinCut -
    Chaikin’s corner-cutting algorithm, which is used to perform polygon - smoothing.
    -
    ClosestPointPair -
    An implementation of a divide-and-conquer algorithm for computing the closest - pair of elements of a set of points.
    -
    CornerRounding -
    Corner rounding for PShape polygons.
    -
    DiscreteCurveEvolution -
    Convexity Rule for Shape Decomposition Based on Discrete Contour Evolution.
    -
    DoyleSpiral -
    Doyle spirals are patterns of non-crossing circles in the plane, each tangent - to six others.
    -
    FarthestPointPair -
    The FarthestPair data type computes the farthest pair of points in a - set of n points in the plane and provides accessor methods for - getting the farthest pair of points and the distance between them.
    -
    FastAtan2 -
    Fast, high-quality polynomial-based atan2 approximation.
    -
    FastPolygonizer -
    This class solves the problem of finding polygons formed by a collection of - edges.
    -
    FrontChainPacker -
    Circle packing of rectangle boundaries using the front-chain packing - algorithm from 'Visualization of Large Hierarchical Data by Circle Packing'.
    -
    GaussianLineSmoothing -
    Line gaussian smoothing.
    -
    GeneticColoring<V,​E> -
    Finds a solution to a graph coloring using a genetic algorithm.
    -
    HatchTiling -
    Port of https://openprocessing.org/sketch/1523350/
    -
    IncrementalTinDual -
    Produces a (barycentric) dual graph from a TinFour Delaunay Triangulation.
    -
    MaximumInscribedAARectangle -
    Computes the largest inscribed axis-aligned rectangle within a convex hull.
    -
    MaximumInscribedCircles -
    An bespoke version of - MaximumInscribedCircle to find N largest maximum inscribed circles in an - optimised manner.
    -
    MaximumInscribedRectangle -
    Finds an approximate largest area rectangle of arbitrary orientation in a - polygon via particle swarm optimisation.
    -
    MinimumBoundingEllipse -
    Minimum Volume Enclosing Ellipsoid
    -
    MinimumBoundingTriangle -
    Computes the Minimum Bounding Triangle (MBT) for the points in a Geometry.
    -
    Nullable -
    An element annotated with Nullable claims null value is - perfectly valid to return (for methods), pass to (parameters) and - hold (local variables and fields).
    -
    PEdge -
    An undirected edge / line segment joining 2 PVectors.
    -
    PenroseTiling -
    Generates a Penrose tiling of the plane.
    -
    PGS_CirclePacking -
    Circle packings of shapes, subject to varying constraints and patterns of - tangencies.
    -
    PGS_Coloring -
    Intelligently color meshes (or mesh-like shapes) such that no two adjacent - faces have the same color, while minimising the number of colors used.
    -
    PGS_Coloring.ColoringAlgorithm -
    Specifies the algorithm/heuristic used by the underlying graph coloring process to find - a coloring for mesh faces.
    -
    PGS_Construction -
    Construct uncommon/interesting 2D geometries.
    -
    PGS_Construction.SierpinskiTriCurveType 
    PGS_Contour -
    Methods for producing different kinds of shape contours.
    -
    PGS_Contour.OffsetStyle -
    Specifies the join style for offset curves.
    -
    PGS_Conversion -
    Conversion between Processing PShapes and JTS - Geometries (amongst other formats).
    -
    PGS_Hull -
    Convex and concave hulls (amongst other variations) of polygons and point - sets.
    -
    PGS_Meshing -
    Mesh generation (excluding triangulation).
    -
    PGS_Morphology -
    Methods that affect the geometry or topology of shapes.
    -
    PGS_Optimisation -
    Solve geometric optimisation problems, such as bounding volumes, inscribed - areas, optimal distances, etc.
    -
    PGS_PointSet -
    Generation of random sets of 2D points having a variety of different - distributions and constraints (and associated functions).
    -
    PGS_Processing -
    Geometry Processing -- methods that process a shape in some way: compute - hulls, partition, slice, etc.
    -
    PGS_SegmentSet -
    Generation of random sets of non-intersecting line segments (and - associated functions).
    -
    PGS_ShapeBoolean -
    Boolean set-operations for 2D shapes.
    -
    PGS_ShapePredicates -
    Various shape metrics & predicates
    -
    PGS_Tiling -
    Tiling, tessellation and subdivision of the plane using periodic or - non-periodic geometric shapes.
    -
    PGS_Transformation -
    Various geometric and affine transformations for PShapes that affect vertex - coordinates.
    -
    PGS_Triangulation -
    Delaunay and earcut triangulation of shapes and point sets.
    -
    PGS_Voronoi -
    Voronoi Diagrams of shapes and point sets.
    -
    PoissonDistributionDeprecated. -
    in favour of PoissonDistributionJRUS
    -
    PoissonDistributionJRUS -
    Generates sets of random points via Poisson Disk Sampling.
    -
    PolygonDecomposition -
    Implementation of the Bayazit convex decomposition algorithm for simple - polygons.
    -
    RandomPolygon -
    Random Convex Polygons
    -
    RectangularSubdivision -
    Random rectangle subdivision.
    -
    RepulsionCirclePack -
    Repulsion Packing attempts to arrange a set of circles of specified radii - within a rectangle such that there is no-overlap between circles.
    -
    RLFColoring<V,​E> -
    The Recursive Largest First (RLF) algorithm for graph coloring.
    -
    SeededRandomPointsInGridBuilder -
    An extension to the - RandomPointsInGridBuilder class that accepts a random seed for repeatable - outputs.
    -
    ShapeInterpolation -
    Best-guess interpolation between any two linear rings.
    -
    SpiralQuadrangulation -
    Quadrangulations of Planar Point Sets via the Spiraling Rotating Calipers - Algorithm.
    -
    SquareTriangleTiling -
    A non-periodic (quasiperiodic?) tiling, comprising squares and equilateral - triangles.
    -
    Star -
    Methods to create star shapes
    -
    TangencyPack -
    Implements a circle packing algorithm described by Collins and Stephenson - (2003) to find an arrangement of circles which corresponds to a graph of - desired circle tangencies.
    -
    TriangleSubdivision -
    Balanced triangle subdivision.
    -
    -
    • -
-
-
- - - diff --git a/allclasses.html b/allclasses.html deleted file mode 100644 index 19b18d52..00000000 --- a/allclasses.html +++ /dev/null @@ -1,84 +0,0 @@ - - - - - -All Classes (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - -

All Classes

-
- -
- - diff --git a/allpackages-index.html b/allpackages-index.html deleted file mode 100644 index 4b6e6883..00000000 --- a/allpackages-index.html +++ /dev/null @@ -1,179 +0,0 @@ - - - - - -All Packages (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

All Packages

-
-
-
    -
  • - - - - - - - - - - - - - - - - -
    Package Summary 
    PackageDescription
    micycle.pgs -
    Processing Geometry Suite is a software project that provides easy access to - geometric algorithms in the form of a Processing library.
    -
    micycle.pgs.commons -
    The commons package contains all non-core PGS classes (of varying authorship - and either not worth putting in separate package or too long to include - within the calling PGS method itself).
    -
    -
    • -
-
-
- - - diff --git a/constant-values.html b/constant-values.html deleted file mode 100644 index 44c18f83..00000000 --- a/constant-values.html +++ /dev/null @@ -1,152 +0,0 @@ - - - - - -Constant Field Values (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Constant Field Values

-
-

Contents

-
-
-
- - - diff --git a/deprecated-list.html b/deprecated-list.html deleted file mode 100644 index cfac2f4d..00000000 --- a/deprecated-list.html +++ /dev/null @@ -1,199 +0,0 @@ - - - - - -Deprecated List (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Deprecated API

-

Contents

- -
-
- - - - - - - -
-
- - - diff --git a/element-list b/element-list deleted file mode 100644 index dff1d30f..00000000 --- a/element-list +++ /dev/null @@ -1,2 +0,0 @@ -micycle.pgs -micycle.pgs.commons diff --git a/help-doc.html b/help-doc.html deleted file mode 100644 index 5ba553c5..00000000 --- a/help-doc.html +++ /dev/null @@ -1,282 +0,0 @@ - - - - - -API Help (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

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.
-
-
-
    -
  • -
    -

    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.

    -
    -
    • -
  • -
    -

    Package

    -

    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
      • -
    • Classes
      • -
    • Enums
      • -
    • Exceptions
      • -
    • Errors
      • -
    • Annotation Types
      • -
    -
    -
    • -
  • -
    -

    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
      • -
    • Direct Subclasses
      • -
    • All Known Subinterfaces
      • -
    • All Known Implementing Classes
      • -
    • 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
      • -
    • 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 Constant Summary
      • -
    • Enum Constant Detail
      • -
    -
    -
    • -
  • -
    -

    Use

    -

    Each documented package, class and interface has its own Use page. This page describes what packages, classes, methods, constructors and fields use any part of the given class or package. Given a class or interface A, its "Use" page includes subclasses of A, fields declared as A, methods that return A, and methods and constructors with parameters of type A. You can access this page by first going to the package, class or interface, then clicking on the "Use" link in the navigation bar.

    -
    -
    • -
  • -
    -

    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. 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 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 index of all classes, interfaces, constructors, methods, and fields, as well as lists of all packages and all classes.

    -
    -
    • -
  • -
    -

    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 by the standard doclet.
-
- - - diff --git a/index-all.html b/index-all.html deleted file mode 100644 index 1b4dfaed..00000000 --- a/index-all.html +++ /dev/null @@ -1,2274 +0,0 @@ - - - - - -Index (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
A B C D E F G H I L M N O P Q R S T U V W 
All Classes All Packages - - -

A

-
-
a - Variable in class micycle.pgs.commons.IncrementalTinDual.DualEdge
-
 
-
a - Variable in class micycle.pgs.commons.PEdge
-
 
-
area(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Computes the area of the given shape.
-
-
atan2(double, double) - Static method in class micycle.pgs.commons.FastAtan2
-
-
Maximum absolute error of ~0.00085 rad (~0.049º).
-
-
atan2(float, float) - Static method in class micycle.pgs.commons.FastAtan2
-
-
Maximum absolute error of 0.0015 rad (0.086º).
-
-
- - - -

B

-
-
b - Variable in class micycle.pgs.commons.IncrementalTinDual.DualEdge
-
 
-
b - Variable in class micycle.pgs.commons.PEdge
-
 
-
BEVEL - micycle.pgs.PGS_Contour.OffsetStyle
-
 
-
buffer(PShape, double) - Static method in class micycle.pgs.PGS_Morphology
-
-
Computes a rounded buffer area around the shape, having the given buffer - width.
-
-
buffer(PShape, double, PGS_Contour.OffsetStyle) - Static method in class micycle.pgs.PGS_Morphology
-
-
Computes a buffer area around the shape, having the given buffer width and - buffer style (either round, miter, bevel).
-
-
- - - -

C

-
-
centroid(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Computes the centroid of a shape.
-
-
centroidQuadrangulation(IIncrementalTin, boolean) - Static method in class micycle.pgs.PGS_Meshing
-
-
Generates a quadrangulation from a triangulation by "inverting" triangles - (for each triangle, create edges joining its centroid to each of its - vertices).
-
-
chaikin(PShape, float, int) - Static method in class micycle.pgs.commons.ChaikinCut
-
 
-
chaikinCut(PShape, double, int) - Static method in class micycle.pgs.PGS_Morphology
-
-
Smoothes a shape via iterated corner cutting (chaikin cutting).
-
-
ChaikinCut - Class in micycle.pgs.commons
-
-
Chaikin’s corner-cutting algorithm, which is used to perform polygon - smoothing.
-
-
chordalAxis(PShape) - Static method in class micycle.pgs.PGS_Contour
-
-
Computes the chordal axis of a shape, which provides a characterization of - the skeleton of a shape.
-
-
circularity(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Calculates the Miller circularity index for a shape.
-
-
cleanCoverage(PShape, double, double) - Static method in class micycle.pgs.PGS_Processing
-
-
Removes gaps and overlaps from meshes/polygon collections that are intended - to satisfy the following conditions: - - Vector-clean - edges between neighbouring polygons must either be - identical or intersect only at endpoints. - Non-overlapping - No two polygons may overlap.
-
-
closestPoint(PShape, PVector) - Static method in class micycle.pgs.PGS_Optimisation
-
-
Returns the nearest point of the shape to the given point.
-
-
closestPointPair(Collection<PVector>) - Static method in class micycle.pgs.PGS_Optimisation
-
-
Computes the closest pair of points in a set of points.
-
-
ClosestPointPair - Class in micycle.pgs.commons
-
-
An implementation of a divide-and-conquer algorithm for computing the closest - pair of elements of a set of points.
-
-
ClosestPointPair(Collection<PVector>) - Constructor for class micycle.pgs.commons.ClosestPointPair
-
-
Construct an instance of the algorithm for the specified point Collection.
-
-
closestPoints(PShape, PVector) - Static method in class micycle.pgs.PGS_Optimisation
-
-
Returns the nearest point for each "island" / separate polygon in the GROUP - input shape.
-
-
COARSE - micycle.pgs.PGS_Coloring.ColoringAlgorithm
-
-
Finds the coarsest coloring of a graph.
-
-
colorMesh(Collection<PShape>, PGS_Coloring.ColoringAlgorithm) - Static method in class micycle.pgs.PGS_Coloring
-
-
Computes a coloring of the given mesh shape, returning a color class for each - mesh face.
-
-
colorMesh(PShape, PGS_Coloring.ColoringAlgorithm) - Static method in class micycle.pgs.PGS_Coloring
-
-
Computes a coloring of the given mesh shape, returning a color class for each - mesh face.
-
-
colorMesh(PShape, PGS_Coloring.ColoringAlgorithm, int[]) - Static method in class micycle.pgs.PGS_Coloring
-
-
Computes a coloring of the given mesh shape and colors its faces using the - colors provided.
-
-
colorMesh(PShape, PGS_Coloring.ColoringAlgorithm, String[]) - Static method in class micycle.pgs.PGS_Coloring
-
-
Computes a coloring of the given mesh shape and colors its faces using the - colors provided.
-
-
colorNonMesh(PShape, PGS_Coloring.ColoringAlgorithm) - Static method in class micycle.pgs.PGS_Coloring
-
-
Computes a coloring of the given non-conforming mesh shape, returning a color - class for each face of the pre-processed (noded) mesh.
-
-
colorNonMesh(PShape, PGS_Coloring.ColoringAlgorithm, int[]) - Static method in class micycle.pgs.PGS_Coloring
-
-
Computes a coloring of the given non-conforming mesh shape and colors the - faces of its noded representation using the colors provided.
-
-
colorNonMesh(PShape, PGS_Coloring.ColoringAlgorithm, String[]) - Static method in class micycle.pgs.PGS_Coloring
-
-
Computes a coloring of the given non-conforming mesh shape and colors the - faces of its noded representation using the colors provided.
-
-
complement(PShape, double, double) - Static method in class micycle.pgs.PGS_ShapeBoolean
-
-
Computes the shape's complement (or inverse) against a plane having the given - dimensions.
-
-
compoundVoronoi(PShape) - Static method in class micycle.pgs.PGS_Voronoi
-
-
Generates a Voronoi diagram for a set of disjoint shapes.
-
-
compoundVoronoi(PShape, double[]) - Static method in class micycle.pgs.PGS_Voronoi
-
-
Generates a Voronoi diagram for a set of disjoint shapes.
-
-
computeMIR() - Method in class micycle.pgs.commons.MaximumInscribedRectangle
-
-
Computes the Returns the
-
-
concaveHull(PShape, double, boolean) - Static method in class micycle.pgs.PGS_Hull
-
-
Constructs a concave hull of a set of polygons, respecting the polygons as - constraints (i.e.
-
-
concaveHullBFS(List<PVector>, double) - Static method in class micycle.pgs.PGS_Hull
-
-
Computes the concave hull of a point set using a breadth-first method.
-
-
concaveHullBFS2(List<PVector>, double) - Static method in class micycle.pgs.PGS_Hull
-
-
Computes the concave hull of a point set using a different algorithm.
-
-
concaveHullDFS(List<PVector>, double) - Static method in class micycle.pgs.PGS_Hull
-
-
Computes the concave hull of a point set using a depth-first method.
-
-
contains(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Determines whether the outer shape contains the inner shape (meaning every - point of the inner shape is a point of the outer shape).
-
-
containsAllPoints(PShape, Collection<PVector>) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Determines whether a shape contains every point from a list of points.
-
-
containsPoint(PShape, PVector) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Determines whether a shape contains a point.
-
-
containsPoints(PShape, Collection<PVector>) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Measures for each point in the input whether it is contained in the given - shape.
-
-
convexHull(Collection<PVector>) - Static method in class micycle.pgs.PGS_Hull
-
-
Computes the convex hull of a point set (the smallest convex polygon that - contains all the points).
-
-
convexHull(PShape) - Static method in class micycle.pgs.PGS_Hull
-
-
Computes the convex hull of the vertices from the input shape (the smallest - convex polygon that contains all the shape's vertices).
-
-
convexPartition(PShape) - Static method in class micycle.pgs.PGS_Processing
-
-
Partitions a shape into simple convex polygons.
-
-
copy() - Method in class micycle.pgs.commons.PEdge
-
 
-
copy(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
-
Produces a deep copy / clone of the input shape.
-
-
CornerRounding - Class in micycle.pgs.commons
-
-
Corner rounding for PShape polygons.
-
-
createArc(double, double, double, double, double, double) - Static method in class micycle.pgs.PGS_Construction
-
-
Creates an elliptical arc polygon (a slice of a circle).
-
-
createBlobbie(double, double, double, double, double, double, double) - Static method in class micycle.pgs.PGS_Construction
-
-
Creates a "blob"-like shape.
-
-
createFermatSpiral(double, double, double, double) - Static method in class micycle.pgs.PGS_Construction
-
-
Creates Fermat's spiral, a parabolic spiral which is symmetrical about the - origin.
-
-
createHeart(double, double, double) - Static method in class micycle.pgs.PGS_Construction
-
-
Creates a heart shape.
-
-
createHilbertCurve(double, double, int) - Static method in class micycle.pgs.PGS_Construction
-
-
Creates a Hilbert Curve shape, a type of plane-filling curve.
-
-
createKochSnowflake(double, double, int) - Static method in class micycle.pgs.PGS_Construction
-
-
Creates a Koch Snowflake shape, a fractal curve.
-
-
createLinearSpiral(double, double, double, double) - Static method in class micycle.pgs.PGS_Construction
-
-
Creates an linear/archimedean spiral shape, where the distance between any 2 - successive windings is constant.
-
-
createRandomPolygon(int, double, double) - Static method in class micycle.pgs.PGS_Construction
-
-
Generates a random simple convex polygon (n-gon).
-
-
createRandomPolygonExact(int, double, double) - Static method in class micycle.pgs.PGS_Construction
-
-
Generates a random simple convex polygon (n-gon), where the output's bounding - box has the dimensions of those specified.
-
-
createRectangularSpiral(float, float, float, float, float) - Static method in class micycle.pgs.PGS_Construction
-
-
Creates a rectangular-shaped spiral shape.
-
-
createRing(double, double, double, double) - Static method in class micycle.pgs.PGS_Construction
-
-
Creates a joined ring (a "donut") shape.
-
-
createRing(double, double, double, double, double, double) - Static method in class micycle.pgs.PGS_Construction
-
-
Creates an (un)joined ring shape.
-
-
createSierpinskiCarpet(double, double, int) - Static method in class micycle.pgs.PGS_Construction
-
-
Creates a Sierpiński Carpet shape, a type of plane fractal.
-
-
createSierpinskiCurve(double, double, double, int) - Static method in class micycle.pgs.PGS_Construction
-
-
Creates a closed Sierpiński curve (a recursive space-filling curve), having a - user-defined degree/order.
-
-
createSierpinskiTriCurve(PGS_Construction.SierpinskiTriCurveType, double, int) - Static method in class micycle.pgs.PGS_Construction
-
-
Creates one of a family of trifurcating Sierpinski curves.
-
-
createStar(double, double, int, double, double, double) - Static method in class micycle.pgs.PGS_Construction
-
-
Creates a star shape, having a specified number of rays.
-
-
createStarShape(double, double, double, double, int, double) - Static method in class micycle.pgs.commons.Star
-
-
Create a star shape from the given parameters.
-
-
createSupercircle(double, double, double, double, double) - Static method in class micycle.pgs.PGS_Construction
-
-
Creates a supercircle shape.
-
-
createSuperShape(double, double, double, double, double, double, double) - Static method in class micycle.pgs.PGS_Construction
-
-
Creates a supershape PShape.
-
-
- - - -

D

-
-
DECA - micycle.pgs.PGS_Construction.SierpinskiTriCurveType
-
 
-
decompose(Polygon) - Static method in class micycle.pgs.commons.PolygonDecomposition
-
 
-
delaunayTriangulation(Collection<PVector>) - Static method in class micycle.pgs.PGS_Triangulation
-
-
Generates a Delaunay Triangulation from a collection of points.
-
-
delaunayTriangulation(PShape) - Static method in class micycle.pgs.PGS_Triangulation
-
-
Generates a constrained Delaunay Triangulation from the given shape.
-
-
delaunayTriangulation(PShape, Collection<PVector>, boolean, int, boolean) - Static method in class micycle.pgs.PGS_Triangulation
-
-
Generates a Delaunay Triangulation from the given shape.
-
-
delaunayTriangulationMesh(Collection<PVector>) - Static method in class micycle.pgs.PGS_Triangulation
-
-
Generates a Delaunay Triangulation from a collection of points.
-
-
delaunayTriangulationMesh(PShape) - Static method in class micycle.pgs.PGS_Triangulation
-
-
Generates a constrained Delaunay Triangulation from the given shape.
-
-
delaunayTriangulationMesh(PShape, Collection<PVector>, boolean, int, boolean) - Static method in class micycle.pgs.PGS_Triangulation
-
-
Generates a Delaunay Triangulation from the given shape.
-
-
delaunayTriangulationPoints(Collection<PVector>) - Static method in class micycle.pgs.PGS_Triangulation
-
-
Generates a Delaunay Triangulation from a collection of points.
-
-
delaunayTriangulationPoints(PShape) - Static method in class micycle.pgs.PGS_Triangulation
-
-
Generates a constrained Delaunay Triangulation from a collection of points.
-
-
delaunayTriangulationPoints(PShape, Collection<PVector>, boolean, int, boolean) - Static method in class micycle.pgs.PGS_Triangulation
-
-
Generates a Delaunay Triangulation from the given shape.
-
-
densify(PShape, double) - Static method in class micycle.pgs.PGS_Processing
-
-
Densifies a shape by inserting extra vertices along the line segments - contained in the shape.
-
-
density(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Computes the ratio (density) of the shape's area compared to the area of it's - envelope.
-
-
diameter(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Returns the diameter of a shape.
-
-
dilationErosion(PShape, double) - Static method in class micycle.pgs.PGS_Morphology
-
-
Applies a positive followed by a negative buffer (in a single operation), the - effect of which is small holes and gaps are filled in, while the general - structure of the shape is preserved.
-
-
disableAllFill(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
-
Calls setFill(false) on a PShape and all its children.
-
-
disableAllStroke(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
-
Calls setStroke(false) on a PShape and all its children.
-
-
DiscreteCurveEvolution - Class in micycle.pgs.commons
-
-
Convexity Rule for Shape Decomposition Based on Discrete Contour Evolution.
-
-
DiscreteCurveEvolution() - Constructor for class micycle.pgs.commons.DiscreteCurveEvolution
-
 
-
DiscreteCurveEvolution(int) - Constructor for class micycle.pgs.commons.DiscreteCurveEvolution
-
 
-
distance(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Computes the minimum distance between two shapes.
-
-
distanceField(PShape, double) - Static method in class micycle.pgs.PGS_Contour
-
-
Generates a contour map based on a distance field of a shape.
-
-
divide() - Method in class micycle.pgs.commons.RectangularSubdivision
-
-
Produces a new rectangular subdivision using the configured parameters.
-
-
divide() - Method in class micycle.pgs.commons.TriangleSubdivision
-
 
-
doyleSpiral(double, double, int, int, double) - Static method in class micycle.pgs.PGS_Tiling
-
-
Generates a Doyle spiral.
-
-
DoyleSpiral - Class in micycle.pgs.commons
-
-
Doyle spirals are patterns of non-crossing circles in the plane, each tangent - to six others.
-
-
DoyleSpiral(int, int, double) - Constructor for class micycle.pgs.commons.DoyleSpiral
-
-
Creates a Doyle spiral having the given parameters.
-
-
DSATUR - micycle.pgs.PGS_Coloring.ColoringAlgorithm
-
-
DSATUR (saturation degree ordering) is a variant on Largest Degree Ordering - where the vertices are ordered in decreasing order by "saturation degree", - defined as the number of distinct colors in the vertex neighborhood.
-
-
dualFaces(IIncrementalTin) - Static method in class micycle.pgs.PGS_Meshing
-
-
Generates a (mesh-like) shape consisting of polygonal faces of the dual graph - of the given triangulation.
-
-
- - - -

E

-
-
earCutTriangulation(PShape) - Static method in class micycle.pgs.PGS_Triangulation
-
-
Computes a triangulation of the shape according to the ear clipping - ("earcut") method.
-
-
edgeCollapseQuadrangulation(IIncrementalTin, boolean) - Static method in class micycle.pgs.PGS_Meshing
-
-
Generates a quadrangulation from a triangulation by selectively removing (or - "collapsing") the edges shared by neighboring triangles (via edge coloring).
-
-
edgeDuals - Variable in class micycle.pgs.commons.IncrementalTinDual
-
-
Maps triangulation edges to their dual edge.
-
-
edges - Variable in class micycle.pgs.commons.IncrementalTinDual
-
-
List of all edges in the dual graph.
-
-
either() - Method in class micycle.pgs.commons.FarthestPointPair
-
-
Returns one of the points in the farthest pair of points.
-
-
eliminateSlivers(PShape, double) - Static method in class micycle.pgs.PGS_Processing
-
-
Removes narrow areas ("slivers") from a shape while preserving the geometry - of the remaining parts.
-
-
elongation(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Measures the elongation of a shape; the ratio of the shapes bounding box's - length to its width.
-
-
envelope(PShape) - Static method in class micycle.pgs.PGS_Optimisation
-
-
Computes the shape's envelope (bounding box).
-
-
equalPartition(PShape, int, boolean) - Static method in class micycle.pgs.PGS_Processing
-
-
Partitions a shape into N approximately equal-area polygonal cells.
-
-
equals(Object) - Method in class micycle.pgs.commons.IncrementalTinDual.DualEdge
-
 
-
equals(Object) - Method in class micycle.pgs.commons.PEdge
-
 
-
equalsExact(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Tests two shapes for structural equality.
-
-
equalsNorm(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Tests two shapes for normalised structural equality.
-
-
equalsTopo(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Tests two shapes for topological equality.
-
-
erosionDilation(PShape, double) - Static method in class micycle.pgs.PGS_Morphology
-
-
Applies a negative followed by a positive buffer (in a single operation), the - effect of which is small edges/islands are removed, while the general - structure of the shape is preserved.
-
-
execute() - Method in class micycle.pgs.commons.ClosestPointPair
-
-
Execute the algorithm.
-
-
extractPerimeter(PShape, double, double) - Static method in class micycle.pgs.PGS_Processing
-
-
Extracts a portion/subline of the perimeter of a shape between two locations - on the perimeter.
-
-
- - - -

F

-
-
farthestPointPair(Collection<PVector>) - Static method in class micycle.pgs.PGS_Optimisation
-
-
Computes the farthest pair of points (the "diametral pair") in a set of n - points.
-
-
FarthestPointPair - Class in micycle.pgs.commons
-
-
The FarthestPair data type computes the farthest pair of points in a - set of n points in the plane and provides accessor methods for - getting the farthest pair of points and the distance between them.
-
-
FarthestPointPair(Collection<PVector>) - Constructor for class micycle.pgs.commons.FarthestPointPair
-
-
Computes the farthest pair of points in the specified array of points.
-
-
FastAtan2 - Class in micycle.pgs.commons
-
-
Fast, high-quality polynomial-based atan2 approximation.
-
-
FastPolygonizer - Class in micycle.pgs.commons
-
-
This class solves the problem of finding polygons formed by a collection of - edges.
-
-
fieldWarp(PShape, double, double, boolean) - Static method in class micycle.pgs.PGS_Morphology
-
-
Warps/perturbs a shape by displacing vertices according to a 2D noise vector - field.
-
-
fieldWarp(PShape, double, double, double, boolean, int) - Static method in class micycle.pgs.PGS_Morphology
-
-
Warps/perturbs a shape by displacing vertices according to a 2D noise vector - field.
-
-
filterAxisAligned(List<PEdge>, double) - Static method in class micycle.pgs.PGS_SegmentSet
-
-
Removes axis-aligned (horizontal and vertical) segments (within a given angle - tolerance) from a collection of segments.
-
-
filterByAverageLength(List<PEdge>, double) - Static method in class micycle.pgs.PGS_SegmentSet
-
-
Removes segments having a length either less than some fraction or more than - 1/fraction of the mean segment length from a collection of - segments.
-
-
filterByMinLength(List<PEdge>, double) - Static method in class micycle.pgs.PGS_SegmentSet
-
-
Removes segments having a length less than the given length from a collection - of segmensts.
-
-
findContainedPoints(PShape, Collection<PVector>) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Tests for each point in the input whether it is contained in/inside the given - shape; if it is, then the point is included in the output list.
-
-
findContainingShape(PShape, PVector) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Finds the single child shape/cell (if any) that contains the query point from - a GROUP shape input (a shape that has non-overlapping children).
-
-
flatten(Collection<PShape>) - Static method in class micycle.pgs.PGS_Conversion
-
-
Flattens a collection of PShapes into a single GROUP PShape which has the - input shapes as its children.
-
-
flatten(PShape...) - Static method in class micycle.pgs.PGS_Conversion
-
-
Flattens a collection of PShapes into a single GROUP PShape which has the - input shapes as its children.
-
-
flipHorizontal(PShape) - Static method in class micycle.pgs.PGS_Transformation
-
-
Flips the shape horizontally based on its centre point.
-
-
flipHorizontal(PShape, double) - Static method in class micycle.pgs.PGS_Transformation
-
-
Flips the shape horizontally based on a line given by its Y location.
-
-
flipVertical(PShape) - Static method in class micycle.pgs.PGS_Transformation
-
-
Flips the shape vertically based on its centre point.
-
-
flipVertical(PShape, double) - Static method in class micycle.pgs.PGS_Transformation
-
-
Flips the shape vertically based on a line given by its X location.
-
-
fromChildren(List<PShape>) - Static method in class micycle.pgs.PGS_Conversion
-
-
Creates a single GROUP shape whose children shapes are the list given.
-
-
fromEncodedPolyline(String) - Static method in class micycle.pgs.PGS_Conversion
-
-
Converts a geometry in Encoded Polyline format into a PShape.
-
-
fromGeoJSON(String) - Static method in class micycle.pgs.PGS_Conversion
-
-
Converts a GeoJSON representation of a shape into its PShape counterpart.
-
-
fromGraph(SimpleGraph<V, E>, double, double, double) - Static method in class micycle.pgs.PGS_Conversion
-
-
Takes as input a graph and computes a layout for the graph vertices using a - Force-Directed placement algorithm (not vertex coordinates, if any exist).
-
-
fromHexWKB(String) - Static method in class micycle.pgs.PGS_Conversion
-
-
Converts a geometry in Well-Known Binary hex format into a PShape.
-
-
fromJava2D(Shape) - Static method in class micycle.pgs.PGS_Conversion
-
-
Converts a Java2D/java.awt Shape to a Processing PShape.
-
-
fromPShape(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
-
Converts a PShape to an equivalent JTS Geometry.
-
-
fromPVector(Collection<PVector>) - Static method in class micycle.pgs.PGS_Conversion
-
-
Generates a shape from a list of vertices.
-
-
fromPVector(PVector...) - Static method in class micycle.pgs.PGS_Conversion
-
-
Generates a simple closed polygon (assumes no holes) from the list of - vertices (varargs).
-
-
fromWKB(byte[]) - Static method in class micycle.pgs.PGS_Conversion
-
-
Converts a geometry in Well-Known Binary format into a PShape.
-
-
fromWKT(String) - Static method in class micycle.pgs.PGS_Conversion
-
-
Converts a geometry in Well-Known Text format into a PShape.
-
-
frontChainPack(PShape, double, double) - Static method in class micycle.pgs.PGS_CirclePacking
-
-
Generates a random circle packing of tangental circles with varying radii - that overlap the given shape.
-
-
FrontChainPacker - Class in micycle.pgs.commons
-
-
Circle packing of rectangle boundaries using the front-chain packing - algorithm from 'Visualization of Large Hierarchical Data by Circle Packing'.
-
-
FrontChainPacker(float, float, float, float) - Constructor for class micycle.pgs.commons.FrontChainPacker
-
-
Creates a FrontChainPacker instance.
-
-
FrontChainPacker(float, float, float, float, float, float) - Constructor for class micycle.pgs.commons.FrontChainPacker
-
-
Creates a FrontChainPacker instance.
-
-
- - - -

G

-
-
gabrielFaces(IIncrementalTin, boolean) - Static method in class micycle.pgs.PGS_Meshing
-
-
Generates a shape consisting of polygonal faces of a Gabriel graph.
-
-
gaussian(double, double, double, int) - Static method in class micycle.pgs.PGS_PointSet
-
-
Generates a set of random points having a gaussian/normal distribution.
-
-
gaussian(double, double, double, int, long) - Static method in class micycle.pgs.PGS_PointSet
-
-
Generates a set of random points having a gaussian/normal distribution, using - the specified seed.
-
-
GaussianLineSmoothing - Class in micycle.pgs.commons
-
-
Line gaussian smoothing.
-
-
generate(double, double, double, double, double) - Method in class micycle.pgs.commons.PoissonDistributionJRUS
-
-
Generates a random point set, having a poisson/blue noise distribution.
-
-
generate(double, double, double, double, double, int) - Method in class micycle.pgs.commons.PoissonDistribution
-
-
Deprecated.
-
Generates a random point set, having a poisson/blue noise distribution.
-
-
generate(double, double, double, double, double, int) - Method in class micycle.pgs.commons.PoissonDistributionJRUS
-
-
Generates a random point set, having a poisson/blue noise distribution.
-
-
generate(double, double, double, double, int) - Method in class micycle.pgs.commons.PoissonDistributionJRUS
-
-
Generates a poisson point set having N points.
-
-
generateRandomConvexPolygon(int, double, double) - Static method in class micycle.pgs.commons.RandomPolygon
-
 
-
generateRandomGridPoints(PShape, int, boolean, double) - Static method in class micycle.pgs.PGS_Processing
-
-
Generates up to maxPoints number of random points that are - contained within the shape region.
-
-
generateRandomGridPoints(PShape, int, boolean, double, long) - Static method in class micycle.pgs.PGS_Processing
-
-
Generates up to maxPoints number of random points that are - contained within the shape region.
-
-
generateRandomPoints(PShape, int) - Static method in class micycle.pgs.PGS_Processing
-
-
Generates N random points that lie within the shape region.
-
-
generateRandomPoints(PShape, int, long) - Static method in class micycle.pgs.PGS_Processing
-
-
Generates N random points that are contained within the shape region.
-
-
GENETIC - micycle.pgs.PGS_Coloring.ColoringAlgorithm
-
-
Finds a coloring using a genetic algorithm.
-
-
GeneticColoring<V,​E> - Class in micycle.pgs.commons
-
-
Finds a solution to a graph coloring using a genetic algorithm.
-
-
GeneticColoring(Graph<V, E>) - Constructor for class micycle.pgs.commons.GeneticColoring
-
-
Creates with a population size of 50; "the value was chosen after testing a - number of different population sizes.
-
-
GeneticColoring(Graph<V, E>, int, int, int) - Constructor for class micycle.pgs.commons.GeneticColoring
-
 
-
get(LineString, double) - Static method in class micycle.pgs.commons.GaussianLineSmoothing
-
 
-
get(LineString, double, double) - Static method in class micycle.pgs.commons.GaussianLineSmoothing
-
-
Line gaussian smoothing.
-
-
getBoundingCoordinates(int) - Method in class micycle.pgs.commons.MinimumBoundingEllipse
-
-
Returns a list of coordinates that can be used to render the ellipse.
-
-
getCenter() - Method in class micycle.pgs.commons.MinimumBoundingEllipse
-
-
Returns the center point of the ellipse
-
-
getChildren(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
-
Recurses a GROUP PShape, finding all of its non-GROUP child PShapes.
-
-
getCircles() - Method in class micycle.pgs.commons.DoyleSpiral
-
-
Centered on (0, 0).
-
-
getCircles() - Method in class micycle.pgs.commons.FrontChainPacker
-
 
-
getColoring() - Method in class micycle.pgs.commons.GeneticColoring
-
 
-
getColoring() - Method in class micycle.pgs.commons.RLFColoring
-
 
-
getEdges() - Method in class micycle.pgs.commons.PenroseTiling
-
-
Returns the edge work of the tiling.
-
-
getGeometry() - Method in class micycle.pgs.commons.SeededRandomPointsInGridBuilder
-
 
-
getInscribedRectangle() - Method in class micycle.pgs.commons.MaximumInscribedAARectangle
-
-
Returns the largest rectangle that will fit inside a convex hull
-
-
getMatrix() - Method in class micycle.pgs.commons.MinimumBoundingEllipse
-
-
Returns a matrix containing all the information regarding the shape of the - ellipsoid.
-
-
getMesh() - Method in class micycle.pgs.commons.IncrementalTinDual
-
-
Generate mesh of polygonal dual faces.
-
-
getNextLargestCircle() - Method in class micycle.pgs.commons.MaximumInscribedCircles
-
-
Get the next largest MIC.
-
-
getPacking() - Method in class micycle.pgs.commons.RepulsionCirclePack
-
 
-
getPoints() - Method in class micycle.pgs.commons.PoissonDistribution
-
-
Deprecated.
-
Returns the point set generated by most recent call to - PoissonDistribution.generate(double, double, double, double, double, int).
-
-
getPoints() - Method in class micycle.pgs.commons.PoissonDistributionJRUS
-
-
Returns the point set generated by most recent call to - generate().
-
-
getQuadrangulationEdges() - Method in class micycle.pgs.commons.SpiralQuadrangulation
-
 
-
getTiling() - Method in class micycle.pgs.commons.HatchTiling
-
 
-
getTiling() - Method in class micycle.pgs.commons.SquareTriangleTiling
-
 
-
getTiling(long) - Method in class micycle.pgs.commons.HatchTiling
-
 
-
getTiling(long) - Method in class micycle.pgs.commons.SquareTriangleTiling
-
 
-
getTriangle() - Method in class micycle.pgs.commons.MinimumBoundingTriangle
-
-
Gets a geometry which represents the Minimium Bounding Triangle.
-
-
getTriangles() - Method in class micycle.pgs.commons.PenroseTiling
-
-
Returns raw triangles from the penrose tiling.
-
-
graphMatchedSegments(double, double, int, long) - Static method in class micycle.pgs.PGS_SegmentSet
-
-
Generates N non-intersecting segments via a Perfect matching algorithm - applied to a triangulation populated with random points.
-
-
graphMatchedSegments(List<PVector>) - Static method in class micycle.pgs.PGS_SegmentSet
-
-
Generates non-intersecting segments via a Perfect matching algorithm - applied to a triangulation populated with the given points.
-
-
graphMatchedSegments(IIncrementalTin) - Static method in class micycle.pgs.PGS_SegmentSet
-
-
Generates non-intersecting segments via a Perfect matching algorithm - applied to the given triangulation.
-
-
- - - -

H

-
-
haltonLDS(double, double, double, double, int) - Static method in class micycle.pgs.PGS_PointSet
-
-
Generates a set of deterministic stratified points (bounded by a rectangle) - from a low discrepancy sequence (LDS) based on a Halton sequence.
-
-
hammersleyLDS(double, double, double, double, int) - Static method in class micycle.pgs.PGS_PointSet
-
-
Generates a set of deterministic stratified points (bounded by a rectangle) - from a low discrepancy sequence (LDS) based on a Hammersley sequence.
-
-
HANDLE_MULTICONTOUR - Static variable in class micycle.pgs.PGS_Conversion
-
-
A boolean flag that enables a subroutine during fromPShape() conversion to properly convert single PShapes that - consist of multiple contours that in turn represent multiple distinct shapes.
-
-
hashCode() - Method in class micycle.pgs.commons.IncrementalTinDual.DualEdge
-
 
-
hashCode() - Method in class micycle.pgs.commons.PEdge
-
 
-
hatchSubdivision(double, double, int, int, long) - Static method in class micycle.pgs.PGS_Tiling
-
-
Randomly subdivides the plane into equal-width strips having varying lengths.
-
-
HatchTiling - Class in micycle.pgs.commons
-
-
Port of https://openprocessing.org/sketch/1523350/
-
-
HatchTiling(int, int) - Constructor for class micycle.pgs.commons.HatchTiling
-
 
-
HatchTiling(int, int, int, int) - Constructor for class micycle.pgs.commons.HatchTiling
-
 
-
height(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Computes the vertical height of a shape (the height of its bounding-box).
-
-
hexagon(double, double, int, double) - Static method in class micycle.pgs.PGS_PointSet
-
-
Generates a hexagonal grid of points arranged in a hexagon pattern.
-
-
hexGrid(double, double, double, double, double) - Static method in class micycle.pgs.PGS_PointSet
-
-
Generates a hexagon grid of points that lie within a bounding rectangle.
-
-
hexGrid(double, double, double, double, int) - Static method in class micycle.pgs.PGS_PointSet
-
-
Generates a hexagon grid/lattice of points that lie within a bounding - rectangle.
-
-
hexLatticePack(PShape, double) - Static method in class micycle.pgs.PGS_CirclePacking
-
-
Generates a tiled circle packing consisting of equal-sized circles arranged - in a hexagonal lattice bounded by the input shape.
-
-
hexTiling(double, double, double, boolean) - Static method in class micycle.pgs.PGS_Tiling
-
-
Generates a hexagonal tiling of the plane.
-
-
hilbertSort(List<PVector>) - Static method in class micycle.pgs.PGS_PointSet
-
-
Sorts a list of points according to the Hilbert space-filling curve to ensure - a high-degree of spatial locality in the sequence of points.
-
-
hilbertSortFaces(PShape) - Static method in class micycle.pgs.PGS_Optimisation
-
-
Sorts the faces/child shapes of a GROUP shape according to hilbert curve - index of each face's centroid coordinate.
-
-
holes(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Computes the number of holes in a shape.
-
-
homotheticTransformation(PShape, PVector, double, double) - Static method in class micycle.pgs.PGS_Transformation
-
-
Calculates a Homothetic Transformation of a shape.
-
-
- - - -

I

-
-
IncrementalTinDual - Class in micycle.pgs.commons
-
-
Produces a (barycentric) dual graph from a TinFour Delaunay Triangulation.
-
-
IncrementalTinDual(IIncrementalTin) - Constructor for class micycle.pgs.commons.IncrementalTinDual
-
 
-
IncrementalTinDual.DualEdge - Class in micycle.pgs.commons
-
 
-
innerVoronoi(Collection<PVector>) - Static method in class micycle.pgs.PGS_Voronoi
-
-
Generates a Voronoi diagram for a set of points.
-
-
innerVoronoi(Collection<PVector>, double[]) - Static method in class micycle.pgs.PGS_Voronoi
-
-
Generates a Voronoi diagram for a set of points.
-
-
innerVoronoi(PShape, boolean) - Static method in class micycle.pgs.PGS_Voronoi
-
-
Generates a Voronoi diagram for a single shape, where shape vertices are - voronoi point sites.
-
-
innerVoronoi(PShape, boolean, double[]) - Static method in class micycle.pgs.PGS_Voronoi
-
-
Generates a Voronoi diagram for a single shape, where shape vertices are - voronoi point sites.
-
-
interpolate(PShape, PShape, double) - Static method in class micycle.pgs.PGS_Morphology
-
-
Generates an intermediate shape between two shapes by interpolating between - them.
-
-
interpolate(PShape, PShape, int) - Static method in class micycle.pgs.PGS_Morphology
-
-
Generates intermediate shapes (frames) between two shapes by interpolating - between them.
-
-
intersect(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapeBoolean
-
-
Computes a shape representing the area which is common to both input shapes - (i.e.
-
-
intersect(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Determines whether the shapes intersect/overlap (meaning that have at least - one point in common).
-
-
intersectMesh(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapeBoolean
-
-
Intersects a mesh-like shape / polygonal coverage with a polygonal area, - preserving individual faces/features of the mesh during the operation.
-
-
isConvex(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Determines whether a shape is convex.
-
-
islamicTiling(double, double, double, double) - Static method in class micycle.pgs.PGS_Tiling
-
-
Generates an "islamic-style" (Girih) tiling of the plane.
-
-
isolines(Collection<PVector>, double, double, double) - Static method in class micycle.pgs.PGS_Contour
-
-
Generates a topographic-like isoline contour map from the given points.
-
-
isolines(Collection<PVector>, double, double, double, int) - Static method in class micycle.pgs.PGS_Contour
-
-
Generates a topographic-like isoline contour map from the given points.
-
-
isolines(PShape, PVector, double) - Static method in class micycle.pgs.PGS_Contour
-
-
Generates a topographic-like isoline contour map from the shape's vertices.
-
-
isSimple(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Checks whether a shape is simple.
-
-
- - - -

L

-
-
LARGEST_DEGREE_FIRST - micycle.pgs.PGS_Coloring.ColoringAlgorithm
-
-
The largest degree first greedy coloring algorithm.
-
-
largestEmptyCircle(PShape, double) - Static method in class micycle.pgs.PGS_Optimisation
-
-
Constructs the Largest Empty Circle for a set of obstacle geometries, up to a - specified tolerance.
-
-
length() - Method in class micycle.pgs.commons.PEdge
-
 
-
length(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Returns the length of a shape.
-
-
lineSegmentsIntersection(List<PVector>) - Static method in class micycle.pgs.PGS_Processing
-
-
Computes all points of intersection between segments in a set of line - segments.
-
-
- - - -

M

-
-
maximumInscribedAARectangle(PShape, boolean) - Static method in class micycle.pgs.PGS_Optimisation
-
-
Finds the rectangle with a maximum area whose sides are parallel to the - x-axis and y-axis ("axis-aligned"), contained within a convex shape.
-
-
MaximumInscribedAARectangle - Class in micycle.pgs.commons
-
-
Computes the largest inscribed axis-aligned rectangle within a convex hull.
-
-
MaximumInscribedAARectangle(Geometry, double) - Constructor for class micycle.pgs.commons.MaximumInscribedAARectangle
-
 
-
maximumInscribedCircle(PShape, double) - Static method in class micycle.pgs.PGS_Optimisation
-
-
The Maximum Inscribed Circle is determined by a point in the interior of the - area which has the farthest distance from the area boundary, along with a - boundary point at that distance.
-
-
maximumInscribedCircle(PShape, PVector) - Static method in class micycle.pgs.PGS_Optimisation
-
-
Return the maximum circle (at a given centerpoint inside/outside the circle)
-
-
MaximumInscribedCircles - Class in micycle.pgs.commons
-
-
An bespoke version of - MaximumInscribedCircle to find N largest maximum inscribed circles in an - optimised manner.
-
-
MaximumInscribedCircles(Geometry, double) - Constructor for class micycle.pgs.commons.MaximumInscribedCircles
-
-
Creates a new instance of a Maximum Inscribed Circles computation.
-
-
maximumInscribedPack(PShape, int, double) - Static method in class micycle.pgs.PGS_CirclePacking
-
-
Generates a circle packing consisting of the N largest maximum inscribed - circles, starting with the largest circle (the shape's global maximum - inscribed circle).
-
-
maximumInscribedRectangle(PShape) - Static method in class micycle.pgs.PGS_Optimisation
-
-
Finds an approximate largest area rectangle (of arbitrary orientation) - contained within a polygon.
-
-
MaximumInscribedRectangle - Class in micycle.pgs.commons
-
-
Finds an approximate largest area rectangle of arbitrary orientation in a - polygon via particle swarm optimisation.
-
-
MaximumInscribedRectangle(Polygon) - Constructor for class micycle.pgs.commons.MaximumInscribedRectangle
-
 
-
maximumInteriorAngle(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Computes the maximum/largest interior angle of a polygon.
-
-
medialAxis(PShape, double, double, double) - Static method in class micycle.pgs.PGS_Contour
-
-
Computes the medial axis of the given shape, which provides a - characterization of the skeleton of a shape.
-
-
micycle.pgs - package micycle.pgs
-
-
Processing Geometry Suite is a software project that provides easy access to - geometric algorithms in the form of a Processing library.
-
-
micycle.pgs.commons - package micycle.pgs.commons
-
-
The commons package contains all non-core PGS classes (of varying authorship - and either not worth putting in separate package or too long to include - within the calling PGS method itself).
-
-
midpoint() - Method in class micycle.pgs.commons.PEdge
-
 
-
minimumBoundingCircle(PShape) - Static method in class micycle.pgs.PGS_Optimisation
-
-
Computes the Minimum Bounding Circle (MBC) for the points in a Geometry.
-
-
minimumBoundingEllipse(PShape, double) - Static method in class micycle.pgs.PGS_Optimisation
-
-
Computes the minimum bounding ellipse that encloses a shape.
-
-
MinimumBoundingEllipse - Class in micycle.pgs.commons
-
-
Minimum Volume Enclosing Ellipsoid
-
-
MinimumBoundingEllipse(double[][], double) - Constructor for class micycle.pgs.commons.MinimumBoundingEllipse
-
-
Khachiyan’s Algorithm for the Computation of Minimum Volume Enclosing - Ellipsoids.
-
-
minimumBoundingRectangle(PShape) - Static method in class micycle.pgs.PGS_Optimisation
-
-
Computes the minimum bounding rectangle that encloses a shape.
-
-
minimumBoundingTriangle(PShape) - Static method in class micycle.pgs.PGS_Optimisation
-
-
Computes the minimum-area bounding triangle that encloses a shape.
-
-
MinimumBoundingTriangle - Class in micycle.pgs.commons
-
-
Computes the Minimum Bounding Triangle (MBT) for the points in a Geometry.
-
-
MinimumBoundingTriangle(Geometry) - Constructor for class micycle.pgs.commons.MinimumBoundingTriangle
-
-
Creates a new instance of a Maximum Inscribed Triangle computation.
-
-
minimumDiameter(PShape) - Static method in class micycle.pgs.PGS_Optimisation
-
-
Computes the minimum diameter of a shape.
-
-
minimumSpanningTree(List<PVector>) - Static method in class micycle.pgs.PGS_PointSet
-
-
Computes the Euclidean minimum spanning tree (EMST) of a set of - points.
-
-
minkDifference(PShape, PShape) - Static method in class micycle.pgs.PGS_Morphology
-
-
Computes a Minkowski difference (a.k.a erosion) of the two source - shapes.
-
-
minkSum(PShape, PShape) - Static method in class micycle.pgs.PGS_Morphology
-
-
Computes a Minkowski sum (a.k.a dilation) of the two source shapes.
-
-
MITER - micycle.pgs.PGS_Contour.OffsetStyle
-
 
-
- - - -

N

-
-
nodedSegments(double, double, int, long) - Static method in class micycle.pgs.PGS_SegmentSet
-
-
Generates N non-intersecting segments via intersection and noding.
-
-
nRooksLDS(double, double, double, double, int) - Static method in class micycle.pgs.PGS_PointSet
-
-
Generates a set of random stratified points (bounded by a rectangle) based on - the "N-Rooks" sampling pattern.
-
-
nRooksLDS(double, double, double, double, int, long) - Static method in class micycle.pgs.PGS_PointSet
-
-
Generates a set of random stratified points (bounded by a rectangle) based on - the "N-Rooks" sampling pattern.
-
-
Nullable - Annotation Type in micycle.pgs.commons
-
-
An element annotated with Nullable claims null value is - perfectly valid to return (for methods), pass to (parameters) and - hold (local variables and fields).
-
-
- - - -

O

-
-
offsetCurvesInward(PShape, PGS_Contour.OffsetStyle, double) - Static method in class micycle.pgs.PGS_Contour
-
-
Produces inwards offset curves from the shape.
-
-
offsetCurvesInward(PShape, PGS_Contour.OffsetStyle, double, int) - Static method in class micycle.pgs.PGS_Contour
-
-
Produces N inwards offset curves from the shape.
-
-
offsetCurvesOutward(PShape, PGS_Contour.OffsetStyle, double, int) - Static method in class micycle.pgs.PGS_Contour
-
-
Produces N offset curves that emanate outwards from the shape.
-
-
originScale(PShape, double) - Static method in class micycle.pgs.PGS_Transformation
-
-
Scales a shape relative to the origin (0,0).
-
-
other() - Method in class micycle.pgs.commons.FarthestPointPair
-
-
Returns the other point in the farthest pair of points.
-
-
overlap(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Measures the degree of mutual overlap between two shapes.
-
-
- - - -

P

-
-
pack() - Method in class micycle.pgs.commons.TangencyPack
-
-
Computes and returns a circle packing for the configuration of tangencies - given by the triangulation.
-
-
parallelSegments(double, double, double, double, double, int) - Static method in class micycle.pgs.PGS_SegmentSet
-
-
Generates a set of N straight parallel segments, centered on a given point.
-
-
PEdge - Class in micycle.pgs.commons
-
-
An undirected edge / line segment joining 2 PVectors.
-
-
PEdge(double, double, double, double) - Constructor for class micycle.pgs.commons.PEdge
-
 
-
PEdge(PVector, PVector) - Constructor for class micycle.pgs.commons.PEdge
-
 
-
penroseTiling(double, double, double, int) - Static method in class micycle.pgs.PGS_Tiling
-
-
Generates a Penrose Tiling (consisting of rhombi).
-
-
PenroseTiling - Class in micycle.pgs.commons
-
-
Generates a Penrose tiling of the plane.
-
-
PenroseTiling(double, double, double, int) - Constructor for class micycle.pgs.commons.PenroseTiling
-
 
-
PENTA - micycle.pgs.PGS_Construction.SierpinskiTriCurveType
-
 
-
PGS_CirclePacking - Class in micycle.pgs
-
-
Circle packings of shapes, subject to varying constraints and patterns of - tangencies.
-
-
PGS_Coloring - Class in micycle.pgs
-
-
Intelligently color meshes (or mesh-like shapes) such that no two adjacent - faces have the same color, while minimising the number of colors used.
-
-
PGS_Coloring.ColoringAlgorithm - Enum in micycle.pgs
-
-
Specifies the algorithm/heuristic used by the underlying graph coloring process to find - a coloring for mesh faces.
-
-
PGS_Construction - Class in micycle.pgs
-
-
Construct uncommon/interesting 2D geometries.
-
-
PGS_Construction.SierpinskiTriCurveType - Enum in micycle.pgs
-
 
-
PGS_Contour - Class in micycle.pgs
-
-
Methods for producing different kinds of shape contours.
-
-
PGS_Contour.OffsetStyle - Enum in micycle.pgs
-
-
Specifies the join style for offset curves.
-
-
PGS_Conversion - Class in micycle.pgs
-
-
Conversion between Processing PShapes and JTS - Geometries (amongst other formats).
-
-
PGS_Hull - Class in micycle.pgs
-
-
Convex and concave hulls (amongst other variations) of polygons and point - sets.
-
-
PGS_Meshing - Class in micycle.pgs
-
-
Mesh generation (excluding triangulation).
-
-
PGS_Morphology - Class in micycle.pgs
-
-
Methods that affect the geometry or topology of shapes.
-
-
PGS_Optimisation - Class in micycle.pgs
-
-
Solve geometric optimisation problems, such as bounding volumes, inscribed - areas, optimal distances, etc.
-
-
PGS_PointSet - Class in micycle.pgs
-
-
Generation of random sets of 2D points having a variety of different - distributions and constraints (and associated functions).
-
-
PGS_Processing - Class in micycle.pgs
-
-
Geometry Processing -- methods that process a shape in some way: compute - hulls, partition, slice, etc.
-
-
PGS_SegmentSet - Class in micycle.pgs
-
-
Generation of random sets of non-intersecting line segments (and - associated functions).
-
-
PGS_ShapeBoolean - Class in micycle.pgs
-
-
Boolean set-operations for 2D shapes.
-
-
PGS_ShapePredicates - Class in micycle.pgs
-
-
Various shape metrics & predicates
-
-
PGS_Tiling - Class in micycle.pgs
-
-
Tiling, tessellation and subdivision of the plane using periodic or - non-periodic geometric shapes.
-
-
PGS_Transformation - Class in micycle.pgs
-
-
Various geometric and affine transformations for PShapes that affect vertex - coordinates.
-
-
PGS_Triangulation - Class in micycle.pgs
-
-
Delaunay and earcut triangulation of shapes and point sets.
-
-
PGS_Voronoi - Class in micycle.pgs
-
-
Voronoi Diagrams of shapes and point sets.
-
-
phyllotaxis(double, double, int, double) - Static method in class micycle.pgs.PGS_PointSet
-
-
Generates a set of points arranged in a phyllotaxis pattern (an arrangement - similar to the florets in the head of a sunflower), using the golden ratio - (the most irrational number) to position points with the least possible - aliasing (which is arguably the "best" arrangement).
-
-
phyllotaxis(double, double, int, double, double) - Static method in class micycle.pgs.PGS_PointSet
-
-
Generates a set of points arranged in a phyllotaxis pattern (an arrangement - similar to the florets in the head of a sunflower), using a user-defined - theta.
-
-
plasticJitteredLDS(double, double, double, double, int) - Static method in class micycle.pgs.PGS_PointSet
-
-
Generates a set of deterministic stratified points (bounded by a rectangle) - from a low discrepancy sequence (LDS) based on an irrational number.
-
-
plasticJitteredLDS(double, double, double, double, int, long) - Static method in class micycle.pgs.PGS_PointSet
-
-
Generates a set of deterministic stratified points (bounded by a rectangle) - from a low discrepancy sequence (LDS) based on an irrational number.
-
-
plasticLDS(double, double, double, double, int) - Static method in class micycle.pgs.PGS_PointSet
-
-
Generates a set of deterministic stratified points (bounded by a rectangle) - from a low discrepancy sequence (LDS) based on an irrational number (the - plastic constant).
-
-
pointOnExterior(PShape, double, double) - Static method in class micycle.pgs.PGS_Processing
-
-
Extracts a point from the perimeter (exterior) of the shape at a given - fraction around its perimeter.
-
-
pointsOnExterior(PShape, double, double) - Static method in class micycle.pgs.PGS_Processing
-
-
Generates a list of points that lie on the exterior/perimeter of the given - shape.
-
-
pointsOnExterior(PShape, int, double) - Static method in class micycle.pgs.PGS_Processing
-
-
Extracts many points from the perimeter (faster than calling other method - lots)
-
-
poisson(double, double, double, double, double) - Static method in class micycle.pgs.PGS_PointSet
-
-
Generates a set of random points (constrained within a rectangular region) - via Poisson Disk Sampling.
-
-
poisson(double, double, double, double, double, long) - Static method in class micycle.pgs.PGS_PointSet
-
-
Generates a set of random points (constrained within a rectangular region) - via Poisson Disk Sampling, using the specified seed.
-
-
PoissonDistribution - Class in micycle.pgs.commons
-
-
Deprecated. -
in favour of PoissonDistributionJRUS
-
-
-
PoissonDistribution() - Constructor for class micycle.pgs.commons.PoissonDistribution
-
-
Deprecated.
- 
-
PoissonDistribution(long) - Constructor for class micycle.pgs.commons.PoissonDistribution
-
-
Deprecated.
- 
-
PoissonDistributionJRUS - Class in micycle.pgs.commons
-
-
Generates sets of random points via Poisson Disk Sampling.
-
-
PoissonDistributionJRUS() - Constructor for class micycle.pgs.commons.PoissonDistributionJRUS
-
 
-
PoissonDistributionJRUS(long) - Constructor for class micycle.pgs.commons.PoissonDistributionJRUS
-
 
-
poissonN(double, double, double, double, int, long) - Static method in class micycle.pgs.PGS_PointSet
-
-
Generates a poisson point set having N points constrained within a - rectangular region.
-
-
poissonTriangulation(PShape, double) - Static method in class micycle.pgs.PGS_Triangulation
-
-
Creates a Delaunay triangulation of the shape where additional steiner - points, populated by poisson sampling, are included.
-
-
poissonTriangulationPoints(PShape, double) - Static method in class micycle.pgs.PGS_Triangulation
-
-
Creates a Delaunay triangulation of the shape where additional steiner - points, populated by poisson sampling, are included.
-
-
PolygonDecomposition - Class in micycle.pgs.commons
-
-
Implementation of the Bayazit convex decomposition algorithm for simple - polygons.
-
-
polygonize(Collection<PEdge>) - Static method in class micycle.pgs.commons.FastPolygonizer
-
-
Polygonizes a set of edges which represent linework that forms some polygonal - arrangement (a planar graph).
-
-
polygonizeLines(List<PVector>) - Static method in class micycle.pgs.PGS_Processing
-
-
Finds the polygonal faces formed by a set of intersecting line segments.
-
-
PRESERVE_STYLE - Static variable in class micycle.pgs.PGS_Conversion
-
-
A boolean flag that affects whether a PShape's style (fillColor, strokeColor, - strokeWidth) is preserved during PShape->Geometry->PShape - conversion (i.e.
-
-
process(Coordinate[]) - Method in class micycle.pgs.commons.DiscreteCurveEvolution
-
 
-
process(LineString) - Method in class micycle.pgs.commons.DiscreteCurveEvolution
-
 
-
prunePointsWithinDistance(List<PVector>, double) - Static method in class micycle.pgs.PGS_PointSet
-
-
Returns a filtered copy of the input, containing no points that are within - the distanceTolerance of each other.
-
-
- - - -

Q

-
-
quadSubdivision(double, double, int) - Static method in class micycle.pgs.PGS_Tiling
-
-
Recursively and randomly subdivides the given/bounded plane into convex quad - polygons.
-
-
quadSubdivision(double, double, int, long) - Static method in class micycle.pgs.PGS_Tiling
-
-
Recursively and randomly subdivides the given/bounded plane into convex quad - polygons.
-
-
- - - -

R

-
-
radialWarp(PShape, double, double, boolean) - Static method in class micycle.pgs.PGS_Morphology
-
-
Warps/perturbs a shape by displacing vertices along a line between each - vertex and the shape centroid.
-
-
random(double, double, double, double, int) - Static method in class micycle.pgs.PGS_PointSet
-
-
Generates a set of random (uniform) points that lie within a bounding - rectangle.
-
-
random(double, double, double, double, int, long) - Static method in class micycle.pgs.PGS_PointSet
-
-
Generates a set of random (uniform) points that lie within a bounding - rectangle, using the specified seed.
-
-
RANDOM - micycle.pgs.PGS_Coloring.ColoringAlgorithm
-
-
The greedy coloring algorithm with a random vertex ordering.
-
-
RandomPolygon - Class in micycle.pgs.commons
-
-
Random Convex Polygons
-
-
RectangularSubdivision - Class in micycle.pgs.commons
-
-
Random rectangle subdivision.
-
-
RectangularSubdivision(double, double, int, long) - Constructor for class micycle.pgs.commons.RectangularSubdivision
-
 
-
RectangularSubdivision(double, double, long) - Constructor for class micycle.pgs.commons.RectangularSubdivision
-
 
-
rectSubdivision(double, double, int) - Static method in class micycle.pgs.PGS_Tiling
-
-
Recursively and randomly subdivides the given/bounded plane into rectangles.
-
-
rectSubdivision(double, double, int, long) - Static method in class micycle.pgs.PGS_Tiling
-
-
Recursively and randomly subdivides the given/bounded plane into rectangles.
-
-
reducePrecision(PShape, double) - Static method in class micycle.pgs.PGS_Morphology
-
-
Reduces the precision of a shape, whilst ensuring the output shape is valid.
-
-
relativeNeighborFaces(IIncrementalTin, boolean) - Static method in class micycle.pgs.PGS_Meshing
-
-
Generates a shape consisting of polygonal faces of a Relative neighborhood - graph (RNG).
-
-
removeHiddenLines(PShape) - Static method in class micycle.pgs.PGS_Processing
-
-
Removes overlap between polygons contained in a GROUP shape, preserving only - line segments that are visible to a human, rather than a computer (to use as - input for a pen plotter, for example).
-
-
removeSmallHoles(PShape, double) - Static method in class micycle.pgs.PGS_Processing
-
-
Returns a copy of the shape where small holes (i.e.
-
-
RepulsionCirclePack - Class in micycle.pgs.commons
-
-
Repulsion Packing attempts to arrange a set of circles of specified radii - within a rectangle such that there is no-overlap between circles.
-
-
RepulsionCirclePack(List<PVector>, double, double, double, double, boolean) - Constructor for class micycle.pgs.commons.RepulsionCirclePack
-
 
-
repulsionPack(PShape, double, double, long) - Static method in class micycle.pgs.PGS_CirclePacking
-
-
Generates a random circle packing of circles with varying radii that overlap - the given shape.
-
-
repulsionPack(PShape, List<PVector>) - Static method in class micycle.pgs.PGS_CirclePacking
-
-
Generates a circle packing of a shape using a given collection of - (overlapping) circles.
-
-
resize(PShape, double, double) - Static method in class micycle.pgs.PGS_Transformation
-
-
Resizes a shape (based on its envelope) to the given dimensions, relative to - its center point.
-
-
resizeByHeight(PShape, double) - Static method in class micycle.pgs.PGS_Transformation
-
-
Resizes a shape (based on its envelope) to the given height relative to its - center point; the width is resized accordingly to maintain the shape's aspect - ratio.
-
-
resizeByMajorAxis(PShape, double) - Static method in class micycle.pgs.PGS_Transformation
-
-
Resizes a shape (based on the longest axis of its envelope) to the given size - relative to its center point.
-
-
resizeByWidth(PShape, double) - Static method in class micycle.pgs.PGS_Transformation
-
-
Resizes a shape (based on its envelope) to the given width relative to its - center point; the height is resized accordingly to maintain the shape's - aspect ratio.
-
-
ring(double, double, double, double, double, int) - Static method in class micycle.pgs.PGS_PointSet
-
-
Generates a set of points that are randomly distribted on a ring.
-
-
ring(double, double, double, double, double, int, long) - Static method in class micycle.pgs.PGS_PointSet
-
-
Generates a set of points that are randomly distribted on a ring.
-
-
RLF - micycle.pgs.PGS_Coloring.ColoringAlgorithm
-
-
Recursive largest-first coloring (recommended).
-
-
RLFColoring<V,​E> - Class in micycle.pgs.commons
-
-
The Recursive Largest First (RLF) algorithm for graph coloring.
-
-
RLFColoring(Graph<V, E>) - Constructor for class micycle.pgs.commons.RLFColoring
-
 
-
rotate(PShape, PVector, double) - Static method in class micycle.pgs.PGS_Transformation
-
-
Rotates a shape around a given point.
-
-
rotateAroundCenter(PShape, double) - Static method in class micycle.pgs.PGS_Transformation
-
-
Rotates a shape around its centroid.
-
-
round() - Method in class micycle.pgs.commons.PEdge
-
-
Rounds (mutates) the vertices of this PEdge.
-
-
round(PShape, double) - Static method in class micycle.pgs.commons.CornerRounding
-
 
-
round(PShape, double) - Static method in class micycle.pgs.PGS_Morphology
-
-
Rounds the corners of a shape by substituting a circular arc for each corner.
-
-
ROUND - micycle.pgs.PGS_Contour.OffsetStyle
-
 
-
roundVertexCoords(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
-
Rounds the x and y coordinates (to the closest int) of all vertices belonging - to the shape, mutating the shape.
-
-
- - - -

S

-
-
scale(PShape, double) - Static method in class micycle.pgs.PGS_Transformation
-
-
Scales the shape relative to its center point.
-
-
scale(PShape, double, double) - Static method in class micycle.pgs.PGS_Transformation
-
-
Scales the shape relative to its center point.
-
-
SeededRandomPointsInGridBuilder - Class in micycle.pgs.commons
-
-
An extension to the - RandomPointsInGridBuilder class that accepts a random seed for repeatable - outputs.
-
-
SeededRandomPointsInGridBuilder(long) - Constructor for class micycle.pgs.commons.SeededRandomPointsInGridBuilder
-
-
Create a builder which will create shapes using the default - GeometryFactory.
-
-
SeededRandomPointsInGridBuilder(long, GeometryFactory) - Constructor for class micycle.pgs.commons.SeededRandomPointsInGridBuilder
-
-
Create a builder which will create shapes using the given - GeometryFactory.
-
-
setAllFillColor(PShape, int) - Static method in class micycle.pgs.PGS_Conversion
-
-
Sets the fill color for the PShape and all of its children recursively (and - disables stroke).
-
-
setAllStrokeColor(PShape, int, double) - Static method in class micycle.pgs.PGS_Conversion
-
-
Sets the stroke color for the PShape and all of its children recursively.
-
-
setAllStrokeToFillColor(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
-
Sets the stroke color equal to the fill color for the PShape and all of its - descendent shapes individually (that is, each child shape belonging to the - shape (if any) will have its stroke color set to its own fill color, - and not the parent-most shape's fill color).
-
-
setAllStrokeToFillColor(PShape, double) - Static method in class micycle.pgs.PGS_Conversion
-
-
Sets the stroke color equal to the fill color, and the strokeWeight to the - specified value, for the PShape and all of its descendent shapes individually - (that is, each child shape belonging to the shape (if any) will have its - stroke color set to its own fill color, and not the parent-most - shape's fill color).
-
-
setConstrainedToCircle(boolean) - Method in class micycle.pgs.commons.SeededRandomPointsInGridBuilder
-
-
Sets whether generated points are constrained to lie within a circle - contained within each grid cell.
-
-
setGutterFraction(double) - Method in class micycle.pgs.commons.SeededRandomPointsInGridBuilder
-
-
Sets the fraction of the grid cell side which will be treated as a gutter, in - which no points will be created.
-
-
ShapeInterpolation - Class in micycle.pgs.commons
-
-
Best-guess interpolation between any two linear rings.
-
-
ShapeInterpolation(Geometry, Geometry) - Constructor for class micycle.pgs.commons.ShapeInterpolation
-
 
-
ShapeInterpolation(LinearRing, LinearRing) - Constructor for class micycle.pgs.commons.ShapeInterpolation
-
 
-
shapeIntersection(PShape, PShape) - Static method in class micycle.pgs.PGS_Processing
-
-
Computes all points of intersection between the perimeter of - two shapes.
-
-
shear(PShape, double, double) - Static method in class micycle.pgs.PGS_Transformation
-
-
Objects are sheared around their relative position to the origin.
-
-
similarity(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Measures the degree of similarity between two shapes using the Hausdorff - distance metric.
-
-
simplify(PShape, double) - Static method in class micycle.pgs.PGS_Morphology
-
-
Simplifies a shape using the Douglas-Peucker algorithm, reducing the - complexity and number of vertices of the shape.
-
-
simplifyDCE(PShape, double) - Static method in class micycle.pgs.PGS_Morphology
-
-
Simplifies a shape via Discrete Curve Evolution.
-
-
simplifyDCE(PShape, int) - Static method in class micycle.pgs.PGS_Morphology
-
-
Simplifies a shape via Discrete Curve Evolution.
-
-
simplifyTopology(PShape, double) - Static method in class micycle.pgs.PGS_Morphology
-
-
Simplifies a shape, whilst preserving the topological structure of the shape - (holes, etc.).
-
-
simplifyVW(PShape, double) - Static method in class micycle.pgs.PGS_Morphology
-
-
Simplifies a shape using the Visvalingam-Whyatt area-based algorithm, - reducing the complexity and number of vertices of the shape.
-
-
sineWarp(PShape, double, int, double) - Static method in class micycle.pgs.PGS_Morphology
-
-
Warps/perturbs a shape by displacing vertices (both positively and - negatively) according to the magnitude of a sine wave which follows the shape - perimeter at some frequency.
-
-
slice(PShape, PVector, PVector) - Static method in class micycle.pgs.PGS_Processing
-
-
Slices a shape using a line given by its start and endpoints.
-
-
SMALLEST_DEGREE_LAST - micycle.pgs.PGS_Coloring.ColoringAlgorithm
-
-
The smallest degree last greedy coloring algorithm.
-
-
smooth(PShape, double) - Static method in class micycle.pgs.PGS_Morphology
-
-
Smoothes a shape.
-
-
smoothGaussian(PShape, double) - Static method in class micycle.pgs.PGS_Morphology
-
-
Smoothes a shape by applying a gaussian filter to vertex coordinates.
-
-
snapHull(PShape, double) - Static method in class micycle.pgs.PGS_Hull
-
-
Computes a hull, having a variable level of convexity, of a shape.
-
-
solveApollonius(PVector, PVector, PVector, int, int, int) - Static method in class micycle.pgs.PGS_Optimisation
-
-
Solves the Problem of Apollonius (finding a circle tangent to three other - circles in the plane).
-
-
spannerFaces(IIncrementalTin, int, boolean) - Static method in class micycle.pgs.PGS_Meshing
-
-
Generates a shape consisting of polygonal faces formed by edges returned by a - greedy sparse spanner applied to a triangulation.
-
-
sphericity(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Measures the sphericity of a shape; the ratio of the maximum inscribed circle - to the minimum bounding circle.
-
-
spiralQuadrangulation(List<PVector>) - Static method in class micycle.pgs.PGS_Meshing
-
-
Produces a quadrangulation from a point set.
-
-
SpiralQuadrangulation - Class in micycle.pgs.commons
-
-
Quadrangulations of Planar Point Sets via the Spiraling Rotating Calipers - Algorithm.
-
-
SpiralQuadrangulation(List<PVector>) - Constructor for class micycle.pgs.commons.SpiralQuadrangulation
-
-
Instantiates a Spiral Quadrangulation.
-
-
split(PShape) - Static method in class micycle.pgs.PGS_Processing
-
-
Splits a shape into 4 equal (as measured be envelope area) quadrants.
-
-
split(PShape, int) - Static method in class micycle.pgs.PGS_Processing
-
-
Splits a shape into 4^(1+recursions) rectangular partitions.
-
-
splitQuadrangulation(IIncrementalTin) - Static method in class micycle.pgs.PGS_Meshing
-
-
Produces a quadrangulation from a triangulation, by splitting each triangle - into three quadrangles (using the Catmull and Clark technique).
-
-
squareGrid(double, double, double, double, double) - Static method in class micycle.pgs.PGS_PointSet
-
-
Generates a square grid/lattice of points that lie within a bounding - rectangle.
-
-
squareLatticePack(PShape, double) - Static method in class micycle.pgs.PGS_CirclePacking
-
-
Generates a tiled circle packing consisting of equal-sized circles arranged - in a square lattice (or grid) bounded by the input shape.
-
-
squareTriangleTiling(double, double, double) - Static method in class micycle.pgs.PGS_Tiling
-
-
Generates a non-periodic tiling, comprising squares and equilateral - triangles.
-
-
squareTriangleTiling(double, double, double, long) - Static method in class micycle.pgs.PGS_Tiling
-
-
Generates a non-periodic tiling, comprising squares and equilateral - triangles, having a given seed.
-
-
SquareTriangleTiling - Class in micycle.pgs.commons
-
-
A non-periodic (quasiperiodic?) tiling, comprising squares and equilateral - triangles.
-
-
SquareTriangleTiling(double, double, double) - Constructor for class micycle.pgs.commons.SquareTriangleTiling
-
 
-
Star - Class in micycle.pgs.commons
-
-
Methods to create star shapes
-
-
stochasticPack(PShape, int, double, boolean) - Static method in class micycle.pgs.PGS_CirclePacking
-
-
Generates a random circle packing of the input shape by generating random - points one-by-one and calculating the maximum radius a circle at each point - can have (such that it's tangent to its nearest circle or a shape vertex).
-
-
stochasticSegments(double, double, int) - Static method in class micycle.pgs.PGS_SegmentSet
-
-
Generates a set of N random non-intersecting line segments via brute-forcing.
-
-
stochasticSegments(double, double, int, double) - Static method in class micycle.pgs.PGS_SegmentSet
-
-
Generates a set of N random non-intersecting line segments of the given - length via brute-forcing.
-
-
stochasticSegments(double, double, int, double, double, long) - Static method in class micycle.pgs.PGS_SegmentSet
-
-
Generates a set of N random non-intersecting line segments via brute-forcing.
-
-
straightSkeleton(PShape) - Static method in class micycle.pgs.PGS_Contour
-
-
Computes the straight skeleton for a shape.
-
-
subtract(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapeBoolean
-
-
Subtract is the opposite of Union.
-
-
subtractMesh(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapeBoolean
-
-
Subtracts a polygonal area from a mesh-like shape / polygonal coverage, - preserving individual faces/features of the mesh during the operation.
-
-
symDifference(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapeBoolean
-
-
Computes the parts that the shapes do not have in common.
-
-
- - - -

T

-
-
tangencyPack(IIncrementalTin, double) - Static method in class micycle.pgs.PGS_CirclePacking
-
-
Generates a circle packing having a pattern of tangencies specified by a - triangulation.
-
-
tangencyPack(IIncrementalTin, double[]) - Static method in class micycle.pgs.PGS_CirclePacking
-
-
Generates a circle packing having a pattern of tangencies specified by a - triangulation.
-
-
TangencyPack - Class in micycle.pgs.commons
-
-
Implements a circle packing algorithm described by Collins and Stephenson - (2003) to find an arrangement of circles which corresponds to a graph of - desired circle tangencies.
-
-
TangencyPack(IIncrementalTin, double) - Constructor for class micycle.pgs.commons.TangencyPack
-
-
Creates a circle packing using tangancies specified by a triangulation.
-
-
TangencyPack(IIncrementalTin, double[]) - Constructor for class micycle.pgs.commons.TangencyPack
-
-
Creates a circle packing using tangancies specified by a triangulation.
-
-
TangencyPack(IIncrementalTin, List<Double>) - Constructor for class micycle.pgs.commons.TangencyPack
-
-
Creates a circle packing using tangancies specified by a triangulation.
-
-
tangentAngle(PShape, double) - Static method in class micycle.pgs.PGS_Processing
-
-
Finds the angle of the line tangent to the shape at a certain point on its - perimeter (given by the some fraction of the distance around the perimeter).
-
-
TETRA - micycle.pgs.PGS_Construction.SierpinskiTriCurveType
-
 
-
toDualGraph(IIncrementalTin) - Static method in class micycle.pgs.PGS_Triangulation
-
-
Finds the dual-graph of a triangulation.
-
-
toDualGraph(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
-
Converts a mesh-like PShape into its undirected, unweighted dual-graph.
-
-
toEncodedPolyline(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
-
Writes a single holeless shape into the string representation of its - Google Encoded Polyline format.
-
-
toGeoJSON(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
-
Writes a shape into the string representation of its GeoJSON format.
-
-
toGraph(IIncrementalTin) - Static method in class micycle.pgs.PGS_Triangulation
-
-
Finds the graph equivalent to a triangulation.
-
-
toGraph(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
-
Converts a shape into a simple graph; graph vertices represent shape - vertices, and graph edges represent shape edges (formed from adjacent - vertices in polygonal shapes).
-
-
toHexWKB(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
-
Writes a shape into the hexadecimal string representation of its - Well-Known Binary format.
-
-
toJava2D(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
-
Creates a Java2D/java.awt Shape representing a PShape.
-
-
toPointsPShape(Collection<PVector>) - Static method in class micycle.pgs.PGS_Conversion
-
-
Transforms a list of points into a POINTS PShape.
-
-
toPShape(Collection<? extends Geometry>) - Static method in class micycle.pgs.PGS_Conversion
-
-
Converts a collection of JTS Geometries to an equivalent GROUP PShape.
-
-
toPShape(Collection<PEdge>) - Static method in class micycle.pgs.PGS_SegmentSet
-
-
Converts a collection of PEdges into a - LINES shape.
-
-
toPShape(Collection<PEdge>, Integer, Integer, Integer) - Static method in class micycle.pgs.PGS_SegmentSet
-
-
Converts a collection of PEdges into a - LINES shape, having the (optional) styling provided.
-
-
toPShape(Geometry) - Static method in class micycle.pgs.PGS_Conversion
-
-
Converts a JTS Geometry to an equivalent PShape.
-
-
toPVector(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
-
Returns the vertices of a PShape as an unclosed list of PVector - coordinates.
-
-
toString() - Method in class micycle.pgs.commons.PEdge
-
 
-
toTinfourGraph(IIncrementalTin) - Static method in class micycle.pgs.PGS_Triangulation
-
-
Finds the graph equivalent to a triangulation.
-
-
touch(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Determines whether the have at least one point in common, but where their - interiors do not intersect.
-
-
touchScale(PShape, PShape, double) - Static method in class micycle.pgs.PGS_Transformation
-
-
Scales a shape (based on its centroid) so that it touches the boundary of - another shape.
-
-
toWKB(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
-
Writes a shape into Well-Known Binary format.
-
-
toWKT(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
-
Writes the Well-Known Text representation of a shape.
-
-
translate(PShape, double, double) - Static method in class micycle.pgs.PGS_Transformation
-
-
Translates a shape by the given coordinates.
-
-
translateCentroidTo(PShape, double, double) - Static method in class micycle.pgs.PGS_Transformation
-
-
Translates a shape such that its centroid is equivalent to the given - coordinates.
-
-
translateCornerTo(PShape, double, double) - Static method in class micycle.pgs.PGS_Transformation
-
-
Translates a shape such that the upper-left corner of its bounding box - is equivalent to the given coordinates.
-
-
translateEnvelopeTo(PShape, double, double) - Static method in class micycle.pgs.PGS_Transformation
-
-
Translates a shape such that the centroid of its bounding box - is equivalent to the given coordinates.
-
-
translateTo(PShape, double, double) - Static method in class micycle.pgs.PGS_Transformation
-
-
Deprecated. -
Use translateCentroidTo() instead.
-
-
-
translateToOrigin(PShape) - Static method in class micycle.pgs.PGS_Transformation
-
-
Translates a shape such that the top-left corner of its bounding box is at - (0, 0) (in Processing coordinates).
-
-
trapezoidPartition(PShape) - Static method in class micycle.pgs.PGS_Processing
-
-
Decomposes/partitions a shape into axis-aligned (stip-like) trazepoids.
-
-
TRI - micycle.pgs.PGS_Construction.SierpinskiTriCurveType
-
 
-
triangleSubdivision(double, double, int) - Static method in class micycle.pgs.PGS_Tiling
-
-
Recursively and randomly subdivides the given/bounded plane into triangles.
-
-
triangleSubdivision(double, double, int, long) - Static method in class micycle.pgs.PGS_Tiling
-
-
Recursively and randomly subdivides the given/bounded plane into triangles.
-
-
TriangleSubdivision - Class in micycle.pgs.commons
-
-
Balanced triangle subdivision.
-
-
TriangleSubdivision(double, double, int, long) - Constructor for class micycle.pgs.commons.TriangleSubdivision
-
 
-
trinscribedPack(PShape, int, int) - Static method in class micycle.pgs.PGS_CirclePacking
-
-
Generates a circle packing of the input shape, using the inscribed circles - (or incircles) of triangles from a triangulation of the shape.
-
-
tween(double) - Method in class micycle.pgs.commons.ShapeInterpolation
-
 
-
- - - -

U

-
-
union(List<PShape>) - Static method in class micycle.pgs.PGS_ShapeBoolean
-
-
Unions any variable number of shapes.
-
-
union(PShape...) - Static method in class micycle.pgs.PGS_ShapeBoolean
-
-
Unions any variable number of shapes.
-
-
union(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapeBoolean
-
-
"Glues" shapes together so they become a single combined shape with the sum - of its areas.
-
-
unionMesh(PShape) - Static method in class micycle.pgs.PGS_ShapeBoolean
-
-
Unions/flattens/merges/dissolves a mesh-like PShape (that is, a GROUP PShape - whose children represent faces that share edges) into a single shape that - represents the boundary of the mesh.
-
-
urquhartFaces(IIncrementalTin, boolean) - Static method in class micycle.pgs.PGS_Meshing
-
-
Generates a shape consisting of polygonal faces of an Urquhart graph.
-
-
- - - -

V

-
-
value() - Method in annotation type micycle.pgs.commons.Nullable
-
 
-
valueOf(String) - Static method in enum micycle.pgs.PGS_Coloring.ColoringAlgorithm
-
-
Returns the enum constant of this type with the specified name.
-
-
valueOf(String) - Static method in enum micycle.pgs.PGS_Construction.SierpinskiTriCurveType
-
-
Returns the enum constant of this type with the specified name.
-
-
valueOf(String) - Static method in enum micycle.pgs.PGS_Contour.OffsetStyle
-
-
Returns the enum constant of this type with the specified name.
-
-
values() - Static method in enum micycle.pgs.PGS_Coloring.ColoringAlgorithm
-
-
Returns an array containing the constants of this enum type, in -the order they are declared.
-
-
values() - Static method in enum micycle.pgs.PGS_Construction.SierpinskiTriCurveType
-
-
Returns an array containing the constants of this enum type, in -the order they are declared.
-
-
values() - Static method in enum micycle.pgs.PGS_Contour.OffsetStyle
-
-
Returns an array containing the constants of this enum type, in -the order they are declared.
-
-
variableBuffer(PShape, double, double) - Static method in class micycle.pgs.PGS_Morphology
-
-
Buffers a shape with a varying buffer distance (interpolated between a start - distance and an end distance) along the shape's perimeter.
-
-
vertexDuals - Variable in class micycle.pgs.commons.IncrementalTinDual
-
-
Maps triangulation vertices to their corresponding/surrounding face in the - dual graph.
-
-
- - - -

W

-
-
width(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
-
Computes the horizontal width of a shape (the width of its bounding-box).
-
-
-A B C D E F G H I L M N O P Q R S T U V W 
All Classes All Packages
-
- - - diff --git a/index.html b/index.html deleted file mode 100644 index 168ad5b6..00000000 --- a/index.html +++ /dev/null @@ -1,175 +0,0 @@ - - - - - -Overview (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-

Processing Geometry Suite 1.3.0 API

-
-
-
- - - - - - - - - - - - - - - - -
Packages 
PackageDescription
micycle.pgs -
Processing Geometry Suite is a software project that provides easy access to - geometric algorithms in the form of a Processing library.
-
micycle.pgs.commons -
The commons package contains all non-core PGS classes (of varying authorship - and either not worth putting in separate package or too long to include - within the calling PGS method itself).
-
-
-
- - - diff --git a/javadoc.sh b/javadoc.sh new file mode 100755 index 00000000..c9d14c87 --- /dev/null +++ b/javadoc.sh @@ -0,0 +1 @@ +/opt/hostedtoolcache/jdk/11.0.20/x64/bin/javadoc @options \ No newline at end of file diff --git a/jquery-ui.overrides.css b/jquery-ui.overrides.css deleted file mode 100644 index facf852c..00000000 --- a/jquery-ui.overrides.css +++ /dev/null @@ -1,35 +0,0 @@ -/* - * Copyright (c) 2020, 2022, 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. - */ - -.ui-state-active, -.ui-widget-content .ui-state-active, -.ui-widget-header .ui-state-active, -a.ui-button:active, -.ui-button:active, -.ui-button.ui-state-active:hover { - /* Overrides the color of selection used in jQuery UI */ - background: #F8981D; - border: 1px solid #F8981D; -} diff --git a/jquery/external/jquery/jquery.js b/jquery/external/jquery/jquery.js deleted file mode 100644 index 50937333..00000000 --- a/jquery/external/jquery/jquery.js +++ /dev/null @@ -1,10872 +0,0 @@ -/*! - * jQuery JavaScript Library v3.5.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: 2020-05-04T22:49Z - */ -( function( global, factory ) { - - "use strict"; - - if ( typeof module === "object" && typeof module.exports === "object" ) { - - // For CommonJS and CommonJS-like environments where a proper `window` - // is present, execute the factory and get jQuery. - // For environments that do not have a `window` with a `document` - // (such as Node.js), expose a factory as module.exports. - // This accentuates the need for the creation of a real `window`. - // e.g. var jQuery = require("jquery")(window); - // See ticket #14549 for more info. - module.exports = global.document ? - factory( global, true ) : - function( w ) { - if ( !w.document ) { - throw new Error( "jQuery requires a window with a document" ); - } - return factory( w ); - }; - } else { - factory( global ); - } - -// Pass this if window is not defined yet -} )( typeof window !== "undefined" ? window : this, function( window, noGlobal ) { - -// Edge <= 12 - 13+, Firefox <=18 - 45+, IE 10 - 11, Safari 5.1 - 9+, iOS 6 - 9.1 -// throw exceptions when non-strict code (e.g., ASP.NET 4.5) accesses strict mode -// arguments.callee.caller (trac-13335). But as of jQuery 3.0 (2016), strict mode should be common -// enough that all such attempts are guarded in a try block. -"use strict"; - -var arr = []; - -var getProto = Object.getPrototypeOf; - -var slice = arr.slice; - -var flat = arr.flat ? function( array ) { - return arr.flat.call( array ); -} : function( array ) { - return arr.concat.apply( [], array ); -}; - - -var push = arr.push; - -var indexOf = arr.indexOf; - -var class2type = {}; - -var toString = class2type.toString; - -var hasOwn = class2type.hasOwnProperty; - -var fnToString = hasOwn.toString; - -var ObjectFunctionString = fnToString.call( Object ); - -var support = {}; - -var isFunction = function isFunction( obj ) { - - // Support: Chrome <=57, Firefox <=52 - // In some browsers, typeof returns "function" for HTML elements - // (i.e., `typeof document.createElement( "object" ) === "function"`). - // We don't want to classify *any* DOM node as a function. - return typeof obj === "function" && typeof obj.nodeType !== "number"; - }; - - -var isWindow = function isWindow( obj ) { - return obj != null && obj === obj.window; - }; - - -var document = window.document; - - - - var preservedScriptAttributes = { - type: true, - src: true, - nonce: true, - noModule: true - }; - - function DOMEval( code, node, doc ) { - doc = doc || document; - - var i, val, - script = doc.createElement( "script" ); - - script.text = code; - if ( node ) { - for ( i in preservedScriptAttributes ) { - - // Support: Firefox 64+, Edge 18+ - // Some browsers don't support the "nonce" property on scripts. - // On the other hand, just using `getAttribute` is not enough as - // the `nonce` attribute is reset to an empty string whenever it - // becomes browsing-context connected. - // See https://github.com/whatwg/html/issues/2369 - // See https://html.spec.whatwg.org/#nonce-attributes - // The `node.getAttribute` check was added for the sake of - // `jQuery.globalEval` so that it can fake a nonce-containing node - // via an object. - val = node[ i ] || node.getAttribute && node.getAttribute( i ); - if ( val ) { - script.setAttribute( i, val ); - } - } - } - doc.head.appendChild( script ).parentNode.removeChild( script ); - } - - -function toType( obj ) { - if ( obj == null ) { - return obj + ""; - } - - // Support: Android <=2.3 only (functionish RegExp) - return typeof obj === "object" || typeof obj === "function" ? - class2type[ toString.call( obj ) ] || "object" : - typeof obj; -} -/* global Symbol */ -// Defining this global in .eslintrc.json would create a danger of using the global -// unguarded in another place, it seems safer to define global only for this module - - - -var - version = "3.5.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 ); - }; - -jQuery.fn = jQuery.prototype = { - - // The current version of jQuery being used - jquery: version, - - constructor: jQuery, - - // The default length of a jQuery object is 0 - length: 0, - - toArray: function() { - return slice.call( this ); - }, - - // Get the Nth element in the matched element set OR - // Get the whole matched element set as a clean array - get: function( num ) { - - // Return all the elements in a clean array - if ( num == null ) { - return slice.call( this ); - } - - // Return just the one element from the set - return num < 0 ? this[ num + this.length ] : this[ num ]; - }, - - // Take an array of elements and push it onto the stack - // (returning the new matched element set) - pushStack: function( elems ) { - - // Build a new jQuery matched element set - var ret = jQuery.merge( this.constructor(), elems ); - - // Add the old object onto the stack (as a reference) - ret.prevObject = this; - - // Return the newly-formed element set - return ret; - }, - - // Execute a callback for every element in the matched set. - each: function( callback ) { - return jQuery.each( this, callback ); - }, - - map: function( callback ) { - return this.pushStack( jQuery.map( this, function( elem, i ) { - return callback.call( elem, i, elem ); - } ) ); - }, - - slice: function() { - return this.pushStack( slice.apply( this, arguments ) ); - }, - - first: function() { - return this.eq( 0 ); - }, - - last: function() { - return this.eq( -1 ); - }, - - even: function() { - return this.pushStack( jQuery.grep( this, function( _elem, i ) { - return ( i + 1 ) % 2; - } ) ); - }, - - odd: function() { - return this.pushStack( jQuery.grep( this, function( _elem, i ) { - return i % 2; - } ) ); - }, - - eq: function( i ) { - var len = this.length, - j = +i + ( i < 0 ? len : 0 ); - return this.pushStack( j >= 0 && j < len ? [ this[ j ] ] : [] ); - }, - - end: function() { - return this.prevObject || this.constructor(); - }, - - // For internal use only. - // Behaves like an Array's method, not like a jQuery method. - push: push, - sort: arr.sort, - splice: arr.splice -}; - -jQuery.extend = jQuery.fn.extend = function() { - var options, name, src, copy, copyIsArray, clone, - target = arguments[ 0 ] || {}, - i = 1, - length = arguments.length, - deep = false; - - // Handle a deep copy situation - if ( typeof target === "boolean" ) { - deep = target; - - // Skip the boolean and the target - target = arguments[ i ] || {}; - i++; - } - - // Handle case when target is a string or something (possible in deep copy) - if ( typeof target !== "object" && !isFunction( target ) ) { - target = {}; - } - - // Extend jQuery itself if only one argument is passed - if ( i === length ) { - target = this; - i--; - } - - for ( ; i < length; i++ ) { - - // Only deal with non-null/undefined values - if ( ( options = arguments[ i ] ) != null ) { - - // Extend the base object - for ( name in options ) { - copy = options[ name ]; - - // Prevent Object.prototype pollution - // Prevent never-ending loop - if ( name === "__proto__" || target === copy ) { - continue; - } - - // Recurse if we're merging plain objects or arrays - if ( deep && copy && ( jQuery.isPlainObject( copy ) || - ( copyIsArray = Array.isArray( copy ) ) ) ) { - src = target[ name ]; - - // Ensure proper type for the source value - if ( copyIsArray && !Array.isArray( src ) ) { - clone = []; - } else if ( !copyIsArray && !jQuery.isPlainObject( src ) ) { - clone = {}; - } else { - clone = src; - } - copyIsArray = false; - - // Never move original objects, clone them - target[ name ] = jQuery.extend( deep, clone, copy ); - - // Don't bring in undefined values - } else if ( copy !== undefined ) { - target[ name ] = copy; - } - } - } - } - - // Return the modified object - return target; -}; - -jQuery.extend( { - - // Unique for each copy of jQuery on the page - expando: "jQuery" + ( version + Math.random() ).replace( /\D/g, "" ), - - // Assume jQuery is ready without the ready module - isReady: true, - - error: function( msg ) { - throw new Error( msg ); - }, - - noop: function() {}, - - isPlainObject: function( obj ) { - var proto, Ctor; - - // Detect obvious negatives - // Use toString instead of jQuery.type to catch host objects - if ( !obj || toString.call( obj ) !== "[object Object]" ) { - return false; - } - - proto = getProto( obj ); - - // Objects with no prototype (e.g., `Object.create( null )`) are plain - if ( !proto ) { - return true; - } - - // Objects with prototype are plain iff they were constructed by a global Object function - Ctor = hasOwn.call( proto, "constructor" ) && proto.constructor; - return typeof Ctor === "function" && fnToString.call( Ctor ) === ObjectFunctionString; - }, - - isEmptyObject: function( obj ) { - var name; - - for ( name in obj ) { - return false; - } - return true; - }, - - // Evaluates a script in a provided context; falls back to the global one - // if not specified. - globalEval: function( code, options, doc ) { - DOMEval( code, { nonce: options && options.nonce }, doc ); - }, - - each: function( obj, callback ) { - var length, i = 0; - - if ( isArrayLike( obj ) ) { - length = obj.length; - for ( ; i < length; i++ ) { - if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) { - break; - } - } - } else { - for ( i in obj ) { - if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) { - break; - } - } - } - - return obj; - }, - - // results is for internal usage only - makeArray: function( arr, results ) { - var ret = results || []; - - if ( arr != null ) { - if ( isArrayLike( Object( arr ) ) ) { - jQuery.merge( ret, - typeof arr === "string" ? - [ arr ] : arr - ); - } else { - push.call( ret, arr ); - } - } - - return ret; - }, - - inArray: function( elem, arr, i ) { - return arr == null ? -1 : indexOf.call( arr, elem, i ); - }, - - // Support: Android <=4.0 only, PhantomJS 1 only - // push.apply(_, arraylike) throws on ancient WebKit - merge: function( first, second ) { - var len = +second.length, - j = 0, - i = first.length; - - for ( ; j < len; j++ ) { - first[ i++ ] = second[ j ]; - } - - first.length = i; - - return first; - }, - - grep: function( elems, callback, invert ) { - var callbackInverse, - matches = [], - i = 0, - length = elems.length, - callbackExpect = !invert; - - // Go through the array, only saving the items - // that pass the validator function - for ( ; i < length; i++ ) { - callbackInverse = !callback( elems[ i ], i ); - if ( callbackInverse !== callbackExpect ) { - matches.push( elems[ i ] ); - } - } - - return matches; - }, - - // arg is for internal usage only - map: function( elems, callback, arg ) { - var length, value, - i = 0, - ret = []; - - // Go through the array, translating each of the items to their new values - if ( isArrayLike( elems ) ) { - length = elems.length; - for ( ; i < length; i++ ) { - value = callback( elems[ i ], i, arg ); - - if ( value != null ) { - ret.push( value ); - } - } - - // Go through every key on the object, - } else { - for ( i in elems ) { - value = callback( elems[ i ], i, arg ); - - if ( value != null ) { - ret.push( value ); - } - } - } - - // Flatten any nested arrays - return flat( ret ); - }, - - // A global GUID counter for objects - guid: 1, - - // jQuery.support is not used in Core but other projects attach their - // properties to it so it needs to exist. - support: support -} ); - -if ( typeof Symbol === "function" ) { - jQuery.fn[ Symbol.iterator ] = arr[ Symbol.iterator ]; -} - -// Populate the class2type map -jQuery.each( "Boolean Number String Function Array Date RegExp Object Error Symbol".split( " " ), -function( _i, name ) { - class2type[ "[object " + name + "]" ] = name.toLowerCase(); -} ); - -function isArrayLike( obj ) { - - // Support: real iOS 8.2 only (not reproducible in simulator) - // `in` check used to prevent JIT error (gh-2145) - // hasOwn isn't used here due to false negatives - // regarding Nodelist length in IE - var length = !!obj && "length" in obj && obj.length, - type = toType( obj ); - - if ( isFunction( obj ) || isWindow( obj ) ) { - return false; - } - - return type === "array" || length === 0 || - typeof length === "number" && length > 0 && ( length - 1 ) in obj; -} -var Sizzle = -/*! - * Sizzle CSS Selector Engine v2.3.5 - * https://sizzlejs.com/ - * - * Copyright JS Foundation and other contributors - * Released under the MIT license - * https://js.foundation/ - * - * Date: 2020-03-14 - */ -( function( window ) { -var i, - support, - Expr, - getText, - isXML, - tokenize, - compile, - select, - outermostContext, - sortInput, - hasDuplicate, - - // Local document vars - setDocument, - document, - docElem, - documentIsHTML, - rbuggyQSA, - rbuggyMatches, - matches, - contains, - - // Instance-specific data - expando = "sizzle" + 1 * new Date(), - preferredDoc = window.document, - dirruns = 0, - done = 0, - classCache = createCache(), - tokenCache = createCache(), - compilerCache = createCache(), - nonnativeSelectorCache = createCache(), - sortOrder = function( a, b ) { - if ( a === b ) { - hasDuplicate = true; - } - return 0; - }, - - // Instance methods - hasOwn = ( {} ).hasOwnProperty, - arr = [], - pop = arr.pop, - pushNative = arr.push, - push = arr.push, - slice = arr.slice, - - // Use a stripped-down indexOf as it's faster than native - // https://jsperf.com/thor-indexof-vs-for/5 - indexOf = function( list, elem ) { - var i = 0, - len = list.length; - for ( ; i < len; i++ ) { - if ( list[ i ] === elem ) { - return i; - } - } - return -1; - }, - - booleans = "checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|" + - "ismap|loop|multiple|open|readonly|required|scoped", - - // Regular expressions - - // http://www.w3.org/TR/css3-selectors/#whitespace - whitespace = "[\\x20\\t\\r\\n\\f]", - - // https://www.w3.org/TR/css-syntax-3/#ident-token-diagram - identifier = "(?:\\\\[\\da-fA-F]{1,6}" + whitespace + - "?|\\\\[^\\r\\n\\f]|[\\w-]|[^\0-\\x7f])+", - - // Attribute selectors: http://www.w3.org/TR/selectors/#attribute-selectors - attributes = "\\[" + whitespace + "*(" + identifier + ")(?:" + whitespace + - - // Operator (capture 2) - "*([*^$|!~]?=)" + whitespace + - - // "Attribute values must be CSS identifiers [capture 5] - // or strings [capture 3 or capture 4]" - "*(?:'((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\"|(" + identifier + "))|)" + - whitespace + "*\\]", - - pseudos = ":(" + identifier + ")(?:\\((" + - - // To reduce the number of selectors needing tokenize in the preFilter, prefer arguments: - // 1. quoted (capture 3; capture 4 or capture 5) - "('((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\")|" + - - // 2. simple (capture 6) - "((?:\\\\.|[^\\\\()[\\]]|" + attributes + ")*)|" + - - // 3. anything else (capture 2) - ".*" + - ")\\)|)", - - // Leading and non-escaped trailing whitespace, capturing some non-whitespace characters preceding the latter - rwhitespace = new RegExp( whitespace + "+", "g" ), - rtrim = new RegExp( "^" + whitespace + "+|((?:^|[^\\\\])(?:\\\\.)*)" + - whitespace + "+$", "g" ), - - rcomma = new RegExp( "^" + whitespace + "*," + whitespace + "*" ), - rcombinators = new RegExp( "^" + whitespace + "*([>+~]|" + whitespace + ")" + whitespace + - "*" ), - rdescend = new RegExp( whitespace + "|>" ), - - rpseudo = new RegExp( pseudos ), - ridentifier = new RegExp( "^" + identifier + "$" ), - - matchExpr = { - "ID": new RegExp( "^#(" + identifier + ")" ), - "CLASS": new RegExp( "^\\.(" + identifier + ")" ), - "TAG": new RegExp( "^(" + identifier + "|[*])" ), - "ATTR": new RegExp( "^" + attributes ), - "PSEUDO": new RegExp( "^" + pseudos ), - "CHILD": new RegExp( "^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\(" + - whitespace + "*(even|odd|(([+-]|)(\\d*)n|)" + whitespace + "*(?:([+-]|)" + - whitespace + "*(\\d+)|))" + whitespace + "*\\)|)", "i" ), - "bool": new RegExp( "^(?:" + booleans + ")$", "i" ), - - // For use in libraries implementing .is() - // We use this for POS matching in `select` - "needsContext": new RegExp( "^" + whitespace + - "*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\(" + whitespace + - "*((?:-\\d)?\\d*)" + whitespace + "*\\)|)(?=[^-]|$)", "i" ) - }, - - rhtml = /HTML$/i, - rinputs = /^(?:input|select|textarea|button)$/i, - rheader = /^h\d$/i, - - rnative = /^[^{]+\{\s*\[native \w/, - - // Easily-parseable/retrievable ID or TAG or CLASS selectors - rquickExpr = /^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/, - - rsibling = /[+~]/, - - // CSS escapes - // http://www.w3.org/TR/CSS21/syndata.html#escaped-characters - runescape = new RegExp( "\\\\[\\da-fA-F]{1,6}" + whitespace + "?|\\\\([^\\r\\n\\f])", "g" ), - funescape = function( escape, nonHex ) { - var high = "0x" + escape.slice( 1 ) - 0x10000; - - return nonHex ? - - // Strip the backslash prefix from a non-hex escape sequence - nonHex : - - // Replace a hexadecimal escape sequence with the encoded Unicode code point - // Support: IE <=11+ - // For values outside the Basic Multilingual Plane (BMP), manually construct a - // surrogate pair - high < 0 ? - String.fromCharCode( high + 0x10000 ) : - String.fromCharCode( high >> 10 | 0xD800, high & 0x3FF | 0xDC00 ); - }, - - // CSS string/identifier serialization - // https://drafts.csswg.org/cssom/#common-serializing-idioms - rcssescape = /([\0-\x1f\x7f]|^-?\d)|^-$|[^\0-\x1f\x7f-\uFFFF\w-]/g, - fcssescape = function( ch, asCodePoint ) { - if ( asCodePoint ) { - - // U+0000 NULL becomes U+FFFD REPLACEMENT CHARACTER - if ( ch === "\0" ) { - return "\uFFFD"; - } - - // Control characters and (dependent upon position) numbers get escaped as code points - return ch.slice( 0, -1 ) + "\\" + - ch.charCodeAt( ch.length - 1 ).toString( 16 ) + " "; - } - - // Other potentially-special ASCII characters get backslash-escaped - return "\\" + ch; - }, - - // Used for iframes - // See setDocument() - // Removing the function wrapper causes a "Permission Denied" - // error in IE - unloadHandler = function() { - setDocument(); - }, - - inDisabledFieldset = addCombinator( - function( elem ) { - return elem.disabled === true && elem.nodeName.toLowerCase() === "fieldset"; - }, - { dir: "parentNode", next: "legend" } - ); - -// Optimize for push.apply( _, NodeList ) -try { - push.apply( - ( arr = slice.call( preferredDoc.childNodes ) ), - preferredDoc.childNodes - ); - - // Support: Android<4.0 - // Detect silently failing push.apply - // eslint-disable-next-line no-unused-expressions - arr[ preferredDoc.childNodes.length ].nodeType; -} catch ( e ) { - push = { apply: arr.length ? - - // Leverage slice if possible - function( target, els ) { - pushNative.apply( target, slice.call( els ) ); - } : - - // Support: IE<9 - // Otherwise append directly - function( target, els ) { - var j = target.length, - i = 0; - - // Can't trust NodeList.length - while ( ( target[ j++ ] = els[ i++ ] ) ) {} - target.length = j - 1; - } - }; -} - -function Sizzle( selector, context, results, seed ) { - var m, i, elem, nid, match, groups, newSelector, - newContext = context && context.ownerDocument, - - // nodeType defaults to 9, since context defaults to document - nodeType = context ? context.nodeType : 9; - - results = results || []; - - // Return early from calls with invalid selector or context - if ( typeof selector !== "string" || !selector || - nodeType !== 1 && nodeType !== 9 && nodeType !== 11 ) { - - return results; - } - - // Try to shortcut find operations (as opposed to filters) in HTML documents - if ( !seed ) { - setDocument( context ); - context = context || document; - - if ( documentIsHTML ) { - - // If the selector is sufficiently simple, try using a "get*By*" DOM method - // (excepting DocumentFragment context, where the methods don't exist) - if ( nodeType !== 11 && ( match = rquickExpr.exec( selector ) ) ) { - - // ID selector - if ( ( m = match[ 1 ] ) ) { - - // Document context - if ( nodeType === 9 ) { - if ( ( elem = context.getElementById( m ) ) ) { - - // Support: IE, Opera, Webkit - // TODO: identify versions - // getElementById can match elements by name instead of ID - if ( elem.id === m ) { - results.push( elem ); - return results; - } - } else { - return results; - } - - // Element context - } else { - - // Support: IE, Opera, Webkit - // TODO: identify versions - // getElementById can match elements by name instead of ID - if ( newContext && ( elem = newContext.getElementById( m ) ) && - contains( context, elem ) && - elem.id === m ) { - - results.push( elem ); - return results; - } - } - - // Type selector - } else if ( match[ 2 ] ) { - push.apply( results, context.getElementsByTagName( selector ) ); - return results; - - // Class selector - } else if ( ( m = match[ 3 ] ) && support.getElementsByClassName && - context.getElementsByClassName ) { - - push.apply( results, context.getElementsByClassName( m ) ); - return results; - } - } - - // Take advantage of querySelectorAll - if ( support.qsa && - !nonnativeSelectorCache[ selector + " " ] && - ( !rbuggyQSA || !rbuggyQSA.test( selector ) ) && - - // Support: IE 8 only - // Exclude object elements - ( nodeType !== 1 || context.nodeName.toLowerCase() !== "object" ) ) { - - newSelector = selector; - newContext = context; - - // qSA considers elements outside a scoping root when evaluating child or - // descendant combinators, which is not what we want. - // In such cases, we work around the behavior by prefixing every selector in the - // list with an ID selector referencing the scope context. - // The technique has to be used as well when a leading combinator is used - // as such selectors are not recognized by querySelectorAll. - // Thanks to Andrew Dupont for this technique. - if ( nodeType === 1 && - ( rdescend.test( selector ) || rcombinators.test( selector ) ) ) { - - // Expand context for sibling selectors - newContext = rsibling.test( selector ) && testContext( context.parentNode ) || - context; - - // We can use :scope instead of the ID hack if the browser - // supports it & if we're not changing the context. - if ( newContext !== context || !support.scope ) { - - // Capture the context ID, setting it first if necessary - if ( ( nid = context.getAttribute( "id" ) ) ) { - nid = nid.replace( rcssescape, fcssescape ); - } else { - context.setAttribute( "id", ( nid = expando ) ); - } - } - - // Prefix every selector in the list - groups = tokenize( selector ); - i = groups.length; - while ( i-- ) { - groups[ i ] = ( nid ? "#" + nid : ":scope" ) + " " + - toSelector( groups[ i ] ); - } - newSelector = groups.join( "," ); - } - - try { - push.apply( results, - newContext.querySelectorAll( newSelector ) - ); - return results; - } catch ( qsaError ) { - nonnativeSelectorCache( selector, true ); - } finally { - if ( nid === expando ) { - context.removeAttribute( "id" ); - } - } - } - } - } - - // All others - return select( selector.replace( rtrim, "$1" ), context, results, seed ); -} - -/** - * Create key-value caches of limited size - * @returns {function(string, object)} Returns the Object data after storing it on itself with - * property name the (space-suffixed) string and (if the cache is larger than Expr.cacheLength) - * deleting the oldest entry - */ -function createCache() { - var keys = []; - - function cache( key, value ) { - - // Use (key + " ") to avoid collision with native prototype properties (see Issue #157) - if ( keys.push( key + " " ) > Expr.cacheLength ) { - - // Only keep the most recent entries - delete cache[ keys.shift() ]; - } - return ( cache[ key + " " ] = value ); - } - return cache; -} - -/** - * Mark a function for special use by Sizzle - * @param {Function} fn The function to mark - */ -function markFunction( fn ) { - fn[ expando ] = true; - return fn; -} - -/** - * Support testing using an element - * @param {Function} fn Passed the created element and returns a boolean result - */ -function assert( fn ) { - var el = document.createElement( "fieldset" ); - - try { - return !!fn( el ); - } catch ( e ) { - return false; - } finally { - - // Remove from its parent by default - if ( el.parentNode ) { - el.parentNode.removeChild( el ); - } - - // release memory in IE - el = null; - } -} - -/** - * Adds the same handler for all of the specified attrs - * @param {String} attrs Pipe-separated list of attributes - * @param {Function} handler The method that will be applied - */ -function addHandle( attrs, handler ) { - var arr = attrs.split( "|" ), - i = arr.length; - - while ( i-- ) { - Expr.attrHandle[ arr[ i ] ] = handler; - } -} - -/** - * Checks document order of two siblings - * @param {Element} a - * @param {Element} b - * @returns {Number} Returns less than 0 if a precedes b, greater than 0 if a follows b - */ -function siblingCheck( a, b ) { - var cur = b && a, - diff = cur && a.nodeType === 1 && b.nodeType === 1 && - a.sourceIndex - b.sourceIndex; - - // Use IE sourceIndex if available on both nodes - if ( diff ) { - return diff; - } - - // Check if b follows a - if ( cur ) { - while ( ( cur = cur.nextSibling ) ) { - if ( cur === b ) { - return -1; - } - } - } - - return a ? 1 : -1; -} - -/** - * Returns a function to use in pseudos for input types - * @param {String} type - */ -function createInputPseudo( type ) { - return function( elem ) { - var name = elem.nodeName.toLowerCase(); - return name === "input" && elem.type === type; - }; -} - -/** - * Returns a function to use in pseudos for buttons - * @param {String} type - */ -function createButtonPseudo( type ) { - return function( elem ) { - var name = elem.nodeName.toLowerCase(); - return ( name === "input" || name === "button" ) && elem.type === type; - }; -} - -/** - * Returns a function to use in pseudos for :enabled/:disabled - * @param {Boolean} disabled true for :disabled; false for :enabled - */ -function createDisabledPseudo( disabled ) { - - // Known :disabled false positives: fieldset[disabled] > legend:nth-of-type(n+2) :can-disable - return function( elem ) { - - // Only certain elements can match :enabled or :disabled - // https://html.spec.whatwg.org/multipage/scripting.html#selector-enabled - // https://html.spec.whatwg.org/multipage/scripting.html#selector-disabled - if ( "form" in elem ) { - - // Check for inherited disabledness on relevant non-disabled elements: - // * listed form-associated elements in a disabled fieldset - // https://html.spec.whatwg.org/multipage/forms.html#category-listed - // https://html.spec.whatwg.org/multipage/forms.html#concept-fe-disabled - // * option elements in a disabled optgroup - // https://html.spec.whatwg.org/multipage/forms.html#concept-option-disabled - // All such elements have a "form" property. - if ( elem.parentNode && elem.disabled === false ) { - - // Option elements defer to a parent optgroup if present - if ( "label" in elem ) { - if ( "label" in elem.parentNode ) { - return elem.parentNode.disabled === disabled; - } else { - return elem.disabled === disabled; - } - } - - // Support: IE 6 - 11 - // Use the isDisabled shortcut property to check for disabled fieldset ancestors - return elem.isDisabled === disabled || - - // Where there is no isDisabled, check manually - /* jshint -W018 */ - elem.isDisabled !== !disabled && - inDisabledFieldset( elem ) === disabled; - } - - return elem.disabled === disabled; - - // Try to winnow out elements that can't be disabled before trusting the disabled property. - // Some victims get caught in our net (label, legend, menu, track), but it shouldn't - // even exist on them, let alone have a boolean value. - } else if ( "label" in elem ) { - return elem.disabled === disabled; - } - - // Remaining elements are neither :enabled nor :disabled - return false; - }; -} - -/** - * Returns a function to use in pseudos for positionals - * @param {Function} fn - */ -function createPositionalPseudo( fn ) { - return markFunction( function( argument ) { - argument = +argument; - return markFunction( function( seed, matches ) { - var j, - matchIndexes = fn( [], seed.length, argument ), - i = matchIndexes.length; - - // Match elements found at the specified indexes - while ( i-- ) { - if ( seed[ ( j = matchIndexes[ i ] ) ] ) { - seed[ j ] = !( matches[ j ] = seed[ j ] ); - } - } - } ); - } ); -} - -/** - * Checks a node for validity as a Sizzle context - * @param {Element|Object=} context - * @returns {Element|Object|Boolean} The input node if acceptable, otherwise a falsy value - */ -function testContext( context ) { - return context && typeof context.getElementsByTagName !== "undefined" && context; -} - -// Expose support vars for convenience -support = Sizzle.support = {}; - -/** - * Detects XML nodes - * @param {Element|Object} elem An element or a document - * @returns {Boolean} True iff elem is a non-HTML XML node - */ -isXML = Sizzle.isXML = function( elem ) { - var namespace = elem.namespaceURI, - docElem = ( elem.ownerDocument || elem ).documentElement; - - // Support: IE <=8 - // Assume HTML when documentElement doesn't yet exist, such as inside loading iframes - // https://bugs.jquery.com/ticket/4833 - return !rhtml.test( namespace || docElem && docElem.nodeName || "HTML" ); -}; - -/** - * Sets document-related variables once based on the current document - * @param {Element|Object} [doc] An element or document object to use to set the document - * @returns {Object} Returns the current document - */ -setDocument = Sizzle.setDocument = function( node ) { - var hasCompare, subWindow, - doc = node ? node.ownerDocument || node : preferredDoc; - - // Return early if doc is invalid or already selected - // Support: IE 11+, Edge 17 - 18+ - // IE/Edge sometimes throw a "Permission denied" error when strict-comparing - // two documents; shallow comparisons work. - // eslint-disable-next-line eqeqeq - if ( doc == document || doc.nodeType !== 9 || !doc.documentElement ) { - return document; - } - - // Update global variables - document = doc; - docElem = document.documentElement; - documentIsHTML = !isXML( document ); - - // Support: IE 9 - 11+, Edge 12 - 18+ - // Accessing iframe documents after unload throws "permission denied" errors (jQuery #13936) - // Support: IE 11+, Edge 17 - 18+ - // IE/Edge sometimes throw a "Permission denied" error when strict-comparing - // two documents; shallow comparisons work. - // eslint-disable-next-line eqeqeq - if ( preferredDoc != document && - ( subWindow = document.defaultView ) && subWindow.top !== subWindow ) { - - // Support: IE 11, Edge - if ( subWindow.addEventListener ) { - subWindow.addEventListener( "unload", unloadHandler, false ); - - // Support: IE 9 - 10 only - } else if ( subWindow.attachEvent ) { - subWindow.attachEvent( "onunload", unloadHandler ); - } - } - - // Support: IE 8 - 11+, Edge 12 - 18+, Chrome <=16 - 25 only, Firefox <=3.6 - 31 only, - // Safari 4 - 5 only, Opera <=11.6 - 12.x only - // IE/Edge & older browsers don't support the :scope pseudo-class. - // Support: Safari 6.0 only - // Safari 6.0 supports :scope but it's an alias of :root there. - support.scope = assert( function( el ) { - docElem.appendChild( el ).appendChild( document.createElement( "div" ) ); - return typeof el.querySelectorAll !== "undefined" && - !el.querySelectorAll( ":scope fieldset div" ).length; - } ); - - /* Attributes - ---------------------------------------------------------------------- */ - - // Support: IE<8 - // Verify that getAttribute really returns attributes and not properties - // (excepting IE8 booleans) - support.attributes = assert( function( el ) { - el.className = "i"; - return !el.getAttribute( "className" ); - } ); - - /* getElement(s)By* - ---------------------------------------------------------------------- */ - - // Check if getElementsByTagName("*") returns only elements - support.getElementsByTagName = assert( function( el ) { - el.appendChild( document.createComment( "" ) ); - return !el.getElementsByTagName( "*" ).length; - } ); - - // Support: IE<9 - support.getElementsByClassName = rnative.test( document.getElementsByClassName ); - - // Support: IE<10 - // Check if getElementById returns elements by name - // The broken getElementById methods don't pick up programmatically-set names, - // so use a roundabout getElementsByName test - support.getById = assert( function( el ) { - docElem.appendChild( el ).id = expando; - return !document.getElementsByName || !document.getElementsByName( expando ).length; - } ); - - // ID filter and find - if ( support.getById ) { - Expr.filter[ "ID" ] = function( id ) { - var attrId = id.replace( runescape, funescape ); - return function( elem ) { - return elem.getAttribute( "id" ) === attrId; - }; - }; - Expr.find[ "ID" ] = function( id, context ) { - if ( typeof context.getElementById !== "undefined" && documentIsHTML ) { - var elem = context.getElementById( id ); - return elem ? [ elem ] : []; - } - }; - } else { - Expr.filter[ "ID" ] = function( id ) { - var attrId = id.replace( runescape, funescape ); - return function( elem ) { - var node = typeof elem.getAttributeNode !== "undefined" && - elem.getAttributeNode( "id" ); - return node && node.value === attrId; - }; - }; - - // Support: IE 6 - 7 only - // getElementById is not reliable as a find shortcut - Expr.find[ "ID" ] = function( id, context ) { - if ( typeof context.getElementById !== "undefined" && documentIsHTML ) { - var node, i, elems, - elem = context.getElementById( id ); - - if ( elem ) { - - // Verify the id attribute - node = elem.getAttributeNode( "id" ); - if ( node && node.value === id ) { - return [ elem ]; - } - - // Fall back on getElementsByName - elems = context.getElementsByName( id ); - i = 0; - while ( ( elem = elems[ i++ ] ) ) { - node = elem.getAttributeNode( "id" ); - if ( node && node.value === id ) { - return [ elem ]; - } - } - } - - return []; - } - }; - } - - // Tag - Expr.find[ "TAG" ] = support.getElementsByTagName ? - function( tag, context ) { - if ( typeof context.getElementsByTagName !== "undefined" ) { - return context.getElementsByTagName( tag ); - - // DocumentFragment nodes don't have gEBTN - } else if ( support.qsa ) { - return context.querySelectorAll( tag ); - } - } : - - function( tag, context ) { - var elem, - tmp = [], - i = 0, - - // By happy coincidence, a (broken) gEBTN appears on DocumentFragment nodes too - results = context.getElementsByTagName( tag ); - - // Filter out possible comments - if ( tag === "*" ) { - while ( ( elem = results[ i++ ] ) ) { - if ( elem.nodeType === 1 ) { - tmp.push( elem ); - } - } - - return tmp; - } - return results; - }; - - // Class - Expr.find[ "CLASS" ] = support.getElementsByClassName && function( className, context ) { - if ( typeof context.getElementsByClassName !== "undefined" && documentIsHTML ) { - return context.getElementsByClassName( className ); - } - }; - - /* QSA/matchesSelector - ---------------------------------------------------------------------- */ - - // QSA and matchesSelector support - - // matchesSelector(:active) reports false when true (IE9/Opera 11.5) - rbuggyMatches = []; - - // qSa(:focus) reports false when true (Chrome 21) - // We allow this because of a bug in IE8/9 that throws an error - // whenever `document.activeElement` is accessed on an iframe - // So, we allow :focus to pass through QSA all the time to avoid the IE error - // See https://bugs.jquery.com/ticket/13378 - rbuggyQSA = []; - - if ( ( support.qsa = rnative.test( document.querySelectorAll ) ) ) { - - // Build QSA regex - // Regex strategy adopted from Diego Perini - assert( function( el ) { - - var input; - - // Select is set to empty string on purpose - // This is to test IE's treatment of not explicitly - // setting a boolean content attribute, - // since its presence should be enough - // https://bugs.jquery.com/ticket/12359 - docElem.appendChild( el ).innerHTML = "" + - ""; - - // Support: IE8, Opera 11-12.16 - // Nothing should be selected when empty strings follow ^= or $= or *= - // The test attribute must be unknown in Opera but "safe" for WinRT - // https://msdn.microsoft.com/en-us/library/ie/hh465388.aspx#attribute_section - if ( el.querySelectorAll( "[msallowcapture^='']" ).length ) { - rbuggyQSA.push( "[*^$]=" + whitespace + "*(?:''|\"\")" ); - } - - // Support: IE8 - // Boolean attributes and "value" are not treated correctly - if ( !el.querySelectorAll( "[selected]" ).length ) { - rbuggyQSA.push( "\\[" + whitespace + "*(?:value|" + booleans + ")" ); - } - - // Support: Chrome<29, Android<4.4, Safari<7.0+, iOS<7.0+, PhantomJS<1.9.8+ - if ( !el.querySelectorAll( "[id~=" + expando + "-]" ).length ) { - rbuggyQSA.push( "~=" ); - } - - // Support: IE 11+, Edge 15 - 18+ - // IE 11/Edge don't find elements on a `[name='']` query in some cases. - // Adding a temporary attribute to the document before the selection works - // around the issue. - // Interestingly, IE 10 & older don't seem to have the issue. - input = document.createElement( "input" ); - input.setAttribute( "name", "" ); - el.appendChild( input ); - if ( !el.querySelectorAll( "[name='']" ).length ) { - rbuggyQSA.push( "\\[" + whitespace + "*name" + whitespace + "*=" + - whitespace + "*(?:''|\"\")" ); - } - - // Webkit/Opera - :checked should return selected option elements - // http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked - // IE8 throws error here and will not see later tests - if ( !el.querySelectorAll( ":checked" ).length ) { - rbuggyQSA.push( ":checked" ); - } - - // Support: Safari 8+, iOS 8+ - // https://bugs.webkit.org/show_bug.cgi?id=136851 - // In-page `selector#id sibling-combinator selector` fails - if ( !el.querySelectorAll( "a#" + expando + "+*" ).length ) { - rbuggyQSA.push( ".#.+[+~]" ); - } - - // Support: Firefox <=3.6 - 5 only - // Old Firefox doesn't throw on a badly-escaped identifier. - el.querySelectorAll( "\\\f" ); - rbuggyQSA.push( "[\\r\\n\\f]" ); - } ); - - assert( function( el ) { - el.innerHTML = "" + - ""; - - // Support: Windows 8 Native Apps - // The type and name attributes are restricted during .innerHTML assignment - var input = document.createElement( "input" ); - input.setAttribute( "type", "hidden" ); - el.appendChild( input ).setAttribute( "name", "D" ); - - // Support: IE8 - // Enforce case-sensitivity of name attribute - if ( el.querySelectorAll( "[name=d]" ).length ) { - rbuggyQSA.push( "name" + whitespace + "*[*^$|!~]?=" ); - } - - // FF 3.5 - :enabled/:disabled and hidden elements (hidden elements are still enabled) - // IE8 throws error here and will not see later tests - if ( el.querySelectorAll( ":enabled" ).length !== 2 ) { - rbuggyQSA.push( ":enabled", ":disabled" ); - } - - // Support: IE9-11+ - // IE's :disabled selector does not pick up the children of disabled fieldsets - docElem.appendChild( el ).disabled = true; - if ( el.querySelectorAll( ":disabled" ).length !== 2 ) { - rbuggyQSA.push( ":enabled", ":disabled" ); - } - - // Support: Opera 10 - 11 only - // Opera 10-11 does not throw on post-comma invalid pseudos - el.querySelectorAll( "*,:x" ); - rbuggyQSA.push( ",.*:" ); - } ); - } - - if ( ( support.matchesSelector = rnative.test( ( matches = docElem.matches || - docElem.webkitMatchesSelector || - docElem.mozMatchesSelector || - docElem.oMatchesSelector || - docElem.msMatchesSelector ) ) ) ) { - - assert( function( el ) { - - // Check to see if it's possible to do matchesSelector - // on a disconnected node (IE 9) - support.disconnectedMatch = matches.call( el, "*" ); - - // This should fail with an exception - // Gecko does not error, returns false instead - matches.call( el, "[s!='']:x" ); - rbuggyMatches.push( "!=", pseudos ); - } ); - } - - rbuggyQSA = rbuggyQSA.length && new RegExp( rbuggyQSA.join( "|" ) ); - rbuggyMatches = rbuggyMatches.length && new RegExp( rbuggyMatches.join( "|" ) ); - - /* Contains - ---------------------------------------------------------------------- */ - hasCompare = rnative.test( docElem.compareDocumentPosition ); - - // Element contains another - // Purposefully self-exclusive - // As in, an element does not contain itself - contains = hasCompare || rnative.test( docElem.contains ) ? - function( a, b ) { - var adown = a.nodeType === 9 ? a.documentElement : a, - bup = b && b.parentNode; - return a === bup || !!( bup && bup.nodeType === 1 && ( - adown.contains ? - adown.contains( bup ) : - a.compareDocumentPosition && a.compareDocumentPosition( bup ) & 16 - ) ); - } : - function( a, b ) { - if ( b ) { - while ( ( b = b.parentNode ) ) { - if ( b === a ) { - return true; - } - } - } - return false; - }; - - /* Sorting - ---------------------------------------------------------------------- */ - - // Document order sorting - sortOrder = hasCompare ? - function( a, b ) { - - // Flag for duplicate removal - if ( a === b ) { - hasDuplicate = true; - return 0; - } - - // Sort on method existence if only one input has compareDocumentPosition - var compare = !a.compareDocumentPosition - !b.compareDocumentPosition; - if ( compare ) { - return compare; - } - - // Calculate position if both inputs belong to the same document - // Support: IE 11+, Edge 17 - 18+ - // IE/Edge sometimes throw a "Permission denied" error when strict-comparing - // two documents; shallow comparisons work. - // eslint-disable-next-line eqeqeq - compare = ( a.ownerDocument || a ) == ( b.ownerDocument || b ) ? - a.compareDocumentPosition( b ) : - - // Otherwise we know they are disconnected - 1; - - // Disconnected nodes - if ( compare & 1 || - ( !support.sortDetached && b.compareDocumentPosition( a ) === compare ) ) { - - // Choose the first element that is related to our preferred document - // Support: IE 11+, Edge 17 - 18+ - // IE/Edge sometimes throw a "Permission denied" error when strict-comparing - // two documents; shallow comparisons work. - // eslint-disable-next-line eqeqeq - if ( a == document || a.ownerDocument == preferredDoc && - contains( preferredDoc, a ) ) { - return -1; - } - - // Support: IE 11+, Edge 17 - 18+ - // IE/Edge sometimes throw a "Permission denied" error when strict-comparing - // two documents; shallow comparisons work. - // eslint-disable-next-line eqeqeq - if ( b == document || b.ownerDocument == preferredDoc && - contains( preferredDoc, b ) ) { - return 1; - } - - // Maintain original order - return sortInput ? - ( indexOf( sortInput, a ) - indexOf( sortInput, b ) ) : - 0; - } - - return compare & 4 ? -1 : 1; - } : - function( a, b ) { - - // Exit early if the nodes are identical - if ( a === b ) { - hasDuplicate = true; - return 0; - } - - var cur, - i = 0, - aup = a.parentNode, - bup = b.parentNode, - ap = [ a ], - bp = [ b ]; - - // Parentless nodes are either documents or disconnected - if ( !aup || !bup ) { - - // Support: IE 11+, Edge 17 - 18+ - // IE/Edge sometimes throw a "Permission denied" error when strict-comparing - // two documents; shallow comparisons work. - /* eslint-disable eqeqeq */ - return a == document ? -1 : - b == document ? 1 : - /* eslint-enable eqeqeq */ - aup ? -1 : - bup ? 1 : - sortInput ? - ( indexOf( sortInput, a ) - indexOf( sortInput, b ) ) : - 0; - - // If the nodes are siblings, we can do a quick check - } else if ( aup === bup ) { - return siblingCheck( a, b ); - } - - // Otherwise we need full lists of their ancestors for comparison - cur = a; - while ( ( cur = cur.parentNode ) ) { - ap.unshift( cur ); - } - cur = b; - while ( ( cur = cur.parentNode ) ) { - bp.unshift( cur ); - } - - // Walk down the tree looking for a discrepancy - while ( ap[ i ] === bp[ i ] ) { - i++; - } - - return i ? - - // Do a sibling check if the nodes have a common ancestor - siblingCheck( ap[ i ], bp[ i ] ) : - - // Otherwise nodes in our document sort first - // Support: IE 11+, Edge 17 - 18+ - // IE/Edge sometimes throw a "Permission denied" error when strict-comparing - // two documents; shallow comparisons work. - /* eslint-disable eqeqeq */ - ap[ i ] == preferredDoc ? -1 : - bp[ i ] == preferredDoc ? 1 : - /* eslint-enable eqeqeq */ - 0; - }; - - return document; -}; - -Sizzle.matches = function( expr, elements ) { - return Sizzle( expr, null, null, elements ); -}; - -Sizzle.matchesSelector = function( elem, expr ) { - setDocument( elem ); - - if ( support.matchesSelector && documentIsHTML && - !nonnativeSelectorCache[ expr + " " ] && - ( !rbuggyMatches || !rbuggyMatches.test( expr ) ) && - ( !rbuggyQSA || !rbuggyQSA.test( expr ) ) ) { - - try { - var ret = matches.call( elem, expr ); - - // IE 9's matchesSelector returns false on disconnected nodes - if ( ret || support.disconnectedMatch || - - // As well, disconnected nodes are said to be in a document - // fragment in IE 9 - elem.document && elem.document.nodeType !== 11 ) { - return ret; - } - } catch ( e ) { - nonnativeSelectorCache( expr, true ); - } - } - - return Sizzle( expr, document, null, [ elem ] ).length > 0; -}; - -Sizzle.contains = function( context, elem ) { - - // Set document vars if needed - // Support: IE 11+, Edge 17 - 18+ - // IE/Edge sometimes throw a "Permission denied" error when strict-comparing - // two documents; shallow comparisons work. - // eslint-disable-next-line eqeqeq - if ( ( context.ownerDocument || context ) != document ) { - setDocument( context ); - } - return contains( context, elem ); -}; - -Sizzle.attr = function( elem, name ) { - - // Set document vars if needed - // Support: IE 11+, Edge 17 - 18+ - // IE/Edge sometimes throw a "Permission denied" error when strict-comparing - // two documents; shallow comparisons work. - // eslint-disable-next-line eqeqeq - if ( ( elem.ownerDocument || elem ) != document ) { - setDocument( elem ); - } - - var fn = Expr.attrHandle[ name.toLowerCase() ], - - // Don't get fooled by Object.prototype properties (jQuery #13807) - val = fn && hasOwn.call( Expr.attrHandle, name.toLowerCase() ) ? - fn( elem, name, !documentIsHTML ) : - undefined; - - return val !== undefined ? - val : - support.attributes || !documentIsHTML ? - elem.getAttribute( name ) : - ( val = elem.getAttributeNode( name ) ) && val.specified ? - val.value : - null; -}; - -Sizzle.escape = function( sel ) { - return ( sel + "" ).replace( rcssescape, fcssescape ); -}; - -Sizzle.error = function( msg ) { - throw new Error( "Syntax error, unrecognized expression: " + msg ); -}; - -/** - * Document sorting and removing duplicates - * @param {ArrayLike} results - */ -Sizzle.uniqueSort = function( results ) { - var elem, - duplicates = [], - j = 0, - i = 0; - - // Unless we *know* we can detect duplicates, assume their presence - hasDuplicate = !support.detectDuplicates; - sortInput = !support.sortStable && results.slice( 0 ); - results.sort( sortOrder ); - - if ( hasDuplicate ) { - while ( ( elem = results[ i++ ] ) ) { - if ( elem === results[ i ] ) { - j = duplicates.push( i ); - } - } - while ( j-- ) { - results.splice( duplicates[ j ], 1 ); - } - } - - // Clear input after sorting to release objects - // See https://github.com/jquery/sizzle/pull/225 - sortInput = null; - - return results; -}; - -/** - * Utility function for retrieving the text value of an array of DOM nodes - * @param {Array|Element} elem - */ -getText = Sizzle.getText = function( elem ) { - var node, - ret = "", - i = 0, - nodeType = elem.nodeType; - - if ( !nodeType ) { - - // If no nodeType, this is expected to be an array - while ( ( node = elem[ i++ ] ) ) { - - // Do not traverse comment nodes - ret += getText( node ); - } - } else if ( nodeType === 1 || nodeType === 9 || nodeType === 11 ) { - - // Use textContent for elements - // innerText usage removed for consistency of new lines (jQuery #11153) - if ( typeof elem.textContent === "string" ) { - return elem.textContent; - } else { - - // Traverse its children - for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) { - ret += getText( elem ); - } - } - } else if ( nodeType === 3 || nodeType === 4 ) { - return elem.nodeValue; - } - - // Do not include comment or processing instruction nodes - - return ret; -}; - -Expr = Sizzle.selectors = { - - // Can be adjusted by the user - cacheLength: 50, - - createPseudo: markFunction, - - match: matchExpr, - - attrHandle: {}, - - find: {}, - - relative: { - ">": { dir: "parentNode", first: true }, - " ": { dir: "parentNode" }, - "+": { dir: "previousSibling", first: true }, - "~": { dir: "previousSibling" } - }, - - preFilter: { - "ATTR": function( match ) { - match[ 1 ] = match[ 1 ].replace( runescape, funescape ); - - // Move the given value to match[3] whether quoted or unquoted - match[ 3 ] = ( match[ 3 ] || match[ 4 ] || - match[ 5 ] || "" ).replace( runescape, funescape ); - - if ( match[ 2 ] === "~=" ) { - match[ 3 ] = " " + match[ 3 ] + " "; - } - - return match.slice( 0, 4 ); - }, - - "CHILD": function( match ) { - - /* matches from matchExpr["CHILD"] - 1 type (only|nth|...) - 2 what (child|of-type) - 3 argument (even|odd|\d*|\d*n([+-]\d+)?|...) - 4 xn-component of xn+y argument ([+-]?\d*n|) - 5 sign of xn-component - 6 x of xn-component - 7 sign of y-component - 8 y of y-component - */ - match[ 1 ] = match[ 1 ].toLowerCase(); - - if ( match[ 1 ].slice( 0, 3 ) === "nth" ) { - - // nth-* requires argument - if ( !match[ 3 ] ) { - Sizzle.error( match[ 0 ] ); - } - - // numeric x and y parameters for Expr.filter.CHILD - // remember that false/true cast respectively to 0/1 - match[ 4 ] = +( match[ 4 ] ? - match[ 5 ] + ( match[ 6 ] || 1 ) : - 2 * ( match[ 3 ] === "even" || match[ 3 ] === "odd" ) ); - match[ 5 ] = +( ( match[ 7 ] + match[ 8 ] ) || match[ 3 ] === "odd" ); - - // other types prohibit arguments - } else if ( match[ 3 ] ) { - Sizzle.error( match[ 0 ] ); - } - - return match; - }, - - "PSEUDO": function( match ) { - var excess, - unquoted = !match[ 6 ] && match[ 2 ]; - - if ( matchExpr[ "CHILD" ].test( match[ 0 ] ) ) { - return null; - } - - // Accept quoted arguments as-is - if ( match[ 3 ] ) { - match[ 2 ] = match[ 4 ] || match[ 5 ] || ""; - - // Strip excess characters from unquoted arguments - } else if ( unquoted && rpseudo.test( unquoted ) && - - // Get excess from tokenize (recursively) - ( excess = tokenize( unquoted, true ) ) && - - // advance to the next closing parenthesis - ( excess = unquoted.indexOf( ")", unquoted.length - excess ) - unquoted.length ) ) { - - // excess is a negative index - match[ 0 ] = match[ 0 ].slice( 0, excess ); - match[ 2 ] = unquoted.slice( 0, excess ); - } - - // Return only captures needed by the pseudo filter method (type and argument) - return match.slice( 0, 3 ); - } - }, - - filter: { - - "TAG": function( nodeNameSelector ) { - var nodeName = nodeNameSelector.replace( runescape, funescape ).toLowerCase(); - return nodeNameSelector === "*" ? - function() { - return true; - } : - function( elem ) { - return elem.nodeName && elem.nodeName.toLowerCase() === nodeName; - }; - }, - - "CLASS": function( className ) { - var pattern = classCache[ className + " " ]; - - return pattern || - ( pattern = new RegExp( "(^|" + whitespace + - ")" + className + "(" + whitespace + "|$)" ) ) && classCache( - className, function( elem ) { - return pattern.test( - typeof elem.className === "string" && elem.className || - typeof elem.getAttribute !== "undefined" && - elem.getAttribute( "class" ) || - "" - ); - } ); - }, - - "ATTR": function( name, operator, check ) { - return function( elem ) { - var result = Sizzle.attr( elem, name ); - - if ( result == null ) { - return operator === "!="; - } - if ( !operator ) { - return true; - } - - result += ""; - - /* eslint-disable max-len */ - - return operator === "=" ? result === check : - operator === "!=" ? result !== check : - operator === "^=" ? check && result.indexOf( check ) === 0 : - operator === "*=" ? check && result.indexOf( check ) > -1 : - operator === "$=" ? check && result.slice( -check.length ) === check : - operator === "~=" ? ( " " + result.replace( rwhitespace, " " ) + " " ).indexOf( check ) > -1 : - operator === "|=" ? result === check || result.slice( 0, check.length + 1 ) === check + "-" : - false; - /* eslint-enable max-len */ - - }; - }, - - "CHILD": function( type, what, _argument, first, last ) { - var simple = type.slice( 0, 3 ) !== "nth", - forward = type.slice( -4 ) !== "last", - ofType = what === "of-type"; - - return first === 1 && last === 0 ? - - // Shortcut for :nth-*(n) - function( elem ) { - return !!elem.parentNode; - } : - - function( elem, _context, xml ) { - var cache, uniqueCache, outerCache, node, nodeIndex, start, - dir = simple !== forward ? "nextSibling" : "previousSibling", - parent = elem.parentNode, - name = ofType && elem.nodeName.toLowerCase(), - useCache = !xml && !ofType, - diff = false; - - if ( parent ) { - - // :(first|last|only)-(child|of-type) - if ( simple ) { - while ( dir ) { - node = elem; - while ( ( node = node[ dir ] ) ) { - if ( ofType ? - node.nodeName.toLowerCase() === name : - node.nodeType === 1 ) { - - return false; - } - } - - // Reverse direction for :only-* (if we haven't yet done so) - start = dir = type === "only" && !start && "nextSibling"; - } - return true; - } - - start = [ forward ? parent.firstChild : parent.lastChild ]; - - // non-xml :nth-child(...) stores cache data on `parent` - if ( forward && useCache ) { - - // Seek `elem` from a previously-cached index - - // ...in a gzip-friendly way - node = parent; - outerCache = node[ expando ] || ( node[ expando ] = {} ); - - // Support: IE <9 only - // Defend against cloned attroperties (jQuery gh-1709) - uniqueCache = outerCache[ node.uniqueID ] || - ( outerCache[ node.uniqueID ] = {} ); - - cache = uniqueCache[ type ] || []; - nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ]; - diff = nodeIndex && cache[ 2 ]; - node = nodeIndex && parent.childNodes[ nodeIndex ]; - - while ( ( node = ++nodeIndex && node && node[ dir ] || - - // Fallback to seeking `elem` from the start - ( diff = nodeIndex = 0 ) || start.pop() ) ) { - - // When found, cache indexes on `parent` and break - if ( node.nodeType === 1 && ++diff && node === elem ) { - uniqueCache[ type ] = [ dirruns, nodeIndex, diff ]; - break; - } - } - - } else { - - // Use previously-cached element index if available - if ( useCache ) { - - // ...in a gzip-friendly way - node = elem; - outerCache = node[ expando ] || ( node[ expando ] = {} ); - - // Support: IE <9 only - // Defend against cloned attroperties (jQuery gh-1709) - uniqueCache = outerCache[ node.uniqueID ] || - ( outerCache[ node.uniqueID ] = {} ); - - cache = uniqueCache[ type ] || []; - nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ]; - diff = nodeIndex; - } - - // xml :nth-child(...) - // or :nth-last-child(...) or :nth(-last)?-of-type(...) - if ( diff === false ) { - - // Use the same loop as above to seek `elem` from the start - while ( ( node = ++nodeIndex && node && node[ dir ] || - ( diff = nodeIndex = 0 ) || start.pop() ) ) { - - if ( ( ofType ? - node.nodeName.toLowerCase() === name : - node.nodeType === 1 ) && - ++diff ) { - - // Cache the index of each encountered element - if ( useCache ) { - outerCache = node[ expando ] || - ( node[ expando ] = {} ); - - // Support: IE <9 only - // Defend against cloned attroperties (jQuery gh-1709) - uniqueCache = outerCache[ node.uniqueID ] || - ( outerCache[ node.uniqueID ] = {} ); - - uniqueCache[ type ] = [ dirruns, diff ]; - } - - if ( node === elem ) { - break; - } - } - } - } - } - - // Incorporate the offset, then check against cycle size - diff -= last; - return diff === first || ( diff % first === 0 && diff / first >= 0 ); - } - }; - }, - - "PSEUDO": function( pseudo, argument ) { - - // pseudo-class names are case-insensitive - // http://www.w3.org/TR/selectors/#pseudo-classes - // Prioritize by case sensitivity in case custom pseudos are added with uppercase letters - // Remember that setFilters inherits from pseudos - var args, - fn = Expr.pseudos[ pseudo ] || Expr.setFilters[ pseudo.toLowerCase() ] || - Sizzle.error( "unsupported pseudo: " + pseudo ); - - // The user may use createPseudo to indicate that - // arguments are needed to create the filter function - // just as Sizzle does - if ( fn[ expando ] ) { - return fn( argument ); - } - - // But maintain support for old signatures - if ( fn.length > 1 ) { - args = [ pseudo, pseudo, "", argument ]; - return Expr.setFilters.hasOwnProperty( pseudo.toLowerCase() ) ? - markFunction( function( seed, matches ) { - var idx, - matched = fn( seed, argument ), - i = matched.length; - while ( i-- ) { - idx = indexOf( seed, matched[ i ] ); - seed[ idx ] = !( matches[ idx ] = matched[ i ] ); - } - } ) : - function( elem ) { - return fn( elem, 0, args ); - }; - } - - return fn; - } - }, - - pseudos: { - - // Potentially complex pseudos - "not": markFunction( function( selector ) { - - // Trim the selector passed to compile - // to avoid treating leading and trailing - // spaces as combinators - var input = [], - results = [], - matcher = compile( selector.replace( rtrim, "$1" ) ); - - return matcher[ expando ] ? - markFunction( function( seed, matches, _context, xml ) { - var elem, - unmatched = matcher( seed, null, xml, [] ), - i = seed.length; - - // Match elements unmatched by `matcher` - while ( i-- ) { - if ( ( elem = unmatched[ i ] ) ) { - seed[ i ] = !( matches[ i ] = elem ); - } - } - } ) : - function( elem, _context, xml ) { - input[ 0 ] = elem; - matcher( input, null, xml, results ); - - // Don't keep the element (issue #299) - input[ 0 ] = null; - return !results.pop(); - }; - } ), - - "has": markFunction( function( selector ) { - return function( elem ) { - return Sizzle( selector, elem ).length > 0; - }; - } ), - - "contains": markFunction( function( text ) { - text = text.replace( runescape, funescape ); - return function( elem ) { - return ( elem.textContent || getText( elem ) ).indexOf( text ) > -1; - }; - } ), - - // "Whether an element is represented by a :lang() selector - // is based solely on the element's language value - // being equal to the identifier C, - // or beginning with the identifier C immediately followed by "-". - // The matching of C against the element's language value is performed case-insensitively. - // The identifier C does not have to be a valid language name." - // http://www.w3.org/TR/selectors/#lang-pseudo - "lang": markFunction( function( lang ) { - - // lang value must be a valid identifier - if ( !ridentifier.test( lang || "" ) ) { - Sizzle.error( "unsupported lang: " + lang ); - } - lang = lang.replace( runescape, funescape ).toLowerCase(); - return function( elem ) { - var elemLang; - do { - if ( ( elemLang = documentIsHTML ? - elem.lang : - elem.getAttribute( "xml:lang" ) || elem.getAttribute( "lang" ) ) ) { - - elemLang = elemLang.toLowerCase(); - return elemLang === lang || elemLang.indexOf( lang + "-" ) === 0; - } - } while ( ( elem = elem.parentNode ) && elem.nodeType === 1 ); - return false; - }; - } ), - - // Miscellaneous - "target": function( elem ) { - var hash = window.location && window.location.hash; - return hash && hash.slice( 1 ) === elem.id; - }, - - "root": function( elem ) { - return elem === docElem; - }, - - "focus": function( elem ) { - return elem === document.activeElement && - ( !document.hasFocus || document.hasFocus() ) && - !!( elem.type || elem.href || ~elem.tabIndex ); - }, - - // Boolean properties - "enabled": createDisabledPseudo( false ), - "disabled": createDisabledPseudo( true ), - - "checked": function( elem ) { - - // In CSS3, :checked should return both checked and selected elements - // http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked - var nodeName = elem.nodeName.toLowerCase(); - return ( nodeName === "input" && !!elem.checked ) || - ( nodeName === "option" && !!elem.selected ); - }, - - "selected": function( elem ) { - - // Accessing this property makes selected-by-default - // options in Safari work properly - if ( elem.parentNode ) { - // eslint-disable-next-line no-unused-expressions - elem.parentNode.selectedIndex; - } - - return elem.selected === true; - }, - - // Contents - "empty": function( elem ) { - - // http://www.w3.org/TR/selectors/#empty-pseudo - // :empty is negated by element (1) or content nodes (text: 3; cdata: 4; entity ref: 5), - // but not by others (comment: 8; processing instruction: 7; etc.) - // nodeType < 6 works because attributes (2) do not appear as children - for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) { - if ( elem.nodeType < 6 ) { - return false; - } - } - return true; - }, - - "parent": function( elem ) { - return !Expr.pseudos[ "empty" ]( elem ); - }, - - // Element/input types - "header": function( elem ) { - return rheader.test( elem.nodeName ); - }, - - "input": function( elem ) { - return rinputs.test( elem.nodeName ); - }, - - "button": function( elem ) { - var name = elem.nodeName.toLowerCase(); - return name === "input" && elem.type === "button" || name === "button"; - }, - - "text": function( elem ) { - var attr; - return elem.nodeName.toLowerCase() === "input" && - elem.type === "text" && - - // Support: IE<8 - // New HTML5 attribute values (e.g., "search") appear with elem.type === "text" - ( ( attr = elem.getAttribute( "type" ) ) == null || - attr.toLowerCase() === "text" ); - }, - - // Position-in-collection - "first": createPositionalPseudo( function() { - return [ 0 ]; - } ), - - "last": createPositionalPseudo( function( _matchIndexes, length ) { - return [ length - 1 ]; - } ), - - "eq": createPositionalPseudo( function( _matchIndexes, length, argument ) { - return [ argument < 0 ? argument + length : argument ]; - } ), - - "even": createPositionalPseudo( function( matchIndexes, length ) { - var i = 0; - for ( ; i < length; i += 2 ) { - matchIndexes.push( i ); - } - return matchIndexes; - } ), - - "odd": createPositionalPseudo( function( matchIndexes, length ) { - var i = 1; - for ( ; i < length; i += 2 ) { - matchIndexes.push( i ); - } - return matchIndexes; - } ), - - "lt": createPositionalPseudo( function( matchIndexes, length, argument ) { - var i = argument < 0 ? - argument + length : - argument > length ? - length : - argument; - for ( ; --i >= 0; ) { - matchIndexes.push( i ); - } - return matchIndexes; - } ), - - "gt": createPositionalPseudo( function( matchIndexes, length, argument ) { - var i = argument < 0 ? argument + length : argument; - for ( ; ++i < length; ) { - matchIndexes.push( i ); - } - return matchIndexes; - } ) - } -}; - -Expr.pseudos[ "nth" ] = Expr.pseudos[ "eq" ]; - -// Add button/input type pseudos -for ( i in { radio: true, checkbox: true, file: true, password: true, image: true } ) { - Expr.pseudos[ i ] = createInputPseudo( i ); -} -for ( i in { submit: true, reset: true } ) { - Expr.pseudos[ i ] = createButtonPseudo( i ); -} - -// Easy API for creating new setFilters -function setFilters() {} -setFilters.prototype = Expr.filters = Expr.pseudos; -Expr.setFilters = new setFilters(); - -tokenize = Sizzle.tokenize = function( selector, parseOnly ) { - var matched, match, tokens, type, - soFar, groups, preFilters, - cached = tokenCache[ selector + " " ]; - - if ( cached ) { - return parseOnly ? 0 : cached.slice( 0 ); - } - - soFar = selector; - groups = []; - preFilters = Expr.preFilter; - - while ( soFar ) { - - // Comma and first run - if ( !matched || ( match = rcomma.exec( soFar ) ) ) { - if ( match ) { - - // Don't consume trailing commas as valid - soFar = soFar.slice( match[ 0 ].length ) || soFar; - } - groups.push( ( tokens = [] ) ); - } - - matched = false; - - // Combinators - if ( ( match = rcombinators.exec( soFar ) ) ) { - matched = match.shift(); - tokens.push( { - value: matched, - - // Cast descendant combinators to space - type: match[ 0 ].replace( rtrim, " " ) - } ); - soFar = soFar.slice( matched.length ); - } - - // Filters - for ( type in Expr.filter ) { - if ( ( match = matchExpr[ type ].exec( soFar ) ) && ( !preFilters[ type ] || - ( match = preFilters[ type ]( match ) ) ) ) { - matched = match.shift(); - tokens.push( { - value: matched, - type: type, - matches: match - } ); - soFar = soFar.slice( matched.length ); - } - } - - if ( !matched ) { - break; - } - } - - // Return the length of the invalid excess - // if we're just parsing - // Otherwise, throw an error or return tokens - return parseOnly ? - soFar.length : - soFar ? - Sizzle.error( selector ) : - - // Cache the tokens - tokenCache( selector, groups ).slice( 0 ); -}; - -function toSelector( tokens ) { - var i = 0, - len = tokens.length, - selector = ""; - for ( ; i < len; i++ ) { - selector += tokens[ i ].value; - } - return selector; -} - -function addCombinator( matcher, combinator, base ) { - var dir = combinator.dir, - skip = combinator.next, - key = skip || dir, - checkNonElements = base && key === "parentNode", - doneName = done++; - - return combinator.first ? - - // Check against closest ancestor/preceding element - function( elem, context, xml ) { - while ( ( elem = elem[ dir ] ) ) { - if ( elem.nodeType === 1 || checkNonElements ) { - return matcher( elem, context, xml ); - } - } - return false; - } : - - // Check against all ancestor/preceding elements - function( elem, context, xml ) { - var oldCache, uniqueCache, outerCache, - newCache = [ dirruns, doneName ]; - - // We can't set arbitrary data on XML nodes, so they don't benefit from combinator caching - if ( xml ) { - while ( ( elem = elem[ dir ] ) ) { - if ( elem.nodeType === 1 || checkNonElements ) { - if ( matcher( elem, context, xml ) ) { - return true; - } - } - } - } else { - while ( ( elem = elem[ dir ] ) ) { - if ( elem.nodeType === 1 || checkNonElements ) { - outerCache = elem[ expando ] || ( elem[ expando ] = {} ); - - // Support: IE <9 only - // Defend against cloned attroperties (jQuery gh-1709) - uniqueCache = outerCache[ elem.uniqueID ] || - ( outerCache[ elem.uniqueID ] = {} ); - - if ( skip && skip === elem.nodeName.toLowerCase() ) { - elem = elem[ dir ] || elem; - } else if ( ( oldCache = uniqueCache[ key ] ) && - oldCache[ 0 ] === dirruns && oldCache[ 1 ] === doneName ) { - - // Assign to newCache so results back-propagate to previous elements - return ( newCache[ 2 ] = oldCache[ 2 ] ); - } else { - - // Reuse newcache so results back-propagate to previous elements - uniqueCache[ key ] = newCache; - - // A match means we're done; a fail means we have to keep checking - if ( ( newCache[ 2 ] = matcher( elem, context, xml ) ) ) { - return true; - } - } - } - } - } - return false; - }; -} - -function elementMatcher( matchers ) { - return matchers.length > 1 ? - function( elem, context, xml ) { - var i = matchers.length; - while ( i-- ) { - if ( !matchers[ i ]( elem, context, xml ) ) { - return false; - } - } - return true; - } : - matchers[ 0 ]; -} - -function multipleContexts( selector, contexts, results ) { - var i = 0, - len = contexts.length; - for ( ; i < len; i++ ) { - Sizzle( selector, contexts[ i ], results ); - } - return results; -} - -function condense( unmatched, map, filter, context, xml ) { - var elem, - newUnmatched = [], - i = 0, - len = unmatched.length, - mapped = map != null; - - for ( ; i < len; i++ ) { - if ( ( elem = unmatched[ i ] ) ) { - if ( !filter || filter( elem, context, xml ) ) { - newUnmatched.push( elem ); - if ( mapped ) { - map.push( i ); - } - } - } - } - - return newUnmatched; -} - -function setMatcher( preFilter, selector, matcher, postFilter, postFinder, postSelector ) { - if ( postFilter && !postFilter[ expando ] ) { - postFilter = setMatcher( postFilter ); - } - if ( postFinder && !postFinder[ expando ] ) { - postFinder = setMatcher( postFinder, postSelector ); - } - return markFunction( function( seed, results, context, xml ) { - var temp, i, elem, - preMap = [], - postMap = [], - preexisting = results.length, - - // Get initial elements from seed or context - elems = seed || multipleContexts( - selector || "*", - context.nodeType ? [ context ] : context, - [] - ), - - // Prefilter to get matcher input, preserving a map for seed-results synchronization - matcherIn = preFilter && ( seed || !selector ) ? - condense( elems, preMap, preFilter, context, xml ) : - elems, - - matcherOut = matcher ? - - // If we have a postFinder, or filtered seed, or non-seed postFilter or preexisting results, - postFinder || ( seed ? preFilter : preexisting || postFilter ) ? - - // ...intermediate processing is necessary - [] : - - // ...otherwise use results directly - results : - matcherIn; - - // Find primary matches - if ( matcher ) { - matcher( matcherIn, matcherOut, context, xml ); - } - - // Apply postFilter - if ( postFilter ) { - temp = condense( matcherOut, postMap ); - postFilter( temp, [], context, xml ); - - // Un-match failing elements by moving them back to matcherIn - i = temp.length; - while ( i-- ) { - if ( ( elem = temp[ i ] ) ) { - matcherOut[ postMap[ i ] ] = !( matcherIn[ postMap[ i ] ] = elem ); - } - } - } - - if ( seed ) { - if ( postFinder || preFilter ) { - if ( postFinder ) { - - // Get the final matcherOut by condensing this intermediate into postFinder contexts - temp = []; - i = matcherOut.length; - while ( i-- ) { - if ( ( elem = matcherOut[ i ] ) ) { - - // Restore matcherIn since elem is not yet a final match - temp.push( ( matcherIn[ i ] = elem ) ); - } - } - postFinder( null, ( matcherOut = [] ), temp, xml ); - } - - // Move matched elements from seed to results to keep them synchronized - i = matcherOut.length; - while ( i-- ) { - if ( ( elem = matcherOut[ i ] ) && - ( temp = postFinder ? indexOf( seed, elem ) : preMap[ i ] ) > -1 ) { - - seed[ temp ] = !( results[ temp ] = elem ); - } - } - } - - // Add elements to results, through postFinder if defined - } else { - matcherOut = condense( - matcherOut === results ? - matcherOut.splice( preexisting, matcherOut.length ) : - matcherOut - ); - if ( postFinder ) { - postFinder( null, results, matcherOut, xml ); - } else { - push.apply( results, matcherOut ); - } - } - } ); -} - -function matcherFromTokens( tokens ) { - var checkContext, matcher, j, - len = tokens.length, - leadingRelative = Expr.relative[ tokens[ 0 ].type ], - implicitRelative = leadingRelative || Expr.relative[ " " ], - i = leadingRelative ? 1 : 0, - - // The foundational matcher ensures that elements are reachable from top-level context(s) - matchContext = addCombinator( function( elem ) { - return elem === checkContext; - }, implicitRelative, true ), - matchAnyContext = addCombinator( function( elem ) { - return indexOf( checkContext, elem ) > -1; - }, implicitRelative, true ), - matchers = [ function( elem, context, xml ) { - var ret = ( !leadingRelative && ( xml || context !== outermostContext ) ) || ( - ( checkContext = context ).nodeType ? - matchContext( elem, context, xml ) : - matchAnyContext( elem, context, xml ) ); - - // Avoid hanging onto element (issue #299) - checkContext = null; - return ret; - } ]; - - for ( ; i < len; i++ ) { - if ( ( matcher = Expr.relative[ tokens[ i ].type ] ) ) { - matchers = [ addCombinator( elementMatcher( matchers ), matcher ) ]; - } else { - matcher = Expr.filter[ tokens[ i ].type ].apply( null, tokens[ i ].matches ); - - // Return special upon seeing a positional matcher - if ( matcher[ expando ] ) { - - // Find the next relative operator (if any) for proper handling - j = ++i; - for ( ; j < len; j++ ) { - if ( Expr.relative[ tokens[ j ].type ] ) { - break; - } - } - return setMatcher( - i > 1 && elementMatcher( matchers ), - i > 1 && toSelector( - - // If the preceding token was a descendant combinator, insert an implicit any-element `*` - tokens - .slice( 0, i - 1 ) - .concat( { value: tokens[ i - 2 ].type === " " ? "*" : "" } ) - ).replace( rtrim, "$1" ), - matcher, - i < j && matcherFromTokens( tokens.slice( i, j ) ), - j < len && matcherFromTokens( ( tokens = tokens.slice( j ) ) ), - j < len && toSelector( tokens ) - ); - } - matchers.push( matcher ); - } - } - - return elementMatcher( matchers ); -} - -function matcherFromGroupMatchers( elementMatchers, setMatchers ) { - var bySet = setMatchers.length > 0, - byElement = elementMatchers.length > 0, - superMatcher = function( seed, context, xml, results, outermost ) { - var elem, j, matcher, - matchedCount = 0, - i = "0", - unmatched = seed && [], - setMatched = [], - contextBackup = outermostContext, - - // We must always have either seed elements or outermost context - elems = seed || byElement && Expr.find[ "TAG" ]( "*", outermost ), - - // Use integer dirruns iff this is the outermost matcher - dirrunsUnique = ( dirruns += contextBackup == null ? 1 : Math.random() || 0.1 ), - len = elems.length; - - if ( outermost ) { - - // Support: IE 11+, Edge 17 - 18+ - // IE/Edge sometimes throw a "Permission denied" error when strict-comparing - // two documents; shallow comparisons work. - // eslint-disable-next-line eqeqeq - outermostContext = context == document || context || outermost; - } - - // Add elements passing elementMatchers directly to results - // Support: IE<9, Safari - // Tolerate NodeList properties (IE: "length"; Safari: ) matching elements by id - for ( ; i !== len && ( elem = elems[ i ] ) != null; i++ ) { - if ( byElement && elem ) { - j = 0; - - // Support: IE 11+, Edge 17 - 18+ - // IE/Edge sometimes throw a "Permission denied" error when strict-comparing - // two documents; shallow comparisons work. - // eslint-disable-next-line eqeqeq - if ( !context && elem.ownerDocument != document ) { - setDocument( elem ); - xml = !documentIsHTML; - } - while ( ( matcher = elementMatchers[ j++ ] ) ) { - if ( matcher( elem, context || document, xml ) ) { - results.push( elem ); - break; - } - } - if ( outermost ) { - dirruns = dirrunsUnique; - } - } - - // Track unmatched elements for set filters - if ( bySet ) { - - // They will have gone through all possible matchers - if ( ( elem = !matcher && elem ) ) { - matchedCount--; - } - - // Lengthen the array for every element, matched or not - if ( seed ) { - unmatched.push( elem ); - } - } - } - - // `i` is now the count of elements visited above, and adding it to `matchedCount` - // makes the latter nonnegative. - matchedCount += i; - - // Apply set filters to unmatched elements - // NOTE: This can be skipped if there are no unmatched elements (i.e., `matchedCount` - // equals `i`), unless we didn't visit _any_ elements in the above loop because we have - // no element matchers and no seed. - // Incrementing an initially-string "0" `i` allows `i` to remain a string only in that - // case, which will result in a "00" `matchedCount` that differs from `i` but is also - // numerically zero. - if ( bySet && i !== matchedCount ) { - j = 0; - while ( ( matcher = setMatchers[ j++ ] ) ) { - matcher( unmatched, setMatched, context, xml ); - } - - if ( seed ) { - - // Reintegrate element matches to eliminate the need for sorting - if ( matchedCount > 0 ) { - while ( i-- ) { - if ( !( unmatched[ i ] || setMatched[ i ] ) ) { - setMatched[ i ] = pop.call( results ); - } - } - } - - // Discard index placeholder values to get only actual matches - setMatched = condense( setMatched ); - } - - // Add matches to results - push.apply( results, setMatched ); - - // Seedless set matches succeeding multiple successful matchers stipulate sorting - if ( outermost && !seed && setMatched.length > 0 && - ( matchedCount + setMatchers.length ) > 1 ) { - - Sizzle.uniqueSort( results ); - } - } - - // Override manipulation of globals by nested matchers - if ( outermost ) { - dirruns = dirrunsUnique; - outermostContext = contextBackup; - } - - return unmatched; - }; - - return bySet ? - markFunction( superMatcher ) : - superMatcher; -} - -compile = Sizzle.compile = function( selector, match /* Internal Use Only */ ) { - var i, - setMatchers = [], - elementMatchers = [], - cached = compilerCache[ selector + " " ]; - - if ( !cached ) { - - // Generate a function of recursive functions that can be used to check each element - if ( !match ) { - match = tokenize( selector ); - } - i = match.length; - while ( i-- ) { - cached = matcherFromTokens( match[ i ] ); - if ( cached[ expando ] ) { - setMatchers.push( cached ); - } else { - elementMatchers.push( cached ); - } - } - - // Cache the compiled function - cached = compilerCache( - selector, - matcherFromGroupMatchers( elementMatchers, setMatchers ) - ); - - // Save selector and tokenization - cached.selector = selector; - } - return cached; -}; - -/** - * A low-level selection function that works with Sizzle's compiled - * selector functions - * @param {String|Function} selector A selector or a pre-compiled - * selector function built with Sizzle.compile - * @param {Element} context - * @param {Array} [results] - * @param {Array} [seed] A set of elements to match against - */ -select = Sizzle.select = function( selector, context, results, seed ) { - var i, tokens, token, type, find, - compiled = typeof selector === "function" && selector, - match = !seed && tokenize( ( selector = compiled.selector || selector ) ); - - results = results || []; - - // Try to minimize operations if there is only one selector in the list and no seed - // (the latter of which guarantees us context) - if ( match.length === 1 ) { - - // Reduce context if the leading compound selector is an ID - tokens = match[ 0 ] = match[ 0 ].slice( 0 ); - if ( tokens.length > 2 && ( token = tokens[ 0 ] ).type === "ID" && - context.nodeType === 9 && documentIsHTML && Expr.relative[ tokens[ 1 ].type ] ) { - - context = ( Expr.find[ "ID" ]( token.matches[ 0 ] - .replace( runescape, funescape ), context ) || [] )[ 0 ]; - if ( !context ) { - return results; - - // Precompiled matchers will still verify ancestry, so step up a level - } else if ( compiled ) { - context = context.parentNode; - } - - selector = selector.slice( tokens.shift().value.length ); - } - - // Fetch a seed set for right-to-left matching - i = matchExpr[ "needsContext" ].test( selector ) ? 0 : tokens.length; - while ( i-- ) { - token = tokens[ i ]; - - // Abort if we hit a combinator - if ( Expr.relative[ ( type = token.type ) ] ) { - break; - } - if ( ( find = Expr.find[ type ] ) ) { - - // Search, expanding context for leading sibling combinators - if ( ( seed = find( - token.matches[ 0 ].replace( runescape, funescape ), - rsibling.test( tokens[ 0 ].type ) && testContext( context.parentNode ) || - context - ) ) ) { - - // If seed is empty or no tokens remain, we can return early - tokens.splice( i, 1 ); - selector = seed.length && toSelector( tokens ); - if ( !selector ) { - push.apply( results, seed ); - return results; - } - - break; - } - } - } - } - - // Compile and execute a filtering function if one is not provided - // Provide `match` to avoid retokenization if we modified the selector above - ( compiled || compile( selector, match ) )( - seed, - context, - !documentIsHTML, - results, - !context || rsibling.test( selector ) && testContext( context.parentNode ) || context - ); - return results; -}; - -// One-time assignments - -// Sort stability -support.sortStable = expando.split( "" ).sort( sortOrder ).join( "" ) === expando; - -// Support: Chrome 14-35+ -// Always assume duplicates if they aren't passed to the comparison function -support.detectDuplicates = !!hasDuplicate; - -// Initialize against the default document -setDocument(); - -// Support: Webkit<537.32 - Safari 6.0.3/Chrome 25 (fixed in Chrome 27) -// Detached nodes confoundingly follow *each other* -support.sortDetached = assert( function( el ) { - - // Should return 1, but returns 4 (following) - return el.compareDocumentPosition( document.createElement( "fieldset" ) ) & 1; -} ); - -// Support: IE<8 -// Prevent attribute/property "interpolation" -// https://msdn.microsoft.com/en-us/library/ms536429%28VS.85%29.aspx -if ( !assert( function( el ) { - el.innerHTML = ""; - return el.firstChild.getAttribute( "href" ) === "#"; -} ) ) { - addHandle( "type|href|height|width", function( elem, name, isXML ) { - if ( !isXML ) { - return elem.getAttribute( name, name.toLowerCase() === "type" ? 1 : 2 ); - } - } ); -} - -// Support: IE<9 -// Use defaultValue in place of getAttribute("value") -if ( !support.attributes || !assert( function( el ) { - el.innerHTML = ""; - el.firstChild.setAttribute( "value", "" ); - return el.firstChild.getAttribute( "value" ) === ""; -} ) ) { - addHandle( "value", function( elem, _name, isXML ) { - if ( !isXML && elem.nodeName.toLowerCase() === "input" ) { - return elem.defaultValue; - } - } ); -} - -// Support: IE<9 -// Use getAttributeNode to fetch booleans when getAttribute lies -if ( !assert( function( el ) { - return el.getAttribute( "disabled" ) == null; -} ) ) { - addHandle( booleans, function( elem, name, isXML ) { - var val; - if ( !isXML ) { - return elem[ name ] === true ? name.toLowerCase() : - ( val = elem.getAttributeNode( name ) ) && val.specified ? - val.value : - null; - } - } ); -} - -return Sizzle; - -} )( window ); - - - -jQuery.find = Sizzle; -jQuery.expr = Sizzle.selectors; - -// Deprecated -jQuery.expr[ ":" ] = jQuery.expr.pseudos; -jQuery.uniqueSort = jQuery.unique = Sizzle.uniqueSort; -jQuery.text = Sizzle.getText; -jQuery.isXMLDoc = Sizzle.isXML; -jQuery.contains = Sizzle.contains; -jQuery.escapeSelector = Sizzle.escape; - - - - -var dir = function( elem, dir, until ) { - var matched = [], - truncate = until !== undefined; - - while ( ( elem = elem[ dir ] ) && elem.nodeType !== 9 ) { - if ( elem.nodeType === 1 ) { - if ( truncate && jQuery( elem ).is( until ) ) { - break; - } - matched.push( elem ); - } - } - return matched; -}; - - -var siblings = function( n, elem ) { - var matched = []; - - for ( ; n; n = n.nextSibling ) { - if ( n.nodeType === 1 && n !== elem ) { - matched.push( n ); - } - } - - return matched; -}; - - -var rneedsContext = jQuery.expr.match.needsContext; - - - -function nodeName( elem, name ) { - - return elem.nodeName && elem.nodeName.toLowerCase() === name.toLowerCase(); - -}; -var rsingleTag = ( /^<([a-z][^\/\0>:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i ); - - - -// Implement the identical functionality for filter and not -function winnow( elements, qualifier, not ) { - if ( isFunction( qualifier ) ) { - return jQuery.grep( elements, function( elem, i ) { - return !!qualifier.call( elem, i, elem ) !== not; - } ); - } - - // Single element - if ( qualifier.nodeType ) { - return jQuery.grep( elements, function( elem ) { - return ( elem === qualifier ) !== not; - } ); - } - - // Arraylike of elements (jQuery, arguments, Array) - if ( typeof qualifier !== "string" ) { - return jQuery.grep( elements, function( elem ) { - return ( indexOf.call( qualifier, elem ) > -1 ) !== not; - } ); - } - - // Filtered directly for both simple and complex selectors - return jQuery.filter( qualifier, elements, not ); -} - -jQuery.filter = function( expr, elems, not ) { - var elem = elems[ 0 ]; - - if ( not ) { - expr = ":not(" + expr + ")"; - } - - if ( elems.length === 1 && elem.nodeType === 1 ) { - return jQuery.find.matchesSelector( elem, expr ) ? [ elem ] : []; - } - - return jQuery.find.matches( expr, jQuery.grep( elems, function( elem ) { - return elem.nodeType === 1; - } ) ); -}; - -jQuery.fn.extend( { - find: function( selector ) { - var i, ret, - len = this.length, - self = this; - - if ( typeof selector !== "string" ) { - return this.pushStack( jQuery( selector ).filter( function() { - for ( i = 0; i < len; i++ ) { - if ( jQuery.contains( self[ i ], this ) ) { - return true; - } - } - } ) ); - } - - ret = this.pushStack( [] ); - - for ( i = 0; i < len; i++ ) { - jQuery.find( selector, self[ i ], ret ); - } - - return len > 1 ? jQuery.uniqueSort( ret ) : ret; - }, - filter: function( selector ) { - return this.pushStack( winnow( this, selector || [], false ) ); - }, - not: function( selector ) { - return this.pushStack( winnow( this, selector || [], true ) ); - }, - is: function( selector ) { - return !!winnow( - this, - - // If this is a positional/relative selector, check membership in the returned set - // so $("p:first").is("p:last") won't return true for a doc with two "p". - typeof selector === "string" && rneedsContext.test( selector ) ? - jQuery( selector ) : - selector || [], - false - ).length; - } -} ); - - -// Initialize a jQuery object - - -// A central reference to the root jQuery(document) -var rootjQuery, - - // A simple way to check for HTML strings - // Prioritize #id over to avoid XSS via location.hash (#9521) - // Strict HTML recognition (#11290: must start with <) - // Shortcut simple #id case for speed - rquickExpr = /^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]+))$/, - - init = jQuery.fn.init = function( selector, context, root ) { - var match, elem; - - // HANDLE: $(""), $(null), $(undefined), $(false) - if ( !selector ) { - return this; - } - - // Method init() accepts an alternate rootjQuery - // so migrate can support jQuery.sub (gh-2101) - root = root || rootjQuery; - - // Handle HTML strings - if ( typeof selector === "string" ) { - if ( selector[ 0 ] === "<" && - selector[ selector.length - 1 ] === ">" && - selector.length >= 3 ) { - - // Assume that strings that start and end with <> are HTML and skip the regex check - match = [ null, selector, null ]; - - } else { - match = rquickExpr.exec( selector ); - } - - // Match html or make sure no context is specified for #id - if ( match && ( match[ 1 ] || !context ) ) { - - // HANDLE: $(html) -> $(array) - if ( match[ 1 ] ) { - context = context instanceof jQuery ? context[ 0 ] : context; - - // Option to run scripts is true for back-compat - // Intentionally let the error be thrown if parseHTML is not present - jQuery.merge( this, jQuery.parseHTML( - match[ 1 ], - context && context.nodeType ? context.ownerDocument || context : document, - true - ) ); - - // HANDLE: $(html, props) - if ( rsingleTag.test( match[ 1 ] ) && jQuery.isPlainObject( context ) ) { - for ( match in context ) { - - // Properties of context are called as methods if possible - if ( isFunction( this[ match ] ) ) { - this[ match ]( context[ match ] ); - - // ...and otherwise set as attributes - } else { - this.attr( match, context[ match ] ); - } - } - } - - return this; - - // HANDLE: $(#id) - } else { - elem = document.getElementById( match[ 2 ] ); - - if ( elem ) { - - // Inject the element directly into the jQuery object - this[ 0 ] = elem; - this.length = 1; - } - return this; - } - - // HANDLE: $(expr, $(...)) - } else if ( !context || context.jquery ) { - return ( context || root ).find( selector ); - - // HANDLE: $(expr, context) - // (which is just equivalent to: $(context).find(expr) - } else { - return this.constructor( context ).find( selector ); - } - - // HANDLE: $(DOMElement) - } else if ( selector.nodeType ) { - this[ 0 ] = selector; - this.length = 1; - return this; - - // HANDLE: $(function) - // Shortcut for document ready - } else if ( isFunction( selector ) ) { - return root.ready !== undefined ? - root.ready( selector ) : - - // Execute immediately if ready is not present - selector( jQuery ); - } - - return jQuery.makeArray( selector, this ); - }; - -// Give the init function the jQuery prototype for later instantiation -init.prototype = jQuery.fn; - -// Initialize central reference -rootjQuery = jQuery( document ); - - -var rparentsprev = /^(?:parents|prev(?:Until|All))/, - - // Methods guaranteed to produce a unique set when starting from a unique set - guaranteedUnique = { - children: true, - contents: true, - next: true, - prev: true - }; - -jQuery.fn.extend( { - has: function( target ) { - var targets = jQuery( target, this ), - l = targets.length; - - return this.filter( function() { - var i = 0; - for ( ; i < l; i++ ) { - if ( jQuery.contains( this, targets[ i ] ) ) { - return true; - } - } - } ); - }, - - closest: function( selectors, context ) { - var cur, - i = 0, - l = this.length, - matched = [], - targets = typeof selectors !== "string" && jQuery( selectors ); - - // Positional selectors never match, since there's no _selection_ context - if ( !rneedsContext.test( selectors ) ) { - for ( ; i < l; i++ ) { - for ( cur = this[ i ]; cur && cur !== context; cur = cur.parentNode ) { - - // Always skip document fragments - if ( cur.nodeType < 11 && ( targets ? - targets.index( cur ) > -1 : - - // Don't pass non-elements to Sizzle - cur.nodeType === 1 && - jQuery.find.matchesSelector( cur, selectors ) ) ) { - - matched.push( cur ); - break; - } - } - } - } - - return this.pushStack( matched.length > 1 ? jQuery.uniqueSort( matched ) : matched ); - }, - - // Determine the position of an element within the set - index: function( elem ) { - - // No argument, return index in parent - if ( !elem ) { - return ( this[ 0 ] && this[ 0 ].parentNode ) ? this.first().prevAll().length : -1; - } - - // Index in selector - if ( typeof elem === "string" ) { - return indexOf.call( jQuery( elem ), this[ 0 ] ); - } - - // Locate the position of the desired element - return indexOf.call( this, - - // If it receives a jQuery object, the first element is used - elem.jquery ? elem[ 0 ] : elem - ); - }, - - add: function( selector, context ) { - return this.pushStack( - jQuery.uniqueSort( - jQuery.merge( this.get(), jQuery( selector, context ) ) - ) - ); - }, - - addBack: function( selector ) { - return this.add( selector == null ? - this.prevObject : this.prevObject.filter( selector ) - ); - } -} ); - -function sibling( cur, dir ) { - while ( ( cur = cur[ dir ] ) && cur.nodeType !== 1 ) {} - return cur; -} - -jQuery.each( { - parent: function( elem ) { - var parent = elem.parentNode; - return parent && parent.nodeType !== 11 ? parent : null; - }, - parents: function( elem ) { - return dir( elem, "parentNode" ); - }, - parentsUntil: function( elem, _i, until ) { - return dir( elem, "parentNode", until ); - }, - next: function( elem ) { - return sibling( elem, "nextSibling" ); - }, - prev: function( elem ) { - return sibling( elem, "previousSibling" ); - }, - nextAll: function( elem ) { - return dir( elem, "nextSibling" ); - }, - prevAll: function( elem ) { - return dir( elem, "previousSibling" ); - }, - nextUntil: function( elem, _i, until ) { - return dir( elem, "nextSibling", until ); - }, - prevUntil: function( elem, _i, until ) { - return dir( elem, "previousSibling", until ); - }, - siblings: function( elem ) { - return siblings( ( elem.parentNode || {} ).firstChild, elem ); - }, - children: function( elem ) { - return siblings( elem.firstChild ); - }, - contents: function( elem ) { - if ( elem.contentDocument != null && - - // Support: IE 11+ - // elements with no `data` attribute has an object - // `contentDocument` with a `null` prototype. - getProto( elem.contentDocument ) ) { - - return elem.contentDocument; - } - - // Support: IE 9 - 11 only, iOS 7 only, Android Browser <=4.3 only - // Treat the template element as a regular one in browsers that - // don't support it. - if ( nodeName( elem, "template" ) ) { - elem = elem.content || elem; - } - - return jQuery.merge( [], elem.childNodes ); - } -}, function( name, fn ) { - jQuery.fn[ name ] = function( until, selector ) { - var matched = jQuery.map( this, fn, until ); - - if ( name.slice( -5 ) !== "Until" ) { - selector = until; - } - - if ( selector && typeof selector === "string" ) { - matched = jQuery.filter( selector, matched ); - } - - if ( this.length > 1 ) { - - // Remove duplicates - if ( !guaranteedUnique[ name ] ) { - jQuery.uniqueSort( matched ); - } - - // Reverse order for parents* and prev-derivatives - if ( rparentsprev.test( name ) ) { - matched.reverse(); - } - } - - return this.pushStack( matched ); - }; -} ); -var rnothtmlwhite = ( /[^\x20\t\r\n\f]+/g ); - - - -// Convert String-formatted options into Object-formatted ones -function createOptions( options ) { - var object = {}; - jQuery.each( options.match( rnothtmlwhite ) || [], function( _, flag ) { - object[ flag ] = true; - } ); - return object; -} - -/* - * Create a callback list using the following parameters: - * - * options: an optional list of space-separated options that will change how - * the callback list behaves or a more traditional option object - * - * By default a callback list will act like an event callback list and can be - * "fired" multiple times. - * - * Possible options: - * - * once: will ensure the callback list can only be fired once (like a Deferred) - * - * memory: will keep track of previous values and will call any callback added - * after the list has been fired right away with the latest "memorized" - * values (like a Deferred) - * - * unique: will ensure a callback can only be added once (no duplicate in the list) - * - * stopOnFalse: interrupt callings when a callback returns false - * - */ -jQuery.Callbacks = function( options ) { - - // Convert options from String-formatted to Object-formatted if needed - // (we check in cache first) - options = typeof options === "string" ? - createOptions( options ) : - jQuery.extend( {}, options ); - - var // Flag to know if list is currently firing - firing, - - // Last fire value for non-forgettable lists - memory, - - // Flag to know if list was already fired - fired, - - // Flag to prevent firing - locked, - - // Actual callback list - list = [], - - // Queue of execution data for repeatable lists - queue = [], - - // Index of currently firing callback (modified by add/remove as needed) - firingIndex = -1, - - // Fire callbacks - fire = function() { - - // Enforce single-firing - locked = locked || options.once; - - // Execute callbacks for all pending executions, - // respecting firingIndex overrides and runtime changes - fired = firing = true; - for ( ; queue.length; firingIndex = -1 ) { - memory = queue.shift(); - while ( ++firingIndex < list.length ) { - - // Run callback and check for early termination - if ( list[ firingIndex ].apply( memory[ 0 ], memory[ 1 ] ) === false && - options.stopOnFalse ) { - - // Jump to end and forget the data so .add doesn't re-fire - firingIndex = list.length; - memory = false; - } - } - } - - // Forget the data if we're done with it - if ( !options.memory ) { - memory = false; - } - - firing = false; - - // Clean up if we're done firing for good - if ( locked ) { - - // Keep an empty list if we have data for future add calls - if ( memory ) { - list = []; - - // Otherwise, this object is spent - } else { - list = ""; - } - } - }, - - // Actual Callbacks object - self = { - - // Add a callback or a collection of callbacks to the list - add: function() { - if ( list ) { - - // If we have memory from a past run, we should fire after adding - if ( memory && !firing ) { - firingIndex = list.length - 1; - queue.push( memory ); - } - - ( function add( args ) { - jQuery.each( args, function( _, arg ) { - if ( isFunction( arg ) ) { - if ( !options.unique || !self.has( arg ) ) { - list.push( arg ); - } - } else if ( arg && arg.length && toType( arg ) !== "string" ) { - - // Inspect recursively - add( arg ); - } - } ); - } )( arguments ); - - if ( memory && !firing ) { - fire(); - } - } - return this; - }, - - // Remove a callback from the list - remove: function() { - jQuery.each( arguments, function( _, arg ) { - var index; - while ( ( index = jQuery.inArray( arg, list, index ) ) > -1 ) { - list.splice( index, 1 ); - - // Handle firing indexes - if ( index <= firingIndex ) { - firingIndex--; - } - } - } ); - return this; - }, - - // Check if a given callback is in the list. - // If no argument is given, return whether or not list has callbacks attached. - has: function( fn ) { - return fn ? - jQuery.inArray( fn, list ) > -1 : - list.length > 0; - }, - - // Remove all callbacks from the list - empty: function() { - if ( list ) { - list = []; - } - return this; - }, - - // Disable .fire and .add - // Abort any current/pending executions - // Clear all callbacks and values - disable: function() { - locked = queue = []; - list = memory = ""; - return this; - }, - disabled: function() { - return !list; - }, - - // Disable .fire - // Also disable .add unless we have memory (since it would have no effect) - // Abort any pending executions - lock: function() { - locked = queue = []; - if ( !memory && !firing ) { - list = memory = ""; - } - return this; - }, - locked: function() { - return !!locked; - }, - - // Call all callbacks with the given context and arguments - fireWith: function( context, args ) { - if ( !locked ) { - args = args || []; - args = [ context, args.slice ? args.slice() : args ]; - queue.push( args ); - if ( !firing ) { - fire(); - } - } - return this; - }, - - // Call all the callbacks with the given arguments - fire: function() { - self.fireWith( this, arguments ); - return this; - }, - - // To know if the callbacks have already been called at least once - fired: function() { - return !!fired; - } - }; - - return self; -}; - - -function Identity( v ) { - return v; -} -function Thrower( ex ) { - throw ex; -} - -function adoptValue( value, resolve, reject, noValue ) { - var method; - - try { - - // Check for promise aspect first to privilege synchronous behavior - if ( value && isFunction( ( method = value.promise ) ) ) { - method.call( value ).done( resolve ).fail( reject ); - - // Other thenables - } else if ( value && isFunction( ( method = value.then ) ) ) { - method.call( value, resolve, reject ); - - // Other non-thenables - } else { - - // Control `resolve` arguments by letting Array#slice cast boolean `noValue` to integer: - // * false: [ value ].slice( 0 ) => resolve( value ) - // * true: [ value ].slice( 1 ) => resolve() - resolve.apply( undefined, [ value ].slice( noValue ) ); - } - - // For Promises/A+, convert exceptions into rejections - // Since jQuery.when doesn't unwrap thenables, we can skip the extra checks appearing in - // Deferred#then to conditionally suppress rejection. - } catch ( value ) { - - // Support: Android 4.0 only - // Strict mode functions invoked without .call/.apply get global-object context - reject.apply( undefined, [ value ] ); - } -} - -jQuery.extend( { - - Deferred: function( func ) { - var tuples = [ - - // action, add listener, callbacks, - // ... .then handlers, argument index, [final state] - [ "notify", "progress", jQuery.Callbacks( "memory" ), - jQuery.Callbacks( "memory" ), 2 ], - [ "resolve", "done", jQuery.Callbacks( "once memory" ), - jQuery.Callbacks( "once memory" ), 0, "resolved" ], - [ "reject", "fail", jQuery.Callbacks( "once memory" ), - jQuery.Callbacks( "once memory" ), 1, "rejected" ] - ], - state = "pending", - promise = { - state: function() { - return state; - }, - always: function() { - deferred.done( arguments ).fail( arguments ); - return this; - }, - "catch": function( fn ) { - return promise.then( null, fn ); - }, - - // Keep pipe for back-compat - pipe: function( /* fnDone, fnFail, fnProgress */ ) { - var fns = arguments; - - return jQuery.Deferred( function( newDefer ) { - jQuery.each( tuples, function( _i, tuple ) { - - // Map tuples (progress, done, fail) to arguments (done, fail, progress) - var fn = isFunction( fns[ tuple[ 4 ] ] ) && fns[ tuple[ 4 ] ]; - - // deferred.progress(function() { bind to newDefer or newDefer.notify }) - // deferred.done(function() { bind to newDefer or newDefer.resolve }) - // deferred.fail(function() { bind to newDefer or newDefer.reject }) - deferred[ tuple[ 1 ] ]( function() { - var returned = fn && fn.apply( this, arguments ); - if ( returned && isFunction( returned.promise ) ) { - returned.promise() - .progress( newDefer.notify ) - .done( newDefer.resolve ) - .fail( newDefer.reject ); - } else { - newDefer[ tuple[ 0 ] + "With" ]( - this, - fn ? [ returned ] : arguments - ); - } - } ); - } ); - fns = null; - } ).promise(); - }, - then: function( onFulfilled, onRejected, onProgress ) { - var maxDepth = 0; - function resolve( depth, deferred, handler, special ) { - return function() { - var that = this, - args = arguments, - mightThrow = function() { - var returned, then; - - // Support: Promises/A+ section 2.3.3.3.3 - // https://promisesaplus.com/#point-59 - // Ignore double-resolution attempts - if ( depth < maxDepth ) { - return; - } - - returned = handler.apply( that, args ); - - // Support: Promises/A+ section 2.3.1 - // https://promisesaplus.com/#point-48 - if ( returned === deferred.promise() ) { - throw new TypeError( "Thenable self-resolution" ); - } - - // Support: Promises/A+ sections 2.3.3.1, 3.5 - // https://promisesaplus.com/#point-54 - // https://promisesaplus.com/#point-75 - // Retrieve `then` only once - then = returned && - - // Support: Promises/A+ section 2.3.4 - // https://promisesaplus.com/#point-64 - // Only check objects and functions for thenability - ( typeof returned === "object" || - typeof returned === "function" ) && - returned.then; - - // Handle a returned thenable - if ( isFunction( then ) ) { - - // Special processors (notify) just wait for resolution - if ( special ) { - then.call( - returned, - resolve( maxDepth, deferred, Identity, special ), - resolve( maxDepth, deferred, Thrower, special ) - ); - - // Normal processors (resolve) also hook into progress - } else { - - // ...and disregard older resolution values - maxDepth++; - - then.call( - returned, - resolve( maxDepth, deferred, Identity, special ), - resolve( maxDepth, deferred, Thrower, special ), - resolve( maxDepth, deferred, Identity, - deferred.notifyWith ) - ); - } - - // Handle all other returned values - } else { - - // Only substitute handlers pass on context - // and multiple values (non-spec behavior) - if ( handler !== Identity ) { - that = undefined; - args = [ returned ]; - } - - // Process the value(s) - // Default process is resolve - ( special || deferred.resolveWith )( that, args ); - } - }, - - // Only normal processors (resolve) catch and reject exceptions - process = special ? - mightThrow : - function() { - try { - mightThrow(); - } catch ( e ) { - - if ( jQuery.Deferred.exceptionHook ) { - jQuery.Deferred.exceptionHook( e, - process.stackTrace ); - } - - // Support: Promises/A+ section 2.3.3.3.4.1 - // https://promisesaplus.com/#point-61 - // Ignore post-resolution exceptions - if ( depth + 1 >= maxDepth ) { - - // Only substitute handlers pass on context - // and multiple values (non-spec behavior) - if ( handler !== Thrower ) { - that = undefined; - args = [ e ]; - } - - deferred.rejectWith( that, args ); - } - } - }; - - // Support: Promises/A+ section 2.3.3.3.1 - // https://promisesaplus.com/#point-57 - // Re-resolve promises immediately to dodge false rejection from - // subsequent errors - if ( depth ) { - process(); - } else { - - // Call an optional hook to record the stack, in case of exception - // since it's otherwise lost when execution goes async - if ( jQuery.Deferred.getStackHook ) { - process.stackTrace = jQuery.Deferred.getStackHook(); - } - window.setTimeout( process ); - } - }; - } - - return jQuery.Deferred( function( newDefer ) { - - // progress_handlers.add( ... ) - tuples[ 0 ][ 3 ].add( - resolve( - 0, - newDefer, - isFunction( onProgress ) ? - onProgress : - Identity, - newDefer.notifyWith - ) - ); - - // fulfilled_handlers.add( ... ) - tuples[ 1 ][ 3 ].add( - resolve( - 0, - newDefer, - isFunction( onFulfilled ) ? - onFulfilled : - Identity - ) - ); - - // rejected_handlers.add( ... ) - tuples[ 2 ][ 3 ].add( - resolve( - 0, - newDefer, - isFunction( onRejected ) ? - onRejected : - Thrower - ) - ); - } ).promise(); - }, - - // Get a promise for this deferred - // If obj is provided, the promise aspect is added to the object - promise: function( obj ) { - return obj != null ? jQuery.extend( obj, promise ) : promise; - } - }, - deferred = {}; - - // Add list-specific methods - jQuery.each( tuples, function( i, tuple ) { - var list = tuple[ 2 ], - stateString = tuple[ 5 ]; - - // promise.progress = list.add - // promise.done = list.add - // promise.fail = list.add - promise[ tuple[ 1 ] ] = list.add; - - // Handle state - if ( stateString ) { - list.add( - function() { - - // state = "resolved" (i.e., fulfilled) - // state = "rejected" - state = stateString; - }, - - // rejected_callbacks.disable - // fulfilled_callbacks.disable - tuples[ 3 - i ][ 2 ].disable, - - // rejected_handlers.disable - // fulfilled_handlers.disable - tuples[ 3 - i ][ 3 ].disable, - - // progress_callbacks.lock - tuples[ 0 ][ 2 ].lock, - - // progress_handlers.lock - tuples[ 0 ][ 3 ].lock - ); - } - - // progress_handlers.fire - // fulfilled_handlers.fire - // rejected_handlers.fire - list.add( tuple[ 3 ].fire ); - - // deferred.notify = function() { deferred.notifyWith(...) } - // deferred.resolve = function() { deferred.resolveWith(...) } - // deferred.reject = function() { deferred.rejectWith(...) } - deferred[ tuple[ 0 ] ] = function() { - deferred[ tuple[ 0 ] + "With" ]( this === deferred ? undefined : this, arguments ); - return this; - }; - - // deferred.notifyWith = list.fireWith - // deferred.resolveWith = list.fireWith - // deferred.rejectWith = list.fireWith - deferred[ tuple[ 0 ] + "With" ] = list.fireWith; - } ); - - // Make the deferred a promise - promise.promise( deferred ); - - // Call given func if any - if ( func ) { - func.call( deferred, deferred ); - } - - // All done! - return deferred; - }, - - // Deferred helper - when: function( singleValue ) { - var - - // count of uncompleted subordinates - remaining = arguments.length, - - // count of unprocessed arguments - i = remaining, - - // subordinate fulfillment data - resolveContexts = Array( i ), - resolveValues = slice.call( arguments ), - - // the 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 documentElement = document.documentElement; - - - - var isAttached = function( elem ) { - return jQuery.contains( elem.ownerDocument, elem ); - }, - composed = { composed: true }; - - // Support: IE 9 - 11+, Edge 12 - 18+, iOS 10.0 - 10.2 only - // Check attachment across shadow DOM boundaries when possible (gh-3504) - // Support: iOS 10.0-10.2 only - // Early iOS 10 versions support `attachShadow` but not `getRootNode`, - // leading to errors. We need to check for `getRootNode`. - if ( documentElement.getRootNode ) { - isAttached = function( elem ) { - return jQuery.contains( elem.ownerDocument, elem ) || - elem.getRootNode( composed ) === elem.ownerDocument; - }; - } -var isHiddenWithinTree = function( elem, el ) { - - // isHiddenWithinTree might be called from jQuery#filter function; - // in that case, element will be second argument - elem = el || elem; - - // Inline style trumps all - return elem.style.display === "none" || - elem.style.display === "" && - - // Otherwise, check computed style - // Support: Firefox <=43 - 45 - // Disconnected elements can have computed display: none, so first confirm that elem is - // in the document. - isAttached( elem ) && - - jQuery.css( elem, "display" ) === "none"; - }; - - - -function adjustCSS( elem, prop, valueParts, tween ) { - var adjusted, scale, - maxIterations = 20, - currentValue = tween ? - function() { - return tween.cur(); - } : - function() { - return jQuery.css( elem, prop, "" ); - }, - initial = currentValue(), - unit = valueParts && valueParts[ 3 ] || ( jQuery.cssNumber[ prop ] ? "" : "px" ), - - // Starting value computation is required for potential unit mismatches - initialInUnit = elem.nodeType && - ( jQuery.cssNumber[ prop ] || unit !== "px" && +initial ) && - rcssNum.exec( jQuery.css( elem, prop ) ); - - if ( initialInUnit && initialInUnit[ 3 ] !== unit ) { - - // Support: Firefox <=54 - // Halve the iteration target value to prevent interference from CSS upper bounds (gh-2144) - initial = initial / 2; - - // Trust units reported by jQuery.css - unit = unit || initialInUnit[ 3 ]; - - // Iteratively approximate from a nonzero starting point - initialInUnit = +initial || 1; - - while ( maxIterations-- ) { - - // Evaluate and update our best guess (doubling guesses that zero out). - // Finish if the scale equals or crosses 1 (making the old*new product non-positive). - jQuery.style( elem, prop, initialInUnit + unit ); - if ( ( 1 - scale ) * ( 1 - ( scale = currentValue() / initial || 0.5 ) ) <= 0 ) { - maxIterations = 0; - } - initialInUnit = initialInUnit / scale; - - } - - initialInUnit = initialInUnit * 2; - jQuery.style( elem, prop, initialInUnit + unit ); - - // Make sure we update the tween properties later on - valueParts = valueParts || []; - } - - if ( valueParts ) { - initialInUnit = +initialInUnit || +initial || 0; - - // Apply relative offset (+=/-=) if specified - adjusted = valueParts[ 1 ] ? - initialInUnit + ( valueParts[ 1 ] + 1 ) * valueParts[ 2 ] : - +valueParts[ 2 ]; - if ( tween ) { - tween.unit = unit; - tween.start = initialInUnit; - tween.end = adjusted; - } - } - return adjusted; -} - - -var defaultDisplayMap = {}; - -function getDefaultDisplay( elem ) { - var temp, - doc = elem.ownerDocument, - nodeName = elem.nodeName, - display = defaultDisplayMap[ nodeName ]; - - if ( display ) { - return display; - } - - temp = doc.body.appendChild( doc.createElement( nodeName ) ); - display = jQuery.css( temp, "display" ); - - temp.parentNode.removeChild( temp ); - - if ( display === "none" ) { - display = "block"; - } - defaultDisplayMap[ nodeName ] = display; - - return display; -} - -function showHide( elements, show ) { - var display, elem, - values = [], - index = 0, - length = elements.length; - - // Determine new display value for elements that need to change - for ( ; index < length; index++ ) { - elem = elements[ index ]; - if ( !elem.style ) { - continue; - } - - display = elem.style.display; - if ( show ) { - - // Since we force visibility upon cascade-hidden elements, an immediate (and slow) - // check is required in this first loop unless we have a nonempty display value (either - // inline or about-to-be-restored) - if ( display === "none" ) { - values[ index ] = dataPriv.get( elem, "display" ) || null; - if ( !values[ index ] ) { - elem.style.display = ""; - } - } - if ( elem.style.display === "" && isHiddenWithinTree( elem ) ) { - values[ index ] = getDefaultDisplay( elem ); - } - } else { - if ( display !== "none" ) { - values[ index ] = "none"; - - // Remember what we're overwriting - dataPriv.set( elem, "display", display ); - } - } - } - - // Set the display of the elements in a second loop to avoid constant reflow - for ( index = 0; index < length; index++ ) { - if ( values[ index ] != null ) { - elements[ index ].style.display = values[ index ]; - } - } - - return elements; -} - -jQuery.fn.extend( { - show: function() { - return showHide( this, true ); - }, - hide: function() { - return showHide( this ); - }, - toggle: function( state ) { - if ( typeof state === "boolean" ) { - return state ? this.show() : this.hide(); - } - - return this.each( function() { - if ( isHiddenWithinTree( this ) ) { - jQuery( this ).show(); - } else { - jQuery( this ).hide(); - } - } ); - } -} ); -var rcheckableType = ( /^(?:checkbox|radio)$/i ); - -var rtagName = ( /<([a-z][^\/\0>\x20\t\r\n\f]*)/i ); - -var rscriptType = ( /^$|^module$|\/(?:java|ecma)script/i ); - - - -( function() { - var fragment = document.createDocumentFragment(), - div = fragment.appendChild( document.createElement( "div" ) ), - input = document.createElement( "input" ); - - // Support: Android 4.0 - 4.3 only - // Check state lost if the name is set (#11217) - // Support: Windows Web Apps (WWA) - // `name` and `type` must use .setAttribute for WWA (#14901) - input.setAttribute( "type", "radio" ); - input.setAttribute( "checked", "checked" ); - input.setAttribute( "name", "t" ); - - div.appendChild( input ); - - // Support: Android <=4.1 only - // Older WebKit doesn't clone checked state correctly in fragments - support.checkClone = div.cloneNode( true ).cloneNode( true ).lastChild.checked; - - // Support: IE <=11 only - // Make sure textarea (and checkbox) defaultValue is properly cloned - div.innerHTML = ""; - support.noCloneChecked = !!div.cloneNode( true ).lastChild.defaultValue; - - // Support: IE <=9 only - // IE <=9 replaces "; - support.option = !!div.lastChild; -} )(); - - -// We have to close these tags to support XHTML (#13200) -var wrapMap = { - - // XHTML parsers do not magically insert elements in the - // same way that tag soup parsers do. So we cannot shorten - // this by omitting or other required elements. - thead: [ 1, "", "
" ], - col: [ 2, "", "
" ], - tr: [ 2, "", "
" ], - td: [ 3, "", "
" ], - - _default: [ 0, "", "" ] -}; - -wrapMap.tbody = wrapMap.tfoot = wrapMap.colgroup = wrapMap.caption = wrapMap.thead; -wrapMap.th = wrapMap.td; - -// Support: IE <=9 only -if ( !support.option ) { - wrapMap.optgroup = wrapMap.option = [ 1, "" ]; -} - - -function getAll( context, tag ) { - - // Support: IE <=9 - 11 only - // Use typeof to avoid zero-argument method invocation on host objects (#15151) - var ret; - - if ( typeof context.getElementsByTagName !== "undefined" ) { - ret = context.getElementsByTagName( tag || "*" ); - - } else if ( typeof context.querySelectorAll !== "undefined" ) { - ret = context.querySelectorAll( tag || "*" ); - - } else { - ret = []; - } - - if ( tag === undefined || tag && nodeName( context, tag ) ) { - return jQuery.merge( [ context ], ret ); - } - - return ret; -} - - -// Mark scripts as having already been evaluated -function setGlobalEval( elems, refElements ) { - var i = 0, - l = elems.length; - - for ( ; i < l; i++ ) { - dataPriv.set( - elems[ i ], - "globalEval", - !refElements || dataPriv.get( refElements[ i ], "globalEval" ) - ); - } -} - - -var rhtml = /<|&#?\w+;/; - -function buildFragment( elems, context, scripts, selection, ignored ) { - var elem, tmp, tag, wrap, attached, j, - fragment = context.createDocumentFragment(), - nodes = [], - i = 0, - l = elems.length; - - for ( ; i < l; i++ ) { - elem = elems[ i ]; - - if ( elem || elem === 0 ) { - - // Add nodes directly - if ( toType( elem ) === "object" ) { - - // Support: Android <=4.0 only, PhantomJS 1 only - // push.apply(_, arraylike) throws on ancient WebKit - jQuery.merge( nodes, elem.nodeType ? [ elem ] : elem ); - - // Convert non-html into a text node - } else if ( !rhtml.test( elem ) ) { - nodes.push( context.createTextNode( elem ) ); - - // Convert html into DOM nodes - } else { - tmp = tmp || fragment.appendChild( context.createElement( "div" ) ); - - // Deserialize a standard representation - tag = ( rtagName.exec( elem ) || [ "", "" ] )[ 1 ].toLowerCase(); - wrap = wrapMap[ tag ] || wrapMap._default; - tmp.innerHTML = wrap[ 1 ] + jQuery.htmlPrefilter( elem ) + wrap[ 2 ]; - - // Descend through wrappers to the right content - j = wrap[ 0 ]; - while ( j-- ) { - tmp = tmp.lastChild; - } - - // Support: Android <=4.0 only, PhantomJS 1 only - // push.apply(_, arraylike) throws on ancient WebKit - jQuery.merge( nodes, tmp.childNodes ); - - // Remember the top-level container - tmp = fragment.firstChild; - - // Ensure the created nodes are orphaned (#12392) - tmp.textContent = ""; - } - } - } - - // Remove wrapper from fragment - fragment.textContent = ""; - - i = 0; - while ( ( elem = nodes[ i++ ] ) ) { - - // Skip elements already in the context collection (trac-4087) - if ( selection && jQuery.inArray( elem, selection ) > -1 ) { - if ( ignored ) { - ignored.push( elem ); - } - continue; - } - - attached = isAttached( elem ); - - // Append to fragment - tmp = getAll( fragment.appendChild( elem ), "script" ); - - // Preserve script evaluation history - if ( attached ) { - setGlobalEval( tmp ); - } - - // Capture executables - if ( scripts ) { - j = 0; - while ( ( elem = tmp[ j++ ] ) ) { - if ( rscriptType.test( elem.type || "" ) ) { - scripts.push( elem ); - } - } - } - } - - return fragment; -} - - -var - rkeyEvent = /^key/, - rmouseEvent = /^(?:mouse|pointer|contextmenu|drag|drop)|click/, - rtypenamespace = /^([^.]*)(?:\.(.+)|)/; - -function returnTrue() { - return true; -} - -function returnFalse() { - return false; -} - -// Support: IE <=9 - 11+ -// focus() and blur() are asynchronous, except when they are no-op. -// So expect focus to be synchronous when the element is already active, -// and blur to be synchronous when the element is not already active. -// (focus and blur are always synchronous in other supported browsers, -// this just defines when we can count on it). -function expectSync( elem, type ) { - return ( elem === safeActiveElement() ) === ( type === "focus" ); -} - -// Support: IE <=9 only -// Accessing document.activeElement can throw unexpectedly -// https://bugs.jquery.com/ticket/13393 -function safeActiveElement() { - try { - return document.activeElement; - } catch ( err ) { } -} - -function on( elem, types, selector, data, fn, one ) { - var origFn, type; - - // Types can be a map of types/handlers - if ( typeof types === "object" ) { - - // ( types-Object, selector, data ) - if ( typeof selector !== "string" ) { - - // ( types-Object, data ) - data = data || selector; - selector = undefined; - } - for ( type in types ) { - on( elem, type, selector, data, types[ type ], one ); - } - return elem; - } - - if ( data == null && fn == null ) { - - // ( types, fn ) - fn = selector; - data = selector = undefined; - } else if ( fn == null ) { - if ( typeof selector === "string" ) { - - // ( types, selector, fn ) - fn = data; - data = undefined; - } else { - - // ( types, data, fn ) - fn = data; - data = selector; - selector = undefined; - } - } - if ( fn === false ) { - fn = returnFalse; - } else if ( !fn ) { - return elem; - } - - if ( one === 1 ) { - origFn = fn; - fn = function( event ) { - - // Can use an empty set, since event contains the info - jQuery().off( event ); - return origFn.apply( this, arguments ); - }; - - // Use same guid so caller can remove using origFn - fn.guid = origFn.guid || ( origFn.guid = jQuery.guid++ ); - } - return elem.each( function() { - jQuery.event.add( this, types, fn, data, selector ); - } ); -} - -/* - * Helper functions for managing events -- not part of the public interface. - * Props to Dean Edwards' addEvent library for many of the ideas. - */ -jQuery.event = { - - global: {}, - - add: function( elem, types, handler, data, selector ) { - - var handleObjIn, eventHandle, tmp, - events, t, handleObj, - special, handlers, type, namespaces, origType, - elemData = dataPriv.get( elem ); - - // Only attach events to objects that accept data - if ( !acceptData( elem ) ) { - return; - } - - // Caller can pass in an object of custom data in lieu of the handler - if ( handler.handler ) { - handleObjIn = handler; - handler = handleObjIn.handler; - selector = handleObjIn.selector; - } - - // Ensure that invalid selectors throw exceptions at attach time - // Evaluate against documentElement in case elem is a non-element node (e.g., document) - if ( selector ) { - jQuery.find.matchesSelector( documentElement, selector ); - } - - // Make sure that the handler has a unique ID, used to find/remove it later - if ( !handler.guid ) { - handler.guid = jQuery.guid++; - } - - // Init the element's event structure and main handler, if this is the first - if ( !( events = elemData.events ) ) { - events = elemData.events = Object.create( null ); - } - if ( !( eventHandle = elemData.handle ) ) { - eventHandle = elemData.handle = function( e ) { - - // Discard the second event of a jQuery.event.trigger() and - // when an event is called after a page has unloaded - return typeof jQuery !== "undefined" && jQuery.event.triggered !== e.type ? - jQuery.event.dispatch.apply( elem, arguments ) : undefined; - }; - } - - // Handle multiple events separated by a space - types = ( types || "" ).match( rnothtmlwhite ) || [ "" ]; - t = types.length; - while ( t-- ) { - tmp = rtypenamespace.exec( types[ t ] ) || []; - type = origType = tmp[ 1 ]; - namespaces = ( tmp[ 2 ] || "" ).split( "." ).sort(); - - // There *must* be a type, no attaching namespace-only handlers - if ( !type ) { - continue; - } - - // If event changes its type, use the special event handlers for the changed type - special = jQuery.event.special[ type ] || {}; - - // If selector defined, determine special event api type, otherwise given type - type = ( selector ? special.delegateType : special.bindType ) || type; - - // Update special based on newly reset type - special = jQuery.event.special[ type ] || {}; - - // handleObj is passed to all event handlers - handleObj = jQuery.extend( { - type: type, - origType: origType, - data: data, - handler: handler, - guid: handler.guid, - selector: selector, - needsContext: selector && jQuery.expr.match.needsContext.test( selector ), - namespace: namespaces.join( "." ) - }, handleObjIn ); - - // Init the event handler queue if we're the first - if ( !( handlers = events[ type ] ) ) { - handlers = events[ type ] = []; - handlers.delegateCount = 0; - - // Only use addEventListener if the special events handler returns false - if ( !special.setup || - special.setup.call( elem, data, namespaces, eventHandle ) === false ) { - - if ( elem.addEventListener ) { - elem.addEventListener( type, eventHandle ); - } - } - } - - if ( special.add ) { - special.add.call( elem, handleObj ); - - if ( !handleObj.handler.guid ) { - handleObj.handler.guid = handler.guid; - } - } - - // Add to the element's handler list, delegates in front - if ( selector ) { - handlers.splice( handlers.delegateCount++, 0, handleObj ); - } else { - handlers.push( handleObj ); - } - - // Keep track of which events have ever been used, for event optimization - jQuery.event.global[ type ] = true; - } - - }, - - // Detach an event or set of events from an element - remove: function( elem, types, handler, selector, mappedTypes ) { - - var j, origCount, tmp, - events, t, handleObj, - special, handlers, type, namespaces, origType, - elemData = dataPriv.hasData( elem ) && dataPriv.get( elem ); - - if ( !elemData || !( events = elemData.events ) ) { - return; - } - - // Once for each type.namespace in types; type may be omitted - types = ( types || "" ).match( rnothtmlwhite ) || [ "" ]; - t = types.length; - while ( t-- ) { - tmp = rtypenamespace.exec( types[ t ] ) || []; - type = origType = tmp[ 1 ]; - namespaces = ( tmp[ 2 ] || "" ).split( "." ).sort(); - - // Unbind all events (on this namespace, if provided) for the element - if ( !type ) { - for ( type in events ) { - jQuery.event.remove( elem, type + types[ t ], handler, selector, true ); - } - continue; - } - - special = jQuery.event.special[ type ] || {}; - type = ( selector ? special.delegateType : special.bindType ) || type; - handlers = events[ type ] || []; - tmp = tmp[ 2 ] && - new RegExp( "(^|\\.)" + namespaces.join( "\\.(?:.*\\.|)" ) + "(\\.|$)" ); - - // Remove matching events - origCount = j = handlers.length; - while ( j-- ) { - handleObj = handlers[ j ]; - - if ( ( mappedTypes || origType === handleObj.origType ) && - ( !handler || handler.guid === handleObj.guid ) && - ( !tmp || tmp.test( handleObj.namespace ) ) && - ( !selector || selector === handleObj.selector || - selector === "**" && handleObj.selector ) ) { - handlers.splice( j, 1 ); - - if ( handleObj.selector ) { - handlers.delegateCount--; - } - if ( special.remove ) { - special.remove.call( elem, handleObj ); - } - } - } - - // Remove generic event handler if we removed something and no more handlers exist - // (avoids potential for endless recursion during removal of special event handlers) - if ( origCount && !handlers.length ) { - if ( !special.teardown || - special.teardown.call( elem, namespaces, elemData.handle ) === false ) { - - jQuery.removeEvent( elem, type, elemData.handle ); - } - - delete events[ type ]; - } - } - - // Remove data and the expando if it's no longer used - if ( jQuery.isEmptyObject( events ) ) { - dataPriv.remove( elem, "handle events" ); - } - }, - - dispatch: function( nativeEvent ) { - - var i, j, ret, matched, handleObj, handlerQueue, - args = new Array( arguments.length ), - - // Make a writable jQuery.Event from the native event object - event = jQuery.event.fix( nativeEvent ), - - handlers = ( - dataPriv.get( this, "events" ) || Object.create( null ) - )[ event.type ] || [], - special = jQuery.event.special[ event.type ] || {}; - - // Use the fix-ed jQuery.Event rather than the (read-only) native event - args[ 0 ] = event; - - for ( i = 1; i < arguments.length; i++ ) { - args[ i ] = arguments[ i ]; - } - - event.delegateTarget = this; - - // Call the preDispatch hook for the mapped type, and let it bail if desired - if ( special.preDispatch && special.preDispatch.call( this, event ) === false ) { - return; - } - - // Determine handlers - handlerQueue = jQuery.event.handlers.call( this, event, handlers ); - - // Run delegates first; they may want to stop propagation beneath us - i = 0; - while ( ( matched = handlerQueue[ i++ ] ) && !event.isPropagationStopped() ) { - event.currentTarget = matched.elem; - - j = 0; - while ( ( handleObj = matched.handlers[ j++ ] ) && - !event.isImmediatePropagationStopped() ) { - - // If the event is namespaced, then each handler is only invoked if it is - // specially universal or its namespaces are a superset of the event's. - if ( !event.rnamespace || handleObj.namespace === false || - event.rnamespace.test( handleObj.namespace ) ) { - - event.handleObj = handleObj; - event.data = handleObj.data; - - ret = ( ( jQuery.event.special[ handleObj.origType ] || {} ).handle || - handleObj.handler ).apply( matched.elem, args ); - - if ( ret !== undefined ) { - if ( ( event.result = ret ) === false ) { - event.preventDefault(); - event.stopPropagation(); - } - } - } - } - } - - // Call the postDispatch hook for the mapped type - if ( special.postDispatch ) { - special.postDispatch.call( this, event ); - } - - return event.result; - }, - - handlers: function( event, handlers ) { - var i, handleObj, sel, matchedHandlers, matchedSelectors, - handlerQueue = [], - delegateCount = handlers.delegateCount, - cur = event.target; - - // Find delegate handlers - if ( delegateCount && - - // Support: IE <=9 - // Black-hole SVG instance trees (trac-13180) - cur.nodeType && - - // Support: Firefox <=42 - // Suppress spec-violating clicks indicating a non-primary pointer button (trac-3861) - // https://www.w3.org/TR/DOM-Level-3-Events/#event-type-click - // Support: IE 11 only - // ...but not arrow key "clicks" of radio inputs, which can have `button` -1 (gh-2343) - !( event.type === "click" && event.button >= 1 ) ) { - - for ( ; cur !== this; cur = cur.parentNode || this ) { - - // Don't check non-elements (#13208) - // Don't process clicks on disabled elements (#6911, #8165, #11382, #11764) - if ( cur.nodeType === 1 && !( event.type === "click" && cur.disabled === true ) ) { - matchedHandlers = []; - matchedSelectors = {}; - for ( i = 0; i < delegateCount; i++ ) { - handleObj = handlers[ i ]; - - // Don't conflict with Object.prototype properties (#13203) - sel = handleObj.selector + " "; - - if ( matchedSelectors[ sel ] === undefined ) { - matchedSelectors[ sel ] = handleObj.needsContext ? - jQuery( sel, this ).index( cur ) > -1 : - jQuery.find( sel, this, null, [ cur ] ).length; - } - if ( matchedSelectors[ sel ] ) { - matchedHandlers.push( handleObj ); - } - } - if ( matchedHandlers.length ) { - handlerQueue.push( { elem: cur, handlers: matchedHandlers } ); - } - } - } - } - - // Add the remaining (directly-bound) handlers - cur = this; - if ( delegateCount < handlers.length ) { - handlerQueue.push( { elem: cur, handlers: handlers.slice( delegateCount ) } ); - } - - return handlerQueue; - }, - - addProp: function( name, hook ) { - Object.defineProperty( jQuery.Event.prototype, name, { - enumerable: true, - configurable: true, - - get: isFunction( hook ) ? - function() { - if ( this.originalEvent ) { - return hook( this.originalEvent ); - } - } : - function() { - if ( this.originalEvent ) { - return this.originalEvent[ name ]; - } - }, - - set: function( value ) { - Object.defineProperty( this, name, { - enumerable: true, - configurable: true, - writable: true, - value: value - } ); - } - } ); - }, - - fix: function( originalEvent ) { - return originalEvent[ jQuery.expando ] ? - originalEvent : - new jQuery.Event( originalEvent ); - }, - - special: { - load: { - - // Prevent triggered image.load events from bubbling to window.load - noBubble: true - }, - click: { - - // Utilize native event to ensure correct state for checkable inputs - setup: function( data ) { - - // For mutual compressibility with _default, replace `this` access with a local var. - // `|| data` is dead code meant only to preserve the variable through minification. - var el = this || data; - - // Claim the first handler - if ( rcheckableType.test( el.type ) && - el.click && nodeName( el, "input" ) ) { - - // dataPriv.set( el, "click", ... ) - leverageNative( el, "click", returnTrue ); - } - - // Return false to allow normal processing in the caller - return false; - }, - trigger: function( data ) { - - // For mutual compressibility with _default, replace `this` access with a local var. - // `|| data` is dead code meant only to preserve the variable through minification. - var el = this || data; - - // Force setup before triggering a click - if ( rcheckableType.test( el.type ) && - el.click && nodeName( el, "input" ) ) { - - leverageNative( el, "click" ); - } - - // Return non-false to allow normal event-path propagation - return true; - }, - - // For cross-browser consistency, suppress native .click() on links - // Also prevent it if we're currently inside a leveraged native-event stack - _default: function( event ) { - var target = event.target; - return rcheckableType.test( target.type ) && - target.click && nodeName( target, "input" ) && - dataPriv.get( target, "click" ) || - nodeName( target, "a" ); - } - }, - - beforeunload: { - postDispatch: function( event ) { - - // Support: Firefox 20+ - // Firefox doesn't alert if the returnValue field is not set. - if ( event.result !== undefined && event.originalEvent ) { - event.originalEvent.returnValue = event.result; - } - } - } - } -}; - -// Ensure the presence of an event listener that handles manually-triggered -// synthetic events by interrupting progress until reinvoked in response to -// *native* events that it fires directly, ensuring that state changes have -// already occurred before other listeners are invoked. -function leverageNative( el, type, expectSync ) { - - // Missing expectSync indicates a trigger call, which must force setup through jQuery.event.add - if ( !expectSync ) { - if ( dataPriv.get( el, type ) === undefined ) { - jQuery.event.add( el, type, returnTrue ); - } - return; - } - - // Register the controller as a special universal handler for all event namespaces - dataPriv.set( el, type, false ); - jQuery.event.add( el, type, { - namespace: false, - handler: function( event ) { - var notAsync, result, - saved = dataPriv.get( this, type ); - - if ( ( event.isTrigger & 1 ) && this[ type ] ) { - - // Interrupt processing of the outer synthetic .trigger()ed event - // Saved data should be false in such cases, but might be a leftover capture object - // from an async native handler (gh-4350) - if ( !saved.length ) { - - // Store arguments for use when handling the inner native event - // There will always be at least one argument (an event object), so this array - // will not be confused with a leftover capture object. - saved = slice.call( arguments ); - dataPriv.set( this, type, saved ); - - // Trigger the native event and capture its result - // Support: IE <=9 - 11+ - // focus() and blur() are asynchronous - notAsync = expectSync( this, type ); - this[ type ](); - result = dataPriv.get( this, type ); - if ( saved !== result || notAsync ) { - dataPriv.set( this, type, false ); - } else { - result = {}; - } - if ( saved !== result ) { - - // Cancel the outer synthetic event - event.stopImmediatePropagation(); - event.preventDefault(); - return result.value; - } - - // If this is an inner synthetic event for an event with a bubbling surrogate - // (focus or blur), assume that the surrogate already propagated from triggering the - // native event and prevent that from happening again here. - // This technically gets the ordering wrong w.r.t. to `.trigger()` (in which the - // bubbling surrogate propagates *after* the non-bubbling base), but that seems - // less bad than duplication. - } else if ( ( jQuery.event.special[ type ] || {} ).delegateType ) { - event.stopPropagation(); - } - - // If this is a native event triggered above, everything is now in order - // Fire an inner synthetic event with the original arguments - } else if ( saved.length ) { - - // ...and capture the result - dataPriv.set( this, type, { - value: jQuery.event.trigger( - - // Support: IE <=9 - 11+ - // Extend with the prototype to reset the above stopImmediatePropagation() - jQuery.extend( saved[ 0 ], jQuery.Event.prototype ), - saved.slice( 1 ), - this - ) - } ); - - // Abort handling of the native event - event.stopImmediatePropagation(); - } - } - } ); -} - -jQuery.removeEvent = function( elem, type, handle ) { - - // This "if" is needed for plain objects - if ( elem.removeEventListener ) { - elem.removeEventListener( type, handle ); - } -}; - -jQuery.Event = function( src, props ) { - - // Allow instantiation without the 'new' keyword - if ( !( this instanceof jQuery.Event ) ) { - return new jQuery.Event( src, props ); - } - - // Event object - if ( src && src.type ) { - this.originalEvent = src; - this.type = src.type; - - // Events bubbling up the document may have been marked as prevented - // by a handler lower down the tree; reflect the correct value. - this.isDefaultPrevented = src.defaultPrevented || - src.defaultPrevented === undefined && - - // Support: Android <=2.3 only - src.returnValue === false ? - returnTrue : - returnFalse; - - // Create target properties - // Support: Safari <=6 - 7 only - // Target should not be a text node (#504, #13143) - this.target = ( src.target && src.target.nodeType === 3 ) ? - src.target.parentNode : - src.target; - - this.currentTarget = src.currentTarget; - this.relatedTarget = src.relatedTarget; - - // Event type - } else { - this.type = src; - } - - // Put explicitly provided properties onto the event object - if ( props ) { - jQuery.extend( this, props ); - } - - // Create a timestamp if incoming event doesn't have one - this.timeStamp = src && src.timeStamp || Date.now(); - - // Mark it as fixed - this[ jQuery.expando ] = true; -}; - -// jQuery.Event is based on DOM3 Events as specified by the ECMAScript Language Binding -// https://www.w3.org/TR/2003/WD-DOM-Level-3-Events-20030331/ecma-script-binding.html -jQuery.Event.prototype = { - constructor: jQuery.Event, - isDefaultPrevented: returnFalse, - isPropagationStopped: returnFalse, - isImmediatePropagationStopped: returnFalse, - isSimulated: false, - - preventDefault: function() { - var e = this.originalEvent; - - this.isDefaultPrevented = returnTrue; - - if ( e && !this.isSimulated ) { - e.preventDefault(); - } - }, - stopPropagation: function() { - var e = this.originalEvent; - - this.isPropagationStopped = returnTrue; - - if ( e && !this.isSimulated ) { - e.stopPropagation(); - } - }, - stopImmediatePropagation: function() { - var e = this.originalEvent; - - this.isImmediatePropagationStopped = returnTrue; - - if ( e && !this.isSimulated ) { - e.stopImmediatePropagation(); - } - - this.stopPropagation(); - } -}; - -// Includes all common event props including KeyEvent and MouseEvent specific props -jQuery.each( { - altKey: true, - bubbles: true, - cancelable: true, - changedTouches: true, - ctrlKey: true, - detail: true, - eventPhase: true, - metaKey: true, - pageX: true, - pageY: true, - shiftKey: true, - view: true, - "char": true, - code: true, - charCode: true, - key: true, - keyCode: true, - button: true, - buttons: true, - clientX: true, - clientY: true, - offsetX: true, - offsetY: true, - pointerId: true, - pointerType: true, - screenX: true, - screenY: true, - targetTouches: true, - toElement: true, - touches: true, - - which: 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 ); - -jQuery.each( { focus: "focusin", blur: "focusout" }, function( type, delegateType ) { - jQuery.event.special[ type ] = { - - // Utilize native event if possible so blur/focus sequence is correct - setup: function() { - - // Claim the first handler - // dataPriv.set( this, "focus", ... ) - // dataPriv.set( this, "blur", ... ) - leverageNative( this, type, expectSync ); - - // Return false to allow normal processing in the caller - return false; - }, - trigger: function() { - - // Force setup before trigger - leverageNative( this, type ); - - // Return non-false to allow normal event-path propagation - return true; - }, - - delegateType: delegateType - }; -} ); - -// Create mouseenter/leave events using mouseover/out and event-time checks -// so that event delegation works in jQuery. -// Do the same for pointerenter/pointerleave and pointerover/pointerout -// -// Support: Safari 7 only -// Safari sends mouseenter too often; see: -// https://bugs.chromium.org/p/chromium/issues/detail?id=470258 -// for the description of the bug (it existed in older Chrome versions as well). -jQuery.each( { - mouseenter: "mouseover", - mouseleave: "mouseout", - pointerenter: "pointerover", - pointerleave: "pointerout" -}, function( orig, fix ) { - jQuery.event.special[ orig ] = { - delegateType: fix, - bindType: fix, - - handle: function( event ) { - var ret, - target = this, - related = event.relatedTarget, - handleObj = event.handleObj; - - // For mouseenter/leave call the handler if related is outside the target. - // NB: No relatedTarget if the mouse left/entered the browser window - if ( !related || ( related !== target && !jQuery.contains( target, related ) ) ) { - event.type = handleObj.origType; - ret = handleObj.handler.apply( this, arguments ); - event.type = fix; - } - return ret; - } - }; -} ); - -jQuery.fn.extend( { - - on: function( types, selector, data, fn ) { - return on( this, types, selector, data, fn ); - }, - one: function( types, selector, data, fn ) { - return on( this, types, selector, data, fn, 1 ); - }, - off: function( types, selector, fn ) { - var handleObj, type; - if ( types && types.preventDefault && types.handleObj ) { - - // ( event ) dispatched jQuery.Event - handleObj = types.handleObj; - jQuery( types.delegateTarget ).off( - handleObj.namespace ? - handleObj.origType + "." + handleObj.namespace : - handleObj.origType, - handleObj.selector, - handleObj.handler - ); - return this; - } - if ( typeof types === "object" ) { - - // ( types-object [, selector] ) - for ( type in types ) { - this.off( type, selector, types[ type ] ); - } - return this; - } - if ( selector === false || typeof selector === "function" ) { - - // ( types [, fn] ) - fn = selector; - selector = undefined; - } - if ( fn === false ) { - fn = returnFalse; - } - return this.each( function() { - jQuery.event.remove( this, types, fn, selector ); - } ); - } -} ); - - -var - - // Support: IE <=10 - 11, Edge 12 - 13 only - // In IE/Edge using regex groups here causes severe slowdowns. - // See https://connect.microsoft.com/IE/feedback/details/1736512/ - rnoInnerhtml = /\s*$/g; - -// Prefer a tbody over its parent table for containing new rows -function manipulationTarget( elem, content ) { - if ( nodeName( elem, "table" ) && - nodeName( content.nodeType !== 11 ? content : content.firstChild, "tr" ) ) { - - return jQuery( elem ).children( "tbody" )[ 0 ] || elem; - } - - return elem; -} - -// Replace/restore the type attribute of script elements for safe DOM manipulation -function disableScript( elem ) { - elem.type = ( elem.getAttribute( "type" ) !== null ) + "/" + elem.type; - return elem; -} -function restoreScript( elem ) { - if ( ( elem.type || "" ).slice( 0, 5 ) === "true/" ) { - elem.type = elem.type.slice( 5 ); - } else { - elem.removeAttribute( "type" ); - } - - return elem; -} - -function cloneCopyEvent( src, dest ) { - var i, l, type, pdataOld, udataOld, udataCur, events; - - if ( dest.nodeType !== 1 ) { - return; - } - - // 1. Copy private data: events, handlers, etc. - if ( dataPriv.hasData( src ) ) { - pdataOld = dataPriv.get( src ); - events = pdataOld.events; - - if ( events ) { - dataPriv.remove( dest, "handle events" ); - - for ( type in events ) { - for ( i = 0, l = events[ type ].length; i < l; i++ ) { - jQuery.event.add( dest, type, events[ type ][ i ] ); - } - } - } - } - - // 2. Copy user data - if ( dataUser.hasData( src ) ) { - udataOld = dataUser.access( src ); - udataCur = jQuery.extend( {}, udataOld ); - - dataUser.set( dest, udataCur ); - } -} - -// Fix IE bugs, see support tests -function fixInput( src, dest ) { - var nodeName = dest.nodeName.toLowerCase(); - - // Fails to persist the checked state of a cloned checkbox or radio button. - if ( nodeName === "input" && rcheckableType.test( src.type ) ) { - dest.checked = src.checked; - - // Fails to return the selected option to the default selected state when cloning options - } else if ( nodeName === "input" || nodeName === "textarea" ) { - dest.defaultValue = src.defaultValue; - } -} - -function domManip( collection, args, callback, ignored ) { - - // Flatten any nested arrays - args = flat( args ); - - var fragment, first, scripts, hasScripts, node, doc, - i = 0, - l = collection.length, - iNoClone = l - 1, - value = args[ 0 ], - valueIsFunction = isFunction( value ); - - // We can't cloneNode fragments that contain checked, in WebKit - if ( valueIsFunction || - ( l > 1 && typeof value === "string" && - !support.checkClone && rchecked.test( value ) ) ) { - return collection.each( function( index ) { - var self = collection.eq( index ); - if ( valueIsFunction ) { - args[ 0 ] = value.call( this, index, self.html() ); - } - domManip( self, args, callback, ignored ); - } ); - } - - if ( l ) { - fragment = buildFragment( args, collection[ 0 ].ownerDocument, false, collection, ignored ); - first = fragment.firstChild; - - if ( fragment.childNodes.length === 1 ) { - fragment = first; - } - - // Require either new content or an interest in ignored elements to invoke the callback - if ( first || ignored ) { - scripts = jQuery.map( getAll( fragment, "script" ), disableScript ); - hasScripts = scripts.length; - - // Use the original fragment for the last item - // instead of the first because it can end up - // being emptied incorrectly in certain situations (#8070). - for ( ; i < l; i++ ) { - node = fragment; - - if ( i !== iNoClone ) { - node = jQuery.clone( node, true, true ); - - // Keep references to cloned scripts for later restoration - if ( hasScripts ) { - - // Support: Android <=4.0 only, PhantomJS 1 only - // push.apply(_, arraylike) throws on ancient WebKit - jQuery.merge( scripts, getAll( node, "script" ) ); - } - } - - callback.call( collection[ i ], node, i ); - } - - if ( hasScripts ) { - doc = scripts[ scripts.length - 1 ].ownerDocument; - - // Reenable scripts - jQuery.map( scripts, restoreScript ); - - // Evaluate executable scripts on first document insertion - for ( i = 0; i < hasScripts; i++ ) { - node = scripts[ i ]; - if ( rscriptType.test( node.type || "" ) && - !dataPriv.access( node, "globalEval" ) && - jQuery.contains( doc, node ) ) { - - if ( node.src && ( node.type || "" ).toLowerCase() !== "module" ) { - - // Optional AJAX dependency, but won't run scripts if not present - if ( jQuery._evalUrl && !node.noModule ) { - jQuery._evalUrl( node.src, { - nonce: node.nonce || node.getAttribute( "nonce" ) - }, doc ); - } - } else { - DOMEval( node.textContent.replace( rcleanScript, "" ), node, doc ); - } - } - } - } - } - } - - return collection; -} - -function remove( elem, selector, keepData ) { - var node, - nodes = selector ? jQuery.filter( selector, elem ) : elem, - i = 0; - - for ( ; ( node = nodes[ i ] ) != null; i++ ) { - if ( !keepData && node.nodeType === 1 ) { - jQuery.cleanData( getAll( node ) ); - } - - if ( node.parentNode ) { - if ( keepData && isAttached( node ) ) { - setGlobalEval( getAll( node, "script" ) ); - } - node.parentNode.removeChild( node ); - } - } - - return elem; -} - -jQuery.extend( { - htmlPrefilter: function( html ) { - return html; - }, - - clone: function( elem, dataAndEvents, deepDataAndEvents ) { - var i, l, srcElements, destElements, - clone = elem.cloneNode( true ), - inPage = isAttached( elem ); - - // Fix IE cloning issues - if ( !support.noCloneChecked && ( elem.nodeType === 1 || elem.nodeType === 11 ) && - !jQuery.isXMLDoc( elem ) ) { - - // We eschew Sizzle here for performance reasons: https://jsperf.com/getall-vs-sizzle/2 - destElements = getAll( clone ); - srcElements = getAll( elem ); - - for ( i = 0, l = srcElements.length; i < l; i++ ) { - fixInput( srcElements[ i ], destElements[ i ] ); - } - } - - // Copy the events from the original to the clone - if ( dataAndEvents ) { - if ( deepDataAndEvents ) { - srcElements = srcElements || getAll( elem ); - destElements = destElements || getAll( clone ); - - for ( i = 0, l = srcElements.length; i < l; i++ ) { - cloneCopyEvent( srcElements[ i ], destElements[ i ] ); - } - } else { - cloneCopyEvent( elem, clone ); - } - } - - // Preserve script evaluation history - destElements = getAll( clone, "script" ); - if ( destElements.length > 0 ) { - setGlobalEval( destElements, !inPage && getAll( elem, "script" ) ); - } - - // Return the cloned set - return clone; - }, - - cleanData: function( elems ) { - var data, elem, type, - special = jQuery.event.special, - i = 0; - - for ( ; ( elem = elems[ i ] ) !== undefined; i++ ) { - if ( acceptData( elem ) ) { - if ( ( data = elem[ dataPriv.expando ] ) ) { - if ( data.events ) { - for ( type in data.events ) { - if ( special[ type ] ) { - jQuery.event.remove( elem, type ); - - // This is a shortcut to avoid jQuery.event.remove's overhead - } else { - jQuery.removeEvent( elem, type, data.handle ); - } - } - } - - // Support: Chrome <=35 - 45+ - // Assign undefined instead of using delete, see Data#remove - elem[ dataPriv.expando ] = undefined; - } - if ( elem[ dataUser.expando ] ) { - - // Support: Chrome <=35 - 45+ - // Assign undefined instead of using delete, see Data#remove - elem[ dataUser.expando ] = undefined; - } - } - } - } -} ); - -jQuery.fn.extend( { - detach: function( selector ) { - return remove( this, selector, true ); - }, - - remove: function( selector ) { - return remove( this, selector ); - }, - - text: function( value ) { - return access( this, function( value ) { - return value === undefined ? - jQuery.text( this ) : - this.empty().each( function() { - if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) { - this.textContent = value; - } - } ); - }, null, value, arguments.length ); - }, - - append: function() { - return domManip( this, arguments, function( elem ) { - if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) { - var target = manipulationTarget( this, elem ); - target.appendChild( elem ); - } - } ); - }, - - prepend: function() { - return domManip( this, arguments, function( elem ) { - if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) { - var target = manipulationTarget( this, elem ); - target.insertBefore( elem, target.firstChild ); - } - } ); - }, - - before: function() { - return domManip( this, arguments, function( elem ) { - if ( this.parentNode ) { - this.parentNode.insertBefore( elem, this ); - } - } ); - }, - - after: function() { - return domManip( this, arguments, function( elem ) { - if ( this.parentNode ) { - this.parentNode.insertBefore( elem, this.nextSibling ); - } - } ); - }, - - empty: function() { - var elem, - i = 0; - - for ( ; ( elem = this[ i ] ) != null; i++ ) { - if ( elem.nodeType === 1 ) { - - // Prevent memory leaks - jQuery.cleanData( getAll( elem, false ) ); - - // Remove any remaining nodes - elem.textContent = ""; - } - } - - return this; - }, - - clone: function( dataAndEvents, deepDataAndEvents ) { - dataAndEvents = dataAndEvents == null ? false : dataAndEvents; - deepDataAndEvents = deepDataAndEvents == null ? dataAndEvents : deepDataAndEvents; - - return this.map( function() { - return jQuery.clone( this, dataAndEvents, deepDataAndEvents ); - } ); - }, - - html: function( value ) { - return access( this, function( value ) { - var elem = this[ 0 ] || {}, - i = 0, - l = this.length; - - if ( value === undefined && elem.nodeType === 1 ) { - return elem.innerHTML; - } - - // See if we can take a shortcut and just use innerHTML - if ( typeof value === "string" && !rnoInnerhtml.test( value ) && - !wrapMap[ ( rtagName.exec( value ) || [ "", "" ] )[ 1 ].toLowerCase() ] ) { - - value = jQuery.htmlPrefilter( value ); - - try { - for ( ; i < l; i++ ) { - elem = this[ i ] || {}; - - // Remove element nodes and prevent memory leaks - if ( elem.nodeType === 1 ) { - jQuery.cleanData( getAll( elem, false ) ); - elem.innerHTML = value; - } - } - - elem = 0; - - // If using innerHTML throws an exception, use the fallback method - } catch ( e ) {} - } - - if ( elem ) { - this.empty().append( value ); - } - }, null, value, arguments.length ); - }, - - replaceWith: function() { - var ignored = []; - - // Make the changes, replacing each non-ignored context element with the new content - return domManip( this, arguments, function( elem ) { - var parent = this.parentNode; - - if ( jQuery.inArray( this, ignored ) < 0 ) { - jQuery.cleanData( getAll( this ) ); - if ( parent ) { - parent.replaceChild( elem, this ); - } - } - - // Force callback invocation - }, ignored ); - } -} ); - -jQuery.each( { - appendTo: "append", - prependTo: "prepend", - insertBefore: "before", - insertAfter: "after", - replaceAll: "replaceWith" -}, function( name, original ) { - jQuery.fn[ name ] = function( selector ) { - var elems, - ret = [], - insert = jQuery( selector ), - last = insert.length - 1, - i = 0; - - for ( ; i <= last; i++ ) { - elems = i === last ? this : this.clone( true ); - jQuery( insert[ i ] )[ original ]( elems ); - - // Support: Android <=4.0 only, PhantomJS 1 only - // .get() because push.apply(_, arraylike) throws on ancient WebKit - push.apply( ret, elems.get() ); - } - - return this.pushStack( ret ); - }; -} ); -var rnumnonpx = new RegExp( "^(" + pnum + ")(?!px)[a-z%]+$", "i" ); - -var getStyles = function( elem ) { - - // Support: IE <=11 only, Firefox <=30 (#15098, #14150) - // IE throws on elements created in popups - // FF meanwhile throws on frame elements through "defaultView.getComputedStyle" - var view = elem.ownerDocument.defaultView; - - if ( !view || !view.opener ) { - view = window; - } - - return view.getComputedStyle( elem ); - }; - -var swap = function( elem, options, callback ) { - var ret, name, - old = {}; - - // Remember the old values, and insert the new ones - for ( name in options ) { - old[ name ] = elem.style[ name ]; - elem.style[ name ] = options[ name ]; - } - - ret = callback.call( elem ); - - // Revert the old values - for ( name in options ) { - elem.style[ name ] = old[ name ]; - } - - return ret; -}; - - -var rboxStyle = new RegExp( cssExpand.join( "|" ), "i" ); - - - -( function() { - - // Executing both pixelPosition & boxSizingReliable tests require only one layout - // so they're executed at the same time to save the second computation. - function computeStyleTests() { - - // This is a singleton, we need to execute it only once - if ( !div ) { - return; - } - - container.style.cssText = "position:absolute;left:-11111px;width:60px;" + - "margin-top:1px;padding:0;border:0"; - div.style.cssText = - "position:relative;display:block;box-sizing:border-box;overflow:scroll;" + - "margin:auto;border:1px;padding:1px;" + - "width:60%;top:1%"; - documentElement.appendChild( container ).appendChild( div ); - - var divStyle = window.getComputedStyle( div ); - pixelPositionVal = divStyle.top !== "1%"; - - // Support: Android 4.0 - 4.3 only, Firefox <=3 - 44 - reliableMarginLeftVal = roundPixelMeasures( divStyle.marginLeft ) === 12; - - // Support: Android 4.0 - 4.3 only, Safari <=9.1 - 10.1, iOS <=7.0 - 9.3 - // Some styles come back with percentage values, even though they shouldn't - div.style.right = "60%"; - pixelBoxStylesVal = roundPixelMeasures( divStyle.right ) === 36; - - // Support: IE 9 - 11 only - // Detect misreporting of content dimensions for box-sizing:border-box elements - boxSizingReliableVal = roundPixelMeasures( divStyle.width ) === 36; - - // Support: IE 9 only - // Detect overflow:scroll screwiness (gh-3699) - // Support: Chrome <=64 - // Don't get tricked when zoom affects offsetWidth (gh-4029) - div.style.position = "absolute"; - scrollboxSizeVal = roundPixelMeasures( div.offsetWidth / 3 ) === 12; - - documentElement.removeChild( container ); - - // Nullify the div so it wouldn't be stored in the memory and - // it will also be a sign that checks already performed - div = null; - } - - function roundPixelMeasures( measure ) { - return Math.round( parseFloat( measure ) ); - } - - var pixelPositionVal, boxSizingReliableVal, scrollboxSizeVal, pixelBoxStylesVal, - reliableTrDimensionsVal, reliableMarginLeftVal, - container = document.createElement( "div" ), - div = document.createElement( "div" ); - - // Finish early in limited (non-browser) environments - if ( !div.style ) { - return; - } - - // Support: IE <=9 - 11 only - // Style of cloned element affects source element cloned (#8908) - div.style.backgroundClip = "content-box"; - div.cloneNode( true ).style.backgroundClip = ""; - support.clearCloneStyle = div.style.backgroundClip === "content-box"; - - jQuery.extend( support, { - boxSizingReliable: function() { - computeStyleTests(); - return boxSizingReliableVal; - }, - pixelBoxStyles: function() { - computeStyleTests(); - return pixelBoxStylesVal; - }, - pixelPosition: function() { - computeStyleTests(); - return pixelPositionVal; - }, - reliableMarginLeft: function() { - computeStyleTests(); - return reliableMarginLeftVal; - }, - scrollboxSize: function() { - computeStyleTests(); - return scrollboxSizeVal; - }, - - // Support: IE 9 - 11+, Edge 15 - 18+ - // IE/Edge misreport `getComputedStyle` of table rows with width/height - // set in CSS while `offset*` properties report correct values. - // Behavior in IE 9 is more subtle than in newer versions & it passes - // some versions of this test; make sure not to make it pass there! - reliableTrDimensions: function() { - var table, tr, trChild, trStyle; - if ( reliableTrDimensionsVal == null ) { - table = document.createElement( "table" ); - tr = document.createElement( "tr" ); - trChild = document.createElement( "div" ); - - table.style.cssText = "position:absolute;left:-11111px"; - tr.style.height = "1px"; - trChild.style.height = "9px"; - - documentElement - .appendChild( table ) - .appendChild( tr ) - .appendChild( trChild ); - - trStyle = window.getComputedStyle( tr ); - reliableTrDimensionsVal = parseInt( trStyle.height ) > 3; - - documentElement.removeChild( table ); - } - return reliableTrDimensionsVal; - } - } ); -} )(); - - -function curCSS( elem, name, computed ) { - var width, minWidth, maxWidth, ret, - - // Support: Firefox 51+ - // Retrieving style before computed somehow - // fixes an issue with getting wrong values - // on detached elements - style = elem.style; - - computed = computed || getStyles( elem ); - - // getPropertyValue is needed for: - // .css('filter') (IE 9 only, #12537) - // .css('--customProperty) (#3144) - if ( computed ) { - ret = computed.getPropertyValue( name ) || computed[ name ]; - - if ( ret === "" && !isAttached( elem ) ) { - ret = jQuery.style( elem, name ); - } - - // A tribute to the "awesome hack by Dean Edwards" - // Android Browser returns percentage for some values, - // but width seems to be reliably pixels. - // This is against the CSSOM draft spec: - // https://drafts.csswg.org/cssom/#resolved-values - if ( !support.pixelBoxStyles() && rnumnonpx.test( ret ) && rboxStyle.test( name ) ) { - - // Remember the original values - width = style.width; - minWidth = style.minWidth; - maxWidth = style.maxWidth; - - // Put in the new values to get a computed value out - style.minWidth = style.maxWidth = style.width = ret; - ret = computed.width; - - // Revert the changed values - style.width = width; - style.minWidth = minWidth; - style.maxWidth = maxWidth; - } - } - - return ret !== undefined ? - - // Support: IE <=9 - 11 only - // IE returns zIndex value as an integer. - ret + "" : - ret; -} - - -function addGetHookIf( conditionFn, hookFn ) { - - // Define the hook, we'll check on the first run if it's really needed. - return { - get: function() { - if ( conditionFn() ) { - - // Hook not needed (or it's not possible to use it due - // to missing dependency), remove it. - delete this.get; - return; - } - - // Hook needed; redefine it so that the support test is not executed again. - return ( this.get = hookFn ).apply( this, arguments ); - } - }; -} - - -var cssPrefixes = [ "Webkit", "Moz", "ms" ], - emptyStyle = document.createElement( "div" ).style, - vendorProps = {}; - -// Return a vendor-prefixed property or undefined -function vendorPropName( name ) { - - // Check for vendor prefixed names - var capName = name[ 0 ].toUpperCase() + name.slice( 1 ), - i = cssPrefixes.length; - - while ( i-- ) { - name = cssPrefixes[ i ] + capName; - if ( name in emptyStyle ) { - return name; - } - } -} - -// Return a potentially-mapped jQuery.cssProps or vendor prefixed property -function finalPropName( name ) { - var final = jQuery.cssProps[ name ] || vendorProps[ name ]; - - if ( final ) { - return final; - } - if ( name in emptyStyle ) { - return name; - } - return vendorProps[ name ] = vendorPropName( name ) || name; -} - - -var - - // Swappable if display is none or starts with table - // except "table", "table-cell", or "table-caption" - // See here for display values: https://developer.mozilla.org/en-US/docs/CSS/display - rdisplayswap = /^(none|table(?!-c[ea]).+)/, - rcustomProp = /^--/, - cssShow = { position: "absolute", visibility: "hidden", display: "block" }, - cssNormalTransform = { - letterSpacing: "0", - fontWeight: "400" - }; - -function setPositiveNumber( _elem, value, subtract ) { - - // Any relative (+/-) values have already been - // normalized at this point - var matches = rcssNum.exec( value ); - return matches ? - - // Guard against undefined "subtract", e.g., when used as in cssHooks - Math.max( 0, matches[ 2 ] - ( subtract || 0 ) ) + ( matches[ 3 ] || "px" ) : - value; -} - -function boxModelAdjustment( elem, dimension, box, isBorderBox, styles, computedVal ) { - var i = dimension === "width" ? 1 : 0, - extra = 0, - delta = 0; - - // Adjustment may not be necessary - if ( box === ( isBorderBox ? "border" : "content" ) ) { - return 0; - } - - for ( ; i < 4; i += 2 ) { - - // Both box models exclude margin - if ( box === "margin" ) { - delta += jQuery.css( elem, box + cssExpand[ i ], true, styles ); - } - - // If we get here with a content-box, we're seeking "padding" or "border" or "margin" - if ( !isBorderBox ) { - - // Add padding - delta += jQuery.css( elem, "padding" + cssExpand[ i ], true, styles ); - - // For "border" or "margin", add border - if ( box !== "padding" ) { - delta += jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles ); - - // But still keep track of it otherwise - } else { - extra += jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles ); - } - - // If we get here with a border-box (content + padding + border), we're seeking "content" or - // "padding" or "margin" - } else { - - // For "content", subtract padding - if ( box === "content" ) { - delta -= jQuery.css( elem, "padding" + cssExpand[ i ], true, styles ); - } - - // For "content" or "padding", subtract border - if ( box !== "margin" ) { - delta -= jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles ); - } - } - } - - // Account for positive content-box scroll gutter when requested by providing computedVal - if ( !isBorderBox && computedVal >= 0 ) { - - // offsetWidth/offsetHeight is a rounded sum of content, padding, scroll gutter, and border - // Assuming integer scroll gutter, subtract the rest and round down - delta += Math.max( 0, Math.ceil( - elem[ "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ) ] - - computedVal - - delta - - extra - - 0.5 - - // If offsetWidth/offsetHeight is unknown, then we can't determine content-box scroll gutter - // Use an explicit zero to avoid NaN (gh-3964) - ) ) || 0; - } - - return delta; -} - -function getWidthOrHeight( elem, dimension, extra ) { - - // Start with computed style - var styles = getStyles( elem ), - - // To avoid forcing a reflow, only fetch boxSizing if we need it (gh-4322). - // Fake content-box until we know it's needed to know the true value. - boxSizingNeeded = !support.boxSizingReliable() || extra, - isBorderBox = boxSizingNeeded && - jQuery.css( elem, "boxSizing", false, styles ) === "border-box", - valueIsBorderBox = isBorderBox, - - val = curCSS( elem, dimension, styles ), - offsetProp = "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ); - - // Support: Firefox <=54 - // Return a confounding non-pixel value or feign ignorance, as appropriate. - if ( rnumnonpx.test( val ) ) { - if ( !extra ) { - return val; - } - val = "auto"; - } - - - // Support: IE 9 - 11 only - // Use offsetWidth/offsetHeight for when box sizing is unreliable. - // In those cases, the computed value can be trusted to be border-box. - if ( ( !support.boxSizingReliable() && isBorderBox || - - // Support: IE 10 - 11+, Edge 15 - 18+ - // IE/Edge misreport `getComputedStyle` of table rows with width/height - // set in CSS while `offset*` properties report correct values. - // Interestingly, in some cases IE 9 doesn't suffer from this issue. - !support.reliableTrDimensions() && nodeName( elem, "tr" ) || - - // Fall back to offsetWidth/offsetHeight when value is "auto" - // This happens for inline elements with no explicit setting (gh-3571) - val === "auto" || - - // Support: Android <=4.1 - 4.3 only - // Also use offsetWidth/offsetHeight for misreported inline dimensions (gh-3602) - !parseFloat( val ) && jQuery.css( elem, "display", false, styles ) === "inline" ) && - - // Make sure the element is visible & connected - elem.getClientRects().length ) { - - isBorderBox = jQuery.css( elem, "boxSizing", false, styles ) === "border-box"; - - // Where available, offsetWidth/offsetHeight approximate border box dimensions. - // Where not available (e.g., SVG), assume unreliable box-sizing and interpret the - // retrieved value as a content box dimension. - valueIsBorderBox = offsetProp in elem; - if ( valueIsBorderBox ) { - val = elem[ offsetProp ]; - } - } - - // Normalize "" and auto - val = parseFloat( val ) || 0; - - // Adjust for the element's box model - return ( val + - boxModelAdjustment( - elem, - dimension, - extra || ( isBorderBox ? "border" : "content" ), - valueIsBorderBox, - styles, - - // Provide the current computed size to request scroll gutter calculation (gh-3589) - val - ) - ) + "px"; -} - -jQuery.extend( { - - // Add in style property hooks for overriding the default - // behavior of getting and setting a style property - cssHooks: { - opacity: { - get: function( elem, computed ) { - if ( computed ) { - - // We should always get a number back from opacity - var ret = curCSS( elem, "opacity" ); - return ret === "" ? "1" : ret; - } - } - } - }, - - // Don't automatically add "px" to these possibly-unitless properties - cssNumber: { - "animationIterationCount": true, - "columnCount": true, - "fillOpacity": true, - "flexGrow": true, - "flexShrink": true, - "fontWeight": true, - "gridArea": true, - "gridColumn": true, - "gridColumnEnd": true, - "gridColumnStart": true, - "gridRow": true, - "gridRowEnd": true, - "gridRowStart": true, - "lineHeight": true, - "opacity": true, - "order": true, - "orphans": true, - "widows": true, - "zIndex": true, - "zoom": true - }, - - // Add in properties whose names you wish to fix before - // setting or getting the value - cssProps: {}, - - // Get and set the style property on a DOM Node - style: function( elem, name, value, extra ) { - - // Don't set styles on text and comment nodes - if ( !elem || elem.nodeType === 3 || elem.nodeType === 8 || !elem.style ) { - return; - } - - // Make sure that we're working with the right name - var ret, type, hooks, - origName = camelCase( name ), - isCustomProp = rcustomProp.test( name ), - style = elem.style; - - // Make sure that we're working with the right name. We don't - // want to query the value if it is a CSS custom property - // since they are user-defined. - if ( !isCustomProp ) { - name = finalPropName( origName ); - } - - // Gets hook for the prefixed version, then unprefixed version - hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ]; - - // Check if we're setting a value - if ( value !== undefined ) { - type = typeof value; - - // Convert "+=" or "-=" to relative numbers (#7345) - if ( type === "string" && ( ret = rcssNum.exec( value ) ) && ret[ 1 ] ) { - value = adjustCSS( elem, name, ret ); - - // Fixes bug #9237 - type = "number"; - } - - // Make sure that null and NaN values aren't set (#7116) - if ( value == null || value !== value ) { - return; - } - - // If a number was passed in, add the unit (except for certain CSS properties) - // The isCustomProp check can be removed in jQuery 4.0 when we only auto-append - // "px" to a few hardcoded values. - if ( type === "number" && !isCustomProp ) { - value += ret && ret[ 3 ] || ( jQuery.cssNumber[ origName ] ? "" : "px" ); - } - - // background-* props affect original clone's values - if ( !support.clearCloneStyle && value === "" && name.indexOf( "background" ) === 0 ) { - style[ name ] = "inherit"; - } - - // If a hook was provided, use that value, otherwise just set the specified value - if ( !hooks || !( "set" in hooks ) || - ( value = hooks.set( elem, value, extra ) ) !== undefined ) { - - if ( isCustomProp ) { - style.setProperty( name, value ); - } else { - style[ name ] = value; - } - } - - } else { - - // If a hook was provided get the non-computed value from there - if ( hooks && "get" in hooks && - ( ret = hooks.get( elem, false, extra ) ) !== undefined ) { - - return ret; - } - - // Otherwise just get the value from the style object - return style[ name ]; - } - }, - - css: function( elem, name, extra, styles ) { - var val, num, hooks, - origName = camelCase( name ), - isCustomProp = rcustomProp.test( name ); - - // Make sure that we're working with the right name. We don't - // want to modify the value if it is a CSS custom property - // since they are user-defined. - if ( !isCustomProp ) { - name = finalPropName( origName ); - } - - // Try prefixed name followed by the unprefixed name - hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ]; - - // If a hook was provided get the computed value from there - if ( hooks && "get" in hooks ) { - val = hooks.get( elem, true, extra ); - } - - // Otherwise, if a way to get the computed value exists, use that - if ( val === undefined ) { - val = curCSS( elem, name, styles ); - } - - // Convert "normal" to computed value - if ( val === "normal" && name in cssNormalTransform ) { - val = cssNormalTransform[ name ]; - } - - // Make numeric if forced or a qualifier was provided and val looks numeric - if ( extra === "" || extra ) { - num = parseFloat( val ); - return extra === true || isFinite( num ) ? num || 0 : val; - } - - return val; - } -} ); - -jQuery.each( [ "height", "width" ], function( _i, dimension ) { - jQuery.cssHooks[ dimension ] = { - get: function( elem, computed, extra ) { - if ( computed ) { - - // Certain elements can have dimension info if we invisibly show them - // but it must have a current display style that would benefit - return rdisplayswap.test( jQuery.css( elem, "display" ) ) && - - // Support: Safari 8+ - // Table columns in Safari have non-zero offsetWidth & zero - // getBoundingClientRect().width unless display is changed. - // Support: IE <=11 only - // Running getBoundingClientRect on a disconnected node - // in IE throws an error. - ( !elem.getClientRects().length || !elem.getBoundingClientRect().width ) ? - swap( elem, cssShow, function() { - return getWidthOrHeight( elem, dimension, extra ); - } ) : - getWidthOrHeight( elem, dimension, extra ); - } - }, - - set: function( elem, value, extra ) { - var matches, - styles = getStyles( elem ), - - // Only read styles.position if the test has a chance to fail - // to avoid forcing a reflow. - scrollboxSizeBuggy = !support.scrollboxSize() && - styles.position === "absolute", - - // To avoid forcing a reflow, only fetch boxSizing if we need it (gh-3991) - boxSizingNeeded = scrollboxSizeBuggy || extra, - isBorderBox = boxSizingNeeded && - jQuery.css( elem, "boxSizing", false, styles ) === "border-box", - subtract = extra ? - boxModelAdjustment( - elem, - dimension, - extra, - isBorderBox, - styles - ) : - 0; - - // Account for unreliable border-box dimensions by comparing offset* to computed and - // faking a content-box to get border and padding (gh-3699) - if ( isBorderBox && scrollboxSizeBuggy ) { - subtract -= Math.ceil( - elem[ "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ) ] - - parseFloat( styles[ dimension ] ) - - boxModelAdjustment( elem, dimension, "border", false, styles ) - - 0.5 - ); - } - - // Convert to pixels if value adjustment is needed - if ( subtract && ( matches = rcssNum.exec( value ) ) && - ( matches[ 3 ] || "px" ) !== "px" ) { - - elem.style[ dimension ] = value; - value = jQuery.css( elem, dimension ); - } - - return setPositiveNumber( elem, value, subtract ); - } - }; -} ); - -jQuery.cssHooks.marginLeft = addGetHookIf( support.reliableMarginLeft, - function( elem, computed ) { - if ( computed ) { - return ( parseFloat( curCSS( elem, "marginLeft" ) ) || - elem.getBoundingClientRect().left - - swap( elem, { marginLeft: 0 }, function() { - return elem.getBoundingClientRect().left; - } ) - ) + "px"; - } - } -); - -// These hooks are used by animate to expand properties -jQuery.each( { - margin: "", - padding: "", - border: "Width" -}, function( prefix, suffix ) { - jQuery.cssHooks[ prefix + suffix ] = { - expand: function( value ) { - var i = 0, - expanded = {}, - - // Assumes a single number if not a string - parts = typeof value === "string" ? value.split( " " ) : [ value ]; - - for ( ; i < 4; i++ ) { - expanded[ prefix + cssExpand[ i ] + suffix ] = - parts[ i ] || parts[ i - 2 ] || parts[ 0 ]; - } - - return expanded; - } - }; - - if ( prefix !== "margin" ) { - jQuery.cssHooks[ prefix + suffix ].set = setPositiveNumber; - } -} ); - -jQuery.fn.extend( { - css: function( name, value ) { - return access( this, function( elem, name, value ) { - var styles, len, - map = {}, - i = 0; - - if ( Array.isArray( name ) ) { - styles = getStyles( elem ); - len = name.length; - - for ( ; i < len; i++ ) { - map[ name[ i ] ] = jQuery.css( elem, name[ i ], false, styles ); - } - - return map; - } - - return value !== undefined ? - jQuery.style( elem, name, value ) : - jQuery.css( elem, name ); - }, name, value, arguments.length > 1 ); - } -} ); - - -function Tween( elem, options, prop, end, easing ) { - return new Tween.prototype.init( elem, options, prop, end, easing ); -} -jQuery.Tween = Tween; - -Tween.prototype = { - constructor: Tween, - init: function( elem, options, prop, end, easing, unit ) { - this.elem = elem; - this.prop = prop; - this.easing = easing || jQuery.easing._default; - this.options = options; - this.start = this.now = this.cur(); - this.end = end; - this.unit = unit || ( jQuery.cssNumber[ prop ] ? "" : "px" ); - }, - cur: function() { - var hooks = Tween.propHooks[ this.prop ]; - - return hooks && hooks.get ? - hooks.get( this ) : - Tween.propHooks._default.get( this ); - }, - run: function( percent ) { - var eased, - hooks = Tween.propHooks[ this.prop ]; - - if ( this.options.duration ) { - this.pos = eased = jQuery.easing[ this.easing ]( - percent, this.options.duration * percent, 0, 1, this.options.duration - ); - } else { - this.pos = eased = percent; - } - this.now = ( this.end - this.start ) * eased + this.start; - - if ( this.options.step ) { - this.options.step.call( this.elem, this.now, this ); - } - - if ( hooks && hooks.set ) { - hooks.set( this ); - } else { - Tween.propHooks._default.set( this ); - } - return this; - } -}; - -Tween.prototype.init.prototype = Tween.prototype; - -Tween.propHooks = { - _default: { - get: function( tween ) { - var result; - - // Use a property on the element directly when it is not a DOM element, - // or when there is no matching style property that exists. - if ( tween.elem.nodeType !== 1 || - tween.elem[ tween.prop ] != null && tween.elem.style[ tween.prop ] == null ) { - return tween.elem[ tween.prop ]; - } - - // Passing an empty string as a 3rd parameter to .css will automatically - // attempt a parseFloat and fallback to a string if the parse fails. - // Simple values such as "10px" are parsed to Float; - // complex values such as "rotate(1rad)" are returned as-is. - result = jQuery.css( tween.elem, tween.prop, "" ); - - // Empty strings, null, undefined and "auto" are converted to 0. - return !result || result === "auto" ? 0 : result; - }, - set: function( tween ) { - - // Use step hook for back compat. - // Use cssHook if its there. - // Use .style if available and use plain properties where available. - if ( jQuery.fx.step[ tween.prop ] ) { - jQuery.fx.step[ tween.prop ]( tween ); - } else if ( tween.elem.nodeType === 1 && ( - jQuery.cssHooks[ tween.prop ] || - tween.elem.style[ finalPropName( tween.prop ) ] != null ) ) { - jQuery.style( tween.elem, tween.prop, tween.now + tween.unit ); - } else { - tween.elem[ tween.prop ] = tween.now; - } - } - } -}; - -// Support: IE <=9 only -// Panic based approach to setting things on disconnected nodes -Tween.propHooks.scrollTop = Tween.propHooks.scrollLeft = { - set: function( tween ) { - if ( tween.elem.nodeType && tween.elem.parentNode ) { - tween.elem[ tween.prop ] = tween.now; - } - } -}; - -jQuery.easing = { - linear: function( p ) { - return p; - }, - swing: function( p ) { - return 0.5 - Math.cos( p * Math.PI ) / 2; - }, - _default: "swing" -}; - -jQuery.fx = Tween.prototype.init; - -// Back compat <1.8 extension point -jQuery.fx.step = {}; - - - - -var - fxNow, inProgress, - rfxtypes = /^(?:toggle|show|hide)$/, - rrun = /queueHooks$/; - -function schedule() { - if ( inProgress ) { - if ( document.hidden === false && window.requestAnimationFrame ) { - window.requestAnimationFrame( schedule ); - } else { - window.setTimeout( schedule, jQuery.fx.interval ); - } - - jQuery.fx.tick(); - } -} - -// Animations created synchronously will run synchronously -function createFxNow() { - window.setTimeout( function() { - fxNow = undefined; - } ); - return ( fxNow = Date.now() ); -} - -// Generate parameters to create a standard animation -function genFx( type, includeWidth ) { - var which, - i = 0, - attrs = { height: type }; - - // If we include width, step value is 1 to do all cssExpand values, - // otherwise step value is 2 to skip over Left and Right - includeWidth = includeWidth ? 1 : 0; - for ( ; i < 4; i += 2 - includeWidth ) { - which = cssExpand[ i ]; - attrs[ "margin" + which ] = attrs[ "padding" + which ] = type; - } - - if ( includeWidth ) { - attrs.opacity = attrs.width = type; - } - - return attrs; -} - -function createTween( value, prop, animation ) { - var tween, - collection = ( Animation.tweeners[ prop ] || [] ).concat( Animation.tweeners[ "*" ] ), - index = 0, - length = collection.length; - for ( ; index < length; index++ ) { - if ( ( tween = collection[ index ].call( animation, prop, value ) ) ) { - - // We're done with this property - return tween; - } - } -} - -function defaultPrefilter( elem, props, opts ) { - var prop, value, toggle, hooks, oldfire, propTween, restoreDisplay, display, - isBox = "width" in props || "height" in props, - anim = this, - orig = {}, - style = elem.style, - hidden = elem.nodeType && isHiddenWithinTree( elem ), - dataShow = dataPriv.get( elem, "fxshow" ); - - // Queue-skipping animations hijack the fx hooks - if ( !opts.queue ) { - hooks = jQuery._queueHooks( elem, "fx" ); - if ( hooks.unqueued == null ) { - hooks.unqueued = 0; - oldfire = hooks.empty.fire; - hooks.empty.fire = function() { - if ( !hooks.unqueued ) { - oldfire(); - } - }; - } - hooks.unqueued++; - - anim.always( function() { - - // Ensure the complete handler is called before this completes - anim.always( function() { - hooks.unqueued--; - if ( !jQuery.queue( elem, "fx" ).length ) { - hooks.empty.fire(); - } - } ); - } ); - } - - // Detect show/hide animations - for ( prop in props ) { - value = props[ prop ]; - if ( rfxtypes.test( value ) ) { - delete props[ prop ]; - toggle = toggle || value === "toggle"; - if ( value === ( hidden ? "hide" : "show" ) ) { - - // Pretend to be hidden if this is a "show" and - // there is still data from a stopped show/hide - if ( value === "show" && dataShow && dataShow[ prop ] !== undefined ) { - hidden = true; - - // Ignore all other no-op show/hide data - } else { - continue; - } - } - orig[ prop ] = dataShow && dataShow[ prop ] || jQuery.style( elem, prop ); - } - } - - // Bail out if this is a no-op like .hide().hide() - propTween = !jQuery.isEmptyObject( props ); - if ( !propTween && jQuery.isEmptyObject( orig ) ) { - return; - } - - // Restrict "overflow" and "display" styles during box animations - if ( isBox && elem.nodeType === 1 ) { - - // Support: IE <=9 - 11, Edge 12 - 15 - // Record all 3 overflow attributes because IE does not infer the shorthand - // from identically-valued overflowX and overflowY and Edge just mirrors - // the overflowX value there. - opts.overflow = [ style.overflow, style.overflowX, style.overflowY ]; - - // Identify a display type, preferring old show/hide data over the CSS cascade - restoreDisplay = dataShow && dataShow.display; - if ( restoreDisplay == null ) { - restoreDisplay = dataPriv.get( elem, "display" ); - } - display = jQuery.css( elem, "display" ); - if ( display === "none" ) { - if ( restoreDisplay ) { - display = restoreDisplay; - } else { - - // Get nonempty value(s) by temporarily forcing visibility - showHide( [ elem ], true ); - restoreDisplay = elem.style.display || restoreDisplay; - display = jQuery.css( elem, "display" ); - showHide( [ elem ] ); - } - } - - // Animate inline elements as inline-block - if ( display === "inline" || display === "inline-block" && restoreDisplay != null ) { - if ( jQuery.css( elem, "float" ) === "none" ) { - - // Restore the original display value at the end of pure show/hide animations - if ( !propTween ) { - anim.done( function() { - style.display = restoreDisplay; - } ); - if ( restoreDisplay == null ) { - display = style.display; - restoreDisplay = display === "none" ? "" : display; - } - } - style.display = "inline-block"; - } - } - } - - if ( opts.overflow ) { - style.overflow = "hidden"; - anim.always( function() { - style.overflow = opts.overflow[ 0 ]; - style.overflowX = opts.overflow[ 1 ]; - style.overflowY = opts.overflow[ 2 ]; - } ); - } - - // Implement show/hide animations - propTween = false; - for ( prop in orig ) { - - // General show/hide setup for this element animation - if ( !propTween ) { - if ( dataShow ) { - if ( "hidden" in dataShow ) { - hidden = dataShow.hidden; - } - } else { - dataShow = dataPriv.access( elem, "fxshow", { display: restoreDisplay } ); - } - - // Store hidden/visible for toggle so `.stop().toggle()` "reverses" - if ( toggle ) { - dataShow.hidden = !hidden; - } - - // Show elements before animating them - if ( hidden ) { - showHide( [ elem ], true ); - } - - /* eslint-disable no-loop-func */ - - anim.done( function() { - - /* eslint-enable no-loop-func */ - - // The final step of a "hide" animation is actually hiding the element - if ( !hidden ) { - showHide( [ elem ] ); - } - dataPriv.remove( elem, "fxshow" ); - for ( prop in orig ) { - jQuery.style( elem, prop, orig[ prop ] ); - } - } ); - } - - // Per-property setup - propTween = createTween( hidden ? dataShow[ prop ] : 0, prop, anim ); - if ( !( prop in dataShow ) ) { - dataShow[ prop ] = propTween.start; - if ( hidden ) { - propTween.end = propTween.start; - propTween.start = 0; - } - } - } -} - -function propFilter( props, specialEasing ) { - var index, name, easing, value, hooks; - - // camelCase, specialEasing and expand cssHook pass - for ( index in props ) { - name = camelCase( index ); - easing = specialEasing[ name ]; - value = props[ index ]; - if ( Array.isArray( value ) ) { - easing = value[ 1 ]; - value = props[ index ] = value[ 0 ]; - } - - if ( index !== name ) { - props[ name ] = value; - delete props[ index ]; - } - - hooks = jQuery.cssHooks[ name ]; - if ( hooks && "expand" in hooks ) { - value = hooks.expand( value ); - delete props[ name ]; - - // Not quite $.extend, this won't overwrite existing keys. - // Reusing 'index' because we have the correct "name" - for ( index in value ) { - if ( !( index in props ) ) { - props[ index ] = value[ index ]; - specialEasing[ index ] = easing; - } - } - } else { - specialEasing[ name ] = easing; - } - } -} - -function Animation( elem, properties, options ) { - var result, - stopped, - index = 0, - length = Animation.prefilters.length, - deferred = jQuery.Deferred().always( function() { - - // Don't match elem in the :animated selector - delete tick.elem; - } ), - tick = function() { - if ( stopped ) { - return false; - } - var currentTime = fxNow || createFxNow(), - remaining = Math.max( 0, animation.startTime + animation.duration - currentTime ), - - // Support: Android 2.3 only - // Archaic crash bug won't allow us to use `1 - ( 0.5 || 0 )` (#12497) - temp = remaining / animation.duration || 0, - percent = 1 - temp, - index = 0, - length = animation.tweens.length; - - for ( ; index < length; index++ ) { - animation.tweens[ index ].run( percent ); - } - - deferred.notifyWith( elem, [ animation, percent, remaining ] ); - - // If there's more to do, yield - if ( percent < 1 && length ) { - return remaining; - } - - // If this was an empty animation, synthesize a final progress notification - if ( !length ) { - deferred.notifyWith( elem, [ animation, 1, 0 ] ); - } - - // Resolve the animation and report its conclusion - deferred.resolveWith( elem, [ animation ] ); - return false; - }, - animation = deferred.promise( { - elem: elem, - props: jQuery.extend( {}, properties ), - opts: jQuery.extend( true, { - specialEasing: {}, - easing: jQuery.easing._default - }, options ), - originalProperties: properties, - originalOptions: options, - startTime: fxNow || createFxNow(), - duration: options.duration, - tweens: [], - createTween: function( prop, end ) { - var tween = jQuery.Tween( elem, animation.opts, prop, end, - animation.opts.specialEasing[ prop ] || animation.opts.easing ); - animation.tweens.push( tween ); - return tween; - }, - stop: function( gotoEnd ) { - var index = 0, - - // If we are going to the end, we want to run all the tweens - // otherwise we skip this part - length = gotoEnd ? animation.tweens.length : 0; - if ( stopped ) { - return this; - } - stopped = true; - for ( ; index < length; index++ ) { - animation.tweens[ index ].run( 1 ); - } - - // Resolve when we played the last frame; otherwise, reject - if ( gotoEnd ) { - deferred.notifyWith( elem, [ animation, 1, 0 ] ); - deferred.resolveWith( elem, [ animation, gotoEnd ] ); - } else { - deferred.rejectWith( elem, [ animation, gotoEnd ] ); - } - return this; - } - } ), - props = animation.props; - - propFilter( props, animation.opts.specialEasing ); - - for ( ; index < length; index++ ) { - result = Animation.prefilters[ index ].call( animation, elem, props, animation.opts ); - if ( result ) { - if ( isFunction( result.stop ) ) { - jQuery._queueHooks( animation.elem, animation.opts.queue ).stop = - result.stop.bind( result ); - } - return result; - } - } - - jQuery.map( props, createTween, animation ); - - if ( isFunction( animation.opts.start ) ) { - animation.opts.start.call( elem, animation ); - } - - // Attach callbacks from options - animation - .progress( animation.opts.progress ) - .done( animation.opts.done, animation.opts.complete ) - .fail( animation.opts.fail ) - .always( animation.opts.always ); - - jQuery.fx.timer( - jQuery.extend( tick, { - elem: elem, - anim: animation, - queue: animation.opts.queue - } ) - ); - - return animation; -} - -jQuery.Animation = jQuery.extend( Animation, { - - tweeners: { - "*": [ function( prop, value ) { - var tween = this.createTween( prop, value ); - adjustCSS( tween.elem, prop, rcssNum.exec( value ), tween ); - return tween; - } ] - }, - - tweener: function( props, callback ) { - if ( isFunction( props ) ) { - callback = props; - props = [ "*" ]; - } else { - props = props.match( rnothtmlwhite ); - } - - var prop, - index = 0, - length = props.length; - - for ( ; index < length; index++ ) { - prop = props[ index ]; - Animation.tweeners[ prop ] = Animation.tweeners[ prop ] || []; - Animation.tweeners[ prop ].unshift( callback ); - } - }, - - prefilters: [ defaultPrefilter ], - - prefilter: function( callback, prepend ) { - if ( prepend ) { - Animation.prefilters.unshift( callback ); - } else { - Animation.prefilters.push( callback ); - } - } -} ); - -jQuery.speed = function( speed, easing, fn ) { - var opt = speed && typeof speed === "object" ? jQuery.extend( {}, speed ) : { - complete: fn || !fn && easing || - isFunction( speed ) && speed, - duration: speed, - easing: fn && easing || easing && !isFunction( easing ) && easing - }; - - // Go to the end state if fx are off - if ( jQuery.fx.off ) { - opt.duration = 0; - - } else { - if ( typeof opt.duration !== "number" ) { - if ( opt.duration in jQuery.fx.speeds ) { - opt.duration = jQuery.fx.speeds[ opt.duration ]; - - } else { - opt.duration = jQuery.fx.speeds._default; - } - } - } - - // Normalize opt.queue - true/undefined/null -> "fx" - if ( opt.queue == null || opt.queue === true ) { - opt.queue = "fx"; - } - - // Queueing - opt.old = opt.complete; - - opt.complete = function() { - if ( isFunction( opt.old ) ) { - opt.old.call( this ); - } - - if ( opt.queue ) { - jQuery.dequeue( this, opt.queue ); - } - }; - - return opt; -}; - -jQuery.fn.extend( { - fadeTo: function( speed, to, easing, callback ) { - - // Show any hidden elements after setting opacity to 0 - return this.filter( isHiddenWithinTree ).css( "opacity", 0 ).show() - - // Animate to the value specified - .end().animate( { opacity: to }, speed, easing, callback ); - }, - animate: function( prop, speed, easing, callback ) { - var empty = jQuery.isEmptyObject( prop ), - optall = jQuery.speed( speed, easing, callback ), - doAnimation = function() { - - // Operate on a copy of prop so per-property easing won't be lost - var anim = Animation( this, jQuery.extend( {}, prop ), optall ); - - // Empty animations, or finishing resolves immediately - if ( empty || dataPriv.get( this, "finish" ) ) { - anim.stop( true ); - } - }; - doAnimation.finish = doAnimation; - - return empty || optall.queue === false ? - this.each( doAnimation ) : - this.queue( optall.queue, doAnimation ); - }, - stop: function( type, clearQueue, gotoEnd ) { - var stopQueue = function( hooks ) { - var stop = hooks.stop; - delete hooks.stop; - stop( gotoEnd ); - }; - - if ( typeof type !== "string" ) { - gotoEnd = clearQueue; - clearQueue = type; - type = undefined; - } - if ( clearQueue ) { - this.queue( type || "fx", [] ); - } - - return this.each( function() { - var dequeue = true, - index = type != null && type + "queueHooks", - timers = jQuery.timers, - data = dataPriv.get( this ); - - if ( index ) { - if ( data[ index ] && data[ index ].stop ) { - stopQueue( data[ index ] ); - } - } else { - for ( index in data ) { - if ( data[ index ] && data[ index ].stop && rrun.test( index ) ) { - stopQueue( data[ index ] ); - } - } - } - - for ( index = timers.length; index--; ) { - if ( timers[ index ].elem === this && - ( type == null || timers[ index ].queue === type ) ) { - - timers[ index ].anim.stop( gotoEnd ); - dequeue = false; - timers.splice( index, 1 ); - } - } - - // Start the next in the queue if the last step wasn't forced. - // Timers currently will call their complete callbacks, which - // will dequeue but only if they were gotoEnd. - if ( dequeue || !gotoEnd ) { - jQuery.dequeue( this, type ); - } - } ); - }, - finish: function( type ) { - if ( type !== false ) { - type = type || "fx"; - } - return this.each( function() { - var index, - data = dataPriv.get( this ), - queue = data[ type + "queue" ], - hooks = data[ type + "queueHooks" ], - timers = jQuery.timers, - length = queue ? queue.length : 0; - - // Enable finishing flag on private data - data.finish = true; - - // Empty the queue first - jQuery.queue( this, type, [] ); - - if ( hooks && hooks.stop ) { - hooks.stop.call( this, true ); - } - - // Look for any active animations, and finish them - for ( index = timers.length; index--; ) { - if ( timers[ index ].elem === this && timers[ index ].queue === type ) { - timers[ index ].anim.stop( true ); - timers.splice( index, 1 ); - } - } - - // Look for any animations in the old queue and finish them - for ( index = 0; index < length; index++ ) { - if ( queue[ index ] && queue[ index ].finish ) { - queue[ index ].finish.call( this ); - } - } - - // Turn off finishing flag - delete data.finish; - } ); - } -} ); - -jQuery.each( [ "toggle", "show", "hide" ], function( _i, name ) { - var cssFn = jQuery.fn[ name ]; - jQuery.fn[ name ] = function( speed, easing, callback ) { - return speed == null || typeof speed === "boolean" ? - cssFn.apply( this, arguments ) : - this.animate( genFx( name, true ), speed, easing, callback ); - }; -} ); - -// Generate shortcuts for custom animations -jQuery.each( { - slideDown: genFx( "show" ), - slideUp: genFx( "hide" ), - slideToggle: genFx( "toggle" ), - fadeIn: { opacity: "show" }, - fadeOut: { opacity: "hide" }, - fadeToggle: { opacity: "toggle" } -}, function( name, props ) { - jQuery.fn[ name ] = function( speed, easing, callback ) { - return this.animate( props, speed, easing, callback ); - }; -} ); - -jQuery.timers = []; -jQuery.fx.tick = function() { - var timer, - i = 0, - timers = jQuery.timers; - - fxNow = Date.now(); - - for ( ; i < timers.length; i++ ) { - timer = timers[ i ]; - - // Run the timer and safely remove it when done (allowing for external removal) - if ( !timer() && timers[ i ] === timer ) { - timers.splice( i--, 1 ); - } - } - - if ( !timers.length ) { - jQuery.fx.stop(); - } - fxNow = undefined; -}; - -jQuery.fx.timer = function( timer ) { - jQuery.timers.push( timer ); - jQuery.fx.start(); -}; - -jQuery.fx.interval = 13; -jQuery.fx.start = function() { - if ( inProgress ) { - return; - } - - inProgress = true; - schedule(); -}; - -jQuery.fx.stop = function() { - inProgress = null; -}; - -jQuery.fx.speeds = { - slow: 600, - fast: 200, - - // Default speed - _default: 400 -}; - - -// Based off of the plugin by Clint Helfers, with permission. -// https://web.archive.org/web/20100324014747/http://blindsignals.com/index.php/2009/07/jquery-delay/ -jQuery.fn.delay = function( time, type ) { - time = jQuery.fx ? jQuery.fx.speeds[ time ] || time : time; - type = type || "fx"; - - return this.queue( type, function( next, hooks ) { - var timeout = window.setTimeout( next, time ); - hooks.stop = function() { - window.clearTimeout( timeout ); - }; - } ); -}; - - -( function() { - var input = document.createElement( "input" ), - select = document.createElement( "select" ), - opt = select.appendChild( document.createElement( "option" ) ); - - input.type = "checkbox"; - - // Support: Android <=4.3 only - // Default value for a checkbox should be "on" - support.checkOn = input.value !== ""; - - // Support: IE <=11 only - // Must access selectedIndex to make default options select - support.optSelected = opt.selected; - - // Support: IE <=11 only - // An input loses its value after becoming a radio - input = document.createElement( "input" ); - input.value = "t"; - input.type = "radio"; - support.radioValue = input.value === "t"; -} )(); - - -var boolHook, - attrHandle = jQuery.expr.attrHandle; - -jQuery.fn.extend( { - attr: function( name, value ) { - return access( this, jQuery.attr, name, value, arguments.length > 1 ); - }, - - removeAttr: function( name ) { - return this.each( function() { - jQuery.removeAttr( this, name ); - } ); - } -} ); - -jQuery.extend( { - attr: function( elem, name, value ) { - var ret, hooks, - nType = elem.nodeType; - - // Don't get/set attributes on text, comment and attribute nodes - if ( nType === 3 || nType === 8 || nType === 2 ) { - return; - } - - // Fallback to prop when attributes are not supported - if ( typeof elem.getAttribute === "undefined" ) { - return jQuery.prop( elem, name, value ); - } - - // Attribute hooks are determined by the lowercase version - // Grab necessary hook if one is defined - if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) { - hooks = jQuery.attrHooks[ name.toLowerCase() ] || - ( jQuery.expr.match.bool.test( name ) ? boolHook : undefined ); - } - - if ( value !== undefined ) { - if ( value === null ) { - jQuery.removeAttr( elem, name ); - return; - } - - if ( hooks && "set" in hooks && - ( ret = hooks.set( elem, value, name ) ) !== undefined ) { - return ret; - } - - elem.setAttribute( name, value + "" ); - return value; - } - - if ( hooks && "get" in hooks && ( ret = hooks.get( elem, name ) ) !== null ) { - return ret; - } - - ret = jQuery.find.attr( elem, name ); - - // Non-existent attributes return null, we normalize to undefined - return ret == null ? undefined : ret; - }, - - attrHooks: { - type: { - set: function( elem, value ) { - if ( !support.radioValue && value === "radio" && - nodeName( elem, "input" ) ) { - var val = elem.value; - elem.setAttribute( "type", value ); - if ( val ) { - elem.value = val; - } - return value; - } - } - } - }, - - removeAttr: function( elem, value ) { - var name, - i = 0, - - // Attribute names can contain non-HTML whitespace characters - // https://html.spec.whatwg.org/multipage/syntax.html#attributes-2 - attrNames = value && value.match( rnothtmlwhite ); - - if ( attrNames && elem.nodeType === 1 ) { - while ( ( name = attrNames[ i++ ] ) ) { - elem.removeAttribute( name ); - } - } - } -} ); - -// Hooks for boolean attributes -boolHook = { - set: function( elem, value, name ) { - if ( value === false ) { - - // Remove boolean attributes when set to false - jQuery.removeAttr( elem, name ); - } else { - elem.setAttribute( name, name ); - } - return name; - } -}; - -jQuery.each( jQuery.expr.match.bool.source.match( /\w+/g ), function( _i, name ) { - var getter = attrHandle[ name ] || jQuery.find.attr; - - attrHandle[ name ] = function( elem, name, isXML ) { - var ret, handle, - lowercaseName = name.toLowerCase(); - - if ( !isXML ) { - - // Avoid an infinite loop by temporarily removing this function from the getter - handle = attrHandle[ lowercaseName ]; - attrHandle[ lowercaseName ] = ret; - ret = getter( elem, name, isXML ) != null ? - lowercaseName : - null; - attrHandle[ lowercaseName ] = handle; - } - return ret; - }; -} ); - - - - -var rfocusable = /^(?:input|select|textarea|button)$/i, - rclickable = /^(?:a|area)$/i; - -jQuery.fn.extend( { - prop: function( name, value ) { - return access( this, jQuery.prop, name, value, arguments.length > 1 ); - }, - - removeProp: function( name ) { - return this.each( function() { - delete this[ jQuery.propFix[ name ] || name ]; - } ); - } -} ); - -jQuery.extend( { - prop: function( elem, name, value ) { - var ret, hooks, - nType = elem.nodeType; - - // Don't get/set properties on text, comment and attribute nodes - if ( nType === 3 || nType === 8 || nType === 2 ) { - return; - } - - if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) { - - // Fix name and attach hooks - name = jQuery.propFix[ name ] || name; - hooks = jQuery.propHooks[ name ]; - } - - if ( value !== undefined ) { - if ( hooks && "set" in hooks && - ( ret = hooks.set( elem, value, name ) ) !== undefined ) { - return ret; - } - - return ( elem[ name ] = value ); - } - - if ( hooks && "get" in hooks && ( ret = hooks.get( elem, name ) ) !== null ) { - return ret; - } - - return elem[ name ]; - }, - - propHooks: { - tabIndex: { - get: function( elem ) { - - // Support: IE <=9 - 11 only - // elem.tabIndex doesn't always return the - // correct value when it hasn't been explicitly set - // https://web.archive.org/web/20141116233347/http://fluidproject.org/blog/2008/01/09/getting-setting-and-removing-tabindex-values-with-javascript/ - // Use proper attribute retrieval(#12072) - var tabindex = jQuery.find.attr( elem, "tabindex" ); - - if ( tabindex ) { - return parseInt( tabindex, 10 ); - } - - if ( - rfocusable.test( elem.nodeName ) || - rclickable.test( elem.nodeName ) && - elem.href - ) { - return 0; - } - - return -1; - } - } - }, - - propFix: { - "for": "htmlFor", - "class": "className" - } -} ); - -// Support: IE <=11 only -// Accessing the selectedIndex property -// forces the browser to respect setting selected -// on the option -// The getter ensures a default option is selected -// when in an optgroup -// eslint rule "no-unused-expressions" is disabled for this code -// since it considers such accessions noop -if ( !support.optSelected ) { - jQuery.propHooks.selected = { - get: function( elem ) { - - /* eslint no-unused-expressions: "off" */ - - var parent = elem.parentNode; - if ( parent && parent.parentNode ) { - parent.parentNode.selectedIndex; - } - return null; - }, - set: function( elem ) { - - /* eslint no-unused-expressions: "off" */ - - var parent = elem.parentNode; - if ( parent ) { - parent.selectedIndex; - - if ( parent.parentNode ) { - parent.parentNode.selectedIndex; - } - } - } - }; -} - -jQuery.each( [ - "tabIndex", - "readOnly", - "maxLength", - "cellSpacing", - "cellPadding", - "rowSpan", - "colSpan", - "useMap", - "frameBorder", - "contentEditable" -], function() { - jQuery.propFix[ this.toLowerCase() ] = this; -} ); - - - - - // Strip and collapse whitespace according to HTML spec - // https://infra.spec.whatwg.org/#strip-and-collapse-ascii-whitespace - function stripAndCollapse( value ) { - var tokens = value.match( rnothtmlwhite ) || []; - return tokens.join( " " ); - } - - -function getClass( elem ) { - return elem.getAttribute && elem.getAttribute( "class" ) || ""; -} - -function classesToArray( value ) { - if ( Array.isArray( value ) ) { - return value; - } - if ( typeof value === "string" ) { - return value.match( rnothtmlwhite ) || []; - } - return []; -} - -jQuery.fn.extend( { - addClass: function( value ) { - var classes, elem, cur, curValue, clazz, j, finalValue, - i = 0; - - if ( isFunction( value ) ) { - return this.each( function( j ) { - jQuery( this ).addClass( value.call( this, j, getClass( this ) ) ); - } ); - } - - classes = classesToArray( value ); - - if ( classes.length ) { - while ( ( elem = this[ i++ ] ) ) { - curValue = getClass( elem ); - cur = elem.nodeType === 1 && ( " " + stripAndCollapse( curValue ) + " " ); - - if ( cur ) { - j = 0; - while ( ( clazz = classes[ j++ ] ) ) { - if ( cur.indexOf( " " + clazz + " " ) < 0 ) { - cur += clazz + " "; - } - } - - // Only assign if different to avoid unneeded rendering. - finalValue = stripAndCollapse( cur ); - if ( curValue !== finalValue ) { - elem.setAttribute( "class", finalValue ); - } - } - } - } - - return this; - }, - - removeClass: function( value ) { - var classes, elem, cur, curValue, clazz, j, finalValue, - i = 0; - - if ( isFunction( value ) ) { - return this.each( function( j ) { - jQuery( this ).removeClass( value.call( this, j, getClass( this ) ) ); - } ); - } - - if ( !arguments.length ) { - return this.attr( "class", "" ); - } - - classes = classesToArray( value ); - - if ( classes.length ) { - while ( ( elem = this[ i++ ] ) ) { - curValue = getClass( elem ); - - // This expression is here for better compressibility (see addClass) - cur = elem.nodeType === 1 && ( " " + stripAndCollapse( curValue ) + " " ); - - if ( cur ) { - j = 0; - while ( ( clazz = classes[ j++ ] ) ) { - - // Remove *all* instances - while ( cur.indexOf( " " + clazz + " " ) > -1 ) { - cur = cur.replace( " " + clazz + " ", " " ); - } - } - - // Only assign if different to avoid unneeded rendering. - finalValue = stripAndCollapse( cur ); - if ( curValue !== finalValue ) { - elem.setAttribute( "class", finalValue ); - } - } - } - } - - return this; - }, - - toggleClass: function( value, stateVal ) { - var type = typeof value, - isValidValue = type === "string" || Array.isArray( value ); - - if ( typeof stateVal === "boolean" && isValidValue ) { - return stateVal ? this.addClass( value ) : this.removeClass( value ); - } - - if ( isFunction( value ) ) { - return this.each( function( i ) { - jQuery( this ).toggleClass( - value.call( this, i, getClass( this ), stateVal ), - stateVal - ); - } ); - } - - return this.each( function() { - var className, i, self, classNames; - - if ( isValidValue ) { - - // Toggle individual class names - i = 0; - self = jQuery( this ); - classNames = classesToArray( value ); - - while ( ( className = classNames[ i++ ] ) ) { - - // Check each className given, space separated list - if ( self.hasClass( className ) ) { - self.removeClass( className ); - } else { - self.addClass( className ); - } - } - - // Toggle whole class name - } else if ( value === undefined || type === "boolean" ) { - className = getClass( this ); - if ( className ) { - - // Store className if set - dataPriv.set( this, "__className__", className ); - } - - // If the element has a class name or if we're passed `false`, - // then remove the whole classname (if there was one, the above saved it). - // Otherwise bring back whatever was previously saved (if anything), - // falling back to the empty string if nothing was stored. - if ( this.setAttribute ) { - this.setAttribute( "class", - className || value === false ? - "" : - dataPriv.get( this, "__className__" ) || "" - ); - } - } - } ); - }, - - hasClass: function( selector ) { - var className, elem, - i = 0; - - className = " " + selector + " "; - while ( ( elem = this[ i++ ] ) ) { - if ( elem.nodeType === 1 && - ( " " + stripAndCollapse( getClass( elem ) ) + " " ).indexOf( className ) > -1 ) { - return true; - } - } - - return false; - } -} ); - - - - -var rreturn = /\r/g; - -jQuery.fn.extend( { - val: function( value ) { - var hooks, ret, valueIsFunction, - elem = this[ 0 ]; - - if ( !arguments.length ) { - if ( elem ) { - hooks = jQuery.valHooks[ elem.type ] || - jQuery.valHooks[ elem.nodeName.toLowerCase() ]; - - if ( hooks && - "get" in hooks && - ( ret = hooks.get( elem, "value" ) ) !== undefined - ) { - return ret; - } - - ret = elem.value; - - // Handle most common string cases - if ( typeof ret === "string" ) { - return ret.replace( rreturn, "" ); - } - - // Handle cases where value is null/undef or number - return ret == null ? "" : ret; - } - - return; - } - - valueIsFunction = isFunction( value ); - - return this.each( function( i ) { - var val; - - if ( this.nodeType !== 1 ) { - return; - } - - if ( valueIsFunction ) { - val = value.call( this, i, jQuery( this ).val() ); - } else { - val = value; - } - - // Treat null/undefined as ""; convert numbers to string - if ( val == null ) { - val = ""; - - } else if ( typeof val === "number" ) { - val += ""; - - } else if ( Array.isArray( val ) ) { - val = jQuery.map( val, function( value ) { - return value == null ? "" : value + ""; - } ); - } - - hooks = jQuery.valHooks[ this.type ] || jQuery.valHooks[ this.nodeName.toLowerCase() ]; - - // If set returns undefined, fall back to normal setting - if ( !hooks || !( "set" in hooks ) || hooks.set( this, val, "value" ) === undefined ) { - this.value = val; - } - } ); - } -} ); - -jQuery.extend( { - valHooks: { - option: { - get: function( elem ) { - - var val = jQuery.find.attr( elem, "value" ); - return val != null ? - val : - - // Support: IE <=10 - 11 only - // option.text throws exceptions (#14686, #14858) - // Strip and collapse whitespace - // https://html.spec.whatwg.org/#strip-and-collapse-whitespace - stripAndCollapse( jQuery.text( elem ) ); - } - }, - select: { - get: function( elem ) { - var value, option, i, - options = elem.options, - index = elem.selectedIndex, - one = elem.type === "select-one", - values = one ? null : [], - max = one ? index + 1 : options.length; - - if ( index < 0 ) { - i = max; - - } else { - i = one ? index : 0; - } - - // Loop through all the selected options - for ( ; i < max; i++ ) { - option = options[ i ]; - - // Support: IE <=9 only - // IE8-9 doesn't update selected after form reset (#2551) - if ( ( option.selected || i === index ) && - - // Don't return options that are disabled or in a disabled optgroup - !option.disabled && - ( !option.parentNode.disabled || - !nodeName( option.parentNode, "optgroup" ) ) ) { - - // Get the specific value for the option - value = jQuery( option ).val(); - - // We don't need an array for one selects - if ( one ) { - return value; - } - - // Multi-Selects return an array - values.push( value ); - } - } - - return values; - }, - - set: function( elem, value ) { - var optionSet, option, - options = elem.options, - values = jQuery.makeArray( value ), - i = options.length; - - while ( i-- ) { - option = options[ i ]; - - /* eslint-disable no-cond-assign */ - - if ( option.selected = - jQuery.inArray( jQuery.valHooks.option.get( option ), values ) > -1 - ) { - optionSet = true; - } - - /* eslint-enable no-cond-assign */ - } - - // Force browsers to behave consistently when non-matching value is set - if ( !optionSet ) { - elem.selectedIndex = -1; - } - return values; - } - } - } -} ); - -// Radios and checkboxes getter/setter -jQuery.each( [ "radio", "checkbox" ], function() { - jQuery.valHooks[ this ] = { - set: function( elem, value ) { - if ( Array.isArray( value ) ) { - return ( elem.checked = jQuery.inArray( jQuery( elem ).val(), value ) > -1 ); - } - } - }; - if ( !support.checkOn ) { - jQuery.valHooks[ this ].get = function( elem ) { - return elem.getAttribute( "value" ) === null ? "on" : elem.value; - }; - } -} ); - - - - -// Return jQuery for attributes-only inclusion - - -support.focusin = "onfocusin" in window; - - -var rfocusMorph = /^(?:focusinfocus|focusoutblur)$/, - stopPropagationCallback = function( e ) { - e.stopPropagation(); - }; - -jQuery.extend( jQuery.event, { - - trigger: function( event, data, elem, onlyHandlers ) { - - var i, cur, tmp, bubbleType, ontype, handle, special, lastElement, - eventPath = [ elem || document ], - type = hasOwn.call( event, "type" ) ? event.type : event, - namespaces = hasOwn.call( event, "namespace" ) ? event.namespace.split( "." ) : []; - - cur = lastElement = tmp = elem = elem || document; - - // Don't do events on text and comment nodes - if ( elem.nodeType === 3 || elem.nodeType === 8 ) { - return; - } - - // focus/blur morphs to focusin/out; ensure we're not firing them right now - if ( rfocusMorph.test( type + jQuery.event.triggered ) ) { - return; - } - - if ( type.indexOf( "." ) > -1 ) { - - // Namespaced trigger; create a regexp to match event type in handle() - namespaces = type.split( "." ); - type = namespaces.shift(); - namespaces.sort(); - } - ontype = type.indexOf( ":" ) < 0 && "on" + type; - - // Caller can pass in a jQuery.Event object, Object, or just an event type string - event = event[ jQuery.expando ] ? - event : - new jQuery.Event( type, typeof event === "object" && event ); - - // Trigger bitmask: & 1 for native handlers; & 2 for jQuery (always true) - event.isTrigger = onlyHandlers ? 2 : 3; - event.namespace = namespaces.join( "." ); - event.rnamespace = event.namespace ? - new RegExp( "(^|\\.)" + namespaces.join( "\\.(?:.*\\.|)" ) + "(\\.|$)" ) : - null; - - // Clean up the event in case it is being reused - event.result = undefined; - if ( !event.target ) { - event.target = elem; - } - - // Clone any incoming data and prepend the event, creating the handler arg list - data = data == null ? - [ event ] : - jQuery.makeArray( data, [ event ] ); - - // Allow special events to draw outside the lines - special = jQuery.event.special[ type ] || {}; - if ( !onlyHandlers && special.trigger && special.trigger.apply( elem, data ) === false ) { - return; - } - - // Determine event propagation path in advance, per W3C events spec (#9951) - // Bubble up to document, then to window; watch for a global ownerDocument var (#9724) - if ( !onlyHandlers && !special.noBubble && !isWindow( elem ) ) { - - bubbleType = special.delegateType || type; - if ( !rfocusMorph.test( bubbleType + type ) ) { - cur = cur.parentNode; - } - for ( ; cur; cur = cur.parentNode ) { - eventPath.push( cur ); - tmp = cur; - } - - // Only add window if we got to document (e.g., not plain obj or detached DOM) - if ( tmp === ( elem.ownerDocument || document ) ) { - eventPath.push( tmp.defaultView || tmp.parentWindow || window ); - } - } - - // Fire handlers on the event path - i = 0; - while ( ( cur = eventPath[ i++ ] ) && !event.isPropagationStopped() ) { - lastElement = cur; - event.type = i > 1 ? - bubbleType : - special.bindType || type; - - // jQuery handler - handle = ( - dataPriv.get( cur, "events" ) || Object.create( null ) - )[ event.type ] && - dataPriv.get( cur, "handle" ); - if ( handle ) { - handle.apply( cur, data ); - } - - // Native handler - handle = ontype && cur[ ontype ]; - if ( handle && handle.apply && acceptData( cur ) ) { - event.result = handle.apply( cur, data ); - if ( event.result === false ) { - event.preventDefault(); - } - } - } - event.type = type; - - // If nobody prevented the default action, do it now - if ( !onlyHandlers && !event.isDefaultPrevented() ) { - - if ( ( !special._default || - special._default.apply( eventPath.pop(), data ) === false ) && - acceptData( elem ) ) { - - // Call a native DOM method on the target with the same name as the event. - // Don't do default actions on window, that's where global variables be (#6170) - if ( ontype && isFunction( elem[ type ] ) && !isWindow( elem ) ) { - - // Don't re-trigger an onFOO event when we call its FOO() method - tmp = elem[ ontype ]; - - if ( tmp ) { - elem[ ontype ] = null; - } - - // Prevent re-triggering of the same event, since we already bubbled it above - jQuery.event.triggered = type; - - if ( event.isPropagationStopped() ) { - lastElement.addEventListener( type, stopPropagationCallback ); - } - - elem[ type ](); - - if ( event.isPropagationStopped() ) { - lastElement.removeEventListener( type, stopPropagationCallback ); - } - - jQuery.event.triggered = undefined; - - if ( tmp ) { - elem[ ontype ] = tmp; - } - } - } - } - - return event.result; - }, - - // Piggyback on a donor event to simulate a different one - // Used only for `focus(in | out)` events - simulate: function( type, elem, event ) { - var e = jQuery.extend( - new jQuery.Event(), - event, - { - type: type, - isSimulated: true - } - ); - - jQuery.event.trigger( e, null, elem ); - } - -} ); - -jQuery.fn.extend( { - - trigger: function( type, data ) { - return this.each( function() { - jQuery.event.trigger( type, data, this ); - } ); - }, - triggerHandler: function( type, data ) { - var elem = this[ 0 ]; - if ( elem ) { - return jQuery.event.trigger( type, data, elem, true ); - } - } -} ); - - -// Support: Firefox <=44 -// Firefox doesn't have focus(in | out) events -// Related ticket - https://bugzilla.mozilla.org/show_bug.cgi?id=687787 -// -// Support: Chrome <=48 - 49, Safari <=9.0 - 9.1 -// focus(in | out) events fire after focus & blur events, -// which is spec violation - http://www.w3.org/TR/DOM-Level-3-Events/#events-focusevent-event-order -// Related ticket - https://bugs.chromium.org/p/chromium/issues/detail?id=449857 -if ( !support.focusin ) { - jQuery.each( { focus: "focusin", blur: "focusout" }, function( orig, fix ) { - - // Attach a single capturing handler on the document while someone wants focusin/focusout - var handler = function( event ) { - jQuery.event.simulate( fix, event.target, jQuery.event.fix( event ) ); - }; - - jQuery.event.special[ fix ] = { - setup: function() { - - // Handle: regular nodes (via `this.ownerDocument`), window - // (via `this.document`) & document (via `this`). - var doc = this.ownerDocument || this.document || this, - attaches = dataPriv.access( doc, fix ); - - if ( !attaches ) { - doc.addEventListener( orig, handler, true ); - } - dataPriv.access( doc, fix, ( attaches || 0 ) + 1 ); - }, - teardown: function() { - var doc = this.ownerDocument || this.document || this, - attaches = dataPriv.access( doc, fix ) - 1; - - if ( !attaches ) { - doc.removeEventListener( orig, handler, true ); - dataPriv.remove( doc, fix ); - - } else { - dataPriv.access( doc, fix, attaches ); - } - } - }; - } ); -} -var location = window.location; - -var nonce = { guid: Date.now() }; - -var rquery = ( /\?/ ); - - - -// Cross-browser xml parsing -jQuery.parseXML = function( data ) { - var xml; - 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 ( a == null ) { - return ""; - } - - // If an array was passed in, assume that it is an array of form elements. - if ( Array.isArray( a ) || ( a.jquery && !jQuery.isPlainObject( a ) ) ) { - - // Serialize the form elements - jQuery.each( a, function() { - add( this.name, this.value ); - } ); - - } else { - - // If traditional, encode the "old" way (the way 1.3.2 or older - // did it), otherwise encode params recursively. - for ( prefix in a ) { - buildParams( prefix, a[ prefix ], traditional, add ); - } - } - - // Return the resulting serialization - return s.join( "&" ); -}; - -jQuery.fn.extend( { - serialize: function() { - return jQuery.param( this.serializeArray() ); - }, - serializeArray: function() { - return this.map( function() { - - // Can add propHook for "elements" to filter or add form elements - var elements = jQuery.prop( this, "elements" ); - return elements ? jQuery.makeArray( elements ) : this; - } ) - .filter( function() { - var type = this.type; - - // Use .is( ":disabled" ) so that fieldset[disabled] works - return this.name && !jQuery( this ).is( ":disabled" ) && - rsubmittable.test( this.nodeName ) && !rsubmitterTypes.test( type ) && - ( this.checked || !rcheckableType.test( type ) ); - } ) - .map( function( _i, elem ) { - var val = jQuery( this ).val(); - - if ( val == null ) { - return null; - } - - if ( Array.isArray( val ) ) { - return jQuery.map( val, function( val ) { - return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) }; - } ); - } - - return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) }; - } ).get(); - } -} ); - - -var - r20 = /%20/g, - rhash = /#.*$/, - rantiCache = /([?&])_=[^&]*/, - rheaders = /^(.*?):[ \t]*([^\r\n]*)$/mg, - - // #7653, #8125, #8152: local protocol detection - rlocalProtocol = /^(?:about|app|app-storage|.+-extension|file|res|widget):$/, - rnoContent = /^(?:GET|HEAD)$/, - rprotocol = /^\/\//, - - /* Prefilters - * 1) They are useful to introduce custom dataTypes (see ajax/jsonp.js for an example) - * 2) These are called: - * - BEFORE asking for a transport - * - AFTER param serialization (s.data is a string if s.processData is true) - * 3) key is the dataType - * 4) the catchall symbol "*" can be used - * 5) execution will start with transport dataType and THEN continue down to "*" if needed - */ - prefilters = {}, - - /* Transports bindings - * 1) key is the dataType - * 2) the catchall symbol "*" can be used - * 3) selection will start with transport dataType and THEN go to "*" if needed - */ - transports = {}, - - // Avoid comment-prolog char sequence (#10098); must appease lint and evade compression - allTypes = "*/".concat( "*" ), - - // Anchor tag for parsing the document origin - originAnchor = document.createElement( "a" ); - originAnchor.href = location.href; - -// Base "constructor" for jQuery.ajaxPrefilter and jQuery.ajaxTransport -function addToPrefiltersOrTransports( structure ) { - - // dataTypeExpression is optional and defaults to "*" - return function( dataTypeExpression, func ) { - - if ( typeof dataTypeExpression !== "string" ) { - func = dataTypeExpression; - dataTypeExpression = "*"; - } - - var dataType, - i = 0, - dataTypes = dataTypeExpression.toLowerCase().match( rnothtmlwhite ) || []; - - if ( isFunction( func ) ) { - - // For each dataType in the dataTypeExpression - while ( ( dataType = dataTypes[ i++ ] ) ) { - - // Prepend if requested - if ( dataType[ 0 ] === "+" ) { - dataType = dataType.slice( 1 ) || "*"; - ( structure[ dataType ] = structure[ dataType ] || [] ).unshift( func ); - - // Otherwise append - } else { - ( structure[ dataType ] = structure[ dataType ] || [] ).push( func ); - } - } - } - }; -} - -// Base inspection function for prefilters and transports -function inspectPrefiltersOrTransports( structure, options, originalOptions, jqXHR ) { - - var inspected = {}, - seekingTransport = ( structure === transports ); - - function inspect( dataType ) { - var selected; - inspected[ dataType ] = true; - jQuery.each( structure[ dataType ] || [], function( _, prefilterOrFactory ) { - var dataTypeOrTransport = prefilterOrFactory( options, originalOptions, jqXHR ); - if ( typeof dataTypeOrTransport === "string" && - !seekingTransport && !inspected[ dataTypeOrTransport ] ) { - - options.dataTypes.unshift( dataTypeOrTransport ); - inspect( dataTypeOrTransport ); - return false; - } else if ( seekingTransport ) { - return !( selected = dataTypeOrTransport ); - } - } ); - return selected; - } - - return inspect( options.dataTypes[ 0 ] ) || !inspected[ "*" ] && inspect( "*" ); -} - -// A special extend for ajax options -// that takes "flat" options (not to be deep extended) -// Fixes #9887 -function ajaxExtend( target, src ) { - var key, deep, - flatOptions = jQuery.ajaxSettings.flatOptions || {}; - - for ( key in src ) { - if ( src[ key ] !== undefined ) { - ( flatOptions[ key ] ? target : ( deep || ( deep = {} ) ) )[ key ] = src[ key ]; - } - } - if ( deep ) { - jQuery.extend( true, target, deep ); - } - - return target; -} - -/* Handles responses to an ajax request: - * - finds the right dataType (mediates between content-type and expected dataType) - * - returns the corresponding response - */ -function ajaxHandleResponses( s, jqXHR, responses ) { - - var ct, type, finalDataType, firstDataType, - contents = s.contents, - dataTypes = s.dataTypes; - - // Remove auto dataType and get content-type in the process - while ( dataTypes[ 0 ] === "*" ) { - dataTypes.shift(); - if ( ct === undefined ) { - ct = s.mimeType || jqXHR.getResponseHeader( "Content-Type" ); - } - } - - // Check if we're dealing with a known content-type - if ( ct ) { - for ( type in contents ) { - if ( contents[ type ] && contents[ type ].test( ct ) ) { - dataTypes.unshift( type ); - break; - } - } - } - - // Check to see if we have a response for the expected dataType - if ( dataTypes[ 0 ] in responses ) { - finalDataType = dataTypes[ 0 ]; - } else { - - // Try convertible dataTypes - for ( type in responses ) { - if ( !dataTypes[ 0 ] || s.converters[ type + " " + dataTypes[ 0 ] ] ) { - finalDataType = type; - break; - } - if ( !firstDataType ) { - firstDataType = type; - } - } - - // Or just use first one - finalDataType = finalDataType || firstDataType; - } - - // If we found a dataType - // We add the dataType to the list if needed - // and return the corresponding response - if ( finalDataType ) { - if ( finalDataType !== dataTypes[ 0 ] ) { - dataTypes.unshift( finalDataType ); - } - return responses[ finalDataType ]; - } -} - -/* Chain conversions given the request and the original response - * Also sets the responseXXX fields on the jqXHR instance - */ -function ajaxConvert( s, response, jqXHR, isSuccess ) { - var conv2, current, conv, tmp, prev, - converters = {}, - - // Work with a copy of dataTypes in case we need to modify it for conversion - dataTypes = s.dataTypes.slice(); - - // Create converters map with lowercased keys - if ( dataTypes[ 1 ] ) { - for ( conv in s.converters ) { - converters[ conv.toLowerCase() ] = s.converters[ conv ]; - } - } - - current = dataTypes.shift(); - - // Convert to each sequential dataType - while ( current ) { - - if ( s.responseFields[ current ] ) { - jqXHR[ s.responseFields[ current ] ] = response; - } - - // Apply the dataFilter if provided - if ( !prev && isSuccess && s.dataFilter ) { - response = s.dataFilter( response, s.dataType ); - } - - prev = current; - current = dataTypes.shift(); - - if ( current ) { - - // There's only work to do if current dataType is non-auto - if ( current === "*" ) { - - current = prev; - - // Convert response if prev dataType is non-auto and differs from current - } else if ( prev !== "*" && prev !== current ) { - - // Seek a direct converter - conv = converters[ prev + " " + current ] || converters[ "* " + current ]; - - // If none found, seek a pair - if ( !conv ) { - for ( conv2 in converters ) { - - // If conv2 outputs current - tmp = conv2.split( " " ); - if ( tmp[ 1 ] === current ) { - - // If prev can be converted to accepted input - conv = converters[ prev + " " + tmp[ 0 ] ] || - converters[ "* " + tmp[ 0 ] ]; - if ( conv ) { - - // Condense equivalence converters - if ( conv === true ) { - conv = converters[ conv2 ]; - - // Otherwise, insert the intermediate dataType - } else if ( converters[ conv2 ] !== true ) { - current = tmp[ 0 ]; - dataTypes.unshift( tmp[ 1 ] ); - } - break; - } - } - } - } - - // Apply converter (if not an equivalence) - if ( conv !== true ) { - - // Unless errors are allowed to bubble, catch and return them - if ( conv && s.throws ) { - response = conv( response ); - } else { - try { - response = conv( response ); - } catch ( e ) { - return { - state: "parsererror", - error: conv ? e : "No conversion from " + prev + " to " + current - }; - } - } - } - } - } - } - - return { state: "success", data: response }; -} - -jQuery.extend( { - - // Counter for holding the number of active queries - active: 0, - - // Last-Modified header cache for next request - lastModified: {}, - etag: {}, - - ajaxSettings: { - url: location.href, - type: "GET", - isLocal: rlocalProtocol.test( location.protocol ), - global: true, - processData: true, - async: true, - contentType: "application/x-www-form-urlencoded; charset=UTF-8", - - /* - timeout: 0, - data: null, - dataType: null, - username: null, - password: null, - cache: null, - throws: false, - traditional: false, - headers: {}, - */ - - accepts: { - "*": allTypes, - text: "text/plain", - html: "text/html", - xml: "application/xml, text/xml", - json: "application/json, text/javascript" - }, - - contents: { - xml: /\bxml\b/, - html: /\bhtml/, - json: /\bjson\b/ - }, - - responseFields: { - xml: "responseXML", - text: "responseText", - json: "responseJSON" - }, - - // Data converters - // Keys separate source (or catchall "*") and destination types with a single space - converters: { - - // Convert anything to text - "* text": String, - - // Text to html (true = no transformation) - "text html": true, - - // Evaluate text as a json expression - "text json": JSON.parse, - - // Parse text as xml - "text xml": jQuery.parseXML - }, - - // For options that shouldn't be deep extended: - // you can add your own custom options here if - // and when you create one that shouldn't be - // deep extended (see ajaxExtend) - flatOptions: { - url: true, - context: true - } - }, - - // Creates a full fledged settings object into target - // with both ajaxSettings and settings fields. - // If target is omitted, writes into ajaxSettings. - ajaxSetup: function( target, settings ) { - return settings ? - - // Building a settings object - ajaxExtend( ajaxExtend( target, jQuery.ajaxSettings ), settings ) : - - // Extending ajaxSettings - ajaxExtend( jQuery.ajaxSettings, target ); - }, - - ajaxPrefilter: addToPrefiltersOrTransports( prefilters ), - ajaxTransport: addToPrefiltersOrTransports( transports ), - - // Main method - ajax: function( url, options ) { - - // If url is an object, simulate pre-1.5 signature - if ( typeof url === "object" ) { - options = url; - url = undefined; - } - - // Force options to be an object - options = options || {}; - - var transport, - - // URL without anti-cache param - cacheURL, - - // Response headers - responseHeadersString, - responseHeaders, - - // timeout handle - timeoutTimer, - - // Url cleanup var - urlAnchor, - - // Request state (becomes false upon send and true upon completion) - completed, - - // To know if global events are to be dispatched - fireGlobals, - - // Loop variable - i, - - // uncached part of the url - uncached, - - // Create the final options object - s = jQuery.ajaxSetup( {}, options ), - - // Callbacks context - callbackContext = s.context || s, - - // Context for global events is callbackContext if it is a DOM node or jQuery collection - globalEventContext = s.context && - ( callbackContext.nodeType || callbackContext.jquery ) ? - jQuery( callbackContext ) : - jQuery.event, - - // Deferreds - deferred = jQuery.Deferred(), - completeDeferred = jQuery.Callbacks( "once memory" ), - - // Status-dependent callbacks - statusCode = s.statusCode || {}, - - // Headers (they are sent all at once) - requestHeaders = {}, - requestHeadersNames = {}, - - // Default abort message - strAbort = "canceled", - - // Fake xhr - jqXHR = { - readyState: 0, - - // Builds headers hashtable if needed - getResponseHeader: function( key ) { - var match; - if ( completed ) { - if ( !responseHeaders ) { - responseHeaders = {}; - while ( ( match = rheaders.exec( responseHeadersString ) ) ) { - responseHeaders[ match[ 1 ].toLowerCase() + " " ] = - ( responseHeaders[ match[ 1 ].toLowerCase() + " " ] || [] ) - .concat( match[ 2 ] ); - } - } - match = responseHeaders[ key.toLowerCase() + " " ]; - } - return match == null ? null : match.join( ", " ); - }, - - // Raw string - getAllResponseHeaders: function() { - return completed ? responseHeadersString : null; - }, - - // Caches the header - setRequestHeader: function( name, value ) { - if ( completed == null ) { - name = requestHeadersNames[ name.toLowerCase() ] = - requestHeadersNames[ name.toLowerCase() ] || name; - requestHeaders[ name ] = value; - } - return this; - }, - - // Overrides response content-type header - overrideMimeType: function( type ) { - if ( completed == null ) { - s.mimeType = type; - } - return this; - }, - - // Status-dependent callbacks - statusCode: function( map ) { - var code; - if ( map ) { - if ( completed ) { - - // Execute the appropriate callbacks - jqXHR.always( map[ jqXHR.status ] ); - } else { - - // Lazy-add the new callbacks in a way that preserves old ones - for ( code in map ) { - statusCode[ code ] = [ statusCode[ code ], map[ code ] ]; - } - } - } - return this; - }, - - // Cancel the request - abort: function( statusText ) { - var finalText = statusText || strAbort; - if ( transport ) { - transport.abort( finalText ); - } - done( 0, finalText ); - return this; - } - }; - - // Attach deferreds - deferred.promise( jqXHR ); - - // Add protocol if not provided (prefilters might expect it) - // Handle falsy url in the settings object (#10093: consistency with old signature) - // We also use the url parameter if available - s.url = ( ( url || s.url || location.href ) + "" ) - .replace( rprotocol, location.protocol + "//" ); - - // Alias method option to type as per ticket #12004 - s.type = options.method || options.type || s.method || s.type; - - // Extract dataTypes list - s.dataTypes = ( s.dataType || "*" ).toLowerCase().match( rnothtmlwhite ) || [ "" ]; - - // A cross-domain request is in order when the origin doesn't match the current origin. - if ( s.crossDomain == null ) { - urlAnchor = document.createElement( "a" ); - - // Support: IE <=8 - 11, Edge 12 - 15 - // IE throws exception on accessing the href property if url is malformed, - // e.g. http://example.com:80x/ - try { - urlAnchor.href = s.url; - - // Support: IE <=8 - 11 only - // Anchor's host property isn't correctly set when s.url is relative - urlAnchor.href = urlAnchor.href; - s.crossDomain = originAnchor.protocol + "//" + originAnchor.host !== - urlAnchor.protocol + "//" + urlAnchor.host; - } catch ( e ) { - - // If there is an error parsing the URL, assume it is crossDomain, - // it can be rejected by the transport if it is invalid - s.crossDomain = true; - } - } - - // Convert data if not already a string - if ( s.data && s.processData && typeof s.data !== "string" ) { - s.data = jQuery.param( s.data, s.traditional ); - } - - // Apply prefilters - inspectPrefiltersOrTransports( prefilters, s, options, jqXHR ); - - // If request was aborted inside a prefilter, stop there - if ( completed ) { - return jqXHR; - } - - // We can fire global events as of now if asked to - // Don't fire events if jQuery.event is undefined in an AMD-usage scenario (#15118) - fireGlobals = jQuery.event && s.global; - - // Watch for a new set of requests - if ( fireGlobals && jQuery.active++ === 0 ) { - jQuery.event.trigger( "ajaxStart" ); - } - - // Uppercase the type - s.type = s.type.toUpperCase(); - - // Determine if request has content - s.hasContent = !rnoContent.test( s.type ); - - // Save the URL in case we're toying with the If-Modified-Since - // and/or If-None-Match header later on - // Remove hash to simplify url manipulation - cacheURL = s.url.replace( rhash, "" ); - - // More options handling for requests with no content - if ( !s.hasContent ) { - - // Remember the hash so we can put it back - uncached = s.url.slice( cacheURL.length ); - - // If data is available and should be processed, append data to url - if ( s.data && ( s.processData || typeof s.data === "string" ) ) { - cacheURL += ( rquery.test( cacheURL ) ? "&" : "?" ) + s.data; - - // #9682: remove data so that it's not used in an eventual retry - delete s.data; - } - - // Add or update anti-cache param if needed - if ( s.cache === false ) { - cacheURL = cacheURL.replace( rantiCache, "$1" ); - uncached = ( rquery.test( cacheURL ) ? "&" : "?" ) + "_=" + ( nonce.guid++ ) + - uncached; - } - - // Put hash and anti-cache on the URL that will be requested (gh-1732) - s.url = cacheURL + uncached; - - // Change '%20' to '+' if this is encoded form body content (gh-2658) - } else if ( s.data && s.processData && - ( s.contentType || "" ).indexOf( "application/x-www-form-urlencoded" ) === 0 ) { - s.data = s.data.replace( r20, "+" ); - } - - // Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode. - if ( s.ifModified ) { - if ( jQuery.lastModified[ cacheURL ] ) { - jqXHR.setRequestHeader( "If-Modified-Since", jQuery.lastModified[ cacheURL ] ); - } - if ( jQuery.etag[ cacheURL ] ) { - jqXHR.setRequestHeader( "If-None-Match", jQuery.etag[ cacheURL ] ); - } - } - - // Set the correct header, if data is being sent - if ( s.data && s.hasContent && s.contentType !== false || options.contentType ) { - jqXHR.setRequestHeader( "Content-Type", s.contentType ); - } - - // Set the Accepts header for the server, depending on the dataType - jqXHR.setRequestHeader( - "Accept", - s.dataTypes[ 0 ] && s.accepts[ s.dataTypes[ 0 ] ] ? - s.accepts[ s.dataTypes[ 0 ] ] + - ( s.dataTypes[ 0 ] !== "*" ? ", " + allTypes + "; q=0.01" : "" ) : - s.accepts[ "*" ] - ); - - // Check for headers option - for ( i in s.headers ) { - jqXHR.setRequestHeader( i, s.headers[ i ] ); - } - - // Allow custom headers/mimetypes and early abort - if ( s.beforeSend && - ( s.beforeSend.call( callbackContext, jqXHR, s ) === false || completed ) ) { - - // Abort if not done already and return - return jqXHR.abort(); - } - - // Aborting is no longer a cancellation - strAbort = "abort"; - - // Install callbacks on deferreds - completeDeferred.add( s.complete ); - jqXHR.done( s.success ); - jqXHR.fail( s.error ); - - // Get transport - transport = inspectPrefiltersOrTransports( transports, s, options, jqXHR ); - - // If no transport, we auto-abort - if ( !transport ) { - done( -1, "No Transport" ); - } else { - jqXHR.readyState = 1; - - // Send global event - if ( fireGlobals ) { - globalEventContext.trigger( "ajaxSend", [ jqXHR, s ] ); - } - - // If request was aborted inside ajaxSend, stop there - if ( completed ) { - return jqXHR; - } - - // Timeout - if ( s.async && s.timeout > 0 ) { - timeoutTimer = window.setTimeout( function() { - jqXHR.abort( "timeout" ); - }, s.timeout ); - } - - try { - completed = false; - transport.send( requestHeaders, done ); - } catch ( e ) { - - // Rethrow post-completion exceptions - if ( completed ) { - throw e; - } - - // Propagate others as results - done( -1, e ); - } - } - - // Callback for when everything is done - function done( status, nativeStatusText, responses, headers ) { - var isSuccess, success, error, response, modified, - statusText = nativeStatusText; - - // Ignore repeat invocations - if ( completed ) { - return; - } - - completed = true; - - // Clear timeout if it exists - if ( timeoutTimer ) { - window.clearTimeout( timeoutTimer ); - } - - // Dereference transport for early garbage collection - // (no matter how long the jqXHR object will be used) - transport = undefined; - - // Cache response headers - responseHeadersString = headers || ""; - - // Set readyState - jqXHR.readyState = status > 0 ? 4 : 0; - - // Determine if successful - isSuccess = status >= 200 && status < 300 || status === 304; - - // Get response data - if ( responses ) { - response = ajaxHandleResponses( s, jqXHR, responses ); - } - - // Use a noop converter for missing script - if ( !isSuccess && jQuery.inArray( "script", s.dataTypes ) > -1 ) { - s.converters[ "text script" ] = function() {}; - } - - // Convert no matter what (that way responseXXX fields are always set) - response = ajaxConvert( s, response, jqXHR, isSuccess ); - - // If successful, handle type chaining - if ( isSuccess ) { - - // Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode. - if ( s.ifModified ) { - modified = jqXHR.getResponseHeader( "Last-Modified" ); - if ( modified ) { - jQuery.lastModified[ cacheURL ] = modified; - } - modified = jqXHR.getResponseHeader( "etag" ); - if ( modified ) { - jQuery.etag[ cacheURL ] = modified; - } - } - - // if no content - if ( status === 204 || s.type === "HEAD" ) { - statusText = "nocontent"; - - // if not modified - } else if ( status === 304 ) { - statusText = "notmodified"; - - // If we have data, let's convert it - } else { - statusText = response.state; - success = response.data; - error = response.error; - isSuccess = !error; - } - } else { - - // Extract error from statusText and normalize for non-aborts - error = statusText; - if ( status || !statusText ) { - statusText = "error"; - if ( status < 0 ) { - status = 0; - } - } - } - - // Set data for the fake xhr object - jqXHR.status = status; - jqXHR.statusText = ( nativeStatusText || statusText ) + ""; - - // Success/Error - if ( isSuccess ) { - deferred.resolveWith( callbackContext, [ success, statusText, jqXHR ] ); - } else { - deferred.rejectWith( callbackContext, [ jqXHR, statusText, error ] ); - } - - // Status-dependent callbacks - jqXHR.statusCode( statusCode ); - statusCode = undefined; - - if ( fireGlobals ) { - globalEventContext.trigger( isSuccess ? "ajaxSuccess" : "ajaxError", - [ jqXHR, s, isSuccess ? success : error ] ); - } - - // Complete - completeDeferred.fireWith( callbackContext, [ jqXHR, statusText ] ); - - if ( fireGlobals ) { - globalEventContext.trigger( "ajaxComplete", [ jqXHR, s ] ); - - // Handle the global AJAX counter - if ( !( --jQuery.active ) ) { - jQuery.event.trigger( "ajaxStop" ); - } - } - } - - return jqXHR; - }, - - getJSON: function( url, data, callback ) { - return jQuery.get( url, data, callback, "json" ); - }, - - getScript: function( url, callback ) { - return jQuery.get( url, undefined, callback, "script" ); - } -} ); - -jQuery.each( [ "get", "post" ], function( _i, method ) { - jQuery[ method ] = function( url, data, callback, type ) { - - // Shift arguments if data argument was omitted - if ( isFunction( data ) ) { - type = type || callback; - callback = data; - data = undefined; - } - - // The url can be an options object (which then must have .url) - return jQuery.ajax( jQuery.extend( { - url: url, - type: method, - dataType: type, - data: data, - success: callback - }, jQuery.isPlainObject( url ) && url ) ); - }; -} ); - -jQuery.ajaxPrefilter( function( s ) { - var i; - for ( i in s.headers ) { - if ( i.toLowerCase() === "content-type" ) { - s.contentType = s.headers[ i ] || ""; - } - } -} ); - - -jQuery._evalUrl = function( url, options, doc ) { - return jQuery.ajax( { - url: url, - - // Make this explicit, since user can override this through ajaxSetup (#11264) - type: "GET", - dataType: "script", - cache: true, - async: false, - global: false, - - // Only evaluate the response if it is successful (gh-4126) - // dataFilter is not invoked for failure responses, so using it instead - // of the default converter is kludgy but it works. - converters: { - "text script": function() {} - }, - dataFilter: function( response ) { - jQuery.globalEval( response, options, doc ); - } - } ); -}; - - -jQuery.fn.extend( { - wrapAll: function( html ) { - var wrap; - - if ( this[ 0 ] ) { - if ( isFunction( html ) ) { - html = html.call( this[ 0 ] ); - } - - // The elements to wrap the target around - wrap = jQuery( html, this[ 0 ].ownerDocument ).eq( 0 ).clone( true ); - - if ( this[ 0 ].parentNode ) { - wrap.insertBefore( this[ 0 ] ); - } - - wrap.map( function() { - var elem = this; - - while ( elem.firstElementChild ) { - elem = elem.firstElementChild; - } - - return elem; - } ).append( this ); - } - - return this; - }, - - wrapInner: function( html ) { - if ( isFunction( html ) ) { - return this.each( function( i ) { - jQuery( this ).wrapInner( html.call( this, i ) ); - } ); - } - - return this.each( function() { - var self = jQuery( this ), - contents = self.contents(); - - if ( contents.length ) { - contents.wrapAll( html ); - - } else { - self.append( html ); - } - } ); - }, - - wrap: function( html ) { - var htmlIsFunction = isFunction( html ); - - return this.each( function( i ) { - jQuery( this ).wrapAll( htmlIsFunction ? html.call( this, i ) : html ); - } ); - }, - - unwrap: function( selector ) { - this.parent( selector ).not( "body" ).each( function() { - jQuery( this ).replaceWith( this.childNodes ); - } ); - return this; - } -} ); - - -jQuery.expr.pseudos.hidden = function( elem ) { - return !jQuery.expr.pseudos.visible( elem ); -}; -jQuery.expr.pseudos.visible = function( elem ) { - return !!( elem.offsetWidth || elem.offsetHeight || elem.getClientRects().length ); -}; - - - - -jQuery.ajaxSettings.xhr = function() { - try { - return new window.XMLHttpRequest(); - } catch ( e ) {} -}; - -var xhrSuccessStatus = { - - // File protocol always yields status code 0, assume 200 - 0: 200, - - // Support: IE <=9 only - // #1450: sometimes IE returns 1223 when it should be 204 - 1223: 204 - }, - xhrSupported = jQuery.ajaxSettings.xhr(); - -support.cors = !!xhrSupported && ( "withCredentials" in xhrSupported ); -support.ajax = xhrSupported = !!xhrSupported; - -jQuery.ajaxTransport( function( options ) { - var callback, errorCallback; - - // Cross domain only allowed if supported through XMLHttpRequest - if ( support.cors || xhrSupported && !options.crossDomain ) { - return { - send: function( headers, complete ) { - var i, - xhr = options.xhr(); - - xhr.open( - options.type, - options.url, - options.async, - options.username, - options.password - ); - - // Apply custom fields if provided - if ( options.xhrFields ) { - for ( i in options.xhrFields ) { - xhr[ i ] = options.xhrFields[ i ]; - } - } - - // Override mime type if needed - if ( options.mimeType && xhr.overrideMimeType ) { - xhr.overrideMimeType( options.mimeType ); - } - - // X-Requested-With header - // For cross-domain requests, seeing as conditions for a preflight are - // akin to a jigsaw puzzle, we simply never set it to be sure. - // (it can always be set on a per-request basis or even using ajaxSetup) - // For same-domain requests, won't change header if already provided. - if ( !options.crossDomain && !headers[ "X-Requested-With" ] ) { - headers[ "X-Requested-With" ] = "XMLHttpRequest"; - } - - // Set headers - for ( i in headers ) { - xhr.setRequestHeader( i, headers[ i ] ); - } - - // Callback - callback = function( type ) { - return function() { - if ( callback ) { - callback = errorCallback = xhr.onload = - xhr.onerror = xhr.onabort = xhr.ontimeout = - xhr.onreadystatechange = null; - - if ( type === "abort" ) { - xhr.abort(); - } else if ( type === "error" ) { - - // Support: IE <=9 only - // On a manual native abort, IE9 throws - // errors on any property access that is not readyState - if ( typeof xhr.status !== "number" ) { - complete( 0, "error" ); - } else { - complete( - - // File: protocol always yields status 0; see #8605, #14207 - xhr.status, - xhr.statusText - ); - } - } else { - complete( - xhrSuccessStatus[ xhr.status ] || xhr.status, - xhr.statusText, - - // Support: IE <=9 only - // IE9 has no XHR2 but throws on binary (trac-11426) - // For XHR2 non-text, let the caller handle it (gh-2498) - ( xhr.responseType || "text" ) !== "text" || - typeof xhr.responseText !== "string" ? - { binary: xhr.response } : - { text: xhr.responseText }, - xhr.getAllResponseHeaders() - ); - } - } - }; - }; - - // Listen to events - xhr.onload = callback(); - errorCallback = xhr.onerror = xhr.ontimeout = callback( "error" ); - - // Support: IE 9 only - // Use onreadystatechange to replace onabort - // to handle uncaught aborts - if ( xhr.onabort !== undefined ) { - xhr.onabort = errorCallback; - } else { - xhr.onreadystatechange = function() { - - // Check readyState before timeout as it changes - if ( xhr.readyState === 4 ) { - - // Allow onerror to be called first, - // but that will not handle a native abort - // Also, save errorCallback to a variable - // as xhr.onerror cannot be accessed - window.setTimeout( function() { - if ( callback ) { - errorCallback(); - } - } ); - } - }; - } - - // Create the abort callback - callback = callback( "abort" ); - - try { - - // Do send the request (this may raise an exception) - xhr.send( options.hasContent && options.data || null ); - } catch ( e ) { - - // #14683: Only rethrow if this hasn't been notified as an error yet - if ( callback ) { - throw e; - } - } - }, - - abort: function() { - if ( callback ) { - callback(); - } - } - }; - } -} ); - - - - -// Prevent auto-execution of scripts when no explicit dataType was provided (See gh-2432) -jQuery.ajaxPrefilter( function( s ) { - if ( s.crossDomain ) { - s.contents.script = false; - } -} ); - -// Install script dataType -jQuery.ajaxSetup( { - accepts: { - script: "text/javascript, application/javascript, " + - "application/ecmascript, application/x-ecmascript" - }, - contents: { - script: /\b(?:java|ecma)script\b/ - }, - converters: { - "text script": function( text ) { - jQuery.globalEval( text ); - return text; - } - } -} ); - -// Handle cache's special case and crossDomain -jQuery.ajaxPrefilter( "script", function( s ) { - if ( s.cache === undefined ) { - s.cache = false; - } - if ( s.crossDomain ) { - s.type = "GET"; - } -} ); - -// Bind script tag hack transport -jQuery.ajaxTransport( "script", function( s ) { - - // This transport only deals with cross domain or forced-by-attrs requests - if ( s.crossDomain || s.scriptAttrs ) { - var script, callback; - return { - send: function( _, complete ) { - script = jQuery( "\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/jquery/jszip-utils/dist/jszip-utils-ie.min.js b/jquery/jszip-utils/dist/jszip-utils-ie.min.js deleted file mode 100644 index 93d8bc8e..00000000 --- a/jquery/jszip-utils/dist/jszip-utils-ie.min.js +++ /dev/null @@ -1,10 +0,0 @@ -/*! - -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/jquery/jszip-utils/dist/jszip-utils.js b/jquery/jszip-utils/dist/jszip-utils.js deleted file mode 100644 index 775895ec..00000000 --- a/jquery/jszip-utils/dist/jszip-utils.js +++ /dev/null @@ -1,118 +0,0 @@ -/*! - -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 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 compression. - * @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 information 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 information - * 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 emitted 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" : {...} - // } - // NOTE: we use a null prototype because we do not - // want filenames like "toString" coming from a zip file - // to overwrite methods and attributes in a normal Object. - this.files = Object.create(null); - - 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.7.1"; - -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 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; - /* jshint ignore:start */ - // ignore warning about unwanted properties because this.files is a null prototype object - for (filename in this.files) { - 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... - } - } - /* jshint ignore:end */ - }, - - /** - * 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 preferred 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 occurrence of a zip signature (4 bytes). - * @param {string} sig the signature to find. - * @return {number} the index of the last occurrence, -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 information 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 information 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 + 4 < end) { - extraFieldId = reader.readInt(2); - extraFieldLength = reader.readInt(2); - extraFieldValue = reader.readData(extraFieldLength); - - this.extraFields[extraFieldId] = { - id: extraFieldId, - length: extraFieldLength, - value: extraFieldValue - }; - } - - reader.setIndex(end); - }, - /** - * 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 - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs
-

Class PGS_CirclePacking

-
-
- -
-
    -
  • -
    -
    public final class PGS_CirclePacking
-extends Object
    -
    Circle packings of shapes, subject to varying constraints and patterns of - tangencies. -

    - Each method produces a circle packing with different characteristics using a - different technique; for this reason input arguments vary across the methods. -

    - The output of each method is a list of PVectors, each representing one - circle: (.x, .y) represent the center point and .z represents radius. -

    - Where applicable, packings will include circles that overlap with the shape, - rather than only including those circles whose center point lies inside the - shape.

    -
    -
    Since:
    -
    1.1.0
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Summary

      - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
      All Methods Static Methods Concrete Methods 
      Modifier and TypeMethodDescription
      static List<processing.core.PVector>frontChainPack​(processing.core.PShape shape, - double radiusMin, - double radiusMax) -
      Generates a random circle packing of tangental circles with varying radii - that overlap the given shape.
      -
      static List<processing.core.PVector>hexLatticePack​(processing.core.PShape shape, - double diameter) -
      Generates a tiled circle packing consisting of equal-sized circles arranged - in a hexagonal lattice bounded by the input shape.
      -
      static List<processing.core.PVector>maximumInscribedPack​(processing.core.PShape shape, - int n, - double tolerance) -
      Generates a circle packing consisting of the N largest maximum inscribed - circles, starting with the largest circle (the shape's global maximum - inscribed circle).
      -
      static List<processing.core.PVector>repulsionPack​(processing.core.PShape shape, - double radiusMin, - double radiusMax, - long seed) -
      Generates a random circle packing of circles with varying radii that overlap - the given shape.
      -
      static List<processing.core.PVector>repulsionPack​(processing.core.PShape shape, - List<processing.core.PVector> circles) -
      Generates a circle packing of a shape using a given collection of - (overlapping) circles.
      -
      static List<processing.core.PVector>squareLatticePack​(processing.core.PShape shape, - double diameter) -
      Generates a tiled circle packing consisting of equal-sized circles arranged - in a square lattice (or grid) bounded by the input shape.
      -
      static List<processing.core.PVector>stochasticPack​(processing.core.PShape shape, - int points, - double minRadius, - boolean triangulatePoints) -
      Generates a random circle packing of the input shape by generating random - points one-by-one and calculating the maximum radius a circle at each point - can have (such that it's tangent to its nearest circle or a shape vertex).
      -
      static List<processing.core.PVector>tangencyPack​(org.tinfour.common.IIncrementalTin triangulation, - double boundaryRadii) -
      Generates a circle packing having a pattern of tangencies specified by a - triangulation.
      -
      static List<processing.core.PVector>tangencyPack​(org.tinfour.common.IIncrementalTin triangulation, - double[] boundaryRadii) -
      Generates a circle packing having a pattern of tangencies specified by a - triangulation.
      -
      static List<processing.core.PVector>trinscribedPack​(processing.core.PShape shape, - int points, - int refinements) -
      Generates a circle packing of the input shape, using the inscribed circles - (or incircles) of triangles from a triangulation of the shape.
      -
      - -
      • -
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        trinscribedPack

        -
        public static List<processing.core.PVector> trinscribedPack​(processing.core.PShape shape,
-                                                            int points,
-                                                            int refinements)
        -
        Generates a circle packing of the input shape, using the inscribed circles - (or incircles) of triangles from a triangulation of the shape. -

        - Circles in this packing do not overlap and are contained entirely within the - shape. However, not every circle is necessarily tangent to others.

        -
        -
        Parameters:
        -
        shape - the shape from which to generate a circle packing
        -
        points - the number of random points to insert into the - triangulation as steiner points. Larger values lead to - more circles that are generally smaller.
        -
        refinements - number of times to refine the underlying triangulation. - Larger values lead to more circles that are more regularly - spaced and sized. 0...3 is a suitable range for this - parameter
        -
        Returns:
        -
        A list of PVectors, each representing one circle: (.x, .y) represent - the center point and .z represents radius.
        -
        -
        • -
      - - - -
        -
      • -

        stochasticPack

        -
        public static List<processing.core.PVector> stochasticPack​(processing.core.PShape shape,
-                                                           int points,
-                                                           double minRadius,
-                                                           boolean triangulatePoints)
        -
        Generates a random circle packing of the input shape by generating random - points one-by-one and calculating the maximum radius a circle at each point - can have (such that it's tangent to its nearest circle or a shape vertex). -

        - Notably, the points argument defines the number of random point - attempts (or circle attempts), and not the number of circles in the final - packing output, since a point is rejected if it lies in an existing circle or - whose nearest circle is less than minRadius distance away. In other words, - points defines the maximum number of circles the packing can have; in - practice, the packing will contain somewhat fewer circles. -

        - Circles in this packing do not overlap and are contained entirely within the - shape. However, not every circle is necessarily tangent to other circles (in - which case, such a circle will be tangent to a shape vertex).

        -
        -
        Parameters:
        -
        shape - the shape from which to generate a circle packing
        -
        points - number of random points to generate (this is not the - number of circles in the packing).
        -
        minRadius - filter (however not simply applied at the end, so - affects how the packing operates during packing)
        -
        triangulatePoints - when true, triangulates an initial random point set - and uses triangle centroids as the random point set - instead; this results in a packing that covers the - shape more evenly (particularly when points is - small), which is sometimes desirable
        -
        Returns:
        -
        A list of PVectors, each representing one circle: (.x, .y) represent - the center point and .z represents radius.
        -
        -
        • -
      - - - -
        -
      • -

        frontChainPack

        -
        public static List<processing.core.PVector> frontChainPack​(processing.core.PShape shape,
-                                                           double radiusMin,
-                                                           double radiusMax)
        -
        Generates a random circle packing of tangental circles with varying radii - that overlap the given shape. -

        - The method name describes the name of the packing algorithm, rather than any - particular characteristic of the circle packing. -

        - You may set radiusMin = radiusMax for a packing of equal-sized circles using - this approach.

        -
        -
        Parameters:
        -
        shape - the shape from which to generate a circle packing
        -
        radiusMin - minimum radius of circles in the packing
        -
        radiusMax - maximum radius of circles in the packing
        -
        Returns:
        -
        A list of PVectors, each representing one circle: (.x, .y) represent - the center point and .z represents radius.
        -
        -
        • -
      - - - -
        -
      • -

        maximumInscribedPack

        -
        public static List<processing.core.PVector> maximumInscribedPack​(processing.core.PShape shape,
-                                                                 int n,
-                                                                 double tolerance)
        -
        Generates a circle packing consisting of the N largest maximum inscribed - circles, starting with the largest circle (the shape's global maximum - inscribed circle).
        -
        -
        Parameters:
        -
        shape - the shape from which to generate a circle packing
        -
        n - number of maximum inscribed circles to return, starting with - the largest inscribed circle
        -
        tolerance - inscribed circle tolerance. A value of a 1 is recommended - for a good result. Larger values decrease precision and may - reduce how "maximum" each circle is (may also lead to a - modest speedup)
        -
        Returns:
        -
        A list of PVectors, each representing one circle: (.x, .y) represent - the center point and .z represents radius.
        -
        -
        • -
      - - - -
        -
      • -

        tangencyPack

        -
        public static List<processing.core.PVector> tangencyPack​(org.tinfour.common.IIncrementalTin triangulation,
-                                                         double boundaryRadii)
        -
        Generates a circle packing having a pattern of tangencies specified by a - triangulation. - -

        - This is an implementation of 'A circle packing algorithm' by Charles R. - Collins & Kenneth Stephenson.

        -
        -
        Parameters:
        -
        triangulation - represents the pattern of tangencies; vertices connected - by an edge inthe triangulation represent tangent circles - in thepacking
        -
        boundaryRadii - radius of every circle associated with the - boundary/perimeter vertices of the triangulation
        -
        Returns:
        -
        A list of PVectors, each representing one circle: (.x, .y) represent - the center point and .z represents radius.
        -
        -
        • -
      - - - -
        -
      • -

        tangencyPack

        -
        public static List<processing.core.PVector> tangencyPack​(org.tinfour.common.IIncrementalTin triangulation,
-                                                         double[] boundaryRadii)
        -
        Generates a circle packing having a pattern of tangencies specified by a - triangulation. -

        - This is an implementation of 'A circle packing algorithm' by Charles R. - Collins & Kenneth Stephenson.

        -
        -
        Parameters:
        -
        triangulation - represents the pattern of tangencies; vertices connected - by an edge inthe triangulation represent tangent circles - in thepacking
        -
        boundaryRadii - list of radii of circles associated with the - boundary/perimeter vertices of the triangulation. The - list may have fewer radii than the number of - boundaryvertices; in this case, boundary radii will wrap - aroundthe list
        -
        Returns:
        -
        A list of PVectors, each representing one circle: (.x, .y) represent - the center point and .z represents radius. The packing is centered on - (0, 0) by default.
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        repulsionPack

        -
        public static List<processing.core.PVector> repulsionPack​(processing.core.PShape shape,
-                                                          double radiusMin,
-                                                          double radiusMax,
-                                                          long seed)
        -
        Generates a random circle packing of circles with varying radii that overlap - the given shape. -

        - Repulsion-packing involves iterative pair-repulsion, in which overlapping - circles move away from each other until there is no overlap. A packing is - first computed for the envelope of the shape, and then any circles which do - not overlap with the shape are discarded.

        -
        -
        Parameters:
        -
        shape - the shape from which to generate a circle packing
        -
        radiusMin - minimum radius of circles in the packing. the radii - parameters can be the same.
        -
        radiusMax - maximum radius of circles in the packing. the radii - parameters can be the same.
        -
        seed - for initial circle positions and radii
        -
        Returns:
        -
        A list of PVectors, each representing one circle: (.x, .y) represent - the center point and .z represents radius.
        -
        Since:
        -
        1.3.0
        -
        See Also:
        -
        repulsionPack(PShape, List)
        -
        -
        • -
      - - - -
        -
      • -

        repulsionPack

        -
        public static List<processing.core.PVector> repulsionPack​(processing.core.PShape shape,
-                                                          List<processing.core.PVector> circles)
        -
        Generates a circle packing of a shape using a given collection of - (overlapping) circles. -

        - Circles in the input should be already bounded by the shape (since repulsion - does not push lonely circles towards the shape, but only repulses overlapping - circles); the intended input is one having circles with lots of overlap - (perhaps seeded within a small rectangle), where they may be repulsed from - each other to fill the shape. -

        - Repulsion-packing involves iterative pair-repulsion, in which overlapping - circles move away from each other until there is no overlap. A packing is - first computed for the envelope of the shape, and then any circles which do - not overlap with the shape are discarded.

        -
        -
        Parameters:
        -
        shape - the shape from which to generate a circle packing
        -
        circles - the collection of circles to pack the shape with, specified as - PVectors, where .z is the radius (>=1) for each circle
        -
        Returns:
        -
        A list of PVectors, each representing one circle: (.x, .y) represent - the center point and .z represents radius.
        -
        Since:
        -
        1.3.0
        -
        See Also:
        -
        repulsionPack(PShape, double, double, long)
        -
        -
        • -
      - - - -
        -
      • -

        squareLatticePack

        -
        public static List<processing.core.PVector> squareLatticePack​(processing.core.PShape shape,
-                                                              double diameter)
        -
        Generates a tiled circle packing consisting of equal-sized circles arranged - in a square lattice (or grid) bounded by the input shape. -

        - Circles are included in the packing if they overlap with the given shape.

        -
        -
        Parameters:
        -
        shape - the shape from which to generate a circle packing
        -
        diameter - diameter of every circle in the packing
        -
        Returns:
        -
        A list of PVectors, each representing one circle: (.x, .y) represent - the center point and .z represents radius.
        -
        See Also:
        -
        hexLatticePack(PShape, double)
        -
        -
        • -
      - - - -
        -
      • -

        hexLatticePack

        -
        public static List<processing.core.PVector> hexLatticePack​(processing.core.PShape shape,
-                                                           double diameter)
        -
        Generates a tiled circle packing consisting of equal-sized circles arranged - in a hexagonal lattice bounded by the input shape. -

        - Circles are included in the packing if they overlap with the given shape.

        -
        -
        Parameters:
        -
        shape - the shape from which to generate a circle packing
        -
        diameter - diameter of every circle in the packing
        -
        Returns:
        -
        A list of PVectors, each representing one circle: (.x, .y) represent - the center point and .z represents radius.
        -
        See Also:
        -
        squareLatticePack(PShape, double)
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/PGS_Coloring.ColoringAlgorithm.html b/micycle/pgs/PGS_Coloring.ColoringAlgorithm.html deleted file mode 100644 index 0cfa9c94..00000000 --- a/micycle/pgs/PGS_Coloring.ColoringAlgorithm.html +++ /dev/null @@ -1,486 +0,0 @@ - - - - - -PGS_Coloring.ColoringAlgorithm (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs
-

Enum PGS_Coloring.ColoringAlgorithm

-
-
- -
- -
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Enum Constant Detail

      - - - - - - - -
        -
      • -

        LARGEST_DEGREE_FIRST

        -
        public static final PGS_Coloring.ColoringAlgorithm LARGEST_DEGREE_FIRST
        -
        The largest degree first greedy coloring algorithm. - -

        - This algorithm orders the vertices in decreasing order of degree, the idea - being that the large degree vertices can be colored more easily.

        -
        • -
      - - - -
        -
      • -

        SMALLEST_DEGREE_LAST

        -
        public static final PGS_Coloring.ColoringAlgorithm SMALLEST_DEGREE_LAST
        -
        The smallest degree last greedy coloring algorithm. - - This is the greedy coloring algorithm with the smallest-last ordering of the - vertices.
        -
        • -
      - - - -
        -
      • -

        DSATUR

        -
        public static final PGS_Coloring.ColoringAlgorithm DSATUR
        -
        DSATUR (saturation degree ordering) is a variant on Largest Degree Ordering - where the vertices are ordered in decreasing order by "saturation degree", - defined as the number of distinct colors in the vertex neighborhood.
        -
        • -
      - - - - - - - - - - - -
        -
      • -

        GENETIC

        -
        public static final PGS_Coloring.ColoringAlgorithm GENETIC
        -
        Finds a coloring using a genetic algorithm. Unlike all other algorithms this - specifically targets a chromaticity of 4 (falls back to 5 if no solution is - found).
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        values

        -
        public static PGS_Coloring.ColoringAlgorithm[] values()
        -
        Returns an array containing the constants of this enum type, in -the order they are declared. This method may be used to iterate -over the constants as follows: -
        -for (PGS_Coloring.ColoringAlgorithm c : PGS_Coloring.ColoringAlgorithm.values())
-    System.out.println(c);
-
        -
        -
        Returns:
        -
        an array containing the constants of this enum type, in the order they are declared
        -
        -
        • -
      - - - -
        -
      • -

        valueOf

        -
        public static PGS_Coloring.ColoringAlgorithm valueOf​(String name)
        -
        Returns the enum constant of this type with the specified name. -The string must match exactly an identifier used to declare an -enum constant in this type. (Extraneous whitespace characters are -not permitted.)
        -
        -
        Parameters:
        -
        name - the name of the enum constant to be returned.
        -
        Returns:
        -
        the enum constant with the specified name
        -
        Throws:
        -
        IllegalArgumentException - if this enum type has no constant with the specified name
        -
        NullPointerException - if the argument is null
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- - - - diff --git a/micycle/pgs/PGS_Coloring.html b/micycle/pgs/PGS_Coloring.html deleted file mode 100644 index d4a41248..00000000 --- a/micycle/pgs/PGS_Coloring.html +++ /dev/null @@ -1,525 +0,0 @@ - - - - - -PGS_Coloring (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs
-

Class PGS_Coloring

-
-
- -
-
    -
  • -
    -
    public final class PGS_Coloring
-extends Object
    -
    Intelligently color meshes (or mesh-like shapes) such that no two adjacent - faces have the same color, while minimising the number of colors used. -

    - The methods in this class distinguish between mesh-like shapes (conforming - meshes) and non-mesh-like shapes (non-conforming meshes). This - distinction is necessary because shapes that represent non-conforming meshes - require a single step of pre-processing ("noding") to first split edges - before coloring. The difference is described below: - -

    - Conforming Meshes : Consists of adjacent cells that not only share - edges, but every pair of shared edges are identical (having the same - coordinates) (such as a triangulation).
    - Non-Conforming Meshes : Consists of adjacent cells that share edges - (i.e. edges may overlap) but adjacent edges do not necessarily have identical - start and end coordinates. -

    -
    -
    Since:
    -
    1.2.0
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Nested Class Summary

      - - - - - - - - - - - - -
      Nested Classes 
      Modifier and TypeClassDescription
      static class PGS_Coloring.ColoringAlgorithm -
      Specifies the algorithm/heuristic used by the underlying graph coloring process to find - a coloring for mesh faces.
      -
      -
      • -
    -
    - -
    - -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        colorMesh

        -
        public static Map<processing.core.PShape,​Integer> colorMesh​(processing.core.PShape meshShape,
-                                                                  PGS_Coloring.ColoringAlgorithm coloringAlgorithm)
        -
        Computes a coloring of the given mesh shape, returning a color class for each - mesh face.
        -
        -
        Parameters:
        -
        meshShape - a GROUP PShape, whose children constitute the faces - of a conforming mesh
        -
        coloringAlgorithm - coloring algorithm used to color the mesh
        -
        Returns:
        -
        a color-class map; a mapping of each mesh face (PShape) -> color - class (integer)
        -
        -
        • -
      - - - -
        -
      • -

        colorMesh

        -
        public static Map<processing.core.PShape,​Integer> colorMesh​(Collection<processing.core.PShape> shapes,
-                                                                  PGS_Coloring.ColoringAlgorithm coloringAlgorithm)
        -
        Computes a coloring of the given mesh shape, returning a color class for each - mesh face.
        -
        -
        Parameters:
        -
        shapes - a collection of shapes that constitute the faces of - a conforming mesh
        -
        coloringAlgorithm - coloring algorithm used to color the mesh
        -
        Returns:
        -
        a color-class map; a mapping of each mesh face (PShape) -> color - class (integer)
        -
        -
        • -
      - - - -
        -
      • -

        colorMesh

        -
        public static processing.core.PShape colorMesh​(processing.core.PShape shape,
-                                               PGS_Coloring.ColoringAlgorithm coloringAlgorithm,
-                                               int[] colorPalette)
        -
        Computes a coloring of the given mesh shape and colors its faces using the - colors provided. This method mutates the fill colour of the input shape.
        -
        -
        Parameters:
        -
        shape - a GROUP PShape, whose children constitute the faces - of a conforming mesh
        -
        coloringAlgorithm - coloring algorithm used to color the mesh
        -
        colorPalette - the (integer) colors with which to color the mesh
        -
        Returns:
        -
        the input shape (whose faces have now been colored)
        -
        -
        • -
      - - - -
        -
      • -

        colorMesh

        -
        public static processing.core.PShape colorMesh​(processing.core.PShape shape,
-                                               PGS_Coloring.ColoringAlgorithm coloringAlgorithm,
-                                               String[] colorPalette)
        -
        Computes a coloring of the given mesh shape and colors its faces using the - colors provided. This method mutates the fill colour of the input shape.
        -
        -
        Parameters:
        -
        shape - a GROUP PShape, whose children constitute the faces - of a conforming mesh
        -
        coloringAlgorithm - coloring algorithm used to color the mesh
        -
        colorPalette - the string colors (e.g. "#FFFFFF", or "cba5e8") with - which to color the mesh
        -
        Returns:
        -
        the input shape (whose faces have now been colored)
        -
        -
        • -
      - - - -
        -
      • -

        colorNonMesh

        -
        public static Map<processing.core.PShape,​Integer> colorNonMesh​(processing.core.PShape shape,
-                                                                     PGS_Coloring.ColoringAlgorithm coloringAlgorithm)
        -
        Computes a coloring of the given non-conforming mesh shape, returning a color - class for each face of the pre-processed (noded) mesh.
        -
        -
        Parameters:
        -
        shape - a GROUP PShape, whose children constitute the faces - of a non-conforming mesh
        -
        coloringAlgorithm - coloring algorithm used to color the mesh
        -
        Returns:
        -
        a color-class map; a mapping of each noded mesh face (PShape) -> - color class (integer)
        -
        -
        • -
      - - - -
        -
      • -

        colorNonMesh

        -
        public static processing.core.PShape colorNonMesh​(processing.core.PShape shape,
-                                                  PGS_Coloring.ColoringAlgorithm coloringAlgorithm,
-                                                  int[] colorPalette)
        -
        Computes a coloring of the given non-conforming mesh shape and colors the - faces of its noded representation using the colors provided.
        -
        -
        Parameters:
        -
        shape - a GROUP PShape, whose children constitute the faces - of a non-conforming mesh
        -
        coloringAlgorithm - coloring algorithm used to color the mesh
        -
        colorPalette - the (integer) colors with which to color the mesh
        -
        Returns:
        -
        noded representation of the input shape (whose faces have now been - colored)
        -
        -
        • -
      - - - -
        -
      • -

        colorNonMesh

        -
        public static processing.core.PShape colorNonMesh​(processing.core.PShape shape,
-                                                  PGS_Coloring.ColoringAlgorithm coloringAlgorithm,
-                                                  String[] colorPalette)
        -
        Computes a coloring of the given non-conforming mesh shape and colors the - faces of its noded representation using the colors provided.
        -
        -
        Parameters:
        -
        shape - a GROUP PShape, whose children constitute the faces - of a non-conforming mesh
        -
        coloringAlgorithm - coloring algorithm used to color the mesh
        -
        colorPalette - the string colors (e.g. "#FFFFFF", or "cba5e8") with - which to color the mesh
        -
        Returns:
        -
        noded representation of the input shape (whose faces have now been - colored)
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/PGS_Construction.SierpinskiTriCurveType.html b/micycle/pgs/PGS_Construction.SierpinskiTriCurveType.html deleted file mode 100644 index 86e8bb5f..00000000 --- a/micycle/pgs/PGS_Construction.SierpinskiTriCurveType.html +++ /dev/null @@ -1,410 +0,0 @@ - - - - - -PGS_Construction.SierpinskiTriCurveType (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs
-

Enum PGS_Construction.SierpinskiTriCurveType

-
-
- -
- -
-
- -
-
- -
-
-
- - - - diff --git a/micycle/pgs/PGS_Construction.html b/micycle/pgs/PGS_Construction.html deleted file mode 100644 index 0038cf2c..00000000 --- a/micycle/pgs/PGS_Construction.html +++ /dev/null @@ -1,929 +0,0 @@ - - - - - -PGS_Construction (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs
-

Class PGS_Construction

-
-
- -
-
    -
  • -
    -
    public class PGS_Construction
-extends Object
    -
    Construct uncommon/interesting 2D geometries.
    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
-
    -
  • - -
    - -
    - -
    -
      -
    • - - -

      Method Summary

      - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
      All Methods Static Methods Concrete Methods 
      Modifier and TypeMethodDescription
      static processing.core.PShapecreateArc​(double centerX, - double centerY, - double width, - double height, - double orientation, - double angle) -
      Creates an elliptical arc polygon (a slice of a circle).
      -
      static processing.core.PShapecreateBlobbie​(double centerX, - double centerY, - double maxWidth, - double a, - double b, - double c, - double d) -
      Creates a "blob"-like shape.
      -
      static processing.core.PShapecreateFermatSpiral​(double centerX, - double centerY, - double coils, - double outerRadius) -
      Creates Fermat's spiral, a parabolic spiral which is symmetrical about the - origin.
      -
      static processing.core.PShapecreateHeart​(double centerX, - double centerY, - double width) -
      Creates a heart shape.
      -
      static processing.core.PShapecreateHilbertCurve​(double width, - double height, - int order) -
      Creates a Hilbert Curve shape, a type of plane-filling curve.
      -
      static processing.core.PShapecreateKochSnowflake​(double width, - double height, - int order) -
      Creates a Koch Snowflake shape, a fractal curve.
      -
      static processing.core.PShapecreateLinearSpiral​(double centerX, - double centerY, - double coils, - double outerRadius) -
      Creates an linear/archimedean spiral shape, where the distance between any 2 - successive windings is constant.
      -
      static processing.core.PShapecreateRandomPolygon​(int n, - double maxWidth, - double maxHeight) -
      Generates a random simple convex polygon (n-gon).
      -
      static processing.core.PShapecreateRandomPolygonExact​(int n, - double width, - double height) -
      Generates a random simple convex polygon (n-gon), where the output's bounding - box has the dimensions of those specified.
      -
      static processing.core.PShapecreateRectangularSpiral​(float x, - float y, - float width, - float height, - float spacing) -
      Creates a rectangular-shaped spiral shape.
      -
      static processing.core.PShapecreateRing​(double centerX, - double centerY, - double outerRadius, - double innerRadius) -
      Creates a joined ring (a "donut") shape.
      -
      static processing.core.PShapecreateRing​(double centerX, - double centerY, - double outerRadius, - double innerRadius, - double orientation, - double angle) -
      Creates an (un)joined ring shape.
      -
      static processing.core.PShapecreateSierpinskiCarpet​(double width, - double height, - int order) -
      Creates a Sierpiński Carpet shape, a type of plane fractal.
      -
      static processing.core.PShapecreateSierpinskiCurve​(double centerX, - double centerY, - double width, - int curveOrder) -
      Creates a closed Sierpiński curve (a recursive space-filling curve), having a - user-defined degree/order.
      -
      static processing.core.PShapecreateSierpinskiTriCurve​(PGS_Construction.SierpinskiTriCurveType type, - double width, - int order) -
      Creates one of a family of trifurcating Sierpinski curves.
      -
      static processing.core.PShapecreateStar​(double centerX, - double centerY, - int numRays, - double innerRadius, - double outerRadius, - double roundness) -
      Creates a star shape, having a specified number of rays.
      -
      static processing.core.PShapecreateSupercircle​(double centerX, - double centerY, - double width, - double height, - double power) -
      Creates a supercircle shape.
      -
      static processing.core.PShapecreateSuperShape​(double centerX, - double centerY, - double radius, - double m, - double n1, - double n2, - double n3) -
      Creates a supershape PShape.
      -
      - -
      • -
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        createRandomPolygon

        -
        public static processing.core.PShape createRandomPolygon​(int n,
-                                                         double maxWidth,
-                                                         double maxHeight)
        -
        Generates a random simple convex polygon (n-gon).
        -
        -
        Parameters:
        -
        n - number of polygon vertices/sides
        -
        maxWidth - maximum width of generated random polygon
        -
        maxHeight - maximum height of generated random polygon
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        createRandomPolygonExact

        -
        public static processing.core.PShape createRandomPolygonExact​(int n,
-                                                              double width,
-                                                              double height)
        -
        Generates a random simple convex polygon (n-gon), where the output's bounding - box has the dimensions of those specified.
        -
        -
        Parameters:
        -
        n - number of polygon vertices/sides
        -
        width - width of generated random polygon
        -
        height - height of generated random polygon
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        createSupercircle

        -
        public static processing.core.PShape createSupercircle​(double centerX,
-                                                       double centerY,
-                                                       double width,
-                                                       double height,
-                                                       double power)
        -
        Creates a supercircle shape.
        -
        -
        Parameters:
        -
        centerX - centre point X
        -
        centerY - centre point Y
        -
        width -
        -
        height -
        -
        power - circularity of super circle. Values less than 1 create - star-like shapes; power=1 is a square;
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        createSuperShape

        -
        public static processing.core.PShape createSuperShape​(double centerX,
-                                                      double centerY,
-                                                      double radius,
-                                                      double m,
-                                                      double n1,
-                                                      double n2,
-                                                      double n3)
        -
        Creates a supershape PShape. The parameters feed into the superformula, which - is a simple 2D analytical expression allowing to draw a wide variety of - geometric and natural shapes (starfish, petals, snowflakes) by choosing - suitable values relevant to few parameters. -
          -
        • As the n's are kept equal but reduced the form becomes increasingly - pinched.
          • -
        • If n1 is slightly larger than n2 and n3 then bloated forms result.
          • -
        • Polygonal shapes are achieved with very large values of n1 and large but - equal values for n2 and n3.
          • -
        • Asymmetric forms can be created by using different values for the - n's.
          • -
        • Smooth starfish shapes result from smaller values of n1 than the n2 and - n3.
          • -
        -
        -
        Parameters:
        -
        centerX - centre point X
        -
        centerY - centre point Y
        -
        radius - maximum radius
        -
        m - specifies the rotational symmetry of the shape (3 = 3 sided; 4 - = 4 sided)
        -
        n1 - supershape parameter 1
        -
        n2 - supershape parameter 2
        -
        n3 - supershape parameter 3
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        createArc

        -
        public static processing.core.PShape createArc​(double centerX,
-                                               double centerY,
-                                               double width,
-                                               double height,
-                                               double orientation,
-                                               double angle)
        -
        Creates an elliptical arc polygon (a slice of a circle). The polygon is - formed from the specified arc of an ellipse and the two radii connecting the - endpoints to the centre of the ellipse.
        -
        -
        Parameters:
        -
        centerX - centre point X
        -
        centerY - centre point Y
        -
        width -
        -
        height -
        -
        orientation - start angle/orientation in radians (where 0 is 12 o'clock)
        -
        angle - size of the arc angle in radians
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        createStar

        -
        public static processing.core.PShape createStar​(double centerX,
-                                                double centerY,
-                                                int numRays,
-                                                double innerRadius,
-                                                double outerRadius,
-                                                double roundness)
        -
        Creates a star shape, having a specified number of rays.
        -
        -
        Parameters:
        -
        centerX - The x coordinate of the center
        -
        centerY - The y coordinate of the center
        -
        numRays - The number of rays the star has
        -
        innerRadius - The inner radius of the star
        -
        outerRadius - The outer radius of the star
        -
        roundness - A roundness value between 0.0 and 1.0, for the inner and - outer corners of the star.
        -
        Returns:
        -
        The star shape
        -
        -
        • -
      - - - -
        -
      • -

        createBlobbie

        -
        public static processing.core.PShape createBlobbie​(double centerX,
-                                                   double centerY,
-                                                   double maxWidth,
-                                                   double a,
-                                                   double b,
-                                                   double c,
-                                                   double d)
        -
        Creates a "blob"-like shape. -

        - In order for the shape to not self intersect a + b should be less than 1.

        -
        -
        Parameters:
        -
        centerX - The x coordinate of the center
        -
        centerY - The y coordinate of the center
        -
        maxWidth -
        -
        a - blob parameter. a + b should be less than 1
        -
        b - blob parameter.a + b should be less than 1
        -
        c - blob parameter
        -
        d - blob parameter
        -
        Returns:
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        createHeart

        -
        public static processing.core.PShape createHeart​(double centerX,
-                                                 double centerY,
-                                                 double width)
        -
        Creates a heart shape.
        -
        -
        Parameters:
        -
        centerX - The x coordinate of the center of the heart
        -
        centerY - The y coordinate of the center of the heart
        -
        width - Maximum width of the widest part of the heart
        -
        Returns:
        -
        Since:
        -
        1.1.0
        -
        -
        • -
      - - - -
        -
      • -

        createRing

        -
        public static processing.core.PShape createRing​(double centerX,
-                                                double centerY,
-                                                double outerRadius,
-                                                double innerRadius)
        -
        Creates a joined ring (a "donut") shape.
        -
        -
        Parameters:
        -
        centerX - the x coordinate of the center
        -
        centerY - the y coordinate of the center
        -
        outerRadius - radius of ring exterior
        -
        innerRadius - radius of ring hole
        -
        Returns:
        -
        the ring shape
        -
        Since:
        -
        1.1.3
        -
        -
        • -
      - - - -
        -
      • -

        createRing

        -
        public static processing.core.PShape createRing​(double centerX,
-                                                double centerY,
-                                                double outerRadius,
-                                                double innerRadius,
-                                                double orientation,
-                                                double angle)
        -
        Creates an (un)joined ring shape.
        -
        -
        Parameters:
        -
        centerX - the x coordinate of the center
        -
        centerY - the y coordinate of the center
        -
        outerRadius - radius of ring exterior
        -
        innerRadius - radius of ring hole
        -
        orientation - start angle/orientation in radians (where 0 is 12 o'clock)
        -
        angle - size of the ring arc angle in radians
        -
        Returns:
        -
        the ring shape
        -
        Since:
        -
        1.1.3
        -
        -
        • -
      - - - -
        -
      • -

        createLinearSpiral

        -
        public static processing.core.PShape createLinearSpiral​(double centerX,
-                                                        double centerY,
-                                                        double coils,
-                                                        double outerRadius)
        -
        Creates an linear/archimedean spiral shape, where the distance between any 2 - successive windings is constant.
        -
        -
        Parameters:
        -
        centerX - the x coordinate of the spiral center point / origin
        -
        centerY - the y coordinate of the spiral center point / origin
        -
        coils - number of coils/rotations in the spiral
        -
        outerRadius - the outer-most radius of the spiral / final coil
        -
        Returns:
        -
        a stroked PATH PShape
        -
        Since:
        -
        1.2.0
        -
        -
        • -
      - - - -
        -
      • -

        createFermatSpiral

        -
        public static processing.core.PShape createFermatSpiral​(double centerX,
-                                                        double centerY,
-                                                        double coils,
-                                                        double outerRadius)
        -
        Creates Fermat's spiral, a parabolic spiral which is symmetrical about the - origin.
        -
        -
        Parameters:
        -
        centerX - the x coordinate of the spiral center point / origin
        -
        centerY - the y coordinate of the spiral center point / origin
        -
        coils - number of coils/rotations in the spiral
        -
        outerRadius - the outer-most radius of the spiral / final coil
        -
        Returns:
        -
        a stroked PATH PShape
        -
        Since:
        -
        1.2.0
        -
        -
        • -
      - - - -
        -
      • -

        createRectangularSpiral

        -
        public static processing.core.PShape createRectangularSpiral​(float x,
-                                                             float y,
-                                                             float width,
-                                                             float height,
-                                                             float spacing)
        -
        Creates a rectangular-shaped spiral shape.
        -
        -
        Parameters:
        -
        x - x position of the top-left of spiral
        -
        y - y position of the top-left of spiral
        -
        width - width of outer-most coil
        -
        height - height of outer-most coil
        -
        spacing - the distance between successive coils
        -
        Returns:
        -
        a stroked PATH PShape
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        createSierpinskiCurve

        -
        public static processing.core.PShape createSierpinskiCurve​(double centerX,
-                                                           double centerY,
-                                                           double width,
-                                                           int curveOrder)
        -
        Creates a closed Sierpiński curve (a recursive space-filling curve), having a - user-defined degree/order.
        -
        -
        Parameters:
        -
        centerX - the x coordinate of the curve center point
        -
        centerY - the y coordinate of the curve center point
        -
        width - length (the maximum width and height) of the curve (the - curve will approach this width as the curve order is - increased and more space is filled)
        -
        curveOrder - the order of the curve (the number of recursive - subdivisions). Must be 1 or greater.
        -
        Returns:
        -
        a Sierpiński curve of the specified order
        -
        Since:
        -
        1.2.0
        -
        -
        • -
      - - - -
        -
      • -

        createHilbertCurve

        -
        public static processing.core.PShape createHilbertCurve​(double width,
-                                                        double height,
-                                                        int order)
        -
        Creates a Hilbert Curve shape, a type of plane-filling curve.
        -
        -
        Parameters:
        -
        width - pixel width of the curve
        -
        height - pixel height of the curve
        -
        order - order of the hilbert curve. should be at least 0
        -
        Returns:
        -
        a stroked PATH PShape, anchored at (0, 0)
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        createSierpinskiCarpet

        -
        public static processing.core.PShape createSierpinskiCarpet​(double width,
-                                                            double height,
-                                                            int order)
        -
        Creates a Sierpiński Carpet shape, a type of plane fractal.
        -
        -
        Parameters:
        -
        width - pixel width of the curve
        -
        height - pixel height of the curve
        -
        order - the number of recursive subdivisions (at least 0, probably no - more than 5)
        -
        Returns:
        -
        carpet shape, anchored at (0, 0)
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        createKochSnowflake

        -
        public static processing.core.PShape createKochSnowflake​(double width,
-                                                         double height,
-                                                         int order)
        -
        Creates a Koch Snowflake shape, a fractal curve.
        -
        -
        Parameters:
        -
        width - pixel width of the curve's envelope
        -
        height - pixel width of the curve's envelope
        -
        order - the number of recursive subdivisions (at least 0)
        -
        Returns:
        -
        snowflake shape, whose envelope is anchored at (0, 0)
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        createSierpinskiTriCurve

        -
        public static processing.core.PShape createSierpinskiTriCurve​(PGS_Construction.SierpinskiTriCurveType type,
-                                                              double width,
-                                                              int order)
        -
        Creates one of a family of trifurcating Sierpinski curves.
        -
        -
        Parameters:
        -
        type - the type of tri-curve: {TRI, TETRA, PENTA, DECA}
        -
        width - pixel width of the curve's envelope
        -
        order - the number of recursive subdivisions (at least 1)
        -
        Returns:
        -
        curve shape, anchored at (0, 0)
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/PGS_Contour.OffsetStyle.html b/micycle/pgs/PGS_Contour.OffsetStyle.html deleted file mode 100644 index 8805d8f1..00000000 --- a/micycle/pgs/PGS_Contour.OffsetStyle.html +++ /dev/null @@ -1,398 +0,0 @@ - - - - - -PGS_Contour.OffsetStyle (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs
-

Enum PGS_Contour.OffsetStyle

-
-
- -
- -
-
- -
-
-
    -
  • - -
    - -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        values

        -
        public static PGS_Contour.OffsetStyle[] values()
        -
        Returns an array containing the constants of this enum type, in -the order they are declared. This method may be used to iterate -over the constants as follows: -
        -for (PGS_Contour.OffsetStyle c : PGS_Contour.OffsetStyle.values())
-    System.out.println(c);
-
        -
        -
        Returns:
        -
        an array containing the constants of this enum type, in the order they are declared
        -
        -
        • -
      - - - -
        -
      • -

        valueOf

        -
        public static PGS_Contour.OffsetStyle valueOf​(String name)
        -
        Returns the enum constant of this type with the specified name. -The string must match exactly an identifier used to declare an -enum constant in this type. (Extraneous whitespace characters are -not permitted.)
        -
        -
        Parameters:
        -
        name - the name of the enum constant to be returned.
        -
        Returns:
        -
        the enum constant with the specified name
        -
        Throws:
        -
        IllegalArgumentException - if this enum type has no constant with the specified name
        -
        NullPointerException - if the argument is null
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- - - - diff --git a/micycle/pgs/PGS_Contour.html b/micycle/pgs/PGS_Contour.html deleted file mode 100644 index 04d37f7f..00000000 --- a/micycle/pgs/PGS_Contour.html +++ /dev/null @@ -1,656 +0,0 @@ - - - - - -PGS_Contour (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs
-

Class PGS_Contour

-
-
- -
-
    -
  • -
    -
    public final class PGS_Contour
-extends Object
    -
    Methods for producing different kinds of shape contours. -

    - A 2D contour is a closed sequence (a cycle) of 3 or more connected 2D - oriented straight line segments called contour edges. The endpoints of the - contour edges are called vertices. Each contour edge shares its endpoints - with at least two other contour edges.

    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Nested Class Summary

      - - - - - - - - - - - - -
      Nested Classes 
      Modifier and TypeClassDescription
      static class PGS_Contour.OffsetStyle -
      Specifies the join style for offset curves.
      -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Summary

      - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
      All Methods Static Methods Concrete Methods 
      Modifier and TypeMethodDescription
      static processing.core.PShapechordalAxis​(processing.core.PShape shape) -
      Computes the chordal axis of a shape, which provides a characterization of - the skeleton of a shape.
      -
      static processing.core.PShapedistanceField​(processing.core.PShape shape, - double spacing) -
      Generates a contour map based on a distance field of a shape.
      -
      static Map<processing.core.PShape,​Float>isolines​(Collection<processing.core.PVector> points, - double intervalValueSpacing, - double isolineMin, - double isolineMax) -
      Generates a topographic-like isoline contour map from the given points.
      -
      static Map<processing.core.PShape,​Float>isolines​(Collection<processing.core.PVector> points, - double intervalValueSpacing, - double isolineMin, - double isolineMax, - int smoothing) -
      Generates a topographic-like isoline contour map from the given points.
      -
      static processing.core.PShapeisolines​(processing.core.PShape shape, - processing.core.PVector highPoint, - double intervalSpacing) -
      Generates a topographic-like isoline contour map from the shape's vertices.
      -
      static processing.core.PShapemedialAxis​(processing.core.PShape shape, - double axialThreshold, - double distanceThreshold, - double areaThreshold) -
      Computes the medial axis of the given shape, which provides a - characterization of the skeleton of a shape.
      -
      static processing.core.PShapeoffsetCurvesInward​(processing.core.PShape shape, - PGS_Contour.OffsetStyle style, - double spacing) -
      Produces inwards offset curves from the shape.
      -
      static processing.core.PShapeoffsetCurvesInward​(processing.core.PShape shape, - PGS_Contour.OffsetStyle style, - double spacing, - int curves) -
      Produces N inwards offset curves from the shape.
      -
      static processing.core.PShapeoffsetCurvesOutward​(processing.core.PShape shape, - PGS_Contour.OffsetStyle style, - double spacing, - int curves) -
      Produces N offset curves that emanate outwards from the shape.
      -
      static processing.core.PShapestraightSkeleton​(processing.core.PShape shape) -
      Computes the straight skeleton for a shape.
      -
      - -
      • -
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        medialAxis

        -
        public static processing.core.PShape medialAxis​(processing.core.PShape shape,
-                                                double axialThreshold,
-                                                double distanceThreshold,
-                                                double areaThreshold)
        -
        Computes the medial axis of the given shape, which provides a - characterization of the skeleton of a shape. -

        - The 3 parameters can be used to prune the medial axis according to different - features (at the same time).

        -
        -
        Parameters:
        -
        shape -
        -
        axialThreshold - Prune edges based on their axial gradient. The axial - gradient measures the change in the width of the - shape per unit length of the axis (measured per edge - segment). Between 0...1, where 0 is no pruning and 1 - is maximal pruning for this feature.
        -
        distanceThreshold - Prune edges based on the spatial distance between - the medial axis root and edge's tail coordinate. - Between 0...1, where 0 is no pruning and 1 is - maximal pruning for this feature.
        -
        areaThreshold - Prune edges based on the sum of each edge and its - descendants underlying feature area. Between 0...1, - where 0 is no pruning and 1 is maximal pruning for - this feature.
        -
        Returns:
        -
        PShape of lines where lines represent medial axis edges
        -
        -
        • -
      - - - -
        -
      • -

        chordalAxis

        -
        public static processing.core.PShape chordalAxis​(processing.core.PShape shape)
        -
        Computes the chordal axis of a shape, which provides a characterization of - the skeleton of a shape. -

        - In its primitive form, the chordal axis is constructed by joining the - midpoints of the chords and the centroids of junction and terminal triangles - of the delaunay trianglution of a shape. -

        - It can be considered a more useful alternative to the medial axis for - obtaining skeletons of discrete shapes.

        -
        -
        Parameters:
        -
        shape - polygonal shape
        -
        Returns:
        -
        a GROUP PShape, where each group is a single maximum-length line - segment (possibly >2 vertices)
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        straightSkeleton

        -
        public static processing.core.PShape straightSkeleton​(processing.core.PShape shape)
        -
        Computes the straight skeleton for a shape. -

        - A straight skeleton is a skeletal structure similar to the medial axis, - consisting of straight-line segments only. Roughly, it is the geometric graph - whose edges are the traces of vertices of shrinking mitered offset curves of - the polygon.

        -
        -
        Parameters:
        -
        shape - a single polygon (that can contain holes), or a multi polygon - (whose polygons can contain holes)
        -
        Returns:
        -
        when the input is a single polygon, returns a GROUP PShape containing - 3 children: child 1 = GROUP PShape of skeleton faces; child 2 = LINES - PShape of branches (lines that connect skeleton to edge); child 3 = - LINES PShape of bones (the pure straight skeleton). For - multi-polygons, a master GROUP shape of skeleton GROUP shapes - (described above) is returned.
        -
        -
        • -
      - - - -
        -
      • -

        isolines

        -
        public static processing.core.PShape isolines​(processing.core.PShape shape,
-                                              processing.core.PVector highPoint,
-                                              double intervalSpacing)
        -
        Generates a topographic-like isoline contour map from the shape's vertices. - The "elevation" (or z value) of points is the euclidean distance between a - point in the shape and the given "high" point. -

        - Assigns each point feature a number equal to the distance between geometry's - centroid and the point.

        -
        -
        Parameters:
        -
        shape -
        -
        highPoint - position of "high" point within the shape
        -
        intervalSpacing - distance between successive isolines
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        isolines

        -
        public static Map<processing.core.PShape,​Float> isolines​(Collection<processing.core.PVector> points,
-                                                               double intervalValueSpacing,
-                                                               double isolineMin,
-                                                               double isolineMax)
        -
        Generates a topographic-like isoline contour map from the given points. This - method uses the Z value of each PVector point as the "elevation" of that - location in the map.
        -
        -
        Parameters:
        -
        points - List of PVectors: the z coordinate for each - PVector defines the contour height at that - location
        -
        intervalValueSpacing - contour height distance represented by successive - isolines (e.g. a value of 1 will generate - isolines at each 1 unit of height)
        -
        isolineMin - minimum value represented by isolines
        -
        isolineMax - maximum value represented by isolines
        -
        Returns:
        -
        a map of {isoline -> height of the isoline}
        -
        -
        • -
      - - - -
        -
      • -

        isolines

        -
        public static Map<processing.core.PShape,​Float> isolines​(Collection<processing.core.PVector> points,
-                                                               double intervalValueSpacing,
-                                                               double isolineMin,
-                                                               double isolineMax,
-                                                               int smoothing)
        -
        Generates a topographic-like isoline contour map from the given points. This - method uses the Z value of each PVector point as the "elevation" of that - location in the map.
        -
        -
        Parameters:
        -
        points - List of PVectors: the z coordinate for each - PVector defines the contour height at that - location
        -
        intervalValueSpacing - contour height distance represented by successive - isolines (e.g. a value of 1 will generate - isolines at each 1 unit of height)
        -
        isolineMin - minimum value represented by isolines
        -
        isolineMax - maximum value represented by isolines
        -
        smoothing - Number of contour smoothing passes to perform. - The best choice for this value depends on the - requirements of the application. Values in the - range 5 to 40 are good candidates for - investigation.
        -
        Returns:
        -
        a map of {isoline -> height of the isoline}
        -
        -
        • -
      - - - -
        -
      • -

        distanceField

        -
        public static processing.core.PShape distanceField​(processing.core.PShape shape,
-                                                   double spacing)
        -
        Generates a contour map based on a distance field of a shape. -

        - A distance field maps each point within the shape to the shortest distance - between that point and the shape boundary.

        -
        -
        Parameters:
        -
        shape - polygonal shape
        -
        spacing - distance represented by successive contour lines
        -
        Returns:
        -
        GROUP shape, where each child is a closed contour line or contour - line partition
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        offsetCurvesInward

        -
        public static processing.core.PShape offsetCurvesInward​(processing.core.PShape shape,
-                                                        PGS_Contour.OffsetStyle style,
-                                                        double spacing)
        -
        Produces inwards offset curves from the shape. Curves will be generated until - they collapse.
        -
        -
        Parameters:
        -
        shape - a single polygon or multipolygon (GROUP PShape)
        -
        spacing - spacing between successive offset curves. Should be >=1.
        -
        style - specifies the curve join style (BEVEL, MITER, ROUND) to use
        -
        Returns:
        -
        A GROUP PShape, where each child shape is a single curve shape, or a - GROUP shape of curves created at the same step
        -
        See Also:
        -
        offsetCurvesOutward(PShape, OffsetStyle, double, int)
        -
        -
        • -
      - - - -
        -
      • -

        offsetCurvesInward

        -
        public static processing.core.PShape offsetCurvesInward​(processing.core.PShape shape,
-                                                        PGS_Contour.OffsetStyle style,
-                                                        double spacing,
-                                                        int curves)
        -
        Produces N inwards offset curves from the shape.
        -
        -
        Parameters:
        -
        shape - a single polygon or multipolygon (GROUP PShape)
        -
        spacing - spacing between successive offset curves. Should be >=1.
        -
        style - specifies the curve join style (BEVEL, MITER, ROUND) to use
        -
        Returns:
        -
        A GROUP PShape, where each child shape is a single curve shape, or a - GROUP shape of curves created at the same step
        -
        See Also:
        -
        offsetCurvesOutward(PShape, OffsetStyle, double, int)
        -
        -
        • -
      - - - -
        -
      • -

        offsetCurvesOutward

        -
        public static processing.core.PShape offsetCurvesOutward​(processing.core.PShape shape,
-                                                         PGS_Contour.OffsetStyle style,
-                                                         double spacing,
-                                                         int curves)
        -
        Produces N offset curves that emanate outwards from the shape.
        -
        -
        Parameters:
        -
        shape - a single polygon or multipolygon (GROUP PShape)
        -
        spacing - spacing between successive offset curves. Should be >=1.
        -
        curves - the number of offset curves to create (including the original - shape outline)
        -
        style - specifies the curve join style (BEVEL, MITER, ROUND) to use
        -
        Returns:
        -
        A GROUP PShape, where each child shape is a single curve shape, or a - GROUP shape of curves created at the same step
        -
        See Also:
        -
        offsetCurvesInward(PShape, OffsetStyle, double)
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/PGS_Conversion.html b/micycle/pgs/PGS_Conversion.html deleted file mode 100644 index ec7d8da0..00000000 --- a/micycle/pgs/PGS_Conversion.html +++ /dev/null @@ -1,1280 +0,0 @@ - - - - - -PGS_Conversion (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs
-

Class PGS_Conversion

-
-
- -
-
    -
  • -
    -
    public final class PGS_Conversion
-extends Object
    -
    Conversion between Processing PShapes and JTS - Geometries (amongst other formats). Also includes helper/utility - methods for PShapes. -

    - Methods in this class are used by the library internally but are kept - accessible for more advanced user use cases. -

    - Notably, JTS geometries do not support bezier curves so any bezier curves are - finely subdivided into straight linestrings during PShape -> JTS - Geometry conversion. -

    - This class features 2 boolean flags that affect conversion that you may wish - to look at: PRESERVE_STYLE and HANDLE_MULTICONTOUR.

    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Field Summary

      - - - - - - - - - - - - - - - - - -
      Fields 
      Modifier and TypeFieldDescription
      static booleanHANDLE_MULTICONTOUR -
      A boolean flag that enables a subroutine during fromPShape() conversion to properly convert single PShapes that - consist of multiple contours that in turn represent multiple distinct shapes.
      -
      static booleanPRESERVE_STYLE -
      A boolean flag that affects whether a PShape's style (fillColor, strokeColor, - strokeWidth) is preserved during PShape->Geometry->PShape - conversion (i.e.
      -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Summary

      - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
      All Methods Static Methods Concrete Methods 
      Modifier and TypeMethodDescription
      static processing.core.PShapecopy​(processing.core.PShape shape) -
      Produces a deep copy / clone of the input shape.
      -
      static processing.core.PShapedisableAllFill​(processing.core.PShape shape) -
      Calls setFill(false) on a PShape and all its children.
      -
      static processing.core.PShapedisableAllStroke​(processing.core.PShape shape) -
      Calls setStroke(false) on a PShape and all its children.
      -
      static processing.core.PShapeflatten​(Collection<processing.core.PShape> shapes) -
      Flattens a collection of PShapes into a single GROUP PShape which has the - input shapes as its children.
      -
      static processing.core.PShapeflatten​(processing.core.PShape... shapes) -
      Flattens a collection of PShapes into a single GROUP PShape which has the - input shapes as its children.
      -
      static processing.core.PShapefromChildren​(List<processing.core.PShape> children) -
      Creates a single GROUP shape whose children shapes are the list given.
      -
      static processing.core.PShapefromEncodedPolyline​(String encodedPolyline) -
      Converts a geometry in Encoded Polyline format into a PShape.
      -
      static processing.core.PShapefromGeoJSON​(String json) -
      Converts a GeoJSON representation of a shape into its PShape counterpart.
      -
      static <V,​E>
      processing.core.PShape      		fromGraph​(org.jgrapht.graph.SimpleGraph<V,​E> graph, - double normalizationFactor, - double boundsX, - double boundsY) -
      Takes as input a graph and computes a layout for the graph vertices using a - Force-Directed placement algorithm (not vertex coordinates, if any exist).
      -
      static processing.core.PShapefromHexWKB​(String shapeWKB) -
      Converts a geometry in Well-Known Binary hex format into a PShape.
      -
      static processing.core.PShapefromJava2D​(Shape shape) -
      Converts a Java2D/java.awt Shape to a Processing PShape.
      -
      static org.locationtech.jts.geom.GeometryfromPShape​(processing.core.PShape shape) -
      Converts a PShape to an equivalent JTS Geometry.
      -
      static processing.core.PShapefromPVector​(Collection<processing.core.PVector> vertices) -
      Generates a shape from a list of vertices.
      -
      static processing.core.PShapefromPVector​(processing.core.PVector... vertices) -
      Generates a simple closed polygon (assumes no holes) from the list of - vertices (varargs).
      -
      static processing.core.PShapefromWKB​(byte[] shapeWKB) -
      Converts a geometry in Well-Known Binary format into a PShape.
      -
      static processing.core.PShapefromWKT​(String textRepresentation) -
      Converts a geometry in Well-Known Text format into a PShape.
      -
      static List<processing.core.PShape>getChildren​(processing.core.PShape shape) -
      Recurses a GROUP PShape, finding all of its non-GROUP child PShapes.
      -
      static processing.core.PShaperoundVertexCoords​(processing.core.PShape shape) -
      Rounds the x and y coordinates (to the closest int) of all vertices belonging - to the shape, mutating the shape.
      -
      static processing.core.PShapesetAllFillColor​(processing.core.PShape shape, - int color) -
      Sets the fill color for the PShape and all of its children recursively (and - disables stroke).
      -
      static processing.core.PShapesetAllStrokeColor​(processing.core.PShape shape, - int color, - double strokeWeight) -
      Sets the stroke color for the PShape and all of its children recursively.
      -
      static processing.core.PShapesetAllStrokeToFillColor​(processing.core.PShape shape) -
      Sets the stroke color equal to the fill color for the PShape and all of its - descendent shapes individually (that is, each child shape belonging to the - shape (if any) will have its stroke color set to its own fill color, - and not the parent-most shape's fill color).
      -
      static processing.core.PShapesetAllStrokeToFillColor​(processing.core.PShape shape, - double strokeWeight) -
      Sets the stroke color equal to the fill color, and the strokeWeight to the - specified value, for the PShape and all of its descendent shapes individually - (that is, each child shape belonging to the shape (if any) will have its - stroke color set to its own fill color, and not the parent-most - shape's fill color).
      -
      static org.jgrapht.graph.SimpleGraph<processing.core.PShape,​org.jgrapht.graph.DefaultEdge>toDualGraph​(processing.core.PShape mesh) -
      Converts a mesh-like PShape into its undirected, unweighted dual-graph.
      -
      static StringtoEncodedPolyline​(processing.core.PShape shape) -
      Writes a single holeless shape into the string representation of its - Google Encoded Polyline format.
      -
      static StringtoGeoJSON​(processing.core.PShape shape) -
      Writes a shape into the string representation of its GeoJSON format.
      -
      static org.jgrapht.graph.SimpleGraph<processing.core.PVector,​PEdge>toGraph​(processing.core.PShape shape) -
      Converts a shape into a simple graph; graph vertices represent shape - vertices, and graph edges represent shape edges (formed from adjacent - vertices in polygonal shapes).
      -
      static StringtoHexWKB​(processing.core.PShape shape) -
      Writes a shape into the hexadecimal string representation of its - Well-Known Binary format.
      -
      static ShapetoJava2D​(processing.core.PShape shape) -
      Creates a Java2D/java.awt Shape representing a PShape.
      -
      static processing.core.PShapetoPointsPShape​(Collection<processing.core.PVector> points) -
      Transforms a list of points into a POINTS PShape.
      -
      static processing.core.PShapetoPShape​(Collection<? extends org.locationtech.jts.geom.Geometry> geometries) -
      Converts a collection of JTS Geometries to an equivalent GROUP PShape.
      -
      static processing.core.PShapetoPShape​(org.locationtech.jts.geom.Geometry g) -
      Converts a JTS Geometry to an equivalent PShape.
      -
      static List<processing.core.PVector>toPVector​(processing.core.PShape shape) -
      Returns the vertices of a PShape as an unclosed list of PVector - coordinates.
      -
      static byte[]toWKB​(processing.core.PShape shape) -
      Writes a shape into Well-Known Binary format.
      -
      static StringtoWKT​(processing.core.PShape shape) -
      Writes the Well-Known Text representation of a shape.
      -
      - -
      • -
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Field Detail

      - - - -
        -
      • -

        PRESERVE_STYLE

        -
        public static boolean PRESERVE_STYLE
        -
        A boolean flag that affects whether a PShape's style (fillColor, strokeColor, - strokeWidth) is preserved during PShape->Geometry->PShape - conversion (i.e. when toPShape(fromPShape(myPShape)) is called). - Default = true.
        -
        • -
      - - - -
        -
      • -

        HANDLE_MULTICONTOUR

        -
        public static boolean HANDLE_MULTICONTOUR
        -
        A boolean flag that enables a subroutine during fromPShape() conversion to properly convert single PShapes that - consist of multiple contours that in turn represent multiple distinct shapes. - When false, fromPShape() assumes - that in shapes having multiple contours, every contour beyond the first - represents a hole, which is generally sufficient. -

        - This feature is off by default because it introduces some overhead as polygon - rings orientation must be determined (amongst other such stuff), and is - rarely needed (unless one is working with fonts, I have found). Default = - false. -

        - See github for more - information.

        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        toPShape

        -
        public static processing.core.PShape toPShape​(org.locationtech.jts.geom.Geometry g)
        -
        Converts a JTS Geometry to an equivalent PShape. MultiGeometries (collections - of geometries) become GROUP PShapes containing the appropriate children - PShapes.
        -
        -
        Parameters:
        -
        g - JTS geometry to convert
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        toPShape

        -
        public static processing.core.PShape toPShape​(Collection<? extends org.locationtech.jts.geom.Geometry> geometries)
        -
        Converts a collection of JTS Geometries to an equivalent GROUP PShape. If the - collection contains only one geometry, an equivalent PShape will be output - directly (not a GROUP shape).
        -
        • -
      - - - -
        -
      • -

        fromPShape

        -
        public static org.locationtech.jts.geom.Geometry fromPShape​(processing.core.PShape shape)
        -
        Converts a PShape to an equivalent JTS Geometry. -

        - PShapes with bezier curves are sampled at regular intervals (in which case - the resulting geometry will have more vertices than the input PShape).

        -
        -
        Parameters:
        -
        shape -
        -
        Returns:
        -
        a JTS Geometry equivalent to the input PShape
        -
        -
        • -
      - - - -
        -
      • -

        toPointsPShape

        -
        public static final processing.core.PShape toPointsPShape​(Collection<processing.core.PVector> points)
        -
        Transforms a list of points into a POINTS PShape.
        -
        -
        Since:
        -
        1.2.0
        -
        -
        • -
      - - - -
        -
      • -

        toPVector

        -
        public static List<processing.core.PVector> toPVector​(processing.core.PShape shape)
        -
        Returns the vertices of a PShape as an unclosed list of PVector - coordinates.
        -
        -
        Parameters:
        -
        shape - a non-GROUP PShape
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        toGraph

        -
        public static org.jgrapht.graph.SimpleGraph<processing.core.PVector,​PEdge> toGraph​(processing.core.PShape shape)
        -
        Converts a shape into a simple graph; graph vertices represent shape - vertices, and graph edges represent shape edges (formed from adjacent - vertices in polygonal shapes).
        -
        -
        Parameters:
        -
        shape - the shape to convert
        -
        Returns:
        -
        graph representation of the input shape
        -
        Since:
        -
        1.3.0
        -
        See Also:
        -
        toDualGraph(PShape)
        -
        -
        • -
      - - - -
        -
      • -

        fromGraph

        -
        public static <V,​E> processing.core.PShape fromGraph​(org.jgrapht.graph.SimpleGraph<V,​E> graph,
-                                                           double normalizationFactor,
-                                                           double boundsX,
-                                                           double boundsY)
        -
        Takes as input a graph and computes a layout for the graph vertices using a - Force-Directed placement algorithm (not vertex coordinates, if any exist). - Vertices are joined by their edges. -

        - The output is a rather abstract representation of the input graph, and not a - geometric equivalent (unlike most other conversion methods in the class).

        -
        -
        Type Parameters:
        -
        V - any vertex type
        -
        E - any edge type
        -
        Parameters:
        -
        graph - the graph whose edges and vertices to lay out
        -
        normalizationFactor - normalization factor for the optimal distance, - between 0 and 1.
        -
        boundsX - horizontal vertex bounds
        -
        boundsY - vertical vertex bounds
        -
        Returns:
        -
        a GROUP PShape consisting of 2 children; child 0 is the linework - (LINES) depicting edges and child 1 is the points (POINTS) depicting - vertices. The bounds of the layout are anchored at (0, 0);
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        toDualGraph

        -
        public static org.jgrapht.graph.SimpleGraph<processing.core.PShape,​org.jgrapht.graph.DefaultEdge> toDualGraph​(processing.core.PShape mesh)
        -
        Converts a mesh-like PShape into its undirected, unweighted dual-graph. -

        - The output is a dual graph of the input; it has a vertex for each face - (PShape) of the input, and an edge for each pair of faces that are adjacent.

        -
        -
        Parameters:
        -
        mesh - a GROUP PShape, whose children constitute the polygonal faces of - a conforming mesh. A conforming mesh consists of adjacent - cells that not only share edges, but every pair of shared edges - are identical (having the same coordinates) (such as a - triangulation).
        -
        Returns:
        -
        the dual graph of the input mesh; an undirected graph containing no - graph loops or multiple edges.
        -
        Since:
        -
        1.3.0
        -
        See Also:
        -
        toGraph(PShape)
        -
        -
        • -
      - - - -
        -
      • -

        toWKT

        -
        public static String toWKT​(processing.core.PShape shape)
        -
        Writes the Well-Known Text representation of a shape. The - Well-Known Text format is defined in the OGC Simple Features - Specification for SQL.
        -
        -
        Parameters:
        -
        shape - shape to process
        -
        Returns:
        -
        a Geometry Tagged Text string
        -
        Since:
        -
        1.3.0
        -
        See Also:
        -
        fromWKT(String)
        -
        -
        • -
      - - - -
        -
      • -

        fromWKT

        -
        public static processing.core.PShape fromWKT​(String textRepresentation)
        -
        Converts a geometry in Well-Known Text format into a PShape.
        -
        -
        Parameters:
        -
        textRepresentation - one or more Geometry Tagged Text strings, separated - by whitespace
        -
        Returns:
        -
        a PShape specified by the text
        -
        Since:
        -
        1.3.0
        -
        See Also:
        -
        toWKT(PShape)
        -
        -
        • -
      - - - -
        -
      • -

        toWKB

        -
        public static byte[] toWKB​(processing.core.PShape shape)
        -
        Writes a shape into Well-Known Binary format. The WKB format is - specified in the OGC Simple Features for SQL specification.
        -
        -
        Parameters:
        -
        shape - shape to process
        -
        Returns:
        -
        WKB byte representation of shape
        -
        Since:
        -
        1.3.0
        -
        See Also:
        -
        fromWKB(byte[]), -toHexWKB(PShape)
        -
        -
        • -
      - - - -
        -
      • -

        fromWKB

        -
        public static processing.core.PShape fromWKB​(byte[] shapeWKB)
        -
        Converts a geometry in Well-Known Binary format into a PShape.
        -
        -
        Parameters:
        -
        shapeWKB - byte representation of shape to process
        -
        Returns:
        -
        a PShape specified by the WKB
        -
        Since:
        -
        1.3.0
        -
        See Also:
        -
        toWKB(PShape)
        -
        -
        • -
      - - - -
        -
      • -

        toHexWKB

        -
        public static String toHexWKB​(processing.core.PShape shape)
        -
        Writes a shape into the hexadecimal string representation of its - Well-Known Binary format.
        -
        -
        Parameters:
        -
        shape - shape to process
        -
        Returns:
        -
        hexadecimal string representation of shape WKB
        -
        Since:
        -
        1.3.0
        -
        See Also:
        -
        toWKB(PShape)
        -
        -
        • -
      - - - -
        -
      • -

        fromHexWKB

        -
        public static processing.core.PShape fromHexWKB​(String shapeWKB)
        -
        Converts a geometry in Well-Known Binary hex format into a PShape.
        -
        -
        Parameters:
        -
        shapeWKB - hex string WKB representation of shape to process
        -
        Returns:
        -
        a PShape specified by the WKB
        -
        Since:
        -
        1.3.0
        -
        See Also:
        -
        toWKB(PShape)
        -
        -
        • -
      - - - -
        -
      • -

        toEncodedPolyline

        -
        public static String toEncodedPolyline​(processing.core.PShape shape)
        -
        Writes a single holeless shape into the string representation of its - Google Encoded Polyline format.
        -
        -
        Parameters:
        -
        shape - single (holeless) polygon or line
        -
        Returns:
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        fromEncodedPolyline

        -
        public static processing.core.PShape fromEncodedPolyline​(String encodedPolyline)
        -
        Converts a geometry in Encoded Polyline format into a PShape.
        -
        -
        Parameters:
        -
        encodedPolyline - an encoded polyline string representing a shape
        -
        Returns:
        -
        a PShape represented by the encoded polyline string
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        toGeoJSON

        -
        public static String toGeoJSON​(processing.core.PShape shape)
        -
        Writes a shape into the string representation of its GeoJSON format.
        -
        -
        Parameters:
        -
        shape -
        -
        Returns:
        -
        json JSON string
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        fromGeoJSON

        -
        public static processing.core.PShape fromGeoJSON​(String json)
        -
        Converts a GeoJSON representation of a shape into its PShape counterpart.
        -
        -
        Parameters:
        -
        json - GeoJSON string
        -
        Returns:
        -
        PShape represented by the GeoJSON
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        toJava2D

        -
        public static Shape toJava2D​(processing.core.PShape shape)
        -
        Creates a Java2D/java.awt Shape representing a PShape.
        -
        -
        Parameters:
        -
        shape - the PShape to convert
        -
        Returns:
        -
        a Java2D shape representing the PShape
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        fromJava2D

        -
        public static processing.core.PShape fromJava2D​(Shape shape)
        -
        Converts a Java2D/java.awt Shape to a Processing PShape. -

        - If the shape contains bezier components (such as CubicCurve2D, - these are decomposed into straight-line segments in the output.

        -
        -
        Parameters:
        -
        shape - the Java2D shape to convert
        -
        Returns:
        -
        a PShape representing the Java2D shape
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        fromPVector

        -
        public static processing.core.PShape fromPVector​(Collection<processing.core.PVector> vertices)
        -
        Generates a shape from a list of vertices. If the list of vertices is closed - (first and last vertices are the same), the vertices are interpreted as a - closed polygon (having no holes); if the list is unclosed, they are treated - as a linestring.
        -
        -
        Parameters:
        -
        vertices - list of (un)closed shape vertices
        -
        Returns:
        -
        a PATH PShape (either open linestring or closed polygon)
        -
        See Also:
        -
        fromPVector(PVector...)
        -
        -
        • -
      - - - -
        -
      • -

        fromPVector

        -
        public static processing.core.PShape fromPVector​(processing.core.PVector... vertices)
        -
        Generates a simple closed polygon (assumes no holes) from the list of - vertices (varargs).
        -
        -
        Parameters:
        -
        vertices - list of (un)closed shape vertices
        -
        See Also:
        -
        #fromPVector(List)
        -
        -
        • -
      - - - -
        -
      • -

        flatten

        -
        public static processing.core.PShape flatten​(Collection<processing.core.PShape> shapes)
        -
        Flattens a collection of PShapes into a single GROUP PShape which has the - input shapes as its children.
        -
        -
        Since:
        -
        1.2.0
        -
        See Also:
        -
        flatten(PShape...)
        -
        -
        • -
      - - - -
        -
      • -

        flatten

        -
        public static processing.core.PShape flatten​(processing.core.PShape... shapes)
        -
        Flattens a collection of PShapes into a single GROUP PShape which has the - input shapes as its children.
        -
        -
        Since:
        -
        1.3.0
        -
        See Also:
        -
        flatten(Collection)
        -
        -
        • -
      - - - -
        -
      • -

        getChildren

        -
        public static List<processing.core.PShape> getChildren​(processing.core.PShape shape)
        -
        Recurses a GROUP PShape, finding all of its non-GROUP child PShapes. -

        - - Note: this method differs from PShape.getChildren(). That method will return GROUP child shapes, whereas - this method will recurse such shapes, returing their non-group children (in - other words, this method explores the whole tree of shapes, returning - non-group shapes only).

        -
        -
        Parameters:
        -
        shape -
        -
        Returns:
        -
        a list of non-GROUP PShapes
        -
        Since:
        -
        1.2.0
        -
        -
        • -
      - - - -
        -
      • -

        fromChildren

        -
        public static processing.core.PShape fromChildren​(List<processing.core.PShape> children)
        -
        Creates a single GROUP shape whose children shapes are the list given.
        -
        -
        Parameters:
        -
        children -
        -
        Returns:
        -
        a GROUP PShape consisting of the given children
        -
        -
        • -
      - - - -
        -
      • -

        setAllFillColor

        -
        public static processing.core.PShape setAllFillColor​(processing.core.PShape shape,
-                                                     int color)
        -
        Sets the fill color for the PShape and all of its children recursively (and - disables stroke).
        -
        -
        Parameters:
        -
        shape -
        -
        Returns:
        -
        the input object (having now been mutated)
        -
        See Also:
        -
        #setAllStrokeColor(PShape, int, float)
        -
        -
        • -
      - - - -
        -
      • -

        setAllStrokeColor

        -
        public static processing.core.PShape setAllStrokeColor​(processing.core.PShape shape,
-                                                       int color,
-                                                       double strokeWeight)
        -
        Sets the stroke color for the PShape and all of its children recursively.
        -
        -
        Parameters:
        -
        shape -
        -
        Returns:
        -
        the input object (having now been mutated)
        -
        -
        • -
      - - - -
        -
      • -

        setAllStrokeToFillColor

        -
        public static processing.core.PShape setAllStrokeToFillColor​(processing.core.PShape shape)
        -
        Sets the stroke color equal to the fill color for the PShape and all of its - descendent shapes individually (that is, each child shape belonging to the - shape (if any) will have its stroke color set to its own fill color, - and not the parent-most shape's fill color).
        -
        -
        Parameters:
        -
        shape -
        -
        Returns:
        -
        the input object (having now been mutated)
        -
        Since:
        -
        1.2.0
        -
        -
        • -
      - - - -
        -
      • -

        setAllStrokeToFillColor

        -
        public static processing.core.PShape setAllStrokeToFillColor​(processing.core.PShape shape,
-                                                             double strokeWeight)
        -
        Sets the stroke color equal to the fill color, and the strokeWeight to the - specified value, for the PShape and all of its descendent shapes individually - (that is, each child shape belonging to the shape (if any) will have its - stroke color set to its own fill color, and not the parent-most - shape's fill color).
        -
        -
        Parameters:
        -
        shape -
        -
        Returns:
        -
        the input object (having now been mutated)
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        disableAllFill

        -
        public static processing.core.PShape disableAllFill​(processing.core.PShape shape)
        -
        Calls setFill(false) on a PShape and all its children. This method mutates - the input shape.
        -
        -
        Parameters:
        -
        shape -
        -
        Returns:
        -
        the input object (having now been mutated)
        -
        -
        • -
      - - - -
        -
      • -

        disableAllStroke

        -
        public static processing.core.PShape disableAllStroke​(processing.core.PShape shape)
        -
        Calls setStroke(false) on a PShape and all its children. This method mutates - the input shape.
        -
        -
        Parameters:
        -
        shape -
        -
        Returns:
        -
        the input object (having now been mutated)
        -
        -
        • -
      - - - -
        -
      • -

        roundVertexCoords

        -
        public static processing.core.PShape roundVertexCoords​(processing.core.PShape shape)
        -
        Rounds the x and y coordinates (to the closest int) of all vertices belonging - to the shape, mutating the shape. This can sometimes fix a visual - problem in Processing where narrow gaps can appear between otherwise flush - shapes.
        -
        -
        Returns:
        -
        the input object (having now been mutated)
        -
        Since:
        -
        1.1.3
        -
        -
        • -
      - - - -
        -
      • -

        copy

        -
        public static processing.core.PShape copy​(processing.core.PShape shape)
        -
        Produces a deep copy / clone of the input shape. Handles GROUP, PRIMITIVE, - GEOMETRY and PATH PShapes.
        -
        -
        Parameters:
        -
        shape - the PShape to copy
        -
        Returns:
        -
        a deep copy of the given shape
        -
        Since:
        -
        1.2.0
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/PGS_Hull.html b/micycle/pgs/PGS_Hull.html deleted file mode 100644 index 8feba824..00000000 --- a/micycle/pgs/PGS_Hull.html +++ /dev/null @@ -1,491 +0,0 @@ - - - - - -PGS_Hull (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs
-

Class PGS_Hull

-
-
- -
-
    -
  • -
    -
    public class PGS_Hull
-extends Object
    -
    Convex and concave hulls (amongst other variations) of polygons and point - sets. -

    - or ... Find minimal coverings (hulls) of polygon arrangements and point/shape - sets.

    -
    -
    Since:
    -
    1.3.0
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Summary

      - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
      All Methods Static Methods Concrete Methods 
      Modifier and TypeMethodDescription
      static processing.core.PShapeconcaveHull​(processing.core.PShape shapeSet, - double concavity, - boolean tight) -
      Constructs a concave hull of a set of polygons, respecting the polygons as - constraints (i.e.
      -
      static processing.core.PShapeconcaveHullBFS​(List<processing.core.PVector> points, - double concavity) -
      Computes the concave hull of a point set using a breadth-first method.
      -
      static processing.core.PShapeconcaveHullBFS2​(List<processing.core.PVector> points, - double threshold) -
      Computes the concave hull of a point set using a different algorithm.
      -
      static processing.core.PShapeconcaveHullDFS​(List<processing.core.PVector> points, - double threshold) -
      Computes the concave hull of a point set using a depth-first method.
      -
      static processing.core.PShapeconvexHull​(Collection<processing.core.PVector> points) -
      Computes the convex hull of a point set (the smallest convex polygon that - contains all the points).
      -
      static processing.core.PShapeconvexHull​(processing.core.PShape shape) -
      Computes the convex hull of the vertices from the input shape (the smallest - convex polygon that contains all the shape's vertices).
      -
      static processing.core.PShapesnapHull​(processing.core.PShape shape, - double convexity) -
      Computes a hull, having a variable level of convexity, of a shape.
      -
      - -
      • -
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        convexHull

        -
        public static processing.core.PShape convexHull​(Collection<processing.core.PVector> points)
        -
        Computes the convex hull of a point set (the smallest convex polygon that - contains all the points).
        -
        -
        Parameters:
        -
        points - a collection of points
        -
        Returns:
        -
        the minimum-area convex polygon containing the points
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        convexHull

        -
        public static processing.core.PShape convexHull​(processing.core.PShape shape)
        -
        Computes the convex hull of the vertices from the input shape (the smallest - convex polygon that contains all the shape's vertices).
        -
        -
        Parameters:
        -
        shape - a concave shape
        -
        Returns:
        -
        the minimum-area convex polygon containing the input's vertices
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        concaveHull

        -
        public static processing.core.PShape concaveHull​(processing.core.PShape shapeSet,
-                                                 double concavity,
-                                                 boolean tight)
        -
        Constructs a concave hull of a set of polygons, respecting the polygons as - constraints (i.e. the hull is guaranteed to contain the polygons).
        -
        -
        Parameters:
        -
        shapeSet - a GROUP PShape, having multiple child PShapes, each of which - is a polygon
        -
        concavity - a factor value between 0 and 1, specifying how concave the - output is.
        -
        tight - sets whether the boundary of the hull polygon is kept tight - to precisely the outer edges of the input polygons
        -
        Returns:
        -
        concave hull of the input shapes
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        concaveHullBFS

        -
        public static processing.core.PShape concaveHullBFS​(List<processing.core.PVector> points,
-                                                    double concavity)
        -
        Computes the concave hull of a point set using a breadth-first method.
        -
        -
        Parameters:
        -
        points -
        -
        threshold - euclidean distance threshold
        -
        Returns:
        -
        Since:
        -
        1.1.0
        -
        See Also:
        -
        concaveHullDFS(List, double), -concaveHullBFS2(List, double)
        -
        -
        • -
      - - - -
        -
      • -

        concaveHullDFS

        -
        public static processing.core.PShape concaveHullDFS​(List<processing.core.PVector> points,
-                                                    double threshold)
        -
        Computes the concave hull of a point set using a depth-first method. In - contrast to the BFS method, the depth-first approach produces shapes that are - more contiguous/less branching and spiral-like.
        -
        -
        Parameters:
        -
        points -
        -
        threshold - euclidean distance threshold
        -
        Returns:
        -
        Since:
        -
        1.1.0
        -
        See Also:
        -
        concaveHullBFS(List, double), -concaveHullBFS2(List, double)
        -
        -
        • -
      - - - -
        -
      • -

        concaveHullBFS2

        -
        public static processing.core.PShape concaveHullBFS2​(List<processing.core.PVector> points,
-                                                     double threshold)
        -
        Computes the concave hull of a point set using a different algorithm. This - approach has a more "organic" structure compared to other concaveBFS method.
        -
        -
        Parameters:
        -
        points -
        -
        threshold - 0...1 (Normalized length parameter). -
          -
        • Setting threshold=1 means that no edges - will be removed from the Delaunay triangulation, so the - resulting polygon will be the convex hull. -
        • Setting threshold=0 means that all edges - that can be removed subject to the regularity constraint - will be removed (however polygons that are eroded beyond the - point where they provide a desirable characterization of the - shape). -
        • Although the optimal parameter value varies for - different shapes and point distributions, values between - 0.05–0.2 typically produce optimal or - near-optimal shape characterization across a wide range of - point distributions.
        -
        Returns:
        -
        See Also:
        -
        concaveHullBFS(List, double)
        -
        -
        • -
      - - - -
        -
      • -

        snapHull

        -
        public static processing.core.PShape snapHull​(processing.core.PShape shape,
-                                              double convexity)
        -
        Computes a hull, having a variable level of convexity, of a shape. -

        - When convexity=0, the original shape is reproduced (a pure - concave hull); the hull tends towards a convex hull of the input as - convexity goes to 1 (in other words, a hull with - some level of "snapping" to the original shape).

        -
        -
        Parameters:
        -
        shape -
        -
        convexity - how convex the snap hull is, where 0 is the original shape - (no convexity, fully concave) and 1 forms the convex hull of - the shape's vertices
        -
        Returns:
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/PGS_Meshing.html b/micycle/pgs/PGS_Meshing.html deleted file mode 100644 index b144a539..00000000 --- a/micycle/pgs/PGS_Meshing.html +++ /dev/null @@ -1,603 +0,0 @@ - - - - - -PGS_Meshing (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs
-

Class PGS_Meshing

-
-
- -
-
    -
  • -
    -
    public class PGS_Meshing
-extends Object
    -
    Mesh generation (excluding triangulation). -

    - Many of the methods within this class process an existing Delaunay - triangulation; you may first generate such a triangulation from a shape using - the - delaunayTriangulationMesh() method

    -
    -
    Since:
    -
    1.2.0
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Summary

      - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
      All Methods Static Methods Concrete Methods 
      Modifier and TypeMethodDescription
      static processing.core.PShapecentroidQuadrangulation​(org.tinfour.common.IIncrementalTin triangulation, - boolean preservePerimeter) -
      Generates a quadrangulation from a triangulation by "inverting" triangles - (for each triangle, create edges joining its centroid to each of its - vertices).
      -
      static processing.core.PShapedualFaces​(org.tinfour.common.IIncrementalTin triangulation) -
      Generates a (mesh-like) shape consisting of polygonal faces of the dual graph - of the given triangulation.
      -
      static processing.core.PShapeedgeCollapseQuadrangulation​(org.tinfour.common.IIncrementalTin triangulation, - boolean preservePerimeter) -
      Generates a quadrangulation from a triangulation by selectively removing (or - "collapsing") the edges shared by neighboring triangles (via edge coloring).
      -
      static processing.core.PShapegabrielFaces​(org.tinfour.common.IIncrementalTin triangulation, - boolean preservePerimeter) -
      Generates a shape consisting of polygonal faces of a Gabriel graph.
      -
      static processing.core.PShaperelativeNeighborFaces​(org.tinfour.common.IIncrementalTin triangulation, - boolean preservePerimeter) -
      Generates a shape consisting of polygonal faces of a Relative neighborhood - graph (RNG).
      -
      static processing.core.PShapespannerFaces​(org.tinfour.common.IIncrementalTin triangulation, - int k, - boolean preservePerimeter) -
      Generates a shape consisting of polygonal faces formed by edges returned by a - greedy sparse spanner applied to a triangulation.
      -
      static processing.core.PShapespiralQuadrangulation​(List<processing.core.PVector> points) -
      Produces a quadrangulation from a point set.
      -
      static processing.core.PShapesplitQuadrangulation​(org.tinfour.common.IIncrementalTin triangulation) -
      Produces a quadrangulation from a triangulation, by splitting each triangle - into three quadrangles (using the Catmull and Clark technique).
      -
      static processing.core.PShapeurquhartFaces​(org.tinfour.common.IIncrementalTin triangulation, - boolean preservePerimeter) -
      Generates a shape consisting of polygonal faces of an Urquhart graph.
      -
      - -
      • -
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        urquhartFaces

        -
        public static processing.core.PShape urquhartFaces​(org.tinfour.common.IIncrementalTin triangulation,
-                                                   boolean preservePerimeter)
        -
        Generates a shape consisting of polygonal faces of an Urquhart graph. - An Urquhart graph is obtained by removing the longest edge from each triangle - in a triangulation. -

        - In practice this is a way to tessellate a shape into polygons (with the - resulting tessellation being in between a - triangulation and a - partition). -

        - Note that this method processes a Delaunay triangulation. Process a shape - using - delaunayTriangulationMesh() first and then feed it to this method. -

        - The Urquhart graph is a good approximation to the - relative - neighborhood graph (having only about 2% additional edges).

        -
        -
        Parameters:
        -
        triangulation - a triangulation mesh
        -
        preservePerimeter - whether to retain/preserve edges on the perimeter - even if they should be removed according to the - urquhart condition
        -
        Returns:
        -
        a GROUP PShape where each child shape is a single face
        -
        Since:
        -
        1.1.0
        -
        See Also:
        -
        gabrielFaces(IIncrementalTin, boolean)
        -
        -
        • -
      - - - -
        -
      • -

        gabrielFaces

        -
        public static processing.core.PShape gabrielFaces​(org.tinfour.common.IIncrementalTin triangulation,
-                                                  boolean preservePerimeter)
        -
        Generates a shape consisting of polygonal faces of a Gabriel graph. A - Gabriel graph is obtained by removing each edge E from a triangulation if a - vertex lies within a circle of diameter = length(E), centered on the midpoint - of E. -

        - In practice this is a way to tessellate a shape into polygons (with the - resulting tessellation being reminiscent of shattering the shape as if it - were glass). -

        - Note that this method processes a Delaunay triangulation. Process a shape - using - delaunayTriangulationMesh() first and then feed it to this method.

        -
        -
        Parameters:
        -
        triangulation - a triangulation mesh
        -
        preservePerimeter - whether to retain/preserve edges on the perimeter - even if they should be removed according to the - gabriel condition
        -
        Returns:
        -
        a GROUP PShape where each child shape is a single face
        -
        Since:
        -
        1.1.0
        -
        See Also:
        -
        urquhartFaces(IIncrementalTin, boolean)
        -
        -
        • -
      - - - -
        -
      • -

        relativeNeighborFaces

        -
        public static processing.core.PShape relativeNeighborFaces​(org.tinfour.common.IIncrementalTin triangulation,
-                                                           boolean preservePerimeter)
        -
        Generates a shape consisting of polygonal faces of a Relative neighborhood - graph (RNG). -

        - An RNG is obtained by removing each edge E from a triangulation if any vertex - is nearer to both vertices of E than the length of E. -

        - The RNG is a subgraph of the urquhart graph, having only slightly fewer edges.

        -
        -
        Parameters:
        -
        triangulation - a triangulation mesh
        -
        preservePerimeter - whether to retain/preserve edges on the perimeter - even if they should be removed according to the - relative neighbor condition
        -
        Returns:
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        spannerFaces

        -
        public static processing.core.PShape spannerFaces​(org.tinfour.common.IIncrementalTin triangulation,
-                                                  int k,
-                                                  boolean preservePerimeter)
        -
        Generates a shape consisting of polygonal faces formed by edges returned by a - greedy sparse spanner applied to a triangulation.
        -
        -
        Parameters:
        -
        triangulation - a triangulation mesh
        -
        k - the order of the spanner. Should be at least 1. - Higher numbers collapse more edges resulting in - larger faces, until a single face remains
        -
        preservePerimeter - whether to retain/preserve edges on the perimeter - even if they should be removed according to the - spanner condition
        -
        Returns:
        -
        a GROUP PShape where each child shape is a single face
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        dualFaces

        -
        public static processing.core.PShape dualFaces​(org.tinfour.common.IIncrementalTin triangulation)
        -
        Generates a (mesh-like) shape consisting of polygonal faces of the dual graph - of the given triangulation. -

        - In practice, the resulting dual mesh has hexagonal-like cells. -

        - Note that this method processes a Delaunay triangulation. Process a shape - using - delaunayTriangulationMesh() first and then feed it to this method. -

        - If the input has been generated from a PShape, consider generating the - triangulation with refinements > 1 for better dual mesh results.

        -
        -
        Parameters:
        -
        triangulation - a triangulation mesh
        -
        Returns:
        -
        a GROUP PShape where each child shape is a single face
        -
        Since:
        -
        1.2.0
        -
        -
        • -
      - - - -
        -
      • -

        splitQuadrangulation

        -
        public static processing.core.PShape splitQuadrangulation​(org.tinfour.common.IIncrementalTin triangulation)
        -
        Produces a quadrangulation from a triangulation, by splitting each triangle - into three quadrangles (using the Catmull and Clark technique). A - quadrangulation is a mesh where every face is a quadrangle. -

        - Since this method employs a very simple technique to produce a - quadrangulation, the result is poor-quality, containing many helix-like - structures (it's not at all "regular"). -

        - Note that this method processes a Delaunay triangulation. Process a shape - using - delaunayTriangulationMesh() first and then feed it to this method.

        -
        -
        Parameters:
        -
        triangulation - a triangulation mesh
        -
        Returns:
        -
        a GROUP PShape, where each child shape is one quadrangle
        -
        Since:
        -
        1.2.0
        -
        -
        • -
      - - - -
        -
      • -

        edgeCollapseQuadrangulation

        -
        public static processing.core.PShape edgeCollapseQuadrangulation​(org.tinfour.common.IIncrementalTin triangulation,
-                                                                 boolean preservePerimeter)
        -
        Generates a quadrangulation from a triangulation by selectively removing (or - "collapsing") the edges shared by neighboring triangles (via edge coloring). -

        - This method may be slow on large inputs (as measured by vertex count), owing - to the graph coloring it performs.

        -
        -
        Parameters:
        -
        triangulation - a triangulation mesh
        -
        preservePerimeter - whether to preserve the perimeter of the input - triangulation; when true, retains edges that lie on - the perimeter of the triangulation mesh that would - have otherwise been removed (this results in some - triangles being included in the output).
        -
        Returns:
        -
        a GROUP PShape, where each child shape is one quadrangle
        -
        Since:
        -
        1.2.0
        -
        -
        • -
      - - - -
        -
      • -

        centroidQuadrangulation

        -
        public static processing.core.PShape centroidQuadrangulation​(org.tinfour.common.IIncrementalTin triangulation,
-                                                             boolean preservePerimeter)
        -
        Generates a quadrangulation from a triangulation by "inverting" triangles - (for each triangle, create edges joining its centroid to each of its - vertices). -

        - This approach tends to create a denser quad mesh than - edgeCollapseQuadrangulation() on the same input.

        -
        -
        Parameters:
        -
        triangulation - a triangulation mesh
        -
        preservePerimeter - whether to preserve the perimeter of the input - triangulation; when true, retains edges that lie on - the perimeter of the triangulation mesh that would - have otherwise been removed (this results in some - triangles being included in the output).
        -
        Returns:
        -
        a GROUP PShape, where each child shape is one quadrangle
        -
        Since:
        -
        1.2.0
        -
        -
        • -
      - - - -
        -
      • -

        spiralQuadrangulation

        -
        public static processing.core.PShape spiralQuadrangulation​(List<processing.core.PVector> points)
        -
        Produces a quadrangulation from a point set. The resulting quadrangulation - has a characteristic spiral pattern.
        -
        -
        Parameters:
        -
        points -
        -
        Returns:
        -
        a GROUP PShape where each child shape is a single face
        -
        Since:
        -
        1.2.0
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/PGS_Morphology.html b/micycle/pgs/PGS_Morphology.html deleted file mode 100644 index 4c2ba262..00000000 --- a/micycle/pgs/PGS_Morphology.html +++ /dev/null @@ -1,1092 +0,0 @@ - - - - - -PGS_Morphology (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs
-

Class PGS_Morphology

-
-
- -
-
    -
  • -
    -
    public final class PGS_Morphology
-extends Object
    -
    Methods that affect the geometry or topology of shapes.
    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Summary

      - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
      All Methods Static Methods Concrete Methods 
      Modifier and TypeMethodDescription
      static processing.core.PShapebuffer​(processing.core.PShape shape, - double buffer) -
      Computes a rounded buffer area around the shape, having the given buffer - width.
      -
      static processing.core.PShapebuffer​(processing.core.PShape shape, - double buffer, - PGS_Contour.OffsetStyle bufferStyle) -
      Computes a buffer area around the shape, having the given buffer width and - buffer style (either round, miter, bevel).
      -
      static processing.core.PShapechaikinCut​(processing.core.PShape shape, - double ratio, - int iterations) -
      Smoothes a shape via iterated corner cutting (chaikin cutting).
      -
      static processing.core.PShapedilationErosion​(processing.core.PShape shape, - double buffer) -
      Applies a positive followed by a negative buffer (in a single operation), the - effect of which is small holes and gaps are filled in, while the general - structure of the shape is preserved.
      -
      static processing.core.PShapeerosionDilation​(processing.core.PShape shape, - double buffer) -
      Applies a negative followed by a positive buffer (in a single operation), the - effect of which is small edges/islands are removed, while the general - structure of the shape is preserved.
      -
      static processing.core.PShapefieldWarp​(processing.core.PShape shape, - double magnitude, - double noiseScale, - boolean densify) -
      Warps/perturbs a shape by displacing vertices according to a 2D noise vector - field.
      -
      static processing.core.PShapefieldWarp​(processing.core.PShape shape, - double magnitude, - double noiseScale, - double time, - boolean densify, - int noiseSeed) -
      Warps/perturbs a shape by displacing vertices according to a 2D noise vector - field.
      -
      static processing.core.PShapeinterpolate​(processing.core.PShape from, - processing.core.PShape to, - double interpolationFactor) -
      Generates an intermediate shape between two shapes by interpolating between - them.
      -
      static processing.core.PShapeinterpolate​(processing.core.PShape from, - processing.core.PShape to, - int frames) -
      Generates intermediate shapes (frames) between two shapes by interpolating - between them.
      -
      static processing.core.PShapeminkDifference​(processing.core.PShape source, - processing.core.PShape subtract) -
      Computes a Minkowski difference (a.k.a erosion) of the two source - shapes.
      -
      static processing.core.PShapeminkSum​(processing.core.PShape source, - processing.core.PShape addition) -
      Computes a Minkowski sum (a.k.a dilation) of the two source shapes.
      -
      static processing.core.PShaperadialWarp​(processing.core.PShape shape, - double magnitude, - double warpOffset, - boolean densify) -
      Warps/perturbs a shape by displacing vertices along a line between each - vertex and the shape centroid.
      -
      static processing.core.PShapereducePrecision​(processing.core.PShape shape, - double precision) -
      Reduces the precision of a shape, whilst ensuring the output shape is valid.
      -
      static processing.core.PShaperound​(processing.core.PShape shape, - double extent) -
      Rounds the corners of a shape by substituting a circular arc for each corner.
      -
      static processing.core.PShapesimplify​(processing.core.PShape shape, - double distanceTolerance) -
      Simplifies a shape using the Douglas-Peucker algorithm, reducing the - complexity and number of vertices of the shape.
      -
      static processing.core.PShapesimplifyDCE​(processing.core.PShape shape, - double removeFraction) -
      Simplifies a shape via Discrete Curve Evolution.
      -
      static processing.core.PShapesimplifyDCE​(processing.core.PShape shape, - int targetNumVertices) -
      Simplifies a shape via Discrete Curve Evolution.
      -
      static processing.core.PShapesimplifyTopology​(processing.core.PShape shape, - double distanceTolerance) -
      Simplifies a shape, whilst preserving the topological structure of the shape - (holes, etc.).
      -
      static processing.core.PShapesimplifyVW​(processing.core.PShape shape, - double distanceTolerance) -
      Simplifies a shape using the Visvalingam-Whyatt area-based algorithm, - reducing the complexity and number of vertices of the shape.
      -
      static processing.core.PShapesineWarp​(processing.core.PShape shape, - double magnitude, - int frequency, - double phase) -
      Warps/perturbs a shape by displacing vertices (both positively and - negatively) according to the magnitude of a sine wave which follows the shape - perimeter at some frequency.
      -
      static processing.core.PShapesmooth​(processing.core.PShape shape, - double alpha) -
      Smoothes a shape.
      -
      static processing.core.PShapesmoothGaussian​(processing.core.PShape shape, - double sigma) -
      Smoothes a shape by applying a gaussian filter to vertex coordinates.
      -
      static processing.core.PShapevariableBuffer​(processing.core.PShape shape, - double startDistance, - double endDistance) -
      Buffers a shape with a varying buffer distance (interpolated between a start - distance and an end distance) along the shape's perimeter.
      -
      - -
      • -
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        buffer

        -
        public static processing.core.PShape buffer​(processing.core.PShape shape,
-                                            double buffer)
        -
        Computes a rounded buffer area around the shape, having the given buffer - width.
        -
        -
        Parameters:
        -
        shape -
        -
        buffer - extent/width of the buffer (which may be positive or negative)
        -
        Returns:
        -
        a polygonal shape representing the buffer region (which may be empty)
        -
        See Also:
        -
        buffer(PShape, double, OffsetStyle)
        -
        -
        • -
      - - - -
        -
      • -

        buffer

        -
        public static processing.core.PShape buffer​(processing.core.PShape shape,
-                                            double buffer,
-                                            PGS_Contour.OffsetStyle bufferStyle)
        -
        Computes a buffer area around the shape, having the given buffer width and - buffer style (either round, miter, bevel).
        -
        -
        Parameters:
        -
        shape -
        -
        buffer - extent/width of the buffer (which may be positive or negative)
        -
        Returns:
        -
        a polygonal shape representing the buffer region (which may be empty)
        -
        Since:
        -
        1.3.0
        -
        See Also:
        -
        buffer(PShape, double)
        -
        -
        • -
      - - - -
        -
      • -

        variableBuffer

        -
        public static processing.core.PShape variableBuffer​(processing.core.PShape shape,
-                                                    double startDistance,
-                                                    double endDistance)
        -
        Buffers a shape with a varying buffer distance (interpolated between a start - distance and an end distance) along the shape's perimeter.
        -
        -
        Parameters:
        -
        shape - a single polygon or lineal shape
        -
        startDistance - the starting buffer amount
        -
        endDistance - the terminating buffer amount
        -
        Returns:
        -
        a polygonal shape representing the variable buffer region (which may - beempty)
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        erosionDilation

        -
        public static processing.core.PShape erosionDilation​(processing.core.PShape shape,
-                                                     double buffer)
        -
        Applies a negative followed by a positive buffer (in a single operation), the - effect of which is small edges/islands are removed, while the general - structure of the shape is preserved. -

        - This operation is known as "opening" in computer vision.

        -
        -
        Parameters:
        -
        shape - polygonal shape
        -
        buffer - a positive number
        -
        Returns:
        -
        See Also:
        -
        dilationErosion(PShape, double)
        -
        -
        • -
      - - - -
        -
      • -

        dilationErosion

        -
        public static processing.core.PShape dilationErosion​(processing.core.PShape shape,
-                                                     double buffer)
        -
        Applies a positive followed by a negative buffer (in a single operation), the - effect of which is small holes and gaps are filled in, while the general - structure of the shape is preserved. -

        - This operation is known as "closing" in computer vision.

        -
        -
        Parameters:
        -
        shape - polygonal shape
        -
        buffer - a positive number
        -
        Returns:
        -
        Since:
        -
        1.3.0
        -
        See Also:
        -
        erosionDilation(PShape, double)
        -
        -
        • -
      - - - -
        -
      • -

        simplify

        -
        public static processing.core.PShape simplify​(processing.core.PShape shape,
-                                              double distanceTolerance)
        -
        Simplifies a shape using the Douglas-Peucker algorithm, reducing the - complexity and number of vertices of the shape. -

        - During the process shapes can be split, collapse to lines or disappear. Holes - can be created or disappear.

        -
        -
        Parameters:
        -
        shape -
        -
        distanceTolerance - the tolerance to use
        -
        Returns:
        -
        simplifed copy of the shape
        -
        See Also:
        -
        simplifyVW(PShape, double), -simplifyTopology(PShape, double)
        -
        -
        • -
      - - - -
        -
      • -

        simplifyVW

        -
        public static processing.core.PShape simplifyVW​(processing.core.PShape shape,
-                                                double distanceTolerance)
        -
        Simplifies a shape using the Visvalingam-Whyatt area-based algorithm, - reducing the complexity and number of vertices of the shape.
        -
        -
        Parameters:
        -
        shape -
        -
        distanceTolerance - The simplification tolerance is specified as a - distance.This is converted to an area tolerance by - squaring it.
        -
        Returns:
        -
        simplifed copy of the shape
        -
        See Also:
        -
        simplify(PShape, double), -simplifyTopology(PShape, double)
        -
        -
        • -
      - - - -
        -
      • -

        simplifyTopology

        -
        public static processing.core.PShape simplifyTopology​(processing.core.PShape shape,
-                                                      double distanceTolerance)
        -
        Simplifies a shape, whilst preserving the topological structure of the shape - (holes, etc.).
        -
        -
        Parameters:
        -
        shape -
        -
        distanceTolerance - the tolerance to use
        -
        Returns:
        -
        simplifed copy of the shape
        -
        See Also:
        -
        simplify(PShape, double), -simplifyVW(PShape, double)
        -
        -
        • -
      - - - -
        -
      • -

        simplifyDCE

        -
        public static processing.core.PShape simplifyDCE​(processing.core.PShape shape,
-                                                 double removeFraction)
        -
        Simplifies a shape via Discrete Curve Evolution. -

        - Discrete curve evolution involves a stepwise elimination of kinks that are - least relevant to the shape of the polygonal curve. The relevance of kinks is - intended to reflect their contribution to the overall shape of the polygonal - curve.

        -
        -
        Parameters:
        -
        shape - a polygonal (can include holes) or lineal shape. GROUP - shapes are not supported.
        -
        removeFraction - the fraction of least relevant kinks/vertices to remove - (per ring). 0...1
        -
        Returns:
        -
        simplifed copy of the input shape
        -
        Since:
        -
        1.3.0
        -
        See Also:
        -
        simplifyDCE(PShape, int)
        -
        -
        • -
      - - - -
        -
      • -

        simplifyDCE

        -
        public static processing.core.PShape simplifyDCE​(processing.core.PShape shape,
-                                                 int targetNumVertices)
        -
        Simplifies a shape via Discrete Curve Evolution. -

        - Discrete curve evolution involves a stepwise elimination of kinks that are - least relevant to the shape of the polygonal curve. The relevance of kinks is - intended to reflect their contribution to the overall shape of the polygonal - curve.

        -
        -
        Parameters:
        -
        shape - a polygonal (can include holes) or lineal shape. - GROUP shapes are not supported.
        -
        targetNumVertices - the number of vertices that should remain/be - preserved in each ring of the input
        -
        Returns:
        -
        simplifed copy of the input shape
        -
        Since:
        -
        1.3.0
        -
        See Also:
        -
        simplifyDCE(PShape, double)
        -
        -
        • -
      - - - -
        -
      • -

        minkSum

        -
        public static processing.core.PShape minkSum​(processing.core.PShape source,
-                                             processing.core.PShape addition)
        -
        Computes a Minkowski sum (a.k.a dilation) of the two source shapes. - The addition shape should probably be centered on (0,0) for best - results. -

        - To instill you with intuition of what a Minkowski sum looks like, here are a - few examples: -

          -
        • The sum of any shape and a point is that shape translated by that point. -
        • The sum of any shape and two points is two translated (possibly - overlapping) copies of that shape. -
        • The sum of two circles is a larger circle (sum the radii) with its centre - at the sum of the centres of the smaller circles. -
        • The sum of any shape and a line is that shape swept through that line. - Think of placing your shape in sand, and dragging it along the line. -
        • Similarly, the sum of a shape and any curve is what you’d get by sweeping - the shape through the curve. -
        • The sum of two parallel lines is a longer line. -
        • For perpendicular lines, you get a square.
          • -
        -
        -
        Returns:
        -
        shape representing the Minkowski sum of source+addition
        -
        See Also:
        -
        minkDifference(PShape, PShape)
        -
        -
        • -
      - - - -
        -
      • -

        minkDifference

        -
        public static processing.core.PShape minkDifference​(processing.core.PShape source,
-                                                    processing.core.PShape subtract)
        -
        Computes a Minkowski difference (a.k.a erosion) of the two source - shapes. The subtract shape should probably be centered on (0,0) - for best results.
        -
        -
        Returns:
        -
        shape representing the Minkowski difference of source-subtract
        -
        See Also:
        -
        minkSum(PShape, PShape)
        -
        -
        • -
      - - - -
        -
      • -

        smooth

        -
        public static processing.core.PShape smooth​(processing.core.PShape shape,
-                                            double alpha)
        -
        Smoothes a shape. The smoothing algorithm inserts new vertices which are - positioned using Bezier splines. The output shape tends to be a little larger - than the input.
        -
        -
        Parameters:
        -
        shape - shape to smooth
        -
        alpha - curvedness parameter (0 is linear, 1 is round, >1 is - increasingly curved)
        -
        Returns:
        -
        smoothed copy of the shape
        -
        See Also:
        -
        smoothGaussian(PShape, double)
        -
        -
        • -
      - - - -
        -
      • -

        smoothGaussian

        -
        public static processing.core.PShape smoothGaussian​(processing.core.PShape shape,
-                                                    double sigma)
        -
        Smoothes a shape by applying a gaussian filter to vertex coordinates. At - larger values, this morphs the input shape much more visually than - smooth().
        -
        -
        Parameters:
        -
        shape - the shape to smooth
        -
        sigma - The standard deviation of the gaussian kernel. Larger values - provide more smoothing.
        -
        Returns:
        -
        smoothed copy of the shape
        -
        See Also:
        -
        smooth(PShape, double)
        -
        -
        • -
      - - - -
        -
      • -

        round

        -
        public static processing.core.PShape round​(processing.core.PShape shape,
-                                           double extent)
        -
        Rounds the corners of a shape by substituting a circular arc for each corner. - Each corner is rounded in proportion to the smallest length of its 2 - constituent lines.
        -
        -
        Parameters:
        -
        shape -
        -
        extent - 0...1 (where 0 is no rounding, and 1 is the maximum rounding - whilst keeping shape valid). Values greater than 1 are allowed - by output undefined results.
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        chaikinCut

        -
        public static processing.core.PShape chaikinCut​(processing.core.PShape shape,
-                                                double ratio,
-                                                int iterations)
        -
        Smoothes a shape via iterated corner cutting (chaikin cutting). More - iterations results in more smoothing.
        -
        -
        Parameters:
        -
        shape -
        -
        ratio - Between 0...1. Determines how far along each edge to - perform the cuts. 0 is no cutting; 1 is maximal cutting - (cut at the midpoint of each edge).
        -
        iterations - number of cutting iterations/recursions to perform. A value - of 1 simply cuts the corners; higher values effectively - smooth the cut. Values greater than ~10 generally have no - additional effect.
        -
        Returns:
        -
        a cut copy of the input shape
        -
        Since:
        -
        1.1.0
        -
        -
        • -
      - - - -
        -
      • -

        radialWarp

        -
        public static processing.core.PShape radialWarp​(processing.core.PShape shape,
-                                                double magnitude,
-                                                double warpOffset,
-                                                boolean densify)
        -
        Warps/perturbs a shape by displacing vertices along a line between each - vertex and the shape centroid. - -

        - Inputs may be densified before warping.

        -
        -
        Parameters:
        -
        shape - a polygonal shape
        -
        magnitude - magnitude of the displacement. The value defines the - maximum euclidean displacement of a vertex compared to the - shape centroid
        -
        warpOffset - offset angle that determines at which angle to begin the - displacement.
        -
        densify - whether to densify the shape (using distance=1) before - warping. When true, shapes with long edges will undergo - warping along the whole edge (rather than only at the - original vertices).
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        sineWarp

        -
        public static processing.core.PShape sineWarp​(processing.core.PShape shape,
-                                              double magnitude,
-                                              int frequency,
-                                              double phase)
        -
        Warps/perturbs a shape by displacing vertices (both positively and - negatively) according to the magnitude of a sine wave which follows the shape - perimeter at some frequency.
        -
        -
        Parameters:
        -
        shape - single polygonal shape
        -
        magnitude - maxiumum perpendicular displacement along the shape - perimeter
        -
        frequency - sine wave frequency
        -
        phase - sine wave phase. corresponds to the fraction (0...1) around - the shape perimeter where the wave starts (0 displacement).
        -
        Returns:
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        fieldWarp

        -
        public static processing.core.PShape fieldWarp​(processing.core.PShape shape,
-                                               double magnitude,
-                                               double noiseScale,
-                                               boolean densify)
        -
        Warps/perturbs a shape by displacing vertices according to a 2D noise vector - field. -

        - Inputs may be densified before warping.

        -
        -
        Parameters:
        -
        shape - a polygonal shape
        -
        magnitude - magnitude of the displacement (acting as noise value - multiplier). The value defines the maximum displacement of - a vertex in the both x and y axes.
        -
        noiseScale - the scale of the 2D noise vector field. This affects how of - the coarseness of warping. Smaller values (~0.2) lead to - more fine warping (at edges), whereas larger values (~2) - affect the shape geometry at a larger scale.
        -
        densify - whether to densify the shape (using distance=1) before - warping. When true, shapes with long edges will undergo - warping along the whole edge (rather than only at the - original vertices).
        -
        Returns:
        -
        See Also:
        -
        fieldWarp(PShape, double, double, double, boolean, int)
        -
        -
        • -
      - - - -
        -
      • -

        fieldWarp

        -
        public static processing.core.PShape fieldWarp​(processing.core.PShape shape,
-                                               double magnitude,
-                                               double noiseScale,
-                                               double time,
-                                               boolean densify,
-                                               int noiseSeed)
        -
        Warps/perturbs a shape by displacing vertices according to a 2D noise vector - field. -

        - Inputs may be densified before warping for more finely-grained warping.

        -
        -
        Parameters:
        -
        shape - a polygonal shape
        -
        magnitude - magnitude of the displacement (acting as noise value - multiplier). The value defines the maximum displacement of - a vertex in the both x and y axes.
        -
        noiseScale - the scale of the 2D noise vector field. This affects how of - the coarseness of warping. Smaller values (~0.2) lead to - more fine warping (at edges), whereas larger values (~2) - affect the shape geometry at a larger scale.
        -
        time - used to offset the underlying noise field and hence animate - the warping over time
        -
        densify - whether to densify the shape (using distance=1) before - warping. When true, shapes with long edges will undergo - warping along the whole edge (rather than only at the - original vertices).
        -
        noiseSeed - a seed to pass to the underlying noise generator
        -
        Returns:
        -
        See Also:
        -
        fieldWarp(PShape, double, double, boolean)
        -
        -
        • -
      - - - -
        -
      • -

        interpolate

        -
        public static processing.core.PShape interpolate​(processing.core.PShape from,
-                                                 processing.core.PShape to,
-                                                 double interpolationFactor)
        -
        Generates an intermediate shape between two shapes by interpolating between - them. This process has many names: shape morphing / blending / averaging / - tweening / interpolation. -

        - The underlying technique rotates one of the shapes to minimise the total - distance between each shape's vertices, then performs linear interpolation - between vertices. This performs well in practice but the outcome worsens as - shapes become more concave; more sophisticated techniques would employ some - level of rigidity preservation.

        -
        -
        Parameters:
        -
        from - a single polygon; the shape we want to morph from
        -
        to - a single polygon; the shape we want to morph - from into
        -
        interpolationFactor - between 0...1
        -
        Returns:
        -
        a polygonal PShape
        -
        Since:
        -
        1.2.0
        -
        See Also:
        -
        interpolate(PShape, PShape, int)
        -
        -
        • -
      - - - -
        -
      • -

        interpolate

        -
        public static processing.core.PShape interpolate​(processing.core.PShape from,
-                                                 processing.core.PShape to,
-                                                 int frames)
        -
        Generates intermediate shapes (frames) between two shapes by interpolating - between them. This process has many names: shape morphing / blending / - averaging / tweening / interpolation. -

        - This method is faster than calling - interpolate() repeatedly for - different interpolation factors.

        -
        -
        Parameters:
        -
        from - a single polygon; the shape we want to morph from
        -
        to - a single polygon; the shape we want to morph from - into
        -
        frames - the number of frames (including first and last) to generate. >= - 2
        -
        Returns:
        -
        a GROUP PShape, where each child shape is a frame from the - interpolation
        -
        Since:
        -
        1.3.0
        -
        See Also:
        -
        interpolate(PShape, PShape, double)
        -
        -
        • -
      - - - -
        -
      • -

        reducePrecision

        -
        public static processing.core.PShape reducePrecision​(processing.core.PShape shape,
-                                                     double precision)
        -
        Reduces the precision of a shape, whilst ensuring the output shape is valid. -

        - This method effectively rounds vertices to the nearest value given by - precision.

        -
        -
        Parameters:
        -
        shape - shape to reduce
        -
        precision - the exact grid size with which to round shape vertices. - shoule be non-zero and positive
        -
        Returns:
        -
        reduced copy of input
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/PGS_Optimisation.html b/micycle/pgs/PGS_Optimisation.html deleted file mode 100644 index a714b06d..00000000 --- a/micycle/pgs/PGS_Optimisation.html +++ /dev/null @@ -1,762 +0,0 @@ - - - - - -PGS_Optimisation (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs
-

Class PGS_Optimisation

-
-
- -
-
    -
  • -
    -
    public final class PGS_Optimisation
-extends Object
    -
    Solve geometric optimisation problems, such as bounding volumes, inscribed - areas, optimal distances, etc.
    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Summary

      - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
      All Methods Static Methods Concrete Methods 
      Modifier and TypeMethodDescription
      static processing.core.PVectorclosestPoint​(processing.core.PShape shape, - processing.core.PVector point) -
      Returns the nearest point of the shape to the given point.
      -
      static List<processing.core.PVector>closestPointPair​(Collection<processing.core.PVector> points) -
      Computes the closest pair of points in a set of points.
      -
      static List<processing.core.PVector>closestPoints​(processing.core.PShape shape, - processing.core.PVector point) -
      Returns the nearest point for each "island" / separate polygon in the GROUP - input shape.
      -
      static processing.core.PShapeenvelope​(processing.core.PShape shape) -
      Computes the shape's envelope (bounding box).
      -
      static List<processing.core.PVector>farthestPointPair​(Collection<processing.core.PVector> points) -
      Computes the farthest pair of points (the "diametral pair") in a set of n - points.
      -
      static processing.core.PShapehilbertSortFaces​(processing.core.PShape mesh) -
      Sorts the faces/child shapes of a GROUP shape according to hilbert curve - index of each face's centroid coordinate.
      -
      static processing.core.PShapelargestEmptyCircle​(processing.core.PShape obstacles, - double tolerance) -
      Constructs the Largest Empty Circle for a set of obstacle geometries, up to a - specified tolerance.
      -
      static processing.core.PShapemaximumInscribedAARectangle​(processing.core.PShape shape, - boolean fast) -
      Finds the rectangle with a maximum area whose sides are parallel to the - x-axis and y-axis ("axis-aligned"), contained within a convex shape.
      -
      static processing.core.PShapemaximumInscribedCircle​(processing.core.PShape shape, - double tolerance) -
      The Maximum Inscribed Circle is determined by a point in the interior of the - area which has the farthest distance from the area boundary, along with a - boundary point at that distance.
      -
      static processing.core.PShapemaximumInscribedCircle​(processing.core.PShape shape, - processing.core.PVector centerPoint) -
      Return the maximum circle (at a given centerpoint inside/outside the circle)
      -
      static processing.core.PShapemaximumInscribedRectangle​(processing.core.PShape shape) -
      Finds an approximate largest area rectangle (of arbitrary orientation) - contained within a polygon.
      -
      static processing.core.PShapeminimumBoundingCircle​(processing.core.PShape shape) -
      Computes the Minimum Bounding Circle (MBC) for the points in a Geometry.
      -
      static processing.core.PShapeminimumBoundingEllipse​(processing.core.PShape shape, - double errorTolerance) -
      Computes the minimum bounding ellipse that encloses a shape.
      -
      static processing.core.PShapeminimumBoundingRectangle​(processing.core.PShape shape) -
      Computes the minimum bounding rectangle that encloses a shape.
      -
      static processing.core.PShapeminimumBoundingTriangle​(processing.core.PShape shape) -
      Computes the minimum-area bounding triangle that encloses a shape.
      -
      static processing.core.PShapeminimumDiameter​(processing.core.PShape shape) -
      Computes the minimum diameter of a shape.
      -
      static processing.core.PVectorsolveApollonius​(processing.core.PVector c1, - processing.core.PVector c2, - processing.core.PVector c3, - int s1, - int s2, - int s3) -
      Solves the Problem of Apollonius (finding a circle tangent to three other - circles in the plane).
      -
      - -
      • -
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        envelope

        -
        public static processing.core.PShape envelope​(processing.core.PShape shape)
        -
        Computes the shape's envelope (bounding box). The vertices of the output - PShape begin at the top-left corner of the envelope and are arranged - counter-clockwise.
        -
        -
        Parameters:
        -
        shape - a rectangular shape that covers/bounds the input
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        maximumInscribedCircle

        -
        public static processing.core.PShape maximumInscribedCircle​(processing.core.PShape shape,
-                                                            double tolerance)
        -
        The Maximum Inscribed Circle is determined by a point in the interior of the - area which has the farthest distance from the area boundary, along with a - boundary point at that distance.
        -
        -
        Parameters:
        -
        shape -
        -
        tolerance - the distance tolerance for computing the centre point - (around 1)
        -
        -
        • -
      - - - -
        -
      • -

        maximumInscribedCircle

        -
        public static processing.core.PShape maximumInscribedCircle​(processing.core.PShape shape,
-                                                            processing.core.PVector centerPoint)
        -
        Return the maximum circle (at a given centerpoint inside/outside the circle)
        -
        -
        Parameters:
        -
        shape -
        -
        centerPoint -
        -
        Returns:
        -
        A circular PShape
        -
        -
        • -
      - - - -
        -
      • -

        maximumInscribedRectangle

        -
        public static processing.core.PShape maximumInscribedRectangle​(processing.core.PShape shape)
        -
        Finds an approximate largest area rectangle (of arbitrary orientation) - contained within a polygon.
        -
        -
        Parameters:
        -
        shape -
        -
        Returns:
        -
        a rectangle shape
        -
        See Also:
        -
        maximumInscribedAARectangle() - the largest axis-aligned rectangle
        -
        -
        • -
      - - - -
        -
      • -

        maximumInscribedAARectangle

        -
        public static processing.core.PShape maximumInscribedAARectangle​(processing.core.PShape shape,
-                                                                 boolean fast)
        -
        Finds the rectangle with a maximum area whose sides are parallel to the - x-axis and y-axis ("axis-aligned"), contained within a convex shape. -

        - This method computes the MIR for convex shapes only; if a concave shape is - passed in, the resulting rectangle will be computed based on its convex hull. -

        - This method uses a brute force algorithm to perform an exhaustive search for - a solution (therefore it is slow relative to other - PGS_Optimisation methods).

        -
        -
        Parameters:
        -
        shape -
        -
        fast - whether to compute MIR based on a lower resolution input. When - true, processing is ~6 times faster but potentially a little - inaccurate
        -
        Returns:
        -
        a rectangle shape
        -
        Since:
        -
        1.3.0
        -
        See Also:
        -
        maximumInscribedRectangle() -- the - largest rectangle of arbitrary orientation
        -
        -
        • -
      - - - -
        -
      • -

        minimumBoundingCircle

        -
        public static processing.core.PShape minimumBoundingCircle​(processing.core.PShape shape)
        -
        Computes the Minimum Bounding Circle (MBC) for the points in a Geometry. The - MBC is the smallest circle which covers all the vertices of the input shape - (this is also known as the Smallest Enclosing Circle). This is equivalent to - computing the Maximum Diameter of the input vertex set.
        -
        • -
      - - - -
        -
      • -

        minimumBoundingRectangle

        -
        public static processing.core.PShape minimumBoundingRectangle​(processing.core.PShape shape)
        -
        Computes the minimum bounding rectangle that encloses a shape. Unlike the - envelope for a shape, the rectangle returned by this method can have any - orientation (it's not axis-aligned).
        -
        -
        Parameters:
        -
        shape -
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        minimumBoundingEllipse

        -
        public static processing.core.PShape minimumBoundingEllipse​(processing.core.PShape shape,
-                                                            double errorTolerance)
        -
        Computes the minimum bounding ellipse that encloses a shape.
        -
        -
        Parameters:
        -
        shape -
        -
        errorTolerance - Mean-squared error tolerance (this value does not - correspond to a pixel distance). 0.001 to 0.01 - recommended. Higher values are a looser (yet quicker) - fit.
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        minimumBoundingTriangle

        -
        public static processing.core.PShape minimumBoundingTriangle​(processing.core.PShape shape)
        -
        Computes the minimum-area bounding triangle that encloses a shape.
        -
        -
        Parameters:
        -
        shape -
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        minimumDiameter

        -
        public static processing.core.PShape minimumDiameter​(processing.core.PShape shape)
        -
        Computes the minimum diameter of a shape. -

        - The minimum diameter is defined to be the width of the smallest band that - contains the shape, where a band is a strip of the plane defined by two - parallel lines. This can be thought of as the smallest hole that the geometry - can bemoved through, with a single rotation.

        -
        -
        Parameters:
        -
        shape -
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        largestEmptyCircle

        -
        public static processing.core.PShape largestEmptyCircle​(processing.core.PShape obstacles,
-                                                        double tolerance)
        -
        Constructs the Largest Empty Circle for a set of obstacle geometries, up to a - specified tolerance. Valid obstacles are point and line shapes (such as a - POINTS PShape). -

        - The Largest Empty Circle is the largest circle which has its center in the - convex hull of the obstacles (the boundary), and whose interior does not - intersect with any obstacle. The circle center is the point in the interior - of the boundary which has the farthest distance from the obstacles (up to - tolerance).

        -
        -
        Parameters:
        -
        obstacles - a shape representing the obstacles (points and lines)
        -
        tolerance - the distance tolerance for computing the circle center point
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        closestPoint

        -
        public static processing.core.PVector closestPoint​(processing.core.PShape shape,
-                                                   processing.core.PVector point)
        -
        Returns the nearest point of the shape to the given point. If the shape is - has multiple children/geometries (a GROUP shape), the single closest point is - returned.
        -
        -
        Parameters:
        -
        shape -
        -
        point -
        -
        Returns:
        -
        See Also:
        -
        closestPoints(PShape, PVector)
        -
        -
        • -
      - - - -
        -
      • -

        closestPoints

        -
        public static List<processing.core.PVector> closestPoints​(processing.core.PShape shape,
-                                                          processing.core.PVector point)
        -
        Returns the nearest point for each "island" / separate polygon in the GROUP - input shape.
        -
        -
        Parameters:
        -
        shape - a GROUP shape
        -
        point -
        -
        Returns:
        -
        list of closest points for each child shape. Output is identical to - closestPoint(PShape, PVector) if the input shape is a single - polygon
        -
        See Also:
        -
        closestPoint(PShape, PVector)
        -
        -
        • -
      - - - -
        -
      • -

        closestPointPair

        -
        public static List<processing.core.PVector> closestPointPair​(Collection<processing.core.PVector> points)
        -
        Computes the closest pair of points in a set of points. This method runs in - O(n*log(n)), rather than the naive O(n*n) brute-force approach.
        -
        -
        Parameters:
        -
        points - a set of 2D points, represented by PVectors
        -
        Returns:
        -
        a List containing exactly two elements which are the closest - pair of points among those in the set.
        -
        Since:
        -
        1.1.0
        -
        See Also:
        -
        farthestPointPair(Collection)
        -
        -
        • -
      - - - -
        -
      • -

        farthestPointPair

        -
        public static List<processing.core.PVector> farthestPointPair​(Collection<processing.core.PVector> points)
        -
        Computes the farthest pair of points (the "diametral pair") in a set of n - points. -

        - This method runs in O(n*log(n)), rather than the naive O(n*n) brute-force - approach. However, it must first compute the convex hull of the point set, so - there is more overhead; on small datasets, the brute-force approach is likely - faster).

        -
        -
        Parameters:
        -
        points - a set of 2D points, represented by PVectors
        -
        Returns:
        -
        a List containing exactly two elements which are the - farthest pair of points among those in the set.
        -
        Since:
        -
        1.1.0
        -
        See Also:
        -
        closestPointPair(Collection), -closestPoints(PShape, PVector)
        -
        -
        • -
      - - - -
        -
      • -

        hilbertSortFaces

        -
        public static processing.core.PShape hilbertSortFaces​(processing.core.PShape mesh)
        -
        Sorts the faces/child shapes of a GROUP shape according to hilbert curve - index of each face's centroid coordinate. This ensures that nearby faces have - a similar index in the list of children.
        -
        -
        Parameters:
        -
        mesh - group shape
        -
        Returns:
        -
        a copy of the input shape, having the same faces/child shapes in a - different order
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        solveApollonius

        -
        public static processing.core.PVector solveApollonius​(processing.core.PVector c1,
-                                                      processing.core.PVector c2,
-                                                      processing.core.PVector c3,
-                                                      int s1,
-                                                      int s2,
-                                                      int s3)
        -
        Solves the Problem of Apollonius (finding a circle tangent to three other - circles in the plane). Circles are represented by PVectors, where the z - coordinate is interpreted as radius.
        -
        -
        Parameters:
        -
        c1 - One of the circles in the problem
        -
        c2 - One of the circles in the problem
        -
        c3 - One of the circles in the problem
        -
        s1 - An indication if the solution should be externally or internally - tangent (+1/-1) to c1
        -
        s2 - An indication if the solution should be externally or internally - tangent (+1/-1) to c2
        -
        s3 - An indication if the solution should be externally or internally - tangent (+1/-1) to c3
        -
        Returns:
        -
        The circle (as a PVector) that is tangent to c1, c2 and c3.
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/PGS_PointSet.html b/micycle/pgs/PGS_PointSet.html deleted file mode 100644 index dfe20646..00000000 --- a/micycle/pgs/PGS_PointSet.html +++ /dev/null @@ -1,1261 +0,0 @@ - - - - - -PGS_PointSet (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs
-

Class PGS_PointSet

-
-
- -
-
    -
  • -
    -
    public final class PGS_PointSet
-extends Object
    -
    Generation of random sets of 2D points having a variety of different - distributions and constraints (and associated functions).
    -
    -
    Since:
    -
    1.2.0
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Summary

      - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
      All Methods Static Methods Concrete Methods 
      Modifier and TypeMethodDescription
      static List<processing.core.PVector>gaussian​(double centerX, - double centerY, - double sd, - int n) -
      Generates a set of random points having a gaussian/normal distribution.
      -
      static List<processing.core.PVector>gaussian​(double centerX, - double centerY, - double sd, - int n, - long seed) -
      Generates a set of random points having a gaussian/normal distribution, using - the specified seed.
      -
      static List<processing.core.PVector>haltonLDS​(double xMin, - double yMin, - double xMax, - double yMax, - int n) -
      Generates a set of deterministic stratified points (bounded by a rectangle) - from a low discrepancy sequence (LDS) based on a Halton sequence.
      -
      static List<processing.core.PVector>hammersleyLDS​(double xMin, - double yMin, - double xMax, - double yMax, - int n) -
      Generates a set of deterministic stratified points (bounded by a rectangle) - from a low discrepancy sequence (LDS) based on a Hammersley sequence.
      -
      static List<processing.core.PVector>hexagon​(double centerX, - double centerY, - int length, - double distance) -
      Generates a hexagonal grid of points arranged in a hexagon pattern.
      -
      static List<processing.core.PVector>hexGrid​(double xMin, - double yMin, - double xMax, - double yMax, - double pointDistance) -
      Generates a hexagon grid of points that lie within a bounding rectangle.
      -
      static List<processing.core.PVector>hexGrid​(double xMin, - double yMin, - double xMax, - double yMax, - int n) -
      Generates a hexagon grid/lattice of points that lie within a bounding - rectangle.
      -
      static List<processing.core.PVector>hilbertSort​(List<processing.core.PVector> points) -
      Sorts a list of points according to the Hilbert space-filling curve to ensure - a high-degree of spatial locality in the sequence of points.
      -
      static processing.core.PShapeminimumSpanningTree​(List<processing.core.PVector> points) -
      Computes the Euclidean minimum spanning tree (EMST) of a set of - points.
      -
      static List<processing.core.PVector>nRooksLDS​(double xMin, - double yMin, - double xMax, - double yMax, - int n) -
      Generates a set of random stratified points (bounded by a rectangle) based on - the "N-Rooks" sampling pattern.
      -
      static List<processing.core.PVector>nRooksLDS​(double xMin, - double yMin, - double xMax, - double yMax, - int n, - long seed) -
      Generates a set of random stratified points (bounded by a rectangle) based on - the "N-Rooks" sampling pattern.
      -
      static List<processing.core.PVector>phyllotaxis​(double centerX, - double centerY, - int n, - double radius) -
      Generates a set of points arranged in a phyllotaxis pattern (an arrangement - similar to the florets in the head of a sunflower), using the golden ratio - (the most irrational number) to position points with the least possible - aliasing (which is arguably the "best" arrangement).
      -
      static List<processing.core.PVector>phyllotaxis​(double centerX, - double centerY, - int n, - double radius, - double theta) -
      Generates a set of points arranged in a phyllotaxis pattern (an arrangement - similar to the florets in the head of a sunflower), using a user-defined - theta.
      -
      static List<processing.core.PVector>plasticJitteredLDS​(double xMin, - double yMin, - double xMax, - double yMax, - int n) -
      Generates a set of deterministic stratified points (bounded by a rectangle) - from a low discrepancy sequence (LDS) based on an irrational number.
      -
      static List<processing.core.PVector>plasticJitteredLDS​(double xMin, - double yMin, - double xMax, - double yMax, - int n, - long seed) -
      Generates a set of deterministic stratified points (bounded by a rectangle) - from a low discrepancy sequence (LDS) based on an irrational number.
      -
      static List<processing.core.PVector>plasticLDS​(double xMin, - double yMin, - double xMax, - double yMax, - int n) -
      Generates a set of deterministic stratified points (bounded by a rectangle) - from a low discrepancy sequence (LDS) based on an irrational number (the - plastic constant).
      -
      static List<processing.core.PVector>poisson​(double xMin, - double yMin, - double xMax, - double yMax, - double minDist) -
      Generates a set of random points (constrained within a rectangular region) - via Poisson Disk Sampling.
      -
      static List<processing.core.PVector>poisson​(double xMin, - double yMin, - double xMax, - double yMax, - double minDist, - long seed) -
      Generates a set of random points (constrained within a rectangular region) - via Poisson Disk Sampling, using the specified seed.
      -
      static List<processing.core.PVector>poissonN​(double xMin, - double yMin, - double xMax, - double yMax, - int n, - long seed) -
      Generates a poisson point set having N points constrained within a - rectangular region.
      -
      static List<processing.core.PVector>prunePointsWithinDistance​(List<processing.core.PVector> points, - double distanceTolerance) -
      Returns a filtered copy of the input, containing no points that are within - the distanceTolerance of each other.
      -
      static List<processing.core.PVector>random​(double xMin, - double yMin, - double xMax, - double yMax, - int n) -
      Generates a set of random (uniform) points that lie within a bounding - rectangle.
      -
      static List<processing.core.PVector>random​(double xMin, - double yMin, - double xMax, - double yMax, - int n, - long seed) -
      Generates a set of random (uniform) points that lie within a bounding - rectangle, using the specified seed.
      -
      static List<processing.core.PVector>ring​(double centerX, - double centerY, - double innerRadius, - double outerRadius, - double maxAngle, - int n) -
      Generates a set of points that are randomly distribted on a ring.
      -
      static List<processing.core.PVector>ring​(double centerX, - double centerY, - double innerRadius, - double outerRadius, - double maxAngle, - int n, - long seed) -
      Generates a set of points that are randomly distribted on a ring.
      -
      static List<processing.core.PVector>squareGrid​(double xMin, - double yMin, - double xMax, - double yMax, - double pointDistance) -
      Generates a square grid/lattice of points that lie within a bounding - rectangle.
      -
      - -
      • -
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        prunePointsWithinDistance

        -
        public static List<processing.core.PVector> prunePointsWithinDistance​(List<processing.core.PVector> points,
-                                                                      double distanceTolerance)
        -
        Returns a filtered copy of the input, containing no points that are within - the distanceTolerance of each other.
        -
        -
        Parameters:
        -
        points - list of points to filter
        -
        distanceTolerance - a point that is within this distance of a previously - included point is not included in the output
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        hilbertSort

        -
        public static List<processing.core.PVector> hilbertSort​(List<processing.core.PVector> points)
        -
        Sorts a list of points according to the Hilbert space-filling curve to ensure - a high-degree of spatial locality in the sequence of points.
        -
        -
        Parameters:
        -
        points - list of points to sort. a list requires at least 24 points to - be sorted.
        -
        Returns:
        -
        a sorted copy of the input list, having a different order - according to points' Hilbert ranking of their (x, y) coordinate
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        random

        -
        public static List<processing.core.PVector> random​(double xMin,
-                                                   double yMin,
-                                                   double xMax,
-                                                   double yMax,
-                                                   int n)
        -
        Generates a set of random (uniform) points that lie within a bounding - rectangle.
        -
        -
        Parameters:
        -
        xMin - x-coordinate of boundary minimum
        -
        yMin - y-coordinate of boundary minimum
        -
        xMax - x-coordinate of boundary maximum
        -
        yMax - y-coordinate of boundary maximum
        -
        n - number of points to generate
        -
        Returns:
        -
        See Also:
        -
        seeded random()
        -
        -
        • -
      - - - -
        -
      • -

        random

        -
        public static List<processing.core.PVector> random​(double xMin,
-                                                   double yMin,
-                                                   double xMax,
-                                                   double yMax,
-                                                   int n,
-                                                   long seed)
        -
        Generates a set of random (uniform) points that lie within a bounding - rectangle, using the specified seed.
        -
        -
        Parameters:
        -
        xMin - x-coordinate of boundary minimum
        -
        yMin - y-coordinate of boundary minimum
        -
        xMax - x-coordinate of boundary maximum
        -
        yMax - y-coordinate of boundary maximum
        -
        n - number of points to generate
        -
        seed - number used to initialize the underlying pseudorandom number - generator
        -
        Returns:
        -
        See Also:
        -
        non-seeded random()
        -
        -
        • -
      - - - -
        -
      • -

        gaussian

        -
        public static List<processing.core.PVector> gaussian​(double centerX,
-                                                     double centerY,
-                                                     double sd,
-                                                     int n)
        -
        Generates a set of random points having a gaussian/normal distribution. The - point set is centered around the given center, given by mean coordinates.
        -
        -
        Parameters:
        -
        centerX - x coordinate of the center/mean of the point set
        -
        centerY - x coordinate of the center/mean of the point set
        -
        sd - standard deviation, which specifies how much the values can - vary from the mean. 68% of point samples have a value within - one standard deviation of the mean; three standard deviations - account for 99.7% of the sample population
        -
        n - number of points to generate
        -
        Returns:
        -
        See Also:
        -
        seeded gaussian()
        -
        -
        • -
      - - - -
        -
      • -

        gaussian

        -
        public static List<processing.core.PVector> gaussian​(double centerX,
-                                                     double centerY,
-                                                     double sd,
-                                                     int n,
-                                                     long seed)
        -
        Generates a set of random points having a gaussian/normal distribution, using - the specified seed. The point set is centered around the given center, given - by mean coordinates.
        -
        -
        Parameters:
        -
        centerX - x coordinate of the center/mean of the point set
        -
        centerY - x coordinate of the center/mean of the point set
        -
        sd - standard deviation, which specifies how much the values can - vary from the mean. 68% of point samples have a value within - one standard deviation of the mean; three standard deviations - account for 99.7% of the sample population
        -
        n - number of points to generate
        -
        seed - number used to initialize the underlying pseudorandom number - generator
        -
        Returns:
        -
        See Also:
        -
        non-seeded gaussian()
        -
        -
        • -
      - - - -
        -
      • -

        squareGrid

        -
        public static List<processing.core.PVector> squareGrid​(double xMin,
-                                                       double yMin,
-                                                       double xMax,
-                                                       double yMax,
-                                                       double pointDistance)
        -
        Generates a square grid/lattice of points that lie within a bounding - rectangle.
        -
        -
        Parameters:
        -
        xMin - x-coordinate of boundary minimum
        -
        yMin - y-coordinate of boundary minimum
        -
        xMax - x-coordinate of boundary maximum
        -
        yMax - y-coordinate of boundary maximum
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        hexGrid

        -
        public static List<processing.core.PVector> hexGrid​(double xMin,
-                                                    double yMin,
-                                                    double xMax,
-                                                    double yMax,
-                                                    int n)
        -
        Generates a hexagon grid/lattice of points that lie within a bounding - rectangle.
        -
        -
        Parameters:
        -
        xMin - x-coordinate of boundary minimum
        -
        yMin - y-coordinate of boundary minimum
        -
        xMax - x-coordinate of boundary maximum
        -
        yMax - y-coordinate of boundary maximum
        -
        n - number of points to generate
        -
        Returns:
        -
        See Also:
        -
        hexGrid() where - inter-point distance is specified
        -
        -
        • -
      - - - -
        -
      • -

        hexGrid

        -
        public static List<processing.core.PVector> hexGrid​(double xMin,
-                                                    double yMin,
-                                                    double xMax,
-                                                    double yMax,
-                                                    double pointDistance)
        -
        Generates a hexagon grid of points that lie within a bounding rectangle.
        -
        -
        Parameters:
        -
        xMin - x-coordinate of boundary minimum
        -
        yMin - y-coordinate of boundary minimum
        -
        xMax - x-coordinate of boundary maximum
        -
        yMax - y-coordinate of boundary maximum
        -
        pointDistance - inter-point distance
        -
        Returns:
        -
        See Also:
        -
        hexGrid() where number of - points is specified
        -
        -
        • -
      - - - -
        -
      • -

        hexagon

        -
        public static List<processing.core.PVector> hexagon​(double centerX,
-                                                    double centerY,
-                                                    int length,
-                                                    double distance)
        -
        Generates a hexagonal grid of points arranged in a hexagon pattern.
        -
        -
        Parameters:
        -
        centerX - x coordinate of the hexagon center point
        -
        centerY - y coordinate of the hexagon center point
        -
        length - layers/no. of points on each hexagon side
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        ring

        -
        public static List<processing.core.PVector> ring​(double centerX,
-                                                 double centerY,
-                                                 double innerRadius,
-                                                 double outerRadius,
-                                                 double maxAngle,
-                                                 int n)
        -
        Generates a set of points that are randomly distribted on a ring.
        -
        -
        Parameters:
        -
        centerX - x coordinate of the center/mean of the ring
        -
        centerY - x coordinate of the center/mean of the ring
        -
        innerRadius - radius of the ring's hole
        -
        outerRadius - maximum radius of the ring
        -
        maxAngle - angle of the ring (in radians). Can be negative
        -
        n - number of points to generate
        -
        Returns:
        -
        See Also:
        -
        seeded ring()
        -
        -
        • -
      - - - -
        -
      • -

        ring

        -
        public static List<processing.core.PVector> ring​(double centerX,
-                                                 double centerY,
-                                                 double innerRadius,
-                                                 double outerRadius,
-                                                 double maxAngle,
-                                                 int n,
-                                                 long seed)
        -
        Generates a set of points that are randomly distribted on a ring.
        -
        -
        Parameters:
        -
        centerX - x coordinate of the center/mean of the ring
        -
        centerY - x coordinate of the center/mean of the ring
        -
        innerRadius - radius of the ring's hole
        -
        outerRadius - maximum radius of the ring
        -
        maxAngle - angle of the ring (in radians). Can be negative
        -
        n - number of points to generate
        -
        seed - number used to initialize the underlying pseudorandom - number generator
        -
        Returns:
        -
        See Also:
        -
        non-seeded ring()
        -
        -
        • -
      - - - -
        -
      • -

        poisson

        -
        public static List<processing.core.PVector> poisson​(double xMin,
-                                                    double yMin,
-                                                    double xMax,
-                                                    double yMax,
-                                                    double minDist)
        -
        Generates a set of random points (constrained within a rectangular region) - via Poisson Disk Sampling. -

        - Poisson-disc sampling produces points that are tightly-packed, but no closer - to each other than a specified minimum distance, resulting in a more natural - and desirable pattern for many applications. This distribution is also - described as blue noise.

        -
        -
        Parameters:
        -
        xMin - x-coordinate of boundary minimum
        -
        yMin - y-coordinate of boundary minimum
        -
        xMax - x-coordinate of boundary maximum
        -
        yMax - y-coordinate of boundary maximum
        -
        minDist - minimum euclidean distance between any two points
        -
        Returns:
        -
        See Also:
        -
        seeded poisson()
        -
        -
        • -
      - - - -
        -
      • -

        poisson

        -
        public static List<processing.core.PVector> poisson​(double xMin,
-                                                    double yMin,
-                                                    double xMax,
-                                                    double yMax,
-                                                    double minDist,
-                                                    long seed)
        -
        Generates a set of random points (constrained within a rectangular region) - via Poisson Disk Sampling, using the specified seed. -

        - Poisson-disc sampling produces points that are tightly-packed, but no closer - to each other than a specified minimum distance, resulting in a more natural - and desirable pattern for many applications. This distribution is also - described as blue noise.

        -
        -
        Parameters:
        -
        xMin - x-coordinate of boundary minimum
        -
        yMin - y-coordinate of boundary minimum
        -
        xMax - x-coordinate of boundary maximum
        -
        yMax - y-coordinate of boundary maximum
        -
        minDist - minimum euclidean distance between any two points
        -
        seed - number used to initialize the underlying pseudorandom number - generator
        -
        Returns:
        -
        See Also:
        -
        non-seeded poisson()
        -
        -
        • -
      - - - -
        -
      • -

        poissonN

        -
        public static List<processing.core.PVector> poissonN​(double xMin,
-                                                     double yMin,
-                                                     double xMax,
-                                                     double yMax,
-                                                     int n,
-                                                     long seed)
        -
        Generates a poisson point set having N points constrained within a - rectangular region. -

        - Poisson-disc sampling produces points that are tightly-packed, but no closer - to each other than a specified minimum distance, resulting in a more natural - and desirable pattern for many applications. This distribution is also - described as blue noise.

        -
        -
        Parameters:
        -
        xMin - x-coordinate of boundary minimum
        -
        yMin - y-coordinate of boundary minimum
        -
        xMax - x-coordinate of boundary maximum
        -
        yMax - y-coordinate of boundary maximum
        -
        n - target size of poisson point set
        -
        seed - number used to initialize the underlying pseudorandom number - generator
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        phyllotaxis

        -
        public static List<processing.core.PVector> phyllotaxis​(double centerX,
-                                                        double centerY,
-                                                        int n,
-                                                        double radius)
        -
        Generates a set of points arranged in a phyllotaxis pattern (an arrangement - similar to the florets in the head of a sunflower), using the golden ratio - (the most irrational number) to position points with the least possible - aliasing (which is arguably the "best" arrangement).
        -
        -
        Parameters:
        -
        centerX - x coordinate of the center of the point set
        -
        centerY - y coordinate of the center of the point set
        -
        n - number of points to generate
        -
        radius - radius of circular phyllotaxis extent (max distance of a point - from the center position)
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        phyllotaxis

        -
        public static List<processing.core.PVector> phyllotaxis​(double centerX,
-                                                        double centerY,
-                                                        int n,
-                                                        double radius,
-                                                        double theta)
        -
        Generates a set of points arranged in a phyllotaxis pattern (an arrangement - similar to the florets in the head of a sunflower), using a user-defined - theta.
        -
        -
        Parameters:
        -
        centerX - x coordinate of the center of the point set
        -
        centerY - y coordinate of the center of the point set
        -
        n - number of points to generate
        -
        radius - radius of circular phyllotaxis extent (max distance of a point - from the center position)
        -
        theta - angle (in radians) to turn after each point placement
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        plasticLDS

        -
        public static List<processing.core.PVector> plasticLDS​(double xMin,
-                                                       double yMin,
-                                                       double xMax,
-                                                       double yMax,
-                                                       int n)
        -
        Generates a set of deterministic stratified points (bounded by a rectangle) - from a low discrepancy sequence (LDS) based on an irrational number (the - plastic constant). -

        - Low discrepancy sequences are deterministic (not randomized) number sequences - that are low discrepancy - meaning the points tend not to clump together and - leave holes; the resulting point set is more evenly spaced than a simple - random distribution but less regular than lattices.

        -
        -
        Parameters:
        -
        xMin - x-coordinate of boundary minimum
        -
        yMin - y-coordinate of boundary minimum
        -
        xMax - x-coordinate of boundary maximum
        -
        yMax - y-coordinate of boundary maximum
        -
        n - number of points to generate
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        plasticJitteredLDS

        -
        public static List<processing.core.PVector> plasticJitteredLDS​(double xMin,
-                                                               double yMin,
-                                                               double xMax,
-                                                               double yMax,
-                                                               int n)
        -
        Generates a set of deterministic stratified points (bounded by a rectangle) - from a low discrepancy sequence (LDS) based on an irrational number. In this - method, a random jitter is added to points to give the point set - blue-noise-like properties. -

        - Low discrepancy sequences are deterministic (not randomized) number sequences - that are low discrepancy - meaning the points tend not to clump together and - leave holes; the resulting point set is more evenly spaced than a simple - random distribution but less regular than lattices.

        -
        -
        Parameters:
        -
        xMin - x-coordinate of boundary minimum
        -
        yMin - y-coordinate of boundary minimum
        -
        xMax - x-coordinate of boundary maximum
        -
        yMax - y-coordinate of boundary maximum
        -
        n - number of points to generate
        -
        Returns:
        -
        See Also:
        -
        seeded - irrationalJitteredLDS()
        -
        -
        • -
      - - - -
        -
      • -

        plasticJitteredLDS

        -
        public static List<processing.core.PVector> plasticJitteredLDS​(double xMin,
-                                                               double yMin,
-                                                               double xMax,
-                                                               double yMax,
-                                                               int n,
-                                                               long seed)
        -
        Generates a set of deterministic stratified points (bounded by a rectangle) - from a low discrepancy sequence (LDS) based on an irrational number. In this - method, a random jitter is added to points to give the point set - blue-noise-like properties. -

        - Low discrepancy sequences are deterministic (not randomized) number sequences - that are low discrepancy - meaning the points tend not to clump together and - leave holes; the resulting point set is more evenly spaced than a simple - random distribution but less regular than lattices.

        -
        -
        Parameters:
        -
        xMin - x-coordinate of boundary minimum
        -
        yMin - y-coordinate of boundary minimum
        -
        xMax - x-coordinate of boundary maximum
        -
        yMax - y-coordinate of boundary maximum
        -
        n - number of points to generate
        -
        seed - number used to initialize the underlying pseudorandom number - generator
        -
        Returns:
        -
        See Also:
        -
        non-seeded - irrationalJitteredLDS()
        -
        -
        • -
      - - - -
        -
      • -

        haltonLDS

        -
        public static List<processing.core.PVector> haltonLDS​(double xMin,
-                                                      double yMin,
-                                                      double xMax,
-                                                      double yMax,
-                                                      int n)
        -
        Generates a set of deterministic stratified points (bounded by a rectangle) - from a low discrepancy sequence (LDS) based on a Halton sequence. -

        - Low discrepancy sequences are deterministic (not randomized) number sequences - that are low discrepancy - meaning the points tend not to clump together and - leave holes; the resulting point set is more evenly spaced than a simple - random distribution but less regular than lattices.

        -
        -
        Parameters:
        -
        xMin - x-coordinate of boundary minimum
        -
        yMin - y-coordinate of boundary minimum
        -
        xMax - x-coordinate of boundary maximum
        -
        yMax - y-coordinate of boundary maximum
        -
        n - number of points to generate
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        hammersleyLDS

        -
        public static List<processing.core.PVector> hammersleyLDS​(double xMin,
-                                                          double yMin,
-                                                          double xMax,
-                                                          double yMax,
-                                                          int n)
        -
        Generates a set of deterministic stratified points (bounded by a rectangle) - from a low discrepancy sequence (LDS) based on a Hammersley sequence. -

        - The Hammersley sequence in 2D is just the 1d Van Der Corput sequence on one - axis, and regular sampling on the other axis. -

        - Low discrepancy sequences are deterministic (not randomized) number sequences - that are low discrepancy - meaning the points tend not to clump together and - leave holes; the resulting point set is more evenly spaced than a simple - random distribution but less regular than lattices.

        -
        -
        Parameters:
        -
        xMin - x-coordinate of boundary minimum
        -
        yMin - y-coordinate of boundary minimum
        -
        xMax - x-coordinate of boundary maximum
        -
        yMax - y-coordinate of boundary maximum
        -
        n - number of points to generate
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        nRooksLDS

        -
        public static List<processing.core.PVector> nRooksLDS​(double xMin,
-                                                      double yMin,
-                                                      double xMax,
-                                                      double yMax,
-                                                      int n)
        -
        Generates a set of random stratified points (bounded by a rectangle) based on - the "N-Rooks" sampling pattern. -

        - N-Rooks is a sampling pattern where you treat the boundary as if it were a - chess board. Every sampling position is a rook that could move horizontally - or vertically, and should be placed such that none of these rooks could - capture/"see" any of the other rooks. In other words, every column has a - single sample point in it, and every row has a single sample point in it.

        -
        -
        Parameters:
        -
        xMin - x-coordinate of boundary minimum
        -
        yMin - y-coordinate of boundary minimum
        -
        xMax - x-coordinate of boundary maximum
        -
        yMax - y-coordinate of boundary maximum
        -
        n - number of points to generate
        -
        Returns:
        -
        See Also:
        -
        nRooksLDS(double, double, double, double, int, long)
        -
        -
        • -
      - - - -
        -
      • -

        nRooksLDS

        -
        public static List<processing.core.PVector> nRooksLDS​(double xMin,
-                                                      double yMin,
-                                                      double xMax,
-                                                      double yMax,
-                                                      int n,
-                                                      long seed)
        -
        Generates a set of random stratified points (bounded by a rectangle) based on - the "N-Rooks" sampling pattern. -

        - N-Rooks is a sampling pattern where you treat the boundary as if it were a - chess board. Every sampling position is a rook that could move horizontally - or vertically, and should be placed such that none of these rooks could - capture/"see" any of the other rooks. In other words, every column has a - single sample point in it, and every row has a single sample point in it.

        -
        -
        Parameters:
        -
        xMin - x-coordinate of boundary minimum
        -
        yMin - y-coordinate of boundary minimum
        -
        xMax - x-coordinate of boundary maximum
        -
        yMax - y-coordinate of boundary maximum
        -
        n - number of points to generate
        -
        seed - number used to initialize the underlying pseudorandom number - generator
        -
        Returns:
        -
        See Also:
        -
        nRooksLDS(double, double, double, double, int)
        -
        -
        • -
      - - - -
        -
      • -

        minimumSpanningTree

        -
        public static processing.core.PShape minimumSpanningTree​(List<processing.core.PVector> points)
        -
        Computes the Euclidean minimum spanning tree (EMST) of a set of - points. -

        - The EMST is a system of line segments, having only the given points as their - endpoints, whose union includes all of the points in a connected set, and - which has the minimum possible total length of any such system.

        -
        -
        Parameters:
        -
        points - the set of points over which to compute the EMST
        -
        Returns:
        -
        a LINES PShape
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/PGS_Processing.html b/micycle/pgs/PGS_Processing.html deleted file mode 100644 index 4c93845f..00000000 --- a/micycle/pgs/PGS_Processing.html +++ /dev/null @@ -1,1058 +0,0 @@ - - - - - -PGS_Processing (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs
-

Class PGS_Processing

-
-
- -
-
    -
  • -
    -
    public final class PGS_Processing
-extends Object
    -
    Geometry Processing -- methods that process a shape in some way: compute - hulls, partition, slice, etc.
    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Summary

      - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
      All Methods Static Methods Concrete Methods 
      Modifier and TypeMethodDescription
      static processing.core.PShapecleanCoverage​(processing.core.PShape coverage, - double distanceTolerance, - double angleTolerance) -
      Removes gaps and overlaps from meshes/polygon collections that are intended - to satisfy the following conditions: - - Vector-clean - edges between neighbouring polygons must either be - identical or intersect only at endpoints. - Non-overlapping - No two polygons may overlap.
      -
      static processing.core.PShapeconvexPartition​(processing.core.PShape shape) -
      Partitions a shape into simple convex polygons.
      -
      static processing.core.PShapedensify​(processing.core.PShape shape, - double distanceTolerance) -
      Densifies a shape by inserting extra vertices along the line segments - contained in the shape.
      -
      static processing.core.PShapeeliminateSlivers​(processing.core.PShape shape, - double threshold) -
      Removes narrow areas ("slivers") from a shape while preserving the geometry - of the remaining parts.
      -
      static processing.core.PShapeequalPartition​(processing.core.PShape shape, - int parts, - boolean precise) -
      Partitions a shape into N approximately equal-area polygonal cells.
      -
      static processing.core.PShapeextractPerimeter​(processing.core.PShape shape, - double from, - double to) -
      Extracts a portion/subline of the perimeter of a shape between two locations - on the perimeter.
      -
      static List<processing.core.PVector>generateRandomGridPoints​(processing.core.PShape shape, - int maxPoints, - boolean constrainedToCircle, - double gutterFraction) -
      Generates up to maxPoints number of random points that are - contained within the shape region.
      -
      static List<processing.core.PVector>generateRandomGridPoints​(processing.core.PShape shape, - int maxPoints, - boolean constrainedToCircle, - double gutterFraction, - long randomSeed) -
      Generates up to maxPoints number of random points that are - contained within the shape region.
      -
      static List<processing.core.PVector>generateRandomPoints​(processing.core.PShape shape, - int points) -
      Generates N random points that lie within the shape region.
      -
      static List<processing.core.PVector>generateRandomPoints​(processing.core.PShape shape, - int points, - long seed) -
      Generates N random points that are contained within the shape region.
      -
      static List<processing.core.PVector>lineSegmentsIntersection​(List<processing.core.PVector> lineSegments) -
      Computes all points of intersection between segments in a set of line - segments.
      -
      static processing.core.PVectorpointOnExterior​(processing.core.PShape shape, - double distance, - double offsetDistance) -
      Extracts a point from the perimeter (exterior) of the shape at a given - fraction around its perimeter.
      -
      static List<processing.core.PVector>pointsOnExterior​(processing.core.PShape shape, - double interPointDistance, - double offsetDistance) -
      Generates a list of points that lie on the exterior/perimeter of the given - shape.
      -
      static List<processing.core.PVector>pointsOnExterior​(processing.core.PShape shape, - int points, - double offsetDistance) -
      Extracts many points from the perimeter (faster than calling other method - lots)
      -
      static processing.core.PShapepolygonizeLines​(List<processing.core.PVector> lineSegmentVertices) -
      Finds the polygonal faces formed by a set of intersecting line segments.
      -
      static processing.core.PShaperemoveHiddenLines​(processing.core.PShape shape) -
      Removes overlap between polygons contained in a GROUP shape, preserving only - line segments that are visible to a human, rather than a computer (to use as - input for a pen plotter, for example).
      -
      static processing.core.PShaperemoveSmallHoles​(processing.core.PShape shape, - double areaThreshold) -
      Returns a copy of the shape where small holes (i.e.
      -
      static List<processing.core.PVector>shapeIntersection​(processing.core.PShape a, - processing.core.PShape b) -
      Computes all points of intersection between the perimeter of - two shapes.
      -
      static processing.core.PShapeslice​(processing.core.PShape shape, - processing.core.PVector p1, - processing.core.PVector p2) -
      Slices a shape using a line given by its start and endpoints.
      -
      static processing.core.PShapesplit​(processing.core.PShape shape) -
      Splits a shape into 4 equal (as measured be envelope area) quadrants.
      -
      static processing.core.PShapesplit​(processing.core.PShape shape, - int splitDepth) -
      Splits a shape into 4^(1+recursions) rectangular partitions.
      -
      static doubletangentAngle​(processing.core.PShape shape, - double distanceFraction) -
      Finds the angle of the line tangent to the shape at a certain point on its - perimeter (given by the some fraction of the distance around the perimeter).
      -
      static processing.core.PShapetrapezoidPartition​(processing.core.PShape shape) -
      Decomposes/partitions a shape into axis-aligned (stip-like) trazepoids.
      -
      - -
      • -
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        densify

        -
        public static processing.core.PShape densify​(processing.core.PShape shape,
-                                             double distanceTolerance)
        -
        Densifies a shape by inserting extra vertices along the line segments - contained in the shape.
        -
        -
        Parameters:
        -
        shape -
        -
        distanceTolerance - the densification tolerance to use. All line - segments in the densified geometry will be no longer - than the distance tolerance. The distance tolerance - must be positive.
        -
        -
        • -
      - - - -
        -
      • -

        pointOnExterior

        -
        public static processing.core.PVector pointOnExterior​(processing.core.PShape shape,
-                                                      double distance,
-                                                      double offsetDistance)
        -
        Extracts a point from the perimeter (exterior) of the shape at a given - fraction around its perimeter.
        -
        -
        Parameters:
        -
        shape - a lineal or polygonal shape. If the input is a GROUP - shape, a single point will be extracted from its first - child.
        -
        distance - 0...1 around shape perimeter; or -1...0 (other - direction)
        -
        offsetDistance - perpendicular offset distance, where 0 is exactly on - the shape exteriod. Positive values offset the point - away from the shape (outwards); negative values offset - the point inwards.
        -
        Returns:
        -
        See Also:
        -
        pointsOnExterior(PShape, int, double)
        -
        -
        • -
      - - - -
        -
      • -

        pointsOnExterior

        -
        public static List<processing.core.PVector> pointsOnExterior​(processing.core.PShape shape,
-                                                             int points,
-                                                             double offsetDistance)
        -
        Extracts many points from the perimeter (faster than calling other method - lots)
        -
        -
        Parameters:
        -
        shape - a lineal or polygonal shape. If the input is a GROUP - shape, a single point will be extracted from its first - child.
        -
        points - number of points to return; evenly distibuted around - the perimeter of the shape
        -
        offsetDistance - offset distance along a line perpendicular to the - perimeter
        -
        Returns:
        -
        See Also:
        -
        pointOnExterior(PShape, double, double), -pointsOnExterior(PShape, double, double)
        -
        -
        • -
      - - - -
        -
      • -

        pointsOnExterior

        -
        public static List<processing.core.PVector> pointsOnExterior​(processing.core.PShape shape,
-                                                             double interPointDistance,
-                                                             double offsetDistance)
        -
        Generates a list of points that lie on the exterior/perimeter of the given - shape.
        -
        -
        Parameters:
        -
        shape - a lineal or polygonal shape. If the input is a - GROUP shape, a single point will be extracted from - its first child.
        -
        interPointDistance - distance between each exterior point
        -
        offsetDistance -
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        extractPerimeter

        -
        public static processing.core.PShape extractPerimeter​(processing.core.PShape shape,
-                                                      double from,
-                                                      double to)
        -
        Extracts a portion/subline of the perimeter of a shape between two locations - on the perimeter.
        -
        -
        Parameters:
        -
        shape - the shape from which to extract a the perimeter
        -
        from - the starting location of the perimeter extract, given by a - fraction (0...1) of the total perimeter length
        -
        to - the end location of the perimeter extract, given by a fraction - (0...1) of the total perimeter length
        -
        Returns:
        -
        lineal shape
        -
        Since:
        -
        1.2.0
        -
        -
        • -
      - - - -
        -
      • -

        tangentAngle

        -
        public static double tangentAngle​(processing.core.PShape shape,
-                                  double distanceFraction)
        -
        Finds the angle of the line tangent to the shape at a certain point on its - perimeter (given by the some fraction of the distance around the perimeter). -

        - The tangent line is orientated clockwise with respect to the shape and the - output angle is normalized to be in the range [ -PI, PI ].

        -
        -
        Parameters:
        -
        shape -
        -
        distanceFraction - the distance fraction around the perimeter [0...1]
        -
        Returns:
        -
        the normalized angle (in radians) that a line tangent to the - perimeter of the shape at the given position makes with the positive - x-axis, where 0 is north.
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        shapeIntersection

        -
        public static List<processing.core.PVector> shapeIntersection​(processing.core.PShape a,
-                                                              processing.core.PShape b)
        -
        Computes all points of intersection between the perimeter of - two shapes. -

        - NOTE: This method shouldn't be confused with - PGS_ShapeBoolean.intersect(), which finds the shape made by the intersecting - shape areas.

        -
        -
        Parameters:
        -
        a - one shape
        -
        b - another shape
        -
        Returns:
        -
        list of all intersecting points (as PVectors)
        -
        -
        • -
      - - - -
        -
      • -

        lineSegmentsIntersection

        -
        public static List<processing.core.PVector> lineSegmentsIntersection​(List<processing.core.PVector> lineSegments)
        -
        Computes all points of intersection between segments in a set of line - segments. The input set is first processed to remove degenerate segments - (does not mutate the input).
        -
        -
        Parameters:
        -
        lineSegments - a list of PVectors where each pair (couplet) of PVectors - represent the start and end point of one line segment
        -
        Returns:
        -
        A list of PVectors each representing the intersection point of a - segment pair
        -
        -
        • -
      - - - -
        -
      • -

        generateRandomPoints

        -
        public static List<processing.core.PVector> generateRandomPoints​(processing.core.PShape shape,
-                                                                 int points)
        -
        Generates N random points that lie within the shape region. -

        - This is a fast method but note that the underlying algorithm makes a minor - trade-off for its speed: the resulting point set is slightly more uniformly - distributed over the input shape compared to a purely random approach (this - arises because the shape is first divided into triangles; each triangle is - then sampled a fixed number of times according to its area relative to - the whole).

        -
        -
        Parameters:
        -
        shape - defines the region in which random points are generated
        -
        points - number of points to generate within the shape region
        -
        Returns:
        -
        See Also:
        -
        generateRandomPoints(PShape, int, long), -generateRandomGridPoints(PShape, int, boolean, double)
        -
        -
        • -
      - - - -
        -
      • -

        generateRandomPoints

        -
        public static List<processing.core.PVector> generateRandomPoints​(processing.core.PShape shape,
-                                                                 int points,
-                                                                 long seed)
        -
        Generates N random points that are contained within the shape region. Points - are distributed completely randomly. This method accepts a seed for the RNG - when identical sequences of random points are required. -

        - This is a fast method but note that the underlying algorithm makes a minor - trade-off for its speed: the resulting point set is slightly more uniformly - distributed over the input shape compared to a purely random approach (this - arises because the shape is first divided into triangles; each triangle is - then sampled a fixed number of times according to its area relative to - the whole).

        -
        -
        Parameters:
        -
        shape - defines the region in which random points are generated
        -
        points - number of points to generate within the shape region
        -
        seed - number used to initialize the underlying pseudorandom number - generator
        -
        Returns:
        -
        Since:
        -
        1.1.0
        -
        See Also:
        -
        generateRandomPoints(PShape, int), -generateRandomGridPoints(PShape, int, boolean, double)
        -
        -
        • -
      - - - -
        -
      • -

        generateRandomGridPoints

        -
        public static List<processing.core.PVector> generateRandomGridPoints​(processing.core.PShape shape,
-                                                                     int maxPoints,
-                                                                     boolean constrainedToCircle,
-                                                                     double gutterFraction)
        -
        Generates up to maxPoints number of random points that are - contained within the shape region. Points are distributed according to a grid - of cells (one point randomly located in each cell), based on the envelope of - the shape.
        -
        -
        Parameters:
        -
        shape - defines the region in which random points are - generated
        -
        maxPoints - maximum number of points, if this shape was its - own envelope
        -
        constrainedToCircle - Sets whether generated points are constrained to - lie within a circle contained within each grid - cell. This provides greater separation between - points in adjacent cells.
        -
        gutterFraction - Sets the fraction of the grid cell side which will - be treated as a gutter, in which no points will be - created. The provided value is clamped to the - range [0.0, 1.0]. Higher values increase how - "grid-like" the point distribution is.
        -
        Returns:
        -
        a list of random points, distributed according to a grid, contained - within the given shape
        -
        See Also:
        -
        generateRandomPoints(PShape, int), -generateRandomGridPoints(PShape, int, boolean, double, long)
        -
        -
        • -
      - - - -
        -
      • -

        generateRandomGridPoints

        -
        public static List<processing.core.PVector> generateRandomGridPoints​(processing.core.PShape shape,
-                                                                     int maxPoints,
-                                                                     boolean constrainedToCircle,
-                                                                     double gutterFraction,
-                                                                     long randomSeed)
        -
        Generates up to maxPoints number of random points that are - contained within the shape region. Points are distributed according to a grid - of cells (one point randomly located in each cell), based on the envelope of - the shape. -

        - This method accepts a seed for the RNG when identical sequences of random - points are required.

        -
        -
        Parameters:
        -
        shape - defines the region in which random points are - generated
        -
        maxPoints - maximum number of points, if this shape was its - own envelope
        -
        constrainedToCircle - Sets whether generated points are constrained to - lie within a circle contained within each grid - cell. This provides greater separation between - points in adjacent cells.
        -
        gutterFraction - Sets the fraction of the grid cell side which will - be treated as a gutter, in which no points will be - created. The provided value is clamped to the - range [0.0, 1.0]. Higher values increase how - "grid-like" the point distribution is.
        -
        randomSeed -
        -
        Returns:
        -
        a list of random points, distributed according to a grid, contained - within the given shape
        -
        See Also:
        -
        generateRandomGridPoints(PShape, int, boolean, double)
        -
        -
        • -
      - - - -
        -
      • -

        removeHiddenLines

        -
        public static processing.core.PShape removeHiddenLines​(processing.core.PShape shape)
        -
        Removes overlap between polygons contained in a GROUP shape, preserving only - line segments that are visible to a human, rather than a computer (to use as - input for a pen plotter, for example). -

        - Any overlapping lines are also removed during the operation. -

        - Order of shape layers is important: the method will consider the last child - shape of the input to be "on top" of all other shapes (as is the case - visually).

        -
        -
        Parameters:
        -
        shape - a GROUP shape consisting of lineal or polygonal child shapes
        -
        Returns:
        -
        linework of the overlapping input (LINES PShape)
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        removeSmallHoles

        -
        public static processing.core.PShape removeSmallHoles​(processing.core.PShape shape,
-                                                      double areaThreshold)
        -
        Returns a copy of the shape where small holes (i.e. inner rings with area < - given threshold) are removed.
        -
        -
        Parameters:
        -
        shape - a single polygonal shape or GROUP polygonal shape
        -
        areaThreshold - remove any holes with an area smaller than this value
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        polygonizeLines

        -
        public static processing.core.PShape polygonizeLines​(List<processing.core.PVector> lineSegmentVertices)
        -
        Finds the polygonal faces formed by a set of intersecting line segments.
        -
        -
        Parameters:
        -
        lineSegmentVertices - a list of PVectors where each pair (couplet) of - PVectors represent the start and end point of one - line segment
        -
        Returns:
        -
        a GROUP PShape where each child shape is a face / enclosed area - formed between intersecting lines
        -
        Since:
        -
        1.1.2
        -
        -
        • -
      - - - -
        -
      • -

        split

        -
        public static processing.core.PShape split​(processing.core.PShape shape)
        -
        Splits a shape into 4 equal (as measured be envelope area) quadrants.
        -
        -
        Parameters:
        -
        shape - the shape to split
        -
        Returns:
        -
        a GROUP PShape, where each child shape is some quadrant partition of - the original shape
        -
        See Also:
        -
        split(PShape, int)
        -
        -
        • -
      - - - -
        -
      • -

        split

        -
        public static processing.core.PShape split​(processing.core.PShape shape,
-                                           int splitDepth)
        -
        Splits a shape into 4^(1+recursions) rectangular partitions.
        -
        -
        Parameters:
        -
        shape -
        -
        splitDepth -
        -
        Returns:
        -
        a GROUP PShape, where each child shape is some quadrant partition of - the original shape
        -
        See Also:
        -
        split(PShape)
        -
        -
        • -
      - - - -
        -
      • -

        convexPartition

        -
        public static processing.core.PShape convexPartition​(processing.core.PShape shape)
        -
        Partitions a shape into simple convex polygons.
        -
        -
        Parameters:
        -
        shape - the shape to partition
        -
        Returns:
        -
        a GROUP PShape, where each child shape is some convex partition of - the original shape
        -
        -
        • -
      - - - -
        -
      • -

        equalPartition

        -
        public static processing.core.PShape equalPartition​(processing.core.PShape shape,
-                                                    int parts,
-                                                    boolean precise)
        -
        Partitions a shape into N approximately equal-area polygonal cells. -

        - This method produces a voronoi-like output.

        -
        -
        Parameters:
        -
        shape - a polygonal (non-group, no holes) shape
        -
        parts - number of roughly equal area partitons to create
        -
        precise - whether to use a subroutine that partitions the shape into - more precisely equal partitions. The tradeoff here is - computation time vs partition quality
        -
        Returns:
        -
        a GROUP PShape, whose child shapes are partitions of the original
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        trapezoidPartition

        -
        public static processing.core.PShape trapezoidPartition​(processing.core.PShape shape)
        -
        Decomposes/partitions a shape into axis-aligned (stip-like) trazepoids. -

        - The output can contain some "degenerate" trapezoids that do indeed have 4 - vertices but look like triangles.

        -
        -
        Parameters:
        -
        shape - a polygonal or a GROUP shape
        -
        Returns:
        -
        a GROUP PShape comprising of trapezoid child shapes
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        slice

        -
        public static processing.core.PShape slice​(processing.core.PShape shape,
-                                           processing.core.PVector p1,
-                                           processing.core.PVector p2)
        -
        Slices a shape using a line given by its start and endpoints.
        -
        -
        Parameters:
        -
        shape - PShape to slice into two shapes
        -
        p1 - must be outside shape
        -
        p2 - must be outside shape
        -
        Returns:
        -
        a GROUP PShape with two children, where each child shape is one of - the slices
        -
        -
        • -
      - - - -
        -
      • -

        eliminateSlivers

        -
        public static processing.core.PShape eliminateSlivers​(processing.core.PShape shape,
-                                                      double threshold)
        -
        Removes narrow areas ("slivers") from a shape while preserving the geometry - of the remaining parts. -

        - This operation is similar to - erosionDilation(), but - better preserves the original geometry of remaining parts. -

        - If the input is a single polygon and if when removing slivers, a multipolygon - is produced, further processing occurs within the method to repair it back - into a single polygon.

        -
        -
        Parameters:
        -
        shape - polygonal shape
        -
        threshold - width threshold (probably no more than 10); parts narrower - than this are eliminated
        -
        Returns:
        -
        a copy of the input shape having narrow areas/parts removed
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        cleanCoverage

        -
        public static processing.core.PShape cleanCoverage​(processing.core.PShape coverage,
-                                                   double distanceTolerance,
-                                                   double angleTolerance)
        -
        Removes gaps and overlaps from meshes/polygon collections that are intended - to satisfy the following conditions: -
          -
        • Vector-clean - edges between neighbouring polygons must either be - identical or intersect only at endpoints.
          • -
        • Non-overlapping - No two polygons may overlap. Equivalently, polygons - must be interior-disjoint.
          • -
        -

        - It may not always be possible to perfectly clean the input. -

        - While this method is intended to be used to fix malformed coverages, it can - be used to snap collections of disparate polygons together.

        -
        -
        Parameters:
        -
        coverage - a GROUP shape, consisting of the polygonal faces to - clean
        -
        distanceTolerance - the distance below which segments and vertices are - considered to match
        -
        angleTolerance - the maximum angle difference between matching - segments, in degrees
        -
        Returns:
        -
        GROUP shape whose child polygons satisfy a (hopefully) valid coverage
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/PGS_SegmentSet.html b/micycle/pgs/PGS_SegmentSet.html deleted file mode 100644 index 0b30d05b..00000000 --- a/micycle/pgs/PGS_SegmentSet.html +++ /dev/null @@ -1,736 +0,0 @@ - - - - - -PGS_SegmentSet (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs
-

Class PGS_SegmentSet

-
-
- -
-
    -
  • -
    -
    public class PGS_SegmentSet
-extends Object
    -
    Generation of random sets of non-intersecting line segments (and - associated functions). -

    - Methods in this class output segments as collections of - PEdges; such collections can be converted - into LINES PShapes with toPShape(Collection).

    -
    -
    Since:
    -
    1.3.0
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Summary

      - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
      All Methods Static Methods Concrete Methods 
      Modifier and TypeMethodDescription
      static List<PEdge>filterAxisAligned​(List<PEdge> segments, - double angleDelta) -
      Removes axis-aligned (horizontal and vertical) segments (within a given angle - tolerance) from a collection of segments.
      -
      static List<PEdge>filterByAverageLength​(List<PEdge> segments, - double fraction) -
      Removes segments having a length either less than some fraction or more than - 1/fraction of the mean segment length from a collection of - segments.
      -
      static List<PEdge>filterByMinLength​(List<PEdge> segments, - double minLength) -
      Removes segments having a length less than the given length from a collection - of segmensts.
      -
      static List<PEdge>graphMatchedSegments​(double width, - double height, - int n, - long seed) -
      Generates N non-intersecting segments via a Perfect matching algorithm - applied to a triangulation populated with random points.
      -
      static List<PEdge>graphMatchedSegments​(List<processing.core.PVector> points) -
      Generates non-intersecting segments via a Perfect matching algorithm - applied to a triangulation populated with the given points.
      -
      static List<PEdge>graphMatchedSegments​(org.tinfour.common.IIncrementalTin triangulation) -
      Generates non-intersecting segments via a Perfect matching algorithm - applied to the given triangulation.
      -
      static List<PEdge>nodedSegments​(double width, - double height, - int n, - long seed) -
      Generates N non-intersecting segments via intersection and noding.
      -
      static List<PEdge>parallelSegments​(double centerX, - double centerY, - double length, - double d, - double angle, - int n) -
      Generates a set of N straight parallel segments, centered on a given point.
      -
      static List<PEdge>stochasticSegments​(double width, - double height, - int n) -
      Generates a set of N random non-intersecting line segments via brute-forcing.
      -
      static List<PEdge>stochasticSegments​(double width, - double height, - int n, - double length) -
      Generates a set of N random non-intersecting line segments of the given - length via brute-forcing.
      -
      static List<PEdge>stochasticSegments​(double width, - double height, - int n, - double minLength, - double maxLength, - long seed) -
      Generates a set of N random non-intersecting line segments via brute-forcing.
      -
      static processing.core.PShapetoPShape​(Collection<PEdge> segments) -
      Converts a collection of PEdges into a - LINES shape.
      -
      static processing.core.PShapetoPShape​(Collection<PEdge> segments, - Integer strokeColor, - Integer strokeCap, - Integer strokeWeight) -
      Converts a collection of PEdges into a - LINES shape, having the (optional) styling provided.
      -
      - -
      • -
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        nodedSegments

        -
        public static List<PEdge> nodedSegments​(double width,
-                                        double height,
-                                        int n,
-                                        long seed)
        -
        Generates N non-intersecting segments via intersection and noding. -

        - The segments are generated within a bounding box anchored at (0, 0) having - the width and height specified. -

        - Algorithm: -

          -
        • Generate a set of N random segments (will have many intersections)
          • -
        • Node the random segment set and split segments at intersections
          • -
        • Shrink split segments by ~30% (to increase distance between each - other)
          • -
        • The split segments will be very numerous; sort by length and return the - longest N segments
          • -
        -
        -
        Parameters:
        -
        width - width of the bounds in which to generate segments; segment x - coordinates will not be greater than this value
        -
        height - height of the bounds in which to generate segments; segment y - coordinates will not be greater than this value
        -
        n - number of segments to generate
        -
        seed - number used to initialize the underlying pseudorandom number - generator
        -
        Returns:
        -
        set of N random non-intersecting line segments
        -
        -
        • -
      - - - -
        -
      • -

        graphMatchedSegments

        -
        public static List<PEdge> graphMatchedSegments​(double width,
-                                               double height,
-                                               int n,
-                                               long seed)
        -
        Generates N non-intersecting segments via a Perfect matching algorithm - applied to a triangulation populated with random points. -

        - The segments are generated within a bounding box anchored at (0, 0) having - the width and height specified. -

        - The graphMatchedSegments methods are arguably the best - approaches for random segment set generation.

        -
        -
        Parameters:
        -
        width - width of the bounds in which to generate segments; segment x - coordinates will not be greater than this value
        -
        height - height of the bounds in which to generate segments; segment y - coordinates will not be greater than this value
        -
        n - number of segments to generate
        -
        seed - number used to initialize the underlying pseudorandom number - generator
        -
        Returns:
        -
        set of N random non-intersecting line segments
        -
        -
        • -
      - - - -
        -
      • -

        graphMatchedSegments

        -
        public static List<PEdge> graphMatchedSegments​(List<processing.core.PVector> points)
        -
        Generates non-intersecting segments via a Perfect matching algorithm - applied to a triangulation populated with the given points. -

        - Generates N/2 segments, where N is the number of points in the input. If the - number of points is odd, the last point is discarded. -

        - The graphMatchedSegments methods are arguably the best - approaches for random segment set generation. Graph matched / graph perfect - matching. In this method, the input point set is triangulated and a matching - ran on that.

        -
        -
        Parameters:
        -
        points - point set from which to compute segments
        -
        Returns:
        -
        set of non-intersecting line segments
        -
        -
        • -
      - - - -
        -
      • -

        graphMatchedSegments

        -
        public static List<PEdge> graphMatchedSegments​(org.tinfour.common.IIncrementalTin triangulation)
        -
        Generates non-intersecting segments via a Perfect matching algorithm - applied to the given triangulation. -

        - Generates N/2 segments, where N is the number of vertices in the - triangulation. If the number of points is odd, the last point is discarded. -

        - The graphMatchedSegments methods are arguably the best - approaches for random segment set generation. Graph matched / graph perfect - matching. In this method, the input point set is triangulated and a matching - ran on that.

        -
        -
        Parameters:
        -
        points - point set from which to compute segments
        -
        Returns:
        -
        set of non-intersecting line segments
        -
        -
        • -
      - - - -
        -
      • -

        stochasticSegments

        -
        public static List<PEdge> stochasticSegments​(double width,
-                                             double height,
-                                             int n)
        -
        Generates a set of N random non-intersecting line segments via brute-forcing. - Plentifully fast enough for many applications. -

        - The segments are generated within a bounding box anchored at (0, 0) having - the width and height specified.

        -
        -
        Parameters:
        -
        width - width of the bounds in which to generate segments; segment x - coordinates will not be greater than this value
        -
        height - height of the bounds in which to generate segments; segment y - coordinates will not be greater than this value
        -
        n - number of segments to generate
        -
        Returns:
        -
        set of N random non-intersecting line segments
        -
        See Also:
        -
        stochasticSegments(double, double, int, double, double, long)
        -
        -
        • -
      - - - -
        -
      • -

        stochasticSegments

        -
        public static List<PEdge> stochasticSegments​(double width,
-                                             double height,
-                                             int n,
-                                             double length)
        -
        Generates a set of N random non-intersecting line segments of the given - length via brute-forcing. Plentifully fast enough for many applications. -

        - The segments are generated within a bounding box anchored at (0, 0) having - the width and height specified.

        -
        -
        Parameters:
        -
        width - width of the bounds in which to generate segments; segment x - coordinates will not be greater than this value
        -
        height - height of the bounds in which to generate segments; segment y - coordinates will not be greater than this value
        -
        n - number of segments to generate
        -
        length - segment length (for all segments)
        -
        Returns:
        -
        set of N random non-intersecting line segments
        -
        See Also:
        -
        stochasticSegments(double, double, int, double, double, long)
        -
        -
        • -
      - - - -
        -
      • -

        stochasticSegments

        -
        public static List<PEdge> stochasticSegments​(double width,
-                                             double height,
-                                             int n,
-                                             double minLength,
-                                             double maxLength,
-                                             long seed)
        -
        Generates a set of N random non-intersecting line segments via brute-forcing. - Plentifully fast enough for many applications. -

        - The segments are generated within a bounding box anchored at (0, 0) having - the width and height specified.

        -
        -
        Parameters:
        -
        width - width of the bounds in which to generate segments; segment x - coordinates will not be greater than this value
        -
        height - height of the bounds in which to generate segments; segment - y coordinates will not be greater than this value
        -
        n - number of segments to generate
        -
        minLength - minimum segment length (inclusive)
        -
        maxLength - maximum segment length (exclusive)
        -
        seed - number used to initialize the underlying pseudorandom number - generator
        -
        Returns:
        -
        set of N random non-intersecting line segments
        -
        -
        • -
      - - - -
        -
      • -

        parallelSegments

        -
        public static List<PEdge> parallelSegments​(double centerX,
-                                           double centerY,
-                                           double length,
-                                           double d,
-                                           double angle,
-                                           int n)
        -
        Generates a set of N straight parallel segments, centered on a given point.
        -
        -
        Parameters:
        -
        centerX - the x coordinate of the center of the segments arrangment
        -
        centerY - the y coordinate of the center of the segments arrangment
        -
        length - length of each segment
        -
        spacing - distance between successive segments
        -
        rotation - angle in radians, where 0 is parallel to x-axis (horizontal)
        -
        n - number of segments to generate. if odd then the middle - segment lies on the center point; if even, then the first two - segments are spaced evenly from the center point
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        toPShape

        -
        public static processing.core.PShape toPShape​(Collection<PEdge> segments)
        -
        Converts a collection of PEdges into a - LINES shape.
        -
        -
        Parameters:
        -
        segments - collection of segments
        -
        Returns:
        -
        LINES shape representing segments
        -
        -
        • -
      - - - -
        -
      • -

        toPShape

        -
        public static processing.core.PShape toPShape​(Collection<PEdge> segments,
-                                              @Nullable
-                                              Integer strokeColor,
-                                              @Nullable
-                                              Integer strokeCap,
-                                              @Nullable
-                                              Integer strokeWeight)
        -
        Converts a collection of PEdges into a - LINES shape, having the (optional) styling provided.
        -
        -
        Parameters:
        -
        segments - collection of segments
        -
        strokeColor - nullable/optional (default = RGB.PINK)
        -
        strokeCap - nullable/optional (default = ROUND)
        -
        strokeWeight - nullable/optional (default = 2)
        -
        Returns:
        -
        shape representing segments
        -
        -
        • -
      - - - -
        -
      • -

        filterByMinLength

        -
        public static List<PEdge> filterByMinLength​(List<PEdge> segments,
-                                            double minLength)
        -
        Removes segments having a length less than the given length from a collection - of segmensts.
        -
        -
        Parameters:
        -
        segments - list of segments to filter
        -
        minLength - the minimum segment length to keep
        -
        Returns:
        -
        a filtered copy of input collection
        -
        -
        • -
      - - - -
        -
      • -

        filterByAverageLength

        -
        public static List<PEdge> filterByAverageLength​(List<PEdge> segments,
-                                                double fraction)
        -
        Removes segments having a length either less than some fraction or more than - 1/fraction of the mean segment length from a collection of - segments. -

        - This method can be used to homogenise a segment set.

        -
        -
        Parameters:
        -
        segments - list of segments to filter
        -
        fraction - fraction of mean length to keep segments
        -
        Returns:
        -
        a filtered copy of input collection
        -
        -
        • -
      - - - -
        -
      • -

        filterAxisAligned

        -
        public static List<PEdge> filterAxisAligned​(List<PEdge> segments,
-                                            double angleDelta)
        -
        Removes axis-aligned (horizontal and vertical) segments (within a given angle - tolerance) from a collection of segments.
        -
        -
        Parameters:
        -
        segments - list of segments to filter
        -
        angleDelta - angle tolerance, in radians
        -
        Returns:
        -
        a filtered copy of the input where axis-aligned segments have been - removed
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/PGS_ShapeBoolean.html b/micycle/pgs/PGS_ShapeBoolean.html deleted file mode 100644 index aa857b56..00000000 --- a/micycle/pgs/PGS_ShapeBoolean.html +++ /dev/null @@ -1,558 +0,0 @@ - - - - - -PGS_ShapeBoolean (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs
-

Class PGS_ShapeBoolean

-
-
- -
-
    -
  • -
    -
    public final class PGS_ShapeBoolean
-extends Object
    -
    Boolean set-operations for 2D shapes.
    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Summary

      - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
      All Methods Static Methods Concrete Methods 
      Modifier and TypeMethodDescription
      static processing.core.PShapecomplement​(processing.core.PShape shape, - double width, - double height) -
      Computes the shape's complement (or inverse) against a plane having the given - dimensions.
      -
      static processing.core.PShapeintersect​(processing.core.PShape a, - processing.core.PShape b) -
      Computes a shape representing the area which is common to both input shapes - (i.e.
      -
      static processing.core.PShapeintersectMesh​(processing.core.PShape mesh, - processing.core.PShape area) -
      Intersects a mesh-like shape / polygonal coverage with a polygonal area, - preserving individual faces/features of the mesh during the operation.
      -
      static processing.core.PShapesubtract​(processing.core.PShape a, - processing.core.PShape b) -
      Subtract is the opposite of Union.
      -
      static processing.core.PShapesubtractMesh​(processing.core.PShape mesh, - processing.core.PShape area) -
      Subtracts a polygonal area from a mesh-like shape / polygonal coverage, - preserving individual faces/features of the mesh during the operation.
      -
      static processing.core.PShapesymDifference​(processing.core.PShape a, - processing.core.PShape b) -
      Computes the parts that the shapes do not have in common.
      -
      static processing.core.PShapeunion​(List<processing.core.PShape> shapes) -
      Unions any variable number of shapes.
      -
      static processing.core.PShapeunion​(processing.core.PShape... shapes) -
      Unions any variable number of shapes.
      -
      static processing.core.PShapeunion​(processing.core.PShape a, - processing.core.PShape b) -
      "Glues" shapes together so they become a single combined shape with the sum - of its areas.
      -
      static processing.core.PShapeunionMesh​(processing.core.PShape mesh) -
      Unions/flattens/merges/dissolves a mesh-like PShape (that is, a GROUP PShape - whose children represent faces that share edges) into a single shape that - represents the boundary of the mesh.
      -
      - -
      • -
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        intersect

        -
        public static processing.core.PShape intersect​(processing.core.PShape a,
-                                               processing.core.PShape b)
        -
        Computes a shape representing the area which is common to both input shapes - (i.e. the shape formed by intersection of a and b). -

        - Note: Intersecting a polygon with a path/linestring will crop the path to the - polygon. -

        - Note: The intersecting parts of faces of a mesh-like shape will be collapsed - into a single area during intersection. To intersect such a shape and - preserve how each face is intersected individually, use - intersectMesh().

        -
        -
        Returns:
        -
        A∩B
        -
        -
        • -
      - - - -
        -
      • -

        intersectMesh

        -
        public static processing.core.PShape intersectMesh​(processing.core.PShape mesh,
-                                                   processing.core.PShape area)
        -
        Intersects a mesh-like shape / polygonal coverage with a polygonal area, - preserving individual faces/features of the mesh during the operation. -

        - When a mesh-like shape / polygonal coverage is intersected with a whole - polygon using intersect(a, b), the result - is a single polygon comprising the combined/dissolved area of all - intersecting mesh faces. Sometimes this behaviour is desired whereas other - times it is not -- this method can be used to preserve how each face is - intersected individually. -

        - Using this method is faster than calling intersect(a, b) repeatedly for every face of a mesh-like shape - a against an area b.

        -
        -
        Parameters:
        -
        mesh - a mesh-like GROUP shape
        -
        area - a polygonal shape
        -
        Returns:
        -
        a GROUP shape, where each child shape is the union of one mesh face - and the area
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        union

        -
        public static processing.core.PShape union​(processing.core.PShape a,
-                                           processing.core.PShape b)
        -
        "Glues" shapes together so they become a single combined shape with the sum - of its areas.
        -
        -
        Returns:
        -
        A∪B
        -
        See Also:
        -
        union(PShape...)
        -
        -
        • -
      - - - -
        -
      • -

        union

        -
        public static processing.core.PShape union​(List<processing.core.PShape> shapes)
        -
        Unions any variable number of shapes.
        -
        -
        Parameters:
        -
        shapes -
        -
        Returns:
        -
        See Also:
        -
        union(PShape, PShape), -union(PShape...)
        -
        -
        • -
      - - - -
        -
      • -

        union

        -
        public static processing.core.PShape union​(processing.core.PShape... shapes)
        -
        Unions any variable number of shapes.
        -
        -
        Parameters:
        -
        shapes - varArgs
        -
        Returns:
        -
        See Also:
        -
        union(PShape, PShape), -union(List)
        -
        -
        • -
      - - - -
        -
      • -

        unionMesh

        -
        public static processing.core.PShape unionMesh​(processing.core.PShape mesh)
        -
        Unions/flattens/merges/dissolves a mesh-like PShape (that is, a GROUP PShape - whose children represent faces that share edges) into a single shape that - represents the boundary of the mesh. This method is optimised for meshes, and - is accordingly much faster than unioning the mesh faces together using other - methods.
        -
        -
        Parameters:
        -
        mesh - a GROUP pshape whose children shapes form a mesh (join/overlap at - edges)
        -
        Returns:
        -
        Since:
        -
        1.2.0
        -
        -
        • -
      - - - -
        -
      • -

        subtract

        -
        public static processing.core.PShape subtract​(processing.core.PShape a,
-                                              processing.core.PShape b)
        -
        Subtract is the opposite of Union. Subtract removes the area of shape - b from a base shape a. A.k.a "difference".
        -
        -
        Returns:
        -
        shape A - shape B
        -
        -
        • -
      - - - -
        -
      • -

        subtractMesh

        -
        public static processing.core.PShape subtractMesh​(processing.core.PShape mesh,
-                                                  processing.core.PShape area)
        -
        Subtracts a polygonal area from a mesh-like shape / polygonal coverage, - preserving individual faces/features of the mesh during the operation. -

        - When polygon is subtracted from a mesh-like shape / polygonal coverage using - subtract(a, b), the result is a - single polygon comprising the combined/dissolved area of all remaining - mesh face parts. Sometimes this behaviour is desired whereas other times it - is not -- this method can be used to preserve how each face is subtracted - from individually. -

        - Using this method is faster than calling subtract(a, b) repeatedly on every face of a mesh-like shape a.

        -
        -
        Parameters:
        -
        mesh - a mesh-like GROUP shape
        -
        area - a polygonal shape
        -
        Returns:
        -
        a GROUP shape, where each child shape is the subtraction of the area - from one mesh face
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        symDifference

        -
        public static processing.core.PShape symDifference​(processing.core.PShape a,
-                                                   processing.core.PShape b)
        -
        Computes the parts that the shapes do not have in common.
        -
        -
        Returns:
        -
        A∪B - A∩B
        -
        -
        • -
      - - - -
        -
      • -

        complement

        -
        public static processing.core.PShape complement​(processing.core.PShape shape,
-                                                double width,
-                                                double height)
        -
        Computes the shape's complement (or inverse) against a plane having the given - dimensions.
        -
        -
        Parameters:
        -
        shape -
        -
        width - width of the rectangle plane to subtract shape from
        -
        height - height of the rectangle plane to subtract shape from
        -
        Returns:
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/PGS_ShapePredicates.html b/micycle/pgs/PGS_ShapePredicates.html deleted file mode 100644 index ced5f81a..00000000 --- a/micycle/pgs/PGS_ShapePredicates.html +++ /dev/null @@ -1,992 +0,0 @@ - - - - - -PGS_ShapePredicates (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs
-

Class PGS_ShapePredicates

-
-
- -
-
    -
  • -
    -
    public final class PGS_ShapePredicates
-extends Object
    -
    Various shape metrics & predicates
    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Summary

      - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
      All Methods Static Methods Concrete Methods 
      Modifier and TypeMethodDescription
      static doublearea​(processing.core.PShape shape) -
      Computes the area of the given shape.
      -
      static processing.core.PVectorcentroid​(processing.core.PShape shape) -
      Computes the centroid of a shape.
      -
      static doublecircularity​(processing.core.PShape shape) -
      Calculates the Miller circularity index for a shape.
      -
      static booleancontains​(processing.core.PShape outer, - processing.core.PShape inner) -
      Determines whether the outer shape contains the inner shape (meaning every - point of the inner shape is a point of the outer shape).
      -
      static booleancontainsAllPoints​(processing.core.PShape shape, - Collection<processing.core.PVector> points) -
      Determines whether a shape contains every point from a list of points.
      -
      static booleancontainsPoint​(processing.core.PShape shape, - processing.core.PVector point) -
      Determines whether a shape contains a point.
      -
      static List<Boolean>containsPoints​(processing.core.PShape shape, - Collection<processing.core.PVector> points) -
      Measures for each point in the input whether it is contained in the given - shape.
      -
      static doubledensity​(processing.core.PShape shape) -
      Computes the ratio (density) of the shape's area compared to the area of it's - envelope.
      -
      static doublediameter​(processing.core.PShape shape) -
      Returns the diameter of a shape.
      -
      static doubledistance​(processing.core.PShape a, - processing.core.PShape b) -
      Computes the minimum distance between two shapes.
      -
      static doubleelongation​(processing.core.PShape shape) -
      Measures the elongation of a shape; the ratio of the shapes bounding box's - length to its width.
      -
      static booleanequalsExact​(processing.core.PShape a, - processing.core.PShape b) -
      Tests two shapes for structural equality.
      -
      static booleanequalsNorm​(processing.core.PShape a, - processing.core.PShape b) -
      Tests two shapes for normalised structural equality.
      -
      static booleanequalsTopo​(processing.core.PShape a, - processing.core.PShape b) -
      Tests two shapes for topological equality.
      -
      static List<processing.core.PVector>findContainedPoints​(processing.core.PShape shape, - Collection<processing.core.PVector> points) -
      Tests for each point in the input whether it is contained in/inside the given - shape; if it is, then the point is included in the output list.
      -
      static processing.core.PShapefindContainingShape​(processing.core.PShape groupShape, - processing.core.PVector point) -
      Finds the single child shape/cell (if any) that contains the query point from - a GROUP shape input (a shape that has non-overlapping children).
      -
      static doubleheight​(processing.core.PShape shape) -
      Computes the vertical height of a shape (the height of its bounding-box).
      -
      static intholes​(processing.core.PShape shape) -
      Computes the number of holes in a shape.
      -
      static booleanintersect​(processing.core.PShape a, - processing.core.PShape b) -
      Determines whether the shapes intersect/overlap (meaning that have at least - one point in common).
      -
      static booleanisConvex​(processing.core.PShape shape) -
      Determines whether a shape is convex.
      -
      static booleanisSimple​(processing.core.PShape shape) -
      Checks whether a shape is simple.
      -
      static doublelength​(processing.core.PShape shape) -
      Returns the length of a shape.
      -
      static doublemaximumInteriorAngle​(processing.core.PShape shape) -
      Computes the maximum/largest interior angle of a polygon.
      -
      static doubleoverlap​(processing.core.PShape a, - processing.core.PShape b) -
      Measures the degree of mutual overlap between two shapes.
      -
      static doublesimilarity​(processing.core.PShape a, - processing.core.PShape b) -
      Measures the degree of similarity between two shapes using the Hausdorff - distance metric.
      -
      static doublesphericity​(processing.core.PShape shape) -
      Measures the sphericity of a shape; the ratio of the maximum inscribed circle - to the minimum bounding circle.
      -
      static booleantouch​(processing.core.PShape a, - processing.core.PShape b) -
      Determines whether the have at least one point in common, but where their - interiors do not intersect.
      -
      static doublewidth​(processing.core.PShape shape) -
      Computes the horizontal width of a shape (the width of its bounding-box).
      -
      - -
      • -
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        contains

        -
        public static boolean contains​(processing.core.PShape outer,
-                               processing.core.PShape inner)
        -
        Determines whether the outer shape contains the inner shape (meaning every - point of the inner shape is a point of the outer shape). A shape is - considered to contain itself itself.
        -
        -
        Parameters:
        -
        outer -
        -
        inner -
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        containsPoint

        -
        public static boolean containsPoint​(processing.core.PShape shape,
-                                    processing.core.PVector point)
        -
        Determines whether a shape contains a point. Points that lie on the boundary - of the shape are considered to be contained.
        -
        -
        Parameters:
        -
        shape -
        -
        point -
        -
        Returns:
        -
        See Also:
        -
        containsAllPoints(PShape, Collection), -containsPoints(PShape, Collection)
        -
        -
        • -
      - - - -
        -
      • -

        containsAllPoints

        -
        public static boolean containsAllPoints​(processing.core.PShape shape,
-                                        Collection<processing.core.PVector> points)
        -
        Determines whether a shape contains every point from a list of points. It is - faster to use method rather than than calling - containsPoint(PShape, PVector) repeatedly. Points that lie on the - boundary of the shape are considered to be contained.
        -
        -
        Parameters:
        -
        shape -
        -
        points - list of points to check
        -
        Returns:
        -
        true if every point is contained within the shape
        -
        -
        • -
      - - - -
        -
      • -

        containsPoints

        -
        public static List<Boolean> containsPoints​(processing.core.PShape shape,
-                                           Collection<processing.core.PVector> points)
        -
        Measures for each point in the input whether it is contained in the given - shape. This method checks every point individually, returning a boolean for - each point. Using this method is faster than calling - containsPoint() repeatedly. Points - that lie on the boundary of the shape are considered to be contained.
        -
        -
        Parameters:
        -
        shape -
        -
        points - list of points to check
        -
        Returns:
        -
        a list of booleans corresponding to whether the shape contains the - point at same index
        -
        -
        • -
      - - - -
        -
      • -

        findContainedPoints

        -
        public static List<processing.core.PVector> findContainedPoints​(processing.core.PShape shape,
-                                                                Collection<processing.core.PVector> points)
        -
        Tests for each point in the input whether it is contained in/inside the given - shape; if it is, then the point is included in the output list. This method - does not mutate the input; it returns a filtered copy. Points that lie on the - boundary of the shape are considered to be contained. -

        - Using this method is faster than calling - containsPoint() repeatedly.

        -
        -
        Parameters:
        -
        shape -
        -
        points - list of points to check
        -
        Returns:
        -
        a filtered view of the input points
        -
        -
        • -
      - - - -
        -
      • -

        findContainingShape

        -
        public static processing.core.PShape findContainingShape​(processing.core.PShape groupShape,
-                                                         processing.core.PVector point)
        -
        Finds the single child shape/cell (if any) that contains the query point from - a GROUP shape input (a shape that has non-overlapping children). -

        - This method locates the containing shape in log(n) time (after some - pre-processing overhead).

        -
        -
        Parameters:
        -
        groupShape - a GROUP shape
        -
        point - the query point
        -
        Returns:
        -
        the child shape that contains the query point, or null if no child - shape contains the point
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        intersect

        -
        public static boolean intersect​(processing.core.PShape a,
-                                processing.core.PShape b)
        -
        Determines whether the shapes intersect/overlap (meaning that have at least - one point in common).
        -
        -
        Parameters:
        -
        a -
        -
        b -
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        touch

        -
        public static boolean touch​(processing.core.PShape a,
-                            processing.core.PShape b)
        -
        Determines whether the have at least one point in common, but where their - interiors do not intersect.
        -
        -
        Parameters:
        -
        a -
        -
        b -
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        distance

        -
        public static double distance​(processing.core.PShape a,
-                              processing.core.PShape b)
        -
        Computes the minimum distance between two shapes.
        -
        -
        Parameters:
        -
        a - shape A
        -
        b - shape B
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        area

        -
        public static double area​(processing.core.PShape shape)
        -
        Computes the area of the given shape.
        -
        -
        Parameters:
        -
        shape -
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        density

        -
        public static double density​(processing.core.PShape shape)
        -
        Computes the ratio (density) of the shape's area compared to the area of it's - envelope.
        -
        -
        Parameters:
        -
        shape -
        -
        Returns:
        -
        Density value. A rectangular shape will have a value of 1.
        -
        -
        • -
      - - - -
        -
      • -

        centroid

        -
        public static processing.core.PVector centroid​(processing.core.PShape shape)
        -
        Computes the centroid of a shape. A centroid is the center of mass of the - shape.
        -
        -
        Parameters:
        -
        shape -
        -
        Returns:
        -
        null if point is empty (geometry empty)
        -
        -
        • -
      - - - -
        -
      • -

        width

        -
        public static double width​(processing.core.PShape shape)
        -
        Computes the horizontal width of a shape (the width of its bounding-box).
        -
        • -
      - - - -
        -
      • -

        height

        -
        public static double height​(processing.core.PShape shape)
        -
        Computes the vertical height of a shape (the height of its bounding-box).
        -
        • -
      - - - -
        -
      • -

        length

        -
        public static double length​(processing.core.PShape shape)
        -
        Returns the length of a shape. Linear shapes return their length; areal - shapes (polygons) return their perimeter.
        -
        • -
      - - - -
        -
      • -

        diameter

        -
        public static double diameter​(processing.core.PShape shape)
        -
        Returns the diameter of a shape. Diameter is the maximum distance between any - 2 coordinates on the shape perimeter; this is equal to the diameter of the - circumscribed circle.
        -
        -
        Parameters:
        -
        shape -
        -
        Returns:
        -
        Since:
        -
        1.1.3
        -
        -
        • -
      - - - -
        -
      • -

        circularity

        -
        public static double circularity​(processing.core.PShape shape)
        -
        Calculates the Miller circularity index for a shape. This index, between 0 - and 1, is equal to 1 if the polygon is perfectly circular and tends towards 0 - for a segment.
        -
        -
        Parameters:
        -
        shape -
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        similarity

        -
        public static double similarity​(processing.core.PShape a,
-                                processing.core.PShape b)
        -
        Measures the degree of similarity between two shapes using the Hausdorff - distance metric. The measure is normalized to lie in the range [0, 1]. Higher - measures indicate a great degree of similarity.
        -
        -
        Parameters:
        -
        a - first shape
        -
        b - second shape
        -
        Returns:
        -
        the value of the similarity measure, in [0.0, 1.0]
        -
        -
        • -
      - - - -
        -
      • -

        overlap

        -
        public static double overlap​(processing.core.PShape a,
-                             processing.core.PShape b)
        -
        Measures the degree of mutual overlap between two shapes. -

        - This metric aggregates how much each shape is overlapped (fractional), - weighted by its respective area.

        -
        -
        Parameters:
        -
        a - first shape
        -
        b - second shape
        -
        Returns:
        -
        overlap metric, in [0.0, 1.0]
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        sphericity

        -
        public static double sphericity​(processing.core.PShape shape)
        -
        Measures the sphericity of a shape; the ratio of the maximum inscribed circle - to the minimum bounding circle.
        -
        -
        Parameters:
        -
        shape -
        -
        Returns:
        -
        a value in [0, 1]
        -
        -
        • -
      - - - -
        -
      • -

        elongation

        -
        public static double elongation​(processing.core.PShape shape)
        -
        Measures the elongation of a shape; the ratio of the shapes bounding box's - length to its width.
        -
        -
        Parameters:
        -
        shape -
        -
        Returns:
        -
        a value in [0, 1]
        -
        -
        • -
      - - - -
        -
      • -

        holes

        -
        public static int holes​(processing.core.PShape shape)
        -
        Computes the number of holes in a shape.
        -
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        maximumInteriorAngle

        -
        public static double maximumInteriorAngle​(processing.core.PShape shape)
        -
        Computes the maximum/largest interior angle of a polygon.
        -
        -
        Parameters:
        -
        shape - polygonal shape
        -
        Returns:
        -
        an angle in the range [0, 2PI]
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        equalsExact

        -
        public static boolean equalsExact​(processing.core.PShape a,
-                                  processing.core.PShape b)
        -
        Tests two shapes for structural equality. In simple terms, this means - that they must have the same number of vertices, in the same locations, and - in the same order. -

        - Note: If two Polygons have matching vertices, but one is arranged clockwise - while the other is counter-clockwise, then then this method will return - false.

        -
        -
        Parameters:
        -
        a - shape a
        -
        b - shape b
        -
        Returns:
        -
        true if both shapes have identical structure and point values.
        -
        Since:
        -
        1.3.0
        -
        See Also:
        -
        equalsNorm(PShape, PShape), -equalsTopo(PShape, PShape)
        -
        -
        • -
      - - - -
        -
      • -

        equalsNorm

        -
        public static boolean equalsNorm​(processing.core.PShape a,
-                                 processing.core.PShape b)
        -
        Tests two shapes for normalised structural equality. In simple terms, - this means that they must have the same number of vertices in the same - locations. Unlike equalsExact(PShape, PShape), vertices do not need - to be in the same order for the shapes to be considered equal.
        -
        -
        Parameters:
        -
        a - shape a
        -
        b - shape b
        -
        Returns:
        -
        true the shapes are exactly equal in their normalized form
        -
        Since:
        -
        1.3.0
        -
        See Also:
        -
        equalsExact(PShape, PShape), -equalsTopo(PShape, PShape)
        -
        -
        • -
      - - - -
        -
      • -

        equalsTopo

        -
        public static boolean equalsTopo​(processing.core.PShape a,
-                                 processing.core.PShape b)
        -
        Tests two shapes for topological equality. In simple terms, this is - equivalent to drawing the two shapes and seeing if all of their component - edges overlap. It is the most robust kind of comparison but also the most - computationally expensive.
        -
        -
        Parameters:
        -
        a - shape a
        -
        b - shape b
        -
        Returns:
        -
        true if the two shapes are topologically equal
        -
        Since:
        -
        1.3.0
        -
        See Also:
        -
        equalsExact(PShape, PShape), -equalsTopo(PShape, PShape)
        -
        -
        • -
      - - - -
        -
      • -

        isSimple

        -
        public static boolean isSimple​(processing.core.PShape shape)
        -
        Checks whether a shape is simple. A shape is simple if it has no points of - self-tangency, self-intersection or other anomalous points.
        -
        • -
      - - - -
        -
      • -

        isConvex

        -
        public static boolean isConvex​(processing.core.PShape shape)
        -
        Determines whether a shape is convex. A shape is convex if its interior - angles are all less than or equal to 180°.
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/PGS_Tiling.html b/micycle/pgs/PGS_Tiling.html deleted file mode 100644 index 9e5041dd..00000000 --- a/micycle/pgs/PGS_Tiling.html +++ /dev/null @@ -1,711 +0,0 @@ - - - - - -PGS_Tiling (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs
-

Class PGS_Tiling

-
-
- -
-
    -
  • -
    -
    public final class PGS_Tiling
-extends Object
    -
    Tiling, tessellation and subdivision of the plane using periodic or - non-periodic geometric shapes. -

    - A tiling is created when a collection of plane figures (tileCount) fills a - plane such that no gaps occur between the tileCount and no two tileCount - overlap each other.

    -
    -
    Since:
    -
    1.2.0
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Summary

      - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
      All Methods Static Methods Concrete Methods 
      Modifier and TypeMethodDescription
      static List<processing.core.PVector>doyleSpiral​(double centerX, - double centerY, - int p, - int q, - double maxRadius) -
      Generates a Doyle spiral.
      -
      static processing.core.PShapehatchSubdivision​(double width, - double height, - int gridCountX, - int gridCountY, - long seed) -
      Randomly subdivides the plane into equal-width strips having varying lengths.
      -
      static processing.core.PShapehexTiling​(double width, - double height, - double sideLength, - boolean flat) -
      Generates a hexagonal tiling of the plane.
      -
      static processing.core.PShapeislamicTiling​(double width, - double height, - double w, - double h) -
      Generates an "islamic-style" (Girih) tiling of the plane.
      -
      static processing.core.PShapepenroseTiling​(double centerX, - double centerY, - double radius, - int steps) -
      Generates a Penrose Tiling (consisting of rhombi).
      -
      static processing.core.PShapequadSubdivision​(double width, - double height, - int depth) -
      Recursively and randomly subdivides the given/bounded plane into convex quad - polygons.
      -
      static processing.core.PShapequadSubdivision​(double width, - double height, - int depth, - long seed) -
      Recursively and randomly subdivides the given/bounded plane into convex quad - polygons.
      -
      static processing.core.PShaperectSubdivision​(double width, - double height, - int maxDepth) -
      Recursively and randomly subdivides the given/bounded plane into rectangles.
      -
      static processing.core.PShaperectSubdivision​(double width, - double height, - int maxDepth, - long seed) -
      Recursively and randomly subdivides the given/bounded plane into rectangles.
      -
      static processing.core.PShapesquareTriangleTiling​(double width, - double height, - double tileSize) -
      Generates a non-periodic tiling, comprising squares and equilateral - triangles.
      -
      static processing.core.PShapesquareTriangleTiling​(double width, - double height, - double tileSize, - long seed) -
      Generates a non-periodic tiling, comprising squares and equilateral - triangles, having a given seed.
      -
      static processing.core.PShapetriangleSubdivision​(double width, - double height, - int maxDepth) -
      Recursively and randomly subdivides the given/bounded plane into triangles.
      -
      static processing.core.PShapetriangleSubdivision​(double width, - double height, - int maxDepth, - long seed) -
      Recursively and randomly subdivides the given/bounded plane into triangles.
      -
      - -
      • -
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        rectSubdivision

        -
        public static processing.core.PShape rectSubdivision​(double width,
-                                                     double height,
-                                                     int maxDepth)
        -
        Recursively and randomly subdivides the given/bounded plane into rectangles.
        -
        -
        Parameters:
        -
        width - width of the quad subdivision plane
        -
        height - height of the quad subdivision plane
        -
        maxDepth - maximum number of subdivisions (recursion depth)
        -
        Returns:
        -
        a GROUP PShape, where each child shape is a face of the subdivision
        -
        See Also:
        -
        seeded rectSubdivsion()
        -
        -
        • -
      - - - -
        -
      • -

        rectSubdivision

        -
        public static processing.core.PShape rectSubdivision​(double width,
-                                                     double height,
-                                                     int maxDepth,
-                                                     long seed)
        -
        Recursively and randomly subdivides the given/bounded plane into rectangles.
        -
        -
        Parameters:
        -
        width - width of the quad subdivision plane
        -
        height - height of the quad subdivision plane
        -
        maxDepth - maximum number of subdivisions (recursion depth)
        -
        seed - the random seed
        -
        Returns:
        -
        a GROUP PShape, where each child shape is a face of the subdivision
        -
        See Also:
        -
        non-seeded rectSubdivsion()
        -
        -
        • -
      - - - -
        -
      • -

        triangleSubdivision

        -
        public static processing.core.PShape triangleSubdivision​(double width,
-                                                         double height,
-                                                         int maxDepth)
        -
        Recursively and randomly subdivides the given/bounded plane into triangles.
        -
        -
        Parameters:
        -
        width - width of the subdivision plane
        -
        height - height of the subdivision plane
        -
        maxDepth - maximum number of subdivisions (recursion depth)
        -
        Returns:
        -
        a GROUP PShape, where each child shape is a face of the subdivision
        -
        See Also:
        -
        seeded - triangleSubdivsion()
        -
        -
        • -
      - - - -
        -
      • -

        triangleSubdivision

        -
        public static processing.core.PShape triangleSubdivision​(double width,
-                                                         double height,
-                                                         int maxDepth,
-                                                         long seed)
        -
        Recursively and randomly subdivides the given/bounded plane into triangles.
        -
        -
        Parameters:
        -
        width - width of the subdivision plane
        -
        height - height of the subdivision plane
        -
        maxDepth - maximum number of subdivisions (recursion depth)
        -
        seed - the random seed
        -
        Returns:
        -
        a GROUP PShape, where each child shape is a face of the subdivision
        -
        See Also:
        -
        non-seeded - triangleSubdivision()
        -
        -
        • -
      - - - -
        -
      • -

        quadSubdivision

        -
        public static processing.core.PShape quadSubdivision​(double width,
-                                                     double height,
-                                                     int depth)
        -
        Recursively and randomly subdivides the given/bounded plane into convex quad - polygons.
        -
        -
        Parameters:
        -
        width - width of the plane that is subdivided
        -
        height - height of the plane that is subdivided
        -
        depth - number of subdivisions (recursion depth)
        -
        Returns:
        -
        a GROUP PShape, where each child shape is a face of the subdivision
        -
        See Also:
        -
        seeded quadSubdivision()
        -
        -
        • -
      - - - -
        -
      • -

        quadSubdivision

        -
        public static processing.core.PShape quadSubdivision​(double width,
-                                                     double height,
-                                                     int depth,
-                                                     long seed)
        -
        Recursively and randomly subdivides the given/bounded plane into convex quad - polygons.
        -
        -
        Parameters:
        -
        width - width of the quad subdivision plane
        -
        height - height of the quad subdivision plane
        -
        depth - number of subdivisions (recursion depth)
        -
        seed - the random seed
        -
        Returns:
        -
        a GROUP PShape, where each child shape is a face of the subdivision
        -
        See Also:
        -
        non-seeded quadSubdivision()
        -
        -
        • -
      - - - -
        -
      • -

        hatchSubdivision

        -
        public static processing.core.PShape hatchSubdivision​(double width,
-                                                      double height,
-                                                      int gridCountX,
-                                                      int gridCountY,
-                                                      long seed)
        -
        Randomly subdivides the plane into equal-width strips having varying lengths.
        -
        -
        Parameters:
        -
        width - width of the subdivision plane
        -
        height - height of the subdivision plane
        -
        gridCountX - horizontal grid count
        -
        gridCountY - vertical grid count
        -
        seed - the random seed
        -
        Returns:
        -
        a GROUP PShape, where each child shape is a face of the subdivision
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        doyleSpiral

        -
        public static List<processing.core.PVector> doyleSpiral​(double centerX,
-                                                        double centerY,
-                                                        int p,
-                                                        int q,
-                                                        double maxRadius)
        -
        Generates a Doyle spiral. A Doyle spiral fills the plane with closely packed - circles, where the radius of each circle in a packing is proportional to the - distance of its centre from a central point. Each circle is tangent to six - others that surround it by a ring of tangent circles
        -
        -
        Parameters:
        -
        centerX - x coordinate of the center of the spiral
        -
        centerY - y coordinate of the center of the spiral
        -
        p - at least 2
        -
        q - at least p + 1
        -
        maxRadius - the maximum radius of the packing arrangement (the maximum - distance a circle centroid can be from the center of the - arrangement)
        -
        Returns:
        -
        A list of PVectors, each representing one circle in the spiral: (.x, - .y) represent the center point and .z represents radius.
        -
        -
        • -
      - - - -
        -
      • -

        hexTiling

        -
        public static processing.core.PShape hexTiling​(double width,
-                                               double height,
-                                               double sideLength,
-                                               boolean flat)
        -
        Generates a hexagonal tiling of the plane.
        -
        -
        Parameters:
        -
        width - width of the tiling plane
        -
        height - height of the tiling plane
        -
        sideLength - side length of each hexagon
        -
        flat - determines the orientation of the hexagons -- whether the - top is flat, or pointy
        -
        Returns:
        -
        a GROUP PShape, where each child shape is a hexagon of the tiling
        -
        -
        • -
      - - - -
        -
      • -

        islamicTiling

        -
        public static processing.core.PShape islamicTiling​(double width,
-                                                   double height,
-                                                   double w,
-                                                   double h)
        -
        Generates an "islamic-style" (Girih) tiling of the plane.
        -
        -
        Parameters:
        -
        width - width of the tiling plane
        -
        height - height of the tiling plane
        -
        w -
        -
        h -
        -
        Returns:
        -
        a GROUP PShape, where each child shape is a tile of the tiling
        -
        -
        • -
      - - - -
        -
      • -

        penroseTiling

        -
        public static processing.core.PShape penroseTiling​(double centerX,
-                                                   double centerY,
-                                                   double radius,
-                                                   int steps)
        -
        Generates a Penrose Tiling (consisting of rhombi).
        -
        -
        Parameters:
        -
        centerX - x coordinate of the center/origin of the tiling
        -
        centerY - y coordinate of the center/origin of the tiling
        -
        radius - maximum radius of the tiling (measured from the center)
        -
        steps - number of tiling subdivisions
        -
        Returns:
        -
        a GROUP PShape, where each child shape is a face of the tiling
        -
        -
        • -
      - - - -
        -
      • -

        squareTriangleTiling

        -
        public static processing.core.PShape squareTriangleTiling​(double width,
-                                                          double height,
-                                                          double tileSize)
        -
        Generates a non-periodic tiling, comprising squares and equilateral - triangles.
        -
        -
        Parameters:
        -
        width - width of the tiling plane
        -
        height - height of the tiling plane
        -
        tileSize - diameter of each tile
        -
        Returns:
        -
        a GROUP PShape, where each child shape is a tile of the tiling
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        squareTriangleTiling

        -
        public static processing.core.PShape squareTriangleTiling​(double width,
-                                                          double height,
-                                                          double tileSize,
-                                                          long seed)
        -
        Generates a non-periodic tiling, comprising squares and equilateral - triangles, having a given seed.
        -
        -
        Parameters:
        -
        width - width of the tiling plane
        -
        height - height of the tiling plane
        -
        tileSize - diameter of each tile
        -
        seed - the random seed
        -
        Returns:
        -
        a GROUP PShape, where each child shape is a tile of the tiling
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/PGS_Transformation.html b/micycle/pgs/PGS_Transformation.html deleted file mode 100644 index 1c9941eb..00000000 --- a/micycle/pgs/PGS_Transformation.html +++ /dev/null @@ -1,919 +0,0 @@ - - - - - -PGS_Transformation (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs
-

Class PGS_Transformation

-
-
- -
-
    -
  • -
    -
    public final class PGS_Transformation
-extends Object
    -
    Various geometric and affine transformations for PShapes that affect vertex - coordinates. -

    - Notably, these transformation methods affect the vertex coordinates of - PShapes, unlike Processing's transform methods that affect the affine matrix - of shapes only (and thereby leave vertex coordinates in-tact).

    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Summary

      - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
      All Methods Static Methods Concrete Methods Deprecated Methods 
      Modifier and TypeMethodDescription
      static processing.core.PShapeflipHorizontal​(processing.core.PShape shape) -
      Flips the shape horizontally based on its centre point.
      -
      static processing.core.PShapeflipHorizontal​(processing.core.PShape shape, - double y) -
      Flips the shape horizontally based on a line given by its Y location.
      -
      static processing.core.PShapeflipVertical​(processing.core.PShape shape) -
      Flips the shape vertically based on its centre point.
      -
      static processing.core.PShapeflipVertical​(processing.core.PShape shape, - double x) -
      Flips the shape vertically based on a line given by its X location.
      -
      static processing.core.PShapehomotheticTransformation​(processing.core.PShape shape, - processing.core.PVector center, - double scaleX, - double scaleY) -
      Calculates a Homothetic Transformation of a shape.
      -
      static processing.core.PShapeoriginScale​(processing.core.PShape shape, - double scale) -
      Scales a shape relative to the origin (0,0).
      -
      static processing.core.PShaperesize​(processing.core.PShape shape, - double targetWidth, - double targetHeight) -
      Resizes a shape (based on its envelope) to the given dimensions, relative to - its center point.
      -
      static processing.core.PShaperesizeByHeight​(processing.core.PShape shape, - double targetHeight) -
      Resizes a shape (based on its envelope) to the given height relative to its - center point; the width is resized accordingly to maintain the shape's aspect - ratio.
      -
      static processing.core.PShaperesizeByMajorAxis​(processing.core.PShape shape, - double targetSize) -
      Resizes a shape (based on the longest axis of its envelope) to the given size - relative to its center point.
      -
      static processing.core.PShaperesizeByWidth​(processing.core.PShape shape, - double targetWidth) -
      Resizes a shape (based on its envelope) to the given width relative to its - center point; the height is resized accordingly to maintain the shape's - aspect ratio.
      -
      static processing.core.PShaperotate​(processing.core.PShape shape, - processing.core.PVector point, - double angle) -
      Rotates a shape around a given point.
      -
      static processing.core.PShaperotateAroundCenter​(processing.core.PShape shape, - double angle) -
      Rotates a shape around its centroid.
      -
      static processing.core.PShapescale​(processing.core.PShape shape, - double scale) -
      Scales the shape relative to its center point.
      -
      static processing.core.PShapescale​(processing.core.PShape shape, - double scaleX, - double scaleY) -
      Scales the shape relative to its center point.
      -
      static processing.core.PShapeshear​(processing.core.PShape shape, - double angleX, - double angleY) -
      Objects are sheared around their relative position to the origin.
      -
      static processing.core.PShapetouchScale​(processing.core.PShape shape, - processing.core.PShape boundary, - double tolerance) -
      Scales a shape (based on its centroid) so that it touches the boundary of - another shape.
      -
      static processing.core.PShapetranslate​(processing.core.PShape shape, - double x, - double y) -
      Translates a shape by the given coordinates.
      -
      static processing.core.PShapetranslateCentroidTo​(processing.core.PShape shape, - double x, - double y) -
      Translates a shape such that its centroid is equivalent to the given - coordinates.
      -
      static processing.core.PShapetranslateCornerTo​(processing.core.PShape shape, - double x, - double y) -
      Translates a shape such that the upper-left corner of its bounding box - is equivalent to the given coordinates.
      -
      static processing.core.PShapetranslateEnvelopeTo​(processing.core.PShape shape, - double x, - double y) -
      Translates a shape such that the centroid of its bounding box - is equivalent to the given coordinates.
      -
      static processing.core.PShapetranslateTo​(processing.core.PShape shape, - double x, - double y) -
      Deprecated. -
      Use translateCentroidTo() instead.
      -
      -
      static processing.core.PShapetranslateToOrigin​(processing.core.PShape shape) -
      Translates a shape such that the top-left corner of its bounding box is at - (0, 0) (in Processing coordinates).
      -
      - -
      • -
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        scale

        -
        public static processing.core.PShape scale​(processing.core.PShape shape,
-                                           double scale)
        -
        Scales the shape relative to its center point.
        -
        -
        Parameters:
        -
        shape -
        -
        scale - X and Y axis scale factor
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        scale

        -
        public static processing.core.PShape scale​(processing.core.PShape shape,
-                                           double scaleX,
-                                           double scaleY)
        -
        Scales the shape relative to its center point.
        -
        -
        Parameters:
        -
        shape -
        -
        scaleX - X-axis scale factor
        -
        scaleY - Y-axis scale factor
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        originScale

        -
        public static processing.core.PShape originScale​(processing.core.PShape shape,
-                                                 double scale)
        -
        Scales a shape relative to the origin (0,0).
        -
        -
        Parameters:
        -
        shape -
        -
        scale - scale factor
        -
        Returns:
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        resize

        -
        public static processing.core.PShape resize​(processing.core.PShape shape,
-                                            double targetWidth,
-                                            double targetHeight)
        -
        Resizes a shape (based on its envelope) to the given dimensions, relative to - its center point.
        -
        -
        Parameters:
        -
        shape -
        -
        targetWidth - width of the output copy
        -
        targetHeight - height of the output copy
        -
        Returns:
        -
        resized copy of input shape
        -
        -
        • -
      - - - -
        -
      • -

        resizeByWidth

        -
        public static processing.core.PShape resizeByWidth​(processing.core.PShape shape,
-                                                   double targetWidth)
        -
        Resizes a shape (based on its envelope) to the given width relative to its - center point; the height is resized accordingly to maintain the shape's - aspect ratio.
        -
        -
        Parameters:
        -
        shape - the shape to resize
        -
        targetWidth - width of the output
        -
        Returns:
        -
        resized copy of input shape
        -
        Since:
        -
        1.3.0
        -
        See Also:
        -
        resizeByHeight(PShape, double), -#resizeByLargest(PShape, double)
        -
        -
        • -
      - - - -
        -
      • -

        resizeByHeight

        -
        public static processing.core.PShape resizeByHeight​(processing.core.PShape shape,
-                                                    double targetHeight)
        -
        Resizes a shape (based on its envelope) to the given height relative to its - center point; the width is resized accordingly to maintain the shape's aspect - ratio.
        -
        -
        Parameters:
        -
        shape - the shape to resize
        -
        targetHeight - height of the output
        -
        Returns:
        -
        resized copy of input shape
        -
        Since:
        -
        1.3.0 resized copy of input shape
        -
        See Also:
        -
        resizeByWidth(PShape, double), -#resizeByLargest(PShape, double)
        -
        -
        • -
      - - - -
        -
      • -

        resizeByMajorAxis

        -
        public static processing.core.PShape resizeByMajorAxis​(processing.core.PShape shape,
-                                                       double targetSize)
        -
        Resizes a shape (based on the longest axis of its envelope) to the given size - relative to its center point. -

        - For example, if the shape's width is larger than its height, the width is set - to targetSize and the height is resized to maintain the shape's - aspect ratio.

        -
        -
        Parameters:
        -
        shape - the shape to resize
        -
        targetLargest - the new length of its longest axis
        -
        Returns:
        -
        resized copy of input shape
        -
        Since:
        -
        1.3.0
        -
        See Also:
        -
        resizeByWidth(PShape, double), -resizeByHeight(PShape, double)
        -
        -
        • -
      - - - -
        -
      • -

        touchScale

        -
        public static processing.core.PShape touchScale​(processing.core.PShape shape,
-                                                processing.core.PShape boundary,
-                                                double tolerance)
        -
        Scales a shape (based on its centroid) so that it touches the boundary of - another shape. The scaling shape's centroid must lie outside the other shape.
        -
        -
        Parameters:
        -
        shape - the shape to scale. its centroid should be outside container
        -
        boundary -
        -
        tolerance - >=0
        -
        -
        • -
      - - - -
        -
      • -

        translate

        -
        public static processing.core.PShape translate​(processing.core.PShape shape,
-                                               double x,
-                                               double y)
        -
        Translates a shape by the given coordinates.
        -
        -
        Parameters:
        -
        shape - shape to translate
        -
        x - the value to translate by in the x direction
        -
        y - the value to translate by in the x direction
        -
        Returns:
        -
        translated copy of input
        -
        -
        • -
      - - - -
        -
      • -

        translateTo

        -
        public static processing.core.PShape translateTo​(processing.core.PShape shape,
-                                                 double x,
-                                                 double y)
        -
        Deprecated. -
        Use translateCentroidTo() instead.
        -
        -
        Translates a shape such that its centroid is equivalent to the given - coordinates.
        -
        -
        Parameters:
        -
        shape - shape to translate
        -
        x - target centroid X
        -
        y - target centroid Y
        -
        Returns:
        -
        translated shape
        -
        -
        • -
      - - - -
        -
      • -

        translateCentroidTo

        -
        public static processing.core.PShape translateCentroidTo​(processing.core.PShape shape,
-                                                         double x,
-                                                         double y)
        -
        Translates a shape such that its centroid is equivalent to the given - coordinates. -

        - The centroid of a polygon corresponds to its "center of mass".

        -
        -
        Parameters:
        -
        shape - shape to translate
        -
        x - target centroid X
        -
        y - target centroid Y
        -
        Returns:
        -
        translated shape
        -
        Since:
        -
        1.3.0 (superceeds translateTo()
        -
        -
        • -
      - - - -
        -
      • -

        translateEnvelopeTo

        -
        public static processing.core.PShape translateEnvelopeTo​(processing.core.PShape shape,
-                                                         double x,
-                                                         double y)
        -
        Translates a shape such that the centroid of its bounding box - is equivalent to the given coordinates. This method differs a little from - translateTo() because that uses - center of shape's "mass", whereas this is visual center (however both are - usually similar, if not identical).
        -
        -
        Parameters:
        -
        shape - shape to translate
        -
        x - the x-coordinate of new position of the shape's bounding box - centroid point
        -
        y - the y-coordinate of new position of the shape's bounding box - centroid point
        -
        Returns:
        -
        translated shape
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        translateCornerTo

        -
        public static processing.core.PShape translateCornerTo​(processing.core.PShape shape,
-                                                       double x,
-                                                       double y)
        -
        Translates a shape such that the upper-left corner of its bounding box - is equivalent to the given coordinates.
        -
        -
        Parameters:
        -
        shape - shape to translate
        -
        x -
        -
        y -
        -
        Returns:
        -
        translated shape
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        translateToOrigin

        -
        public static processing.core.PShape translateToOrigin​(processing.core.PShape shape)
        -
        Translates a shape such that the top-left corner of its bounding box is at - (0, 0) (in Processing coordinates).
        -
        -
        Parameters:
        -
        shape -
        -
        Returns:
        -
        translated copy of input
        -
        -
        • -
      - - - -
        -
      • -

        homotheticTransformation

        -
        public static processing.core.PShape homotheticTransformation​(processing.core.PShape shape,
-                                                              processing.core.PVector center,
-                                                              double scaleX,
-                                                              double scaleY)
        -
        Calculates a Homothetic Transformation of a shape. -

        - A Homothetic Transformation is a special geometric transformation that - enlarges or shrinks geometries by a scale factor that is the same in all - directions according to a centric point.

        -
        -
        Parameters:
        -
        shape - shape input
        -
        center - coordinate of the center/origin position of the operation
        -
        scaleX - X scale factor
        -
        scaleY - Y scale factor
        -
        -
        • -
      - - - -
        -
      • -

        rotate

        -
        public static processing.core.PShape rotate​(processing.core.PShape shape,
-                                            processing.core.PVector point,
-                                            double angle)
        -
        Rotates a shape around a given point.
        -
        -
        Parameters:
        -
        shape - the shape to tranform/rotate
        -
        point - rotation point
        -
        angle - the rotation angle, in radians
        -
        Returns:
        -
        See Also:
        -
        rotateAroundCenter(PShape, double)
        -
        -
        • -
      - - - -
        -
      • -

        rotateAroundCenter

        -
        public static processing.core.PShape rotateAroundCenter​(processing.core.PShape shape,
-                                                        double angle)
        -
        Rotates a shape around its centroid.
        -
        -
        Parameters:
        -
        shape -
        -
        angle - the rotation angle, in radians
        -
        Returns:
        -
        See Also:
        -
        rotate(PShape, PVector, double)
        -
        -
        • -
      - - - -
        -
      • -

        flipHorizontal

        -
        public static processing.core.PShape flipHorizontal​(processing.core.PShape shape)
        -
        Flips the shape horizontally based on its centre point.
        -
        -
        Parameters:
        -
        shape -
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        flipHorizontal

        -
        public static processing.core.PShape flipHorizontal​(processing.core.PShape shape,
-                                                    double y)
        -
        Flips the shape horizontally based on a line given by its Y location.
        -
        -
        Parameters:
        -
        shape -
        -
        y - y-coordinate of horizontal reflection line
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        flipVertical

        -
        public static processing.core.PShape flipVertical​(processing.core.PShape shape)
        -
        Flips the shape vertically based on its centre point.
        -
        -
        Parameters:
        -
        shape -
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        flipVertical

        -
        public static processing.core.PShape flipVertical​(processing.core.PShape shape,
-                                                  double x)
        -
        Flips the shape vertically based on a line given by its X location.
        -
        -
        Parameters:
        -
        shape -
        -
        x - x-coordinate of vertical reflection line
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        shear

        -
        public static processing.core.PShape shear​(processing.core.PShape shape,
-                                           double angleX,
-                                           double angleY)
        -
        Objects are sheared around their relative position to the origin.
        -
        -
        Parameters:
        -
        shape -
        -
        angleX - radians
        -
        angleY - radians
        -
        Returns:
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/PGS_Triangulation.html b/micycle/pgs/PGS_Triangulation.html deleted file mode 100644 index 4d3aa930..00000000 --- a/micycle/pgs/PGS_Triangulation.html +++ /dev/null @@ -1,787 +0,0 @@ - - - - - -PGS_Triangulation (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs
-

Class PGS_Triangulation

-
-
- -
-
    -
  • -
    -
    public final class PGS_Triangulation
-extends Object
    -
    Delaunay and earcut triangulation of shapes and point sets.
    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Summary

      - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
      All Methods Static Methods Concrete Methods 
      Modifier and TypeMethodDescription
      static processing.core.PShapedelaunayTriangulation​(Collection<processing.core.PVector> points) -
      Generates a Delaunay Triangulation from a collection of points.
      -
      static processing.core.PShapedelaunayTriangulation​(processing.core.PShape shape) -
      Generates a constrained Delaunay Triangulation from the given shape.
      -
      static processing.core.PShapedelaunayTriangulation​(processing.core.PShape shape, - Collection<processing.core.PVector> steinerPoints, - boolean constrain, - int refinements, - boolean pretty) -
      Generates a Delaunay Triangulation from the given shape.
      -
      static org.tinfour.common.IIncrementalTindelaunayTriangulationMesh​(Collection<processing.core.PVector> points) -
      Generates a Delaunay Triangulation from a collection of points.
      -
      static org.tinfour.common.IIncrementalTindelaunayTriangulationMesh​(processing.core.PShape shape) -
      Generates a constrained Delaunay Triangulation from the given shape.
      -
      static org.tinfour.common.IIncrementalTindelaunayTriangulationMesh​(processing.core.PShape shape, - Collection<processing.core.PVector> steinerPoints, - boolean constrain, - int refinements, - boolean pretty) -
      Generates a Delaunay Triangulation from the given shape.
      -
      static List<processing.core.PVector>delaunayTriangulationPoints​(Collection<processing.core.PVector> points) -
      Generates a Delaunay Triangulation from a collection of points.
      -
      static List<processing.core.PVector>delaunayTriangulationPoints​(processing.core.PShape shape) -
      Generates a constrained Delaunay Triangulation from a collection of points.
      -
      static List<processing.core.PVector>delaunayTriangulationPoints​(processing.core.PShape shape, - Collection<processing.core.PVector> steinerPoints, - boolean constrain, - int refinements, - boolean pretty) -
      Generates a Delaunay Triangulation from the given shape.
      -
      static processing.core.PShapeearCutTriangulation​(processing.core.PShape shape) -
      Computes a triangulation of the shape according to the ear clipping - ("earcut") method.
      -
      static processing.core.PShapepoissonTriangulation​(processing.core.PShape shape, - double spacing) -
      Creates a Delaunay triangulation of the shape where additional steiner - points, populated by poisson sampling, are included.
      -
      static List<processing.core.PVector>poissonTriangulationPoints​(processing.core.PShape shape, - double spacing) -
      Creates a Delaunay triangulation of the shape where additional steiner - points, populated by poisson sampling, are included.
      -
      static org.jgrapht.graph.SimpleGraph<org.tinfour.common.SimpleTriangle,​org.jgrapht.graph.DefaultEdge>toDualGraph​(org.tinfour.common.IIncrementalTin triangulation) -
      Finds the dual-graph of a triangulation.
      -
      static org.jgrapht.graph.SimpleGraph<processing.core.PVector,​PEdge>toGraph​(org.tinfour.common.IIncrementalTin triangulation) -
      Finds the graph equivalent to a triangulation.
      -
      static org.jgrapht.graph.SimpleGraph<org.tinfour.common.Vertex,​org.tinfour.common.IQuadEdge>toTinfourGraph​(org.tinfour.common.IIncrementalTin triangulation) -
      Finds the graph equivalent to a triangulation.
      -
      - -
      • -
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        delaunayTriangulation

        -
        public static processing.core.PShape delaunayTriangulation​(processing.core.PShape shape)
        -
        Generates a constrained Delaunay Triangulation from the given shape.
        -
        -
        Parameters:
        -
        shape - the shape whose vertices to generate a triangulation from
        -
        Returns:
        -
        a GROUP PShape, where each child shape is one triangle
        -
        See Also:
        -
        delaunayTriangulation(PShape, Collection, boolean, int, boolean)
        -
        -
        • -
      - - - -
        -
      • -

        delaunayTriangulation

        -
        public static processing.core.PShape delaunayTriangulation​(processing.core.PShape shape,
-                                                           @Nullable
-                                                           Collection<processing.core.PVector> steinerPoints,
-                                                           boolean constrain,
-                                                           int refinements,
-                                                           boolean pretty)
        -
        Generates a Delaunay Triangulation from the given shape. The triangulation - can be both constrained (meaning the triangulation is masked by the original - shape) and refined (meaning additional points are inserted, usually leading - to more uniform triangle shapes and sizes).
        -
        -
        Parameters:
        -
        shape - the shape whose vertices to generate a triangulation - from
        -
        steinerPoints - A list of additional points to insert into the - triangulation in addition to the vertices of the input - shape. Can be null.
        -
        constrain - Constrain the triangulation output using the shape - boundary (from point set). With shapes, you'll probably - want to this to be true.
        -
        refinements - The number of triangulation refinement passes to - perform. Each pass inserts the centroids of every - existing triangle into the triangulation. Should be 0 or - greater (probably no more than 5).
        -
        pretty - Whether to maintain the Delaunay nature when - constraining the triangulation, and whether to check - that centroid locations lie within the shape during - refinement. When pretty=true, triangles in the - triangulation may be slightly more regular in - shape/size. There is a small performance overhead which - becomes more considerable at higher refinement levels. - When constrain=false and refinements=0, this argument - has no effect.
        -
        Returns:
        -
        a GROUP PShape, where each child shape is one triangle
        -
        See Also:
        -
        delaunayTriangulationPoints(PShape, Collection, boolean, int, boolean), -delaunayTriangulationMesh(PShape, Collection, boolean, int, boolean)
        -
        -
        • -
      - - - -
        -
      • -

        delaunayTriangulation

        -
        public static processing.core.PShape delaunayTriangulation​(Collection<processing.core.PVector> points)
        -
        Generates a Delaunay Triangulation from a collection of points.
        -
        -
        Parameters:
        -
        points - the point collection to triangulate
        -
        Returns:
        -
        a GROUP PShape, where each child shape is one triangle
        -
        Since:
        -
        1.1.0
        -
        See Also:
        -
        delaunayTriangulation(PShape, Collection, boolean, int, boolean)
        -
        -
        • -
      - - - -
        -
      • -

        delaunayTriangulationPoints

        -
        public static List<processing.core.PVector> delaunayTriangulationPoints​(processing.core.PShape shape)
        -
        Generates a constrained Delaunay Triangulation from a collection of points. -

        - This method returns the triangulation as a list of points, rather than a - PShape.

        -
        -
        Parameters:
        -
        shape - the shape whose vertices to generate a triangulation from
        -
        Returns:
        -
        List of PVector coordinates, where each consecutive triplet of - coordinates are the 3 vertices belonging to one triangle
        -
        -
        • -
      - - - -
        -
      • -

        delaunayTriangulationPoints

        -
        public static List<processing.core.PVector> delaunayTriangulationPoints​(processing.core.PShape shape,
-                                                                        @Nullable
-                                                                        Collection<processing.core.PVector> steinerPoints,
-                                                                        boolean constrain,
-                                                                        int refinements,
-                                                                        boolean pretty)
        -
        Generates a Delaunay Triangulation from the given shape. The triangulation - can be both constrained (meaning the triangulation is masked by the original - shape) and refined (meaning additional points are inserted, usually leading - to more uniform triangle shapes and sizes). -

        - This method returns the triangulation as a list of points, rather than a - PShape.

        -
        -
        Parameters:
        -
        shape - the shape whose vertices to generate a triangulation of
        -
        steinerPoints - A list of additional points to insert into the - triangulation in addition to the vertices of the input - shape. Can be null.
        -
        constrain - Constrain the triangulation output using the shape - boundary (from point set). With shapes, you'll probably - want to this to be true.
        -
        refinements - The number of triangulation refinement passes to - perform. Each pass inserts the centroids of every - existing triangle into the triangulation. Should be 0 or - greater (probably no more than 5).
        -
        pretty - Whether to maintain the Delaunay nature when - constraining the triangulation, and whether to check - that centroid locations lie within the shape during - refinement. When pretty=true, triangles in the - triangulation may be slightly more regular in - shape/size. There is a small performance overhead which - becomes more considerable at higher refinement levels. - When constrain=false and refinements=0, this argument - has no effect.
        -
        Returns:
        -
        List of PVector coordinates, where each consecutive triplet of - coordinates are the 3 vertices belonging to one triangle
        -
        See Also:
        -
        delaunayTriangulation(PShape, Collection, boolean, int, boolean), -delaunayTriangulationMesh(PShape, Collection, boolean, int, boolean)
        -
        -
        • -
      - - - -
        -
      • -

        delaunayTriangulationPoints

        -
        public static List<processing.core.PVector> delaunayTriangulationPoints​(Collection<processing.core.PVector> points)
        -
        Generates a Delaunay Triangulation from a collection of points. -

        - This method returns the triangulation as a list of points, rather than a - PShape.

        -
        -
        Parameters:
        -
        points - the point collection to triangulate
        -
        Returns:
        -
        List of PVector coordinates, where each consecutive triplet of - coordinates are the 3 vertices belonging to one triangle
        -
        Since:
        -
        1.1.0
        -
        See Also:
        -
        delaunayTriangulationPoints(PShape, Collection, boolean, int, boolean)
        -
        -
        • -
      - - - -
        -
      • -

        delaunayTriangulationMesh

        -
        public static org.tinfour.common.IIncrementalTin delaunayTriangulationMesh​(processing.core.PShape shape)
        -
        Generates a constrained Delaunay Triangulation from the given shape. -

        - This method returns the triangulation in its raw form: a Triangulated - Irregular Network (mesh).

        -
        -
        Parameters:
        -
        shape - the shape whose vertices to generate a triangulation from
        -
        Returns:
        -
        Triangulated Irregular Network object (mesh)
        -
        See Also:
        -
        delaunayTriangulationMesh(PShape, Collection, boolean, int, boolean)
        -
        -
        • -
      - - - -
        -
      • -

        delaunayTriangulationMesh

        -
        public static org.tinfour.common.IIncrementalTin delaunayTriangulationMesh​(@Nullable
-                                                                           processing.core.PShape shape,
-                                                                           @Nullable
-                                                                           Collection<processing.core.PVector> steinerPoints,
-                                                                           boolean constrain,
-                                                                           int refinements,
-                                                                           boolean pretty)
        -
        Generates a Delaunay Triangulation from the given shape. The triangulation - can be both constrained (meaning the triangulation is masked by the original - shape) and refined (meaning additional points are inserted, usually leading - to more uniform triangle shapes and sizes). -

        - This method returns the triangulation in its raw form: a Triangulated - Irregular Network (mesh).

        -
        -
        Parameters:
        -
        shape - the shape whose vertices to generate a triangulation - from. Can be null.
        -
        steinerPoints - A list of additional points to insert into the - triangulation in addition to the vertices of the input - shape. Can be null.
        -
        constrain - Constrain the triangulation output using the shape - boundary (from point set). With shapes, you'll probably - want to this to be true.
        -
        refinements - The number of triangulation refinement/subdivision - passes to perform. Each pass inserts the centroids of - every existing triangle into the triangulation. Should - be 0 or greater (probably no more than 5).
        -
        pretty - Whether to maintain the Delaunay nature when - constraining the triangulation, and whether to check - that centroid locations lie within the shape during - refinement. When pretty=true, triangles in the - triangulation may be slightly more regular in - shape/size. There is a small performance overhead which - becomes more considerable at higher refinement levels. - When constrain=false and refinements=0, this argument - has no effect.
        -
        Returns:
        -
        Triangulated Irregular Network object (mesh)
        -
        See Also:
        -
        delaunayTriangulation(PShape, Collection, boolean, int, boolean), -delaunayTriangulationPoints(PShape, Collection, boolean, int, boolean)
        -
        -
        • -
      - - - -
        -
      • -

        delaunayTriangulationMesh

        -
        public static org.tinfour.common.IIncrementalTin delaunayTriangulationMesh​(Collection<processing.core.PVector> points)
        -
        Generates a Delaunay Triangulation from a collection of points. -

        - This method returns the triangulation in its raw form: a Triangulated - Irregular Network (mesh).

        -
        -
        Parameters:
        -
        points - the point collection to triangulate
        -
        Returns:
        -
        Triangulated Irregular Network object (mesh)
        -
        Since:
        -
        1.1.0
        -
        See Also:
        -
        delaunayTriangulationMesh(PShape, Collection, boolean, int, boolean)
        -
        -
        • -
      - - - -
        -
      • -

        poissonTriangulation

        -
        public static processing.core.PShape poissonTriangulation​(processing.core.PShape shape,
-                                                          double spacing)
        -
        Creates a Delaunay triangulation of the shape where additional steiner - points, populated by poisson sampling, are included.
        -
        -
        Parameters:
        -
        shape -
        -
        spacing - (Minimum) spacing between poisson points
        -
        Returns:
        -
        a GROUP PShape, where each child shape is one triangle
        -
        See Also:
        -
        poissonTriangulationPoints(PShape, double)
        -
        -
        • -
      - - - -
        -
      • -

        poissonTriangulationPoints

        -
        public static List<processing.core.PVector> poissonTriangulationPoints​(processing.core.PShape shape,
-                                                                       double spacing)
        -
        Creates a Delaunay triangulation of the shape where additional steiner - points, populated by poisson sampling, are included.
        -
        -
        Parameters:
        -
        shape -
        -
        spacing - (Minimum) spacing between poisson points
        -
        Returns:
        -
        list of PVectors, where each successive triplet of PVectors - correspond to the 3 vertices of one triangle
        -
        See Also:
        -
        poissonTriangulation(PShape, double)
        -
        -
        • -
      - - - -
        -
      • -

        earCutTriangulation

        -
        public static processing.core.PShape earCutTriangulation​(processing.core.PShape shape)
        -
        Computes a triangulation of the shape according to the ear clipping - ("earcut") method. The triangulation is constrained to the shape outline.
        -
        -
        Parameters:
        -
        shape - shape whose vertices to triangulate
        -
        Returns:
        -
        a GROUP PShape, where each child shape is one triangle
        -
        Since:
        -
        1.1.0, Supports holes since 1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        toGraph

        -
        public static org.jgrapht.graph.SimpleGraph<processing.core.PVector,​PEdge> toGraph​(org.tinfour.common.IIncrementalTin triangulation)
        -
        Finds the graph equivalent to a triangulation. Graph vertices are - triangulation vertices; graph edges are triangulation edges. -

        - The output is an undirected weighted graph of Processing primitives; edge - weights are their euclidean length of their triangulation equivalent.

        -
        -
        Parameters:
        -
        triangulation - triangulation mesh
        -
        Returns:
        -
        Since:
        -
        1.3.0
        -
        See Also:
        -
        toTinfourGraph(IIncrementalTin), -toDualGraph(IIncrementalTin)
        -
        -
        • -
      - - - -
        -
      • -

        toTinfourGraph

        -
        public static org.jgrapht.graph.SimpleGraph<org.tinfour.common.Vertex,​org.tinfour.common.IQuadEdge> toTinfourGraph​(org.tinfour.common.IIncrementalTin triangulation)
        -
        Finds the graph equivalent to a triangulation. Graph vertices are - triangulation vertices; graph edges are triangulation edges. -

        - The output is an undirected weighted graph of Tinfour primtives; edge weights - are their euclidean length of their triangulation equivalent.

        -
        -
        Parameters:
        -
        triangulation - triangulation mesh
        -
        Returns:
        -
        Since:
        -
        1.3.0
        -
        See Also:
        -
        toGraph(IIncrementalTin), -toDualGraph(IIncrementalTin)
        -
        -
        • -
      - - - -
        -
      • -

        toDualGraph

        -
        public static org.jgrapht.graph.SimpleGraph<org.tinfour.common.SimpleTriangle,​org.jgrapht.graph.DefaultEdge> toDualGraph​(org.tinfour.common.IIncrementalTin triangulation)
        -
        Finds the dual-graph of a triangulation. -

        - A dual graph of a triangulation has a vertex for each constrained triangle of - the input, and an edge connecting each pair of triangles that are adjacent.

        -
        -
        Parameters:
        -
        triangulation - triangulation mesh
        -
        Returns:
        -
        Since:
        -
        1.3.0
        -
        See Also:
        -
        toTinfourGraph(IIncrementalTin)
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/PGS_Voronoi.html b/micycle/pgs/PGS_Voronoi.html deleted file mode 100644 index 279c50a9..00000000 --- a/micycle/pgs/PGS_Voronoi.html +++ /dev/null @@ -1,464 +0,0 @@ - - - - - -PGS_Voronoi (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs
-

Class PGS_Voronoi

-
-
- -
-
    -
  • -
    -
    public final class PGS_Voronoi
-extends Object
    -
    Voronoi Diagrams of shapes and point sets.
    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Summary

      - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
      All Methods Static Methods Concrete Methods 
      Modifier and TypeMethodDescription
      static processing.core.PShapecompoundVoronoi​(processing.core.PShape shape) -
      Generates a Voronoi diagram for a set of disjoint shapes.
      -
      static processing.core.PShapecompoundVoronoi​(processing.core.PShape shape, - double[] bounds) -
      Generates a Voronoi diagram for a set of disjoint shapes.
      -
      static processing.core.PShapeinnerVoronoi​(Collection<processing.core.PVector> points) -
      Generates a Voronoi diagram for a set of points.
      -
      static processing.core.PShapeinnerVoronoi​(Collection<processing.core.PVector> points, - double[] bounds) -
      Generates a Voronoi diagram for a set of points.
      -
      static processing.core.PShapeinnerVoronoi​(processing.core.PShape shape, - boolean constrain) -
      Generates a Voronoi diagram for a single shape, where shape vertices are - voronoi point sites.
      -
      static processing.core.PShapeinnerVoronoi​(processing.core.PShape shape, - boolean constrain, - double[] bounds) -
      Generates a Voronoi diagram for a single shape, where shape vertices are - voronoi point sites.
      -
      - -
      • -
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        innerVoronoi

        -
        public static processing.core.PShape innerVoronoi​(processing.core.PShape shape,
-                                                  boolean constrain)
        -
        Generates a Voronoi diagram for a single shape, where shape vertices are - voronoi point sites. In this method each voronoi cell designates the area - closest to some vertex. -

        - Note: If the input shape is polygonal, the output is sensitive to how densely - populated lines are in the input. Consider processing a shape with - densify(density=~10) method first before using this method on a polygon.

        -
        -
        Parameters:
        -
        shape - a shape whose vertices to use as Voronoi sites
        -
        constrain - whether to constrain the diagram lines to the shape (if - polygonal). When true, output voronoi cells are - cropped/constrained to the shape outline.
        -
        Returns:
        -
        a GROUP PShape, where each child shape is a Voronoi cell
        -
        See Also:
        -
        innerVoronoi(Collection)
        -
        -
        • -
      - - - -
        -
      • -

        innerVoronoi

        -
        public static processing.core.PShape innerVoronoi​(processing.core.PShape shape,
-                                                  boolean constrain,
-                                                  double[] bounds)
        -
        Generates a Voronoi diagram for a single shape, where shape vertices are - voronoi point sites. In this method each voronoi cell designates the area - closest to some vertex. -

        - Note: If the input shape is polygonal, the output is sensitive to how densely - populated lines are in the input. Consider processing a shape with - densify(density=~10) method first before using this method on a polygon.

        -
        -
        Parameters:
        -
        shape - a shape whose vertices to use as Voronoi sites
        -
        constrain - whether to constrain the diagram lines to the shape (if - polygonal). When true, output voronoi cells are - cropped/constrained to the shape outline.
        -
        bounds - an array of the form [minX, minY, maxX, maxY] defining the - boundary of the voronoi diagram. the boundary must fully - contain the shape.
        -
        Returns:
        -
        a GROUP PShape, where each child shape is a Voronoi cell
        -
        See Also:
        -
        innerVoronoi(Collection)
        -
        -
        • -
      - - - -
        -
      • -

        innerVoronoi

        -
        public static processing.core.PShape innerVoronoi​(Collection<processing.core.PVector> points)
        -
        Generates a Voronoi diagram for a set of points. In this method each voronoi - cell designates the area closest to some point.
        -
        -
        Parameters:
        -
        points - the set of points to use as Voronoi sites
        -
        Returns:
        -
        a GROUP PShape, where each child shape is a Voronoi cell
        -
        See Also:
        -
        #innerVoronoi(PShape)
        -
        -
        • -
      - - - -
        -
      • -

        innerVoronoi

        -
        public static processing.core.PShape innerVoronoi​(Collection<processing.core.PVector> points,
-                                                  double[] bounds)
        -
        Generates a Voronoi diagram for a set of points. In this method each voronoi - cell designates the area closest to some point.
        -
        -
        Parameters:
        -
        points - the set of points to use as Voronoi sites
        -
        bounds - an array of the form [minX, minY, maxX, maxY] defining the - boundary of the voronoi diagram. the boundary must fully - contain the points.
        -
        Returns:
        -
        a GROUP PShape, where each child shape is a Voronoi cell
        -
        See Also:
        -
        #innerVoronoi(PShape)
        -
        -
        • -
      - - - -
        -
      • -

        compoundVoronoi

        -
        public static processing.core.PShape compoundVoronoi​(processing.core.PShape shape)
        -
        Generates a Voronoi diagram for a set of disjoint shapes. In this method each - voronoi cell designates the area closest to some individual shape. -

        - Note: Each geometry primitive in a POINTS or LINES - shape is treated as a distinct voronoi site (rather than a singular site - representing the full mass of points or lines).

        -
        -
        Parameters:
        -
        shape - a GROUP PShape consisting of any number of non-intersecting - polygonal, lineal, or points child shapes
        -
        Returns:
        -
        a GROUP PShape, where each child shape is a Voronoi cell, bounded by - the envelope all shapes
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      - - - -
        -
      • -

        compoundVoronoi

        -
        public static processing.core.PShape compoundVoronoi​(processing.core.PShape shape,
-                                                     double[] bounds)
        -
        Generates a Voronoi diagram for a set of disjoint shapes. In this method each - voronoi cell designates the area closest to some individual shape. -

        - Note: Each geometry primitive in a POINTS or LINES - shape is treated as a distinct voronoi site (rather than a singular site - representing the full mass of points or lines).

        -
        -
        Parameters:
        -
        shape - a GROUP PShape consisting of any number of non-intersecting - polygonal, lineal, or points child shapes
        -
        bounds - an array of the form [minX, minY, maxX, maxY] defining the - boundary of the voronoi diagram. the boundary must fully - contain the shape.
        -
        Returns:
        -
        a GROUP PShape, where each child shape is a Voronoi cell, bounded by - the envelope all shapes
        -
        Since:
        -
        1.3.0
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/class-use/PGS_CirclePacking.html b/micycle/pgs/class-use/PGS_CirclePacking.html deleted file mode 100644 index 0fb9604a..00000000 --- a/micycle/pgs/class-use/PGS_CirclePacking.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.PGS_CirclePacking (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.PGS_CirclePacking

-
-
No usage of micycle.pgs.PGS_CirclePacking
-
- - - diff --git a/micycle/pgs/class-use/PGS_Coloring.ColoringAlgorithm.html b/micycle/pgs/class-use/PGS_Coloring.ColoringAlgorithm.html deleted file mode 100644 index 7293272f..00000000 --- a/micycle/pgs/class-use/PGS_Coloring.ColoringAlgorithm.html +++ /dev/null @@ -1,284 +0,0 @@ - - - - - -Uses of Class micycle.pgs.PGS_Coloring.ColoringAlgorithm (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.PGS_Coloring.ColoringAlgorithm

-
-
-
    -
  • - - - - - - - - - - - - -
    Packages that use PGS_Coloring.ColoringAlgorithm 
    PackageDescription
    micycle.pgs -
    Processing Geometry Suite is a software project that provides easy access to - geometric algorithms in the form of a Processing library.
    -
    -
    • -
  • - -
    • -
-
-
- - - diff --git a/micycle/pgs/class-use/PGS_Coloring.html b/micycle/pgs/class-use/PGS_Coloring.html deleted file mode 100644 index cea60cff..00000000 --- a/micycle/pgs/class-use/PGS_Coloring.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.PGS_Coloring (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.PGS_Coloring

-
-
No usage of micycle.pgs.PGS_Coloring
-
- - - diff --git a/micycle/pgs/class-use/PGS_Construction.SierpinskiTriCurveType.html b/micycle/pgs/class-use/PGS_Construction.SierpinskiTriCurveType.html deleted file mode 100644 index 15cfea93..00000000 --- a/micycle/pgs/class-use/PGS_Construction.SierpinskiTriCurveType.html +++ /dev/null @@ -1,226 +0,0 @@ - - - - - -Uses of Class micycle.pgs.PGS_Construction.SierpinskiTriCurveType (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.PGS_Construction.SierpinskiTriCurveType

-
-
- -
-
- - - diff --git a/micycle/pgs/class-use/PGS_Construction.html b/micycle/pgs/class-use/PGS_Construction.html deleted file mode 100644 index b998cbd2..00000000 --- a/micycle/pgs/class-use/PGS_Construction.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.PGS_Construction (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.PGS_Construction

-
-
No usage of micycle.pgs.PGS_Construction
-
- - - diff --git a/micycle/pgs/class-use/PGS_Contour.OffsetStyle.html b/micycle/pgs/class-use/PGS_Contour.OffsetStyle.html deleted file mode 100644 index cc0ac52c..00000000 --- a/micycle/pgs/class-use/PGS_Contour.OffsetStyle.html +++ /dev/null @@ -1,256 +0,0 @@ - - - - - -Uses of Class micycle.pgs.PGS_Contour.OffsetStyle (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.PGS_Contour.OffsetStyle

-
-
-
    -
  • - - - - - - - - - - - - -
    Packages that use PGS_Contour.OffsetStyle 
    PackageDescription
    micycle.pgs -
    Processing Geometry Suite is a software project that provides easy access to - geometric algorithms in the form of a Processing library.
    -
    -
    • -
  • - -
    • -
-
-
- - - diff --git a/micycle/pgs/class-use/PGS_Contour.html b/micycle/pgs/class-use/PGS_Contour.html deleted file mode 100644 index 1af9d63b..00000000 --- a/micycle/pgs/class-use/PGS_Contour.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.PGS_Contour (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.PGS_Contour

-
-
No usage of micycle.pgs.PGS_Contour
-
- - - diff --git a/micycle/pgs/class-use/PGS_Conversion.html b/micycle/pgs/class-use/PGS_Conversion.html deleted file mode 100644 index bac399c5..00000000 --- a/micycle/pgs/class-use/PGS_Conversion.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.PGS_Conversion (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.PGS_Conversion

-
-
No usage of micycle.pgs.PGS_Conversion
-
- - - diff --git a/micycle/pgs/class-use/PGS_Hull.html b/micycle/pgs/class-use/PGS_Hull.html deleted file mode 100644 index 783a20ac..00000000 --- a/micycle/pgs/class-use/PGS_Hull.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.PGS_Hull (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.PGS_Hull

-
-
No usage of micycle.pgs.PGS_Hull
-
- - - diff --git a/micycle/pgs/class-use/PGS_Meshing.html b/micycle/pgs/class-use/PGS_Meshing.html deleted file mode 100644 index 40277800..00000000 --- a/micycle/pgs/class-use/PGS_Meshing.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.PGS_Meshing (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.PGS_Meshing

-
-
No usage of micycle.pgs.PGS_Meshing
-
- - - diff --git a/micycle/pgs/class-use/PGS_Morphology.html b/micycle/pgs/class-use/PGS_Morphology.html deleted file mode 100644 index 87f3b67e..00000000 --- a/micycle/pgs/class-use/PGS_Morphology.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.PGS_Morphology (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.PGS_Morphology

-
-
No usage of micycle.pgs.PGS_Morphology
-
- - - diff --git a/micycle/pgs/class-use/PGS_Optimisation.html b/micycle/pgs/class-use/PGS_Optimisation.html deleted file mode 100644 index 0af627c4..00000000 --- a/micycle/pgs/class-use/PGS_Optimisation.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.PGS_Optimisation (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.PGS_Optimisation

-
-
No usage of micycle.pgs.PGS_Optimisation
-
- - - diff --git a/micycle/pgs/class-use/PGS_PointSet.html b/micycle/pgs/class-use/PGS_PointSet.html deleted file mode 100644 index e798dc88..00000000 --- a/micycle/pgs/class-use/PGS_PointSet.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.PGS_PointSet (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.PGS_PointSet

-
-
No usage of micycle.pgs.PGS_PointSet
-
- - - diff --git a/micycle/pgs/class-use/PGS_Processing.html b/micycle/pgs/class-use/PGS_Processing.html deleted file mode 100644 index 47890b11..00000000 --- a/micycle/pgs/class-use/PGS_Processing.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.PGS_Processing (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.PGS_Processing

-
-
No usage of micycle.pgs.PGS_Processing
-
- - - diff --git a/micycle/pgs/class-use/PGS_SegmentSet.html b/micycle/pgs/class-use/PGS_SegmentSet.html deleted file mode 100644 index a000d8e6..00000000 --- a/micycle/pgs/class-use/PGS_SegmentSet.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.PGS_SegmentSet (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.PGS_SegmentSet

-
-
No usage of micycle.pgs.PGS_SegmentSet
-
- - - diff --git a/micycle/pgs/class-use/PGS_ShapeBoolean.html b/micycle/pgs/class-use/PGS_ShapeBoolean.html deleted file mode 100644 index 7aeae80c..00000000 --- a/micycle/pgs/class-use/PGS_ShapeBoolean.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.PGS_ShapeBoolean (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.PGS_ShapeBoolean

-
-
No usage of micycle.pgs.PGS_ShapeBoolean
-
- - - diff --git a/micycle/pgs/class-use/PGS_ShapePredicates.html b/micycle/pgs/class-use/PGS_ShapePredicates.html deleted file mode 100644 index e0aa6a88..00000000 --- a/micycle/pgs/class-use/PGS_ShapePredicates.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.PGS_ShapePredicates (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.PGS_ShapePredicates

-
-
No usage of micycle.pgs.PGS_ShapePredicates
-
- - - diff --git a/micycle/pgs/class-use/PGS_Tiling.html b/micycle/pgs/class-use/PGS_Tiling.html deleted file mode 100644 index 9ed4c584..00000000 --- a/micycle/pgs/class-use/PGS_Tiling.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.PGS_Tiling (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.PGS_Tiling

-
-
No usage of micycle.pgs.PGS_Tiling
-
- - - diff --git a/micycle/pgs/class-use/PGS_Transformation.html b/micycle/pgs/class-use/PGS_Transformation.html deleted file mode 100644 index 19822756..00000000 --- a/micycle/pgs/class-use/PGS_Transformation.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.PGS_Transformation (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.PGS_Transformation

-
-
No usage of micycle.pgs.PGS_Transformation
-
- - - diff --git a/micycle/pgs/class-use/PGS_Triangulation.html b/micycle/pgs/class-use/PGS_Triangulation.html deleted file mode 100644 index 47ddbefb..00000000 --- a/micycle/pgs/class-use/PGS_Triangulation.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.PGS_Triangulation (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.PGS_Triangulation

-
-
No usage of micycle.pgs.PGS_Triangulation
-
- - - diff --git a/micycle/pgs/class-use/PGS_Voronoi.html b/micycle/pgs/class-use/PGS_Voronoi.html deleted file mode 100644 index c3594eb8..00000000 --- a/micycle/pgs/class-use/PGS_Voronoi.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.PGS_Voronoi (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.PGS_Voronoi

-
-
No usage of micycle.pgs.PGS_Voronoi
-
- - - diff --git a/micycle/pgs/commons/ChaikinCut.html b/micycle/pgs/commons/ChaikinCut.html deleted file mode 100644 index 6aa29dd2..00000000 --- a/micycle/pgs/commons/ChaikinCut.html +++ /dev/null @@ -1,279 +0,0 @@ - - - - - -ChaikinCut (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class ChaikinCut

-
-
- -
-
    -
  • -
    -
    public class ChaikinCut
-extends Object
    -
    Chaikin’s corner-cutting algorithm, which is used to perform polygon - smoothing. The algorithm involves repeatedly generating a new curve by - cutting corners off the original (based on some fixed ratio).
    -
    -
    Author:
    -
    Manohar Vanga
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        chaikin

        -
        public static processing.core.PShape chaikin​(processing.core.PShape shape,
-                                             float ratio,
-                                             int iterations)
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/ClosestPointPair.html b/micycle/pgs/commons/ClosestPointPair.html deleted file mode 100644 index b5f16975..00000000 --- a/micycle/pgs/commons/ClosestPointPair.html +++ /dev/null @@ -1,339 +0,0 @@ - - - - - -ClosestPointPair (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class ClosestPointPair

-
-
- -
-
    -
  • -
    -
    public class ClosestPointPair
-extends Object
    -
    An implementation of a divide-and-conquer algorithm for computing the closest - pair of elements of a set of points. -

    - The algorithm consists of constructing an ordered list of points, then - recursively dividing the list into a left and right sublist towards finding - the closest point pairs for each sublist. The two sub-results are merged by - selecting the optimal among them and all closer point pairs that cross the - boundary of separation. Happily, only a linear amount of work is required to - find all closer point pairs that cross the boundary, giving a total runtime - of O(n*log(n)) for the algorithm.

    -
    -
    Author:
    -
    Kevin L. Stern, Adapted for Processing by Michael Carleton
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Constructor Detail

      - - - -
        -
      • -

        ClosestPointPair

        -
        public ClosestPointPair​(Collection<processing.core.PVector> points)
        -
        Construct an instance of the algorithm for the specified point Collection.
        -
        -
        Parameters:
        -
        points - the Collection of points through which to search for the - closest pair.
        -
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        execute

        -
        public List<processing.core.PVector> execute()
        -
        Execute the algorithm.
        -
        -
        Returns:
        -
        a List containing exactly two elements which are the closest - pair of points among those in the collection used to construct this - instance.
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/CornerRounding.html b/micycle/pgs/commons/CornerRounding.html deleted file mode 100644 index b38a5eb2..00000000 --- a/micycle/pgs/commons/CornerRounding.html +++ /dev/null @@ -1,281 +0,0 @@ - - - - - -CornerRounding (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class CornerRounding

-
-
- -
-
    -
  • -
    -
    public final class CornerRounding
-extends Object
    -
    Corner rounding for PShape polygons. Replaces corners with arcs.
    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        round

        -
        public static processing.core.PShape round​(processing.core.PShape shape,
-                                           double extent)
        -
        -
        Parameters:
        -
        shape -
        -
        extent - 0...1
        -
        Returns:
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/DiscreteCurveEvolution.html b/micycle/pgs/commons/DiscreteCurveEvolution.html deleted file mode 100644 index 829e1648..00000000 --- a/micycle/pgs/commons/DiscreteCurveEvolution.html +++ /dev/null @@ -1,344 +0,0 @@ - - - - - -DiscreteCurveEvolution (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class DiscreteCurveEvolution

-
-
- -
-
    -
  • -
    -
    public class DiscreteCurveEvolution
-extends Object
    -
    Convexity Rule for Shape Decomposition Based on Discrete Contour Evolution.
    -
    -
    Author:
    -
    Diego Catalano, Michael Carleton
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Constructor Detail

      - - - -
        -
      • -

        DiscreteCurveEvolution

        -
        public DiscreteCurveEvolution()
        -
        • -
      - - - -
        -
      • -

        DiscreteCurveEvolution

        -
        public DiscreteCurveEvolution​(int vertices)
        -
        -
        Parameters:
        -
        vertices - the number of vertices to preserve
        -
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        process

        -
        public org.locationtech.jts.geom.Coordinate[] process​(org.locationtech.jts.geom.LineString lineString)
        -
        • -
      - - - -
        -
      • -

        process

        -
        public org.locationtech.jts.geom.Coordinate[] process​(org.locationtech.jts.geom.Coordinate[] coords)
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/DoyleSpiral.html b/micycle/pgs/commons/DoyleSpiral.html deleted file mode 100644 index 80b3c1c8..00000000 --- a/micycle/pgs/commons/DoyleSpiral.html +++ /dev/null @@ -1,336 +0,0 @@ - - - - - -DoyleSpiral (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class DoyleSpiral

-
-
- -
-
    -
  • -
    -
    public class DoyleSpiral
-extends Object
    -
    Doyle spirals are patterns of non-crossing circles in the plane, each tangent - to six others.
    -
    -
    Author:
    -
    Javascript implementation by Robin Houston, Java port by Michael Carleton
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Constructor Detail

      - - - -
        -
      • -

        DoyleSpiral

        -
        public DoyleSpiral​(int p,
-                   int q,
-                   double maxRadius)
        -
        Creates a Doyle spiral having the given parameters. Parameters p and q - control the number of arms the spiral has in each direction.
        -
        -
        Parameters:
        -
        p - at least 2
        -
        q - at least p + 1
        -
        maxRadius - the maximum radius of the packing arrangement (the maximum - distance a circle centroid can be from the center of the - arrangement)
        -
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        getCircles

        -
        public Set<processing.core.PVector> getCircles()
        -
        Centered on (0, 0).
        -
        -
        Returns:
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/FarthestPointPair.html b/micycle/pgs/commons/FarthestPointPair.html deleted file mode 100644 index 8bd8b48f..00000000 --- a/micycle/pgs/commons/FarthestPointPair.html +++ /dev/null @@ -1,358 +0,0 @@ - - - - - -FarthestPointPair (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class FarthestPointPair

-
-
- -
-
    -
  • -
    -
    public class FarthestPointPair
-extends Object
    -
    The FarthestPair data type computes the farthest pair of points in a - set of n points in the plane and provides accessor methods for - getting the farthest pair of points and the distance between them. The - distance between two points is their Euclidean distance. -

    - This implementation computes the convex hull of the set of points and uses - the rotating calipers method to find all antipodal point pairs and the - farthest pair. It runs in O(n log n) time in the worst case - and uses O(N) extra space.

    -
    -
    Author:
    -
    Robert Sedgewick, Kevin Wayne, Adapeted by Michael Carleton
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Constructor Detail

      - - - -
        -
      • -

        FarthestPointPair

        -
        public FarthestPointPair​(Collection<processing.core.PVector> points)
        -
        Computes the farthest pair of points in the specified array of points.
        -
        -
        Parameters:
        -
        points - an array of points
        -
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        either

        -
        public processing.core.PVector either()
        -
        Returns one of the points in the farthest pair of points.
        -
        -
        Returns:
        -
        one of the two points in the farthest pair of points; null if - no such point (because there are fewer than 2 points)
        -
        -
        • -
      - - - -
        -
      • -

        other

        -
        public processing.core.PVector other()
        -
        Returns the other point in the farthest pair of points.
        -
        -
        Returns:
        -
        the other point in the farthest pair of points null if no - such point (because there are fewer than 2 points)
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/FastAtan2.html b/micycle/pgs/commons/FastAtan2.html deleted file mode 100644 index 0d0faef6..00000000 --- a/micycle/pgs/commons/FastAtan2.html +++ /dev/null @@ -1,307 +0,0 @@ - - - - - -FastAtan2 (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class FastAtan2

-
-
- -
-
    -
  • -
    -
    public final class FastAtan2
-extends Object
    -
    Fast, high-quality polynomial-based atan2 approximation.
    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        atan2

        -
        public static double atan2​(double y,
-                           double x)
        -
        Maximum absolute error of ~0.00085 rad (~0.049º).
        -
        -
        Returns:
        -
        Angle from x axis positive side to (x,y) position, in radians, in - [-PI,PI].
        -
        -
        • -
      - - - -
        -
      • -

        atan2

        -
        public static float atan2​(float y,
-                          float x)
        -
        Maximum absolute error of 0.0015 rad (0.086º).
        -
        -
        Returns:
        -
        Angle from x axis positive side to (x,y) position, in radians, in - [-PI,PI].
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/FastPolygonizer.html b/micycle/pgs/commons/FastPolygonizer.html deleted file mode 100644 index c5340e6a..00000000 --- a/micycle/pgs/commons/FastPolygonizer.html +++ /dev/null @@ -1,291 +0,0 @@ - - - - - -FastPolygonizer (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class FastPolygonizer

-
-
- -
-
    -
  • -
    -
    public class FastPolygonizer
-extends Object
    -
    This class solves the problem of finding polygons formed by a collection of - edges. -

    - At least twice as fast as JTS' - polygonizer.

    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        polygonize

        -
        public static processing.core.PShape polygonize​(Collection<PEdge> edges)
        -
        Polygonizes a set of edges which represent linework that forms some polygonal - arrangement (a planar graph).
        -
        -
        Parameters:
        -
        edges - a collection of NODED (i.e. non intersecting / must only - meet at their endpoints) edges. The collection can contain - duplicates.
        -
        Returns:
        -
        a GROUP PShape, where each child shape represents a polygon face - formed by the edges input
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/FrontChainPacker.html b/micycle/pgs/commons/FrontChainPacker.html deleted file mode 100644 index 110d45fa..00000000 --- a/micycle/pgs/commons/FrontChainPacker.html +++ /dev/null @@ -1,376 +0,0 @@ - - - - - -FrontChainPacker (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class FrontChainPacker

-
-
- -
-
    -
  • -
    -
    public class FrontChainPacker
-extends Object
    -
    Circle packing of rectangle boundaries using the front-chain packing - algorithm from 'Visualization of Large Hierarchical Data by Circle Packing'. -

    - The algorithm initialises circles in the boundary center and builds up the - packing in a spiral pattern from this center until it reaches the rectangle - boundary.

    -
    -
    Author:
    -
    Mike Bostock, Java port and modifications by Michael Carleton
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Constructor Detail

      - - - -
        -
      • -

        FrontChainPacker

        -
        public FrontChainPacker​(float width,
-                        float height,
-                        float radiusMin,
-                        float radiusMax)
        -
        Creates a FrontChainPacker instance. Circles are packed upon initialisation. -

        - Each circle in the output packing is prescribed a random radius between the - range given.

        -
        -
        Parameters:
        -
        width - width of rectangle boundary to pack
        -
        height - height of rectangle boundary to pack
        -
        radiusMin - minimum radius of circles in the packing
        -
        radiusMax - maximum radius of circles in the packing#
        -
        See Also:
        -
        FrontChainPacker(float, float, float, float, float, float)
        -
        -
        • -
      - - - -
        -
      • -

        FrontChainPacker

        -
        public FrontChainPacker​(float width,
-                        float height,
-                        float radiusMin,
-                        float radiusMax,
-                        float offsetX,
-                        float offsetY)
        -
        Creates a FrontChainPacker instance. Circles are packed upon initialisation. - Each circle in the output packing is prescribed a random radius between a - radius range given by its minimum and maximum values.
        -
        -
        Parameters:
        -
        width - width of rectangle boundary to pack
        -
        height - height of rectangle boundary to pack
        -
        radiusMin - minimum radius of circles in the packing
        -
        radiusMax - maximum radius of circles in the packing
        -
        See Also:
        -
        FrontChainPacker(float, float, float, float)
        -
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        getCircles

        -
        public List<processing.core.PVector> getCircles()
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/GaussianLineSmoothing.html b/micycle/pgs/commons/GaussianLineSmoothing.html deleted file mode 100644 index a7ecabd1..00000000 --- a/micycle/pgs/commons/GaussianLineSmoothing.html +++ /dev/null @@ -1,313 +0,0 @@ - - - - - -GaussianLineSmoothing (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class GaussianLineSmoothing

-
-
- -
-
    -
  • -
    -
    public class GaussianLineSmoothing
-extends Object
    -
    Line gaussian smoothing.
    -
    -
    Author:
    -
    Julien Gaffuri
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        get

        -
        public static org.locationtech.jts.geom.LineString get​(org.locationtech.jts.geom.LineString line,
-                                                       double sigmaM)
        -
        -
        Parameters:
        -
        line -
        -
        sigmaM -
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        get

        -
        public static org.locationtech.jts.geom.LineString get​(org.locationtech.jts.geom.LineString line,
-                                                       double sigmaM,
-                                                       double resolution)
        -
        Line gaussian smoothing. The position of each point is the average position - of its neighbors, weighted by a gaussian kernel. For non-closed lines, the - initial and final points are preserved.
        -
        -
        Parameters:
        -
        line - The input line
        -
        sigmaM - The standard deviation of the gaussian kernel. The larger, - the more smoothed.
        -
        resolution - The target resolution of the geometry. This parameter is - used to filter/simplify the final geometry.
        -
        Returns:
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/GeneticColoring.html b/micycle/pgs/commons/GeneticColoring.html deleted file mode 100644 index b53e5f26..00000000 --- a/micycle/pgs/commons/GeneticColoring.html +++ /dev/null @@ -1,389 +0,0 @@ - - - - - -GeneticColoring (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class GeneticColoring<V,​E>

-
-
- -
-
    -
  • -
    -
    Type Parameters:
    -
    V - the graph vertex type
    -
    E - the graph edge type
    -
    -
    -
    All Implemented Interfaces:
    -
    org.jgrapht.alg.interfaces.VertexColoringAlgorithm<V>
    -
    -
    -
    public class GeneticColoring<V,​E>
-extends Object
-implements org.jgrapht.alg.interfaces.VertexColoringAlgorithm<V>
    -
    Finds a solution to a graph coloring using a genetic algorithm. -

    - This class implements the technique described in Genetic Algorithm Applied - to the Graph Coloring Problem by Musa M. Hindi and Roman V. - Yampolskiy. -

    - The genetic algorithm process continues until it either finds a solution - (i.e. 0 conflicts between adjacent vertices) or the algorithm has been run - for the predefined number of generations. -

    - The goal of the algorithm is to improve the fitness of the population (a - coloring) by mating its fittest individuals to produce superior offspring - that offer a better solution to the problem. This process continues until a - terminating condition is reached which could be simply that the total number - of generations has been run or any other parameter like non-improvement of - fitness over a certain number of generations or that a solution for the - problem has been found.

    -
    -
    Author:
    -
    Soroush Javadi, Refactored for JGraphT by Michael Carleton
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Nested Class Summary

      -
        -
      • - - -

        Nested classes/interfaces inherited from interface org.jgrapht.alg.interfaces.VertexColoringAlgorithm

        -org.jgrapht.alg.interfaces.VertexColoringAlgorithm.Coloring<V extends Object>, org.jgrapht.alg.interfaces.VertexColoringAlgorithm.ColoringImpl<V extends Object>
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Constructor Summary

      - - - - - - - - - - - - - - -
      Constructors 
      ConstructorDescription
      GeneticColoring​(org.jgrapht.Graph<V,​E> graph) -
      Creates with a population size of 50; "the value was chosen after testing a - number of different population sizes.
      -
      GeneticColoring​(org.jgrapht.Graph<V,​E> graph, - int maxGenerations, - int populationSize, - int fitnessThreshold) 
      -
      • -
    -
    - -
    - -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Constructor Detail

      - - - -
        -
      • -

        GeneticColoring

        -
        public GeneticColoring​(org.jgrapht.Graph<V,​E> graph)
        -
        Creates with a population size of 50; "the value was chosen after testing a - number of different population sizes. The value 50 was the least value that - produced the desired results".
        -
        -
        Parameters:
        -
        graph -
        -
        -
        • -
      - - - -
        -
      • -

        GeneticColoring

        -
        public GeneticColoring​(org.jgrapht.Graph<V,​E> graph,
-                       int maxGenerations,
-                       int populationSize,
-                       int fitnessThreshold)
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        getColoring

        -
        public org.jgrapht.alg.interfaces.VertexColoringAlgorithm.Coloring<V> getColoring()
        -
        -
        Specified by:
        -
        getColoring in interface org.jgrapht.alg.interfaces.VertexColoringAlgorithm<V>
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- - - - diff --git a/micycle/pgs/commons/HatchTiling.html b/micycle/pgs/commons/HatchTiling.html deleted file mode 100644 index f41a7cd8..00000000 --- a/micycle/pgs/commons/HatchTiling.html +++ /dev/null @@ -1,348 +0,0 @@ - - - - - -HatchTiling (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class HatchTiling

-
-
- -
-
    -
  • -
    -
    public class HatchTiling
-extends Object
    -
    Port of https://openprocessing.org/sketch/1523350/
    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Constructor Detail

      - - - -
        -
      • -

        HatchTiling

        -
        public HatchTiling​(int width,
-                   int height)
        -
        • -
      - - - -
        -
      • -

        HatchTiling

        -
        public HatchTiling​(int width,
-                   int height,
-                   int gridCountX,
-                   int gridCountY)
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        getTiling

        -
        public processing.core.PShape getTiling​(long seed)
        -
        • -
      - - - -
        -
      • -

        getTiling

        -
        public processing.core.PShape getTiling()
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/IncrementalTinDual.DualEdge.html b/micycle/pgs/commons/IncrementalTinDual.DualEdge.html deleted file mode 100644 index 75105236..00000000 --- a/micycle/pgs/commons/IncrementalTinDual.DualEdge.html +++ /dev/null @@ -1,350 +0,0 @@ - - - - - -IncrementalTinDual.DualEdge (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class IncrementalTinDual.DualEdge

-
-
- -
- -
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Field Detail

      - - - -
        -
      • -

        a

        -
        public final org.tinfour.common.Vertex a
        -
        • -
      - - - -
        -
      • -

        b

        -
        public final org.tinfour.common.Vertex b
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        hashCode

        -
        public int hashCode()
        -
        -
        Overrides:
        -
        hashCode in class Object
        -
        -
        • -
      - - - -
        -
      • -

        equals

        -
        public boolean equals​(Object obj)
        -
        -
        Overrides:
        -
        equals in class Object
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/IncrementalTinDual.html b/micycle/pgs/commons/IncrementalTinDual.html deleted file mode 100644 index 5be30b35..00000000 --- a/micycle/pgs/commons/IncrementalTinDual.html +++ /dev/null @@ -1,426 +0,0 @@ - - - - - -IncrementalTinDual (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class IncrementalTinDual

-
-
- -
-
    -
  • -
    -
    public class IncrementalTinDual
-extends Object
    -
    Produces a (barycentric) dual graph from a TinFour Delaunay Triangulation. - Triangle centroids form the vertices of the dual graph, and each - triangulation vertex corresponds to a face in the dual graph; the dual graph - has similarity to the voronoi diagram, but it isn't the same. -

    - The dual of (fairly) regular triangulation is a regular polygonal (hex/oct) - mesh.

    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Field Detail

      - - - - - - - -
        -
      • -

        edgeDuals

        -
        public final Map<org.tinfour.common.IQuadEdge,​IncrementalTinDual.DualEdge> edgeDuals
        -
        Maps triangulation edges to their dual edge.
        -
        • -
      - - - -
        -
      • -

        vertexDuals

        -
        public final Map<org.tinfour.common.Vertex,​processing.core.PShape> vertexDuals
        -
        Maps triangulation vertices to their corresponding/surrounding face in the - dual graph.
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Constructor Detail

      - - - -
        -
      • -

        IncrementalTinDual

        -
        public IncrementalTinDual​(org.tinfour.common.IIncrementalTin tin)
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        getMesh

        -
        public processing.core.PShape getMesh()
        -
        Generate mesh of polygonal dual faces.
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- - - - diff --git a/micycle/pgs/commons/MaximumInscribedAARectangle.html b/micycle/pgs/commons/MaximumInscribedAARectangle.html deleted file mode 100644 index 64dd0955..00000000 --- a/micycle/pgs/commons/MaximumInscribedAARectangle.html +++ /dev/null @@ -1,325 +0,0 @@ - - - - - -MaximumInscribedAARectangle (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class MaximumInscribedAARectangle

-
-
- -
-
    -
  • -
    -
    public class MaximumInscribedAARectangle
-extends Object
    -
    Computes the largest inscribed axis-aligned rectangle within a convex hull. - - Credits: Daniel Sud for the Inscribed Rectangle algorithm - http://cgm.cs.mcgill.ca/~athens/cs507/Projects/2003/DanielSud/
    -
    -
    Author:
    -
    Peter (pborissow), Adapted by Michael Carleton
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Constructor Detail

      - - - -
        -
      • -

        MaximumInscribedAARectangle

        -
        public MaximumInscribedAARectangle​(org.locationtech.jts.geom.Geometry polygon,
-                                   double f)
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        getInscribedRectangle

        -
        public int[] getInscribedRectangle()
        -
        Returns the largest rectangle that will fit inside a convex hull
        -
        -
        Returns:
        -
        int[x, y, w, h]
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/MaximumInscribedCircles.html b/micycle/pgs/commons/MaximumInscribedCircles.html deleted file mode 100644 index 621400e4..00000000 --- a/micycle/pgs/commons/MaximumInscribedCircles.html +++ /dev/null @@ -1,335 +0,0 @@ - - - - - -MaximumInscribedCircles (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class MaximumInscribedCircles

-
-
- -
-
    -
  • -
    -
    public class MaximumInscribedCircles
-extends Object
    -
    An bespoke version of - MaximumInscribedCircle to find N largest maximum inscribed circles in an - optimised manner.
    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Constructor Detail

      - - - -
        -
      • -

        MaximumInscribedCircles

        -
        public MaximumInscribedCircles​(org.locationtech.jts.geom.Geometry polygonal,
-                               double tolerance)
        -
        Creates a new instance of a Maximum Inscribed Circles computation.
        -
        -
        Parameters:
        -
        polygonal - an areal geometry
        -
        tolerance - the distance tolerance for computing centre points (must be - positive)
        -
        Throws:
        -
        IllegalArgumentException - if the tolerance is non-positive, or the - input geometry is non-polygonal or empty.
        -
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        getNextLargestCircle

        -
        public double[] getNextLargestCircle()
        -
        Get the next largest MIC.
        -
        -
        Returns:
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/MaximumInscribedRectangle.html b/micycle/pgs/commons/MaximumInscribedRectangle.html deleted file mode 100644 index 61351737..00000000 --- a/micycle/pgs/commons/MaximumInscribedRectangle.html +++ /dev/null @@ -1,321 +0,0 @@ - - - - - -MaximumInscribedRectangle (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class MaximumInscribedRectangle

-
-
- -
-
    -
  • -
    -
    public class MaximumInscribedRectangle
-extends Object
    -
    Finds an approximate largest area rectangle of arbitrary orientation in a - polygon via particle swarm optimisation.
    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Constructor Detail

      - - - -
        -
      • -

        MaximumInscribedRectangle

        -
        public MaximumInscribedRectangle​(org.locationtech.jts.geom.Polygon polygon)
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        computeMIR

        -
        public org.locationtech.jts.geom.Polygon computeMIR()
        -
        Computes the Returns the
        -
        -
        Returns:
        -
        a rectangle polygon
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/MinimumBoundingEllipse.html b/micycle/pgs/commons/MinimumBoundingEllipse.html deleted file mode 100644 index 231ad825..00000000 --- a/micycle/pgs/commons/MinimumBoundingEllipse.html +++ /dev/null @@ -1,380 +0,0 @@ - - - - - -MinimumBoundingEllipse (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class MinimumBoundingEllipse

-
-
- -
-
    -
  • -
    -
    public class MinimumBoundingEllipse
-extends Object
    -
    Minimum Volume Enclosing Ellipsoid
    -
    -
    Author:
    -
    Peter - Borissow
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Constructor Detail

      - - - -
        -
      • -

        MinimumBoundingEllipse

        -
        public MinimumBoundingEllipse​(double[][] points,
-                              double tolerance)
        -
        Khachiyan’s Algorithm for the Computation of Minimum Volume Enclosing - Ellipsoids.
        -
        -
        Parameters:
        -
        points - An array of points. Each entry in the array contains an x,y - coordinate. The points must form a closed loop. Consider - pre-processing a geometry to find its convex hull, and - supply thos coordinates to compute the MBE.
        -
        tolerance - the error tolerance to use when terminating optimisation. - 0.001 to 0.01 recommended.
        -
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        getCenter

        -
        public double[] getCenter()
        -
        Returns the center point of the ellipse
        -
        -
        Returns:
        -
        double[2] containing center x and y coordinates
        -
        -
        • -
      - - - -
        -
      • -

        getMatrix

        -
        public double[][] getMatrix()
        -
        Returns a matrix containing all the information regarding the shape of the - ellipsoid. To get the radii and orientation of the ellipsoid take the - Singular Value Decomposition of the matrix.
        -
        • -
      - - - -
        -
      • -

        getBoundingCoordinates

        -
        public double[][] getBoundingCoordinates​(int numPoints)
        -
        Returns a list of coordinates that can be used to render the ellipse.
        -
        -
        Parameters:
        -
        numPoints - The number of points used to represent the ellipse. The - higher the number the more dense the ellipse outline, the - more accurate the shape.
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/MinimumBoundingTriangle.html b/micycle/pgs/commons/MinimumBoundingTriangle.html deleted file mode 100644 index acb83f3e..00000000 --- a/micycle/pgs/commons/MinimumBoundingTriangle.html +++ /dev/null @@ -1,352 +0,0 @@ - - - - - -MinimumBoundingTriangle (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class MinimumBoundingTriangle

-
-
- -
-
    -
  • -
    -
    public class MinimumBoundingTriangle
-extends Object
    -
    Computes the Minimum Bounding Triangle (MBT) for the points in a Geometry. - The MBT is the smallest triangle which covers all the input points (this is - also known as the Smallest Enclosing Triangle). -

    - The algorithm for finding minimum area enclosing triangles is based on an - elegant geometric characterisation initially introduced in Klee & Laskowski. - The algorithm iterates over each edge of the convex polygon setting side C of - the enclosing triangle to be flush with this edge. A side S is said to - be flush with edge E if S⊇E. The authors of O’Rourke et al. - prove that for each fixed flush side C a local minimum enclosing triangle - exists. Moreover, the authors have shown that: -

      -
    • The midpoints of the enclosing triangle’s sides must touch the - polygon.
      • -
    • There exists a local minimum enclosing triangle with at least two sides - flush with edges of the polygon. The third side of the triangle can be either - flush with an edge or tangent to the polygon.
      • -
    - Thus, for each flush side C the algorithm will find the second flush side and - set the third side either flush/tangent to the polygon. -

    - O'Rourke provides a θ(n) algorithm for finding the minimal enclosing triangle - of a 2D convex polygon with n vertices. However, the overall - complexity for the convex computation is O(nlog(n)) because a convex hull - must first be computed for the input geometry.

    -
    -
    Author:
    -
    Python implementation - by Charlie Marsh, Java port by Michael Carleton
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Constructor Detail

      - - - -
        -
      • -

        MinimumBoundingTriangle

        -
        public MinimumBoundingTriangle​(org.locationtech.jts.geom.Geometry shape)
        -
        Creates a new instance of a Maximum Inscribed Triangle computation.
        -
        -
        Parameters:
        -
        shape - an areal geometry
        -
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        getTriangle

        -
        public org.locationtech.jts.geom.Geometry getTriangle()
        -
        Gets a geometry which represents the Minimium Bounding Triangle.
        -
        -
        Returns:
        -
        a triangle Geometry representing the Minimum Bounding Triangle
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/Nullable.html b/micycle/pgs/commons/Nullable.html deleted file mode 100644 index 873ab57c..00000000 --- a/micycle/pgs/commons/Nullable.html +++ /dev/null @@ -1,252 +0,0 @@ - - - - - -Nullable (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Annotation Type Nullable

-
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Optional Element Summary

      - - - - - - - - - - - - -
      Optional Elements 
      Modifier and TypeOptional ElementDescription
      Stringvalue 
      -
      • -
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Element Detail

      - - - -
        -
      • -

        value

        -
        String value
        -
        -
        Default:
        -
        ""
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/PEdge.html b/micycle/pgs/commons/PEdge.html deleted file mode 100644 index 3befe396..00000000 --- a/micycle/pgs/commons/PEdge.html +++ /dev/null @@ -1,500 +0,0 @@ - - - - - -PEdge (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class PEdge

-
-
- -
-
    -
  • -
    -
    public class PEdge
-extends Object
    -
    An undirected edge / line segment joining 2 PVectors. -

    - Note: PEdges PEdge(a, b) and PEdge(b, a) are - consided equal.

    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Field Summary

      - - - - - - - - - - - - - - - - - -
      Fields 
      Modifier and TypeFieldDescription
      processing.core.PVectora 
      processing.core.PVectorb 
      -
      • -
    -
    - -
    -
      -
    • - - -

      Constructor Summary

      - - - - - - - - - - - - - - -
      Constructors 
      ConstructorDescription
      PEdge​(double x1, - double y1, - double x2, - double y2) 
      PEdge​(processing.core.PVector a, - processing.core.PVector b) 
      -
      • -
    -
    - -
    - -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Field Detail

      - - - -
        -
      • -

        a

        -
        public final processing.core.PVector a
        -
        • -
      - - - -
        -
      • -

        b

        -
        public final processing.core.PVector b
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Constructor Detail

      - - - -
        -
      • -

        PEdge

        -
        public PEdge​(processing.core.PVector a,
-             processing.core.PVector b)
        -
        • -
      - - - -
        -
      • -

        PEdge

        -
        public PEdge​(double x1,
-             double y1,
-             double x2,
-             double y2)
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        round

        -
        public PEdge round()
        -
        Rounds (mutates) the vertices of this PEdge.
        -
        -
        Returns:
        -
        this PEdge
        -
        -
        • -
      - - - -
        -
      • -

        midpoint

        -
        public processing.core.PVector midpoint()
        -
        • -
      - - - -
        -
      • -

        length

        -
        public float length()
        -
        • -
      - - - -
        -
      • -

        hashCode

        -
        public int hashCode()
        -
        -
        Overrides:
        -
        hashCode in class Object
        -
        -
        • -
      - - - -
        -
      • -

        equals

        -
        public boolean equals​(Object obj)
        -
        -
        Overrides:
        -
        equals in class Object
        -
        -
        • -
      - - - -
        -
      • -

        copy

        -
        public PEdge copy()
        -
        -
        Returns:
        -
        a deep copy of this PEdge
        -
        -
        • -
      - - - - -
      • -
    -
    -
    • -
-
-
-
- - - - diff --git a/micycle/pgs/commons/PenroseTiling.html b/micycle/pgs/commons/PenroseTiling.html deleted file mode 100644 index e7200511..00000000 --- a/micycle/pgs/commons/PenroseTiling.html +++ /dev/null @@ -1,342 +0,0 @@ - - - - - -PenroseTiling (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class PenroseTiling

-
-
- -
-
    -
  • -
    -
    public class PenroseTiling
-extends Object
    -
    Generates a Penrose tiling of the plane. -

    - A Java port of https://openprocessing.org/sketch/183715

    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Constructor Detail

      - - - -
        -
      • -

        PenroseTiling

        -
        public PenroseTiling​(double centerX,
-                     double centerY,
-                     double radius,
-                     int divisions)
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        getEdges

        -
        public Set<PEdge> getEdges()
        -
        Returns the edge work of the tiling.
        -
        • -
      - - - -
        -
      • -

        getTriangles

        -
        public processing.core.PShape getTriangles()
        -
        Returns raw triangles from the penrose tiling. Note these are not collapsed - (the tiling should consist of quadrangles).
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/PoissonDistribution.html b/micycle/pgs/commons/PoissonDistribution.html deleted file mode 100644 index 127caa7e..00000000 --- a/micycle/pgs/commons/PoissonDistribution.html +++ /dev/null @@ -1,395 +0,0 @@ - - - - - -PoissonDistribution (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class PoissonDistribution

-
-
- -
-
    -
  • -
    -
    @Deprecated
-public final class PoissonDistribution
-extends Object
    -
    Deprecated. -
    in favour of PoissonDistributionJRUS
    -
    -
    Generates sets of random points via Poisson Disk Sampling. - Poisson-disc sampling produces points that are tightly-packed, but no closer - to each other than a specified minimum distance, resulting in a more natural - and desirable pattern for many applications. This distribution is also - described as blue noise. -

    - Implements Martin Roberts’s tweak of "Fast Poisson Disk Sampling in - Arbitrary Dimensions" by Robert Bridson.

    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Constructor Detail

      - - - -
        -
      • -

        PoissonDistribution

        -
        public PoissonDistribution()
        -
        Deprecated.
        -
        • -
      - - - -
        -
      • -

        PoissonDistribution

        -
        public PoissonDistribution​(long seed)
        -
        Deprecated.
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - - - - - -
        -
      • -

        generate

        -
        public List<processing.core.PVector> generate​(double xmin,
-                                              double ymin,
-                                              double xmax,
-                                              double ymax,
-                                              double minDist,
-                                              int rejectionLimit)
        -
        Deprecated.
        -
        Generates a random point set, having a poisson/blue noise distribution.
        -
        -
        Parameters:
        -
        xmin - x-coordinate of boundary minimum
        -
        ymin - y-coordinate of boundary minimum
        -
        xmax - x-coordinate of boundary maximum
        -
        ymax - y-coordinate of boundary maximum
        -
        minDist - minimum euclidean distance between any two points
        -
        rejectionLimit - the limit on the number of attempts to generate a - random valid point around the previous point. Generally - 6 is sufficient.
        -
        Returns:
        -
        a set of random points
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/PoissonDistributionJRUS.html b/micycle/pgs/commons/PoissonDistributionJRUS.html deleted file mode 100644 index 67dc3a0a..00000000 --- a/micycle/pgs/commons/PoissonDistributionJRUS.html +++ /dev/null @@ -1,461 +0,0 @@ - - - - - -PoissonDistributionJRUS (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class PoissonDistributionJRUS

-
-
- -
-
    -
  • -
    -
    public final class PoissonDistributionJRUS
-extends Object
    -
    Generates sets of random points via Poisson Disk Sampling. - Poisson-disc sampling produces points that are tightly-packed, but no closer - to each other than a specified minimum distance, resulting in a natural and - desirable pattern for many applications. This distribution is also described - as blue noise. -

    - The algorithm in this class is a Fork of Martin Roberts’s tweak to - Bridson's Algorithm for Poisson Disk sampling. This approach is faster - and better than the Bridson Algorithm, and balances performance with - distribution quality compared to Robert's tweak. - -

    - For more, see this anaylsis - of different Poisson disk sampling functions.

    -
    -
    Author:
    -
    Jacob Rus, Java port by Michael Carleton
    -
    -
    • -
-
-
-
    -
  • - -
    - -
    - -
    -
      -
    • - - -

      Method Summary

      - - - - - - - - - - - - - - - - - - - - - - - - - - - -
      All Methods Instance Methods Concrete Methods 
      Modifier and TypeMethodDescription
      List<processing.core.PVector>generate​(double xmin, - double ymin, - double xmax, - double ymax, - double minDist) -
      Generates a random point set, having a poisson/blue noise distribution.
      -
      List<processing.core.PVector>generate​(double xmin, - double ymin, - double xmax, - double ymax, - double minDist, - int rejectionLimit) -
      Generates a random point set, having a poisson/blue noise distribution.
      -
      List<processing.core.PVector>generate​(double xmin, - double ymin, - double xmax, - double ymax, - int n) -
      Generates a poisson point set having N points.
      -
      List<processing.core.PVector>getPoints() -
      Returns the point set generated by most recent call to - generate().
      -
      - -
      • -
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Constructor Detail

      - - - -
        -
      • -

        PoissonDistributionJRUS

        -
        public PoissonDistributionJRUS()
        -
        • -
      - - - -
        -
      • -

        PoissonDistributionJRUS

        -
        public PoissonDistributionJRUS​(long seed)
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        getPoints

        -
        public List<processing.core.PVector> getPoints()
        -
        Returns the point set generated by most recent call to - generate().
        -
        -
        Returns:
        -
        -
        • -
      - - - -
        -
      • -

        generate

        -
        public List<processing.core.PVector> generate​(double xmin,
-                                              double ymin,
-                                              double xmax,
-                                              double ymax,
-                                              double minDist,
-                                              int rejectionLimit)
        -
        Generates a random point set, having a poisson/blue noise distribution.
        -
        -
        Parameters:
        -
        xmin - x-coordinate of boundary minimum
        -
        ymin - y-coordinate of boundary minimum
        -
        xmax - x-coordinate of boundary maximum
        -
        ymax - y-coordinate of boundary maximum
        -
        minDist - minimum euclidean distance between any two points
        -
        rejectionLimit - the limit on the number of attempts to generate a - random valid point around the previous point. Generally - 6 is sufficient.
        -
        Returns:
        -
        a set of random points
        -
        -
        • -
      - - - -
        -
      • -

        generate

        -
        public List<processing.core.PVector> generate​(double xmin,
-                                              double ymin,
-                                              double xmax,
-                                              double ymax,
-                                              double minDist)
        -
        Generates a random point set, having a poisson/blue noise distribution.
        -
        -
        Parameters:
        -
        xmin - x-coordinate of boundary minimum
        -
        ymin - y-coordinate of boundary minimum
        -
        xmax - x-coordinate of boundary maximum
        -
        ymax - y-coordinate of boundary maximum
        -
        minDist - minimum euclidean distance between any two points
        -
        Returns:
        -
        a set of random points
        -
        -
        • -
      - - - -
        -
      • -

        generate

        -
        public List<processing.core.PVector> generate​(double xmin,
-                                              double ymin,
-                                              double xmax,
-                                              double ymax,
-                                              int n)
        -
        Generates a poisson point set having N points. After generating - an initial set of ~N (hereafter N') points (the actual number - tends to overshoot the target by a few percent), N'-N points are - removed from the inital set.
        -
        -
        Parameters:
        -
        xmin - x-coordinate of boundary minimum
        -
        ymin - y-coordinate of boundary minimum
        -
        xmax - x-coordinate of boundary maximum
        -
        ymax - y-coordinate of boundary maximum
        -
        n - target size of poisson point set
        -
        Returns:
        -
        a set of random points
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/PolygonDecomposition.html b/micycle/pgs/commons/PolygonDecomposition.html deleted file mode 100644 index 3f425254..00000000 --- a/micycle/pgs/commons/PolygonDecomposition.html +++ /dev/null @@ -1,282 +0,0 @@ - - - - - -PolygonDecomposition (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class PolygonDecomposition

-
-
- -
-
    -
  • -
    -
    public class PolygonDecomposition
-extends Object
    -
    Implementation of the Bayazit convex decomposition algorithm for simple - polygons. -

    - This algorithm is a O(nr) complexity algorithm where n is the number of input - vertices and r is the number of output convex polygons. This algorithm can - achieve optimal decompositions, however this is not guaranteed.

    -
    -
    Version:
    -
    3.1.10
    -
    Author:
    -
    William Bittle
    -
    See Also:
    -
    Bayazit
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        decompose

        -
        public static List<org.locationtech.jts.geom.Polygon> decompose​(org.locationtech.jts.geom.Polygon polygon)
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/RLFColoring.html b/micycle/pgs/commons/RLFColoring.html deleted file mode 100644 index 334009fe..00000000 --- a/micycle/pgs/commons/RLFColoring.html +++ /dev/null @@ -1,366 +0,0 @@ - - - - - -RLFColoring (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class RLFColoring<V,​E>

-
-
- -
-
    -
  • -
    -
    Type Parameters:
    -
    V - the graph vertex type
    -
    E - the graph edge type
    -
    -
    -
    All Implemented Interfaces:
    -
    org.jgrapht.alg.interfaces.VertexColoringAlgorithm<V>
    -
    -
    -
    public class RLFColoring<V,​E>
-extends Object
-implements org.jgrapht.alg.interfaces.VertexColoringAlgorithm<V>
    -
    The Recursive Largest First (RLF) algorithm for graph coloring. -

    - The RLF algorithm was originally designed by F. Leighton (1979) in A Graph - Coloring Algorithm for Large Scheduling Problems, in part for use in - constructing solutions to large timetabling problems. It sequentially builds - color classes on the basis of greedy choices. In particular, the first vertex - placed in a color class C is one with a maximum number of uncolored - neighbors, and the next vertices placed in C are chosen so that they have as - many uncolored neighbors which cannot be placed in C. -

    - This implementation is based on the original algorithm pseudocode provided in - 'A new efficient RLF-like Algorithm for the Vertex Coloring Problem' : "for - practical purposes, the RLF algorithm, if programmed properly, exhibits an - O(n2) time dependence for many applications". -

    - RLF exhibits similar chromatic performance compared to DSATUR. In 'A - Performance Comparison of Graph Coloring Algorithms' RLF tended to - produce the best colorings (as measured by color number), marginally ahead of - DSATUR. -

    - Improved drop-in replacement heuristics for RLF are explored in 'A new - efficient RLF-like Algorithm for the Vertex Coloring Problem' (though - most increase runtime complexity).

    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Nested Class Summary

      -
        -
      • - - -

        Nested classes/interfaces inherited from interface org.jgrapht.alg.interfaces.VertexColoringAlgorithm

        -org.jgrapht.alg.interfaces.VertexColoringAlgorithm.Coloring<V extends Object>, org.jgrapht.alg.interfaces.VertexColoringAlgorithm.ColoringImpl<V extends Object>
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Constructor Summary

      - - - - - - - - - - -
      Constructors 
      ConstructorDescription
      RLFColoring​(org.jgrapht.Graph<V,​E> graph) 
      -
      • -
    -
    - -
    - -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Constructor Detail

      - - - -
        -
      • -

        RLFColoring

        -
        public RLFColoring​(org.jgrapht.Graph<V,​E> graph)
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        getColoring

        -
        public org.jgrapht.alg.interfaces.VertexColoringAlgorithm.Coloring<V> getColoring()
        -
        -
        Specified by:
        -
        getColoring in interface org.jgrapht.alg.interfaces.VertexColoringAlgorithm<V>
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- - - - diff --git a/micycle/pgs/commons/RandomPolygon.html b/micycle/pgs/commons/RandomPolygon.html deleted file mode 100644 index 62fe9f31..00000000 --- a/micycle/pgs/commons/RandomPolygon.html +++ /dev/null @@ -1,278 +0,0 @@ - - - - - -RandomPolygon (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class RandomPolygon

-
-
- -
-
    -
  • -
    -
    public class RandomPolygon
-extends Object
    -
    Random Convex Polygons
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        generateRandomConvexPolygon

        -
        public static List<processing.core.PVector> generateRandomConvexPolygon​(int n,
-                                                                        double xMax,
-                                                                        double yMax)
        -
        -
        Parameters:
        -
        n - number of vertices
        -
        Returns:
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/RectangularSubdivision.html b/micycle/pgs/commons/RectangularSubdivision.html deleted file mode 100644 index de080503..00000000 --- a/micycle/pgs/commons/RectangularSubdivision.html +++ /dev/null @@ -1,345 +0,0 @@ - - - - - -RectangularSubdivision (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class RectangularSubdivision

-
-
- -
-
    -
  • -
    -
    public class RectangularSubdivision
-extends Object
    -
    Random rectangle subdivision.
    -
    -
    Author:
    -
    Java port of this - sketch by - Michael Carleton
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Constructor Detail

      - - - -
        -
      • -

        RectangularSubdivision

        -
        public RectangularSubdivision​(double width,
-                              double height,
-                              long seed)
        -
        • -
      - - - -
        -
      • -

        RectangularSubdivision

        -
        public RectangularSubdivision​(double width,
-                              double height,
-                              int maxDepth,
-                              long seed)
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        divide

        -
        public processing.core.PShape divide()
        -
        Produces a new rectangular subdivision using the configured parameters.
        -
        -
        Returns:
        -
        a GROUP PShape where each child shape is one rectangle
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/RepulsionCirclePack.html b/micycle/pgs/commons/RepulsionCirclePack.html deleted file mode 100644 index 9cd488f0..00000000 --- a/micycle/pgs/commons/RepulsionCirclePack.html +++ /dev/null @@ -1,348 +0,0 @@ - - - - - -RepulsionCirclePack (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class RepulsionCirclePack

-
-
- -
-
    -
  • -
    -
    public class RepulsionCirclePack
-extends Object
    -
    Repulsion Packing attempts to arrange a set of circles of specified radii - within a rectangle such that there is no-overlap between circles. - -

    - It involves iterative pair-repulsion, in which overlapping circles move away - from each other. The distance moved by each circle is proportional to the - radius of the other to approximate inertia (very loosely), so that when a - small circle is overlapped by a large circle, the small circle moves - furthest. This process is repeated iteratively until no more movement takes - place (acceptable layout) or a maximum number of iterations is reached - (layout failure). To avoid edge effects, the bounding rectangle is treated as - a toroid. Each circle's centre is constrained to lie within the rectangle but - its edges are allowed to extend outside. -

    - This Java code is based on an implementation of the algorithm from the - packcircles R package, but adds grid-based indexing to speed up the - packing convergence.

    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Constructor Detail

      - - - -
        -
      • -

        RepulsionCirclePack

        -
        public RepulsionCirclePack​(List<processing.core.PVector> xyr,
-                           double xmin,
-                           double xmax,
-                           double ymin,
-                           double ymax,
-                           boolean wrap)
        -
        -
        Parameters:
        -
        circles - overlapping circles, circle positions and sizes (x, y, radius)
        -
        xmin -
        -
        xmax -
        -
        ymin -
        -
        ymax -
        -
        wrap -
        -
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        getPacking

        -
        public List<processing.core.PVector> getPacking()
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/SeededRandomPointsInGridBuilder.html b/micycle/pgs/commons/SeededRandomPointsInGridBuilder.html deleted file mode 100644 index 6eb23787..00000000 --- a/micycle/pgs/commons/SeededRandomPointsInGridBuilder.html +++ /dev/null @@ -1,436 +0,0 @@ - - - - - -SeededRandomPointsInGridBuilder (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class SeededRandomPointsInGridBuilder

-
-
-
    -
  • java.lang.Object
    • -
  • -
      -
    • org.locationtech.jts.shape.GeometricShapeBuilder
      • -
    • -
        -
      • org.locationtech.jts.shape.random.RandomPointsInGridBuilder
        • -
      • -
          -
        • micycle.pgs.commons.SeededRandomPointsInGridBuilder
          • -
        -
        • -
      -
      • -
    -
    • -
-
-
    -
  • -
    -
    public class SeededRandomPointsInGridBuilder
-extends org.locationtech.jts.shape.random.RandomPointsInGridBuilder
    -
    An extension to the - RandomPointsInGridBuilder class that accepts a random seed for repeatable - outputs.
    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Field Summary

      -
        -
      • - - -

        Fields inherited from class org.locationtech.jts.shape.GeometricShapeBuilder

        -extent, geomFactory, numPts
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Constructor Summary

      - - - - - - - - - - - - - - -
      Constructors 
      ConstructorDescription
      SeededRandomPointsInGridBuilder​(long seed) -
      Create a builder which will create shapes using the default - GeometryFactory.
      -
      SeededRandomPointsInGridBuilder​(long seed, - org.locationtech.jts.geom.GeometryFactory geomFact) -
      Create a builder which will create shapes using the given - GeometryFactory.
      -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Summary

      - - - - - - - - - - - - - - - - - - - - - - -
      All Methods Instance Methods Concrete Methods 
      Modifier and TypeMethodDescription
      org.locationtech.jts.geom.GeometrygetGeometry() 
      voidsetConstrainedToCircle​(boolean isConstrainedToCircle) -
      Sets whether generated points are constrained to lie within a circle - contained within each grid cell.
      -
      voidsetGutterFraction​(double gutterFraction) -
      Sets the fraction of the grid cell side which will be treated as a gutter, in - which no points will be created.
      -
      -
        -
      • - - -

        Methods inherited from class org.locationtech.jts.shape.GeometricShapeBuilder

        -createCoord, getCentre, getDiameter, getExtent, getRadius, getSquareBaseLine, getSquareExtent, setExtent, setNumPoints
        • -
      - -
      • -
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Constructor Detail

      - - - -
        -
      • -

        SeededRandomPointsInGridBuilder

        -
        public SeededRandomPointsInGridBuilder​(long seed)
        -
        Create a builder which will create shapes using the default - GeometryFactory.
        -
        • -
      - - - -
        -
      • -

        SeededRandomPointsInGridBuilder

        -
        public SeededRandomPointsInGridBuilder​(long seed,
-                                       org.locationtech.jts.geom.GeometryFactory geomFact)
        -
        Create a builder which will create shapes using the given - GeometryFactory.
        -
        -
        Parameters:
        -
        geomFact - the factory to use
        -
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        setConstrainedToCircle

        -
        public void setConstrainedToCircle​(boolean isConstrainedToCircle)
        -
        Sets whether generated points are constrained to lie within a circle - contained within each grid cell. This provides greater separation between - points in adjacent cells. -

        - The default is to not be constrained to a circle.

        -
        -
        Overrides:
        -
        setConstrainedToCircle in class org.locationtech.jts.shape.random.RandomPointsInGridBuilder
        -
        Parameters:
        -
        isConstrainedToCircle -
        -
        -
        • -
      - - - -
        -
      • -

        setGutterFraction

        -
        public void setGutterFraction​(double gutterFraction)
        -
        Sets the fraction of the grid cell side which will be treated as a gutter, in - which no points will be created. The provided value is clamped to the range - [0.0, 1.0].
        -
        -
        Overrides:
        -
        setGutterFraction in class org.locationtech.jts.shape.random.RandomPointsInGridBuilder
        -
        Parameters:
        -
        gutterFraction -
        -
        -
        • -
      - - - -
        -
      • -

        getGeometry

        -
        public org.locationtech.jts.geom.Geometry getGeometry()
        -
        -
        Overrides:
        -
        getGeometry in class org.locationtech.jts.shape.random.RandomPointsInGridBuilder
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- - - - diff --git a/micycle/pgs/commons/ShapeInterpolation.html b/micycle/pgs/commons/ShapeInterpolation.html deleted file mode 100644 index 713f0c1e..00000000 --- a/micycle/pgs/commons/ShapeInterpolation.html +++ /dev/null @@ -1,330 +0,0 @@ - - - - - -ShapeInterpolation (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class ShapeInterpolation

-
-
- -
-
    -
  • -
    -
    public class ShapeInterpolation
-extends Object
    -
    Best-guess interpolation between any two linear rings.
    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Constructor Detail

      - - - -
        -
      • -

        ShapeInterpolation

        -
        public ShapeInterpolation​(org.locationtech.jts.geom.Geometry from,
-                          org.locationtech.jts.geom.Geometry to)
        -
        • -
      - - - -
        -
      • -

        ShapeInterpolation

        -
        public ShapeInterpolation​(org.locationtech.jts.geom.LinearRing from,
-                          org.locationtech.jts.geom.LinearRing to)
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        tween

        -
        public org.locationtech.jts.geom.Coordinate[] tween​(double t)
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/SpiralQuadrangulation.html b/micycle/pgs/commons/SpiralQuadrangulation.html deleted file mode 100644 index 50393ed1..00000000 --- a/micycle/pgs/commons/SpiralQuadrangulation.html +++ /dev/null @@ -1,328 +0,0 @@ - - - - - -SpiralQuadrangulation (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class SpiralQuadrangulation

-
-
- -
-
    -
  • -
    -
    public class SpiralQuadrangulation
-extends Object
    -
    Quadrangulations of Planar Point Sets via the Spiraling Rotating Calipers - Algorithm. -

    - Implements 'Characterizing and efficiently computing quadrangulations of - planar point sets' by Prosenjit Bose and Godfried T. Toussaint. -

    - This (Processing) implementation is derived from a highly coupled old Java - applet written by Martin Blais.

    -
    -
    Author:
    -
    Martin Blais, Michael Carleton
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Constructor Detail

      - - - -
        -
      • -

        SpiralQuadrangulation

        -
        public SpiralQuadrangulation​(List<processing.core.PVector> points)
        -
        Instantiates a Spiral Quadrangulation. The quadrangulation is computed upon - instantiation.
        -
        -
        Parameters:
        -
        points - no duplicates
        -
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        getQuadrangulationEdges

        -
        public List<PEdge> getQuadrangulationEdges()
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/SquareTriangleTiling.html b/micycle/pgs/commons/SquareTriangleTiling.html deleted file mode 100644 index 53d1104e..00000000 --- a/micycle/pgs/commons/SquareTriangleTiling.html +++ /dev/null @@ -1,332 +0,0 @@ - - - - - -SquareTriangleTiling (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class SquareTriangleTiling

-
-
- -
-
    -
  • -
    -
    public class SquareTriangleTiling
-extends Object
    -
    A non-periodic (quasiperiodic?) tiling, comprising squares and equilateral - triangles.
    -
    -
    Author:
    -
    uila, Java port by Michael Carleton
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Constructor Detail

      - - - -
        -
      • -

        SquareTriangleTiling

        -
        public SquareTriangleTiling​(double width,
-                            double height,
-                            double tileSize)
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        getTiling

        -
        public processing.core.PShape getTiling()
        -
        • -
      - - - -
        -
      • -

        getTiling

        -
        public processing.core.PShape getTiling​(long seed)
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/Star.html b/micycle/pgs/commons/Star.html deleted file mode 100644 index b2e0fcb9..00000000 --- a/micycle/pgs/commons/Star.html +++ /dev/null @@ -1,296 +0,0 @@ - - - - - -Star (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class Star

-
-
- -
-
    -
  • -
    -
    public class Star
-extends Object
    -
    Methods to create star shapes
    -
    -
    Author:
    -
    Marco Hutter, Processing integration by Michael Carleton
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        createStarShape

        -
        public static processing.core.PShape createStarShape​(double centerX,
-                                                     double centerY,
-                                                     double innerRadius,
-                                                     double outerRadius,
-                                                     int numRays,
-                                                     double roundness)
        -
        Create a star shape from the given parameters.
        -
        -
        Parameters:
        -
        centerX - The x coordinate of the center
        -
        centerY - The y coordinate of the center
        -
        innerRadius - The inner radius of the star
        -
        outerRadius - The outer radius of the star
        -
        numRays - The number of rays that the star should have
        -
        Returns:
        -
        The star shape
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/TangencyPack.html b/micycle/pgs/commons/TangencyPack.html deleted file mode 100644 index e109cebe..00000000 --- a/micycle/pgs/commons/TangencyPack.html +++ /dev/null @@ -1,411 +0,0 @@ - - - - - -TangencyPack (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class TangencyPack

-
-
- -
-
    -
  • -
    -
    public class TangencyPack
-extends Object
    -
    Implements a circle packing algorithm described by Collins and Stephenson - (2003) to find an arrangement of circles which corresponds to a graph of - desired circle tangencies. -

    - The algorithm takes a graph (in triangulation form) which specifies a desired - pattern of circle tangencies and searches for an arrangement of circle - positions and sizes which satisfy that pattern. -

    - Given any set of radii, it is possible to compute the angles of the triangles - using the law of cosines. The final radii are those for which the angles at - any vertex sum to exactly 2π. Thus, the algorithm searches for the radii of - the disks by making small incremental updates to the radii, increasing the - radius if the angle sum is more than 2π and decreasing the radius of the - angle sum is less than 2π. -

    - This implementation (specifically circle coordinate placement) is based on an - implementation in the packcircles R package.

    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Constructor Summary

      - - - - - - - - - - - - - - - - - - -
      Constructors 
      ConstructorDescription
      TangencyPack​(org.tinfour.common.IIncrementalTin triangulation, - double boundaryRadii) -
      Creates a circle packing using tangancies specified by a triangulation.
      -
      TangencyPack​(org.tinfour.common.IIncrementalTin triangulation, - double[] boundaryRadii) -
      Creates a circle packing using tangancies specified by a triangulation.
      -
      TangencyPack​(org.tinfour.common.IIncrementalTin triangulation, - List<Double> boundaryRadii) -
      Creates a circle packing using tangancies specified by a triangulation.
      -
      -
      • -
    -
    - -
    - -
    -
    • -
-
-
-
    -
  • - -
    -
      -
    • - - -

      Constructor Detail

      - - - -
        -
      • -

        TangencyPack

        -
        public TangencyPack​(org.tinfour.common.IIncrementalTin triangulation,
-                    double boundaryRadii)
        -
        Creates a circle packing using tangancies specified by a triangulation.
        -
        -
        Parameters:
        -
        triangulation - Pattern of tangencies; vertices connected by an edge in - the triangulation represent tangent circles in the - packing
        -
        boundaryRadii - Radii of the circles (same for every circle) associated - with the boundary/perimeter vertices of the - triangulation
        -
        -
        • -
      - - - -
        -
      • -

        TangencyPack

        -
        public TangencyPack​(org.tinfour.common.IIncrementalTin triangulation,
-                    List<Double> boundaryRadii)
        -
        Creates a circle packing using tangancies specified by a triangulation.
        -
        -
        Parameters:
        -
        triangulation - Pattern of tangencies; vertices connected by an edge in - the triangulation represent tangent circles in the - packing
        -
        boundaryRadii - List of radii values of the circles associated with the - boundary/perimeter vertices of the triangulation. The - list may have fewer radii than the number of boundary - vertices; in this case, boundary radii will wrap around - the list
        -
        -
        • -
      - - - -
        -
      • -

        TangencyPack

        -
        public TangencyPack​(org.tinfour.common.IIncrementalTin triangulation,
-                    double[] boundaryRadii)
        -
        Creates a circle packing using tangancies specified by a triangulation.
        -
        -
        Parameters:
        -
        triangulation - Pattern of tangencies; vertices connected by an edge in - the triangulation represent tangent circles in the - packing
        -
        boundaryRadii - Array of radii values of the circles associated with the - boundary/perimeter vertices of the triangulation. The - list may have fewer radii than the number of boundary - vertices; in this case, boundary radii will wrap around - the list
        -
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        pack

        -
        public List<processing.core.PVector> pack()
        -
        Computes and returns a circle packing for the configuration of tangencies - given by the triangulation.
        -
        -
        Returns:
        -
        a list of PVectors, each representing one circle: (.x, .y) represent - the center point and .z represents radius.
        -
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/TriangleSubdivision.html b/micycle/pgs/commons/TriangleSubdivision.html deleted file mode 100644 index f49f0684..00000000 --- a/micycle/pgs/commons/TriangleSubdivision.html +++ /dev/null @@ -1,320 +0,0 @@ - - - - - -TriangleSubdivision (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
- -
-
-
Package micycle.pgs.commons
-

Class TriangleSubdivision

-
-
- -
-
    -
  • -
    -
    public class TriangleSubdivision
-extends Object
    -
    Balanced triangle subdivision. - https://openprocessing.org/sketch/970715
    -
    -
    Author:
    -
    Michael Carleton
    -
    -
    • -
-
-
- -
-
-
    -
  • - -
    -
      -
    • - - -

      Constructor Detail

      - - - -
        -
      • -

        TriangleSubdivision

        -
        public TriangleSubdivision​(double width,
-                           double height,
-                           int maxDepth,
-                           long seed)
        -
        • -
      -
      • -
    -
    - -
    -
      -
    • - - -

      Method Detail

      - - - -
        -
      • -

        divide

        -
        public processing.core.PShape divide()
        -
        • -
      -
      • -
    -
    -
    • -
-
-
-
- -
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/class-use/ChaikinCut.html b/micycle/pgs/commons/class-use/ChaikinCut.html deleted file mode 100644 index c3c85dc3..00000000 --- a/micycle/pgs/commons/class-use/ChaikinCut.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.ChaikinCut (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.ChaikinCut

-
-
No usage of micycle.pgs.commons.ChaikinCut
-
- - - diff --git a/micycle/pgs/commons/class-use/ClosestPointPair.html b/micycle/pgs/commons/class-use/ClosestPointPair.html deleted file mode 100644 index e2fb5ea6..00000000 --- a/micycle/pgs/commons/class-use/ClosestPointPair.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.ClosestPointPair (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.ClosestPointPair

-
-
No usage of micycle.pgs.commons.ClosestPointPair
-
- - - diff --git a/micycle/pgs/commons/class-use/CornerRounding.html b/micycle/pgs/commons/class-use/CornerRounding.html deleted file mode 100644 index fc9dbe38..00000000 --- a/micycle/pgs/commons/class-use/CornerRounding.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.CornerRounding (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.CornerRounding

-
-
No usage of micycle.pgs.commons.CornerRounding
-
- - - diff --git a/micycle/pgs/commons/class-use/DiscreteCurveEvolution.html b/micycle/pgs/commons/class-use/DiscreteCurveEvolution.html deleted file mode 100644 index 55532316..00000000 --- a/micycle/pgs/commons/class-use/DiscreteCurveEvolution.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.DiscreteCurveEvolution (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.DiscreteCurveEvolution

-
-
No usage of micycle.pgs.commons.DiscreteCurveEvolution
-
- - - diff --git a/micycle/pgs/commons/class-use/DoyleSpiral.html b/micycle/pgs/commons/class-use/DoyleSpiral.html deleted file mode 100644 index 5863a3c5..00000000 --- a/micycle/pgs/commons/class-use/DoyleSpiral.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.DoyleSpiral (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.DoyleSpiral

-
-
No usage of micycle.pgs.commons.DoyleSpiral
-
- - - diff --git a/micycle/pgs/commons/class-use/FarthestPointPair.html b/micycle/pgs/commons/class-use/FarthestPointPair.html deleted file mode 100644 index e2dbf257..00000000 --- a/micycle/pgs/commons/class-use/FarthestPointPair.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.FarthestPointPair (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.FarthestPointPair

-
-
No usage of micycle.pgs.commons.FarthestPointPair
-
- - - diff --git a/micycle/pgs/commons/class-use/FastAtan2.html b/micycle/pgs/commons/class-use/FastAtan2.html deleted file mode 100644 index de043072..00000000 --- a/micycle/pgs/commons/class-use/FastAtan2.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.FastAtan2 (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.FastAtan2

-
-
No usage of micycle.pgs.commons.FastAtan2
-
- - - diff --git a/micycle/pgs/commons/class-use/FastPolygonizer.html b/micycle/pgs/commons/class-use/FastPolygonizer.html deleted file mode 100644 index 52412a71..00000000 --- a/micycle/pgs/commons/class-use/FastPolygonizer.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.FastPolygonizer (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.FastPolygonizer

-
-
No usage of micycle.pgs.commons.FastPolygonizer
-
- - - diff --git a/micycle/pgs/commons/class-use/FrontChainPacker.html b/micycle/pgs/commons/class-use/FrontChainPacker.html deleted file mode 100644 index fd32387d..00000000 --- a/micycle/pgs/commons/class-use/FrontChainPacker.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.FrontChainPacker (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.FrontChainPacker

-
-
No usage of micycle.pgs.commons.FrontChainPacker
-
- - - diff --git a/micycle/pgs/commons/class-use/GaussianLineSmoothing.html b/micycle/pgs/commons/class-use/GaussianLineSmoothing.html deleted file mode 100644 index 1816df6d..00000000 --- a/micycle/pgs/commons/class-use/GaussianLineSmoothing.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.GaussianLineSmoothing (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.GaussianLineSmoothing

-
-
No usage of micycle.pgs.commons.GaussianLineSmoothing
-
- - - diff --git a/micycle/pgs/commons/class-use/GeneticColoring.html b/micycle/pgs/commons/class-use/GeneticColoring.html deleted file mode 100644 index e1c89ee9..00000000 --- a/micycle/pgs/commons/class-use/GeneticColoring.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.GeneticColoring (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.GeneticColoring

-
-
No usage of micycle.pgs.commons.GeneticColoring
-
- - - diff --git a/micycle/pgs/commons/class-use/HatchTiling.html b/micycle/pgs/commons/class-use/HatchTiling.html deleted file mode 100644 index 57938a28..00000000 --- a/micycle/pgs/commons/class-use/HatchTiling.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.HatchTiling (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.HatchTiling

-
-
No usage of micycle.pgs.commons.HatchTiling
-
- - - diff --git a/micycle/pgs/commons/class-use/IncrementalTinDual.DualEdge.html b/micycle/pgs/commons/class-use/IncrementalTinDual.DualEdge.html deleted file mode 100644 index e89f4451..00000000 --- a/micycle/pgs/commons/class-use/IncrementalTinDual.DualEdge.html +++ /dev/null @@ -1,207 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.IncrementalTinDual.DualEdge (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.IncrementalTinDual.DualEdge

-
-
- -
-
- - - diff --git a/micycle/pgs/commons/class-use/IncrementalTinDual.html b/micycle/pgs/commons/class-use/IncrementalTinDual.html deleted file mode 100644 index e393c4e6..00000000 --- a/micycle/pgs/commons/class-use/IncrementalTinDual.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.IncrementalTinDual (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.IncrementalTinDual

-
-
No usage of micycle.pgs.commons.IncrementalTinDual
-
- - - diff --git a/micycle/pgs/commons/class-use/MaximumInscribedAARectangle.html b/micycle/pgs/commons/class-use/MaximumInscribedAARectangle.html deleted file mode 100644 index 926855a4..00000000 --- a/micycle/pgs/commons/class-use/MaximumInscribedAARectangle.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.MaximumInscribedAARectangle (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.MaximumInscribedAARectangle

-
-
No usage of micycle.pgs.commons.MaximumInscribedAARectangle
-
- - - diff --git a/micycle/pgs/commons/class-use/MaximumInscribedCircles.html b/micycle/pgs/commons/class-use/MaximumInscribedCircles.html deleted file mode 100644 index 3219210c..00000000 --- a/micycle/pgs/commons/class-use/MaximumInscribedCircles.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.MaximumInscribedCircles (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.MaximumInscribedCircles

-
-
No usage of micycle.pgs.commons.MaximumInscribedCircles
-
- - - diff --git a/micycle/pgs/commons/class-use/MaximumInscribedRectangle.html b/micycle/pgs/commons/class-use/MaximumInscribedRectangle.html deleted file mode 100644 index b0c74eca..00000000 --- a/micycle/pgs/commons/class-use/MaximumInscribedRectangle.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.MaximumInscribedRectangle (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.MaximumInscribedRectangle

-
-
No usage of micycle.pgs.commons.MaximumInscribedRectangle
-
- - - diff --git a/micycle/pgs/commons/class-use/MinimumBoundingEllipse.html b/micycle/pgs/commons/class-use/MinimumBoundingEllipse.html deleted file mode 100644 index 9ba526cb..00000000 --- a/micycle/pgs/commons/class-use/MinimumBoundingEllipse.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.MinimumBoundingEllipse (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.MinimumBoundingEllipse

-
-
No usage of micycle.pgs.commons.MinimumBoundingEllipse
-
- - - diff --git a/micycle/pgs/commons/class-use/MinimumBoundingTriangle.html b/micycle/pgs/commons/class-use/MinimumBoundingTriangle.html deleted file mode 100644 index b7e01d61..00000000 --- a/micycle/pgs/commons/class-use/MinimumBoundingTriangle.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.MinimumBoundingTriangle (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.MinimumBoundingTriangle

-
-
No usage of micycle.pgs.commons.MinimumBoundingTriangle
-
- - - diff --git a/micycle/pgs/commons/class-use/Nullable.html b/micycle/pgs/commons/class-use/Nullable.html deleted file mode 100644 index 88114650..00000000 --- a/micycle/pgs/commons/class-use/Nullable.html +++ /dev/null @@ -1,269 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.Nullable (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.Nullable

-
-
-
    -
  • - - - - - - - - - - - - -
    Packages that use Nullable 
    PackageDescription
    micycle.pgs -
    Processing Geometry Suite is a software project that provides easy access to - geometric algorithms in the form of a Processing library.
    -
    -
    • -
  • -
      -
    • -
      - - -

      Uses of Nullable in micycle.pgs

      - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
      Method parameters in micycle.pgs with annotations of type Nullable 
      Modifier and TypeMethodDescription
      static processing.core.PShapePGS_Triangulation.delaunayTriangulation​(processing.core.PShape shape, - Collection<processing.core.PVector> steinerPoints, - boolean constrain, - int refinements, - boolean pretty) -
      Generates a Delaunay Triangulation from the given shape.
      -
      static org.tinfour.common.IIncrementalTinPGS_Triangulation.delaunayTriangulationMesh​(processing.core.PShape shape, - Collection<processing.core.PVector> steinerPoints, - boolean constrain, - int refinements, - boolean pretty) -
      Generates a Delaunay Triangulation from the given shape.
      -
      static org.tinfour.common.IIncrementalTinPGS_Triangulation.delaunayTriangulationMesh​(processing.core.PShape shape, - Collection<processing.core.PVector> steinerPoints, - boolean constrain, - int refinements, - boolean pretty) -
      Generates a Delaunay Triangulation from the given shape.
      -
      static List<processing.core.PVector>PGS_Triangulation.delaunayTriangulationPoints​(processing.core.PShape shape, - Collection<processing.core.PVector> steinerPoints, - boolean constrain, - int refinements, - boolean pretty) -
      Generates a Delaunay Triangulation from the given shape.
      -
      static processing.core.PShapePGS_SegmentSet.toPShape​(Collection<PEdge> segments, - Integer strokeColor, - Integer strokeCap, - Integer strokeWeight) -
      Converts a collection of PEdges into a - LINES shape, having the (optional) styling provided.
      -
      static processing.core.PShapePGS_SegmentSet.toPShape​(Collection<PEdge> segments, - Integer strokeColor, - Integer strokeCap, - Integer strokeWeight) -
      Converts a collection of PEdges into a - LINES shape, having the (optional) styling provided.
      -
      static processing.core.PShapePGS_SegmentSet.toPShape​(Collection<PEdge> segments, - Integer strokeColor, - Integer strokeCap, - Integer strokeWeight) -
      Converts a collection of PEdges into a - LINES shape, having the (optional) styling provided.
      -
      -
      -
      • -
    -
    • -
-
-
- - - diff --git a/micycle/pgs/commons/class-use/PEdge.html b/micycle/pgs/commons/class-use/PEdge.html deleted file mode 100644 index 91791340..00000000 --- a/micycle/pgs/commons/class-use/PEdge.html +++ /dev/null @@ -1,451 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.PEdge (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.PEdge

-
-
-
    -
  • - - - - - - - - - - - - - - - - -
    Packages that use PEdge 
    PackageDescription
    micycle.pgs -
    Processing Geometry Suite is a software project that provides easy access to - geometric algorithms in the form of a Processing library.
    -
    micycle.pgs.commons -
    The commons package contains all non-core PGS classes (of varying authorship - and either not worth putting in separate package or too long to include - within the calling PGS method itself).
    -
    -
    • -
  • -
      -
    • -
      - - -

      Uses of PEdge in micycle.pgs

      - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
      Methods in micycle.pgs that return types with arguments of type PEdge 
      Modifier and TypeMethodDescription
      static List<PEdge>PGS_SegmentSet.filterAxisAligned​(List<PEdge> segments, - double angleDelta) -
      Removes axis-aligned (horizontal and vertical) segments (within a given angle - tolerance) from a collection of segments.
      -
      static List<PEdge>PGS_SegmentSet.filterByAverageLength​(List<PEdge> segments, - double fraction) -
      Removes segments having a length either less than some fraction or more than - 1/fraction of the mean segment length from a collection of - segments.
      -
      static List<PEdge>PGS_SegmentSet.filterByMinLength​(List<PEdge> segments, - double minLength) -
      Removes segments having a length less than the given length from a collection - of segmensts.
      -
      static List<PEdge>PGS_SegmentSet.graphMatchedSegments​(double width, - double height, - int n, - long seed) -
      Generates N non-intersecting segments via a Perfect matching algorithm - applied to a triangulation populated with random points.
      -
      static List<PEdge>PGS_SegmentSet.graphMatchedSegments​(List<processing.core.PVector> points) -
      Generates non-intersecting segments via a Perfect matching algorithm - applied to a triangulation populated with the given points.
      -
      static List<PEdge>PGS_SegmentSet.graphMatchedSegments​(org.tinfour.common.IIncrementalTin triangulation) -
      Generates non-intersecting segments via a Perfect matching algorithm - applied to the given triangulation.
      -
      static List<PEdge>PGS_SegmentSet.nodedSegments​(double width, - double height, - int n, - long seed) -
      Generates N non-intersecting segments via intersection and noding.
      -
      static List<PEdge>PGS_SegmentSet.parallelSegments​(double centerX, - double centerY, - double length, - double d, - double angle, - int n) -
      Generates a set of N straight parallel segments, centered on a given point.
      -
      static List<PEdge>PGS_SegmentSet.stochasticSegments​(double width, - double height, - int n) -
      Generates a set of N random non-intersecting line segments via brute-forcing.
      -
      static List<PEdge>PGS_SegmentSet.stochasticSegments​(double width, - double height, - int n, - double length) -
      Generates a set of N random non-intersecting line segments of the given - length via brute-forcing.
      -
      static List<PEdge>PGS_SegmentSet.stochasticSegments​(double width, - double height, - int n, - double minLength, - double maxLength, - long seed) -
      Generates a set of N random non-intersecting line segments via brute-forcing.
      -
      static org.jgrapht.graph.SimpleGraph<processing.core.PVector,​PEdge>PGS_Conversion.toGraph​(processing.core.PShape shape) -
      Converts a shape into a simple graph; graph vertices represent shape - vertices, and graph edges represent shape edges (formed from adjacent - vertices in polygonal shapes).
      -
      static org.jgrapht.graph.SimpleGraph<processing.core.PVector,​PEdge>PGS_Triangulation.toGraph​(org.tinfour.common.IIncrementalTin triangulation) -
      Finds the graph equivalent to a triangulation.
      -
      - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
      Method parameters in micycle.pgs with type arguments of type PEdge 
      Modifier and TypeMethodDescription
      static List<PEdge>PGS_SegmentSet.filterAxisAligned​(List<PEdge> segments, - double angleDelta) -
      Removes axis-aligned (horizontal and vertical) segments (within a given angle - tolerance) from a collection of segments.
      -
      static List<PEdge>PGS_SegmentSet.filterByAverageLength​(List<PEdge> segments, - double fraction) -
      Removes segments having a length either less than some fraction or more than - 1/fraction of the mean segment length from a collection of - segments.
      -
      static List<PEdge>PGS_SegmentSet.filterByMinLength​(List<PEdge> segments, - double minLength) -
      Removes segments having a length less than the given length from a collection - of segmensts.
      -
      static processing.core.PShapePGS_SegmentSet.toPShape​(Collection<PEdge> segments) -
      Converts a collection of PEdges into a - LINES shape.
      -
      static processing.core.PShapePGS_SegmentSet.toPShape​(Collection<PEdge> segments, - Integer strokeColor, - Integer strokeCap, - Integer strokeWeight) -
      Converts a collection of PEdges into a - LINES shape, having the (optional) styling provided.
      -
      -
      -
      • -
    • -
      - - -

      Uses of PEdge in micycle.pgs.commons

      - - - - - - - - - - - - - - - - - - - -
      Methods in micycle.pgs.commons that return PEdge 
      Modifier and TypeMethodDescription
      PEdgePEdge.copy() 
      PEdgePEdge.round() -
      Rounds (mutates) the vertices of this PEdge.
      -
      - - - - - - - - - - - - - - - - - - - -
      Methods in micycle.pgs.commons that return types with arguments of type PEdge 
      Modifier and TypeMethodDescription
      Set<PEdge>PenroseTiling.getEdges() -
      Returns the edge work of the tiling.
      -
      List<PEdge>SpiralQuadrangulation.getQuadrangulationEdges() 
      - - - - - - - - - - - - - - -
      Method parameters in micycle.pgs.commons with type arguments of type PEdge 
      Modifier and TypeMethodDescription
      static processing.core.PShapeFastPolygonizer.polygonize​(Collection<PEdge> edges) -
      Polygonizes a set of edges which represent linework that forms some polygonal - arrangement (a planar graph).
      -
      -
      -
      • -
    -
    • -
-
-
- - - diff --git a/micycle/pgs/commons/class-use/PenroseTiling.html b/micycle/pgs/commons/class-use/PenroseTiling.html deleted file mode 100644 index 43ec4fe2..00000000 --- a/micycle/pgs/commons/class-use/PenroseTiling.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.PenroseTiling (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.PenroseTiling

-
-
No usage of micycle.pgs.commons.PenroseTiling
-
- - - diff --git a/micycle/pgs/commons/class-use/PoissonDistribution.html b/micycle/pgs/commons/class-use/PoissonDistribution.html deleted file mode 100644 index 17085c31..00000000 --- a/micycle/pgs/commons/class-use/PoissonDistribution.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.PoissonDistribution (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.PoissonDistribution

-
-
No usage of micycle.pgs.commons.PoissonDistribution
-
- - - diff --git a/micycle/pgs/commons/class-use/PoissonDistributionJRUS.html b/micycle/pgs/commons/class-use/PoissonDistributionJRUS.html deleted file mode 100644 index ad6d883e..00000000 --- a/micycle/pgs/commons/class-use/PoissonDistributionJRUS.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.PoissonDistributionJRUS (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.PoissonDistributionJRUS

-
-
No usage of micycle.pgs.commons.PoissonDistributionJRUS
-
- - - diff --git a/micycle/pgs/commons/class-use/PolygonDecomposition.html b/micycle/pgs/commons/class-use/PolygonDecomposition.html deleted file mode 100644 index 72b255ae..00000000 --- a/micycle/pgs/commons/class-use/PolygonDecomposition.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.PolygonDecomposition (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.PolygonDecomposition

-
-
No usage of micycle.pgs.commons.PolygonDecomposition
-
- - - diff --git a/micycle/pgs/commons/class-use/RLFColoring.html b/micycle/pgs/commons/class-use/RLFColoring.html deleted file mode 100644 index 506f569c..00000000 --- a/micycle/pgs/commons/class-use/RLFColoring.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.RLFColoring (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.RLFColoring

-
-
No usage of micycle.pgs.commons.RLFColoring
-
- - - diff --git a/micycle/pgs/commons/class-use/RandomPolygon.html b/micycle/pgs/commons/class-use/RandomPolygon.html deleted file mode 100644 index 225d1db9..00000000 --- a/micycle/pgs/commons/class-use/RandomPolygon.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.RandomPolygon (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.RandomPolygon

-
-
No usage of micycle.pgs.commons.RandomPolygon
-
- - - diff --git a/micycle/pgs/commons/class-use/RectangularSubdivision.html b/micycle/pgs/commons/class-use/RectangularSubdivision.html deleted file mode 100644 index d739d7e2..00000000 --- a/micycle/pgs/commons/class-use/RectangularSubdivision.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.RectangularSubdivision (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.RectangularSubdivision

-
-
No usage of micycle.pgs.commons.RectangularSubdivision
-
- - - diff --git a/micycle/pgs/commons/class-use/RepulsionCirclePack.html b/micycle/pgs/commons/class-use/RepulsionCirclePack.html deleted file mode 100644 index 52f34ee4..00000000 --- a/micycle/pgs/commons/class-use/RepulsionCirclePack.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.RepulsionCirclePack (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.RepulsionCirclePack

-
-
No usage of micycle.pgs.commons.RepulsionCirclePack
-
- - - diff --git a/micycle/pgs/commons/class-use/SeededRandomPointsInGridBuilder.html b/micycle/pgs/commons/class-use/SeededRandomPointsInGridBuilder.html deleted file mode 100644 index e5ae2cb5..00000000 --- a/micycle/pgs/commons/class-use/SeededRandomPointsInGridBuilder.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.SeededRandomPointsInGridBuilder (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.SeededRandomPointsInGridBuilder

-
-
No usage of micycle.pgs.commons.SeededRandomPointsInGridBuilder
-
- - - diff --git a/micycle/pgs/commons/class-use/ShapeInterpolation.html b/micycle/pgs/commons/class-use/ShapeInterpolation.html deleted file mode 100644 index 5604fedd..00000000 --- a/micycle/pgs/commons/class-use/ShapeInterpolation.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.ShapeInterpolation (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.ShapeInterpolation

-
-
No usage of micycle.pgs.commons.ShapeInterpolation
-
- - - diff --git a/micycle/pgs/commons/class-use/SpiralQuadrangulation.html b/micycle/pgs/commons/class-use/SpiralQuadrangulation.html deleted file mode 100644 index 27a4a885..00000000 --- a/micycle/pgs/commons/class-use/SpiralQuadrangulation.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.SpiralQuadrangulation (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.SpiralQuadrangulation

-
-
No usage of micycle.pgs.commons.SpiralQuadrangulation
-
- - - diff --git a/micycle/pgs/commons/class-use/SquareTriangleTiling.html b/micycle/pgs/commons/class-use/SquareTriangleTiling.html deleted file mode 100644 index 9a31787a..00000000 --- a/micycle/pgs/commons/class-use/SquareTriangleTiling.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.SquareTriangleTiling (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.SquareTriangleTiling

-
-
No usage of micycle.pgs.commons.SquareTriangleTiling
-
- - - diff --git a/micycle/pgs/commons/class-use/Star.html b/micycle/pgs/commons/class-use/Star.html deleted file mode 100644 index e64eef01..00000000 --- a/micycle/pgs/commons/class-use/Star.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.Star (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.Star

-
-
No usage of micycle.pgs.commons.Star
-
- - - diff --git a/micycle/pgs/commons/class-use/TangencyPack.html b/micycle/pgs/commons/class-use/TangencyPack.html deleted file mode 100644 index 77764902..00000000 --- a/micycle/pgs/commons/class-use/TangencyPack.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.TangencyPack (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.TangencyPack

-
-
No usage of micycle.pgs.commons.TangencyPack
-
- - - diff --git a/micycle/pgs/commons/class-use/TriangleSubdivision.html b/micycle/pgs/commons/class-use/TriangleSubdivision.html deleted file mode 100644 index 061b6bdf..00000000 --- a/micycle/pgs/commons/class-use/TriangleSubdivision.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - -Uses of Class micycle.pgs.commons.TriangleSubdivision (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Class
micycle.pgs.commons.TriangleSubdivision

-
-
No usage of micycle.pgs.commons.TriangleSubdivision
-
- - - diff --git a/micycle/pgs/commons/package-summary.html b/micycle/pgs/commons/package-summary.html deleted file mode 100644 index 08edfa45..00000000 --- a/micycle/pgs/commons/package-summary.html +++ /dev/null @@ -1,412 +0,0 @@ - - - - - -micycle.pgs.commons (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Package micycle.pgs.commons

-
-
-
- - -
The commons package contains all non-core PGS classes (of varying authorship - and either not worth putting in separate package or too long to include - within the calling PGS method itself).
-
-
    -
  • - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    Class Summary 
    ClassDescription
    ChaikinCut -
    Chaikin’s corner-cutting algorithm, which is used to perform polygon - smoothing.
    -
    ClosestPointPair -
    An implementation of a divide-and-conquer algorithm for computing the closest - pair of elements of a set of points.
    -
    CornerRounding -
    Corner rounding for PShape polygons.
    -
    DiscreteCurveEvolution -
    Convexity Rule for Shape Decomposition Based on Discrete Contour Evolution.
    -
    DoyleSpiral -
    Doyle spirals are patterns of non-crossing circles in the plane, each tangent - to six others.
    -
    FarthestPointPair -
    The FarthestPair data type computes the farthest pair of points in a - set of n points in the plane and provides accessor methods for - getting the farthest pair of points and the distance between them.
    -
    FastAtan2 -
    Fast, high-quality polynomial-based atan2 approximation.
    -
    FastPolygonizer -
    This class solves the problem of finding polygons formed by a collection of - edges.
    -
    FrontChainPacker -
    Circle packing of rectangle boundaries using the front-chain packing - algorithm from 'Visualization of Large Hierarchical Data by Circle Packing'.
    -
    GaussianLineSmoothing -
    Line gaussian smoothing.
    -
    GeneticColoring<V,​E> -
    Finds a solution to a graph coloring using a genetic algorithm.
    -
    HatchTiling -
    Port of https://openprocessing.org/sketch/1523350/
    -
    IncrementalTinDual -
    Produces a (barycentric) dual graph from a TinFour Delaunay Triangulation.
    -
    MaximumInscribedAARectangle -
    Computes the largest inscribed axis-aligned rectangle within a convex hull.
    -
    MaximumInscribedCircles -
    An bespoke version of - MaximumInscribedCircle to find N largest maximum inscribed circles in an - optimised manner.
    -
    MaximumInscribedRectangle -
    Finds an approximate largest area rectangle of arbitrary orientation in a - polygon via particle swarm optimisation.
    -
    MinimumBoundingEllipse -
    Minimum Volume Enclosing Ellipsoid
    -
    MinimumBoundingTriangle -
    Computes the Minimum Bounding Triangle (MBT) for the points in a Geometry.
    -
    PEdge -
    An undirected edge / line segment joining 2 PVectors.
    -
    PenroseTiling -
    Generates a Penrose tiling of the plane.
    -
    PoissonDistributionDeprecated. -
    in favour of PoissonDistributionJRUS
    -
    PoissonDistributionJRUS -
    Generates sets of random points via Poisson Disk Sampling.
    -
    PolygonDecomposition -
    Implementation of the Bayazit convex decomposition algorithm for simple - polygons.
    -
    RandomPolygon -
    Random Convex Polygons
    -
    RectangularSubdivision -
    Random rectangle subdivision.
    -
    RepulsionCirclePack -
    Repulsion Packing attempts to arrange a set of circles of specified radii - within a rectangle such that there is no-overlap between circles.
    -
    RLFColoring<V,​E> -
    The Recursive Largest First (RLF) algorithm for graph coloring.
    -
    SeededRandomPointsInGridBuilder -
    An extension to the - RandomPointsInGridBuilder class that accepts a random seed for repeatable - outputs.
    -
    ShapeInterpolation -
    Best-guess interpolation between any two linear rings.
    -
    SpiralQuadrangulation -
    Quadrangulations of Planar Point Sets via the Spiraling Rotating Calipers - Algorithm.
    -
    SquareTriangleTiling -
    A non-periodic (quasiperiodic?) tiling, comprising squares and equilateral - triangles.
    -
    Star -
    Methods to create star shapes
    -
    TangencyPack -
    Implements a circle packing algorithm described by Collins and Stephenson - (2003) to find an arrangement of circles which corresponds to a graph of - desired circle tangencies.
    -
    TriangleSubdivision -
    Balanced triangle subdivision.
    -
    -
    • -
  • - - - - - - - - - - - - -
    Annotation Types Summary 
    Annotation TypeDescription
    Nullable -
    An element annotated with Nullable claims null value is - perfectly valid to return (for methods), pass to (parameters) and - hold (local variables and fields).
    -
    -
    • -
-
-
-
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/package-tree.html b/micycle/pgs/commons/package-tree.html deleted file mode 100644 index 4396457b..00000000 --- a/micycle/pgs/commons/package-tree.html +++ /dev/null @@ -1,213 +0,0 @@ - - - - - -micycle.pgs.commons Class Hierarchy (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Hierarchy For Package micycle.pgs.commons

-Package Hierarchies: - -
-
-
-

Class Hierarchy

- -
-
-

Annotation Type Hierarchy

- -
-
-
-
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/commons/package-use.html b/micycle/pgs/commons/package-use.html deleted file mode 100644 index c2d35939..00000000 --- a/micycle/pgs/commons/package-use.html +++ /dev/null @@ -1,229 +0,0 @@ - - - - - -Uses of Package micycle.pgs.commons (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Package
micycle.pgs.commons

-
-
-
    -
  • - - - - - - - - - - - - - - - - -
    Packages that use micycle.pgs.commons 
    PackageDescription
    micycle.pgs -
    Processing Geometry Suite is a software project that provides easy access to - geometric algorithms in the form of a Processing library.
    -
    micycle.pgs.commons -
    The commons package contains all non-core PGS classes (of varying authorship - and either not worth putting in separate package or too long to include - within the calling PGS method itself).
    -
    -
    • -
  • - - - - - - - - - - - - - - - - - - -
    Classes in micycle.pgs.commons used by micycle.pgs 
    ClassDescription
    Nullable -
    An element annotated with Nullable claims null value is - perfectly valid to return (for methods), pass to (parameters) and - hold (local variables and fields).
    -
    PEdge -
    An undirected edge / line segment joining 2 PVectors.
    -
    -
    • -
  • - - - - - - - - - - - - - - - - - - -
    Classes in micycle.pgs.commons used by micycle.pgs.commons 
    ClassDescription
    IncrementalTinDual.DualEdge 
    PEdge -
    An undirected edge / line segment joining 2 PVectors.
    -
    -
    • -
-
-
-
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/package-summary.html b/micycle/pgs/package-summary.html deleted file mode 100644 index 790e29c9..00000000 --- a/micycle/pgs/package-summary.html +++ /dev/null @@ -1,339 +0,0 @@ - - - - - -micycle.pgs (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Package micycle.pgs

-
-
-
- - -
Processing Geometry Suite is a software project that provides easy access to - geometric algorithms in the form of a Processing library. -

- Functionality is split over the following classes: -

-
-
    -
  • - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    Class Summary 
    ClassDescription
    PGS_CirclePacking -
    Circle packings of shapes, subject to varying constraints and patterns of - tangencies.
    -
    PGS_Coloring -
    Intelligently color meshes (or mesh-like shapes) such that no two adjacent - faces have the same color, while minimising the number of colors used.
    -
    PGS_Construction -
    Construct uncommon/interesting 2D geometries.
    -
    PGS_Contour -
    Methods for producing different kinds of shape contours.
    -
    PGS_Conversion -
    Conversion between Processing PShapes and JTS - Geometries (amongst other formats).
    -
    PGS_Hull -
    Convex and concave hulls (amongst other variations) of polygons and point - sets.
    -
    PGS_Meshing -
    Mesh generation (excluding triangulation).
    -
    PGS_Morphology -
    Methods that affect the geometry or topology of shapes.
    -
    PGS_Optimisation -
    Solve geometric optimisation problems, such as bounding volumes, inscribed - areas, optimal distances, etc.
    -
    PGS_PointSet -
    Generation of random sets of 2D points having a variety of different - distributions and constraints (and associated functions).
    -
    PGS_Processing -
    Geometry Processing -- methods that process a shape in some way: compute - hulls, partition, slice, etc.
    -
    PGS_SegmentSet -
    Generation of random sets of non-intersecting line segments (and - associated functions).
    -
    PGS_ShapeBoolean -
    Boolean set-operations for 2D shapes.
    -
    PGS_ShapePredicates -
    Various shape metrics & predicates
    -
    PGS_Tiling -
    Tiling, tessellation and subdivision of the plane using periodic or - non-periodic geometric shapes.
    -
    PGS_Transformation -
    Various geometric and affine transformations for PShapes that affect vertex - coordinates.
    -
    PGS_Triangulation -
    Delaunay and earcut triangulation of shapes and point sets.
    -
    PGS_Voronoi -
    Voronoi Diagrams of shapes and point sets.
    -
    -
    • -
  • - - - - - - - - - - - - - - - - - - - - -
    Enum Summary 
    EnumDescription
    PGS_Coloring.ColoringAlgorithm -
    Specifies the algorithm/heuristic used by the underlying graph coloring process to find - a coloring for mesh faces.
    -
    PGS_Construction.SierpinskiTriCurveType 
    PGS_Contour.OffsetStyle -
    Specifies the join style for offset curves.
    -
    -
    • -
-
-
-
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/package-tree.html b/micycle/pgs/package-tree.html deleted file mode 100644 index ebe80dfc..00000000 --- a/micycle/pgs/package-tree.html +++ /dev/null @@ -1,198 +0,0 @@ - - - - - -micycle.pgs Class Hierarchy (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Hierarchy For Package micycle.pgs

-Package Hierarchies: - -
-
-
-

Class Hierarchy

- -
-
-

Enum Hierarchy

- -
-
-
-
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/micycle/pgs/package-use.html b/micycle/pgs/package-use.html deleted file mode 100644 index aa7bcd35..00000000 --- a/micycle/pgs/package-use.html +++ /dev/null @@ -1,201 +0,0 @@ - - - - - -Uses of Package micycle.pgs (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Uses of Package
micycle.pgs

-
-
- -
-
-
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/options b/options new file mode 100644 index 00000000..0ec31dbd --- /dev/null +++ b/options @@ -0,0 +1,29 @@ +-classpath +'/home/runner/.m2/repository/com/github/micycle1/processing3/3.5.4/processing3-3.5.4.jar:/home/runner/.m2/repository/org/jogamp/jogl/jogl-all-main/2.3.2/jogl-all-main-2.3.2.jar:/home/runner/.m2/repository/org/jogamp/jogl/jogl-all/2.3.2/jogl-all-2.3.2.jar:/home/runner/.m2/repository/org/jogamp/jogl/jogl-all/2.3.2/jogl-all-2.3.2-natives-android-aarch64.jar:/home/runner/.m2/repository/org/jogamp/jogl/jogl-all/2.3.2/jogl-all-2.3.2-natives-android-armv6.jar:/home/runner/.m2/repository/org/jogamp/jogl/jogl-all/2.3.2/jogl-all-2.3.2-natives-linux-amd64.jar:/home/runner/.m2/repository/org/jogamp/jogl/jogl-all/2.3.2/jogl-all-2.3.2-natives-linux-armv6.jar:/home/runner/.m2/repository/org/jogamp/jogl/jogl-all/2.3.2/jogl-all-2.3.2-natives-linux-armv6hf.jar:/home/runner/.m2/repository/org/jogamp/jogl/jogl-all/2.3.2/jogl-all-2.3.2-natives-linux-i586.jar:/home/runner/.m2/repository/org/jogamp/jogl/jogl-all/2.3.2/jogl-all-2.3.2-natives-macosx-universal.jar:/home/runner/.m2/repository/org/jogamp/jogl/jogl-all/2.3.2/jogl-all-2.3.2-natives-solaris-amd64.jar:/home/runner/.m2/repository/org/jogamp/jogl/jogl-all/2.3.2/jogl-all-2.3.2-natives-solaris-i586.jar:/home/runner/.m2/repository/org/jogamp/jogl/jogl-all/2.3.2/jogl-all-2.3.2-natives-windows-amd64.jar:/home/runner/.m2/repository/org/jogamp/jogl/jogl-all/2.3.2/jogl-all-2.3.2-natives-windows-i586.jar:/home/runner/.m2/repository/org/jogamp/gluegen/gluegen-rt-main/2.3.2/gluegen-rt-main-2.3.2.jar:/home/runner/.m2/repository/org/jogamp/gluegen/gluegen-rt/2.3.2/gluegen-rt-2.3.2.jar:/home/runner/.m2/repository/org/jogamp/gluegen/gluegen-rt/2.3.2/gluegen-rt-2.3.2-natives-android-aarch64.jar:/home/runner/.m2/repository/org/jogamp/gluegen/gluegen-rt/2.3.2/gluegen-rt-2.3.2-natives-android-armv6.jar:/home/runner/.m2/repository/org/jogamp/gluegen/gluegen-rt/2.3.2/gluegen-rt-2.3.2-natives-linux-amd64.jar:/home/runner/.m2/repository/org/jogamp/gluegen/gluegen-rt/2.3.2/gluegen-rt-2.3.2-natives-linux-armv6.jar:/home/runner/.m2/repository/org/jogamp/gluegen/gluegen-rt/2.3.2/gluegen-rt-2.3.2-natives-linux-armv6hf.jar:/home/runner/.m2/repository/org/jogamp/gluegen/gluegen-rt/2.3.2/gluegen-rt-2.3.2-natives-linux-i586.jar:/home/runner/.m2/repository/org/jogamp/gluegen/gluegen-rt/2.3.2/gluegen-rt-2.3.2-natives-macosx-universal.jar:/home/runner/.m2/repository/org/jogamp/gluegen/gluegen-rt/2.3.2/gluegen-rt-2.3.2-natives-solaris-amd64.jar:/home/runner/.m2/repository/org/jogamp/gluegen/gluegen-rt/2.3.2/gluegen-rt-2.3.2-natives-solaris-i586.jar:/home/runner/.m2/repository/org/jogamp/gluegen/gluegen-rt/2.3.2/gluegen-rt-2.3.2-natives-windows-amd64.jar:/home/runner/.m2/repository/org/jogamp/gluegen/gluegen-rt/2.3.2/gluegen-rt-2.3.2-natives-windows-i586.jar:/home/runner/.m2/repository/javax/xml/bind/jaxb-api/2.3.0/jaxb-api-2.3.0.jar:/home/runner/.m2/repository/org/locationtech/jts/jts-core/1.20.0-SNAPSHOT/jts-core-1.20.0-SNAPSHOT.jar:/home/runner/.m2/repository/com/github/twak/campskeleton/8df5b241d5/campskeleton-8df5b241d5.jar:/home/runner/.m2/repository/javax/vecmath/vecmath/1.5.2/vecmath-1.5.2.jar:/home/runner/.m2/repository/gov/nist/math/jama/1.0.3/jama-1.0.3.jar:/home/runner/.m2/repository/com/github/twak/jutils/master-198bbef5f6-1/jutils-master-198bbef5f6-1.jar:/home/runner/.m2/repository/com/thoughtworks/xstream/xstream/1.4.10/xstream-1.4.10.jar:/home/runner/.m2/repository/xmlpull/xmlpull/1.1.3.1/xmlpull-1.1.3.1.jar:/home/runner/.m2/repository/xpp3/xpp3_min/1.1.4c/xpp3_min-1.1.4c.jar:/home/runner/.m2/repository/org/apache/xmlgraphics/batik-svg-dom/1.10/batik-svg-dom-1.10.jar:/home/runner/.m2/repository/org/apache/xmlgraphics/batik-awt-util/1.10/batik-awt-util-1.10.jar:/home/runner/.m2/repository/org/apache/xmlgraphics/xmlgraphics-commons/2.2/xmlgraphics-commons-2.2.jar:/home/runner/.m2/repository/org/apache/xmlgraphics/batik-css/1.10/batik-css-1.10.jar:/home/runner/.m2/repository/org/apache/xmlgraphics/batik-dom/1.10/batik-dom-1.10.jar:/home/runner/.m2/repository/org/apache/xmlgraphics/batik-xml/1.10/batik-xml-1.10.jar:/home/runner/.m2/repository/xalan/xalan/2.7.2/xalan-2.7.2.jar:/home/runner/.m2/repository/xalan/serializer/2.7.2/serializer-2.7.2.jar:/home/runner/.m2/repository/org/apache/xmlgraphics/batik-ext/1.10/batik-ext-1.10.jar:/home/runner/.m2/repository/org/apache/xmlgraphics/batik-parser/1.10/batik-parser-1.10.jar:/home/runner/.m2/repository/org/apache/xmlgraphics/batik-util/1.10/batik-util-1.10.jar:/home/runner/.m2/repository/org/apache/xmlgraphics/batik-constants/1.10/batik-constants-1.10.jar:/home/runner/.m2/repository/org/apache/xmlgraphics/batik-i18n/1.10/batik-i18n-1.10.jar:/home/runner/.m2/repository/xml-apis/xml-apis-ext/1.3.04/xml-apis-ext-1.3.04.jar:/home/runner/.m2/repository/org/apache/xmlgraphics/batik-svggen/1.10/batik-svggen-1.10.jar:/home/runner/.m2/repository/org/apache/xmlgraphics/batik-codec/1.10/batik-codec-1.10.jar:/home/runner/.m2/repository/org/apache/xmlgraphics/batik-bridge/1.10/batik-bridge-1.10.jar:/home/runner/.m2/repository/org/apache/xmlgraphics/batik-gvt/1.10/batik-gvt-1.10.jar:/home/runner/.m2/repository/org/apache/xmlgraphics/batik-script/1.10/batik-script-1.10.jar:/home/runner/.m2/repository/org/apache/xmlgraphics/batik-transcoder/1.10/batik-transcoder-1.10.jar:/home/runner/.m2/repository/org/apache/xmlgraphics/batik-anim/1.10/batik-anim-1.10.jar:/home/runner/.m2/repository/org/orbisgis/poly2tri-core/0.1.2/poly2tri-core-0.1.2.jar:/home/runner/.m2/repository/org/jgrapht/jgrapht-core/1.4.0/jgrapht-core-1.4.0.jar:/home/runner/.m2/repository/org/jheaps/jheaps/0.11/jheaps-0.11.jar:/home/runner/.m2/repository/org/tinfour/TinfourCore/2.1.7/TinfourCore-2.1.7.jar:/home/runner/.m2/repository/com/github/micycle1/JMedialAxis/5207bec2f2/JMedialAxis-5207bec2f2.jar:/home/runner/.m2/repository/org/dyn4j/dyn4j/5.0.1/dyn4j-5.0.1.jar:/home/runner/.m2/repository/org/apache/commons/commons-math3/3.6.1/commons-math3-3.6.1.jar:/home/runner/.m2/repository/org/tinspin/tinspin-indexes/1.7.1/tinspin-indexes-1.7.1.jar:/home/runner/.m2/repository/junit/junit/4.10/junit-4.10.jar:/home/runner/.m2/repository/org/hamcrest/hamcrest-core/1.1/hamcrest-core-1.1.jar:/home/runner/.m2/repository/ch/ethz/globis/phtree/phtree/2.6.3/phtree-2.6.3.jar:/home/runner/.m2/repository/com/github/micycle1/balaban-intersection/1.0.0/balaban-intersection-1.0.0.jar:/home/runner/.m2/repository/com/github/micycle1/UniformNoise/1.1/UniformNoise-1.1.jar:/home/runner/.m2/repository/com/github/micycle1/space-filling-curves/1.0/space-filling-curves-1.0.jar:/home/runner/.m2/repository/com/github/bsideup/jabel/jabel-javac-plugin/1.0.0/jabel-javac-plugin-1.0.0.jar:/home/runner/.m2/repository/net/bytebuddy/byte-buddy/1.12.18/byte-buddy-1.12.18.jar:/home/runner/.m2/repository/net/bytebuddy/byte-buddy-agent/1.12.18/byte-buddy-agent-1.12.18.jar:/home/runner/.m2/repository/net/java/dev/jna/jna/5.12.1/jna-5.12.1.jar:/home/runner/.m2/repository/com/github/micycle1/kendzi-math/99f9217e84/kendzi-math-99f9217e84.jar:/home/runner/.m2/repository/com/github/micycle1/kendzi-math/kendzi-math-geometry/99f9217e84/kendzi-math-geometry-99f9217e84.jar:/home/runner/.m2/repository/org/joml/joml/1.10.3/joml-1.10.3.jar:/home/runner/.m2/repository/org/ejml/ejml-simple/0.41/ejml-simple-0.41.jar:/home/runner/.m2/repository/org/ejml/ejml-core/0.41/ejml-core-0.41.jar:/home/runner/.m2/repository/org/ejml/ejml-fdense/0.41/ejml-fdense-0.41.jar:/home/runner/.m2/repository/org/ejml/ejml-ddense/0.41/ejml-ddense-0.41.jar:/home/runner/.m2/repository/org/ejml/ejml-cdense/0.41/ejml-cdense-0.41.jar:/home/runner/.m2/repository/org/ejml/ejml-zdense/0.41/ejml-zdense-0.41.jar:/home/runner/.m2/repository/org/ejml/ejml-dsparse/0.41/ejml-dsparse-0.41.jar:/home/runner/.m2/repository/org/ejml/ejml-fsparse/0.41/ejml-fsparse-0.41.jar:/home/runner/.m2/repository/com/github/micycle1/kendzi-math/kendzi-math-geometry-debug/99f9217e84/kendzi-math-geometry-debug-99f9217e84.jar:/home/runner/.m2/repository/com/github/micycle1/kendzi-math/kendzi-straight-skeleton/99f9217e84/kendzi-straight-skeleton-99f9217e84.jar:/home/runner/.m2/repository/com/github/paudan/jswarmopt/1.0.3a/jswarmopt-1.0.3a.jar:/home/runner/.m2/repository/com/github/micycle1/TrapMap/1.0/TrapMap-1.0.jar:/home/runner/.m2/repository/quil/processing-core/3.5.4/processing-core-3.5.4.jar:/home/runner/.m2/repository/it/unimi/dsi/fastutil/8.5.12/fastutil-8.5.12.jar:/home/runner/.m2/repository/net/jafama/jafama/2.3.2/jafama-2.3.2.jar:/home/runner/.m2/repository/com/github/openjump-gis/topology-extension/v2.0.5/topology-extension-v2.0.5.jar:/home/runner/.m2/repository/org/openjump/OpenJUMP/2.2.0-main-SNAPSHOT/OpenJUMP-2.2.0-main-SNAPSHOT.jar:/home/runner/.m2/repository/log4j/log4j/1.2.17/log4j-1.2.17.jar:/home/runner/.m2/repository/org/locationtech/jts/io/jts-io-common/1.19.0/jts-io-common-1.19.0.jar:/home/runner/.m2/repository/org/apache-extras/beanshell/bsh/2.0b6/bsh-2.0b6.jar:/home/runner/.m2/repository/org/orbisgis/cts/1.5.2/cts-1.5.2.jar:/home/runner/.m2/repository/org/jdom/jdom2/2.0.6/jdom2-2.0.6.jar:/home/runner/.m2/repository/xerces/xercesImpl/2.12.2/xercesImpl-2.12.2.jar:/home/runner/.m2/repository/xml-apis/xml-apis/1.4.01/xml-apis-1.4.01.jar:/home/runner/.m2/repository/org/postgresql/postgresql/42.5.1/postgresql-42.5.1.jar:/home/runner/.m2/repository/batik/batik-svggen/1.6-1/batik-svggen-1.6-1.jar:/home/runner/.m2/repository/batik/batik-gvt/1.6-1/batik-gvt-1.6-1.jar:/home/runner/.m2/repository/batik/batik-awt-util/1.6-1/batik-awt-util-1.6-1.jar:/home/runner/.m2/repository/batik/batik-util/1.6-1/batik-util-1.6-1.jar:/home/runner/.m2/repository/batik/batik-gui-util/1.6-1/batik-gui-util-1.6-1.jar:/home/runner/.m2/repository/batik/batik-ext/1.6-1/batik-ext-1.6-1.jar:/home/runner/.m2/repository/batik/batik-svg-dom/1.6-1/batik-svg-dom-1.6-1.jar:/home/runner/.m2/repository/batik/batik-dom/1.6-1/batik-dom-1.6-1.jar:/home/runner/.m2/repository/batik/batik-css/1.6-1/batik-css-1.6-1.jar:/home/runner/.m2/repository/batik/batik-xml/1.6-1/batik-xml-1.6-1.jar:/home/runner/.m2/repository/batik/batik-parser/1.6-1/batik-parser-1.6-1.jar:/home/runner/.m2/repository/batik/batik-transcoder/1.6-1/batik-transcoder-1.6-1.jar:/home/runner/.m2/repository/batik/batik-bridge/1.6-1/batik-bridge-1.6-1.jar:/home/runner/.m2/repository/batik/batik-script/1.6-1/batik-script-1.6-1.jar:/home/runner/.m2/repository/net/sf/buoy/buoy/1.9/buoy-1.9.jar:/home/runner/.m2/repository/com/github/yannrichet/JMathArray/1.0/JMathArray-1.0.jar:/home/runner/.m2/repository/com/github/yannrichet/JMathPlot/1.0.1/JMathPlot-1.0.1.jar:/home/runner/.m2/repository/com/github/yannrichet/JMathIO/1.0/JMathIO-1.0.jar:/home/runner/.m2/repository/org/python/jython/2.2.1/jython-2.2.1.jar:/home/runner/.m2/repository/org/tukaani/xz/1.9/xz-1.9.jar:/home/runner/.m2/repository/commons-codec/commons-codec/1.15/commons-codec-1.15.jar:/home/runner/.m2/repository/org/apache/commons/commons-compress/1.21/commons-compress-1.21.jar:/home/runner/.m2/repository/org/apache/commons/commons-imaging/1.0-alpha3/commons-imaging-1.0-alpha3.jar:/home/runner/.m2/repository/commons-io/commons-io/2.11.0/commons-io-2.11.0.jar:/home/runner/.m2/repository/org/apache/commons/commons-lang3/3.12.0/commons-lang3-3.12.0.jar:/home/runner/.m2/repository/commons-logging/commons-logging/1.2/commons-logging-1.2.jar:/home/runner/.m2/repository/com/github/jai-imageio/jai-imageio-core/1.4.0/jai-imageio-core-1.4.0.jar:/home/runner/.m2/repository/javax/media/jai_core/1.1.3/jai_core-1.1.3.jar:/home/runner/.m2/repository/javax/media/jai_codec/1.1.3/jai_codec-1.1.3.jar:/home/runner/.m2/repository/javax/media/jai_imageio/1.1/jai_imageio-1.1.jar:/home/runner/.m2/repository/org/gdal/gdal/3.5.0/gdal-3.5.0.jar:/home/runner/.m2/repository/it/geosolutions/imageio-ext/imageio-ext-utilities/1.4.6/imageio-ext-utilities-1.4.6.jar:/home/runner/.m2/repository/it/geosolutions/imageio-ext/imageio-ext-gdalframework/1.4.6/imageio-ext-gdalframework-1.4.6.jar:/home/runner/.m2/repository/it/geosolutions/imageio-ext/imageio-ext-streams/1.4.6/imageio-ext-streams-1.4.6.jar:/home/runner/.m2/repository/it/geosolutions/imageio-ext/imageio-ext-geocore/1.4.6/imageio-ext-geocore-1.4.6.jar:/home/runner/.m2/repository/it/geosolutions/imageio-ext/imageio-ext-tiff/1.1.13/imageio-ext-tiff-1.1.13.jar:/home/runner/.m2/repository/uk/gov/nationalarchives/thirdparty/netbeans/org-netbeans-swing-outline/7.2/org-netbeans-swing-outline-7.2.jar:/home/runner/.m2/repository/com/googlecode/json-simple/json-simple/1.1.1/json-simple-1.1.1.jar:/home/runner/.m2/repository/com/github/scoutant/polyline-decoder/5b6f55fc1a/polyline-decoder-5b6f55fc1a.jar:/home/runner/.m2/repository/it/unimi/dsi/dsiutils/2.7.2/dsiutils-2.7.2.jar:/home/runner/.m2/repository/org/slf4j/slf4j-api/1.7.30/slf4j-api-1.7.30.jar:/home/runner/.m2/repository/it/unimi/di/jsap/20210129/jsap-20210129.jar:/home/runner/.m2/repository/org/apache/commons/commons-configuration2/2.7/commons-configuration2-2.7.jar:/home/runner/.m2/repository/org/apache/commons/commons-text/1.8/commons-text-1.8.jar:/home/runner/.m2/repository/com/google/guava/guava/31.1-jre/guava-31.1-jre.jar:/home/runner/.m2/repository/com/google/guava/failureaccess/1.0.1/failureaccess-1.0.1.jar:/home/runner/.m2/repository/com/google/guava/listenablefuture/9999.0-empty-to-avoid-conflict-with-guava/listenablefuture-9999.0-empty-to-avoid-conflict-with-guava.jar:/home/runner/.m2/repository/com/google/code/findbugs/jsr305/3.0.2/jsr305-3.0.2.jar:/home/runner/.m2/repository/org/checkerframework/checker-qual/3.12.0/checker-qual-3.12.0.jar:/home/runner/.m2/repository/com/google/errorprone/error_prone_annotations/2.11.0/error_prone_annotations-2.11.0.jar:/home/runner/.m2/repository/com/google/j2objc/j2objc-annotations/1.3/j2objc-annotations-1.3.jar:/home/runner/.m2/repository/com/github/micycle1/RectPacking/9178e79df3/RectPacking-9178e79df3.jar:/home/runner/.m2/repository/com/github/micycle1/BetterBeziers/19567c7be4/BetterBeziers-19567c7be4.jar:/home/runner/.m2/repository/com/github/micycle1/Hobby-Curves/1.0/Hobby-Curves-1.0.jar:/home/runner/.m2/repository/com/github/whitegreen/Dalsoo-Bin-Packing/bde2a3ef09/Dalsoo-Bin-Packing-bde2a3ef09.jar:/home/runner/.m2/repository/com/github/micycle1/SRPG/1.0/SRPG-1.0.jar:/home/runner/.m2/repository/it/unimi/dsi/fastutil-core/8.5.12/fastutil-core-8.5.12.jar:/home/runner/.m2/repository/com/scrtwpns/mixbox/2.0.0/mixbox-2.0.0.jar' +-encoding +'UTF-8' +-protected +-sourcepath +'/home/runner/work/PGS/PGS/src/main/java' +-subpackages +micycle.pgs.* +-exclude +micycle.pgs.color:micycle.pgs.color +-author +-bottom +'Copyright © 2023. All rights reserved.' +-charset +'UTF-8' +-d +'/home/runner/work/PGS/PGS/target/site/apidocs' +-docencoding +'UTF-8' +-Xdoclint:none +-doctitle +'Processing Geometry Suite 1.4.0 API' +-linkoffline +'https://docs.oracle.com/javase/8/docs/api' '/home/runner/work/PGS/PGS/target/javadoc-bundle-options' +-use +-version +-windowtitle +'Processing Geometry Suite 1.4.0 API' diff --git a/overview-summary.html b/overview-summary.html deleted file mode 100644 index 7b311af8..00000000 --- a/overview-summary.html +++ /dev/null @@ -1,23 +0,0 @@ - - - - - -Processing Geometry Suite 1.3.0 API - - - - - - - -
- -

index.html

-
- - diff --git a/overview-tree.html b/overview-tree.html deleted file mode 100644 index 927ab87e..00000000 --- a/overview-tree.html +++ /dev/null @@ -1,248 +0,0 @@ - - - - - -Class Hierarchy (Processing Geometry Suite 1.3.0 API) - - - - - - - - - - - - - - - -
- -
-
-
-

Hierarchy For All Packages

-Package Hierarchies: - -
-
-
-

Class Hierarchy

- -
-
-

Annotation Type Hierarchy

- -
-
-

Enum Hierarchy

- -
-
-
-
- -

Copyright © 2022. All rights reserved.

-
- - diff --git a/package-search-index.js b/package-search-index.js deleted file mode 100644 index 38d1a52f..00000000 --- a/package-search-index.js +++ /dev/null @@ -1 +0,0 @@ -packageSearchIndex = [{"l":"All Packages","url":"allpackages-index.html"},{"l":"micycle.pgs"},{"l":"micycle.pgs.commons"}] \ No newline at end of file diff --git a/package-search-index.zip b/package-search-index.zip deleted file mode 100644 index f9d7c53286492430987d95b8fc412a66406fa13b..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 236 zcmWIWW@Zs#;Nak3I9e4F%76qUf$W0BR3-ORj{)C#?<;{3esbz!Fh zHw6`)IT^^|;d9Q<$6q(>QlOSD6Q|m7U1!;dV@+vBxl2xiuRb)I_dvbBm zSFTIl8#`aBK7an~*>lFHNsIyB>>RWFpQd{NElUOB0B=Sn5e9^VkmW!QLIpUT7vRmx P22#ohgziAPAFK}m6q7JoRsvExf%rEN>jUL}qZ_~k#FbE+Q;{`;0FZwVNX2n-^JoI; zP;4#$8DIy*Yk-P>VN(DUKmPse7mx+ExD4O|;?E5D0Z5($mjO3`*anwQU^s{ZDK#Lz zj>~{qyaIx5K!t%=G&2IJNzg!ChRpyLkO7}Ry!QaotAHAMpbB3AF(}|_f!G-oI|uK6 z`id_dumai5K%C3Y$;tKS_iqMPHg<*|-@e`liWLAggVM!zAP#@l;=c>S03;{#04Z~5 zN_+ss=Yg6*hTr59mzMwZ@+l~q!+?ft!fF66AXT#wWavHt30bZWFCK%!BNk}LN?0Hg z1VF_nfs`Lm^DjYZ1(1uD0u4CSIr)XAaqW6IT{!St5~1{i=i}zAy76p%_|w8rh@@c0Axr!ns=D-X+|*sY6!@wacG9%)Qn*O zl0sa739kT-&_?#oVxXF6tOnqTD)cZ}2vi$`ZU8RLAlo8=_z#*P3xI~i!lEh+Pdu-L zx{d*wgjtXbnGX_Yf@Tc7Q3YhLhPvc8noGJs2DA~1DySiA&6V{5JzFt ojAY1KXm~va;tU{v7C?Xj0BHw!K;2aXV*mgE07*qoM6N<$f;4TDA^-pY diff --git a/script.js b/script.js deleted file mode 100644 index 7dc93c48..00000000 --- a/script.js +++ /dev/null @@ -1,149 +0,0 @@ -/* - * 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 data) { - var row = document.getElementById(key); - if ((data[key] & type) !== 0) { - row.style.display = ''; - row.className = (count++ % 2) ? rowColor : altColor; - } - else - row.style.display = 'none'; - } - updateTabs(type); -} - -function updateTabs(type) { - for (var value in tabs) { - var sNode = document.getElementById(tabs[value][0]); - var spanNode = sNode.firstChild; - if (value == type) { - sNode.className = activeTableTab; - spanNode.innerHTML = tabs[value][1]; - } - else { - sNode.className = tableTab; - spanNode.innerHTML = "" + tabs[value][1] + ""; - } - } -} - -function updateModuleFrame(pFrame, cFrame) { - top.packageFrame.location = pFrame; - top.classFrame.location = cFrame; -} diff --git a/search.js b/search.js deleted file mode 100644 index 8492271e..00000000 --- a/search.js +++ /dev/null @@ -1,326 +0,0 @@ -/* - * 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 (item.m && 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/stylesheet.css b/stylesheet.css deleted file mode 100644 index de945eda..00000000 --- a/stylesheet.css +++ /dev/null @@ -1,910 +0,0 @@ -/* - * 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[href]:hover, a[href]:focus { - text-decoration:none; - color:#bb7a2a; -} -a[name] { - 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; - font-size:14px; -} -h1 { - font-size:20px; -} -h2 { - font-size:18px; -} -h3 { - font-size:16px; - font-style:italic; -} -h4 { - font-size:13px; -} -h5 { - font-size:12px; -} -h6 { - font-size:11px; -} -ul { - list-style-type:disc; -} -code, tt { - font-family:'DejaVu Sans Mono', monospace; - font-size:14px; - padding-top:4px; - margin-top:8px; - line-height:1.4em; -} -dt code { - font-family:'DejaVu Sans Mono', monospace; - font-size:14px; - padding-top:4px; -} -table tr td dt code { - font-family:'DejaVu Sans Mono', monospace; - font-size:14px; - vertical-align:top; - padding-top:4px; -} -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. - */ - -/* - * Styles for document title and copyright. - */ -.clear { - clear:both; - height:0px; - overflow:hidden; -} -.aboutLanguage { - float:right; - padding:0px 21px; - font-size:11px; - z-index:200; - margin-top:-9px; -} -.legalCopy { - margin-left:.5em; -} -.bar a, .bar a:link, .bar a:visited, .bar a:active { - color:#FFFFFF; - text-decoration:none; -} -.bar a:hover, .bar a:focus { - color:#bb7a2a; -} -.tab { - background-color:#0066FF; - color:#ffffff; - padding:8px; - width:5em; - font-weight:bold; -} -/* - * Styles for navigation bar. - */ -.bar { - background-color:#4D7A97; - color:#FFFFFF; - padding:.8em .5em .4em .8em; - height:auto;/*height:1.8em;*/ - 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; - float:left; - padding:0; - width:100%; - clear:right; - height:2.8em; - padding-top:10px; - overflow:hidden; - font-size:12px; -} -.bottomNav { - margin-top:10px; - background-color:#4D7A97; - color:#FFFFFF; - float:left; - padding:0; - width:100%; - clear:right; - height:2.8em; - padding-top:10px; - overflow:hidden; - font-size:12px; -} -.subNav { - background-color:#dee3e9; - float:left; - width:100%; - overflow:hidden; - font-size:12px; -} -.subNav div { - clear:left; - float:left; - padding:0 0 5px 6px; - text-transform:uppercase; -} -ul.navList, ul.subNavList { - float:left; - margin:0 25px 0 0; - padding:0; -} -ul.navList li{ - list-style:none; - float:left; - padding: 5px 6px; - text-transform:uppercase; -} -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; -} -.topNav a:link, .topNav a:active, .topNav a:visited, .bottomNav a:link, .bottomNav a:active, .bottomNav a:visited { - color:#FFFFFF; - text-decoration:none; - text-transform:uppercase; -} -.topNav a:hover, .bottomNav a:hover { - text-decoration:none; - color:#bb7a2a; - text-transform:uppercase; -} -.navBarCell1Rev { - background-color:#F8981D; - color:#253441; - margin: auto 5px; -} -.skipNav { - position:absolute; - top:auto; - left:-9999px; - overflow:hidden; -} -/* - * Styles for page header and footer. - */ -.header, .footer { - clear:both; - margin:0 20px; - padding:5px 0 0 0; -} -.indexNav { - position:relative; - font-size:12px; - background-color:#dee3e9; -} -.indexNav ul { - margin-top:0; - padding:5px; -} -.indexNav ul li { - display:inline; - list-style-type:none; - padding-right:10px; - text-transform:uppercase; -} -.indexNav h1 { - font-size:13px; -} -.title { - color:#2c4557; - margin:10px 0; -} -.subTitle { - margin:5px 0 0 0; -} -.header ul { - margin:0 0 15px 0; - padding:0; -} -.footer ul { - margin:20px 0 5px 0; -} -.header ul li, .footer ul li { - list-style:none; - font-size:13px; -} -/* - * 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; - margin:0 0 6px -8px; - padding:7px 5px; -} -ul.blockList ul.blockList ul.blockList li.blockList h3 { - background-color:#dee3e9; - border:1px solid #d0d9e0; - margin:0 0 6px -8px; - padding:7px 5px; -} -ul.blockList ul.blockList li.blockList h3 { - padding:0; - margin:15px 0; -} -ul.blockList li.blockList h2 { - padding:0px 0 20px 0; -} -/* - * Styles for page layout containers. - */ -.contentContainer, .sourceContainer, .classUseContainer, .serializedFormContainer, .constantValuesContainer, -.allClassesContainer, .allPackagesContainer { - clear:both; - padding:10px 20px; - position:relative; -} -.indexContainer { - margin:10px; - position:relative; - font-size:12px; -} -.indexContainer h2 { - font-size:13px; - padding:0 0 3px 0; -} -.indexContainer ul { - margin:0; - padding:0; -} -.indexContainer ul li { - list-style:none; - padding-top:2px; -} -.contentContainer .description dl dt, .contentContainer .details dl dt, .serializedFormContainer dl dt { - font-size:12px; - font-weight:bold; - margin:10px 0 0 0; - color:#4E4E4E; -} -.contentContainer .description dl dd, .contentContainer .details dl dd, .serializedFormContainer dl dd { - margin:5px 0 10px 0px; - font-size:14px; - font-family:'DejaVu Serif', Georgia, "Times New Roman", Times, serif; -} -.serializedFormContainer dl.nameValue dt { - margin-left:1px; - font-size:1.1em; - display:inline; - font-weight:bold; -} -.serializedFormContainer dl.nameValue dd { - margin:0 0 0 1px; - font-size:1.1em; - display:inline; -} -/* - * Styles for lists. - */ -li.circle { - list-style:circle; -} -ul.horizontal li { - display:inline; - font-size:0.9em; -} -ul.inheritance { - margin:0; - padding:0; -} -ul.inheritance li { - display:inline; - list-style:none; -} -ul.inheritance li ul.inheritance { - margin-left:15px; - padding-left:15px; - padding-top:1px; -} -ul.blockList, ul.blockListLast { - margin:10px 0 10px 0; - padding:0; -} -ul.blockList li.blockList, ul.blockListLast li.blockList { - list-style:none; - margin-bottom:15px; - line-height:1.4; -} -ul.blockList ul.blockList li.blockList, ul.blockList ul.blockListLast li.blockList { - padding:0px 20px 5px 10px; - border:1px solid #ededed; - background-color:#f8f8f8; -} -ul.blockList ul.blockList ul.blockList li.blockList, ul.blockList ul.blockList ul.blockListLast li.blockList { - padding:0 0 5px 8px; - background-color:#ffffff; - border:none; -} -ul.blockList ul.blockList ul.blockList ul.blockList li.blockList { - margin-left:0; - padding-left:0; - padding-bottom:15px; - border:none; -} -ul.blockList ul.blockList ul.blockList ul.blockList li.blockListLast { - list-style:none; - border-bottom:none; - padding-bottom:0; -} -table tr td dl, table tr td dl dt, table tr td dl dd { - margin-top:0; - margin-bottom:1px; -} -/* - * 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, .requiresSummary, .packagesSummary, .providesSummary, .usesSummary { - padding:0px; -} -.overviewSummary caption, .memberSummary caption, .typeSummary caption, -.useSummary caption, .constantsSummary caption, .deprecatedSummary caption, -.requiresSummary caption, .packagesSummary caption, .providesSummary caption, .usesSummary caption { - position:relative; - text-align:left; - background-repeat:no-repeat; - color:#253441; - font-weight:bold; - clear:none; - overflow:hidden; - padding:0px; - padding-top:10px; - padding-left:1px; - margin:0px; - white-space:pre; -} -.constantsSummary caption a:link, .constantsSummary caption a:visited, -.useSummary caption a:link, .useSummary caption a:visited { - color:#1f389c; -} -.overviewSummary caption a:link, .memberSummary caption a:link, .typeSummary 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, -.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, -.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, -.deprecatedSummary caption a:visited, -.requiresSummary caption a:visited, .packagesSummary caption a:visited, .providesSummary caption a:visited, -.usesSummary caption a:visited { - color:#FFFFFF; -} -.overviewSummary caption span, .memberSummary caption span, .typeSummary 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; - padding-right:12px; - padding-bottom:7px; - display:inline-block; - float:left; - background-color:#F8981D; - border: none; - height:16px; -} -.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; - padding-right:12px; - margin-right:3px; - display:inline-block; - float:left; - background-color:#F8981D; - height:16px; -} -.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; - padding-right:12px; - margin-right:3px; - display:inline-block; - float:left; - background-color:#4D7A97; - height:16px; -} -.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; - background-image:none; - float:none; - display:inline; -} -.overviewSummary .tabEnd, .memberSummary .tabEnd, .typeSummary .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, .packagesSummary .activeTableTab .tabEnd, -.overviewSummary .activeTableTab .tabEnd, .typeSummary .activeTableTab .tabEnd { - display:none; - width:5px; - margin-right:3px; - position:relative; - float:left; - background-color:#F8981D; -} -.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, -.requiresSummary td, .packagesSummary td, .providesSummary td, .usesSummary td { - text-align:left; - padding:0px 0px 12px 10px; -} -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.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 { - font-size:13px; -} -td.colSecond, th.colSecond, td.colLast, th.colConstructorName, th.colDeprecatedItemName, th.colLast { - font-size:13px; -} -.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, -.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.colSecond, .memberSummary th.colSecond, .memberSummary th.colConstructorName, -.typeSummary td.colFirst, .typeSummary th.colFirst { - vertical-align:top; -} -.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 th { - background-color:#FFFFFF; -} -.rowColor, .rowColor th { - background-color:#EEEEEF; -} -/* - * Styles for contents. - */ -.description pre { - margin-top:0; -} -.deprecatedContent { - margin:0; - padding:10px 0; -} -.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; -} -/* - * Styles for formatting effect. - */ -.sourceLineNo { - color:green; - padding:0 30px 0 0; -} -h1.hidden { - visibility:hidden; - overflow:hidden; - font-size:10px; -} -.block { - display:block; - margin:3px 10px 2px 0px; - color:#474747; -} -.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; -} -.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 { - 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; - background-color: #FFFFFF; -} -ul.ui-autocomplete li { - float:left; - clear:both; - width:100%; -} -.resultHighlight { - font-weight:bold; -} -.ui-autocomplete .result-item { - font-size: inherit; -} -#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/type-search-index.js b/type-search-index.js deleted file mode 100644 index 7a6104f6..00000000 --- a/type-search-index.js +++ /dev/null @@ -1 +0,0 @@ -typeSearchIndex = [{"l":"All Classes","url":"allclasses-index.html"},{"p":"micycle.pgs.commons","l":"ChaikinCut"},{"p":"micycle.pgs.commons","l":"ClosestPointPair"},{"p":"micycle.pgs","l":"PGS_Coloring.ColoringAlgorithm"},{"p":"micycle.pgs.commons","l":"CornerRounding"},{"p":"micycle.pgs.commons","l":"DiscreteCurveEvolution"},{"p":"micycle.pgs.commons","l":"DoyleSpiral"},{"p":"micycle.pgs.commons","l":"IncrementalTinDual.DualEdge"},{"p":"micycle.pgs.commons","l":"FarthestPointPair"},{"p":"micycle.pgs.commons","l":"FastAtan2"},{"p":"micycle.pgs.commons","l":"FastPolygonizer"},{"p":"micycle.pgs.commons","l":"FrontChainPacker"},{"p":"micycle.pgs.commons","l":"GaussianLineSmoothing"},{"p":"micycle.pgs.commons","l":"GeneticColoring"},{"p":"micycle.pgs.commons","l":"HatchTiling"},{"p":"micycle.pgs.commons","l":"IncrementalTinDual"},{"p":"micycle.pgs.commons","l":"MaximumInscribedAARectangle"},{"p":"micycle.pgs.commons","l":"MaximumInscribedCircles"},{"p":"micycle.pgs.commons","l":"MaximumInscribedRectangle"},{"p":"micycle.pgs.commons","l":"MinimumBoundingEllipse"},{"p":"micycle.pgs.commons","l":"MinimumBoundingTriangle"},{"p":"micycle.pgs.commons","l":"Nullable"},{"p":"micycle.pgs","l":"PGS_Contour.OffsetStyle"},{"p":"micycle.pgs.commons","l":"PEdge"},{"p":"micycle.pgs.commons","l":"PenroseTiling"},{"p":"micycle.pgs","l":"PGS_CirclePacking"},{"p":"micycle.pgs","l":"PGS_Coloring"},{"p":"micycle.pgs","l":"PGS_Construction"},{"p":"micycle.pgs","l":"PGS_Contour"},{"p":"micycle.pgs","l":"PGS_Conversion"},{"p":"micycle.pgs","l":"PGS_Hull"},{"p":"micycle.pgs","l":"PGS_Meshing"},{"p":"micycle.pgs","l":"PGS_Morphology"},{"p":"micycle.pgs","l":"PGS_Optimisation"},{"p":"micycle.pgs","l":"PGS_PointSet"},{"p":"micycle.pgs","l":"PGS_Processing"},{"p":"micycle.pgs","l":"PGS_SegmentSet"},{"p":"micycle.pgs","l":"PGS_ShapeBoolean"},{"p":"micycle.pgs","l":"PGS_ShapePredicates"},{"p":"micycle.pgs","l":"PGS_Tiling"},{"p":"micycle.pgs","l":"PGS_Transformation"},{"p":"micycle.pgs","l":"PGS_Triangulation"},{"p":"micycle.pgs","l":"PGS_Voronoi"},{"p":"micycle.pgs.commons","l":"PoissonDistribution"},{"p":"micycle.pgs.commons","l":"PoissonDistributionJRUS"},{"p":"micycle.pgs.commons","l":"PolygonDecomposition"},{"p":"micycle.pgs.commons","l":"RandomPolygon"},{"p":"micycle.pgs.commons","l":"RectangularSubdivision"},{"p":"micycle.pgs.commons","l":"RepulsionCirclePack"},{"p":"micycle.pgs.commons","l":"RLFColoring"},{"p":"micycle.pgs.commons","l":"SeededRandomPointsInGridBuilder"},{"p":"micycle.pgs.commons","l":"ShapeInterpolation"},{"p":"micycle.pgs","l":"PGS_Construction.SierpinskiTriCurveType"},{"p":"micycle.pgs.commons","l":"SpiralQuadrangulation"},{"p":"micycle.pgs.commons","l":"SquareTriangleTiling"},{"p":"micycle.pgs.commons","l":"Star"},{"p":"micycle.pgs.commons","l":"TangencyPack"},{"p":"micycle.pgs.commons","l":"TriangleSubdivision"}] \ No newline at end of file diff --git a/type-search-index.zip b/type-search-index.zip deleted file mode 100644 index 96758e1d837816b64ce9abcedcda16fe33b29ddc..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 774 zcmWIWW@Zs#;Nak3I9e4F%76sKfb5dWf>hn&)Wo9X4BgDUl++5ntm6E=JyBvLX(fx^#+@)LQQ~p?2``r4G-|QMLuq5~CC8t?# zJJhT5Vx;%D%dxK)oP31APB>-0(y6bH@@pVI3x01Da=wu0La(ec_DdF82I|GQDB}M{>fK>^wjHi$t!-uJQ@_U0ruJKfnEG zhEU?`dyIOzS%4cF z>#cTQO`XN_Tn)dkQxDtltPV@K`=MyM;cw&UZ!B?jrRj*UJJ~@@?W1%+RR7UYO@62r* z-1cX-8b+J(Z&zLSA*55LA$LLC?~p%IuU;t3y5q%^@~yXz8OQ(m#UJ3!&hhAuZ&C&m1A_!N14Do}Ba;XNBDEsRfl@0fz@Byk Uyjj^m>KK901xT*}n$5rf05r@{$p8QV