potree-core 1.0.7 → 2.0.0

package/source/utils/HelperUtils.js

@@ -1,55 +0,0 @@
-"use strict";
-
-class HelperUtils
-{
-	/**
-	 * Craete a new data texture with a solid color.
-	 */
-	static generateDataTexture(width, height, color)
-	{
-		var size = width * height;
-		var data = new Uint8Array(4 * width * height);
-
-		var r = Math.floor(color.r * 255);
-		var g = Math.floor(color.g * 255);
-		var b = Math.floor(color.b * 255);
-
-		for(var i = 0; i < size; i++)
-		{
-			data[i * 3] = r;
-			data[i * 3 + 1] = g;
-			data[i * 3 + 2] = b;
-		}
-
-		var texture = new THREE.DataTexture(data, width, height, THREE.RGBAFormat);
-		texture.needsUpdate = true;
-		texture.magFilter = THREE.NearestFilter;
-
-		return texture;
-	};
-
-	/**
-	 * Compute a transformed bouding box from an original box and a transform matrix.
-	 */
-	static computeTransformedBoundingBox(box, transform)
-	{
-		var vertices = [
-			new THREE.Vector3(box.min.x, box.min.y, box.min.z).applyMatrix4(transform),
-			new THREE.Vector3(box.min.x, box.min.y, box.min.z).applyMatrix4(transform),
-			new THREE.Vector3(box.max.x, box.min.y, box.min.z).applyMatrix4(transform),
-			new THREE.Vector3(box.min.x, box.max.y, box.min.z).applyMatrix4(transform),
-			new THREE.Vector3(box.min.x, box.min.y, box.max.z).applyMatrix4(transform),
-			new THREE.Vector3(box.min.x, box.max.y, box.max.z).applyMatrix4(transform),
-			new THREE.Vector3(box.max.x, box.max.y, box.min.z).applyMatrix4(transform),
-			new THREE.Vector3(box.max.x, box.min.y, box.max.z).applyMatrix4(transform),
-			new THREE.Vector3(box.max.x, box.max.y, box.max.z).applyMatrix4(transform)
-		];
-
-		var boundingBox = new THREE.Box3();
-		boundingBox.setFromPoints(vertices);
-		
-		return boundingBox;
-	};
-};
-
-export {HelperUtils};

package/source/utils/LRU.js

@@ -1,210 +0,0 @@
-"use strict";
-
-import {Global} from "../Global.js";
-
-class LRUItem
-{
-	constructor(node)
-	{
-		this.previous = null;
-		this.next = null;
-		this.node = node;
-	}
-}
-
-/**
- * @class A doubly-linked-list of the least recently used elements.
- */
-class LRU
-{
-	constructor()
-	{
-		// the least recently used item
-		this.first = null;
-		// the most recently used item
-		this.last = null;
-		// a list of all items in the lru list
-		this.items = {};
-		this.elements = 0;
-		this.numPoints = 0;
-	}
-
-	size()
-	{
-		return this.elements;
-	}
-
-	contains(node)
-	{
-		return this.items[node.id] == null;
-	}
-
-	touch(node)
-	{
-		if(!node.loaded)
-		{
-			return;
-		}
-
-		var item;
-
-		if(this.items[node.id] == null)
-		{
-			// add to list
-			item = new LRUItem(node);
-			item.previous = this.last;
-			this.last = item;
-			if(item.previous !== null)
-			{
-				item.previous.next = item;
-			}
-
-			this.items[node.id] = item;
-			this.elements++;
-
-			if(this.first === null)
-			{
-				this.first = item;
-			}
-			this.numPoints += node.numPoints;
-		}
-		else
-		{
-			// update in list
-			item = this.items[node.id];
-
-			if(item.previous === null)
-			{
-				// handle touch on first element
-				if(item.next !== null)
-				{
-					this.first = item.next;
-					this.first.previous = null;
-					item.previous = this.last;
-					item.next = null;
-					this.last = item;
-					item.previous.next = item;
-				}
-			}
-			else if(item.next !== null)
-			{
-				// handle touch on any other element
-				item.previous.next = item.next;
-				item.next.previous = item.previous;
-				item.previous = this.last;
-				item.next = null;
-				this.last = item;
-				item.previous.next = item;
-			}
-		}
-	}
-
-	remove(node)
-	{
-		var lruItem = this.items[node.id];
-		if(lruItem)
-		{
-			if(this.elements === 1)
-			{
-				this.first = null;
-				this.last = null;
-			}
-			else
-			{
-				if(!lruItem.previous)
-				{
-					this.first = lruItem.next;
-					this.first.previous = null;
-				}
-				if(!lruItem.next)
-				{
-					this.last = lruItem.previous;
-					this.last.next = null;
-				}
-				if(lruItem.previous && lruItem.next)
-				{
-					lruItem.previous.next = lruItem.next;
-					lruItem.next.previous = lruItem.previous;
-				}
-			}
-
-			delete this.items[node.id];
-			this.elements--;
-			this.numPoints -= node.numPoints;
-		}
-	}
-
-	getLRUItem()
-	{
-		if(this.first === null)
-		{
-			return null;
-		}
-		var lru = this.first;
-
-		return lru.node;
-	}
-
-	toString()
-	{
-		var string = "{ ";
-		var curr = this.first;
-
-		while (curr !== null)
-		{
-			string += curr.node.id;
-			if(curr.next !== null)
-			{
-				string += ", ";
-			}
-			curr = curr.next;
-		}
-
-		string += "}";
-		string += "(" + this.size() + ")";
-		return string;
-	}
-
-	freeMemory()
-	{
-		if(this.elements <= 1)
-		{
-			return;
-		}
-
-		while(this.numPoints > Global.pointLoadLimit)
-		{
-			var element = this.first;
-			var node = element.node;
-			this.disposeDescendants(node);
-		}
-	}
-
-	disposeDescendants(node)
-	{
-		var stack = [];
-		stack.push(node);
-
-		while (stack.length > 0)
-		{
-			var current = stack.pop();
-
-			current.dispose();
-			this.remove(current);
-
-			for(var key in current.children)
-			{
-				if(current.children.hasOwnProperty(key))
-				{
-					var child = current.children[key];
-					if(child.loaded)
-					{
-						stack.push(current.children[key]);
-					}
-				}
-			}
-		}
-	}
-}
-
-export {LRU, LRUItem};

package/source/utils/VersionUtils.js

@@ -1,45 +0,0 @@
-"use strict";
-
-function VersionUtils(version)
-{
-	this.version = version;
-	var vmLength = (version.indexOf(".") === -1) ? version.length : version.indexOf(".");
-	this.versionMajor = parseInt(version.substr(0, vmLength));
-	this.versionMinor = parseInt(version.substr(vmLength + 1));
-	
-	if(this.versionMinor.length === 0)
-	{
-		this.versionMinor = 0;
-	}
-};
-
-VersionUtils.prototype.newerThan = function(version)
-{
-	var v = new VersionUtils(version);
-
-	if((this.versionMajor > v.versionMajor) || (this.versionMajor === v.versionMajor && this.versionMinor > v.versionMinor))
-	{
-		return true;
-	}
-	
-	return false;
-};
-
-VersionUtils.prototype.equalOrHigher = function(version)
-{
-	var v = new VersionUtils(version);
-
-	if((this.versionMajor > v.versionMajor) || (this.versionMajor === v.versionMajor && this.versionMinor >= v.versionMinor))
-	{
-		return true;
-	}
-
-	return false;
-};
-
-VersionUtils.prototype.upTo = function(version)
-{
-	return !this.newerThan(version);
-};
-
-export {VersionUtils};

package/source/utils/WorkerManager.js

@@ -1,85 +0,0 @@
-"use strict";
-
-import {Global} from "../Global.js";
-
-/**
- * The worker manager is responsible for creating and managing worker instances.
- */
-class WorkerManager
-{
-	constructor()
-	{
-		this.workers = [];
-
-		for(var i = 0; i < WorkerManager.URLS.length; i++)
-		{
-			this.workers.push([]);
-		}
-	}
-
-	/**
-	 * Get a worker from the pool, if none available one will be created.
-	 */
-	getWorker(type)
-	{
-		if(this.workers[type].length > 0)
-		{
-			return this.workers[type].pop();
-		}
-		
-		return new Worker(Global.workerPath + WorkerManager.URLS[type]);
-	}
-
-	/**
-	 * Return (reinsert) the worker into the pool.
-	 */
-	returnWorker(type, worker)
-	{
-		this.workers[type].push(worker);
-	}
-
-	/**
-	 * Run a task immediatly.
-	 */
-	runTask(type, onMessage, message, transfer)
-	{
-		var self = this;
-
-		var worker = this.getWorker(type);
-		worker.onmessage = function(event)
-		{
-			onMessage(event);
-			self.returnWorker(type, worker);
-		};
-
-		if(transfer !== undefined)
-		{
-			worker.postMessage(message, transfer);
-		}
-		else
-		{
-			worker.postMessage(message);
-		}
-	}
-};
-
-WorkerManager.BINARY_DECODER = 0;
-WorkerManager.LAS_LAZ = 1;
-WorkerManager.LAS_DECODER = 2;
-WorkerManager.GREYHOUND = 3;
-WorkerManager.DEM = 4;
-WorkerManager.EPT_LAS_ZIP_DECODER = 5;
-WorkerManager.EPT_BINARY_DECODER = 6;
-
-WorkerManager.URLS = 
-[
-	"/workers/BinaryDecoderWorker.js",
-	"/workers/LASLAZWorker.js",
-	"/workers/LASDecoderWorker.js",
-	"/workers/GreyhoundBinaryDecoderWorker.js",
-	"/workers/DEMWorker.js",
-	"/workers/EptLaszipDecoderWorker.js",
-	"/workers/EptBinaryDecoderWorker.js"
-];
-
-export {WorkerManager};