mozilla
/
pluotsorbet
зеркало из https://github.com/mozilla/pluotsorbet.git
1
0
Форкнуть 0
Код Задачи Пакеты Проекты Релизы Вики Активность
pluotsorbet/utilities.ts

3519 строки
97 KiB
TypeScript
Исходник Ответственный История

/*
* Copyright 2014 Mozilla Foundation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
var jsGlobal = (function() { return this || (1, eval)('this'); })();
var inBrowser = typeof console != "undefined";
declare var putstr;
declare var printErr;
// declare var print;
// declare var console;
// declare var performance;
// declare var XMLHttpRequest;
// declare var document;
// declare var getComputedStyle;
/** @const */ var release: boolean = false;
/** @const */ var profile: boolean = false;
declare var dateNow: () => number;
declare var dump: (message: string) => void;
if (!jsGlobal.performance) {
jsGlobal.performance = {};
}
if (!jsGlobal.performance.now) {
jsGlobal.performance.now = typeof dateNow !== 'undefined' ? dateNow : Date.now;
}
function log(message?: any, ...optionalParams: any[]): void {
if (inBrowser) {
console.log.apply(console, arguments);
} else {
jsGlobal.print.apply(jsGlobal, arguments);
}
}
function warn(message?: any, ...optionalParams: any[]): void {
if (inBrowser) {
console.warn.apply(console, arguments);
} else {
jsGlobal.print(J2ME.IndentingWriter.RED + message + J2ME.IndentingWriter.ENDC);
}
}
interface String {
padRight(c: string, n: number): string;
padLeft(c: string, n: number): string;
endsWith(s: string): boolean;
}
interface Function {
boundTo: boolean;
}
interface Array<T> {
runtimeId: number;
}
interface Math {
imul(a: number, b: number): number;
/**
* Returns the number of leading zeros of a number.
* @param x A numeric expression.
*/
clz32(x: number): number;
}
interface Error {
stack: string;
}
interface Uint8ClampedArray extends ArrayBufferView {
BYTES_PER_ELEMENT: number;
length: number;
[index: number]: number;
get(index: number): number;
set(index: number, value: number): void;
set(array: Uint8Array, offset?: number): void;
set(array: number[], offset?: number): void;
subarray(begin: number, end?: number): Uint8ClampedArray;
}
declare var Uint8ClampedArray: {
prototype: Uint8ClampedArray;
new (length: number): Uint8ClampedArray;
new (array: Uint8Array): Uint8ClampedArray;
new (array: number[]): Uint8ClampedArray;
new (buffer: ArrayBuffer, byteOffset?: number, length?: number): Uint8ClampedArray;
BYTES_PER_ELEMENT: number;
}
module J2ME {
export function isIdentifierStart(c) {
return (c === '$') || (c === '_') || (c === '\\') || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z');
}
export function isIdentifierPart(c) {
return (c === '$') || (c === '_') || (c === '\\') || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || ((c >= '0') && (c <= '9'));
}
export enum CharacterCodes {
_0 = 48,
_1 = 49,
_2 = 50,
_3 = 51,
_4 = 52,
_5 = 53,
_6 = 54,
_7 = 55,
_8 = 56,
_9 = 57
}
/**
* The buffer length required to contain any unsigned 32-bit integer.
*/
/** @const */ export var UINT32_CHAR_BUFFER_LENGTH = 10; // "4294967295".length;
/** @const */ export var UINT32_MAX = 0xFFFFFFFF;
/** @const */ export var UINT32_MAX_DIV_10 = 0x19999999; // UINT32_MAX / 10;
/** @const */ export var UINT32_MAX_MOD_10 = 0x5; // UINT32_MAX % 10
export function isString(value): boolean {
return typeof value === "string";
}
export function isFunction(value): boolean {
return typeof value === "function";
}
export function isNumber(value): boolean {
return typeof value === "number";
}
export function isInteger(value): boolean {
return (value | 0) === value;
}
export function isArray(value): boolean {
return value instanceof Array;
}
export function isNumberOrString(value): boolean {
return typeof value === "number" || typeof value === "string";
}
export function isObject(value): boolean {
return typeof value === "object" || typeof value === 'function';
}
export function toNumber(x): number {
return +x;
}
export function isNumericString(value: string): boolean {
// ECMAScript 5.1 - 9.8.1 Note 1, this expression is true for all
// numbers x other than -0.
return String(Number(value)) === value;
}
/**
* Whether the specified |value| is a number or the string representation of a number.
*/
export function isNumeric(value: any): boolean {
if (typeof value === "number") {
return true;
}
if (typeof value === "string") {
// |value| is rarely numeric (it's usually an identifier), and the
// isIndex()/isNumericString() pair is slow and expensive, so we do a
// quick check for obvious non-numericalness first. Just checking if the
// first char is a 7-bit identifier char catches most cases.
var c = value.charCodeAt(0);
if ((65 <= c && c <= 90) || // 'A'..'Z'
(97 <= c && c <= 122) || // 'a'..'z'
(c === 36) || // '$'
(c === 95)) { // '_'
return false;
}
return isIndex(value) || isNumericString(value);
}
// Debug.notImplemented(typeof value);
return false;
}
/**
* Whether the specified |value| is an unsigned 32 bit number expressed as a number
* or string.
*/
export function isIndex(value: any): boolean {
// js/src/vm/String.cpp JSFlatString::isIndexSlow
// http://dxr.mozilla.org/mozilla-central/source/js/src/vm/String.cpp#474
var index = 0;
if (typeof value === "number") {
index = (value | 0);
if (value === index && index >= 0) {
return true;
}
return value >>> 0 === value;
}
if (typeof value !== "string") {
return false;
}
var length = value.length;
if (length === 0) {
return false;
}
if (value === "0") {
return true;
}
// Is there any way this will fit?
if (length > UINT32_CHAR_BUFFER_LENGTH) {
return false;
}
var i = 0;
index = value.charCodeAt(i++) - CharacterCodes._0;
if (index < 1 || index > 9) {
return false;
}
var oldIndex = 0;
var c = 0;
while (i < length) {
c = value.charCodeAt(i++) - CharacterCodes._0;
if (c < 0 || c > 9) {
return false;
}
oldIndex = index;
index = 10 * index + c;
}
/*
* Look out for "4294967296" and larger-number strings that fit in UINT32_CHAR_BUFFER_LENGTH.
* Only unsigned 32-bit integers shall pass.
*/
if ((oldIndex < UINT32_MAX_DIV_10) || (oldIndex === UINT32_MAX_DIV_10 && c <= UINT32_MAX_MOD_10)) {
return true;
}
return false;
}
export function isNullOrUndefined(value) {
return value == undefined;
}
export module Debug {
export function backtrace() {
try {
throw new Error();
} catch (e) {
return e.stack ? e.stack.split('\n').slice(2).join('\n') : '';
}
}
export function error(message: string) {
if (!inBrowser) {
warn(message + "\n\nStack Trace:\n" + Debug.backtrace());
} else {
warn(message);
}
throw new Error(message);
}
export function assert(condition: any, message: any = "assertion failed") {
if (condition === "") { // avoid inadvertent false positive
condition = true;
}
if (!condition) {
Debug.error(message.toString());
}
}
export function assertUnreachable(msg: string): void {
var location = new Error().stack.split('\n')[1];
throw new Error("Reached unreachable location " + location + msg);
}
export function assertNotImplemented(condition: boolean, message: string) {
if (!condition) {
Debug.error("notImplemented: " + message);
}
}
export function warning(message: string) {
release || warn(message);
}
export function notUsed(message: string) {
release || Debug.assert(false, "Not Used " + message);
}
export function notImplemented(message: string) {
log("release: " + release);
release || Debug.assert(false, "Not Implemented " + message);
}
export function abstractMethod(message: string) {
Debug.assert(false, "Abstract Method " + message);
}
var somewhatImplementedCache = {};
export function somewhatImplemented(message: string) {
if (somewhatImplementedCache[message]) {
return;
}
somewhatImplementedCache[message] = true;
Debug.warning("somewhatImplemented: " + message);
}
export function unexpected(message?: any) {
Debug.assert(false, "Unexpected: " + message);
}
export function untested(message?: any) {
Debug.warning("Congratulations, you've found a code path for which we haven't found a test case. Please submit the test case: " + message);
}
}
export function getTicks(): number {
return performance.now();
}
export module ArrayUtilities {
import assert = Debug.assert;
/**
* Pops elements from a source array into a destination array. This avoids
* allocations and should be faster. The elements in the destination array
* are pushed in the same order as they appear in the source array:
*
* popManyInto([1, 2, 3], 2, dst) => dst = [2, 3]
*/
export function popManyInto(src: any [], count: number, dst: any []) {
release || assert(src.length >= count);
for (var i = count - 1; i >= 0; i--) {
dst[i] = src.pop();
}
dst.length = count;
}
export function popMany<T>(array: T [], count: number): T [] {
release || assert(array.length >= count);
var start = array.length - count;
var result = array.slice(start, this.length);
array.splice(start, count);
return result;
}
/**
* Just deletes several array elements from the end of the list.
*/
export function popManyIntoVoid(array: any [], count: number) {
release || assert(array.length >= count);
array.length = array.length - count;
}
export function pushMany(dst: any [], src: any []) {
for (var i = 0; i < src.length; i++) {
dst.push(src[i]);
}
}
export function top(array: any []) {
return array.length && array[array.length - 1]
}
export function last(array: any []) {
return array.length && array[array.length - 1]
}
export function peek(array: any []) {
release || assert(array.length > 0);
return array[array.length - 1];
}
export function indexOf<T>(array: T [], value: T): number {
for (var i = 0, j = array.length; i < j; i++) {
if (array[i] === value) {
return i;
}
}
return -1;
}
export function pushUnique<T>(array: T [], value: T): number {
for (var i = 0, j = array.length; i < j; i++) {
if (array[i] === value) {
return i;
}
}
array.push(value);
return array.length - 1;
}
export function unique<T>(array: T []): T [] {
var result = [];
for (var i = 0; i < array.length; i++) {
pushUnique(result, array[i]);
}
return result;
}
export function copyFrom(dst: any [], src: any []) {
dst.length = 0;
ArrayUtilities.pushMany(dst, src);
}
/**
* Makes sure that a typed array has the requested capacity. If required, it creates a new
* instance of the array's class with a power-of-two capacity at least as large as required.
*
* Note: untyped because generics with constraints are pretty annoying.
*/
export function ensureTypedArrayCapacity(array: any, capacity: number): any {
if (array.length < capacity) {
var oldArray = array;
array = new array.constructor(IntegerUtilities.nearestPowerOfTwo(capacity));
array.set(oldArray, 0);
}
return array;
}
export class ArrayWriter {
_u8: Uint8Array;
_u16: Uint16Array;
_i32: Int32Array;
_f32: Float32Array;
_u32: Uint32Array;
_offset: number;
constructor(initialCapacity: number = 16) {
this._u8 = null;
this._u16 = null;
this._i32 = null;
this._f32 = null;
this._offset = 0;
this.ensureCapacity(initialCapacity);
}
public reset() {
this._offset = 0;
}
public get offset (): number {
return this._offset;
}
getIndex(size: number) {
release || assert (size === 1 || size === 2 || size === 4 || size === 8 || size === 16);
var index = this._offset / size;
release || assert ((index | 0) === index);
return index;
}
ensureAdditionalCapacity(size) {
this.ensureCapacity(this._offset + size);
}
ensureCapacity(minCapacity: number) {
if (!this._u8) {
this._u8 = new Uint8Array(minCapacity);
} else if (this._u8.length > minCapacity) {
return;
}
var oldCapacity = this._u8.length;
// var newCapacity = (((oldCapacity * 3) >> 1) + 8) & ~0x7;
var newCapacity = oldCapacity * 2;
if (newCapacity < minCapacity) {
newCapacity = minCapacity;
}
var u8 = new Uint8Array(newCapacity);
u8.set(this._u8, 0);
this._u8 = u8;
this._u16 = new Uint16Array(u8.buffer);
this._i32 = new Int32Array(u8.buffer);
this._f32 = new Float32Array(u8.buffer);
}
writeInt(v: number) {
release || assert ((this._offset & 0x3) === 0);
this.ensureCapacity(this._offset + 4);
this.writeIntUnsafe(v);
}
writeIntAt(v: number, offset: number) {
release || assert (offset >= 0 && offset <= this._offset);
release || assert ((offset & 0x3) === 0);
this.ensureCapacity(offset + 4);
var index = offset >> 2;
this._i32[index] = v;
}
writeIntUnsafe(v: number) {
var index = this._offset >> 2;
this._i32[index] = v;
this._offset += 4;
}
writeFloat(v: number) {
release || assert ((this._offset & 0x3) === 0);
this.ensureCapacity(this._offset + 4);
this.writeFloatUnsafe(v);
}
writeFloatUnsafe(v: number) {
var index = this._offset >> 2;
this._f32[index] = v;
this._offset += 4;
}
write4Floats(a: number, b: number, c: number, d: number) {
release || assert ((this._offset & 0x3) === 0);
this.ensureCapacity(this._offset + 16);
this.write4FloatsUnsafe(a, b, c, d);
}
write4FloatsUnsafe(a: number, b: number, c: number, d: number) {
var index = this._offset >> 2;
this._f32[index + 0] = a;
this._f32[index + 1] = b;
this._f32[index + 2] = c;
this._f32[index + 3] = d;
this._offset += 16;
}
write6Floats(a: number, b: number, c: number, d: number, e: number, f: number) {
release || assert ((this._offset & 0x3) === 0);
this.ensureCapacity(this._offset + 24);
this.write6FloatsUnsafe(a, b, c, d, e, f);
}
write6FloatsUnsafe(a: number, b: number, c: number, d: number, e: number, f: number) {
var index = this._offset >> 2;
this._f32[index + 0] = a;
this._f32[index + 1] = b;
this._f32[index + 2] = c;
this._f32[index + 3] = d;
this._f32[index + 4] = e;
this._f32[index + 5] = f;
this._offset += 24;
}
subF32View(): Float32Array {
return this._f32.subarray(0, this._offset >> 2);
}
subI32View(): Int32Array {
return this._i32.subarray(0, this._offset >> 2);
}
subU16View(): Uint16Array {
return this._u16.subarray(0, this._offset >> 1);
}
subU8View(): Uint8Array {
return this._u8.subarray(0, this._offset);
}
hashWords(hash: number, offset: number, length: number) {
var i32 = this._i32;
for (var i = 0; i < length; i++) {
hash = (((31 * hash) | 0) + i32[i]) | 0;
}
return hash;
}
reserve(size: number) {
size = (size + 3) & ~0x3; // Round up to multiple of 4.
this.ensureCapacity(this._offset + size);
this._offset += size;
}
}
}
export class ArrayReader {
_u8: Uint8Array;
_u16: Uint16Array;
_i32: Int32Array;
_f32: Float32Array;
_u32: Uint32Array;
_offset: number;
constructor(buffer: ArrayBuffer) {
this._u8 = new Uint8Array(buffer);
this._u16 = new Uint16Array(buffer);
this._i32 = new Int32Array(buffer);
this._f32 = new Float32Array(buffer);
this._offset = 0;
}
public get offset (): number {
return this._offset;
}
public isEmpty (): boolean {
return this._offset === this._u8.length;
}
readInt(): number {
release || Debug.assert ((this._offset & 0x3) === 0);
release || Debug.assert (this._offset <= this._u8.length - 4);
var v = this._i32[this._offset >> 2];
this._offset += 4;
return v;
}
readFloat(): number {
release || Debug.assert ((this._offset & 0x3) === 0);
release || Debug.assert (this._offset <= this._u8.length - 4);
var v = this._f32[this._offset >> 2];
this._offset += 4;
return v;
}
}
export module ObjectUtilities {
export function boxValue(value) {
if (isNullOrUndefined(value) || isObject(value)) {
return value;
}
return Object(value);
}
export function toKeyValueArray(object: Object) {
var hasOwnProperty = Object.prototype.hasOwnProperty;
var array = [];
for (var k in object) {
if (hasOwnProperty.call(object, k)) {
array.push([k, object[k]]);
}
}
return array;
}
export function isPrototypeWriteable(object: Object) {
return Object.getOwnPropertyDescriptor(object, "prototype").writable;
}
export function hasOwnProperty(object: Object, name: string): boolean {
return Object.prototype.hasOwnProperty.call(object, name);
}
export function propertyIsEnumerable(object: Object, name: string): boolean {
return Object.prototype.propertyIsEnumerable.call(object, name);
}
export function getOwnPropertyDescriptor(object: Object, name: string): PropertyDescriptor {
return Object.getOwnPropertyDescriptor(object, name);
}
export function hasOwnGetter(object: Object, name: string): boolean {
var d = Object.getOwnPropertyDescriptor(object, name);
return !!(d && d.get);
}
export function getOwnGetter(object: Object, name: string): () => any {
var d = Object.getOwnPropertyDescriptor(object, name);
return d ? d.get : null;
}
export function hasOwnSetter(object: Object, name: string): boolean {
var d = Object.getOwnPropertyDescriptor(object, name);
return !!(d && !!d.set);
}
export function createObject(prototype: Object) {
return Object.create(prototype);
}
export function createEmptyObject() {
return Object.create(null);
}
export function createMap<K, V>(): Map<K, V> {
return Object.create(null);
}
export function createArrayMap<K, V>(): Map<K, V> {
return <Map<K, V>><any>[];
}
export function defineReadOnlyProperty(object: Object, name: string, value: any) {
Object.defineProperty(object, name, {
value: value,
writable: false,
configurable: true,
enumerable: false
});
}
export function getOwnPropertyDescriptors(object: Object): Map<string, PropertyDescriptor> {
var o = ObjectUtilities.createMap<string, PropertyDescriptor>();
var properties = Object.getOwnPropertyNames(object);
for (var i = 0; i < properties.length; i++) {
o[properties[i]] = Object.getOwnPropertyDescriptor(object, properties[i]);
}
return o;
}
export function cloneObject(object: Object): Object {
var clone = Object.create(Object.getPrototypeOf(object));
copyOwnProperties(clone, object);
return clone;
}
export function copyProperties(object: Object, template: Object) {
for (var property in template) {
object[property] = template[property];
}
}
export function copyOwnProperties(object: Object, template: Object) {
for (var property in template) {
if (hasOwnProperty(template, property)) {
object[property] = template[property];
}
}
}
export function copyOwnPropertyDescriptors(object: Object, template: Object, overwrite = true) {
for (var property in template) {
if (hasOwnProperty(template, property)) {
var descriptor = Object.getOwnPropertyDescriptor(template, property);
if (!overwrite && hasOwnProperty(object, property)) {
continue
}
release || Debug.assert (descriptor);
try {
Object.defineProperty(object, property, descriptor);
} catch (e) {
// log("Can't define " + property);
}
}
}
}
export function getLatestGetterOrSetterPropertyDescriptor(object, name) {
var descriptor: PropertyDescriptor = {};
while (object) {
var tmp = Object.getOwnPropertyDescriptor(object, name);
if (tmp) {
descriptor.get = descriptor.get || tmp.get;
descriptor.set = descriptor.set || tmp.set;
}
if (descriptor.get && descriptor.set) {
break;
}
object = Object.getPrototypeOf(object);
}
return descriptor;
}
export function defineNonEnumerableGetterOrSetter(obj, name, value, isGetter) {
var descriptor = ObjectUtilities.getLatestGetterOrSetterPropertyDescriptor(obj, name);
descriptor.configurable = true;
descriptor.enumerable = false;
if (isGetter) {
descriptor.get = value;
} else {
descriptor.set = value;
}
Object.defineProperty(obj, name, descriptor);
}
export function defineNonEnumerableGetter(obj, name, getter) {
Object.defineProperty(obj, name, { get: getter,
configurable: true,
enumerable: false
});
}
export function defineNonEnumerableSetter(obj, name, setter) {
Object.defineProperty(obj, name, { set: setter,
configurable: true,
enumerable: false
});
}
export function defineNonEnumerableProperty(obj, name, value) {
Object.defineProperty(obj, name, { value: value,
writable: true,
configurable: true,
enumerable: false
});
}
export function defineNonEnumerableForwardingProperty(obj, name, otherName) {
Object.defineProperty(obj, name, {
get: FunctionUtilities.makeForwardingGetter(otherName),
set: FunctionUtilities.makeForwardingSetter(otherName),
writable: true,
configurable: true,
enumerable: false
});
}
export function defineNewNonEnumerableProperty(obj, name, value) {
release || Debug.assert (!Object.prototype.hasOwnProperty.call(obj, name), "Property: " + name + " already exits.");
ObjectUtilities.defineNonEnumerableProperty(obj, name, value);
}
}
export module FunctionUtilities {
export function makeForwardingGetter(target: string): () => any {
return <() => any> new Function("return this[\"" + target + "\"]");
}
export function makeForwardingSetter(target: string): (any) => void {
return <(any) => void> new Function("value", "this[\"" + target + "\"] = value;");
}
/**
* Attaches a property to the bound function so we can detect when if it
* ever gets rebound.
* TODO: find out why we need this, maybe remove it.
*/
export function bindSafely(fn: Function, object: Object) {
release || Debug.assert (!fn.boundTo && object);
var f = fn.bind(object);
f.boundTo = object;
return f;
}
}
export module StringUtilities {
import assert = Debug.assert;
export function repeatString(c: string, n: number): string {
var s = "";
for (var i = 0; i < n; i++) {
s += c;
}
return s;
}
export function memorySizeToString(value: number) {
value |= 0;
var K = 1024;
var M = K * K;
if (value < K) {
return value + " B";
} else if (value < M) {
return (value / K).toFixed(2) + "KB";
} else {
return (value / M).toFixed(2) + "MB";
}
}
/**
* Returns a reasonably sized description of the |value|, to be used for debugging purposes.
*/
export function toSafeString(value) {
if (typeof value === "string") {
return "\"" + value + "\"";
}
if (typeof value === "number" || typeof value === "boolean") {
return String(value);
}
if (value instanceof Array) {
return "[] " + value.length;
}
return typeof value;
}
export function toSafeArrayString(array) {
var str = [];
for (var i = 0; i < array.length; i++) {
str.push(toSafeString(array[i]));
}
return str.join(", ");
}
export function utf8decode(str: string): Uint8Array {
var bytes = new Uint8Array(str.length * 4);
var b = 0;
for (var i = 0, j = str.length; i < j; i++) {
var code = str.charCodeAt(i);
if (code <= 0x7f) {
bytes[b++] = code;
continue;
}
if (0xD800 <= code && code <= 0xDBFF) {
var codeLow = str.charCodeAt(i + 1);
if (0xDC00 <= codeLow && codeLow <= 0xDFFF) {
// convert only when both high and low surrogates are present
code = ((code & 0x3FF) << 10) + (codeLow & 0x3FF) + 0x10000;
++i;
}
}
if ((code & 0xFFE00000) !== 0) {
bytes[b++] = 0xF8 | ((code >>> 24) & 0x03);
bytes[b++] = 0x80 | ((code >>> 18) & 0x3F);
bytes[b++] = 0x80 | ((code >>> 12) & 0x3F);
bytes[b++] = 0x80 | ((code >>> 6) & 0x3F);
bytes[b++] = 0x80 | (code & 0x3F);
} else if ((code & 0xFFFF0000) !== 0) {
bytes[b++] = 0xF0 | ((code >>> 18) & 0x07);
bytes[b++] = 0x80 | ((code >>> 12) & 0x3F);
bytes[b++] = 0x80 | ((code >>> 6) & 0x3F);
bytes[b++] = 0x80 | (code & 0x3F);
} else if ((code & 0xFFFFF800) !== 0) {
bytes[b++] = 0xE0 | ((code >>> 12) & 0x0F);
bytes[b++] = 0x80 | ((code >>> 6) & 0x3F);
bytes[b++] = 0x80 | (code & 0x3F);
} else {
bytes[b++] = 0xC0 | ((code >>> 6) & 0x1F);
bytes[b++] = 0x80 | (code & 0x3F);
}
}
return bytes.subarray(0, b);
}
export function utf8encode(bytes: Uint8Array): string {
var j = 0, str = "";
while (j < bytes.length) {
var b1 = bytes[j++] & 0xFF;
if (b1 <= 0x7F) {
str += String.fromCharCode(b1);
} else {
var currentPrefix = 0xC0;
var validBits = 5;
do {
var mask = (currentPrefix >> 1) | 0x80;
if((b1 & mask) === currentPrefix) break;
currentPrefix = (currentPrefix >> 1) | 0x80;
--validBits;
} while (validBits >= 0);
if (validBits <= 0) {
// Invalid UTF8 character -- copying as is
str += String.fromCharCode(b1);
continue;
}
var code = (b1 & ((1 << validBits) - 1));
var invalid = false;
for (var i = 5; i >= validBits; --i) {
var bi = bytes[j++];
if ((bi & 0xC0) != 0x80) {
// Invalid UTF8 character sequence
invalid = true;
break;
}
code = (code << 6) | (bi & 0x3F);
}
if (invalid) {
// Copying invalid sequence as is
for (var k = j - (7 - i); k < j; ++k) {
str += String.fromCharCode(bytes[k] & 255);
}
continue;
}
if (code >= 0x10000) {
str += String.fromCharCode((((code - 0x10000) >> 10) & 0x3FF) |
0xD800, (code & 0x3FF) | 0xDC00);
} else {
str += String.fromCharCode(code);
}
}
}
return str;
}
// https://gist.github.com/958841
export function base64ArrayBuffer(arrayBuffer: ArrayBuffer) {
var base64 = '';
var encodings = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
var bytes = new Uint8Array(arrayBuffer);
var byteLength = bytes.byteLength;
var byteRemainder = byteLength % 3;
var mainLength = byteLength - byteRemainder;
var a, b, c, d;
var chunk;
// Main loop deals with bytes in chunks of 3
for (var i = 0; i < mainLength; i = i + 3) {
// Combine the three bytes into a single integer
chunk = (bytes[i] << 16) | (bytes[i + 1] << 8) | bytes[i + 2];
// Use bitmasks to extract 6-bit segments from the triplet
a = (chunk & 16515072) >> 18; // 16515072 = (2^6 - 1) << 18
b = (chunk & 258048) >> 12; // 258048 = (2^6 - 1) << 12
c = (chunk & 4032) >> 6; // 4032 = (2^6 - 1) << 6
d = chunk & 63; // 63 = 2^6 - 1
// Convert the raw binary segments to the appropriate ASCII encoding
base64 += encodings[a] + encodings[b] + encodings[c] + encodings[d];
}
// Deal with the remaining bytes and padding
if (byteRemainder == 1) {
chunk = bytes[mainLength];
a = (chunk & 252) >> 2; // 252 = (2^6 - 1) << 2
// Set the 4 least significant bits to zero
b = (chunk & 3) << 4; // 3 = 2^2 - 1
base64 += encodings[a] + encodings[b] + '==';
} else if (byteRemainder == 2) {
chunk = (bytes[mainLength] << 8) | bytes[mainLength + 1];
a = (chunk & 64512) >> 10; // 64512 = (2^6 - 1) << 10
b = (chunk & 1008) >> 4; // 1008 = (2^6 - 1) << 4
// Set the 2 least significant bits to zero
c = (chunk & 15) << 2; // 15 = 2^4 - 1
base64 += encodings[a] + encodings[b] + encodings[c] + '=';
}
return base64;
}
export function escapeString(str: string) {
if (str !== undefined) {
str = str.replace(/[^\w$]/gi,"$"); /* No dots, colons, dashes and /s */
if (/^\d/.test(str)) { /* No digits at the beginning */
str = '$' + str;
}
}
return str;
}
/**
* Workaround for max stack size limit.
*/
export function fromCharCodeArray(buffer: Uint8Array): string {
var str = "", SLICE = 1024 * 16;
for (var i = 0; i < buffer.length; i += SLICE) {
var chunk = Math.min(buffer.length - i, SLICE);
str += String.fromCharCode.apply(null, buffer.subarray(i, i + chunk));
}
return str;
}
var _encoding = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789$_';
export function variableLengthEncodeInt32(n) {
var e = _encoding;
var bitCount = (32 - Math.clz32(n));
release || assert (bitCount <= 32, bitCount);
var l = Math.ceil(bitCount / 6);
// Encode length followed by six bit chunks.
var s = e[l];
for (var i = l - 1; i >= 0; i--) {
var offset = (i * 6);
s += e[(n >> offset) & 0x3F];
}
release || assert (StringUtilities.variableLengthDecodeInt32(s) === n, n + " : " + s + " - " + l + " bits: " + bitCount);
return s;
}
export function toEncoding(n) {
return _encoding[n];
}
export function fromEncoding(s) {
var c = s.charCodeAt(0);
var e = 0;
if (c >= 65 && c <= 90) {
return c - 65;
} else if (c >= 97 && c <= 122) {
return c - 71;
} else if (c >= 48 && c <= 57) {
return c + 4;
} else if (c === 36) {
return 62;
} else if (c === 95) {
return 63;
}
release || assert (false, "Invalid Encoding");
}
export function variableLengthDecodeInt32(s) {
var l = StringUtilities.fromEncoding(s[0]);
var n = 0;
for (var i = 0; i < l; i++) {
var offset = ((l - i - 1) * 6);
n |= StringUtilities.fromEncoding(s[1 + i]) << offset;
}
return n;
}
export function trimMiddle(s: string, maxLength: number): string {
if (s.length <= maxLength) {
return s;
}
var leftHalf = maxLength >> 1;
var rightHalf = maxLength - leftHalf - 1;
return s.substr(0, leftHalf) + "\u2026" + s.substr(s.length - rightHalf, rightHalf);
}
export function multiple(s: string, count: number): string {
var o = "";
for (var i = 0; i < count; i++) {
o += s;
}
return o;
}
export function indexOfAny(s: string, chars: string [], position: number) {
var index = s.length;
for (var i = 0; i < chars.length; i++) {
var j = s.indexOf(chars[i], position);
if (j >= 0) {
index = Math.min(index, j);
}
}
return index === s.length ? -1 : index;
}
var _concat3array = new Array(3);
var _concat4array = new Array(4);
var _concat5array = new Array(5);
var _concat6array = new Array(6);
var _concat7array = new Array(7);
var _concat8array = new Array(8);
var _concat9array = new Array(9);
/**
* The concatN() functions concatenate multiple strings in a way that
* avoids creating intermediate strings, unlike String.prototype.concat().
*
* Note that these functions don't have identical behaviour to using '+',
* because they will ignore any arguments that are |undefined| or |null|.
* This usually doesn't matter.
*/
export function concat3(s0: any, s1: any, s2: any) {
_concat3array[0] = s0;
_concat3array[1] = s1;
_concat3array[2] = s2;
return _concat3array.join('');
}
export function concat4(s0: any, s1: any, s2: any, s3: any) {
_concat4array[0] = s0;
_concat4array[1] = s1;
_concat4array[2] = s2;
_concat4array[3] = s3;
return _concat4array.join('');
}
export function concat5(s0: any, s1: any, s2: any, s3: any, s4: any) {
_concat5array[0] = s0;
_concat5array[1] = s1;
_concat5array[2] = s2;
_concat5array[3] = s3;
_concat5array[4] = s4;
return _concat5array.join('');
}
export function concat6(s0: any, s1: any, s2: any, s3: any, s4: any,
s5: any) {
_concat6array[0] = s0;
_concat6array[1] = s1;
_concat6array[2] = s2;
_concat6array[3] = s3;
_concat6array[4] = s4;
_concat6array[5] = s5;
return _concat6array.join('');
}
export function concat7(s0: any, s1: any, s2: any, s3: any, s4: any,
s5: any, s6: any) {
_concat7array[0] = s0;
_concat7array[1] = s1;
_concat7array[2] = s2;
_concat7array[3] = s3;
_concat7array[4] = s4;
_concat7array[5] = s5;
_concat7array[6] = s6;
return _concat7array.join('');
}
export function concat8(s0: any, s1: any, s2: any, s3: any, s4: any,
s5: any, s6: any, s7: any) {
_concat8array[0] = s0;
_concat8array[1] = s1;
_concat8array[2] = s2;
_concat8array[3] = s3;
_concat8array[4] = s4;
_concat8array[5] = s5;
_concat8array[6] = s6;
_concat8array[7] = s7;
return _concat8array.join('');
}
export function concat9(s0: any, s1: any, s2: any, s3: any, s4: any,
s5: any, s6: any, s7: any, s8: any) {
_concat9array[0] = s0;
_concat9array[1] = s1;
_concat9array[2] = s2;
_concat9array[3] = s3;
_concat9array[4] = s4;
_concat9array[5] = s5;
_concat9array[6] = s6;
_concat9array[7] = s7;
_concat9array[8] = s8;
return _concat9array.join('');
}
}
export module HashUtilities {
var _md5R = new Uint8Array([
7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,
5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,
4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,
6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21]);
var _md5K = new Int32Array([
-680876936, -389564586, 606105819, -1044525330, -176418897, 1200080426,
-1473231341, -45705983, 1770035416, -1958414417, -42063, -1990404162,
1804603682, -40341101, -1502002290, 1236535329, -165796510, -1069501632,
643717713, -373897302, -701558691, 38016083, -660478335, -405537848,
568446438, -1019803690, -187363961, 1163531501, -1444681467, -51403784,
1735328473, -1926607734, -378558, -2022574463, 1839030562, -35309556,
-1530992060, 1272893353, -155497632, -1094730640, 681279174, -358537222,
-722521979, 76029189, -640364487, -421815835, 530742520, -995338651,
-198630844, 1126891415, -1416354905, -57434055, 1700485571, -1894986606,
-1051523, -2054922799, 1873313359, -30611744, -1560198380, 1309151649,
-145523070, -1120210379, 718787259, -343485551]);
export function hashBytesTo32BitsMD5(data: Uint8Array, offset: number, length: number): number {
var r = _md5R;
var k = _md5K;
var h0 = 1732584193, h1 = -271733879, h2 = -1732584194, h3 = 271733878;
// pre-processing
var paddedLength = (length + 72) & ~63; // data + 9 extra bytes
var padded = new Uint8Array(paddedLength);
var i, j, n;
for (i = 0; i < length; ++i) {
padded[i] = data[offset++];
}
padded[i++] = 0x80;
n = paddedLength - 8;
while (i < n) {
padded[i++] = 0;
}
padded[i++] = (length << 3) & 0xFF;
padded[i++] = (length >> 5) & 0xFF;
padded[i++] = (length >> 13) & 0xFF;
padded[i++] = (length >> 21) & 0xFF;
padded[i++] = (length >>> 29) & 0xFF;
padded[i++] = 0;
padded[i++] = 0;
padded[i++] = 0;
// chunking
// TODO ArrayBuffer ?
var w = new Int32Array(16);
for (i = 0; i < paddedLength;) {
for (j = 0; j < 16; ++j, i += 4) {
w[j] = (padded[i] | (padded[i + 1] << 8) |
(padded[i + 2] << 16) | (padded[i + 3] << 24));
}
var a = h0, b = h1, c = h2, d = h3, f, g;
for (j = 0; j < 64; ++j) {
if (j < 16) {
f = (b & c) | ((~b) & d);
g = j;
} else if (j < 32) {
f = (d & b) | ((~d) & c);
g = (5 * j + 1) & 15;
} else if (j < 48) {
f = b ^ c ^ d;
g = (3 * j + 5) & 15;
} else {
f = c ^ (b | (~d));
g = (7 * j) & 15;
}
var tmp = d, rotateArg = (a + f + k[j] + w[g]) | 0, rotate = r[j];
d = c;
c = b;
b = (b + ((rotateArg << rotate) | (rotateArg >>> (32 - rotate)))) | 0;
a = tmp;
}
h0 = (h0 + a) | 0;
h1 = (h1 + b) | 0;
h2 = (h2 + c) | 0;
h3 = (h3 + d) | 0;
}
return h0;
}
export function hashBytesTo32BitsAdler(data: Uint8Array, offset: number, length: number): number {
var a = 1;
var b = 0;
var end = offset + length;
for (var i = offset; i < end; ++i) {
a = (a + (data[i] & 0xff)) % 65521;
b = (b + a) % 65521;
}
return (b << 16) | a;
}
}
/**
* Marsaglia's algorithm, adapted from V8. Use this if you want a deterministic random number.
*/
export class Random {
private static _state: Uint32Array = new Uint32Array([0xDEAD, 0xBEEF]);
public static seed(seed: number) {
Random._state[0] = seed;
Random._state[1] = seed;
}
public static next(): number {
var s = this._state;
var r0 = (Math.imul(18273, s[0] & 0xFFFF) + (s[0] >>> 16)) | 0;
s[0] = r0;
var r1 = (Math.imul(36969, s[1] & 0xFFFF) + (s[1] >>> 16)) | 0;
s[1] = r1;
var x = ((r0 << 16) + (r1 & 0xFFFF)) | 0;
// Division by 0x100000000 through multiplication by reciprocal.
return (x < 0 ? (x + 0x100000000) : x) * 2.3283064365386962890625e-10;
}
}
Math.random = function random(): number {
return Random.next();
};
function polyfillWeakMap() {
if (typeof jsGlobal.WeakMap === 'function') {
return; // weak map is supported
}
var id = 0;
function WeakMap() {
this.id = '$weakmap' + (id++);
};
WeakMap.prototype = {
has: function(obj) {
return obj.hasOwnProperty(this.id);
},
get: function(obj, defaultValue) {
return obj.hasOwnProperty(this.id) ? obj[this.id] : defaultValue;
},
set: function(obj, value) {
Object.defineProperty(obj, this.id, {
value: value,
enumerable: false,
configurable: true
});
}
};
jsGlobal.WeakMap = WeakMap;
}
polyfillWeakMap();
declare var netscape;
declare var Components;
export interface IReferenceCountable {
_referenceCount: number;
_addReference();
_removeReference();
}
var useReferenceCounting = true;
export class WeakList<T extends IReferenceCountable> {
private _map: WeakMap<T, T>;
private _list: T [];
constructor() {
if (typeof netscape !== "undefined" && netscape.security.PrivilegeManager) {
this._map = new WeakMap<T, T>();
} else {
this._list = [];
}
}
clear() {
if (this._map) {
this._map.clear();
} else {
this._list.length = 0;
}
}
push(value: T) {
if (this._map) {
this._map.set(value, null);
} else {
this._list.push(value);
}
}
forEach(callback: (value: T) => void) {
if (this._map) {
if (typeof netscape !== "undefined") {
netscape.security.PrivilegeManager.enablePrivilege("UniversalXPConnect");
}
Components.utils.nondeterministicGetWeakMapKeys(this._map).forEach(function (value: T) {
if (value._referenceCount !== 0) {
callback(value);
}
});
return;
}
var list = this._list;
var zeroCount = 0;
for (var i = 0; i < list.length; i++) {
var value = list[i];
if (useReferenceCounting && value._referenceCount === 0) {
zeroCount++;
} else {
callback(value);
}
}
if (zeroCount > 16 && zeroCount > (list.length >> 2)) {
var newList = [];
for (var i = 0; i < list.length; i++) {
if (list[i]._referenceCount > 0) {
newList.push(list[i]);
}
}
this._list = newList;
}
}
get length(): number {
if (this._map) {
// TODO: Implement this.
return -1;
} else {
return this._list.length;
}
}
}
export module NumberUtilities {
export function pow2(exponent: number): number {
if (exponent === (exponent | 0)) {
if (exponent < 0) {
return 1 / (1 << -exponent);
}
return 1 << exponent;
}
return Math.pow(2, exponent);
}
export function clamp(value: number, min: number, max: number) {
return Math.max(min, Math.min(max, value));
}
/**
* Rounds *.5 to the nearest even number.
* See https://en.wikipedia.org/wiki/Rounding#Round_half_to_even for details.
*/
export function roundHalfEven(value: number): number {
if (Math.abs(value % 1) === 0.5) {
var floor = Math.floor(value);
return floor % 2 === 0 ? floor : Math.ceil(value);
}
return Math.round(value);
}
export function epsilonEquals(value: number, other: number): boolean {
return Math.abs(value - other) < 0.0000001;
}
}
export enum Numbers {
MaxU16 = 0xFFFF,
MaxI16 = 0x7FFF,
MinI16 = -0x8000
}
export module IntegerUtilities {
var sharedBuffer = new ArrayBuffer(8);
export var i8 = new Int8Array(sharedBuffer);
export var u8 = new Uint8Array(sharedBuffer);
export var i32 = new Int32Array(sharedBuffer);
export var f32 = new Float32Array(sharedBuffer);
export var f64 = new Float64Array(sharedBuffer);
export var nativeLittleEndian = new Int8Array(new Int32Array([1]).buffer)[0] === 1;
/**
* Convert a float into 32 bits.
*/
export function floatToInt32(v: number) {
f32[0] = v; return i32[0];
}
/**
* Convert 32 bits into a float.
*/
export function int32ToFloat(i: number) {
i32[0] = i; return f32[0];
}
/**
* Swap the bytes of a 16 bit number.
*/
export function swap16(i: number) {
return ((i & 0xFF) << 8) | ((i >> 8) & 0xFF);
}
/**
* Swap the bytes of a 32 bit number.
*/
export function swap32(i: number) {
return ((i & 0xFF) << 24) | ((i & 0xFF00) << 8) | ((i >> 8) & 0xFF00) | ((i >> 24) & 0xFF);
}
/**
* Converts a number to s8.u8 fixed point representation.
*/
export function toS8U8(v: number) {
return ((v * 256) << 16) >> 16;
}
/**
* Converts a number from s8.u8 fixed point representation.
*/
export function fromS8U8(i: number) {
return i / 256;
}
/**
* Round trips a number through s8.u8 conversion.
*/
export function clampS8U8(v: number) {
return fromS8U8(toS8U8(v));
}
/**
* Converts a number to signed 16 bits.
*/
export function toS16(v: number) {
return (v << 16) >> 16;
}
export function bitCount(i: number): number {
i = i - ((i >> 1) & 0x55555555);
i = (i & 0x33333333) + ((i >> 2) & 0x33333333);
return (((i + (i >> 4)) & 0x0F0F0F0F) * 0x01010101) >> 24;
}
export function ones(i: number): number {
i = i - ((i >> 1) & 0x55555555);
i = (i & 0x33333333) + ((i >> 2) & 0x33333333);
return ((i + (i >> 4) & 0xF0F0F0F) * 0x1010101) >> 24;
}
export function trailingZeros(i: number): number {
return IntegerUtilities.ones((i & -i) - 1);
}
export function getFlags(i: number, flags: string[]): string {
var str = "";
for (var i = 0; i < flags.length; i++) {
if (i & (1 << i)) {
str += flags[i] + " ";
}
}
if (str.length === 0) {
return "";
}
return str.trim();
}
export function isPowerOfTwo(x: number) {
return x && ((x & (x - 1)) === 0);
}
export function roundToMultipleOfFour(x: number) {
return (x + 3) & ~0x3;
}
export function nearestPowerOfTwo(x: number) {
x --;
x |= x >> 1;
x |= x >> 2;
x |= x >> 4;
x |= x >> 8;
x |= x >> 16;
x ++;
return x;
}
export function roundToMultipleOfPowerOfTwo(i: number, powerOfTwo: number) {
var x = (1 << powerOfTwo) - 1;
return (i + x) & ~x; // Round up to multiple of power of two.
}
/**
* Polyfill imul.
*/
if (!Math.imul) {
Math.imul = function imul(a, b) {
var ah = (a >>> 16) & 0xffff;
var al = a & 0xffff;
var bh = (b >>> 16) & 0xffff;
var bl = b & 0xffff;
// the shift by 0 fixes the sign on the high part
// the final |0 converts the unsigned value into a signed value
return ((al * bl) + (((ah * bl + al * bh) << 16) >>> 0) | 0);
}
}
/**
* Polyfill clz32.
*/
if (!Math.clz32) {
Math.clz32 = function clz32(i: number) {
i |= (i >> 1);
i |= (i >> 2);
i |= (i >> 4);
i |= (i >> 8);
i |= (i >> 16);
return 32 - IntegerUtilities.ones(i);
}
}
}
export module GeometricUtilities {
/**
* Crossing numeber tests to check if a point is inside a polygon. The polygon is given as
* an array of n + 1 float pairs where the last is equal to the first.
*
* http://geomalgorithms.com/a03-_inclusion.html
*/
export function pointInPolygon(x: number, y: number, polygon: Float32Array): boolean {
// release || assert (((polygon.length & 1) === 0) && polygon.length >= 8);
// release || assert (polygon[0] === polygon[polygon.length - 2] &&
// polygon[1] === polygon[polygon.length - 1], "First and last points should be equal.");
var crosses = 0;
var n = polygon.length - 2;
var p = polygon;
for (var i = 0; i < n; i += 2) {
var x0 = p[i + 0];
var y0 = p[i + 1];
var x1 = p[i + 2];
var y1 = p[i + 3];
if (((y0 <= y) && (y1 > y)) || ((y0 > y) && (y1 <= y))) {
var t = (y - y0) / (y1 - y0);
if (x < x0 + t * (x1 - x0)) {
crosses ++;
}
}
}
return (crosses & 1) === 1;
}
/**
* Signed area of a triangle. If zero then points are collinear, if < 0 then points
* are clockwise otherwise counter-clockwise.
*/
export function signedArea(x0: number, y0: number, x1: number, y1: number, x2: number, y2: number): number {
return (x1 - x0) * (y2 - y0) - (y1 - y0) * (x2 - x0);
}
export function counterClockwise(x0: number, y0: number, x1: number, y1: number, x2: number, y2: number): boolean {
return signedArea(x0, y0, x1, y1, x2, y2) > 0;
}
export function clockwise(x0: number, y0: number, x1: number, y1: number, x2: number, y2: number): boolean {
return signedArea(x0, y0, x1, y1, x2, y2) < 0;
}
export function pointInPolygonInt32(x: number, y: number, polygon: Int32Array): boolean {
// release || assert (((polygon.length & 1) === 0) && polygon.length >= 8);
// release || assert (polygon[0] === polygon[polygon.length - 2] &&
// polygon[1] === polygon[polygon.length - 1], "First and last points should be equal.");
x = x | 0;
y = y | 0;
var crosses = 0;
var n = polygon.length - 2;
var p = polygon;
for (var i = 0; i < n; i += 2) {
var x0 = p[i + 0];
var y0 = p[i + 1];
var x1 = p[i + 2];
var y1 = p[i + 3];
if (((y0 <= y) && (y1 > y)) || ((y0 > y) && (y1 <= y))) {
var t = (y - y0) / (y1 - y0);
if (x < x0 + t * (x1 - x0)) {
crosses ++;
}
}
}
return (crosses & 1) === 1;
}
}
export enum LogLevel {
Error = 0x1,
Warn = 0x2,
Debug = 0x4,
Log = 0x8,
Info = 0x10,
All = 0x1f
}
export function dumpLine(s) {
if (typeof dump !== "undefined") {
dump(s + "\n");
}
}
export class IndentingWriter {
public static PURPLE = '\033[94m';
public static YELLOW = '\033[93m';
public static GREEN = '\033[92m';
public static RED = '\033[91m';
public static BOLD_RED = '\033[1;91m';
public static ENDC = '\033[0m';
public static logLevel: LogLevel = LogLevel.All;
public static stdout = inBrowser ? console.info.bind(console) : print;
public static stdoutNoNewline = inBrowser ? console.info.bind(console) : putstr;
public static stderr = inBrowser ? console.error.bind(console) : printErr;
private _tab: string;
private _padding: string;
private _suppressOutput: boolean;
private _out: (s: string) => void;
private _outNoNewline: (s: string) => void;
constructor(suppressOutput: boolean = false, out?) {
this._tab = " ";
this._padding = "";
this._suppressOutput = suppressOutput;
this._out = out || IndentingWriter.stdout;
this._outNoNewline = out || IndentingWriter.stdoutNoNewline;
}
write(str: string = "", writePadding = false) {
if (!this._suppressOutput) {
this._outNoNewline((writePadding ? this._padding : "") + str);
}
}
writeLn(str: string = "") {
if (!this._suppressOutput) {
this._out(this._padding + str);
}
}
writeTimeLn(str: string = "") {
if (!this._suppressOutput) {
this._out(this._padding + performance.now().toFixed(2) + " " + str);
}
}
writeComment(str: string) {
var lines = str.split("\n");
if (lines.length === 1) {
this.writeLn("// " + lines[0]);
} else {
this.writeLn("/**");
for (var i = 0; i < lines.length; i++) {
this.writeLn(" * " + lines[i]);
}
this.writeLn(" */");
}
}
writeLns(str: string) {
var lines = str.split("\n");
for (var i = 0; i < lines.length; i++) {
this.writeLn(lines[i]);
}
}
errorLn(str: string) {
if (IndentingWriter.logLevel & LogLevel.Error) {
this.boldRedLn(str);
}
}
warnLn(str: string) {
if (IndentingWriter.logLevel & LogLevel.Warn) {
this.yellowLn(str);
}
}
debugLn(str: string) {
if (IndentingWriter.logLevel & LogLevel.Debug) {
this.purpleLn(str);
}
}
logLn(str: string) {
if (IndentingWriter.logLevel & LogLevel.Log) {
this.writeLn(str);
}
}
infoLn(str: string) {
if (IndentingWriter.logLevel & LogLevel.Info) {
this.writeLn(str);
}
}
yellowLn(str: string) {
this.colorLn(IndentingWriter.YELLOW, str);
}
greenLn(str: string) {
this.colorLn(IndentingWriter.GREEN, str);
}
boldRedLn(str: string) {
this.colorLn(IndentingWriter.BOLD_RED, str);
}
redLn(str: string) {
this.colorLn(IndentingWriter.RED, str);
}
purpleLn(str: string) {
this.colorLn(IndentingWriter.PURPLE, str);
}
colorLn(color: string, str: string) {
if (!this._suppressOutput) {
if (!inBrowser) {
this._out(this._padding + color + str + IndentingWriter.ENDC);
} else {
this._out(this._padding + str);
}
}
}
redLns(str: string) {
this.colorLns(IndentingWriter.RED, str);
}
colorLns(color: string, str: string) {
var lines = str.split("\n");
for (var i = 0; i < lines.length; i++) {
this.colorLn(color, lines[i]);
}
}
enter(str: string) {
if (!this._suppressOutput) {
this._out(this._padding + str);
}
this.indent();
}
leaveAndEnter(str: string) {
this.leave(str);
this.indent();
}
leave(str: string) {
this.outdent();
if (!this._suppressOutput) {
this._out(this._padding + str);
}
}
indent() {
this._padding += this._tab;
}
outdent() {
if (this._padding.length > 0) {
this._padding = this._padding.substring(0, this._padding.length - this._tab.length);
}
}
writeArray(arr: any[], detailed: boolean = false, noNumbers: boolean = false) {
detailed = detailed || false;
for (var i = 0, j = arr.length; i < j; i++) {
var prefix = "";
if (detailed) {
if (arr[i] === null) {
prefix = "null";
} else if (arr[i] === undefined) {
prefix = "undefined";
} else {
prefix = arr[i].constructor.name;
}
prefix += " ";
}
var number = noNumbers ? "" : ("" + i).padRight(' ', 4);
this.writeLn(number + prefix + arr[i]);
}
}
}
/**
* Insertion sort SortedList backed by a linked list.
*/
class SortedListNode<T> {
value: T;
next: SortedListNode<T>;
constructor(value: T, next: SortedListNode<T>) {
this.value = value;
this.next = next;
}
}
export class SortedList<T> {
public static RETURN = 1;
public static DELETE = 2;
private _compare: (l: T, r: T) => number;
private _head: SortedListNode<T>;
private _length: number;
constructor (compare: (l: T, r: T) => number) {
release || Debug.assert(compare);
this._compare = compare;
this._head = null;
this._length = 0;
}
public push(value: T) {
release || Debug.assert(value !== undefined);
this._length ++;
if (!this._head) {
this._head = new SortedListNode<T>(value, null);
return;
}
var curr = this._head;
var prev = null;
var node = new SortedListNode<T>(value, null);
var compare = this._compare;
while (curr) {
if (compare(curr.value, node.value) > 0) {
if (prev) {
node.next = curr;
prev.next = node;
} else {
node.next = this._head;
this._head = node;
}
return;
}
prev = curr;
curr = curr.next;
}
prev.next = node;
}
/**
* Visitors can return RETURN if they wish to stop the iteration or DELETE if they need to delete the current node.
* NOTE: DELETE most likley doesn't work if there are multiple active iterations going on.
*/
public forEach(visitor: (value: T) => any) {
var curr = this._head;
var last = null;
while (curr) {
var result = visitor(curr.value);
if (result === SortedList.RETURN) {
return;
} else if (result === SortedList.DELETE) {
if (!last) {
curr = this._head = this._head.next;
} else {
curr = last.next = curr.next;
}
} else {
last = curr;
curr = curr.next;
}
}
}
public isEmpty(): boolean {
return !this._head;
}
public pop(): T {
if (!this._head) {
return undefined;
}
this._length --;
var ret = this._head;
this._head = this._head.next;
return ret.value;
}
public contains(value: T): boolean {
var curr = this._head;
while (curr) {
if (curr.value === value) {
return true;
}
curr = curr.next;
}
return false;
}
public toString(): string {
var str = "[";
var curr = this._head;
while (curr) {
str += curr.value.toString();
curr = curr.next;
if (curr) {
str += ",";
}
}
str += "]";
return str;
}
}
export class CircularBuffer {
index: number;
start: number;
array: ArrayBufferView;
_size: number;
_mask: number;
constructor(Type, sizeInBits: number = 12) {
this.index = 0;
this.start = 0;
this._size = 1 << sizeInBits;
this._mask = this._size - 1;
this.array = new Type(this._size);
}
public get (i) {
return this.array[i];
}
public forEachInReverse(visitor) {
if (this.isEmpty()) {
return;
}
var i = this.index === 0 ? this._size - 1 : this.index - 1;
var end = (this.start - 1) & this._mask;
while (i !== end) {
if (visitor(this.array[i], i)) {
break;
}
i = i === 0 ? this._size - 1 : i - 1;
}
}
public write(value) {
this.array[this.index] = value;
this.index = (this.index + 1) & this._mask;
if (this.index === this.start) {
this.start = (this.start + 1) & this._mask;
}
}
public isFull(): boolean {
return ((this.index + 1) & this._mask) === this.start;
}
public isEmpty(): boolean {
return this.index === this.start;
}
public reset() {
this.index = 0;
this.start = 0;
}
}
export module BitSets {
import assert = Debug.assert;
export var ADDRESS_BITS_PER_WORD = 5;
export var BITS_PER_WORD = 1 << ADDRESS_BITS_PER_WORD;
export var BIT_INDEX_MASK = BITS_PER_WORD - 1;
function getSize(length): number {
return ((length + (BITS_PER_WORD - 1)) >> ADDRESS_BITS_PER_WORD) << ADDRESS_BITS_PER_WORD;
}
export interface BitSet {
set: (i) => void;
setAll: () => void;
assign: (set: BitSet) => void;
clear: (i: number) => void;
get: (i: number) => boolean;
clearAll: () => void;
intersect: (other: BitSet) => void;
subtract: (other: BitSet) => void;
negate: () => void;
forEach: (fn) => void;
toArray: () => boolean [];
equals: (other: BitSet) => boolean;
contains: (other: BitSet) => boolean;
isEmpty: () => boolean;
clone: () => BitSet;
recount: () => void;
toString: (names: string []) => string;
toBitString: (on: string, off: string) => string;
}
function toBitString(on: string, off: string) {
var self: BitSet = this;
on = on || "1";
off = off || "0";
var str = "";
for (var i = 0; i < length; i++) {
str += self.get(i) ? on : off;
}
return str;
}
function toString(names: any[]) {
var self: BitSet = this;
var set = [];
for (var i = 0; i < length; i++) {
if (self.get(i)) {
set.push(names ? names[i] : i);
}
}
return set.join(", ");
}
export class Uint32ArrayBitSet implements BitSet {
size: number;
bits: Uint32Array;
count: number;
dirty: number;
length: number;
constructor(length: number) {
this.size = getSize(length);
this.count = 0;
this.dirty = 0;
this.length = length;
this.bits = new Uint32Array(this.size >> ADDRESS_BITS_PER_WORD);
}
recount() {
if (!this.dirty) {
return;
}
var bits = this.bits;
var c = 0;
for (var i = 0, j = bits.length; i < j; i++) {
var v = bits[i];
v = v - ((v >> 1) & 0x55555555);
v = (v & 0x33333333) + ((v >> 2) & 0x33333333);
c += ((v + (v >> 4) & 0xF0F0F0F) * 0x1010101) >> 24;
}
this.count = c;
this.dirty = 0;
}
set(i) {
var n = i >> ADDRESS_BITS_PER_WORD;
var old = this.bits[n];
var b = old | (1 << (i & BIT_INDEX_MASK));
this.bits[n] = b;
this.dirty |= old ^ b;
}
setAll() {
var bits = this.bits;
for (var i = 0, j = bits.length; i < j; i++) {
bits[i] = 0xFFFFFFFF;
}
this.count = this.size;
this.dirty = 0;
}
assign(set) {
this.count = set.count;
this.dirty = set.dirty;
this.size = set.size;
for (var i = 0, j = this.bits.length; i < j; i++) {
this.bits[i] = set.bits[i];
}
}
nextSetBit(from: number, to: number): number {
if (from === to) {
return -1;
}
var bits = this.bits;
for (var i = from; i < to; i++) {
var word = bits[i >> ADDRESS_BITS_PER_WORD];
if (((word & 1 << (i & BIT_INDEX_MASK))) !== 0) {
return i;
}
}
}
clear(i) {
var n = i >> ADDRESS_BITS_PER_WORD;
var old = this.bits[n];
var b = old & ~(1 << (i & BIT_INDEX_MASK));
this.bits[n] = b;
this.dirty |= old ^ b;
}
get(i): boolean {
var word = this.bits[i >> ADDRESS_BITS_PER_WORD];
return ((word & 1 << (i & BIT_INDEX_MASK))) !== 0;
}
clearAll() {
var bits = this.bits;
for (var i = 0, j = bits.length; i < j; i++) {
bits[i] = 0;
}
this.count = 0;
this.dirty = 0;
}
private _union(other: Uint32ArrayBitSet) {
var dirty = this.dirty;
var bits = this.bits;
var otherBits = other.bits;
for (var i = 0, j = bits.length; i < j; i++) {
var old = bits[i];
var b = old | otherBits[i];
bits[i] = b;
dirty |= old ^ b;
}
this.dirty = dirty;
}
intersect(other: Uint32ArrayBitSet) {
var dirty = this.dirty;
var bits = this.bits;
var otherBits = other.bits;
for (var i = 0, j = bits.length; i < j; i++) {
var old = bits[i];
var b = old & otherBits[i];
bits[i] = b;
dirty |= old ^ b;
}
this.dirty = dirty;
}
subtract(other: Uint32ArrayBitSet) {
var dirty = this.dirty;
var bits = this.bits;
var otherBits = other.bits;
for (var i = 0, j = bits.length; i < j; i++) {
var old = bits[i];
var b = old & ~otherBits[i];
bits[i] = b;
dirty |= old ^ b;
}
this.dirty = dirty;
}
negate() {
var dirty = this.dirty;
var bits = this.bits;
for (var i = 0, j = bits.length; i < j; i++) {
var old = bits[i];
var b = ~old;
bits[i] = b;
dirty |= old ^ b;
}
this.dirty = dirty;
}
forEach(fn) {
release || assert(fn);
var bits = this.bits;
for (var i = 0, j = bits.length; i < j; i++) {
var word = bits[i];
if (word) {
for (var k = 0; k < BITS_PER_WORD; k++) {
if (word & (1 << k)) {
fn(i * BITS_PER_WORD + k);
}
}
}
}
}
toArray(): boolean[] {
var set = [];
var bits = this.bits;
for (var i = 0, j = bits.length; i < j; i++) {
var word = bits[i];
if (word) {
for (var k = 0; k < BITS_PER_WORD; k++) {
if (word & (1 << k)) {
set.push(i * BITS_PER_WORD + k);
}
}
}
}
return set;
}
equals(other: Uint32ArrayBitSet) {
if (this.size !== other.size) {
return false;
}
var bits = this.bits;
var otherBits = other.bits;
for (var i = 0, j = bits.length; i < j; i++) {
if (bits[i] !== otherBits[i]) {
return false;
}
}
return true;
}
contains(other: Uint32ArrayBitSet) {
if (this.size !== other.size) {
return false;
}
var bits = this.bits;
var otherBits = other.bits;
for (var i = 0, j = bits.length; i < j; i++) {
if ((bits[i] | otherBits[i]) !== bits[i]) {
return false;
}
}
return true;
}
toBitString: (on: string, off: string) => string;
toString: (names: string []) => string;
isEmpty(): boolean {
this.recount();
return this.count === 0;
}
clone(): Uint32ArrayBitSet {
var set = new Uint32ArrayBitSet(this.length);
set._union(this);
return set;
}
}
export class Uint32BitSet implements BitSet {
size: number;
bits: number;
count: number;
dirty: number;
singleWord: boolean;
length: number;
constructor(length: number) {
this.count = 0;
this.dirty = 0;
this.size = getSize(length);
this.bits = 0;
this.singleWord = true;
this.length = length;
}
recount() {
if (!this.dirty) {
return;
}
var c = 0;
var v = this.bits;
v = v - ((v >> 1) & 0x55555555);
v = (v & 0x33333333) + ((v >> 2) & 0x33333333);
c += ((v + (v >> 4) & 0xF0F0F0F) * 0x1010101) >> 24;
this.count = c;
this.dirty = 0;
}
set(i) {
var old = this.bits;
var b = old | (1 << (i & BIT_INDEX_MASK));
this.bits = b;
this.dirty |= old ^ b;
}
setAll() {
this.bits = 0xFFFFFFFF;
this.count = this.size;
this.dirty = 0;
}
assign(set: Uint32BitSet) {
this.count = set.count;
this.dirty = set.dirty;
this.size = set.size;
this.bits = set.bits;
}
clear(i: number) {
var old = this.bits;
var b = old & ~(1 << (i & BIT_INDEX_MASK));
this.bits = b;
this.dirty |= old ^ b;
}
get(i: number): boolean {
return ((this.bits & 1 << (i & BIT_INDEX_MASK))) !== 0;
}
clearAll() {
this.bits = 0;
this.count = 0;
this.dirty = 0;
}
private _union(other: Uint32BitSet) {
var old = this.bits;
var b = old | other.bits;
this.bits = b;
this.dirty = old ^ b;
}
intersect(other: Uint32BitSet) {
var old = this.bits;
var b = old & other.bits;
this.bits = b;
this.dirty = old ^ b;
}
subtract(other: Uint32BitSet) {
var old = this.bits;
var b = old & ~other.bits;
this.bits = b;
this.dirty = old ^ b;
}
negate() {
var old = this.bits;
var b = ~old;
this.bits = b;
this.dirty = old ^ b;
}
forEach(fn) {
release || assert(fn);
var word = this.bits;
if (word) {
for (var k = 0; k < BITS_PER_WORD; k++) {
if (word & (1 << k)) {
fn(k);
}
}
}
}
toArray(): boolean [] {
var set = [];
var word = this.bits;
if (word) {
for (var k = 0; k < BITS_PER_WORD; k++) {
if (word & (1 << k)) {
set.push(k);
}
}
}
return set;
}
equals(other: Uint32BitSet) {
return this.bits === other.bits;
}
contains(other: Uint32BitSet) {
var bits = this.bits;
return (bits | other.bits) === bits;
}
toBitString: (on: string, off: string) => string;
toString: (names: string []) => string;
isEmpty(): boolean {
this.recount();
return this.count === 0;
}
clone(): Uint32BitSet {
var set = new Uint32BitSet(this.length);
set._union(this);
return set;
}
}
Uint32BitSet.prototype.toString = toString;
Uint32BitSet.prototype.toBitString = toBitString;
Uint32ArrayBitSet.prototype.toString = toString;
Uint32ArrayBitSet.prototype.toBitString = toBitString;
export function BitSetFunctor(length: number) {
var shouldUseSingleWord = (getSize(length) >> ADDRESS_BITS_PER_WORD) === 1;
var type = (shouldUseSingleWord ? <any>Uint32BitSet : <any>Uint32ArrayBitSet);
return function () {
return new type(length);
}
}
}
export class ColorStyle {
static TabToolbar = "#252c33";
static Toolbars = "#343c45";
static HighlightBlue = "#1d4f73";
static LightText = "#f5f7fa";
static ForegroundText = "#b6babf";
static Black = "#000000";
static VeryDark = "#14171a";
static Dark = "#181d20";
static Light = "#a9bacb";
static Grey = "#8fa1b2";
static DarkGrey = "#5f7387";
static Blue = "#46afe3";
static Purple = "#6b7abb";
static Pink = "#df80ff";
static Red = "#eb5368";
static Orange = "#d96629";
static LightOrange = "#d99b28";
static Green = "#70bf53";
static BlueGrey = "#5e88b0";
private static _randomStyleCache;
private static _nextStyle = 0;
static randomStyle() {
if (!ColorStyle._randomStyleCache) {
ColorStyle._randomStyleCache = [
"#ff5e3a",
"#ff9500",
"#ffdb4c",
"#87fc70",
"#52edc7",
"#1ad6fd",
"#c644fc",
"#ef4db6",
"#4a4a4a",
"#dbddde",
"#ff3b30",
"#ff9500",
"#ffcc00",
"#4cd964",
"#34aadc",
"#007aff",
"#5856d6",
"#ff2d55",
"#8e8e93",
"#c7c7cc",
"#5ad427",
"#c86edf",
"#d1eefc",
"#e0f8d8",
"#fb2b69",
"#f7f7f7",
"#1d77ef",
"#d6cec3",
"#55efcb",
"#ff4981",
"#ffd3e0",
"#f7f7f7",
"#ff1300",
"#1f1f21",
"#bdbec2",
"#ff3a2d"
];
}
return ColorStyle._randomStyleCache[(ColorStyle._nextStyle ++) % ColorStyle._randomStyleCache.length];
}
static contrastStyle(rgb: string): string {
// http://www.w3.org/TR/AERT#color-contrast
var c = parseInt(rgb.substr(1), 16);
var yiq = (((c >> 16) * 299) + (((c >> 8) & 0xff) * 587) + ((c & 0xff) * 114)) / 1000;
return (yiq >= 128) ? '#000000' : '#ffffff';
}
static reset() {
ColorStyle._nextStyle = 0;
}
}
export interface UntypedBounds {
xMin: number;
yMin: number;
xMax: number;
yMax: number;
}
export interface ASRectangle {
x: number;
y: number;
width: number;
height: number;
}
/**
* Faster release version of bounds.
*/
export class Bounds {
xMin: number;
yMin: number;
xMax: number;
yMax: number;
constructor (xMin: number, yMin: number, xMax: number, yMax: number) {
this.xMin = xMin|0;
this.yMin = yMin|0;
this.xMax = xMax|0;
this.yMax = yMax|0;
}
static FromUntyped (source: UntypedBounds): Bounds {
return new Bounds(source.xMin, source.yMin, source.xMax, source.yMax);
}
static FromRectangle (source: ASRectangle): Bounds {
return new Bounds(source.x * 20|0, source.y * 20|0, (source.x + source.width) * 20|0,
(source.y + source.height) * 20|0);
}
setElements (xMin: number, yMin: number, xMax: number, yMax: number): void {
this.xMin = xMin;
this.yMin = yMin;
this.xMax = xMax;
this.yMax = yMax;
}
copyFrom (source: Bounds): void {
this.setElements(source.xMin, source.yMin, source.xMax, source.yMax);
}
contains (x: number, y: number): boolean {
return x < this.xMin !== x < this.xMax &&
y < this.yMin !== y < this.yMax;
}
unionInPlace (other: Bounds): void {
this.xMin = Math.min(this.xMin, other.xMin);
this.yMin = Math.min(this.yMin, other.yMin);
this.xMax = Math.max(this.xMax, other.xMax);
this.yMax = Math.max(this.yMax, other.yMax);
}
extendByPoint (x: number, y: number): void {
this.extendByX(x);
this.extendByY(y);
}
extendByX (x: number): void {
// Exclude default values.
if (this.xMin === 0x8000000) {
this.xMin = this.xMax = x;
return;
}
this.xMin = Math.min(this.xMin, x);
this.xMax = Math.max(this.xMax, x);
}
extendByY (y: number): void {
// Exclude default values.
if (this.yMin === 0x8000000) {
this.yMin = this.yMax = y;
return;
}
this.yMin = Math.min(this.yMin, y);
this.yMax = Math.max(this.yMax, y);
}
public intersects(toIntersect: Bounds): boolean {
return this.contains(toIntersect.xMin, toIntersect.yMin) ||
this.contains(toIntersect.xMax, toIntersect.yMax);
}
isEmpty (): boolean {
return this.xMax <= this.xMin || this.yMax <= this.yMin;
}
get width(): number {
return this.xMax - this.xMin;
}
set width(value: number) {
this.xMax = this.xMin + value;
}
get height(): number {
return this.yMax - this.yMin;
}
set height(value: number) {
this.yMax = this.yMin + value;
}
public getBaseWidth(angle: number): number {
var u = Math.abs(Math.cos(angle));
var v = Math.abs(Math.sin(angle));
return u * (this.xMax - this.xMin) + v * (this.yMax - this.yMin);
}
public getBaseHeight(angle: number): number {
var u = Math.abs(Math.cos(angle));
var v = Math.abs(Math.sin(angle));
return v * (this.xMax - this.xMin) + u * (this.yMax - this.yMin);
}
setEmpty (): void {
this.xMin = this.yMin = this.xMax = this.yMax = 0;
}
/**
* Set all fields to the sentinel value 0x8000000.
*
* This is what Flash uses to indicate uninitialized bounds. Important for bounds calculation
* in `Graphics` instances, which start out with empty bounds but must not just extend them
* from an 0,0 origin.
*/
setToSentinels (): void {
this.xMin = this.yMin = this.xMax = this.yMax = 0x8000000;
}
clone (): Bounds {
return new Bounds(this.xMin, this.yMin, this.xMax, this.yMax);
}
toString(): string {
return "{ " +
"xMin: " + this.xMin + ", " +
"xMin: " + this.yMin + ", " +
"xMax: " + this.xMax + ", " +
"xMax: " + this.yMax +
" }";
}
}
/**
* Slower debug version of bounds, makes sure that all points have integer coordinates.
*/
export class DebugBounds {
private _xMin: number;
private _yMin: number;
private _xMax: number;
private _yMax: number;
constructor (xMin: number, yMin: number, xMax: number, yMax: number) {
Debug.assert(isInteger(xMin));
Debug.assert(isInteger(yMin));
Debug.assert(isInteger(xMax));
Debug.assert(isInteger(yMax));
this._xMin = xMin|0;
this._yMin = yMin|0;
this._xMax = xMax|0;
this._yMax = yMax|0;
this.assertValid();
}
static FromUntyped (source: UntypedBounds): DebugBounds {
return new DebugBounds(source.xMin, source.yMin, source.xMax, source.yMax);
}
static FromRectangle (source: ASRectangle): DebugBounds {
return new DebugBounds(source.x * 20|0, source.y * 20|0, (source.x + source.width) * 20|0,
(source.y + source.height) * 20|0);
}
setElements (xMin: number, yMin: number, xMax: number, yMax: number): void {
this.xMin = xMin;
this.yMin = yMin;
this.xMax = xMax;
this.yMax = yMax;
}
copyFrom (source: DebugBounds): void {
this.setElements(source.xMin, source.yMin, source.xMax, source.yMax);
}
contains (x: number, y: number): boolean {
return x < this.xMin !== x < this.xMax &&
y < this.yMin !== y < this.yMax;
}
unionWith (other: DebugBounds): void {
this._xMin = Math.min(this._xMin, other._xMin);
this._yMin = Math.min(this._yMin, other._yMin);
this._xMax = Math.max(this._xMax, other._xMax);
this._yMax = Math.max(this._yMax, other._yMax);
}
extendByPoint (x: number, y: number): void {
this.extendByX(x);
this.extendByY(y);
}
extendByX (x: number): void {
if (this.xMin === 0x8000000) {
this.xMin = this.xMax = x;
return;
}
this.xMin = Math.min(this.xMin, x);
this.xMax = Math.max(this.xMax, x);
}
extendByY (y: number): void {
if (this.yMin === 0x8000000) {
this.yMin = this.yMax = y;
return;
}
this.yMin = Math.min(this.yMin, y);
this.yMax = Math.max(this.yMax, y);
}
public intersects(toIntersect: DebugBounds): boolean {
return this.contains(toIntersect._xMin, toIntersect._yMin) ||
this.contains(toIntersect._xMax, toIntersect._yMax);
}
isEmpty (): boolean {
return this._xMax <= this._xMin || this._yMax <= this._yMin;
}
set xMin(value: number) {
Debug.assert(isInteger(value));
this._xMin = value;
this.assertValid();
}
get xMin(): number {
return this._xMin;
}
set yMin(value: number) {
Debug.assert(isInteger(value));
this._yMin = value|0;
this.assertValid();
}
get yMin(): number {
return this._yMin;
}
set xMax(value: number) {
Debug.assert(isInteger(value));
this._xMax = value|0;
this.assertValid();
}
get xMax(): number {
return this._xMax;
}
get width(): number {
return this._xMax - this._xMin;
}
set yMax(value: number) {
Debug.assert(isInteger(value));
this._yMax = value|0;
this.assertValid();
}
get yMax(): number {
return this._yMax;
}
get height(): number {
return this._yMax - this._yMin;
}
public getBaseWidth(angle: number): number {
var u = Math.abs(Math.cos(angle));
var v = Math.abs(Math.sin(angle));
return u * (this._xMax - this._xMin) + v * (this._yMax - this._yMin);
}
public getBaseHeight(angle: number): number {
var u = Math.abs(Math.cos(angle));
var v = Math.abs(Math.sin(angle));
return v * (this._xMax - this._xMin) + u * (this._yMax - this._yMin);
}
setEmpty (): void {
this._xMin = this._yMin = this._xMax = this._yMax = 0;
}
clone (): DebugBounds {
return new DebugBounds(this.xMin, this.yMin, this.xMax, this.yMax);
}
toString(): string {
return "{ " +
"xMin: " + this._xMin + ", " +
"xMin: " + this._yMin + ", " +
"xMax: " + this._xMax + ", " +
"yMax: " + this._yMax +
" }";
}
private assertValid(): void {
// release || assert(this._xMax >= this._xMin);
// release || assert(this._yMax >= this._yMin);
}
}
/**
* Override Bounds with a slower by safer version, don't do this in release mode.
*/
// C4.Bounds = DebugBounds;
export class Color {
public r: number;
public g: number;
public b: number;
public a: number;
constructor(r: number, g: number, b: number, a: number) {
this.r = r;
this.g = g;
this.b = b;
this.a = a;
}
static FromARGB(argb: number) {
return new Color (
(argb >> 16 & 0xFF) / 255,
(argb >> 8 & 0xFF) / 255,
(argb >> 0 & 0xFF) / 255,
(argb >> 24 & 0xFF) / 255
);
}
static FromRGBA(rgba: number) {
return Color.FromARGB(ColorUtilities.RGBAToARGB(rgba));
}
public toRGBA() {
return (this.r * 255) << 24 | (this.g * 255) << 16 | (this.b * 255) << 8 | (this.a * 255)
}
public toCSSStyle() {
return ColorUtilities.rgbaToCSSStyle(this.toRGBA());
}
set (other: Color) {
this.r = other.r;
this.g = other.g;
this.b = other.b;
this.a = other.a;
}
public static Red = new Color(1, 0, 0, 1);
public static Green = new Color(0, 1, 0, 1);
public static Blue = new Color(0, 0, 1, 1);
public static None = new Color(0, 0, 0, 0);
public static White = new Color(1, 1, 1, 1);
public static Black = new Color(0, 0, 0, 1);
private static colorCache: { [color: string]: Color } = {};
public static randomColor(alpha: number = 1): Color {
return new Color(Math.random(), Math.random(), Math.random(), alpha);
}
public static parseColor(color: string) {
if (!Color.colorCache) {
Color.colorCache = Object.create(null);
}
if (Color.colorCache[color]) {
return Color.colorCache[color];
}
// TODO: Obviously slow, but it will do for now.
var span = document.createElement('span');
document.body.appendChild(span);
span.style.backgroundColor = color;
var rgb = getComputedStyle(span).backgroundColor;
document.body.removeChild(span);
var m = /^rgb\((\d+), (\d+), (\d+)\)$/.exec(rgb);
if (!m) m = /^rgba\((\d+), (\d+), (\d+), ([\d.]+)\)$/.exec(rgb);
var result = new Color(0, 0, 0, 0);
result.r = parseFloat(m[1]) / 255;
result.g = parseFloat(m[2]) / 255;
result.b = parseFloat(m[3]) / 255;
result.a = m[4] ? parseFloat(m[4]) / 255 : 1;
return Color.colorCache[color] = result;
}
}
export module ColorUtilities {
export function RGBAToARGB(rgba: number): number {
return ((rgba >> 8) & 0x00ffffff) | ((rgba & 0xff) << 24);
}
export function ARGBToRGBA(argb: number): number {
return argb << 8 | ((argb >> 24) & 0xff);
}
export function rgbaToCSSStyle(color: number): string {
return StringUtilities.concat9('rgba(', color >> 24 & 0xff, ',', color >> 16 & 0xff, ',', color >> 8 & 0xff, ',', (color & 0xff) / 0xff, ')');
}
export function cssStyleToRGBA(style: string) {
if (style[0] === "#") {
if (style.length === 7) {
var value = parseInt(style.substring(1), 16);
return (value << 8) | 0xff;
}
} else if (style[0] === "r") {
// We don't parse all types of rgba(....) color styles. We only handle the
// ones we generate ourselves.
var values = style.substring(5, style.length - 1).split(",");
var r = parseInt(values[0]);
var g = parseInt(values[1]);
var b = parseInt(values[2]);
var a = parseFloat(values[3]);
return (r & 0xff) << 24 |
(g & 0xff) << 16 |
(b & 0xff) << 8 |
((a * 255) & 0xff);
}
return 0xff0000ff; // Red
}
export function hexToRGB(color: string): number {
return parseInt(color.slice(1), 16);
}
export function rgbToHex(color: number): string {
return '#' + ('000000' + (color >>> 0).toString(16)).slice(-6);
}
export function isValidHexColor(value: any): boolean {
return /^#([A-Fa-f0-9]{6}|[A-Fa-f0-9]{3})$/.test(value);
}
export function clampByte(value: number) {
return Math.max(0, Math.min(255, value));
}
/**
* Unpremultiplies the given |pARGB| color value.
*/
export function unpremultiplyARGB(pARGB: number) {
var b = (pARGB >> 0) & 0xff;
var g = (pARGB >> 8) & 0xff;
var r = (pARGB >> 16) & 0xff;
var a = (pARGB >> 24) & 0xff;
r = Math.imul(255, r) / a & 0xff;
g = Math.imul(255, g) / a & 0xff;
b = Math.imul(255, b) / a & 0xff;
return a << 24 | r << 16 | g << 8 | b;
}
/**
* Premultiplies the given |pARGB| color value.
*/
export function premultiplyARGB(uARGB: number) {
var b = (uARGB >> 0) & 0xff;
var g = (uARGB >> 8) & 0xff;
var r = (uARGB >> 16) & 0xff;
var a = (uARGB >> 24) & 0xff;
r = ((Math.imul(r, a) + 127) / 255) | 0;
g = ((Math.imul(g, a) + 127) / 255) | 0;
b = ((Math.imul(b, a) + 127) / 255) | 0;
return a << 24 | r << 16 | g << 8 | b;
}
var premultiplyTable: Uint8Array;
/**
* All possible alpha values and colors 256 * 256 = 65536 entries. Experiments
* indicate that doing unpremultiplication this way is roughly 5x faster.
*
* To lookup a color |c| in the table at a given alpha value |a| use:
* |(a << 8) + c| to compute the index. This layout order was chosen to make
* table lookups cache friendly, it actually makes a difference.
*
* TODO: Figure out if memory / speed tradeoff is worth it.
*/
var unpremultiplyTable: Uint8Array;
/**
* Make sure to call this before using the |unpremultiplyARGBUsingTableLookup| or
* |premultiplyARGBUsingTableLookup| functions. We want to execute this lazily so
* we don't incur any startup overhead.
*/
export function ensureUnpremultiplyTable() {
if (!unpremultiplyTable) {
unpremultiplyTable = new Uint8Array(256 * 256);
for (var c = 0; c < 256; c++) {
for (var a = 0; a < 256; a++) {
unpremultiplyTable[(a << 8) + c] = Math.imul(255, c) / a;
}
}
}
}
export function tableLookupUnpremultiplyARGB(pARGB): number {
pARGB = pARGB | 0;
var a = (pARGB >> 24) & 0xff;
if (a === 0) {
return 0;
} else if (a === 0xff) {
return pARGB;
}
var b = (pARGB >> 0) & 0xff;
var g = (pARGB >> 8) & 0xff;
var r = (pARGB >> 16) & 0xff;
var o = a << 8;
var T = unpremultiplyTable;
r = T[o + r];
g = T[o + g];
b = T[o + b];
return a << 24 | r << 16 | g << 8 | b;
}
/**
* The blending equation for unpremultiplied alpha is:
*
* (src.rgb * src.a) + (dst.rgb * (1 - src.a))
*
* For premultiplied alpha src.rgb and dst.rgb are already
* premultiplied by alpha, so the equation becomes:
*
* src.rgb + (dst.rgb * (1 - src.a))
*
* TODO: Not sure what to do about the dst.rgb which is
* premultiplied by its alpah, but this appears to work.
*
* We use the "double blend trick" (http://stereopsis.com/doubleblend.html) to
* compute GA and BR without unpacking them.
*/
export function blendPremultipliedBGRA(tpBGRA: number, spBGRA: number) {
var sA = spBGRA & 0xff;
var sGA = spBGRA & 0x00ff00ff;
var sBR = spBGRA >> 8 & 0x00ff00ff;
var tGA = tpBGRA & 0x00ff00ff;
var tBR = tpBGRA >> 8 & 0x00ff00ff;
var A = 256 - sA;
tGA = Math.imul(tGA, A) >> 8;
tBR = Math.imul(tBR, A) >> 8;
return ((sBR + tBR & 0x00ff00ff) << 8) | (sGA + tGA & 0x00ff00ff);
}
import swap32 = IntegerUtilities.swap32;
export function convertImage(sourceFormat: ImageType, targetFormat: ImageType, source: Int32Array, target: Int32Array) {
if (source !== target) {
release || Debug.assert(source.buffer !== target.buffer, "Can't handle overlapping views.");
}
var length = source.length;
if (sourceFormat === targetFormat) {
if (source === target) {
return;
}
for (var i = 0; i < length; i++) {
target[i] = source[i];
}
return;
}
// enterTimeline("convertImage", ImageType[sourceFormat] + " to " + ImageType[targetFormat] + " (" + memorySizeToString(source.length));
if (sourceFormat === ImageType.PremultipliedAlphaARGB &&
targetFormat === ImageType.StraightAlphaRGBA) {
ColorUtilities.ensureUnpremultiplyTable();
for (var i = 0; i < length; i++) {
var pBGRA = source[i];
var a = pBGRA & 0xff;
if (a === 0) {
target[i] = 0;
} else if (a === 0xff) {
target[i] = (pBGRA & 0xff) << 24 | ((pBGRA >> 8) & 0x00ffffff);
} else {
var b = (pBGRA >> 24) & 0xff;
var g = (pBGRA >> 16) & 0xff;
var r = (pBGRA >> 8) & 0xff;
var o = a << 8;
var T = unpremultiplyTable;
r = T[o + r];
g = T[o + g];
b = T[o + b];
target[i] = a << 24 | b << 16 | g << 8 | r;
}
}
} else if (sourceFormat === ImageType.StraightAlphaARGB &&
targetFormat === ImageType.StraightAlphaRGBA) {
for (var i = 0; i < length; i++) {
target[i] = swap32(source[i]);
}
} else if (sourceFormat === ImageType.StraightAlphaRGBA &&
targetFormat === ImageType.PremultipliedAlphaARGB) {
for (var i = 0; i < length; i++) {
var uABGR = source[i];
var uARGB = (uABGR & 0xFF00FF00) | // A_G_
(uABGR >> 16) & 0xff | // A_GB
(uABGR & 0xff) << 16; // ARGR
target[i] = swap32(premultiplyARGB(uARGB));
}
} else {
Debug.somewhatImplemented("Image Format Conversion: " + ImageType[sourceFormat] + " -> " + ImageType[targetFormat]);
// Copy the buffer over for now, we should at least get some image output.
for (var i = 0; i < length; i++) {
target[i] = source[i];
}
}
// leaveTimeline("convertImage");
}
}
/**
* Simple pool allocator for ArrayBuffers. This reduces memory usage in data structures
* that resize buffers.
*/
export class ArrayBufferPool {
private _list: ArrayBuffer [];
private _maxSize: number;
private static _enabled = true;
/**
* Creates a pool that manages a pool of a |maxSize| number of array buffers.
*/
constructor(maxSize: number = 32) {
this._list = [];
this._maxSize = maxSize;
}
/**
* Creates or reuses an existing array buffer that is at least the
* specified |length|.
*/
public acquire(length: number): ArrayBuffer {
if (ArrayBufferPool._enabled) {
var list = this._list;
for (var i = 0; i < list.length; i++) {
var buffer = list[i];
if (buffer.byteLength >= length) {
list.splice(i, 1);
return buffer;
}
}
}
return new ArrayBuffer(length);
}
/**
* Releases an array buffer that is no longer needed back to the pool.
*/
public release(buffer: ArrayBuffer) {
if (ArrayBufferPool._enabled) {
var list = this._list;
release || Debug.assert(ArrayUtilities.indexOf(list, buffer) < 0);
if (list.length === this._maxSize) {
list.shift();
}
list.push(buffer);
}
}
/**
* Resizes a Uint8Array to have the given length.
*/
public ensureUint8ArrayLength(array: Uint8Array, length: number): Uint8Array {
if (array.length >= length) {
return array;
}
var newLength = Math.max(array.length + length, ((array.length * 3) >> 1) + 1);
var newArray = new Uint8Array(this.acquire(newLength), 0, newLength);
newArray.set(array);
this.release(array.buffer);
return newArray;
}
/**
* Resizes a Float64Array to have the given length.
*/
public ensureFloat64ArrayLength(array: Float64Array, length: number): Float64Array {
if (array.length >= length) {
return array;
}
var newLength = Math.max(array.length + length, ((array.length * 3) >> 1) + 1);
var newArray = new Float64Array(this.acquire(newLength * Float64Array.BYTES_PER_ELEMENT), 0, newLength);
newArray.set(array);
this.release(array.buffer);
return newArray;
}
}
export module Telemetry {
export enum Feature {
EXTERNAL_INTERFACE_FEATURE = 1,
CLIPBOARD_FEATURE = 2,
SHAREDOBJECT_FEATURE = 3,
VIDEO_FEATURE = 4,
SOUND_FEATURE = 5,
NETCONNECTION_FEATURE = 6
}
export enum ErrorTypes {
AVM1_ERROR = 1,
AVM2_ERROR = 2
}
export var instance: ITelemetryService;
}
export interface ITelemetryService {
reportTelemetry(data: any);
}
export interface FileLoadingRequest {
url: string;
data: any;
}
export interface FileLoadingProgress {
bytesLoaded: number;
bytesTotal: number;
}
export interface FileLoadingSession {
onopen?: () => void;
onclose?: () => void;
onprogress?: (data: any, progressStatus: FileLoadingProgress) => void;
onhttpstatus?: (location: string, httpStatus: number, httpHeaders: any) => void;
onerror?: (e) => void;
open(request: FileLoadingRequest);
}
export interface IFileLoadingService {
createSession(): FileLoadingSession;
setBaseUrl(url: string);
resolveUrl(url: string): string;
navigateTo(url: string, target: string);
}
export module FileLoadingService {
export var instance: IFileLoadingService;
}
export interface IExternalInterfaceService {
enabled: boolean;
initJS(callback: (functionName: string, args: any[]) => any);
registerCallback(functionName: string);
unregisterCallback(functionName: string);
eval(expression): any;
call(request): any;
getId(): string;
}
export module ExternalInterfaceService {
export var instance: IExternalInterfaceService = {
enabled: false,
initJS(callback: (functionName: string, args: any[]) => any) { },
registerCallback(functionName: string) { },
unregisterCallback(functionName: string) { },
eval(expression: string): any { },
call(request: string): any { },
getId(): string { return null; }
};
}
export class ClipboardService {
public static instance: ClipboardService = null;
public setClipboard(data: string): void {
Debug.abstractMethod("public ClipboardService::setClipboard");
}
}
export class Callback {
private _queues: any;
constructor () {
this._queues = {};
}
public register(type, callback) {
Debug.assert(type);
Debug.assert(callback);
var queue = this._queues[type];
if (queue) {
if (queue.indexOf(callback) > -1) {
return;
}
} else {
queue = this._queues[type] = [];
}
queue.push(callback);
}
public unregister(type: string, callback) {
Debug.assert(type);
Debug.assert(callback);
var queue = this._queues[type];
if (!queue) {
return;
}
var i = queue.indexOf(callback);
if (i !== -1) {
queue.splice(i, 1);
}
if (queue.length === 0) {
this._queues[type] = null;
}
}
public notify(type: string, args) {
var queue = this._queues[type];
if (!queue) {
return;
}
queue = queue.slice();
var args = Array.prototype.slice.call(arguments, 0);
for (var i = 0; i < queue.length; i++) {
var callback = queue[i];
callback.apply(null, args);
}
}
public notify1(type: string, value) {
var queue = this._queues[type];
if (!queue) {
return;
}
queue = queue.slice();
for (var i = 0; i < queue.length; i++) {
var callback = queue[i];
callback(type, value);
}
}
}
export enum ImageType {
None,
/**
* Premultiplied ARGB (byte-order).
*/
PremultipliedAlphaARGB,
/**
* Unpremultiplied ARGB (byte-order).
*/
StraightAlphaARGB,
/**
* Unpremultiplied RGBA (byte-order), this is what putImageData expects.
*/
StraightAlphaRGBA,
JPEG,
PNG,
GIF
}
}
/**
* Extend builtin prototypes.
*
* TODO: Go through the code and remove all references to these.
*/
(function () {
function extendBuiltin(prototype, property, value) {
if (!prototype[property]) {
Object.defineProperty(prototype, property,
{ value: value,
writable: true,
configurable: true,
enumerable: false });
}
}
function removeColors(s) {
return s.replace(/\033\[[0-9]*m/g, "");
}
extendBuiltin(String.prototype, "padRight", function (c, n) {
var str = this;
var length = removeColors(str).length;
if (!c || length >= n) {
return str;
}
var max = (n - length) / c.length;
for (var i = 0; i < max; i++) {
str += c;
}
return str;
});
extendBuiltin(String.prototype, "padLeft", function (c, n) {
var str = this;
var length = str.length;
if (!c || length >= n) {
return str;
}
var max = (n - length) / c.length;
for (var i = 0; i < max; i++) {
str = c + str;
}
return str;
});
extendBuiltin(String.prototype, "trim", function () {
return this.replace(/^\s+|\s+$/g,"");
});
extendBuiltin(String.prototype, "endsWith", function (str) {
return this.indexOf(str, this.length - str.length) !== -1;
});
extendBuiltin(Array.prototype, "replace", function(x, y) {
if (x === y) {
return 0;
}
var count = 0;
for (var i = 0; i < this.length; i++) {
if (this[i] === x) {
this[i] = y;
count ++;
}
}
return count;
});
})();
Ссылка в новой задаче Показать git blame Копировать постоянную ссылку