plotboilerplate 1.12.9 → 1.15.0

package/src/ts/utils/findInVertexArray.ts

@@ -0,0 +1,28 @@
+/**
+ * @author  Ikaros Kappler
+ * @date    2022-01-10
+ * @version 1.0.0
+ */
+
+import { Vertex } from "../Vertex";
+import { XYCoords } from "../interfaces";
+
+/**
+ * In an array of vertices find the first occurence of a specific vertex, using
+ * and epsilon tolerance.
+ *
+ * @param {Array<Vertex>} vertexList - The vertex array to search in.
+ * @param {XYCoords} vertex - A vertex/position to search for. This can be any x-y-tuple and does not
+ *                              necessarily need to be an instance of Vertex.
+ * @param {number} epsilon - The epsilon tolerance to use (should be >= 0). This is a required param to avoid excessive
+ *                              is-undef checking if this function runs in a loop.
+ * @returns {boolean} - The first index of a vertex that matched or -1 if no such vertex could be found.
+ */
+export const findInVertexArray = (vertexList: Array<Vertex>, vertex: XYCoords, epsilon: number): number => {
+  for (var i = 0; i < vertexList.length; i++) {
+    if (vertexList[i].distance(vertex) < epsilon) {
+      return i;
+    }
+  }
+  return -1;
+};

package/dist/plotboilerplate.browser.min.js.LICENSE.txt

@@ -1,8 +0,0 @@
-/**
- * index.es6 v0.1.17
- * super tiny size multi-touch gestures library for the web. Cloned from alloyfinger
- *
- * @author dntzhang
- * @license MIT
- * @preserve
- */

package/src/ts/utils/algorithms/clearPolygonDuplicateVertices.ts~

@@ -1,5 +0,0 @@
-/**
- *
- */
-
-const polygonClearDuplicateVertices

package/src/ts/utils/algorithms/findPolygonSelfIntersections.ts~

@@ -1,45 +0,0 @@
-/**
- * @requires Line
- * @requires Vertex
- *
- * @author Ikaros Kappler
- * @date   2020-12-04
- */
-
-
-/**
- * Collect all self-intersection points of the given polygon.
- *
- * @name findPolygonSelfIntersections
- * @param {Array<Vertex>} polygon
- * @return Array<Vertex>
- */
-var findPolygonSelfIntersections = function( polygon ) {
-    var pointList = [];
-    var lineA = new Line( new Vertex(), new Vertex() );
-    var lineB = new Line( new Vertex(), new Vertex() );
-    for( var a = 0; a < polygon.vertices.length; a++ ) {
-	lineA.a.set( polygon.getVertexAt(a) );
-	lineA.b.set( polygon.getVertexAt(a+1) );
-	for( var b = 0; b < polygon.vertices.length; b++ ) {
-	    // Same edge or neighbour edges intersect by definition.
-	    // Skip them.
-	    if( a == b || a+1 == b || a == b+1
-		|| (a==0&&b+1==polygon.vertices.length) || (b==0&&a+1==polygon.vertices.length) )
-		continue;
-	    lineB.a.set( polygon.getVertexAt(b) );
-	    lineB.b.set( polygon.getVertexAt(b+1) );
-
-	    // Commpute the intersection point of the (infinite) lines.
-	    // The point is undefined if and only if both line are parallel (co-linear).
-	    const intersectionPoint = lineA.intersection(lineB);
-
-	    // Check if the intersection point is on both (finite) edges of the polygon.
-	    if( intersectionPoint
-		&& lineA.hasPoint(intersectionPoint) && lineB.hasPoint(intersectionPoint) ) {
-		pointList.push( intersectionPoint );
-	    }
-	}	
-    }
-    return pointList;
-};

package/src/ts/utils/algorithms/sh-tmp.ts~

@@ -1,59 +0,0 @@
-
-interface XYCoords  {
-    x : number;
-    y : number;
-}
-
-const inside = ( cp1 : XYCoords, cp2 : XYCoords, p : XYCoords) : boolean => {
-    return (cp2.x-cp1.x)*(p.y-cp1.y) > (cp2.y-cp1.y)*(p.x-cp1.x);
-};
-
-const intersection = ( cp1 : XYCoords ,cp2 : XYCoords ,s : XYCoords, e : XYCoords ) : XYCoords => {
-    const dc = {
-	x:  cp1.x - cp2.x,
-	y : cp1.y - cp2.y
-	 },
-    dp = { x: s.x - e.x,
-	   y : s.y - e.y
-	 },
-    n1 = cp1.x * cp2.y - cp1.y * cp2.x,
-    n2 = s.x * e.y - s.y * e.x, 
-    n3 = 1.0 / (dc.x * dp.y - dc.y * dp.x);
-    return { x : (n1*dp.x - n2*dc.x) * n3,
-	     y : (n1*dp.y - n2*dc.y) * n3
-	   };
-};
-
-export const sutherlandHodgman = ( subjectPolygon : Array<XYCoords>,
-				   clipPolygon : Array<XYCoords> ) : Array<XYCoords> => {
-    
-    let cp1 : XYCoords = clipPolygon[clipPolygon.length-1];
-    let cp2 : XYCoords;
-    let s : XYCoords;
-    let e : XYCoords;
-    
-    let outputList : Array<XYCoords> = subjectPolygon;
-    
-    for( var j in clipPolygon ) {
-        cp2 = clipPolygon[j];
-        var inputList = outputList;
-        outputList = [];
-        s = inputList[inputList.length - 1]; // last on the input list
-        for (var i in inputList) {
-	    e = inputList[i];
-	    if (inside(cp1,cp2,e)) {
-                if (!inside(cp1,cp2,s)) {
-		    outputList.push(intersection(cp1,cp2,s,e));
-                }
-                outputList.push(e);
-	    }
-	    else if (inside(cp1,cp2,s)) {
-                outputList.push(intersection(cp1,cp2,s,e));
-	    }
-	    s = e;
-        }
-        cp1 = cp2;
-    }
-    return outputList
-}
-

package/src/ts/utils/algorithms/splitPolygonToNonIntersecting.ts~

@@ -1,113 +0,0 @@
-/**
- * This function cuts a given self-intersecting polygon into non-self-intersecting 
- * sub polygons.
- *
- * The algorithm only works for non-self-overlapping polygons.
- * Please note that the union set of the sub polygons themselves will _not_ be disjunct if
- * the input polyon overlaps with itself!
- *
- *
- * @requires Line
- * @requires Vertex
- * @requires greinerHormann
- * 
- * @date 2020-12-04
- */
-
-(function(_context) {
-
-    /**
-     * @param {Array<Vertex>} vertices
-     * @param {number=10} maxDepth
-     */  
-    var splitToNonIntersectingPolygons = function( vertices, maxDepth ) {
-	if( typeof maxDepth === "undefined" )
-	    maxDepth = 10;
-	return _splitToNonIntersectingPolygons( vertices, maxDepth );
-    };
-
-    
-    var _splitToNonIntersectingPolygons = function( vertices, maxDepth ) {
-
-	if( maxDepth <= 0 ) {
-	    console.log('aborting at max depth');
-	    return [ vertices ];
-	}
-
-	if( vertices.length <= 3 ) {
-	    // No intersections possible
-	    return [ vertices ];
-	}
-
-	// var pointList = [];
-	var n = vertices.length;
-	var lineA = new Line( new Vertex(), new Vertex() );
-	var lineB = new Line( new Vertex(), new Vertex() );
-	for( var a = 0; a < vertices.length; a++ ) {
-	    lineA.a.set( vertices[a] );
-	    lineA.b.set( vertices[(a+1) % n] );
-	    for( var b = 0; b < vertices.length; b++ ) {
-		// Equal or neighbour edges intersect by definition.
-		// We ignore them.
-		if( a == b || a+1 == b || a == b+1 || (a==0&&b+1==vertices.length) || (b==0&&a+1==vertices.length) )
-		    continue;
-		lineB.a.set( vertices[b] );
-		lineB.b.set( vertices[(b+1) % n] );
-
-		const intersectionPoint = lineA.intersection(lineB);
-		// console.log( 'intersectionPoint', intersectionPoint );
-		if( intersectionPoint && lineA.hasPoint(intersectionPoint) && lineB.hasPoint(intersectionPoint) ) {
-		    // console.log( 'intersection found' );
-		    // pointList.push( intersectionPoint );
-		    // Cut polygon into two here
-		    var split = splitPolygonAt( vertices, a, b, intersectionPoint );
-		    
-		    // Split has 2 elements.
-		    var leftCleaned = _splitToNonIntersectingPolygons( split[0], maxDepth-1 );
-		    var rightCleaned =  _splitToNonIntersectingPolygons( split[1], maxDepth-1 );
-
-		    return leftCleaned.concat( rightCleaned );
-		}
-	    }	
-	}
-	// console.log( 'intersectionPoints', pointList );
-
-	// No intersection found:
-	//    just return a list with the original
-	//    polygon as its only element.
-	return [ vertices ];
-    };
-
-
-    // Pre: edgeIndexA < edgeIndexB && vertices.length >= 4
-    var splitPolygonAt = function( vertices, edgeIndexA, edgeIndexB, intersectionPoint ) {
-
-	// console.log( 'split', edgeIndexA, edgeIndexB );
-	
-	var first = [];
-	var second = [];
-	for( var i = 0; i < vertices.length; i++ ) {
-	    if( i <= edgeIndexA )
-		first.push( vertices[i] );
-
-	    if( i == edgeIndexA )  {
-		first.push( intersectionPoint );
-		second.push( intersectionPoint ); // clone???
-	    }
-
-	    if( i > edgeIndexA && i <= edgeIndexB )
-		second.push( vertices[i] );
-
-	    if( i > edgeIndexB )
-		first.push( vertices[i] );
-	    
-	}
-
-	// console.log( 'split', first, second );
-
-	return [ first, second ];
-    };
-
-    _context.splitToNonIntersectingPolygons = splitToNonIntersectingPolygons;
-
-})(globalThis || window);

package/src/ts/utils/algorithms/sutherlandHodgman.ts~

@@ -1,88 +0,0 @@
-"use strict";
-
-/**
- * The Sutherland-Hodgman convex polygon clipping algorithm.
- *
- * Converted to Vertex variant {x:number,y:number} by Ikaros Kappler.
- *
- * @date    2021-01-29
- * @version 1.0.0
- *
- * Original version:
- *    https://rosettacode.org/wiki/Sutherland-Hodgman_polygon_clipping#JavaScript
- */
-
-
-
-(function() {
-
-
-    /**
-     * @param {Vertex}
-     * @param {Vertex}
-     **/
-    var inside = function (_cp1,_cp2,p) {
-	// console.log('x', _cp1);
-        return (_cp2.x-_cp1.x)*(p.y-_cp1.y) > (_cp2.y-_cp1.y)*(p.x-_cp1.x);
-    };
-
-    /**
-     * @param {Vertex}
-     * @param {Vertex}
-     * @param {Vertex}
-     * @param {Vertex}
-     */
-    var intersection = function (_cp1,_cp2,_s,_e) {
-        var
-	dc = { x:  _cp1.x - _cp2.x,
-	       y : _cp1.y - _cp2.y
-	     },
-	dp = { x: _s.x - _e.x,
-	       y : _s.y - _e.y
-	     },
-        n1 = _cp1.x * _cp2.y - _cp1.y * _cp2.x,
-        n2 = _s.x * _e.y - _s.y * _e.x, 
-        n3 = 1.0 / (dc.x * dp.y - dc.y * dp.x);
-        return { x : (n1*dp.x - n2*dc.x) * n3,
-		 y : (n1*dp.y - n2*dc.y) * n3
-	       };
-    };
-    
-
-    /**
-     * @param {Array<Vertex>} subjectPolygon
-     * @param {Array<Vertex>} clipPolygon - Must be convex.
-     */
-    var sutherlandHodgman = function(subjectPolygon, clipPolygon) {
-	
-	var cp1, cp2, s, e;
-	
-	var outputList = subjectPolygon;
-	cp1 = clipPolygon[clipPolygon.length-1];
-	
-	for (var j in clipPolygon) {
-            var cp2 = clipPolygon[j];
-            var inputList = outputList;
-            outputList = [];
-            s = inputList[inputList.length - 1]; // last on the input list
-            for (var i in inputList) {
-		var e = inputList[i];
-		if (inside(cp1,cp2,e)) {
-                    if (!inside(cp1,cp2,s)) {
-			outputList.push(intersection(cp1,cp2,s,e));
-                    }
-                    outputList.push(e);
-		}
-		else if (inside(cp1,cp2,s)) {
-                    outputList.push(intersection(cp1,cp2,s,e));
-		}
-		s = e;
-            }
-            cp1 = cp2;
-	}
-	return outputList
-    }
-
-    globalThis.sutherlandHodgman = sutherlandHodgman;
-
-})();

package/src/ts/utils/datastructures/Color.ts~

@@ -1,331 +0,0 @@
-// Found at
-//    https://gist.github.com/neolitec/1344610
-// Thanks to neolitec
-//
-// @modified 2018-xx-xx Added a clone() function.
-// @modified 2018-xx-xx Allowing leading '#' in the makeHEX() function.
-// @modified 2018-11-28 Fixed the checkHEX() function to accept 000000.
-// @modified 2019-11-18 Added a generic parse(string) function that detects the format.
-// @modified 2020-01-09 Fixed a bug in the parse(string) function. Hex colors with only three elements were considered faulty.
-// @modified 2020-10-23 TS
-
-
-export class Color {
-
-    r : number;
-    g : number;
-    b : number;
-
-    h : number;
-    s : number;
-    l : number;
-
-    a : number;
-    
-    constructor() {
-	this.r = this.g = this.b = 0;
-	this.h = this.s = this.l = 0;
-	this.a = 1;
-};
-/** RGB */
-Color.prototype.cssRGB = function() {
-    return "rgb("+Math.round(255*this.r)+","+Math.round(255*this.g)+","+Math.round(255*this.b)+")";
-};
-Color.prototype.cssRGBA = function() {
-    return "rgba("+Math.round(255*this.r)+","+Math.round(255*this.g)+","+Math.round(255*this.b)+","+this.a+")";
-};
-Color.prototype.red = function() { return this.r; };
-Color.prototype.green = function() { return this.g; };
-Color.prototype.blue = function() { return this.b; };
-/** HSL */
-Color.prototype.cssHSL = function() {
-    return "hsl("+Math.round(360*this.h)+","+Math.round(100*this.s)+"%,"+Math.round(100*this.l)+"%)";
-};
-Color.prototype.cssHSLA = function() {
-    return "hsla("+Math.round(360*this.h)+","+Math.round(100*this.s)+"%,"+Math.round(100*this.l)+"%,"+Math.round(this.a)+")";
-};
-Color.prototype.hue = function() { return this.h; };
-Color.prototype.saturation = function() { return this.s; };
-Color.prototype.lightness = function() { return this.l; };
-/** HEX */
-Color.prototype.cssHEX = function() {
-    return "#" + 
-        (255*this.r < 16 ? "0" : "") + Math.round(255*this.r).toString(16) +
-        (255*this.g < 16 ? "0" : "") + Math.round(255*this.g).toString(16) + 
-        (255*this.b < 16 ? "0" : "") + Math.round(255*this.b).toString(16);
-}
-/** Transparency */
-Color.prototype.alpha = function() { return this.a; };
-/** Modifiers */
-Color.prototype.saturate = function(v) {
-    if("string" == typeof v && v.indexOf("%") > -1 && (v = parseInt(v)) != 'NaN')
-        this.s += v/100;
-    else if("number" == typeof v) // range 255 
-        this.s += v/255;
-    else throw new Error("error: bad modifier format (percent or number)");
-    if(this.s > 1) this.s = 1; else if(this.s < 0) this.s = 0;
-    Color.Convertor.HSLToRGB.apply(this);
-};
-Color.prototype.desaturate = function(v) {
-    this.saturate("-" + v);
-};
-Color.prototype.lighten = function(v) {
-    if("string" == typeof v && v.indexOf("%") > -1 && (v = parseInt(v)) != 'NaN')
-        this.l += v/100;
-    else if("number" == typeof v) // range 255 
-        this.l += v/255;
-    else throw new Error("error: bad modifier format (percent or number)");
-    if(this.l > 1) this.l = 1; else if(this.l < 0) this.l = 0;
-    Color.Convertor.HSLToRGB.apply(this);
-};
-Color.prototype.darken = function(v) {
-    this.ligthen("-" + v);
-};
-Color.prototype.fadein = function(v) {
-    if("string" == typeof v && v.indexOf("%") > -1 && (v = parseInt(v)) != 'NaN')
-        this.a += v/100;
-    else if("number" == typeof v) // range 255 
-        this.a += v/255;
-    else throw new Error("error: bad modifier format (percent or number)");
-    if(this.a > 1) this.a = 1; else if(this.a < 0) this.a = 0;
-    Color.Convertor.HSLToRGB.apply(this);
-};
-Color.prototype.fadeout = function(v) {
-    this.fadein("-" + v);
-};
-Color.prototype.spin = function(v) {
-    if("string" == typeof v && v.indexOf("%") > -1 && (v = parseInt(v)) != 'NaN')
-        this.h += v/100;
-    else if("number" == typeof v) // range 360 
-        this.h += v/360;
-    else throw new Error("error: bad modifier format (percent or number)");
-    if(this.h > 1) this.h = 1; else if(this.h < 0) this.h = 0;
-    Color.Convertor.HSLToRGB.apply(this);
-};
-/** Debug */
-Color.prototype.toString = function() {
-    return "<span style=\"color: "+this.cssRGB()+"\">"+this.cssRGB()+"</span> / <span style=\"color: "+this.cssHSL()+"\">"+this.cssHSL()+"</span> / <span style=\"color: "+this.cssHEX()+"\">"+this.cssHEX()+"</span> / alpha: "+this.a+"";
-};
-
-Color.makeRGB = function() {
-    var c = new Color(),
-        sanitized;
-    if(arguments.length < 3 || arguments.length > 4)
-        throw new Error("error: 3 or 4 arguments");
-    sanitized = Color.Sanitizer.RGB(arguments[0], arguments[1], arguments[2]);
-    c.r = sanitized[0];
-    c.g = sanitized[1];
-    c.b = sanitized[2];
-    if(arguments.length == 4) c.a = arguments[3];
-    Color.Convertor.RGBToHSL.apply(c);
-    return c;
-};
-
-Color.makeHSL = function() {
-    var c = new Color(),
-        sanitized;
-    if(arguments.length < 3 || arguments.length > 4)
-        throw new Error("error: 3 or 4 arguments");
-    sanitized = Color.Sanitizer.HSL(arguments[0], arguments[1], arguments[2]);
-    c.h = sanitized[0];
-    c.s = sanitized[1];
-    c.l = sanitized[2];
-    if(arguments.length == 4) c.a = arguments[3];
-    Color.Convertor.HSLToRGB.apply(c);
-    return c;
-};
-
-Color.makeHEX = function(value) {
-    var c = new Color(),
-        sanitized;
-    // Edit Ika 2018-0308
-    // Allow leading '#'
-    if( value && value.startsWith('#') )
-	value = value.substr(1);
-    Color.Validator.checkHEX(value);
-    if(value.length == 3) {
-        sanitized = Color.Sanitizer.RGB(
-            parseInt(value.substr(0, 1) + value.substr(0, 1), 16),
-            parseInt(value.substr(1, 1) + value.substr(1, 1), 16),
-            parseInt(value.substr(2, 1) + value.substr(2, 1), 16)
-        );
-    } else if(value.length == 6) {
-        sanitized = Color.Sanitizer.RGB(
-            parseInt(value.substr(0, 2), 16),
-            parseInt(value.substr(2, 2), 16),
-            parseInt(value.substr(4, 2), 16)
-        );
-    } else throw new Error("error: 3 or 6 arguments");
-    c.r = sanitized[0];
-    c.g = sanitized[1];
-    c.b = sanitized[2];
-    Color.Convertor.RGBToHSL.apply(c);
-    return c;
-};
-
-Color.parse = function( str ) {
-    if( typeof str == 'undefined' )
-	return null;
-    if( (str = str.trim().toLowerCase()).length == 0 )
-	return null;
-    if( str.startsWith('#') ) 
-	return Color.makeHEX(str.substring(1,str.length));
-    if( str.startsWith('rgb') ) {
-	var open = str.indexOf('(');
-	var close = str.indexOf(')');
-
-	var parts = /^rgba?\((\d+),\s*(\d+),\s*(\d+)(?:,\s*(0\.\d+))?\)$/.exec(str);
-	// [ str, r, g, b, a|undefined ]
-	if( typeof parts[4] == 'undefined' )
-	    return Color.makeRGB(parts[1],parts[2],parts[3]);
-	else
-	    return Color.makeRGB(parts[1],parts[2],parts[3],parts[4]);
-    }
-    else
-	throw "Unrecognized color format: " + str;
-};
-
-// Test parser
-// Color.parse('rgba(28,192,255,0.5)');
-// Color.parse('rgb(28,192,255)');
-// Color.parse('Xrgb(28,192,255)'); // Should throw exception
-
-Color.Sanitizer = {
-    RGB: function() {
-        var o = [];
-        if(arguments.length == 0) return;
-        for(var i = 0 ; i < arguments.length ; i++) {
-            var c = arguments[i];
-            if("string" == typeof c && c.indexOf("%") > -1) {
-                if((c = parseInt(c)) == 'NaN')
-                    throw new Error("Bad format");
-                if(c < 0 || c > 100)
-                    throw new Error("Bad format");
-                o[i] = c/100;
-            } else {
-                if("string" == typeof c && (c = parseInt(c)) == 'NaN') throw new Error("Bad format");
-                if(c < 0) throw new Error("Bad format");
-                else if(c >= 0 && c < 1) o[i] = c;
-                else if(c >= 1 && c < 256) o[i] = c/255;
-                else throw new Error("Bad format ("+c+")");
-            }
-        }
-        return o;
-    },
-    HSL: function() {
-        if(arguments.length < 3 || arguments.length > 4) throw new Error("3 or 4 arguments required");
-        var h = arguments[0],
-            s = arguments[1],
-            l = arguments[2];
-        if("string" == typeof h && (h = parseFloat(h)) == 'NaN') throw new Error("Bad format for hue");
-        if(h < 0 || h > 360) throw new Error("Hue out of range (0..360)");
-        else if(((""+h).indexOf(".") > -1 && h > 1) || (""+h).indexOf(".") == -1) h /= 360;
-        if("string" == typeof s && s.indexOf("%") > -1) {
-            if((s = parseInt(s)) == 'NaN')
-                throw new Error("Bad format for saturation");
-            if(s < 0 || s > 100)
-                throw new Error("Bad format for saturation");
-            s /= 100;
-        } else if(s < 0 || s > 1) throw new Error("Bad format for saturation");
-        if("string" == typeof l && l.indexOf("%") > -1) {
-            if((l = parseInt(l)) == 'NaN')
-                throw new Error("Bad format for lightness");
-            if(l < 0 || l > 100)
-                throw new Error("Bad format for lightness");
-            l /= 100;
-        } else if(l < 0 || l > 1) throw new Error("Bad format for lightness");
-        return [h, s, l];
-    },
-};
-
-Color.Validator = {
-
-    /**
-     * Check a hexa color (without #)
-     */
-    checkHEX: function(value) {
-
-        if(value.length != 6 && value.length != 3)
-            throw new Error("Hexa color: bad length ("+value.length+")," + value);
-        value = value.toLowerCase();
-        for(i in value) {
-            var c = value.charCodeAt(i);
-            if( !((c>=48 && c<=57) || (c>=97 && c<=102)) )
-                throw new Error("Hexa color: out of range for " + value + " at position " + i);
-        }
-    }
-};
-
-Color.Convertor = {
-
-    /**
-     * Calculates HSL Color
-     * RGB must be normalized
-     * Must be executed in a Color object context
-     * http://mjijackson.com/2008/02/rgb-to-hsl-and-rgb-to-hsv-color-model-conversion-algorithms-in-javascript 
-     */
-    RGBToHSL: function() {
-        //     
-        var r = this.r,
-            g = this.g,
-            b = this.b,
-            max = Math.max(r, g, b), min = Math.min(r, g, b);        
-        this.l = (max + min) / 2;    
-        if(max == min){
-            this.h = this.s = 0; // achromatic
-        } else {
-            var d = max - min;
-            this.s = this.l > 0.5 ? d / (2 - max - min) : d / (max + min);
-            switch(max){
-                case r: this.h = (g - b) / d + (g < b ? 6 : 0); break;
-                case g: this.h = (b - r) / d + 2; break;
-                case b: this.h = (r - g) / d + 4; break;
-            }
-            this.h /= 6;
-        }
-    },
-
-    /**
-     * Calculates RGB color (nomalized)
-     * HSL must be normalized
-     * Must be executed in a Color object context
-     * http://mjijackson.com/2008/02/rgb-to-hsl-and-rgb-to-hsv-color-model-conversion-algorithms-in-javascript
-     */
-    HSLToRGB: function() {
-        var h = this.h,
-            s = this.s,
-            l = this.l,
-            hue2rgb = function(p, q, t){
-                if(t < 0) t += 1;
-                if(t > 1) t -= 1;
-                if(t < 1/6) return p + (q - p) * 6 * t;
-                if(t < 1/2) return q;
-                if(t < 2/3) return p + (q - p) * (2/3 - t) * 6;
-                return p;
-            };
-        if(s == 0) {
-            this.r = this.g = this.b = l; // achromatic
-        } else {
-            var q = l < 0.5 ? l * (1 + s) : l + s - l * s;
-            var p = 2 * l - q;
-            this.r = hue2rgb(p, q, h + 1/3);
-            this.g = hue2rgb(p, q, h);
-            this.b = hue2rgb(p, q, h - 1/3);
-        }
-    }
-    
-};
-
-
-// Added by Ika 2017-0-19
-Color.prototype.clone = function() {
-    return Color.makeRGB(this.r, this.g, this.b, this.a);
-};
-// Added by Ika 2018-12-30
-Color.prototype.interpolate = function( c, t ) {
-    this.r += (c.r-c.r)*t;
-    this.g += (c.g-c.g)*t;
-    this.b += (c.b-c.b)*t;
-    this.a += (c.a-c.a)*t;
-    return this;
-};