diff --git a/engine_support/egret/lib/framework.d.ts b/engine_support/egret/lib/framework.d.ts deleted file mode 100644 index 409c7e37..00000000 --- a/engine_support/egret/lib/framework.d.ts +++ /dev/null @@ -1,4767 +0,0 @@ -declare module es { - /** - * 全局核心类 - */ - class Core { - /** - * 核心发射器。只发出核心级别的事件 - */ - static emitter: Emitter; - /** - * 启用/禁用焦点丢失时的暂停。如果为真,则不调用更新或渲染方法 - */ - static pauseOnFocusLost: boolean; - /** - * 是否启用调试渲染 - */ - static debugRenderEndabled: boolean; - /** - * 简化对内部类的全局内容实例的访问 - */ - private static _instance; - /** - * 用于确定是否应该使用EntitySystems - */ - static entitySystemsEnabled: boolean; - /** - * 是否正在debug模式 - * 仅允许在create时进行更改 - */ - readonly debug: boolean; - _nextScene: Scene; - /** - * 用于凝聚GraphicsDeviceReset事件 - */ - _graphicsDeviceChangeTimer: ITimer; - /** - * 全局访问系统 - */ - _globalManagers: GlobalManager[]; - _coroutineManager: CoroutineManager; - _timerManager: TimerManager; - private constructor(); - /** - * 提供对单例/游戏实例的访问 - * @constructor - */ - static readonly Instance: Core; - _frameCounterElapsedTime: number; - _frameCounter: number; - _totalMemory: number; - _titleMemory: (totalMemory: number, frameCounter: number) => void; - _scene: Scene; - /** - * 当前活动的场景。注意,如果设置了该设置,在更新结束之前场景实际上不会改变 - */ - /** - * 当前活动的场景。注意,如果设置了该设置,在更新结束之前场景实际上不会改变 - * @param value - */ - static scene: Scene; - /** - * 默认实现创建核心 - */ - static create(debug?: boolean): Core; - /** - * 添加一个全局管理器对象,它的更新方法将调用场景前的每一帧。 - * @param manager - */ - static registerGlobalManager(manager: es.GlobalManager): void; - /** - * 删除全局管理器对象 - * @param manager - */ - static unregisterGlobalManager(manager: es.GlobalManager): void; - /** - * 获取类型为T的全局管理器 - * @param type - */ - static getGlobalManager(type: any): T; - /** - * 启动一个coroutine。Coroutine可以将number延时几秒或延时到其他startCoroutine.Yielding - * null将使coroutine在下一帧被执行。 - * @param enumerator - */ - static startCoroutine(enumerator: any): ICoroutine; - /** - * 调度一个一次性或重复的计时器,该计时器将调用已传递的动作 - * @param timeInSeconds - * @param repeats - * @param context - * @param onTime - */ - static schedule(timeInSeconds: number, repeats: boolean, context: any, onTime: (timer: ITimer) => void): Timer; - startDebugUpdate(): void; - endDebugUpdate(): void; - startDebugDraw(): void; - /** - * 在一个场景结束后,下一个场景开始之前调用 - */ - onSceneChanged(): void; - protected initialize(): void; - protected update(currentTime?: number): Promise; - } -} -declare module es { - enum LogType { - error = 0, - warn = 1, - log = 2, - info = 3, - trace = 4 - } - class Debug { - static warnIf(condition: boolean, format: string, ...args: any[]): void; - static warn(format: string, ...args: any[]): void; - static error(format: string, ...args: any[]): void; - static log(type: LogType, format: string, ...args: any[]): void; - } -} -declare module es { - /** - * 我们在这里存储了各种系统的默认颜色,如对撞机调试渲染、Debug.drawText等。 - * 命名方式尽可能采用CLASS-THING,以明确它的使用位置 - */ - class DebugDefault { - static debugText: number; - static colliderBounds: number; - static colliderEdge: number; - static colliderPosition: number; - static colliderCenter: number; - static renderableBounds: number; - static renderableCenter: number; - static verletParticle: number; - static verletConstraintEdge: number; - } -} -declare module es { - class Insist { - static fail(message?: string, ...args: any[]): void; - static isTrue(condition: boolean, message?: string, ...args: any[]): void; - static isFalse(condition: boolean, message?: string, ...args: any[]): void; - static isNull(obj: any, message?: string, ...args: any[]): void; - static isNotNull(obj: any, message?: string, ...args: any[]): void; - static areEqual(first: any, second: any, message: string, ...args: any[]): void; - static areNotEqual(first: any, second: any, message: string, ...args: any[]): void; - } -} -declare module es { - /** - * 执行顺序 - * - onAddedToEntity - * - OnEnabled - * - * 删除执行顺序 - * - onRemovedFromEntity - */ - abstract class Component { - /** - * 此组件附加的实体 - */ - entity: Entity; - /** - * 快速访问 this.entity.transform - */ - readonly transform: Transform; - private _enabled; - /** - * 如果组件和实体都已启用,则为。当启用该组件时,将调用该组件的生命周期方法。状态的改变会导致调用onEnabled/onDisable。 - */ - /** - * 如果组件和实体都已启用,则为。当启用该组件时,将调用该组件的生命周期方法。状态的改变会导致调用onEnabled/onDisable。 - * @param value - */ - enabled: boolean; - private _updateOrder; - /** 更新此实体上组件的顺序 */ - /** 更新此实体上组件的顺序 */ - updateOrder: number; - /** - * 当此组件已分配其实体,但尚未添加到实体的活动组件列表时调用。有用的东西,如物理组件,需要访问转换来修改碰撞体的属性。 - */ - initialize(): void; - /** - * 在提交所有挂起的组件更改后,将该组件添加到场景时调用。此时,设置了实体字段和实体。场景也设定好了。 - */ - onAddedToEntity(): void; - /** - * 当此组件从其实体中移除时调用。在这里做所有的清理工作。 - */ - onRemovedFromEntity(): void; - /** - * 当实体的位置改变时调用。这允许组件知道它们由于父实体的移动而移动了。 - * @param comp - */ - onEntityTransformChanged(comp: transform.Component): void; - /** - *当父实体或此组件启用时调用 - */ - onEnabled(): void; - /** - * 禁用父实体或此组件时调用 - */ - onDisabled(): void; - setEnabled(isEnabled: boolean): this; - setUpdateOrder(updateOrder: number): this; - } -} -declare module es { - enum CoreEvents { - /** - * 当场景发生变化时触发 - */ - sceneChanged = 0, - /** - * 每帧更新事件 - */ - frameUpdated = 1 - } -} -declare module es { - class EntityComparer implements IComparer { - compare(self: Entity, other: Entity): number; - } - class Entity implements IEqualityComparable { - static _idGenerator: number; - static entityComparer: IComparer; - /** - * 当前实体所属的场景 - */ - scene: Scene; - /** - * 实体名称。用于在场景范围内搜索实体 - */ - name: string; - /** - * 此实体的唯一标识 - */ - readonly id: number; - /** - * 封装实体的位置/旋转/缩放,并允许设置一个高层结构 - */ - readonly transform: Transform; - /** - * 当前附加到此实体的所有组件的列表 - */ - readonly components: ComponentList; - /** - * 指定应该调用这个entity update方法的频率。1表示每一帧,2表示每一帧,以此类推 - */ - updateInterval: number; - /** - * 返回一个BitSet实例,包含实体拥有的组件的位 - */ - componentBits: BitSet; - constructor(name: string); - _isDestroyed: boolean; - /** - * 如果调用了destroy,那么在下一次处理实体之前这将一直为true - */ - readonly isDestroyed: boolean; - private _tag; - /** - * 你可以随意使用。稍后可以使用它来查询场景中具有特定标记的所有实体 - */ - /** - * 你可以随意使用。稍后可以使用它来查询场景中具有特定标记的所有实体 - * @param value - */ - tag: number; - private _enabled; - /** - * 启用/禁用实体。当禁用碰撞器从物理系统和组件中移除时,方法将不会被调用 - */ - /** - * 启用/禁用实体。当禁用碰撞器从物理系统和组件中移除时,方法将不会被调用 - * @param value - */ - enabled: boolean; - private _updateOrder; - /** - * 更新此实体的顺序。updateOrder还用于对scene.entities上的标签列表进行排序 - */ - /** - * 更新此实体的顺序。updateOrder还用于对scene.entities上的标签列表进行排序 - * @param value - */ - updateOrder: number; - parent: Transform; - readonly childCount: number; - position: Vector2; - localPosition: Vector2; - rotation: number; - rotationDegrees: number; - localRotation: number; - localRotationDegrees: number; - scale: Vector2; - localScale: Vector2; - readonly worldInverseTransform: Matrix2D; - readonly localToWorldTransform: Matrix2D; - readonly worldToLocalTransform: Matrix2D; - onTransformChanged(comp: transform.Component): void; - setParent(parent: Entity): any; - setParent(parent: Transform): any; - setPosition(x: number, y: number): this; - setLocalPosition(localPosition: Vector2): this; - setRotation(radians: number): this; - setRotationDegrees(degrees: number): this; - setLocalRotation(radians: number): this; - setLocalRotationDegrees(degrees: number): this; - setScale(scale: number): any; - setScale(scale: Vector2): any; - setLocalScale(scale: number): any; - setLocalScale(scale: Vector2): any; - /** - * 设置实体的标记 - * @param tag - */ - setTag(tag: number): Entity; - /** - * 设置实体的启用状态。当禁用碰撞器从物理系统和组件中移除时,方法将不会被调用 - * @param isEnabled - */ - setEnabled(isEnabled: boolean): this; - /** - * 设置此实体的更新顺序。updateOrder还用于对scene.entities上的标签列表进行排序 - * @param updateOrder - */ - setUpdateOrder(updateOrder: number): this; - /** - * 从场景中删除实体并销毁所有子元素 - */ - destroy(): void; - /** - * 将实体从场景中分离。下面的生命周期方法将被调用在组件上:OnRemovedFromEntity - */ - detachFromScene(): void; - /** - * 将一个先前分离的实体附加到一个新的场景 - * @param newScene - */ - attachToScene(newScene: Scene): void; - /** - * 在提交了所有挂起的实体更改后,将此实体添加到场景时调用 - */ - onAddedToScene(): void; - /** - * 当此实体从场景中删除时调用 - */ - onRemovedFromScene(): void; - /** - * 每帧进行调用进行更新组件 - */ - update(): void; - /** - * 创建组件的新实例。返回实例组件 - * @param componentType - */ - createComponent(componentType: new () => T): T; - /** - * 将组件添加到组件列表中。返回组件。 - * @param component - */ - addComponent(component: T): T; - /** - * 获取类型T的第一个组件并返回它。如果没有找到组件,则返回null。 - * @param type - */ - getComponent(type: any): T; - /** - * 检查实体是否具有该组件 - * @param type - */ - hasComponent(type: any): boolean; - /** - * 获取类型T的第一个组件并返回它。如果没有找到组件,将创建组件。 - * @param type - */ - getOrCreateComponent(type: any): T; - /** - * 获取typeName类型的所有组件,但不使用列表分配 - * @param typeName - * @param componentList - */ - getComponents(typeName: any, componentList?: any): any; - /** - * 从组件列表中删除组件 - * @param component - */ - removeComponent(component: Component): void; - /** - * 从组件列表中删除类型为T的第一个组件 - * @param type - */ - removeComponentForType(type: any): boolean; - /** - * 从实体中删除所有组件 - */ - removeAllComponents(): void; - compareTo(other: Entity): number; - equals(other: Entity): boolean; - getHashCode(): number; - toString(): string; - } -} -declare module es { - /** 2d 向量 */ - class Vector2 implements IEquatable { - x: number; - y: number; - /** - * 从两个值构造一个带有X和Y的二维向量。 - * @param x 二维空间中的x坐标 - * @param y 二维空间的y坐标 - */ - constructor(x?: number, y?: number); - static readonly zero: Vector2; - static readonly one: Vector2; - static readonly unitX: Vector2; - static readonly unitY: Vector2; - /** - * - * @param value1 - * @param value2 - */ - static add(value1: Vector2, value2: Vector2): Vector2; - /** - * - * @param value1 - * @param value2 - */ - static divide(value1: Vector2, value2: Vector2): Vector2; - /** - * - * @param value1 - * @param value2 - */ - static multiply(value1: Vector2, value2: Vector2): Vector2; - /** - * - * @param value1 - * @param value2 - */ - static subtract(value1: Vector2, value2: Vector2): Vector2; - /** - * 创建一个新的Vector2 - * 它包含来自另一个向量的标准化值。 - * @param value - */ - static normalize(value: Vector2): Vector2; - /** - * 返回两个向量的点积 - * @param value1 - * @param value2 - */ - static dot(value1: Vector2, value2: Vector2): number; - /** - * 返回两个向量之间距离的平方 - * @param value1 - * @param value2 - */ - static distanceSquared(value1: Vector2, value2: Vector2): number; - /** - * 将指定的值限制在一个范围内 - * @param value1 - * @param min - * @param max - */ - static clamp(value1: Vector2, min: Vector2, max: Vector2): Vector2; - /** - * 创建一个新的Vector2,其中包含指定向量的线性插值 - * @param value1 第一个向量 - * @param value2 第二个向量 - * @param amount 加权值(0.0-1.0之间) - * @returns 指定向量的线性插值结果 - */ - static lerp(value1: Vector2, value2: Vector2, amount: number): Vector2; - /** - * 创建一个新的Vector2,该Vector2包含了通过指定的Matrix进行的二维向量变换。 - * @param position - * @param matrix - */ - static transform(position: Vector2, matrix: Matrix2D): Vector2; - /** - * 返回两个向量之间的距离 - * @param value1 - * @param value2 - * @returns 两个向量之间的距离 - */ - static distance(value1: Vector2, value2: Vector2): number; - /** - * 返回两个向量之间的角度,单位是度数 - * @param from - * @param to - */ - static angle(from: Vector2, to: Vector2): number; - /** - * 创建一个包含指定向量反转的新Vector2 - * @param value - * @returns 矢量反演的结果 - */ - static negate(value: Vector2): Vector2; - /** - * - * @param value - */ - add(value: Vector2): Vector2; - /** - * - * @param value - */ - divide(value: Vector2): Vector2; - /** - * - * @param value - */ - multiply(value: Vector2): Vector2; - /** - * 从当前Vector2减去一个Vector2 - * @param value 要减去的Vector2 - * @returns 当前Vector2 - */ - subtract(value: Vector2): this; - /** - * 将这个Vector2变成一个方向相同的单位向量 - */ - normalize(): void; - /** 返回它的长度 */ - length(): number; - /** - * 返回该Vector2的平方长度 - * @returns 这个Vector2的平方长度 - */ - lengthSquared(): number; - /** - * 四舍五入X和Y值 - */ - round(): Vector2; - /** - * 返回以自己为中心点的左右角,单位为度 - * @param left - * @param right - */ - angleBetween(left: Vector2, right: Vector2): number; - /** - * 比较当前实例是否等于指定的对象 - * @param other 要比较的对象 - * @returns 如果实例相同true 否则false - */ - equals(other: Vector2 | object): boolean; - clone(): Vector2; - } -} -declare module es { - enum SceneResolutionPolicy { - /** - * 默认情况下,RenderTarget与屏幕大小匹配。RenderTarget与屏幕大小相匹配 - */ - none = 0, - /** - * 该应用程序采用最适合设计分辨率的宽度和高度 - */ - bestFit = 1 - } - /** 场景 */ - class Scene { - /** - * 这个场景中的实体列表 - */ - readonly entities: EntityList; - /** - * 管理所有实体处理器 - */ - readonly entityProcessors: EntityProcessorList; - readonly _sceneComponents: SceneComponent[]; - private _didSceneBegin; - constructor(); - /** - * 在场景子类中重写这个,然后在这里进行加载。 - * 在场景设置好之后,但在调用begin之前,从contructor中调用这个函数 - */ - initialize(): void; - /** - * 当Core将这个场景设置为活动场景时,这个将被调用 - */ - onStart(): void; - /** - * 在场景子类中重写这个,并在这里做任何必要的卸载。 - * 当Core把这个场景从活动槽中移除时,这个被调用。 - */ - unload(): void; - begin(): void; - end(): void; - update(): void; - /** - * 向组件列表添加并返回SceneComponent - * @param component - */ - addSceneComponent(component: T): T; - /** - * 获取类型为T的第一个SceneComponent并返回它。如果没有找到组件,则返回null。 - * @param type - */ - getSceneComponent(type: any): T; - /** - * 获取类型为T的第一个SceneComponent并返回它。如果没有找到SceneComponent,则将创建SceneComponent。 - * @param type - */ - getOrCreateSceneComponent(type: any): T; - /** - * 从SceneComponents列表中删除一个SceneComponent - * @param component - */ - removeSceneComponent(component: SceneComponent): void; - /** - * 将实体添加到此场景,并返回它 - * @param name - */ - createEntity(name: string): Entity; - /** - * 在场景的实体列表中添加一个实体 - * @param entity - */ - addEntity(entity: Entity): Entity; - /** - * 从场景中删除所有实体 - */ - destroyAllEntities(): void; - /** - * 搜索并返回第一个具有名称的实体 - * @param name - */ - findEntity(name: string): Entity; - /** - * 返回具有给定标记的所有实体 - * @param tag - */ - findEntitiesWithTag(tag: number): Entity[]; - /** - * 返回类型为T的所有实体 - * @param type - */ - entitiesOfType(type: any): T[]; - /** - * 返回第一个启用加载的类型为T的组件 - * @param type - */ - findComponentOfType(type: any): T; - /** - * 返回类型为T的所有已启用已加载组件的列表 - * @param type - */ - findComponentsOfType(type: any): T[]; - /** - * 在场景中添加一个EntitySystem处理器 - * @param processor 处理器 - */ - addEntityProcessor(processor: EntitySystem): EntitySystem; - /** - * 从场景中删除EntitySystem处理器 - * @param processor - */ - removeEntityProcessor(processor: EntitySystem): void; - /** - * 获取EntitySystem处理器 - */ - getEntityProcessor(): T; - } -} -declare module transform { - enum Component { - position = 0, - scale = 1, - rotation = 2 - } -} -declare module es { - enum DirtyType { - clean = 0, - positionDirty = 1, - scaleDirty = 2, - rotationDirty = 4 - } - class Transform { - /** 与此转换关联的实体 */ - readonly entity: Entity; - hierarchyDirty: DirtyType; - _localDirty: boolean; - _localPositionDirty: boolean; - _localScaleDirty: boolean; - _localRotationDirty: boolean; - _positionDirty: boolean; - _worldToLocalDirty: boolean; - _worldInverseDirty: boolean; - /** - * 值会根据位置、旋转和比例自动重新计算 - */ - _localTransform: Matrix2D; - /** - * 值将自动从本地和父矩阵重新计算。 - */ - _worldTransform: Matrix2D; - _rotationMatrix: Matrix2D; - _translationMatrix: Matrix2D; - _scaleMatrix: Matrix2D; - _children: Transform[]; - constructor(entity: Entity); - /** - * 这个转换的所有子元素 - */ - readonly childCount: number; - /** - * 变换在世界空间的旋转度 - */ - /** - * 变换在世界空间的旋转度 - * @param value - */ - rotationDegrees: number; - /** - * 旋转相对于父变换旋转的角度 - */ - /** - * 旋转相对于父变换旋转的角度 - * @param value - */ - localRotationDegrees: number; - readonly localToWorldTransform: Matrix2D; - _parent: Transform; - /** - * 获取此转换的父转换 - */ - /** - * 设置此转换的父转换 - * @param value - */ - parent: Transform; - _worldToLocalTransform: Matrix2D; - readonly worldToLocalTransform: Matrix2D; - _worldInverseTransform: Matrix2D; - readonly worldInverseTransform: Matrix2D; - _position: Vector2; - /** - * 变换在世界空间中的位置 - */ - /** - * 变换在世界空间中的位置 - * @param value - */ - position: Vector2; - _scale: Vector2; - /** - * 变换在世界空间的缩放 - */ - /** - * 变换在世界空间的缩放 - * @param value - */ - scale: Vector2; - _rotation: number; - /** - * 在世界空间中以弧度旋转的变换 - */ - /** - * 变换在世界空间的旋转度 - * @param value - */ - rotation: number; - _localPosition: Vector2; - /** - * 转换相对于父转换的位置。如果转换没有父元素,则与transform.position相同 - */ - /** - * 转换相对于父转换的位置。如果转换没有父元素,则与transform.position相同 - * @param value - */ - localPosition: Vector2; - _localScale: Vector2; - /** - * 转换相对于父元素的比例。如果转换没有父元素,则与transform.scale相同 - */ - /** - * 转换相对于父元素的比例。如果转换没有父元素,则与transform.scale相同 - * @param value - */ - localScale: Vector2; - _localRotation: number; - /** - * 相对于父变换的旋转,变换的旋转。如果转换没有父元素,则与transform.rotation相同 - */ - /** - * 相对于父变换的旋转,变换的旋转。如果转换没有父元素,则与transform.rotation相同 - * @param value - */ - localRotation: number; - /** - * 返回在索引处的转换子元素 - * @param index - */ - getChild(index: number): Transform; - /** - * 设置此转换的父转换 - * @param parent - */ - setParent(parent: Transform): Transform; - /** - * 设置转换在世界空间中的位置 - * @param x - * @param y - */ - setPosition(x: number, y: number): Transform; - /** - * 设置转换相对于父转换的位置。如果转换没有父元素,则与transform.position相同 - * @param localPosition - */ - setLocalPosition(localPosition: Vector2): Transform; - /** - * 设置变换在世界空间的旋转度 - * @param radians - */ - setRotation(radians: number): Transform; - /** - * 设置变换在世界空间的旋转度 - * @param degrees - */ - setRotationDegrees(degrees: number): Transform; - /** - * 旋转精灵的顶部,使其朝向位置 - * @param pos - */ - lookAt(pos: Vector2): void; - /** - * 相对于父变换的旋转设置变换的旋转。如果转换没有父元素,则与transform.rotation相同 - * @param radians - */ - setLocalRotation(radians: number): this; - /** - * 相对于父变换的旋转设置变换的旋转。如果转换没有父元素,则与transform.rotation相同 - * @param degrees - */ - setLocalRotationDegrees(degrees: number): Transform; - /** - * 设置变换在世界空间中的缩放 - * @param scale - */ - setScale(scale: Vector2): Transform; - /** - * 设置转换相对于父对象的比例。如果转换没有父元素,则与transform.scale相同 - * @param scale - */ - setLocalScale(scale: Vector2): Transform; - /** - * 对精灵坐标进行四舍五入 - */ - roundPosition(): void; - updateTransform(): void; - setDirty(dirtyFlagType: DirtyType): void; - /** - * 从另一个transform属性进行拷贝 - * @param transform - */ - copyFrom(transform: Transform): void; - toString(): string; - } -} -declare module es { - /** - * 接口,当添加到一个Component时,只要Component和实体被启用,它就会在每个框架中调用更新方法。 - */ - interface IUpdatable { - enabled: boolean; - updateOrder: number; - update(): any; - } - /** - * 用于比较组件更新排序 - */ - class IUpdatableComparer implements IComparer { - compare(a: IUpdatable, b: IUpdatable): number; - } - var isIUpdatable: (props: any) => props is IUpdatable; -} -declare module es { - class SceneComponent implements IComparer { - /** - * 这个场景组件被附加到的场景 - */ - scene: Scene; - /** - * 如果启用了SceneComponent,则为true。状态的改变会导致调用onEnabled/onDisable。 - */ - /** - * 如果启用了SceneComponent,则为true。状态的改变会导致调用onEnabled/onDisable。 - * @param value - */ - enabled: boolean; - /** - * 更新此场景中SceneComponents的顺序 - */ - updateOrder: number; - _enabled: boolean; - /** - * 在启用此SceneComponent时调用 - */ - onEnabled(): void; - /** - * 当禁用此SceneComponent时调用 - */ - onDisabled(): void; - /** - * 当该SceneComponent从场景中移除时调用 - */ - onRemovedFromScene(): void; - /** - * 在实体更新之前每一帧调用 - */ - update(): void; - /** - * 启用/禁用这个SceneComponent - * @param isEnabled - */ - setEnabled(isEnabled: boolean): SceneComponent; - /** - * 设置SceneComponent的updateOrder并触发某种SceneComponent - * @param updateOrder - */ - setUpdateOrder(updateOrder: number): this; - compare(other: SceneComponent): number; - } -} -declare module es { - /** - * 请注意,这不是一个完整的、多迭代的物理系统!它可以用于简单的、街机风格的物理。 - * 这可以用于简单的,街机风格的物理学 - */ - class ArcadeRigidbody extends Component implements IUpdatable { - /** 这个刚体的质量。质量为0,则是一个不可移动的物体 */ - mass: number; - /** - * 0-1范围,其中0为无反弹,1为完全反射。 - */ - readonly elasticity: number; - elasticiy: number; - /** - * 0 - 1范围。0表示没有摩擦力,1表示物体会停止在原地 - */ - friction: number; - /** - * 0-9的范围。当发生碰撞时,沿碰撞面做直线运动时,如果其平方幅度小于glue摩擦力,则将碰撞设置为上限 - */ - glue: number; - /** - * 如果为真,则每一帧都会考虑到Physics.gravity - */ - shouldUseGravity: boolean; - /** - * 该刚体的速度 - */ - velocity: Vector2; - /** - * 质量为0的刚体被认为是不可移动的。改变速度和碰撞对它们没有影响 - */ - readonly isImmovable: boolean; - _mass: number; - _elasticity: number; - _friction: number; - _glue: number; - _inverseMass: number; - _collider: Collider; - constructor(); - /** - * 这个刚体的质量。质量为0,则是一个不可移动的物体 - * @param mass - */ - setMass(mass: number): ArcadeRigidbody; - /** - * 0-1范围,其中0为无反弹,1为完全反射。 - * @param value - */ - setElasticity(value: number): ArcadeRigidbody; - /** - * 0 - 1范围。0表示没有摩擦力,1表示物体会停止在原地 - * @param value - */ - setFriction(value: number): ArcadeRigidbody; - /** - * 0-9的范围。当发生碰撞时,沿碰撞面做直线运动时,如果其平方幅度小于glue摩擦力,则将碰撞设置为上限 - * @param value - */ - setGlue(value: number): ArcadeRigidbody; - /** - * 用刚体的质量给刚体加上一个瞬间的力脉冲。力是一个加速度,单位是每秒像素每秒。将力乘以100000,使数值使用更合理 - * @param force - */ - addImpulse(force: Vector2): void; - onAddedToEntity(): void; - update(): void; - /** - * 将两个重叠的刚体分开。也处理其中一个不可移动的情况 - * @param other - * @param minimumTranslationVector - */ - processOverlap(other: ArcadeRigidbody, minimumTranslationVector: Vector2): void; - /** - * 处理两个非重叠的刚体的碰撞。新的速度将根据情况分配给每个刚体 - * @param other - * @param minimumTranslationVector - */ - processCollision(other: ArcadeRigidbody, minimumTranslationVector: Vector2): void; - /** - * 给定两个物体和MTV之间的相对速度,本方法修改相对速度,使其成为碰撞响应 - * @param relativeVelocity - * @param minimumTranslationVector - * @param responseVelocity - */ - calculateResponseVelocity(relativeVelocity: Vector2, minimumTranslationVector: Vector2, responseVelocity?: Vector2): void; - } -} -declare module es { - /** - * 当添加到组件时,每当实体上的冲突器与另一个组件重叠/退出时,将调用这些方法。 - * ITriggerListener方法将在实现接口的触发器实体上的任何组件上调用。 - * 注意,这个接口只与Mover类一起工作 - */ - interface ITriggerListener { - /** - * 当碰撞器与触发碰撞器相交时调用。这是在触发碰撞器和触发碰撞器上调用的。 - * 移动必须由Mover/ProjectileMover方法处理,以使其自动工作。 - * @param other - * @param local - */ - onTriggerEnter(other: Collider, local: Collider): any; - /** - * 当另一个碰撞器离开触发碰撞器时调用 - * @param other - * @param local - */ - onTriggerExit(other: Collider, local: Collider): any; - } - class TriggerListenerHelper { - static getITriggerListener(entity: Entity, components: ITriggerListener[]): ITriggerListener[]; - } - var isITriggerListener: (props: any) => props is ITriggerListener; -} -declare module es { - /** - * 辅助类说明了一种处理移动的方法,它考虑了包括触发器在内的所有冲突。 - * ITriggerListener接口用于管理对移动过程中违反的任何触发器的回调。 - * 一个物体只能通过移动器移动。要正确报告触发器的move方法。 - * - * 请注意,多个移动者相互交互将多次调用ITriggerListener。 - */ - class Mover extends Component { - private _triggerHelper; - onAddedToEntity(): void; - /** - * 计算修改运动矢量的运动,以考虑移动时可能发生的碰撞 - * @param motion - * @param collisionResult - */ - calculateMovement(motion: Vector2, collisionResult: CollisionResult): boolean; - /** - * 将calculatemomovement应用到实体并更新triggerHelper - * @param motion - */ - applyMovement(motion: Vector2): void; - /** - * 通过调用calculateMovement和applyMovement来移动考虑碰撞的实体; - * @param motion - * @param collisionResult - */ - move(motion: Vector2, collisionResult: CollisionResult): boolean; - } -} -declare module es { - /** - * 移动时考虑到碰撞,只用于向任何ITriggerListeners报告。 - * 物体总是会全量移动,所以如果需要的话,由调用者在撞击时销毁它。 - */ - class ProjectileMover extends Component { - private _tempTriggerList; - private _collider; - onAddedToEntity(): void; - /** - * 在考虑到碰撞的情况下移动实体 - * @param motion - */ - move(motion: Vector2): boolean; - private notifyTriggerListeners; - } -} -declare module es { - abstract class Collider extends Component { - /** - * 对撞机的基本形状 - */ - shape: Shape; - /** - * 如果这个碰撞器是一个触发器,它将不会引起碰撞,但它仍然会触发事件 - */ - isTrigger: boolean; - /** - * 在处理冲突时,physicsLayer可以用作过滤器。Flags类有帮助位掩码的方法 - */ - physicsLayer: Ref; - /** - * 碰撞器在使用移动器移动时应该碰撞的层 - * 默认为所有层 - */ - collidesWithLayers: Ref; - /** - * 如果为true,碰撞器将根据附加的变换缩放和旋转 - */ - shouldColliderScaleAndRotateWithTransform: boolean; - /** - * 这个对撞机在物理系统注册时的边界。 - * 存储这个允许我们始终能够安全地从物理系统中移除对撞机,即使它在试图移除它之前已经被移动了。 - */ - registeredPhysicsBounds: Rectangle; - protected _colliderRequiresAutoSizing: boolean; - _localOffsetLength: number; - _isPositionDirty: boolean; - _isRotationDirty: boolean; - /** - * 标记来跟踪我们的实体是否被添加到场景中 - */ - protected _isParentEntityAddedToScene: any; - /** - * 标记来记录我们是否注册了物理系统 - */ - protected _isColliderRegistered: any; - /** - * 镖师碰撞器的绝对位置 - */ - readonly absolutePosition: Vector2; - /** - * 封装变换。如果碰撞器没和实体一起旋转 则返回transform.rotation - */ - readonly rotation: number; - readonly bounds: Rectangle; - protected _localOffset: Vector2; - /** - * 将localOffset添加到实体。获取碰撞器几何图形的最终位置。 - * 允许向一个实体添加多个碰撞器并分别定位,还允许你设置缩放/旋转 - */ - /** - * 将localOffset添加到实体。获取碰撞器几何图形的最终位置。 - * 允许向一个实体添加多个碰撞器并分别定位,还允许你设置缩放/旋转 - * @param value - */ - localOffset: Vector2; - /** - * 将localOffset添加到实体。获取碰撞器的最终位置。 - * 这允许您向一个实体添加多个碰撞器并分别定位它们。 - * @param offset - */ - setLocalOffset(offset: Vector2): Collider; - /** - * 如果为true,碰撞器将根据附加的变换缩放和旋转 - * @param shouldColliderScaleAndRotationWithTransform - */ - setShouldColliderScaleAndRotateWithTransform(shouldColliderScaleAndRotationWithTransform: boolean): Collider; - onAddedToEntity(): void; - onRemovedFromEntity(): void; - onEntityTransformChanged(comp: transform.Component): void; - onEnabled(): void; - onDisabled(): void; - /** - * 父实体会在不同的时间调用它(当添加到场景,启用,等等) - */ - registerColliderWithPhysicsSystem(): void; - /** - * 父实体会在不同的时候调用它(从场景中移除,禁用,等等) - */ - unregisterColliderWithPhysicsSystem(): void; - /** - * 检查这个形状是否与物理系统中的其他对撞机重叠 - * @param other - */ - overlaps(other: Collider): boolean; - /** - * 检查这个与运动应用的碰撞器(移动向量)是否与碰撞器碰撞。如果是这样,将返回true,并且结果将填充碰撞数据。 - * @param collider - * @param motion - * @param result - */ - collidesWith(collider: Collider, motion: Vector2, result?: CollisionResult): boolean; - /** - * 检查这个对撞机是否与对撞机发生碰撞。如果碰撞,则返回true,结果将被填充 - * @param collider - * @param result - */ - collidesWithNonMotion(collider: Collider, result?: CollisionResult): boolean; - } -} -declare module es { - class BoxCollider extends Collider { - /** - * 创建一个BoxCollider,并使用x/y组件作为局部Offset - * @param x - * @param y - * @param width - * @param height - */ - constructor(x: number, y: number, width: number, height: number); - width: number; - height: number; - /** - * 设置BoxCollider的大小 - * @param width - * @param height - */ - setSize(width: number, height: number): this; - /** - * 设置BoxCollider的宽度 - * @param width - */ - setWidth(width: number): BoxCollider; - /** - * 设置BoxCollider的高度 - * @param height - */ - setHeight(height: number): void; - toString(): string; - } -} -declare module es { - class CircleCollider extends Collider { - /** - * 创建一个具有半径的CircleCollider。 - * 请注意,当指定半径时,如果在实体上使用RenderableComponent,您将需要设置原点来对齐CircleCollider。 - * 例如,如果RenderableComponent有一个0,0的原点,并且创建了一个半径为1.5f * renderable.width的CircleCollider,你可以通过设置originNormalied为中心除以缩放尺寸来偏移原点 - * - * @param radius - */ - constructor(radius: number); - radius: number; - /** - * 设置圆的半径 - * @param radius - */ - setRadius(radius: number): CircleCollider; - toString(): string; - } -} -declare module es { - /** - * 多边形应该以顺时针方式定义 - */ - class PolygonCollider extends Collider { - /** - * 如果这些点没有居中,它们将以localOffset的差异为居中。 - * @param points - */ - constructor(points: Vector2[]); - } -} -declare module es { - /** - * 追踪实体的子集,但不实现任何排序或迭代。 - */ - abstract class EntitySystem { - private _entities; - constructor(matcher?: Matcher); - private _scene; - /** - * 这个系统所属的场景 - */ - scene: Scene; - private _matcher; - readonly matcher: Matcher; - initialize(): void; - onChanged(entity: Entity): void; - add(entity: Entity): void; - onAdded(entity: Entity): void; - remove(entity: Entity): void; - onRemoved(entity: Entity): void; - update(): void; - lateUpdate(): void; - /** - * 在系统处理开始前调用 - * 在下一个系统开始处理或新的处理回合开始之前(以先到者为准),使用此方法创建的任何实体都不会激活 - */ - protected begin(): void; - protected process(entities: Entity[]): void; - protected lateProcess(entities: Entity[]): void; - /** - * 系统处理完毕后调用 - */ - protected end(): void; - /** - * 系统是否需要处理 - * - * 在启用系统时有用,但仅偶尔需要处理 - * 这只影响处理,不影响事件或订阅列表 - * @returns 如果系统应该处理,则为true,如果不处理则为false。 - */ - protected checkProcessing(): boolean; - } -} -declare module es { - /** - * 追踪每个实体的冷却时间,当实体的计时器耗尽时进行处理 - * - * 一个示例系统将是ExpirationSystem,该系统将在特定生存期后删除实体。 - * 你不必运行会为每个实体递减timeLeft值的系统 - * 而只需使用此系统在寿命最短的实体时在将来执行 - * 然后重置系统在未来的某一个最短命实体的时间运行 - * - * 另一个例子是一个动画系统 - * 你知道什么时候你必须对某个实体进行动画制作,比如300毫秒内。 - * 所以你可以设置系统以300毫秒为单位运行来执行动画 - * - * 这将在某些情况下节省CPU周期 - */ - abstract class DelayedIteratingSystem extends EntitySystem { - /** - * 一个实体应被处理的时间 - */ - private delay; - /** - * 如果系统正在运行,并倒计时延迟 - */ - private running; - /** - * 倒计时 - */ - private acc; - constructor(matcher: Matcher); - protected process(entities: Entity[]): void; - protected checkProcessing(): boolean; - /** - * 只有当提供的延迟比系统当前计划执行的时间短时,才会重新启动系统。 - * 如果系统已经停止(不运行),那么提供的延迟将被用来重新启动系统,无论其值如何 - * 如果系统已经在倒计时,并且提供的延迟大于剩余时间,系统将忽略它。 - * 如果提供的延迟时间短于剩余时间,系统将重新启动,以提供的延迟时间运行。 - * @param offeredDelay - */ - offerDelay(offeredDelay: number): void; - /** - * 处理本系统感兴趣的实体 - * 从实体定义的延迟中抽象出accumulativeDelta - * @param entity - * @param accumulatedDelta 本系统最后一次执行后的delta时间 - */ - protected abstract processDelta(entity: Entity, accumulatedDelta: number): any; - protected abstract processExpired(entity: Entity): any; - /** - * 返回该实体处理前的延迟时间 - * @param entity - */ - protected abstract getRemainingDelay(entity: Entity): number; - /** - * 获取系统被命令处理实体后的初始延迟 - */ - getInitialTimeDelay(): number; - /** - * 获取系统计划运行前的时间 - * 如果系统没有运行,则返回零 - */ - getRemainingTimeUntilProcessing(): number; - /** - * 检查系统是否正在倒计时处理 - */ - isRunning(): boolean; - /** - * 停止系统运行,中止当前倒计时 - */ - stop(): void; - } -} -declare module es { - /** - * 基本实体处理系统。将其用作处理具有特定组件的许多实体的基础 - * - * 按实体引用遍历实体订阅成员实体的系统 - * 当你需要处理与Matcher相匹配的实体,并且你更喜欢使用Entity的时候,可以使用这个功能。 - */ - abstract class EntityProcessingSystem extends EntitySystem { - constructor(matcher: Matcher); - /** - * 处理特定的实体 - * @param entity - */ - abstract processEntity(entity: Entity): any; - lateProcessEntity(entity: Entity): void; - /** - * 遍历这个系统的所有实体并逐个处理它们 - * @param entities - */ - protected process(entities: Entity[]): void; - protected lateProcess(entities: Entity[]): void; - } -} -declare module es { - /** - * 实体系统以一定的时间间隔进行处理 - */ - abstract class IntervalSystem extends EntitySystem { - /** - * 累积增量以跟踪间隔 - */ - protected acc: number; - /** - * 更新之间需要等待多长时间 - */ - private readonly interval; - private intervalDelta; - constructor(matcher: Matcher, interval: number); - protected checkProcessing(): boolean; - /** - * 获取本系统上次处理后的实际delta值 - */ - protected getIntervalDelta(): number; - } -} -declare module es { - /** - * 每x个ticks处理一个实体的子集 - * - * 典型的用法是每隔一定的时间间隔重新生成弹药或生命值 - * 而无需在每个游戏循环中都进行 - * 而是每100毫秒一次或每秒 - */ - abstract class IntervalIteratingSystem extends IntervalSystem { - constructor(matcher: Matcher, interval: number); - /** - * 处理本系统感兴趣的实体 - * @param entity - */ - abstract processEntity(entity: Entity): any; - protected process(entities: Entity[]): void; - } -} -declare module es { - abstract class PassiveSystem extends EntitySystem { - onChanged(entity: Entity): void; - protected process(entities: Entity[]): void; - } -} -/** 用于协调其他系统的通用系统基类 */ -declare module es { - abstract class ProcessingSystem extends EntitySystem { - onChanged(entity: Entity): void; - /** 处理我们的系统 每帧调用 */ - abstract processSystem(): any; - protected process(entities: Entity[]): void; - } -} -declare module es { - /** - * 这个类可以从两方面来考虑。你可以把它看成一个位向量或者一组非负整数。这个名字有点误导人。 - * - * 它是由一个位向量实现的,但同样可以把它看成是一个非负整数的集合;集合中的每个整数由对应索引处的集合位表示。该结构的大小由集合中的最大整数决定。 - */ - class BitSet { - private static LONG_MASK; - private _bits; - constructor(nbits?: number); - and(bs: BitSet): void; - andNot(bs: BitSet): void; - cardinality(): number; - clear(pos?: number): void; - get(pos: number): boolean; - intersects(set: BitSet): boolean; - isEmpty(): boolean; - nextSetBit(from: number): number; - set(pos: number, value?: boolean): void; - private ensure; - } -} -declare module es { - class ComponentList { - /** - * 组件列表的全局updateOrder排序 - */ - static compareUpdatableOrder: IUpdatableComparer; - _entity: Entity; - /** - * 添加到实体的组件列表 - */ - _components: Component[]; - /** - * 所有需要更新的组件列表 - */ - _updatableComponents: IUpdatable[]; - /** - * 添加到此框架的组件列表。用来对组件进行分组,这样我们就可以同时进行加工 - */ - _componentsToAdd: Component[]; - /** - * 标记要删除此框架的组件列表。用来对组件进行分组,这样我们就可以同时进行加工 - */ - _componentsToRemove: Component[]; - _tempBufferList: Component[]; - /** - * 用于确定是否需要对该框架中的组件进行排序的标志 - */ - _isComponentListUnsorted: boolean; - constructor(entity: Entity); - readonly count: number; - readonly buffer: Component[]; - markEntityListUnsorted(): void; - add(component: Component): void; - remove(component: Component): void; - /** - * 立即从组件列表中删除所有组件 - */ - removeAllComponents(): void; - deregisterAllComponents(): void; - registerAllComponents(): void; - /** - * 处理任何需要删除或添加的组件 - */ - updateLists(): void; - handleRemove(component: Component): void; - /** - * 获取类型T的第一个组件并返回它 - * 可以选择跳过检查未初始化的组件(尚未调用onAddedToEntity方法的组件) - * 如果没有找到组件,则返回null。 - * @param type - * @param onlyReturnInitializedComponents - */ - getComponent(type: any, onlyReturnInitializedComponents: boolean): T; - /** - * 获取T类型的所有组件,但不使用列表分配 - * @param typeName - * @param components - */ - getComponents(typeName: any, components?: any): any; - update(): void; - onEntityTransformChanged(comp: transform.Component): void; - onEntityEnabled(): void; - onEntityDisabled(): void; - } -} -declare module es { - class ComponentTypeManager { - private static _componentTypesMask; - static add(type: any): void; - static getIndexFor(type: any): number; - } -} -declare module es { - class EntityList { - scene: Scene; - /** - * 场景中添加的实体列表 - */ - _entities: Entity[]; - /** - * 本帧添加的实体列表。用于对实体进行分组,以便我们可以同时处理它们 - */ - _entitiesToAdded: HashSet; - /** - * 本帧被标记为删除的实体列表。用于对实体进行分组,以便我们可以同时处理它们 - */ - _entitiesToRemove: HashSet; - /** - * 标志,用于确定我们是否需要在这一帧中对实体进行排序 - */ - _isEntityListUnsorted: boolean; - /** - * 通过标签跟踪实体,便于检索 - */ - _entityDict: Map; - _unsortedTags: Set; - constructor(scene: Scene); - readonly count: number; - readonly buffer: Entity[]; - markEntityListUnsorted(): void; - markTagUnsorted(tag: number): void; - /** - * 将一个实体添加到列表中。所有的生命周期方法将在下一帧中被调用 - * @param entity - */ - add(entity: Entity): void; - /** - * 从列表中删除一个实体。所有的生命周期方法将在下一帧中被调用 - * @param entity - */ - remove(entity: Entity): void; - /** - * 从实体列表中删除所有实体 - */ - removeAllEntities(): void; - /** - * 检查实体目前是否由这个EntityList管理 - * @param entity - */ - contains(entity: Entity): boolean; - getTagList(tag: number): Entity[]; - addToTagList(entity: Entity): void; - removeFromTagList(entity: Entity): void; - update(): void; - updateLists(): void; - /** - * 返回第一个找到的名字为name的实体。如果没有找到则返回null - * @param name - */ - findEntity(name: string): Entity; - /** - * 返回带有标签的所有实体的列表。如果没有实体有标签,则返回一个空列表。 - * 返回的List可以通过ListPool.free放回池中 - * @param tag - */ - entitiesWithTag(tag: number): Entity[]; - /** - * 返回一个T类型的所有实体的列表。 - * 返回的List可以通过ListPool.free放回池中。 - * @param type - */ - entitiesOfType(type: any): T[]; - /** - * 返回在场景中找到的第一个T类型的组件。 - * @param type - */ - findComponentOfType(type: any): T; - /** - * 返回在场景中找到的所有T类型的组件。 - * 返回的List可以通过ListPool.free放回池中。 - * @param type - */ - findComponentsOfType(type: any): T[]; - } -} -declare module es { - class EntityProcessorList { - protected _processors: EntitySystem[]; - add(processor: EntitySystem): void; - remove(processor: EntitySystem): void; - onComponentAdded(entity: Entity): void; - onComponentRemoved(entity: Entity): void; - onEntityAdded(entity: Entity): void; - onEntityRemoved(entity: Entity): void; - begin(): void; - update(): void; - lateUpdate(): void; - end(): void; - getProcessor(): T; - protected notifyEntityChanged(entity: Entity): void; - protected removeFromProcessors(entity: Entity): void; - } -} -declare module es { - class HashHelpers { - static readonly hashCollisionThreshold: number; - static readonly hashPrime: number; - /** - * 用来作为哈希表大小的质数表。 - * 一个典型的调整大小的算法会在这个数组中选取比之前容量大两倍的最小质数。 - * 假设我们的Hashtable当前的容量为x,并且添加了足够多的元素,因此需要进行大小调整。 - * 调整大小首先计算2x,然后在表中找到第一个大于2x的质数,即如果质数的顺序是p_1,p_2,...,p_i,...,则找到p_n,使p_n-1 < 2x < p_n。 - * 双倍对于保持哈希特操作的渐近复杂度是很重要的,比如添加。 - * 拥有一个质数可以保证双倍哈希不会导致无限循环。 IE,你的哈希函数将是h1(key)+i*h2(key),0 <= i < size.h2和size必须是相对质数。 - */ - static readonly primes: number[]; - /** - * 这是比Array.MaxArrayLength小的最大质数 - */ - static readonly maxPrimeArrayLength: number; - static isPrime(candidate: number): boolean; - static getPrime(min: number): number; - /** - * - * @param oldSize - * @returns 返回要增长的哈希特表的大小 - */ - static expandPrime(oldSize: number): number; - static getHashCode(str: any): number; - } -} -declare module es { - class Matcher { - protected allSet: BitSet; - protected exclusionSet: BitSet; - protected oneSet: BitSet; - static empty(): Matcher; - getAllSet(): BitSet; - getExclusionSet(): BitSet; - getOneSet(): BitSet; - isInterestedEntity(e: Entity): boolean; - isInterested(componentBits: BitSet): boolean; - all(...types: any[]): Matcher; - exclude(...types: any[]): this; - one(...types: any[]): this; - } -} -declare class StringUtils { - /** - * 特殊符号字符串 - */ - private static specialSigns; - /** - * 匹配中文字符 - * @param str 需要匹配的字符串 - * @return - */ - static matchChineseWord(str: string): string[]; - /** - * 去除字符串左端的空白字符 - * @param target 目标字符串 - * @return - */ - static lTrim(target: string): string; - /** - * 去除字符串右端的空白字符 - * @param target 目标字符串 - * @return - */ - static rTrim(target: string): string; - /** - * 返回一个去除2段空白字符的字符串 - * @param target - * @return 返回一个去除2段空白字符的字符串 - */ - static trim(target: string): string; - /** - * 返回该字符是否为空白字符 - * @param str - * @return 返回该字符是否为空白字符 - */ - static isWhiteSpace(str: string): boolean; - /** - * 返回执行替换后的字符串 - * @param mainStr 待查找字符串 - * @param targetStr 目标字符串 - * @param replaceStr 替换字符串 - * @param caseMark 是否忽略大小写 - * @return 返回执行替换后的字符串 - */ - static replaceMatch(mainStr: string, targetStr: string, replaceStr: string, caseMark?: boolean): string; - /** - * 用html实体换掉字符窜中的特殊字符 - * @param str 需要替换的字符串 - * @param reversion 是否翻转替换:将转义符号替换为正常的符号 - * @return 换掉特殊字符后的字符串 - */ - static htmlSpecialChars(str: string, reversion?: boolean): string; - /** - * 给数字字符前面添 "0" - * - * @param str 要进行处理的字符串 - * @param width 处理后字符串的长度, - * 如果str.length >= width,将不做任何处理直接返回原始的str。 - * @return - * - */ - static zfill(str: string, width?: number): string; - /** - * 翻转字符串 - * @param str 字符串 - * @return 翻转后的字符串 - */ - static reverse(str: string): string; - /** - * 截断某段字符串 - * @param str 目标字符串 - * @param start 需要截断的起始索引 - * @param en 截断长度 - * @param order 顺序,true从字符串头部开始计算,false从字符串尾巴开始结算。 - * @return 截断后的字符串 - */ - static cutOff(str: string, start: number, len: number, order?: boolean): string; - /** - * {0} 字符替换 - */ - static strReplace(str: string, rStr: string[]): string; - static format(str: string, ...args: any[]): string; -} -declare module es { - /** 提供帧定时信息 */ - class Time { - /** 游戏运行的总时间 */ - static totalTime: number; - /** deltaTime的未缩放版本。不受时间尺度的影响 */ - static unscaledDeltaTime: number; - /** 前一帧到当前帧的时间增量,按时间刻度进行缩放 */ - static deltaTime: number; - /** 时间刻度缩放 */ - static timeScale: number; - /** 已传递的帧总数 */ - static frameCount: number; - /** 自场景加载以来的总时间 */ - static timeSinceSceneLoad: number; - private static _lastTime; - static update(currentTime: number): void; - static sceneChanged(): void; - /** - * 允许在间隔检查。只应该使用高于delta的间隔值,否则它将始终返回true。 - * @param interval - */ - static checkEvery(interval: number): boolean; - } -} -declare class TimeUtils { - /** - * 计算月份ID - * @param d 指定计算日期 - * @returns 月ID - */ - static monthId(d?: Date): number; - /** - * 计算日期ID - * @param d 指定计算日期 - * @returns 日期ID - */ - static dateId(t?: Date): number; - /** - * 计算周ID - * @param d 指定计算日期 - * @returns 周ID - */ - static weekId(d?: Date, first?: boolean): number; - /** - * 计算俩日期时间差,如果a比b小,返回负数 - */ - static diffDay(a: Date, b: Date, fixOne?: boolean): number; - /** - * 获取本周一 凌晨时间 - */ - static getFirstDayOfWeek(d?: Date): Date; - /** - * 获取当日凌晨时间 - */ - static getFirstOfDay(d?: Date): Date; - /** - * 获取次日凌晨时间 - */ - static getNextFirstOfDay(d?: Date): Date; - /** - * @returns 2018-12-12 - */ - static formatDate(date: Date): string; - /** - * @returns 2018-12-12 12:12:12 - */ - static formatDateTime(date: Date): string; - /** - * @returns s 2018-12-12 或者 2018-12-12 12:12:12 - */ - static parseDate(s: string): Date; - /** - * 秒数转换为时间形式。 - * @param time 秒数 - * @param partition 分隔符 - * @param showHour 是否显示小时 - * @return 返回一个以分隔符分割的时, 分, 秒 - * - * 比如: time = 4351; secondToTime(time)返回字符串01:12:31; - */ - static secondToTime(time?: number, partition?: string, showHour?: boolean): string; - /** - * 时间形式转换为毫秒数。 - * @param time 以指定分隔符分割的时间字符串 - * @param partition 分隔符 - * @return 毫秒数显示的字符串 - * @throws Error Exception - * - * 用法1 trace(MillisecondTransform.timeToMillisecond("00:60:00")) - * 输出 3600000 - * - * - * 用法2 trace(MillisecondTransform.timeToMillisecond("00.60.00",".")) - * 输出 3600000 - */ - static timeToMillisecond(time: string, partition?: string): string; -} -declare module es { - /** - * 三次方和二次方贝塞尔帮助器(cubic and quadratic bezier helper) - */ - class Bezier { - /** - * 求解二次曲折线 - * @param p0 - * @param p1 - * @param p2 - * @param t - */ - static getPoint(p0: Vector2, p1: Vector2, p2: Vector2, t: number): Vector2; - /** - * 求解一个立方体曲率 - * @param start - * @param firstControlPoint - * @param secondControlPoint - * @param end - * @param t - */ - static getPointThree(start: Vector2, firstControlPoint: Vector2, secondControlPoint: Vector2, end: Vector2, t: number): Vector2; - /** - * 得到二次贝塞尔函数的一阶导数 - * @param p0 - * @param p1 - * @param p2 - * @param t - */ - static getFirstDerivative(p0: Vector2, p1: Vector2, p2: Vector2, t: number): Vector2; - /** - * 得到一个三次贝塞尔函数的一阶导数 - * @param start - * @param firstControlPoint - * @param secondControlPoint - * @param end - * @param t - */ - static getFirstDerivativeThree(start: Vector2, firstControlPoint: Vector2, secondControlPoint: Vector2, end: Vector2, t: number): Vector2; - /** - * 递归地细分bezier曲线,直到满足距离校正 - * 在这种算法中,平面切片的点要比曲面切片少。返回完成后应返回到ListPool的合并列表。 - * @param start - * @param firstCtrlPoint - * @param secondCtrlPoint - * @param end - * @param distanceTolerance - */ - static getOptimizedDrawingPoints(start: Vector2, firstCtrlPoint: Vector2, secondCtrlPoint: Vector2, end: Vector2, distanceTolerance?: number): Vector2[]; - /** - * 递归地细分bezier曲线,直到满足距离校正。在这种算法中,平面切片的点要比曲面切片少。 - * @param start - * @param firstCtrlPoint - * @param secondCtrlPoint - * @param end - * @param points - * @param distanceTolerance - */ - private static recursiveGetOptimizedDrawingPoints; - } -} -declare module es { - /** - * 提供了一系列立方贝塞尔点,并提供了帮助方法来访问贝塞尔 - */ - class BezierSpline { - _points: Vector2[]; - _curveCount: number; - /** - * 在这个过程中,t被修改为在曲线段的范围内。 - * @param t - */ - pointIndexAtTime(t: Ref): number; - /** - * 设置一个控制点,考虑到这是否是一个共享点,如果是,则适当调整 - * @param index - * @param point - */ - setControlPoint(index: number, point: Vector2): void; - /** - * 得到时间t的贝塞尔曲线上的点 - * @param t - */ - getPointAtTime(t: number): Vector2; - /** - * 得到贝塞尔在时间t的速度(第一导数) - * @param t - */ - getVelocityAtTime(t: number): Vector2; - /** - * 得到时间t时贝塞尔的方向(归一化第一导数) - * @param t - */ - getDirectionAtTime(t: number): Vector2; - /** - * 在贝塞尔曲线上添加一条曲线 - * @param start - * @param firstControlPoint - * @param secondControlPoint - * @param end - */ - addCurve(start: Vector2, firstControlPoint: Vector2, secondControlPoint: Vector2, end: Vector2): void; - /** - * 重置bezier,移除所有点 - */ - reset(): void; - /** - * 将splitine分解成totalSegments部分,并返回使用线条绘制所需的所有点 - * @param totalSegments - */ - getDrawingPoints(totalSegments: number): Vector2[]; - } -} -declare module es { - /** - * 帮助处理位掩码的实用程序类 - * 除了isFlagSet之外,所有方法都期望flag参数是一个非移位的标志 - * 允许您使用普通的(0、1、2、3等)来设置/取消您的标记 - */ - class Flags { - /** - * 检查位标志是否已在数值中设置 - * 检查期望标志是否已经移位 - * @param self - * @param flag - */ - static isFlagSet(self: number, flag: number): boolean; - /** - * 检查位标志是否在数值中设置 - * @param self - * @param flag - */ - static isUnshiftedFlagSet(self: number, flag: number): boolean; - /** - * 设置数值标志位,移除所有已经设置的标志 - * @param self - * @param flag - */ - static setFlagExclusive(self: Ref, flag: number): void; - /** - * 设置标志位 - * @param self - * @param flag - */ - static setFlag(self: Ref, flag: number): void; - /** - * 取消标志位 - * @param self - * @param flag - */ - static unsetFlag(self: Ref, flag: number): void; - /** - * 反转数值集合位 - * @param self - */ - static invertFlags(self: Ref): void; - } -} -declare module es { - class MathHelper { - static readonly Epsilon: number; - static readonly Rad2Deg: number; - static readonly Deg2Rad: number; - /** - * 表示pi除以2的值(1.57079637) - */ - static readonly PiOver2: number; - /** - * 将弧度转换成角度。 - * @param radians 用弧度表示的角 - */ - static toDegrees(radians: number): number; - /** - * 将角度转换为弧度 - * @param degrees - */ - static toRadians(degrees: number): number; - /** - * mapps值(在leftMin - leftMax范围内)到rightMin - rightMax范围内的值 - * @param value - * @param leftMin - * @param leftMax - * @param rightMin - * @param rightMax - */ - static map(value: number, leftMin: number, leftMax: number, rightMin: number, rightMax: number): number; - static lerp(value1: number, value2: number, amount: number): number; - static clamp(value: number, min: number, max: number): number; - /** - * 给定圆心、半径和角度,得到圆周上的一个点。0度是3点钟。 - * @param circleCenter - * @param radius - * @param angleInDegrees - */ - static pointOnCirlce(circleCenter: Vector2, radius: number, angleInDegrees: number): Vector2; - /** - * 如果值为偶数,返回true - * @param value - */ - static isEven(value: number): boolean; - /** - * 数值限定在0-1之间 - * @param value - */ - static clamp01(value: number): number; - static angleBetweenVectors(from: Vector2, to: Vector2): number; - static angleToVector(angleRadians: number, length: number): Vector2; - /** - * 增加t并确保它总是大于或等于0并且小于长度 - * @param t - * @param length - */ - static incrementWithWrap(t: number, length: number): number; - /** - * 以roundToNearest为步长,将值舍入到最接近的数字。例如:在125中找到127到最近的5个结果 - * @param value - * @param roundToNearest - */ - static roundToNearest(value: number, roundToNearest: number): number; - /** - * 检查传递的值是否在某个阈值之下。对于小规模、精确的比较很有用 - * @param value - * @param ep - */ - static withinEpsilon(value: number, ep?: number): boolean; - /** - * 由上移量向上移。start可以小于或大于end。例如:开始是2,结束是10,移位是4,结果是6 - * @param start - * @param end - * @param shift - */ - static approach(start: number, end: number, shift: number): number; - /** - * 计算两个给定角之间的最短差值(度数) - * @param current - * @param target - */ - static deltaAngle(current: number, target: number): number; - /** - * 循环t,使其永远不大于长度,永远不小于0 - * @param t - * @param length - */ - static repeat(t: number, length: number): number; - } -} -declare module es { - /** - * 代表右手4x4浮点矩阵,可以存储平移、比例和旋转信息 - */ - class Matrix { - m11: number; - m12: number; - m13: number; - m14: number; - m21: number; - m22: number; - m23: number; - m24: number; - m31: number; - m32: number; - m33: number; - m34: number; - m41: number; - m42: number; - m43: number; - m44: number; - /** - * 为自定义的正交视图创建一个新的投影矩阵 - * @param left - * @param right - * @param top - * @param zFarPlane - * @param result - */ - static createOrthographicOffCenter(left: number, right: number, bottom: number, top: number, zNearPlane: number, zFarPlane: number, result?: Matrix): void; - /** - * 创建一个新的矩阵,其中包含两个矩阵的乘法。 - * @param matrix1 - * @param matrix2 - * @param result - */ - static multiply(matrix1: Matrix, matrix2: Matrix, result?: Matrix): void; - } -} -declare module es { - /** - * 表示右手3 * 3的浮点矩阵,可以存储平移、缩放和旋转信息。 - */ - class Matrix2D implements IEquatable { - m11: number; - m12: number; - m21: number; - m22: number; - m31: number; - m32: number; - /** - * 返回标识矩阵 - */ - static readonly identity: Matrix2D; - /** - * 储存在该矩阵中的位置 - */ - translation: Vector2; - /** - * 以弧度为单位的旋转,存储在这个矩阵中 - */ - rotation: number; - /** - * 矩阵中存储的旋转度数 - */ - rotationDegrees: number; - /** - * 储存在这个矩阵中的缩放 - */ - scale: Vector2; - /** - * 构建一个矩阵 - * @param m11 - * @param m12 - * @param m21 - * @param m22 - * @param m31 - * @param m32 - */ - constructor(m11: number, m12: number, m21: number, m22: number, m31: number, m32: number); - /** - * 创建一个新的围绕Z轴的旋转矩阵2D - * @param radians - */ - static createRotation(radians: number): Matrix2D; - /** - * 创建一个新的缩放矩阵2D - * @param xScale - * @param yScale - */ - static createScale(xScale: number, yScale: number): Matrix2D; - /** - * 创建一个新的平移矩阵2D - * @param xPosition - * @param yPosition - */ - static createTranslation(xPosition: number, yPosition: number): Matrix2D; - static invert(matrix: Matrix2D): Matrix2D; - /** - * 创建一个新的matrix, 它包含两个矩阵的和。 - * @param matrix - */ - add(matrix: Matrix2D): Matrix2D; - substract(matrix: Matrix2D): Matrix2D; - divide(matrix: Matrix2D): Matrix2D; - multiply(matrix: Matrix2D): Matrix2D; - determinant(): number; - /** - * 创建一个新的Matrix2D,包含指定矩阵中的线性插值。 - * @param matrix1 - * @param matrix2 - * @param amount - */ - static lerp(matrix1: Matrix2D, matrix2: Matrix2D, amount: number): Matrix2D; - /** - * 交换矩阵的行和列 - * @param matrix - */ - static transpose(matrix: Matrix2D): Matrix2D; - mutiplyTranslation(x: number, y: number): Matrix2D; - /** - * 比较当前实例是否等于指定的Matrix2D - * @param other - */ - equals(other: Matrix2D): boolean; - static toMatrix(mat: Matrix2D): Matrix; - toString(): string; - } -} -declare module es { - class MatrixHelper { - /** - * 创建一个新的Matrix2D,其中包含两个矩阵的和 - * @param matrix1 - * @param matrix2 - */ - static add(matrix1: Matrix2D, matrix2: Matrix2D): Matrix2D; - /** - * 将一个Matrix2D的元素除以另一个矩阵的元素 - * @param matrix1 - * @param matrix2 - */ - static divide(matrix1: Matrix2D, matrix2: Matrix2D): Matrix2D; - /** - * 创建一个新的Matrix2D,包含两个矩阵的乘法 - * @param matrix1 - * @param matrix2 - */ - static mutiply(matrix1: Matrix2D, matrix2: Matrix2D | number): Matrix2D; - /** - * 创建一个新的Matrix2D,包含一个矩阵与另一个矩阵的减法。 - * @param matrix1 - * @param matrix2 - */ - static subtract(matrix1: Matrix2D, matrix2: Matrix2D): Matrix2D; - } -} -declare module es { - class Rectangle implements IEquatable { - /** - * 该矩形的左上角的x坐标 - */ - x: number; - /** - * 该矩形的左上角的y坐标 - */ - y: number; - /** - * 该矩形的宽度 - */ - width: number; - /** - * 该矩形的高度 - */ - height: number; - /** - * 返回X=0, Y=0, Width=0, Height=0的矩形 - */ - static readonly empty: Rectangle; - /** - * 返回一个Number.Min/Max值的矩形 - */ - static readonly maxRect: Rectangle; - /** - * 返回此矩形左边缘的X坐标 - */ - readonly left: number; - /** - * 返回此矩形右边缘的X坐标 - */ - readonly right: number; - /** - * 返回此矩形顶边的y坐标 - */ - readonly top: number; - /** - * 返回此矩形底边的y坐标 - */ - readonly bottom: number; - /** - * 获取矩形的最大点,即右下角 - */ - readonly max: Vector2; - /** - * 这个矩形的宽和高是否为0,位置是否为(0,0) - */ - isEmpty(): boolean; - /** 这个矩形的左上角坐标 */ - location: Vector2; - /** - * 这个矩形的宽-高坐标 - */ - size: Vector2; - /** - * 位于这个矩形中心的一个点 - * 如果 "宽度 "或 "高度 "是奇数,则中心点将向下舍入 - */ - readonly center: Vector2; - _tempMat: Matrix2D; - _transformMat: Matrix2D; - /** - * 创建一个新的Rectanglestruct实例,指定位置、宽度和高度。 - * @param x 创建的矩形的左上角的X坐标 - * @param y 创建的矩形的左上角的y坐标 - * @param width 创建的矩形的宽度 - * @param height 创建的矩形的高度 - */ - constructor(x?: number, y?: number, width?: number, height?: number); - /** - * 创建一个给定最小/最大点(左上角,右下角)的矩形 - * @param minX - * @param minY - * @param maxX - * @param maxY - */ - static fromMinMax(minX: number, minY: number, maxX: number, maxY: number): Rectangle; - /** - * 给定多边形的点,计算边界 - * @param points - * @returns 来自多边形的点 - */ - static rectEncompassingPoints(points: Vector2[]): Rectangle; - /** - * 获取指定边缘的位置 - * @param edge - */ - getSide(edge: Edge): number; - /** - * 获取所提供的坐标是否在这个矩形的范围内 - * @param x 检查封堵点的X坐标 - * @param y 检查封堵点的Y坐标 - */ - contains(x: number, y: number): boolean; - /** - * 按指定的水平和垂直方向调整此矩形的边缘 - * @param horizontalAmount 调整左、右边缘的值 - * @param verticalAmount 调整上、下边缘的值 - */ - inflate(horizontalAmount: number, verticalAmount: number): void; - /** - * 获取其他矩形是否与这个矩形相交 - * @param value 另一个用于测试的矩形 - */ - intersects(value: Rectangle): boolean; - rayIntersects(ray: Ray2D, distance: Ref): boolean; - /** - * 获取所提供的矩形是否在此矩形的边界内 - * @param value - */ - containsRect(value: Rectangle): boolean; - getHalfSize(): Vector2; - getClosestPointOnBoundsToOrigin(): Vector2; - /** - * 返回离给定点最近的点 - * @param point 矩形上离点最近的点 - */ - getClosestPointOnRectangleToPoint(point: Vector2): Vector2; - /** - * 获取矩形边界上与给定点最近的点 - * @param point - * @param edgeNormal - * @returns 矩形边框上离点最近的点 - */ - getClosestPointOnRectangleBorderToPoint(point: Vector2, edgeNormal: Vector2): Vector2; - /** - * 创建一个新的RectangleF,该RectangleF包含两个其他矩形的重叠区域 - * @param value1 - * @param value2 - * @returns 将两个矩形的重叠区域作为输出参数 - */ - static intersect(value1: Rectangle, value2: Rectangle): Rectangle; - /** - * 改变这个矩形的位置 - * @param offsetX 要添加到这个矩形的X坐标 - * @param offsetY 要添加到这个矩形的y坐标 - */ - offset(offsetX: number, offsetY: number): void; - /** - * 创建一个完全包含两个其他矩形的新矩形 - * @param value1 - * @param value2 - */ - static union(value1: Rectangle, value2: Rectangle): Rectangle; - /** - * 在矩形重叠的地方创建一个新的矩形 - * @param value1 - * @param value2 - */ - static overlap(value1: Rectangle, value2: Rectangle): Rectangle; - calculateBounds(parentPosition: Vector2, position: Vector2, origin: Vector2, scale: Vector2, rotation: number, width: number, height: number): void; - /** - * 返回一个横跨当前矩形和提供的三角形位置的矩形 - * @param deltaX - * @param deltaY - */ - getSweptBroadphaseBounds(deltaX: number, deltaY: number): Rectangle; - /** - * 如果发生碰撞,返回true - * moveX和moveY将返回b1为避免碰撞而必须移动的移动量 - * @param other - * @param moveX - * @param moveY - */ - collisionCheck(other: Rectangle, moveX: Ref, moveY: Ref): boolean; - /** - * 计算两个矩形之间有符号的交点深度 - * @param rectA - * @param rectB - * @returns 两个相交的矩形之间的重叠量。 - * 这些深度值可以是负值,取决于矩形/相交的哪些边。 - * 这允许调用者确定正确的推送对象的方向,以解决碰撞问题。 - * 如果矩形不相交,则返回Vector2.Zero - */ - static getIntersectionDepth(rectA: Rectangle, rectB: Rectangle): Vector2; - /** - * 比较当前实例是否等于指定的矩形 - * @param other - */ - equals(other: Rectangle): boolean; - /** - * 获取这个矩形的哈希码 - */ - getHashCode(): number; - clone(): Rectangle; - } -} -declare module es { - /** - * 它存储值,直到累计的总数大于1。一旦超过1,该值将在调用update时添加到amount中 - * 一般用法如下: - * - * let deltaMove = this.velocity * es.Time.deltaTime; - * deltaMove.x = this._x.update(deltaMove.x); - * deltaMove.y = this._y.update(deltaMove.y); - */ - class SubpixelFloat { - remainder: number; - /** - * 以amount递增余数,将值截断,存储新的余数并将amount设置为当前值 - * @param amount - */ - update(amount: number): number; - /** - * 将余数重置为0 - */ - reset(): void; - } -} -declare module es { - class SubpixelVector2 { - _x: SubpixelFloat; - _y: SubpixelFloat; - /** - * 以数量递增s/y余数,将值截断为整数,存储新的余数并将amount设置为当前值 - * @param amount - */ - update(amount: Vector2): void; - /** - * 将余数重置为0 - */ - reset(): void; - } -} -declare module es { - /** - * 移动器使用的帮助器类,用于管理触发器碰撞器交互并调用itriggerlistener - */ - class ColliderTriggerHelper { - private _entity; - /** 存储当前帧中发生的所有活动交点对 */ - private _activeTriggerIntersections; - /** 存储前一帧的交点对,这样我们就可以在移动这一帧后检测到退出 */ - private _previousTriggerIntersections; - private _tempTriggerList; - constructor(entity: Entity); - /** - * update应该在实体被移动后被调用,它将处理任何与Colllider重叠的ITriggerListeners。 - * 它将处理任何与Collider重叠的ITriggerListeners。 - */ - update(): void; - private checkForExitedColliders; - private notifyTriggerListeners; - } -} -declare module es { - enum PointSectors { - center = 0, - top = 1, - bottom = 2, - topLeft = 9, - topRight = 5, - left = 8, - right = 4, - bottomLeft = 10, - bottomRight = 6 - } - class Collisions { - static lineToLine(a1: Vector2, a2: Vector2, b1: Vector2, b2: Vector2): boolean; - static lineToLineIntersection(a1: Vector2, a2: Vector2, b1: Vector2, b2: Vector2, intersection?: Vector2): boolean; - static closestPointOnLine(lineA: Vector2, lineB: Vector2, closestTo: Vector2): Vector2; - static circleToCircle(circleCenter1: Vector2, circleRadius1: number, circleCenter2: Vector2, circleRadius2: number): boolean; - static circleToLine(circleCenter: Vector2, radius: number, lineFrom: Vector2, lineTo: Vector2): boolean; - static circleToPoint(circleCenter: Vector2, radius: number, point: Vector2): boolean; - static rectToCircle(rect: Rectangle, cPosition: Vector2, cRadius: number): boolean; - static rectToLine(rect: Rectangle, lineFrom: Vector2, lineTo: Vector2): boolean; - static rectToPoint(rX: number, rY: number, rW: number, rH: number, point: Vector2): boolean; - /** - * 位标志和帮助使用Cohen–Sutherland算法 - * - * 位标志: - * 1001 1000 1010 - * 0001 0000 0010 - * 0101 0100 0110 - * @param rX - * @param rY - * @param rW - * @param rH - * @param point - */ - static getSector(rX: number, rY: number, rW: number, rH: number, point: Vector2): PointSectors; - } -} -declare module es { - class RaycastHit { - /** - * 对撞机被射线击中 - */ - collider: Collider; - /** - * 撞击发生时沿射线的距离。 - */ - fraction: number; - /** - * 从射线原点到碰撞点的距离 - */ - distance: number; - /** - * 世界空间中光线击中对撞机表面的点 - */ - point: Vector2; - /** - * 被射线击中的表面的法向量 - */ - normal: Vector2; - /** - * 用于执行转换的质心。使其接触的形状的位置。 - */ - centroid: Vector2; - constructor(collider?: Collider, fraction?: number, distance?: number, point?: Vector2, normal?: Vector2); - setValues(collider: Collider, fraction: number, distance: number, point: Vector2): void; - setValuesNonCollider(fraction: number, distance: number, point: Vector2, normal: Vector2): void; - reset(): void; - toString(): string; - } -} -declare module es { - class Physics { - static _spatialHash: SpatialHash; - /** 用于在全局范围内存储重力值的方便字段 */ - static gravity: Vector2; - /** 调用reset并创建一个新的SpatialHash时使用的单元格大小 */ - static spatialHashCellSize: number; - /** 接受layerMask的所有方法的默认值 */ - static readonly allLayers: number; - /** - * raycast是否检测配置为触发器的碰撞器 - */ - static raycastsHitTriggers: boolean; - /** - * 在碰撞器中开始的射线/直线是否强制转换检测到那些碰撞器 - */ - static raycastsStartInColliders: boolean; - /** - * 我们保留它以避免在每次raycast发生时分配它 - */ - static _hitArray: RaycastHit[]; - /** - * 避免重叠检查和形状投射的分配 - */ - static _colliderArray: Collider[]; - static reset(): void; - /** - * 从SpatialHash中移除所有碰撞器 - */ - static clear(): void; - /** - * 检查是否有对撞机落在一个圆形区域内。返回遇到的第一个对撞机 - * @param center - * @param radius - * @param layerMask - */ - static overlapCircle(center: Vector2, radius: number, layerMask?: number): Collider; - /** - * 获取所有落在指定圆圈内的碰撞器 - * @param center - * @param randius - * @param results - * @param layerMask - */ - static overlapCircleAll(center: Vector2, randius: number, results: any[], layerMask?: number): number; - /** - * 返回所有碰撞器与边界相交的碰撞器。bounds。请注意,这是一个broadphase检查,所以它只检查边界,不做单个碰撞到碰撞器的检查! - * @param rect - * @param layerMask - */ - static boxcastBroadphase(rect: Rectangle, layerMask?: number): Set; - /** - * 返回所有被边界交错的碰撞器,但不包括传入的碰撞器(self)。 - * 如果你想为其他查询自己创建扫描边界,这个方法很有用 - * @param collider - * @param rect - * @param layerMask - */ - static boxcastBroadphaseExcludingSelf(collider: Collider, rect: Rectangle, layerMask?: number): Set; - /** - * 返回所有边界与 collider.bounds 相交的碰撞器,但不包括传入的碰撞器(self) - * @param collider - * @param layerMask - */ - static boxcastBroadphaseExcludingSelfNonRect(collider: Collider, layerMask?: number): Set; - /** - * 返回所有被 collider.bounds 扩展为包含 deltaX/deltaY 的碰撞器,但不包括传入的碰撞器(self) - * @param collider - * @param deltaX - * @param deltaY - * @param layerMask - */ - static boxcastBroadphaseExcludingSelfDelta(collider: Collider, deltaX: number, deltaY: number, layerMask?: number): Set; - /** - * 将对撞机添加到物理系统中 - * @param collider - */ - static addCollider(collider: Collider): void; - /** - * 从物理系统中移除对撞机 - * @param collider - */ - static removeCollider(collider: Collider): void; - /** - * 更新物理系统中对撞机的位置。这实际上只是移除然后重新添加带有新边界的碰撞器 - * @param collider - */ - static updateCollider(collider: Collider): void; - /** - * 返回与layerMask匹配的碰撞器的第一次命中 - * @param start - * @param end - * @param layerMask - */ - static linecast(start: Vector2, end: Vector2, layerMask?: number): RaycastHit; - /** - * 通过空间散列强制执行一行,并用该行命中的任何碰撞器填充hits数组 - * @param start - * @param end - * @param hits - * @param layerMask - */ - static linecastAll(start: Vector2, end: Vector2, hits: RaycastHit[], layerMask?: number): number; - /** - * 检查是否有对撞机落在一个矩形区域中 - * @param rect - * @param layerMask - */ - static overlapRectangle(rect: Rectangle, layerMask?: number): Collider; - /** - * 获取所有在指定矩形范围内的碰撞器 - * @param rect - * @param results - * @param layerMask - */ - static overlapRectangleAll(rect: Rectangle, results: Collider[], layerMask?: number): number; - } -} -declare module es { - /** - * 不是真正的射线(射线只有开始和方向),作为一条线和射线。 - */ - class Ray2D { - start: Vector2; - end: Vector2; - direction: Vector2; - constructor(position: Vector2, end: Vector2); - } -} -declare module es { - class SpatialHash { - gridBounds: Rectangle; - _raycastParser: RaycastResultParser; - /** - * 散列中每个单元格的大小 - */ - _cellSize: number; - /** - * 1除以单元格大小。缓存结果,因为它被大量使用。 - */ - _inverseCellSize: number; - /** - * 重叠检查缓存框 - */ - _overlapTestBox: Box; - /** - * 重叠检查缓存圈 - */ - _overlapTestCircle: Circle; - /** - * 保存所有数据的字典 - */ - _cellDict: NumberDictionary; - /** - * 用于返回冲突信息的共享HashSet - */ - _tempHashSet: Set; - constructor(cellSize?: number); - /** - * 将对象添加到SpatialHash - * @param collider - */ - register(collider: Collider): void; - /** - * 从SpatialHash中删除对象 - * @param collider - */ - remove(collider: Collider): void; - /** - * 使用蛮力方法从SpatialHash中删除对象 - * @param obj - */ - removeWithBruteForce(obj: Collider): void; - clear(): void; - /** - * 返回边框与单元格相交的所有对象 - * @param bounds - * @param excludeCollider - * @param layerMask - */ - aabbBroadphase(bounds: Rectangle, excludeCollider: Collider, layerMask: number): Set; - /** - * 通过空间散列投掷一条线,并将该线碰到的任何碰撞器填入碰撞数组 - * https://github.com/francisengelmann/fast_voxel_traversal/blob/master/main.cpp - * http://www.cse.yorku.ca/~amana/research/grid.pdf - * @param start - * @param end - * @param hits - * @param layerMask - */ - linecast(start: Vector2, end: Vector2, hits: RaycastHit[], layerMask: number): number; - /** - * 获取所有在指定矩形范围内的碰撞器 - * @param rect - * @param results - * @param layerMask - */ - overlapRectangle(rect: Rectangle, results: Collider[], layerMask: number): number; - /** - * 获取所有落在指定圆圈内的碰撞器 - * @param circleCenter - * @param radius - * @param results - * @param layerMask - */ - overlapCircle(circleCenter: Vector2, radius: number, results: Collider[], layerMask: any): number; - /** - * 获取单元格的x,y值作为世界空间的x,y值 - * @param x - * @param y - */ - cellCoords(x: number, y: number): Vector2; - /** - * 获取世界空间x,y值的单元格。 - * 如果单元格为空且createCellIfEmpty为true,则会创建一个新的单元格 - * @param x - * @param y - * @param createCellIfEmpty - */ - cellAtPosition(x: number, y: number, createCellIfEmpty?: boolean): Collider[]; - } - /** - * 包装一个Unit32,列表碰撞器字典 - * 它的主要目的是将int、int x、y坐标散列到单个Uint32键中,使用O(1)查找。 - */ - class NumberDictionary { - _store: Map; - add(x: number, y: number, list: Collider[]): void; - /** - * 使用蛮力方法从字典存储列表中移除碰撞器 - * @param obj - */ - remove(obj: Collider): void; - tryGetValue(x: number, y: number): Collider[]; - getKey(x: number, y: number): number; - /** - * 清除字典数据 - */ - clear(): void; - } - class RaycastResultParser { - hitCounter: number; - static compareRaycastHits: (a: RaycastHit, b: RaycastHit) => number; - _hits: RaycastHit[]; - _tempHit: RaycastHit; - _checkedColliders: Collider[]; - _cellHits: RaycastHit[]; - _ray: Ray2D; - _layerMask: number; - start(ray: Ray2D, hits: RaycastHit[], layerMask: number): void; - /** - * 如果hits数组被填充,返回true。单元格不能为空! - * @param cellX - * @param cellY - * @param cell - */ - checkRayIntersection(cellX: number, cellY: number, cell: Collider[]): boolean; - reset(): void; - } -} -declare module es { - abstract class Shape { - /** - * 有一个单独的位置字段可以让我们改变形状的位置来进行碰撞检查,而不是改变entity.position。 - * 触发碰撞器/边界/散列更新的位置。 - * 内部字段 - */ - position: Vector2; - /** - * 这不是中心。这个值不一定是物体的中心。对撞机更准确。 - * 应用任何转换旋转的localOffset - * 内部字段 - */ - center: Vector2; - /** 缓存的形状边界 内部字段 */ - bounds: Rectangle; - abstract recalculateBounds(collider: Collider): any; - abstract overlaps(other: Shape): boolean; - abstract collidesWithShape(other: Shape, collisionResult: CollisionResult): boolean; - abstract collidesWithLine(start: Vector2, end: Vector2, hit: RaycastHit): boolean; - abstract containsPoint(point: Vector2): any; - abstract pointCollidesWithShape(point: Vector2, result: CollisionResult): boolean; - } -} -declare module es { - /** - * 多边形 - */ - class Polygon extends Shape { - /** - * 组成多边形的点 - * 保持顺时针与凸边形 - */ - points: Vector2[]; - _areEdgeNormalsDirty: boolean; - /** - * 多边形的原始数据 - */ - _originalPoints: Vector2[]; - _polygonCenter: Vector2; - /** - * 用于优化未旋转box碰撞 - */ - isBox: boolean; - isUnrotated: boolean; - /** - * 从点构造一个多边形 - * 多边形应该以顺时针方式指定 不能重复第一个/最后一个点,它们以0 0为中心 - * @param points - * @param isBox - */ - constructor(points: Vector2[], isBox?: boolean); - _edgeNormals: Vector2[]; - /** - * 边缘法线用于SAT碰撞检测。缓存它们用于避免squareRoots - * box只有两个边缘 因为其他两边是平行的 - */ - readonly edgeNormals: Vector2[]; - /** - * 重置点并重新计算中心和边缘法线 - * @param points - */ - setPoints(points: Vector2[]): void; - /** - * 重新计算多边形中心 - * 如果点数改变必须调用该方法 - */ - recalculateCenterAndEdgeNormals(): void; - /** - * 建立多边形边缘法线 - * 它们仅由edgeNormals getter惰性创建和更新 - */ - buildEdgeNormals(): void; - /** - * 建立一个对称的多边形(六边形,八角形,n角形)并返回点 - * @param vertCount - * @param radius - */ - static buildSymmetricalPolygon(vertCount: number, radius: number): any[]; - /** - * 重定位多边形的点 - * @param points - */ - static recenterPolygonVerts(points: Vector2[]): void; - /** - * 找到多边形的中心。注意,这对于正则多边形是准确的。不规则多边形没有中心。 - * @param points - */ - static findPolygonCenter(points: Vector2[]): Vector2; - /** - * 不知道辅助顶点,所以取每个顶点,如果你知道辅助顶点,执行climbing算法 - * @param points - * @param direction - */ - static getFarthestPointInDirection(points: Vector2[], direction: Vector2): Vector2; - /** - * 迭代多边形的所有边,并得到任意边上离点最近的点。 - * 通过最近点的平方距离和它所在的边的法线返回。 - * 点应该在多边形的空间中(点-多边形.位置) - * @param points - * @param point - * @param distanceSquared - * @param edgeNormal - */ - static getClosestPointOnPolygonToPoint(points: Vector2[], point: Vector2, distanceSquared: Ref, edgeNormal: Vector2): Vector2; - /** - * 旋转原始点并复制旋转的值到旋转的点 - * @param radians - * @param originalPoints - * @param rotatedPoints - */ - static rotatePolygonVerts(radians: number, originalPoints: Vector2[], rotatedPoints: Vector2[]): void; - recalculateBounds(collider: Collider): void; - overlaps(other: Shape): any; - collidesWithShape(other: Shape, result: CollisionResult): boolean; - collidesWithLine(start: es.Vector2, end: es.Vector2, hit: es.RaycastHit): boolean; - /** - * 本质上,这个算法所做的就是从一个点发射一条射线。 - * 如果它与奇数条多边形边相交,我们就知道它在多边形内部。 - * @param point - */ - containsPoint(point: Vector2): boolean; - pointCollidesWithShape(point: Vector2, result: CollisionResult): boolean; - } -} -declare module es { - /** - * 多边形的特殊情况。在进行SAT碰撞检查时,我们只需要检查2个轴而不是8个轴 - */ - class Box extends Polygon { - width: number; - height: number; - constructor(width: number, height: number); - /** - * 在一个盒子的形状中建立多边形需要的点的帮助方法 - * @param width - * @param height - */ - private static buildBox; - /** - * 更新框点,重新计算中心,设置宽度/高度 - * @param width - * @param height - */ - updateBox(width: number, height: number): void; - overlaps(other: Shape): any; - collidesWithShape(other: Shape, result: CollisionResult): boolean; - containsPoint(point: Vector2): boolean; - pointCollidesWithShape(point: es.Vector2, result: es.CollisionResult): boolean; - } -} -declare module es { - class Circle extends Shape { - radius: number; - _originalRadius: number; - constructor(radius: number); - recalculateBounds(collider: es.Collider): void; - overlaps(other: Shape): any; - collidesWithShape(other: Shape, result: CollisionResult): boolean; - collidesWithLine(start: es.Vector2, end: es.Vector2, hit: es.RaycastHit): boolean; - /** - * 获取所提供的点是否在此范围内 - * @param point - */ - containsPoint(point: es.Vector2): boolean; - pointCollidesWithShape(point: Vector2, result: CollisionResult): boolean; - } -} -declare module es { - class CollisionResult { - /** - * 与之相撞的对撞机 - */ - collider: Collider; - /** - * 被形状击中的表面的法向量 - */ - normal: Vector2; - /** - * 应用于第一个形状以推入形状的转换 - */ - minimumTranslationVector: Vector2; - /** - * 不是所有冲突类型都使用!在依赖这个字段之前,请检查ShapeCollisions切割类! - */ - point: Vector2; - /** - * 改变最小平移向量,如果没有相同方向上的运动,它将移除平移的x分量。 - * @param deltaMovement - */ - removeHorizontal(deltaMovement: Vector2): void; - invertResult(): this; - toString(): string; - } -} -declare module es { - class RealtimeCollisions { - static intersectMovingCircleBox(s: Circle, b: Box, movement: Vector2, time: Ref): boolean; - /** - * 支持函数,返回索引为n的矩形vert - * @param b - * @param n - */ - static corner(b: Rectangle, n: number): Vector2; - /** - * 检查圆是否与方框重叠,并返回point交点 - * @param cirlce - * @param box - * @param point - */ - static testCircleBox(cirlce: Circle, box: Box, point: Vector2): boolean; - } -} -declare module es { - /** - * 各种形状的碰撞例程 - * 大多数人都希望第一个形状位于第二个形状的空间内(即shape1) - * pos应该设置为shape1。pos - shape2.pos)。 - */ - class ShapeCollisions { - /** - * 检查两个多边形之间的碰撞 - * @param first - * @param second - * @param result - */ - static polygonToPolygon(first: Polygon, second: Polygon, result: CollisionResult): boolean; - /** - * 计算[minA, maxA]和[minB, maxB]之间的距离。如果间隔重叠,距离是负的 - * @param minA - * @param maxA - * @param minB - * @param maxB - */ - static intervalDistance(minA: number, maxA: number, minB: number, maxB: any): number; - /** - * 计算一个多边形在一个轴上的投影,并返回一个[min,max]区间 - * @param axis - * @param polygon - * @param min - * @param max - */ - static getInterval(axis: Vector2, polygon: Polygon, min: Ref, max: Ref): void; - /** - * - * @param circle - * @param polygon - * @param result - */ - static circleToPolygon(circle: Circle, polygon: Polygon, result?: CollisionResult): boolean; - /** - * 适用于中心在框内的圆,也适用于与框外中心重合的圆。 - * @param circle - * @param box - * @param result - */ - static circleToBox(circle: Circle, box: Box, result?: CollisionResult): boolean; - /** - * - * @param point - * @param circle - * @param result - */ - static pointToCircle(point: Vector2, circle: Circle, result: CollisionResult): boolean; - static pointToBox(point: Vector2, box: Box, result: CollisionResult): boolean; - /** - * - * @param lineA - * @param lineB - * @param closestTo - */ - static closestPointOnLine(lineA: Vector2, lineB: Vector2, closestTo: Vector2): Vector2; - /** - * - * @param point - * @param poly - * @param result - */ - static pointToPoly(point: Vector2, poly: Polygon, result: CollisionResult): boolean; - /** - * - * @param first - * @param second - * @param result - */ - static circleToCircle(first: Circle, second: Circle, result?: CollisionResult): boolean; - /** - * - * @param first - * @param second - * @param result - */ - static boxToBox(first: Box, second: Box, result: CollisionResult): boolean; - private static minkowskiDifference; - static lineToPoly(start: Vector2, end: Vector2, polygon: Polygon, hit?: RaycastHit): boolean; - static lineToLine(a1: Vector2, a2: Vector2, b1: Vector2, b2: Vector2, intersection: Vector2): boolean; - static lineToCircle(start: Vector2, end: Vector2, s: Circle, hit: RaycastHit): boolean; - /** - * 用second检查被deltaMovement移动的框的结果 - * @param first - * @param second - * @param movement - * @param hit - */ - static boxToBoxCast(first: Box, second: Box, movement: Vector2, hit: RaycastHit): boolean; - } -} -declare module es { - /** - * 用于包装事件的一个小类 - */ - class FuncPack { - /** 函数 */ - func: Function; - /** 上下文 */ - context: any; - constructor(func: Function, context: any); - } - /** - * 用于事件管理 - */ - class Emitter { - private _messageTable; - constructor(); - /** - * 开始监听项 - * @param eventType 监听类型 - * @param handler 监听函数 - * @param context 监听上下文 - */ - addObserver(eventType: T, handler: Function, context: any): void; - /** - * 移除监听项 - * @param eventType 事件类型 - * @param handler 事件函数 - */ - removeObserver(eventType: T, handler: Function): void; - /** - * 触发该事件 - * @param eventType 事件类型 - * @param data 事件数据 - */ - emit(eventType: T, ...data: any[]): void; - } -} -declare module es { - enum Edge { - top = 0, - bottom = 1, - left = 2, - right = 3 - } -} -declare module es { - class Enumerable { - /** - * 生成包含一个重复值的序列 - * @param element 要重复的值 - * @param count 在生成的序列中重复该值的次数 - */ - static repeat(element: T, count: number): any[]; - } -} -declare module es { - class EqualityComparer implements IEqualityComparer { - static default(): EqualityComparer; - protected constructor(); - equals(x: T, y: T): boolean; - getHashCode(o: T): number; - private _getHashCodeForNumber; - private _getHashCodeForString; - private forOwn; - } -} -declare module es { - class GlobalManager { - _enabled: boolean; - /** - * 如果true则启用了GlobalManager。 - * 状态的改变会导致调用OnEnabled/OnDisable - */ - /** - * 如果true则启用了GlobalManager。 - * 状态的改变会导致调用OnEnabled/OnDisable - * @param value - */ - enabled: boolean; - /** - * 启用/禁用这个GlobalManager - * @param isEnabled - */ - setEnabled(isEnabled: boolean): void; - /** - * 此GlobalManager启用时调用 - */ - onEnabled(): void; - /** - * 此GlobalManager禁用时调用 - */ - onDisabled(): void; - /** - * 在frame .update之前调用每一帧 - */ - update(): void; - } -} -declare module es { - class Hash { - /** - * 从一个字节数组中计算一个哈希值 - * @param data - */ - static computeHash(...data: number[]): number; - } -} -declare module es { - interface IComparer { - compare(x: T, y: T): number; - } -} -declare module es { - /** - * 对象声明自己的平等方法和Hashcode的生成 - */ - interface IEqualityComparable { - /** - * 确定另一个对象是否等于这个实例 - * @param other - */ - equals(other: any): boolean; - /** - * 生成对象的哈希码 - */ - getHashCode(): number; - } -} -declare module es { - /** - * 为确定对象的哈希码和两个项目是否相等提供接口 - */ - interface IEqualityComparer { - /** - * 判断两个对象是否相等 - * @param x - * @param y - */ - equals(x: T, y: T): boolean; - /** - * 生成对象的哈希码 - * @param value - */ - getHashCode(value: T): number; - } -} -declare module es { - /** - * 实现该接口用于判定两个对象是否相等的快速接口 - */ - interface IEquatable { - equals(other: T): boolean; - } -} -declare module es { - class Ref { - value: T; - constructor(value: T); - } -} -declare module es { - class Screen { - static width: number; - static height: number; - static readonly size: Vector2; - static readonly center: Vector2; - } -} -declare module es { - /** - * 管理数值的简单助手类。它存储值,直到累计的总数大于1。一旦超过1,该值将在调用update时添加到amount中。 - */ - class SubpixelNumber { - remainder: number; - /** - * 以amount递增余数,将值截断为int,存储新的余数并将amount设置为当前值。 - * @param amount - */ - update(amount: number): number; - /** - * 将余数重置为0。当一个物体与一个不可移动的物体碰撞时有用。 - * 在这种情况下,您将希望将亚像素余数归零,因为它是空的和无效的碰撞。 - */ - reset(): void; - } -} -declare module es { - /** - * 简单的剪耳三角测量器,最终的三角形将出现在triangleIndices列表中。 - */ - class Triangulator { - /** - * 上次三角函数调用中使用的点列表的三角列表条目索引 - */ - triangleIndices: number[]; - private _triPrev; - private _triNext; - static testPointTriangle(point: Vector2, a: Vector2, b: Vector2, c: Vector2): boolean; - /** - * 计算一个三角形列表,该列表完全覆盖给定点集所包含的区域。如果点不是CCW,则将arePointsCCW参数传递为false - * @param points 定义封闭路径的点列表 - * @param arePointsCCW - */ - triangulate(points: Vector2[], arePointsCCW?: boolean): void; - private initialize; - } -} -declare namespace es { - /** - * 记录时间的持续时间,一些设计灵感来自物理秒表。 - */ - class Stopwatch { - private readonly getSystemTime; - /** - * 秒表启动的系统时间。 - * undefined,如果秒表尚未启动,或已复位。 - */ - private _startSystemTime; - /** - * 秒表停止的系统时间。 - * undefined,如果秒表目前没有停止,尚未开始,或已复位。 - */ - private _stopSystemTime; - /** 自上次复位以来,秒表已停止的系统时间总数。 */ - private _stopDuration; - /** - * 用秒表计时,当前等待的切片开始的时间。 - * undefined,如果秒表尚未启动,或已复位。 - */ - private _pendingSliceStartStopwatchTime; - /** - * 记录自上次复位以来所有已完成切片的结果。 - */ - private _completeSlices; - constructor(getSystemTime?: GetTimeFunc); - getState(): State; - isIdle(): boolean; - isRunning(): boolean; - isStopped(): boolean; - /** - * - */ - slice(): Slice; - /** - * 获取自上次复位以来该秒表已完成/记录的所有片的列表。 - */ - getCompletedSlices(): Slice[]; - /** - * 获取自上次重置以来该秒表已完成/记录的所有片的列表,以及当前挂起的片。 - */ - getCompletedAndPendingSlices(): Slice[]; - /** - * 获取关于这个秒表当前挂起的切片的详细信息。 - */ - getPendingSlice(): Slice; - /** - * 获取当前秒表时间。这是这个秒表自上次复位以来运行的系统时间总数。 - */ - getTime(): number; - /** - * 完全重置这个秒表到它的初始状态。清除所有记录的运行持续时间、切片等。 - */ - reset(): void; - /** - * 开始(或继续)运行秒表。 - * @param forceReset - */ - start(forceReset?: boolean): void; - /** - * - * @param recordPendingSlice - */ - stop(recordPendingSlice?: boolean): number; - /** - * 计算指定秒表时间的当前挂起片。 - * @param endStopwatchTime - */ - private calculatePendingSlice; - /** - * 计算指定系统时间的当前秒表时间。 - * @param endSystemTime - */ - private caculateStopwatchTime; - /** - * 获取与当前秒表时间等效的系统时间。 - * 如果该秒表当前停止,则返回该秒表停止时的系统时间。 - */ - private getSystemTimeOfCurrentStopwatchTime; - /** - * 结束/记录当前挂起的片的私有实现。 - * @param endStopwatchTime - */ - private recordPendingSlice; - } - /** - * 返回某个系统的“当前时间”的函数。 - * 惟一的要求是,对该函数的每次调用都必须返回一个大于或等于前一次对该函数的调用的数字。 - */ - type GetTimeFunc = () => number; - enum State { - /** 秒表尚未启动,或已复位。 */ - IDLE = "IDLE", - /** 秒表正在运行。 */ - RUNNING = "RUNNING", - /** 秒表以前还在跑,但现在已经停了。 */ - STOPPED = "STOPPED" - } - function setDefaultSystemTimeGetter(systemTimeGetter?: GetTimeFunc): void; - /** - * 由秒表记录的单个“薄片”的测量值 - */ - interface Slice { - /** 秒表显示的时间在这一片开始的时候。 */ - readonly startTime: number; - /** 秒表在这片片尾的时间。 */ - readonly endTime: number; - /** 该切片的运行时间 */ - readonly duration: number; - } -} -declare module es { - class TimeRuler { - /** - * 最大条数 - */ - static readonly maxBars: number; - /** - * 每条的最大样本数 - */ - static readonly maxSamples: number; - /** - * - */ - static readonly maxNestCall: number; - /** - * 最大显示帧数 - */ - static readonly maxSampleFrames: number; - /** - * 拍摄快照的时间(以帧数为单位) - */ - static readonly logSnapDuration: number; - private logs; - private prevLog; - private curLog; - private frameCount; - private stopwatch; - private markers; - private markerNameToIdMap; - enabled: boolean; - private static _instance; - static readonly Instance: TimeRuler; - /** - * 你想在Game.Update方法的开头调用StartFrame。 - * 但是当游戏在固定时间步长模式下运行缓慢时,Game.Update会被多次调用。 - * 在这种情况下,我们应该忽略StartFrame的调用,为了做到这一点,我们只需要跟踪StartFrame的调用次数 - */ - private updateCount; - constructor(); - startFrame(): void; - /** - * 开始测量时间 - * @param markerName - * @param color - * @param barIndex - */ - beginMark(markerName: string, color: number, barIndex?: number): void; - /** - * 停止测量 - * @param markerName - * @param barIndex - */ - endMark(markerName: string, barIndex?: number): void; - /** - * 获取给定条形指数和标记名称的平均时间 - * @param barIndex - * @param markerName - */ - getAverageTime(barIndex: number, markerName: string): number; - /** - * 重置标记记录 - */ - resetLog(): void; - } -} -declare module es { - /** - * 创建这个字典的原因只有一个: - * 我需要一个能让我直接以数组的形式对值进行迭代的字典,而不需要生成一个数组或使用迭代器。 - * 对于这个目标是比标准字典快N倍。 - * Faster dictionary在大部分操作上也比标准字典快,但差别可以忽略不计。 - * 唯一较慢的操作是在添加时调整内存大小,因为与标准数组相比,这个实现需要使用两个单独的数组。 - */ - class FasterDictionary { - _values: TValue[]; - _valuesInfo: FastNode[]; - _buckets: number[]; - _freeValueCellIndex: number; - _collisions: number; - constructor(size?: number); - getValuesArray(count: { - value: number; - }): TValue[]; - readonly valuesArray: TValue[]; - readonly count: number; - add(key: TKey, value: TValue): void; - addValue(key: TKey, value: TValue, indexSet: { - value: number; - }): boolean; - remove(key: TKey): boolean; - trim(): void; - clear(): void; - fastClear(): void; - containsKey(key: TKey): boolean; - tryGetValue(key: TKey): TValue; - tryFindIndex(key: TKey, findIndex: { - value: number; - }): boolean; - getDirectValue(index: number): TValue; - getIndex(key: TKey): number; - static updateLinkedList(index: number, valuesInfo: FastNode[]): void; - static hash(key: any): number; - static reduce(x: number, n: number): number; - } - class FastNode { - readonly key: any; - readonly hashcode: number; - previous: number; - next: number; - constructor(key: any, hash: number, previousNode?: number); - } -} -declare module es { - class Node { - element: T; - next: Node; - constructor(element: T, next?: Node); - } - interface equalsFnType { - (a: T, b: T): boolean; - } - function defaultEquals(a: T, b: T): boolean; - class LinkedList { - protected count: number; - protected next: any; - protected equalsFn: equalsFnType; - protected head: Node; - constructor(equalsFn?: typeof defaultEquals); - push(element: T): void; - removeAt(index: number): T; - getElementAt(index: number): Node; - insert(element: T, index: number): boolean; - indexOf(element: T): number; - remove(element: T): void; - clear(): void; - size(): number; - isEmpty(): boolean; - getHead(): Node; - toString(): string; - } -} -declare module es { - /** - * 可以用于列表池的简单类 - */ - class ListPool { - private static readonly _objectQueue; - /** - * 预热缓存,使用最大的cacheCount对象填充缓存 - * @param cacheCount - */ - static warmCache(cacheCount: number): void; - /** - * 将缓存修剪为cacheCount项目 - * @param cacheCount - */ - static trimCache(cacheCount: any): void; - /** - * 清除缓存 - */ - static clearCache(): void; - /** - * 如果可以的话,从堆栈中弹出一个项 - */ - static obtain(): T[]; - /** - * 将项推回堆栈 - * @param obj - */ - static free(obj: Array): void; - } -} -declare module es { - /** - * 用于管理一对对象的简单DTO - */ - class Pair implements IEqualityComparable { - first: T; - second: T; - constructor(first: T, second: T); - clear(): void; - equals(other: Pair): boolean; - getHashCode(): number; - } -} -declare module es { - /** - * 用于池任何对象 - */ - class Pool { - private static _objectQueue; - /** - * 预热缓存,使用最大的cacheCount对象填充缓存 - * @param type - * @param cacheCount - */ - static warmCache(type: any, cacheCount: number): void; - /** - * 将缓存修剪为cacheCount项目 - * @param cacheCount - */ - static trimCache(cacheCount: number): void; - /** - * 清除缓存 - */ - static clearCache(): void; - /** - * 如果可以的话,从堆栈中弹出一个项 - */ - static obtain(type: any): T; - /** - * 将项推回堆栈 - * @param obj - */ - static free(obj: T): void; - } - interface IPoolable { - /** - * 重置对象以供重用。对象引用应该为空,字段可以设置为默认值 - */ - reset(): any; - } - var isIPoolable: (props: any) => props is IPoolable; -} -declare module es { - interface ISet { - add(item: T): boolean; - remove(item: T): boolean; - contains(item: T): boolean; - getCount(): number; - clear(): void; - toArray(): Array; - /** - * 从当前集合中删除指定集合中的所有元素 - * @param other - */ - exceptWith(other: Array): void; - /** - * 修改当前Set对象,使其只包含该对象和指定数组中的元素 - * @param other - */ - intersectWith(other: Array): void; - /** - * 修改当前的集合对象,使其包含所有存在于自身、指定集合中的元素,或者两者都包含 - * @param other - */ - unionWith(other: Array): void; - isSubsetOf(other: Array): boolean; - isSupersetOf(other: Array): boolean; - overlaps(other: Array): boolean; - setEquals(other: Array): boolean; - } - abstract class Set implements ISet { - protected buckets: T[][]; - protected count: number; - constructor(source?: Array); - abstract getHashCode(item: T): number; - abstract areEqual(value1: T, value2: T): boolean; - add(item: T): boolean; - remove(item: T): boolean; - contains(item: T): boolean; - getCount(): number; - clear(): void; - toArray(): T[]; - /** - * 从当前集合中删除指定集合中的所有元素 - * @param other - */ - exceptWith(other: Array): void; - /** - * 修改当前Set对象,使其只包含该对象和指定数组中的元素 - * @param other - */ - intersectWith(other: Array): void; - unionWith(other: Array): void; - /** - * 确定当前集合是否为指定集合或数组的子集 - * @param other - */ - isSubsetOf(other: Array): boolean; - /** - * 确定当前不可变排序集是否为指定集合的超集 - * @param other - */ - isSupersetOf(other: Array): boolean; - overlaps(other: Array): boolean; - setEquals(other: Array): boolean; - private buildInternalBuckets; - private bucketsContains; - } - class HashSet extends Set { - constructor(source?: Array); - getHashCode(item: T): number; - areEqual(value1: T, value2: T): boolean; - } -} -declare module es { - /** - * startCoroutine返回的接口,它提供了中途停止coroutine的能力。 - */ - interface ICoroutine { - /** - * 停止Coroutine - */ - stop(): any; - /** - * 设置Coroutine是否应该使用deltaTime或unscaledDeltaTime进行计时 - * @param useUnscaledDeltaTime - */ - setUseUnscaledDeltaTime(useUnscaledDeltaTime: boolean): ICoroutine; - } - class Coroutine { - /** - * 导致Coroutine在指定的时间内暂停。在Coroutine.waitForSeconds的基础上,在Coroutine中使用Yield - * @param seconds - */ - static waitForSeconds(seconds: number): WaitForSeconds; - } - /** - * 帮助类,用于当一个coroutine想要暂停一段时间时。返回Coroutine.waitForSeconds返回其中一个 - */ - class WaitForSeconds { - static waiter: WaitForSeconds; - waitTime: number; - wait(seconds: number): WaitForSeconds; - } -} -declare module es { - /** - * CoroutineManager用于隐藏Coroutine所需数据的内部类 - */ - class CoroutineImpl implements ICoroutine, IPoolable { - enumerator: any; - /** - * 每当产生一个延迟,它就会被添加到跟踪延迟的waitTimer中 - */ - waitTimer: number; - isDone: boolean; - waitForCoroutine: CoroutineImpl; - useUnscaledDeltaTime: boolean; - stop(): void; - setUseUnscaledDeltaTime(useUnscaledDeltaTime: boolean): this; - prepareForUse(): void; - reset(): void; - } - class CoroutineManager extends GlobalManager { - /** - * 标志来跟踪我们何时处于更新循环中。 - * 如果在更新循环中启动了一个新的coroutine,我们必须将它贴在shouldRunNextFrame列表中,以避免在迭代时修改一个数组 - */ - _isInUpdate: boolean; - _unblockedCoroutines: CoroutineImpl[]; - _shouldRunNextFrame: CoroutineImpl[]; - /** - * 将IEnumerator添加到CoroutineManager中 - * Coroutine在每一帧调用Update之前被执行 - * @param enumerator - */ - startCoroutine(enumerator: any): CoroutineImpl; - update(): void; - /** - * 勾选一个coroutine,如果该coroutine应该在下一帧继续运行,则返回true。本方法会将完成的coroutine放回Pool - * @param coroutine - */ - tickCoroutine(coroutine: CoroutineImpl): boolean; - } -} -declare module es { - class MaxRectsBinPack { - binWidth: number; - binHeight: number; - allowRotations: boolean; - usedRectangles: Rectangle[]; - freeRectangles: Rectangle[]; - constructor(width: number, height: number, rotations?: boolean); - init(width: number, height: number, rotations?: boolean): void; - insert(width: number, height: number): Rectangle; - findPositionForNewNodeBestAreaFit(width: number, height: number, bestAreaFit: Ref, bestShortSideFit: Ref): Rectangle; - splitFreeNode(freeNode: Rectangle, usedNode: Rectangle): boolean; - pruneFreeList(): void; - isContainedIn(a: Rectangle, b: Rectangle): boolean; - } -} -declare class ArrayUtils { - /** - * 执行冒泡排序 - * @param ary - */ - static bubbleSort(ary: number[]): void; - /** - * 执行插入排序 - * @param ary - */ - static insertionSort(ary: number[]): void; - /** - * 执行二分搜索 - * @param ary 搜索的数组(必须排序过) - * @param value 需要搜索的值 - * @returns 返回匹配结果的数组索引 - */ - static binarySearch(ary: number[], value: number): number; - /** - * 返回匹配项的索引 - * @param ary - * @param num - */ - static findElementIndex(ary: any[], num: any): any; - /** - * 返回数组中最大值的索引 - * @param ary - */ - static getMaxElementIndex(ary: number[]): number; - /** - * 返回数组中最小值的索引 - * @param ary - */ - static getMinElementIndex(ary: number[]): number; - /** - * 返回一个"唯一性"数组 - * @param ary 需要唯一性的数组 - * @returns 唯一性的数组 - * - * @tutorial - * 比如: [1, 2, 2, 3, 4] - * 返回: [1, 2, 3, 4] - */ - static getUniqueAry(ary: number[]): number[]; - /** - * 返回2个数组中不同的部分 - * 比如数组A = [1, 2, 3, 4, 6] - * 数组B = [0, 2, 1, 3, 4] - * 返回[6, 0] - * @param aryA - * @param aryB - * @return - */ - static getDifferAry(aryA: number[], aryB: number[]): number[]; - /** - * 交换数组元素 - * @param array 目标数组 - * @param index1 交换后的索引 - * @param index2 交换前的索引 - */ - static swap(array: any[], index1: number, index2: number): void; - /** - * 清除列表 - * @param ary - */ - static clearList(ary: any[]): void; - /** - * 克隆一个数组 - * @param ary 需要克隆的数组 - * @return 克隆的数组 - */ - static cloneList(ary: any[]): any[]; - /** - * 判断2个数组是否相同 - * @param ary1 数组1 - * @param ary2 数组2 - */ - static equals(ary1: number[], ary2: number[]): Boolean; - /** - * 根据索引插入元素,索引和索引后的元素都向后移动一位 - * @param ary - * @param index 插入索引 - * @param value 插入的元素 - * @returns 插入的元素 未插入则返回空 - */ - static insert(ary: any[], index: number, value: any): any; - /** - * 打乱数组 Fisher–Yates shuffle - * @param list - */ - static shuffle(list: T[]): void; - /** - * 如果项目已经在列表中,返回false,如果成功添加,返回true - * @param list - * @param item - */ - static addIfNotPresent(list: T[], item: T): boolean; - /** - * 返回列表中的最后一项。列表中至少应该有一个项目 - * @param list - */ - static lastItem(list: T[]): T; - /** - * 从列表中随机获取一个项目。不清空检查列表! - * @param list - */ - static randomItem(list: T[]): T; - /** - * 从列表中随机获取物品。不清空检查列表,也不验证列表数是否大于项目数。返回的List可以通过ListPool.free放回池中 - * @param list - * @param itemCount 从列表中返回的随机项目的数量 - */ - static randomItems(list: T[], itemCount: number): T[]; -} -declare module es { - class Base64Utils { - private static _keyStr; - /** - * 判断是否原生支持Base64位解析 - */ - static readonly nativeBase64: boolean; - /** - * 解码 - * @param input - */ - static decode(input: string): string; - /** - * 编码 - * @param input - */ - static encode(input: string): string; - /** - * 解析Base64格式数据 - * @param input - * @param bytes - */ - static decodeBase64AsArray(input: string, bytes: number): Uint32Array; - /** - * 暂时不支持 - * @param data - * @param decoded - * @param compression - * @private - */ - static decompress(data: string, decoded: any, compression: string): any; - /** - * 解析csv数据 - * @param input - */ - static decodeCSV(input: string): Array; - } -} -declare module es { - class EdgeExt { - static oppositeEdge(self: Edge): Edge; - /** - * 如果边是右或左,则返回true - * @param self - */ - static isHorizontal(self: Edge): boolean; - /** - * 如果边是顶部或底部,则返回true - * @param self - */ - static isVertical(self: Edge): boolean; - } -} -declare module es { - class NumberExtension { - static toNumber(value: any): number; - } -} -declare class RandomUtils { - /** - * 在 start 与 stop之间取一个随机整数,可以用step指定间隔, 但不包括较大的端点(start与stop较大的一个) - * 如 - * this.randrange(1, 10, 3) - * 则返回的可能是 1 或 4 或 7 , 注意 这里面不会返回10,因为是10是大端点 - * - * @param start - * @param stop - * @param step - * @return 假设 start < stop, [start, stop) 区间内的随机整数 - * - */ - static randrange(start: number, stop: number, step?: number): number; - /** - * 返回a 到 b之间的随机整数,包括 a 和 b - * @param a - * @param b - * @return [a, b] 之间的随机整数 - * - */ - static randint(a: number, b: number): number; - /** - * 返回 a - b之间的随机数,不包括 Math.max(a, b) - * @param a - * @param b - * @return 假设 a < b, [a, b) - */ - static randnum(a: number, b: number): number; - /** - * 打乱数组 - * @param array - * @return - */ - static shuffle(array: any[]): any[]; - /** - * 从序列中随机取一个元素 - * @param sequence 可以是 数组、 vector,等只要是有length属性,并且可以用数字索引获取元素的对象, - * 另外,字符串也是允许的。 - * @return 序列中的某一个元素 - * - */ - static choice(sequence: any): any; - /** - * 对列表中的元素进行随机采æ ? - *
-     * this.sample([1, 2, 3, 4, 5],  3)  // Choose 3 elements
-     * [4, 1, 5]
-     * 
- * @param sequence - * @param num - * @return - * - */ - static sample(sequence: any[], num: number): any[]; - /** - * 返回 0.0 - 1.0 之间的随机数,等同于 Math.random() - * @return Math.random() - * - */ - static random(): number; - /** - * 计算概率 - * @param chance 概率 - * @return - */ - static boolean(chance?: number): boolean; - private static _randomCompare; -} -declare module es { - class RectangleExt { - /** - * 获取指定边的位置 - * @param rect - * @param edge - */ - static getSide(rect: Rectangle, edge: Edge): number; - /** - * 计算两个矩形的并集。结果将是一个包含其他两个的矩形。 - * @param first - * @param point - */ - static union(first: Rectangle, point: Vector2): Rectangle; - static getHalfRect(rect: Rectangle, edge: Edge): Rectangle; - /** - * 获取矩形的一部分,其宽度/高度的大小位于矩形的边缘,但仍然包含在其中。 - * @param rect - * @param edge - * @param size - */ - static getRectEdgePortion(rect: Rectangle, edge: Edge, size?: number): Rectangle; - static expandSide(rect: Rectangle, edge: Edge, amount: number): void; - static contract(rect: Rectangle, horizontalAmount: any, verticalAmount: any): void; - /** - * 给定多边形的点,计算其边界 - * @param points - */ - static boundsFromPolygonVector(points: Vector2[]): Rectangle; - /** - * 创建一个给定最小/最大点(左上角,右下角)的矩形 - * @param min - * @param max - */ - static fromMinMaxVector(min: Vector2, max: Vector2): Rectangle; - /** - * 返回一个跨越当前边界和提供的delta位置的Bounds - * @param rect - * @param deltaX - * @param deltaY - */ - static getSweptBroadphaseBounds(rect: Rectangle, deltaX: number, deltaY: number): Rectangle; - /** - * 如果矩形发生碰撞,返回true - * moveX和moveY将返回b1为避免碰撞而必须移动的移动量 - * @param rect - * @param other - * @param moveX - * @param moveY - */ - collisionCheck(rect: Rectangle, other: Rectangle, moveX: Ref, moveY: Ref): boolean; - /** - * 计算两个矩形之间有符号的交点深度 - * @param rectA - * @param rectB - * @returns 两个相交的矩形之间的重叠量。 - * 这些深度值可以是负值,取决于矩形相交的边。 - * 这允许调用者确定正确的推送对象的方向,以解决碰撞问题。 - * 如果矩形不相交,则返回Vector2.zero。 - */ - static getIntersectionDepth(rectA: Rectangle, rectB: Rectangle): Vector2; - } -} -declare module es { - class TextureUtils { - static premultiplyAlpha(pixels: number[]): void; - } -} -declare module es { - class TypeUtils { - static getType(obj: any): any; - } -} -declare module es { - class Vector2Ext { - /** - * 检查三角形是CCW还是CW - * @param a - * @param center - * @param c - */ - static isTriangleCCW(a: Vector2, center: Vector2, c: Vector2): boolean; - static halfVector(): Vector2; - /** - * 计算二维伪叉乘点(Perp(u), v) - * @param u - * @param v - */ - static cross(u: Vector2, v: Vector2): number; - /** - * 返回垂直于传入向量的向量 - * @param first - * @param second - */ - static perpendicular(first: Vector2, second: Vector2): Vector2; - /** - * 将x/y值翻转,并将y反转,得到垂直于x/y的值 - * @param original - */ - static perpendicularFlip(original: Vector2): Vector2; - /** - * 返回两个向量之间的角度,单位为度 - * @param from - * @param to - */ - static angle(from: Vector2, to: Vector2): number; - /** - * 给定两条直线(ab和cd),求交点 - * @param a - * @param b - * @param c - * @param d - * @param intersection - */ - static getRayIntersection(a: Vector2, b: Vector2, c: Vector2, d: Vector2, intersection?: Vector2): boolean; - /** - * Vector2的临时解决方案 - * 标准化把向量弄乱了 - * @param vec - */ - static normalize(vec: Vector2): void; - /** - * 通过指定的矩阵对Vector2的数组中的向量应用变换,并将结果放置在另一个数组中。 - * @param sourceArray - * @param sourceIndex - * @param matrix - * @param destinationArray - * @param destinationIndex - * @param length - */ - static transformA(sourceArray: Vector2[], sourceIndex: number, matrix: Matrix2D, destinationArray: Vector2[], destinationIndex: number, length: number): void; - /** - * 创建一个新的Vector2,该Vector2包含了通过指定的Matrix进行的二维向量变换 - * @param position - * @param matrix - * @param result - */ - static transformR(position: Vector2, matrix: Matrix2D, result?: Vector2): void; - /** - * 通过指定的矩阵对Vector2的数组中的所有向量应用变换,并将结果放到另一个数组中。 - * @param sourceArray - * @param matrix - * @param destinationArray - */ - static transform(sourceArray: Vector2[], matrix: Matrix2D, destinationArray: Vector2[]): void; - static round(vec: Vector2): Vector2; - } -} -declare module linq { - class Enumerable { - /** - * 在指定范围内生成一个整数序列。 - */ - static range(start: number, count: number): List; - /** - * 生成包含一个重复值的序列。 - */ - static repeat(element: T, count: number): List; - } -} -declare module linq { - /** - * 检查传递的参数是否为对象 - */ - const isObj: (x: T) => boolean; - /** - * 创建一个否定谓词结果的函数 - */ - const negate: (pred: (...args: T[]) => boolean) => (...args: T[]) => boolean; - /** - * 比较器助手 - */ - const composeComparers: (previousComparer: (a: T, b: T) => number, currentComparer: (a: T, b: T) => number) => (a: T, b: T) => number; - const keyComparer: (_keySelector: (key: T) => string, descending?: boolean) => (a: T, b: T) => number; -} -declare module linq { - type PredicateType = (value?: T, index?: number, list?: T[]) => boolean; - class List { - protected _elements: T[]; - /** - * 默认为列表的元素 - */ - constructor(elements?: T[]); - /** - * 在列表的末尾添加一个对象。 - */ - add(element: T): void; - /** - * 将一个对象追加到列表的末尾。 - */ - append(element: T): void; - /** - * 在列表的开头添加一个对象。 - */ - prepend(element: T): void; - /** - * 将指定集合的元素添加到列表的末尾。 - */ - addRange(elements: T[]): void; - /** - * 对序列应用累加器函数。 - */ - aggregate(accumulator: (accum: U, value?: T, index?: number, list?: T[]) => any, initialValue?: U): any; - /** - * 确定序列的所有元素是否满足一个条件。 - */ - all(predicate: PredicateType): boolean; - /** - * 确定序列是否包含任何元素。 - */ - any(): boolean; - any(predicate: PredicateType): boolean; - /** - * 计算通过对输入序列的每个元素调用转换函数获得的一系列数值的平均值。 - */ - average(): number; - average(transform: (value?: T, index?: number, list?: T[]) => any): number; - /** - * 将序列的元素转换为指定的类型。 - */ - cast(): List; - /** - * 从列表中删除所有元素。 - */ - clear(): void; - /** - * 连接两个序列。 - */ - concat(list: List): List; - /** - * 确定一个元素是否在列表中。 - */ - contains(element: T): boolean; - /** - * 返回序列中元素的数量。 - */ - count(): number; - count(predicate: PredicateType): number; - /** - * 返回指定序列的元素,或者如果序列为空,则返回单例集合中类型参数的默认值。 - */ - defaultIfEmpty(defaultValue?: T): List; - /** - * 根据指定的键选择器从序列中返回不同的元素。 - */ - distinctBy(keySelector: (key: T) => string | number): List; - /** - * 返回序列中指定索引处的元素。 - */ - elementAt(index: number): T; - /** - * 返回序列中指定索引处的元素,如果索引超出范围,则返回默认值。 - */ - elementAtOrDefault(index: number): T | null; - /** - * 通过使用默认的相等比较器来比较值,生成两个序列的差值集。 - */ - except(source: List): List; - /** - * 返回序列的第一个元素。 - */ - first(): T; - first(predicate: PredicateType): T; - /** - * 返回序列的第一个元素,如果序列不包含元素,则返回默认值。 - */ - firstOrDefault(): T; - firstOrDefault(predicate: PredicateType): T; - /** - * 对列表中的每个元素执行指定的操作。 - */ - forEach(action: (value?: T, index?: number, list?: T[]) => any): void; - /** - * 根据指定的键选择器函数对序列中的元素进行分组。 - */ - groupBy(grouper: (key: T) => string | number, mapper?: (element: T) => TResult): { - [key: string]: TResult[]; - }; - /** - * 根据键的相等将两个序列的元素关联起来,并将结果分组。默认的相等比较器用于比较键。 - */ - groupJoin(list: List, key1: (k: T) => any, key2: (k: U) => any, result: (first: T, second: List) => R): List; - /** - * 返回列表中某个元素第一次出现的索引。 - */ - indexOf(element: T): number; - /** - * 向列表中插入一个元素在指定索引处。 - */ - insert(index: number, element: T): void | Error; - /** - * 通过使用默认的相等比较器来比较值,生成两个序列的交集集。 - */ - intersect(source: List): List; - /** - * 基于匹配的键将两个序列的元素关联起来。默认的相等比较器用于比较键。 - */ - join(list: List, key1: (key: T) => any, key2: (key: U) => any, result: (first: T, second: U) => R): List; - /** - * 返回序列的最后一个元素。 - */ - last(): T; - last(predicate: PredicateType): T; - /** - * 返回序列的最后一个元素,如果序列不包含元素,则返回默认值。 - */ - lastOrDefault(): T; - lastOrDefault(predicate: PredicateType): T; - /** - * 返回泛型序列中的最大值。 - */ - max(): number; - max(selector: (value: T, index: number, array: T[]) => number): number; - /** - * 返回泛型序列中的最小值。 - */ - min(): number; - min(selector: (value: T, index: number, array: T[]) => number): number; - /** - * 根据指定的类型筛选序列中的元素。 - */ - ofType(type: any): List; - /** - * 根据键按升序对序列中的元素进行排序。 - */ - orderBy(keySelector: (key: T) => any, comparer?: (a: T, b: T) => number): List; - /** - * 根据键值降序对序列中的元素进行排序。 - */ - orderByDescending(keySelector: (key: T) => any, comparer?: (a: T, b: T) => number): List; - /** - * 按键按升序对序列中的元素执行后续排序。 - */ - thenBy(keySelector: (key: T) => any): List; - /** - * 根据键值按降序对序列中的元素执行后续排序。 - */ - thenByDescending(keySelector: (key: T) => any): List; - /** - * 从列表中删除第一个出现的特定对象。 - */ - remove(element: T): boolean; - /** - * 删除与指定谓词定义的条件匹配的所有元素。 - */ - removeAll(predicate: PredicateType): List; - /** - * 删除列表指定索引处的元素。 - */ - removeAt(index: number): void; - /** - * 颠倒整个列表中元素的顺序。 - */ - reverse(): List; - /** - * 将序列中的每个元素投射到一个新形式中。 - */ - select(selector: (element: T, index: number) => TOut): List; - /** - * 将序列的每个元素投影到一个列表中。并将得到的序列扁平化为一个序列。 - */ - selectMany>(selector: (element: T, index: number) => TOut): TOut; - /** - * 通过使用默认的相等比较器对元素的类型进行比较,确定两个序列是否相等。 - */ - sequenceEqual(list: List): boolean; - /** - * 返回序列中唯一的元素,如果序列中没有恰好一个元素,则抛出异常。 - */ - single(predicate?: PredicateType): T; - /** - * 返回序列中唯一的元素,如果序列为空,则返回默认值;如果序列中有多个元素,此方法将抛出异常。 - */ - singleOrDefault(predicate?: PredicateType): T; - /** - * 绕过序列中指定数量的元素,然后返回剩余的元素。 - */ - skip(amount: number): List; - /** - * 省略序列中最后指定数量的元素,然后返回剩余的元素。 - */ - skipLast(amount: number): List; - /** - * 只要指定条件为真,就绕过序列中的元素,然后返回剩余的元素。 - */ - skipWhile(predicate: PredicateType): List; - /** - * 计算通过对输入序列的每个元素调用转换函数获得的数值序列的和。 - */ - sum(): number; - sum(transform: (value?: T, index?: number, list?: T[]) => number): number; - /** - * 从序列的开始返回指定数量的连续元素。 - */ - take(amount: number): List; - /** - * 从序列的末尾返回指定数目的连续元素。 - */ - takeLast(amount: number): List; - /** - * 返回序列中的元素,只要指定的条件为真。 - */ - takeWhile(predicate: PredicateType): List; - /** - * 复制列表中的元素到一个新数组。 - */ - toArray(): T[]; - /** - * 创建一个从List< T>根据指定的键选择器函数。 - */ - toDictionary(key: (key: T) => TKey): List<{ - Key: TKey; - Value: T; - }>; - toDictionary(key: (key: T) => TKey, value: (value: T) => TValue): List<{ - Key: TKey; - Value: T | TValue; - }>; - /** - * 创建一个Set从一个Enumerable.List< T>。 - */ - toSet(): Set; - /** - * 创建一个List< T>从一个Enumerable.List< T>。 - */ - toList(): List; - /** - * 创建一个查找,TElement>从一个IEnumerable< T>根据指定的键选择器和元素选择器函数。 - */ - toLookup(keySelector: (key: T) => string | number, elementSelector: (element: T) => TResult): { - [key: string]: TResult[]; - }; - /** - * 基于谓词过滤一系列值。 - */ - where(predicate: PredicateType): List; - /** - * 将指定的函数应用于两个序列的对应元素,生成结果序列。 - */ - zip(list: List, result: (first: T, second: U) => TOut): List; - } - /** - * 表示已排序的序列。该类的方法是通过使用延迟执行来实现的。 - * 即时返回值是一个存储执行操作所需的所有信息的对象。 - * 在通过调用对象的ToDictionary、ToLookup、ToList或ToArray方法枚举对象之前,不会执行由该方法表示的查询 - */ - class OrderedList extends List { - private _comparer; - constructor(elements: T[], _comparer: (a: T, b: T) => number); - /** - * 按键按升序对序列中的元素执行后续排序。 - * @override - */ - thenBy(keySelector: (key: T) => any): List; - /** - * 根据键值按降序对序列中的元素执行后续排序。 - * @override - */ - thenByDescending(keySelector: (key: T) => any): List; - } -} -declare module es { - /** - * 一段的终点 - */ - class EndPoint { - /** 该部分的位置 */ - position: Vector2; - /** 如果这个端点是一个段的起始点或终点(每个段只有一个起始点和一个终点) */ - begin: boolean; - /** 该端点所属的段 */ - segment: Segment; - /** 端点相对于能见度测试位置的角度 */ - angle: number; - constructor(); - } - class EndPointComparer implements IComparer { - /** - * 按角度对点进行排序的比较功能 - * @param a - * @param b - */ - compare(a: EndPoint, b: EndPoint): 0 | 1 | -1; - } -} -declare module es { - /** - * 表示可见性网格中的遮挡线段 - */ - class Segment { - /** - * 该部分的第一个终点 - */ - p1: EndPoint; - /** - * 该部分的第二个终点 - */ - p2: EndPoint; - constructor(); - } -} -declare module es { - /** - * 类,它可以计算出一个网格,表示从给定的一组遮挡物的原点可以看到哪些区域。使用方法如下。 - * - * - 调用 begin - * - 添加任何遮挡物 - * - 调用end来获取可见度多边形。当调用end时,所有的内部存储都会被清空。 - */ - class VisibilityComputer { - /** - * 在近似圆的时候要用到的线的总数。只需要一个180度的半球,所以这将是近似该半球的线段数 - */ - lineCountForCircleApproximation: number; - _radius: number; - _origin: Vector2; - _isSpotLight: boolean; - _spotStartAngle: number; - _spotEndAngle: number; - _endPoints: EndPoint[]; - _segments: Segment[]; - _radialComparer: EndPointComparer; - static _cornerCache: Vector2[]; - static _openSegments: LinkedList; - constructor(origin?: Vector2, radius?: number); - /** - * 增加了一个对撞机作为PolyLight的遮蔽器 - * @param collider - */ - addColliderOccluder(collider: Collider): void; - /** - * 增加了一个圆形的遮挡器 - * @param position - * @param radius - */ - addCircleOccluder(position: Vector2, radius: number): void; - /** - * 增加一个线型遮挡器 - * @param p1 - * @param p2 - */ - addLineOccluder(p1: Vector2, p2: Vector2): void; - /** - * 增加一个方形的遮挡器 - * @param bounds - */ - addSquareOccluder(bounds: Rectangle): void; - /** - * 添加一个段,第一个点在可视化中显示,但第二个点不显示。 - * 每个端点都是两个段的一部分,但我们希望只显示一次 - * @param p1 - * @param p2 - */ - addSegment(p1: Vector2, p2: Vector2): void; - /** - * 移除所有的遮挡物 - */ - clearOccluders(): void; - /** - * 为计算机计算当前的聚光做好准备 - * @param origin - * @param radius - */ - begin(origin: Vector2, radius: number): void; - /** - * 计算可见性多边形,并返回三角形扇形的顶点(减去中心顶点)。返回的数组来自ListPool - */ - end(): Vector2[]; - addTriangle(triangles: Vector2[], angle1: number, angle2: number, segment: Segment): void; - /** - * 计算直线p1-p2与p3-p4的交点 - * @param p1 - * @param p2 - * @param p3 - * @param p4 - */ - static lineLineIntersection(p1: Vector2, p2: Vector2, p3: Vector2, p4: Vector2): Vector2; - static between(value: number, min: number, max: number): boolean; - /** - * 辅助函数,用于沿外周线构建分段,以限制光的半径。 - */ - loadRectangleBoundaries(): void; - /** - * 助手:我们知道a段在b的前面吗?实现不反对称(也就是说,isSegmentInFrontOf(a, b) != (!isSegmentInFrontOf(b, a)))。 - * 另外要注意的是,在可见性算法中,它只需要在有限的一组情况下工作,我不认为它能处理所有的情况。 - * 见http://www.redblobgames.com/articles/visibility/segment-sorting.html - * @param a - * @param b - * @param relativeTo - */ - isSegmentInFrontOf(a: Segment, b: Segment, relativeTo: Vector2): boolean; - /** - * 返回略微缩短的向量:p * (1 - f) + q * f - * @param p - * @param q - * @param f - */ - static interpolate(p: Vector2, q: Vector2, f: number): Vector2; - /** - * 返回点是否在直线p1-p2的 "左边"。 - * @param p1 - * @param p2 - * @param point - */ - static isLeftOf(p1: Vector2, p2: Vector2, point: Vector2): boolean; - /** - * 处理片段,以便我们稍后对它们进行分类 - */ - updateSegments(): void; - } -} -declare module es { - interface ITimer { - context: any; - /** - * 调用stop以停止此计时器再次运行。这对非重复计时器没有影响。 - */ - stop(): any; - /** - * 将计时器的运行时间重置为0 - */ - reset(): any; - /** - * 返回投向T的上下文,作为方便 - */ - getContext(): T; - } -} -declare module es { - /** - * 私有类隐藏ITimer的实现 - */ - class Timer implements ITimer { - context: any; - _timeInSeconds: number; - _repeats: boolean; - _onTime: (timer: ITimer) => void; - _isDone: boolean; - _elapsedTime: number; - getContext(): T; - reset(): void; - stop(): void; - tick(): boolean; - initialize(timeInsSeconds: number, repeats: boolean, context: any, onTime: (timer: ITimer) => void): void; - /** - * 空出对象引用,以便在js需要时GC可以清理它们的引用 - */ - unload(): void; - } -} -declare module es { - /** - * 允许动作的延迟和重复执行 - */ - class TimerManager extends GlobalManager { - _timers: Timer[]; - update(): void; - /** - * 调度一个一次性或重复的计时器,该计时器将调用已传递的动作 - * @param timeInSeconds - * @param repeats - * @param context - * @param onTime - */ - schedule(timeInSeconds: number, repeats: boolean, context: any, onTime: (timer: ITimer) => void): Timer; - } -} diff --git a/source/bin/framework.d.ts b/source/bin/framework.d.ts index 409c7e37..20402847 100644 --- a/source/bin/framework.d.ts +++ b/source/bin/framework.d.ts @@ -1468,6 +1468,127 @@ declare module es { private ensure; } } +declare module es { + /** + * 性能优化的位组实现。某些操作是以不安全为前缀的, 这些方法不执行验证,主要是在内部利用来优化实体ID位集的访问 + */ + class BitVector { + private words; + /** + * 创建一个初始大小足够大的bitset,以明确表示0到nbits-1范围内指数的bit + * @param nbits nbits 位集的初始大小 + */ + constructor(nbits?: number | BitVector); + /** + * + * @param index 位的索引 + * @returns 该位是否被设置 + */ + get(index: number): boolean; + /** + * + * @param index 位的索引 + */ + set(index: number, value?: boolean): void; + /** + * + * @param index 位的索引 + * @returns 该位是否被设置 + */ + unsafeGet(index: number): boolean; + /** + * + * @param index 要设置的位的索引 + */ + unsafeSet(index: number): void; + /** + * + * @param index 要翻转的位的索引 + */ + flip(index: number): void; + /** + * 要清除的位的索引 + * @param index + */ + clear(index?: number): void; + /** + * 返回该位组的 "逻辑大小":位组中最高设置位的索引加1。如果比特集不包含集合位,则返回0 + */ + length(): number; + /** + * @returns 如果这个位组中没有设置为true的位,则为true + */ + isEmpty(): boolean; + /** + * 返回在指定的起始索引上或之后出现的第一个被设置为真的位的索引。 + * 如果不存在这样的位,则返回-1 + * @param fromIndex + */ + nextSetBit(fromIndex: number): number; + /** + * 返回在指定的起始索引上或之后发生的第一个被设置为false的位的索引 + * @param fromIndex + */ + nextClearBit(fromIndex: number): number; + /** + * 对这个目标位集和参数位集进行逻辑AND。 + * 这个位集被修改,使它的每一个位都有值为真,如果且仅当它最初的值为真,并且位集参数中的相应位也有值为真 + * @param other + */ + and(other: BitVector): void; + /** + * 清除该位集的所有位,其对应的位被设置在指定的位集中 + * @param other + */ + andNot(other: BitVector): void; + /** + * 用位集参数执行这个位集的逻辑OR。 + * 如果且仅当位集参数中的位已经有值为真或位集参数中的对应位有值为真时,该位集才会被修改,从而使位集中的位有值为真 + * @param other + */ + or(other: BitVector): void; + /** + * 用位集参数对这个位集进行逻辑XOR。 + * 这个位集被修改了,所以如果且仅当以下语句之一成立时,位集中的一个位的值为真 + * @param other + */ + xor(other: BitVector): void; + /** + * 如果指定的BitVector有任何位被设置为true,并且在这个BitVector中也被设置为true,则返回true + * @param other + */ + intersects(other: BitVector): boolean; + /** + * 如果这个位集是指定位集的超级集,即它的所有位都被设置为真,那么返回true + * @param other + */ + containsAll(other: BitVector): boolean; + cardinality(): number; + hashCode(): number; + private bitCount; + /** + * 返回二进制补码二进制表示形式中最高位(“最左端”)一位之前的零位数量 + * @param i + */ + private numberOfLeadingZeros; + /** + * 返回指定二进制数的补码二进制表示形式中最低序(“最右”)一位之后的零位数量 + * @param i + */ + numberOfTrailingZeros(i: number): number; + /** + * + * @param index 要清除的位的索引 + */ + unsafeClear(index: number): void; + /** + * 增长支持数组,使其能够容纳所请求的位 + * @param bits 位数 + */ + ensureCapacity(bits: number): void; + private checkCapacity; + } +} declare module es { class ComponentList { /** diff --git a/source/bin/framework.js b/source/bin/framework.js index 0739cc5f..35f71102 100644 --- a/source/bin/framework.js +++ b/source/bin/framework.js @@ -3330,6 +3330,363 @@ var es; }()); es.BitSet = BitSet; })(es || (es = {})); +var es; +(function (es) { + /** + * 性能优化的位组实现。某些操作是以不安全为前缀的, 这些方法不执行验证,主要是在内部利用来优化实体ID位集的访问 + */ + var BitVector = /** @class */ (function () { + /** + * 创建一个初始大小足够大的bitset,以明确表示0到nbits-1范围内指数的bit + * @param nbits nbits 位集的初始大小 + */ + function BitVector(nbits) { + this.words = [0]; + if (nbits) { + if (typeof nbits == 'number') + this.checkCapacity(nbits >>> 6); + else { + // 基于另一个位向量创建一个位集 + this.words = nbits.words.slice(0); + } + } + } + /** + * + * @param index 位的索引 + * @returns 该位是否被设置 + */ + BitVector.prototype.get = function (index) { + var word = index >>> 6; + return word < this.words.length && + (this.words[word] & (1 << index)) != 0; + }; + /** + * + * @param index 位的索引 + */ + BitVector.prototype.set = function (index, value) { + if (value === void 0) { value = true; } + if (value) { + var word = index >>> 6; + this.checkCapacity(word); + this.words[word] |= 1 << index; + } + else { + this.clear(index); + } + }; + /** + * + * @param index 位的索引 + * @returns 该位是否被设置 + */ + BitVector.prototype.unsafeGet = function (index) { + return (this.words[index >>> 6] & (1 << index)) != 0; + }; + /** + * + * @param index 要设置的位的索引 + */ + BitVector.prototype.unsafeSet = function (index) { + this.words[index >>> 6] |= 1 << index; + }; + /** + * + * @param index 要翻转的位的索引 + */ + BitVector.prototype.flip = function (index) { + var word = index >>> 6; + this.checkCapacity(word); + this.words[word] ^= 1 << index; + }; + /** + * 要清除的位的索引 + * @param index + */ + BitVector.prototype.clear = function (index) { + if (index != null) { + var word = index >>> 6; + if (word >= this.words.length) + return; + this.words[word] &= ~(1 << index); + } + else { + this.words.fill(0); + } + }; + /** + * 返回该位组的 "逻辑大小":位组中最高设置位的索引加1。如果比特集不包含集合位,则返回0 + */ + BitVector.prototype.length = function () { + var bits = this.words.slice(0); + for (var word = bits.length - 1; word >= 0; --word) { + var bitsAtWord = bits[word]; + if (bitsAtWord != 0) + return (word << 6) + 64 - this.numberOfLeadingZeros(bitsAtWord); + } + return 0; + }; + /** + * @returns 如果这个位组中没有设置为true的位,则为true + */ + BitVector.prototype.isEmpty = function () { + var bits = this.words.slice(0); + var length = bits.length; + for (var i = 0; i < length; i++) { + if (bits[i] != 0) + return false; + } + return true; + }; + /** + * 返回在指定的起始索引上或之后出现的第一个被设置为真的位的索引。 + * 如果不存在这样的位,则返回-1 + * @param fromIndex + */ + BitVector.prototype.nextSetBit = function (fromIndex) { + var word = fromIndex >>> 6; + if (word >= this.words.length) + return -1; + var bitmap = this.words[word] >>> fromIndex; + if (bitmap != 0) + return fromIndex + this.numberOfTrailingZeros(bitmap); + for (var i = 1 + word; i < this.words.length; i++) { + bitmap = this.words[i]; + if (bitmap != 0) { + return i * 64 + this.numberOfTrailingZeros(bitmap); + } + } + return -1; + }; + /** + * 返回在指定的起始索引上或之后发生的第一个被设置为false的位的索引 + * @param fromIndex + */ + BitVector.prototype.nextClearBit = function (fromIndex) { + var word = fromIndex >>> 6; + if (word >= this.words.length) + return Math.min(fromIndex, this.words.length << 6); + var bitmap = ~(this.words[word] >>> fromIndex); + if (bitmap != 0) + return fromIndex + this.numberOfTrailingZeros(bitmap); + for (var i = 1 + word; i < this.words.length; i++) { + bitmap = ~this.words[i]; + if (bitmap != 0) { + return i * 64 + this.numberOfTrailingZeros(bitmap); + } + } + return Math.min(fromIndex, this.words.length << 6); + }; + /** + * 对这个目标位集和参数位集进行逻辑AND。 + * 这个位集被修改,使它的每一个位都有值为真,如果且仅当它最初的值为真,并且位集参数中的相应位也有值为真 + * @param other + */ + BitVector.prototype.and = function (other) { + var commonWords = Math.min(this.words.length, other.words.length); + for (var i = 0; commonWords > i; i++) { + this.words[i] &= other.words[i]; + } + if (this.words.length > commonWords) { + for (var i = commonWords, s = this.words.length; s > i; i++) { + this.words[i] = 0; + } + } + }; + /** + * 清除该位集的所有位,其对应的位被设置在指定的位集中 + * @param other + */ + BitVector.prototype.andNot = function (other) { + var commonWords = Math.min(this.words.length, other.words.length); + for (var i = 0; commonWords > i; i++) + this.words[i] &= ~other.words[i]; + }; + /** + * 用位集参数执行这个位集的逻辑OR。 + * 如果且仅当位集参数中的位已经有值为真或位集参数中的对应位有值为真时,该位集才会被修改,从而使位集中的位有值为真 + * @param other + */ + BitVector.prototype.or = function (other) { + var commonWords = Math.min(this.words.length, other.words.length); + for (var i = 0; commonWords > i; i++) + this.words[i] |= other.words[i]; + if (commonWords < other.words.length) { + this.checkCapacity(other.words.length); + for (var i = commonWords, s = other.words.length; s > i; i++) { + this.words[i] = other.words[i]; + } + } + }; + /** + * 用位集参数对这个位集进行逻辑XOR。 + * 这个位集被修改了,所以如果且仅当以下语句之一成立时,位集中的一个位的值为真 + * @param other + */ + BitVector.prototype.xor = function (other) { + var commonWords = Math.min(this.words.length, other.words.length); + for (var i = 0; commonWords > i; i++) + this.words[i] ^= other.words[i]; + if (commonWords < other.words.length) { + this.checkCapacity(other.words.length); + for (var i = commonWords, s = other.words.length; s > i; i++) { + this.words[i] = other.words[i]; + } + } + }; + /** + * 如果指定的BitVector有任何位被设置为true,并且在这个BitVector中也被设置为true,则返回true + * @param other + */ + BitVector.prototype.intersects = function (other) { + var bits = this.words.slice(0); + var otherBits = other.words; + for (var i = 0, s = Math.min(bits.length, otherBits.length); s > i; i++) { + if ((bits[i] & otherBits[i]) != 0) + return true; + } + return false; + }; + /** + * 如果这个位集是指定位集的超级集,即它的所有位都被设置为真,那么返回true + * @param other + */ + BitVector.prototype.containsAll = function (other) { + var bits = this.words.slice(0); + var otherBits = other.words; + var otherBitsLength = otherBits.length; + var bitsLength = bits.length; + for (var i = bitsLength; i < otherBitsLength; i++) { + if (otherBits[i] != 0) { + return false; + } + } + for (var i = 0, s = Math.min(bitsLength, otherBitsLength); s > i; i++) { + if ((bits[i] & otherBits[i]) != otherBits[i]) { + return false; + } + } + return true; + }; + BitVector.prototype.cardinality = function () { + var count = 0; + for (var i = 0; i < this.words.length; i++) + count += this.bitCount(this.words[i]); + return count; + }; + BitVector.prototype.hashCode = function () { + var word = this.length() >>> 6; + var hash = 0; + for (var i = 0; word >= i; i++) + hash = 127 * hash + (this.words[i] ^ (this.words[i] >>> 32)); + return hash; + }; + BitVector.prototype.bitCount = function (i) { + i = i - ((i >>> 1) & 0x55555555); + i = (i & 0x33333333) + ((i >>> 2) & 0x33333333); + i = (i + (i >>> 4)) & 0x0f0f0f0f; + i = i + (i >>> 8); + i = i + (i >>> 16); + return i & 0x3f; + }; + /** + * 返回二进制补码二进制表示形式中最高位(“最左端”)一位之前的零位数量 + * @param i + */ + BitVector.prototype.numberOfLeadingZeros = function (i) { + if (i == 0) + return 64; + var n = 1; + var x = i >>> 32; + if (x == 0) { + n += 32; + x = i; + } + if (x >>> 16 == 0) { + n += 16; + x <<= 16; + } + if (x >>> 24 == 0) { + n += 8; + x <<= 8; + } + if (x >>> 28 == 0) { + n += 4; + x <<= 4; + } + if (x >>> 30 == 0) { + n += 2; + x <<= 2; + } + n -= x >>> 31; + return n; + }; + /** + * 返回指定二进制数的补码二进制表示形式中最低序(“最右”)一位之后的零位数量 + * @param i + */ + BitVector.prototype.numberOfTrailingZeros = function (i) { + var x = 0, y = 0; + if (i == 0) + return 64; + var n = 63; + y = i; + if (y != 0) { + n = n - 32; + x = y; + } + else + x = (i >>> 32); + y = x << 16; + if (y != 0) { + n = n - 16; + x = y; + } + y = x << 8; + if (y != 0) { + n = n - 8; + x = y; + } + y = x << 4; + if (y != 0) { + n = n - 4; + x = y; + } + y = x << 2; + if (y != 0) { + n = n - 2; + x = y; + } + return n - ((x << 1) >>> 31); + }; + /** + * + * @param index 要清除的位的索引 + */ + BitVector.prototype.unsafeClear = function (index) { + this.words[index >>> 6] &= ~(1 << index); + }; + /** + * 增长支持数组,使其能够容纳所请求的位 + * @param bits 位数 + */ + BitVector.prototype.ensureCapacity = function (bits) { + this.checkCapacity(bits >>> 6); + }; + BitVector.prototype.checkCapacity = function (len) { + if (len >= this.words.length) { + var newBits = new Array(len + 1); + for (var i = 0; i < this.words.length; i++) { + newBits[i] = this.words[i]; + } + this.words = newBits; + } + }; + return BitVector; + }()); + es.BitVector = BitVector; +})(es || (es = {})); /// var es; /// diff --git a/source/bin/framework.min.js b/source/bin/framework.min.js index 8f2c3793..3c0efc58 100644 --- a/source/bin/framework.min.js +++ b/source/bin/framework.min.js @@ -1 +1 @@ -window.es={};var __awaiter=this&&this.__awaiter||function(t,e,n,i){return new(n||(n=Promise))(function(r,o){function s(t){try{c(i.next(t))}catch(t){o(t)}}function a(t){try{c(i.throw(t))}catch(t){o(t)}}function c(t){t.done?r(t.value):new n(function(e){e(t.value)}).then(s,a)}c((i=i.apply(t,e||[])).next())})},__generator=this&&this.__generator||function(t,e){var n,i,r,o,s={label:0,sent:function(){if(1&r[0])throw r[1];return r[1]},trys:[],ops:[]};return o={next:a(0),throw:a(1),return:a(2)},"function"==typeof Symbol&&(o[Symbol.iterator]=function(){return this}),o;function a(o){return function(a){return function(o){if(n)throw new TypeError("Generator is already executing.");for(;s;)try{if(n=1,i&&(r=2&o[0]?i.return:o[0]?i.throw||((r=i.return)&&r.call(i),0):i.next)&&!(r=r.call(i,o[1])).done)return r;switch(i=0,r&&(o=[2&o[0],r.value]),o[0]){case 0:case 1:r=o;break;case 4:return s.label++,{value:o[1],done:!1};case 5:s.label++,i=o[1],o=[0];continue;case 7:o=s.ops.pop(),s.trys.pop();continue;default:if(!(r=(r=s.trys).length>0&&r[r.length-1])&&(6===o[0]||2===o[0])){s=0;continue}if(3===o[0]&&(!r||o[1]>r[0]&&o[1]=t.length&&(t=void 0),{value:t&&t[n++],done:!t}}}},__read=this&&this.__read||function(t,e){var n="function"==typeof Symbol&&t[Symbol.iterator];if(!n)return t;var i,r,o=n.call(t),s=[];try{for(;(void 0===e||e-- >0)&&!(i=o.next()).done;)s.push(i.value)}catch(t){r={error:t}}finally{try{i&&!i.done&&(n=o.return)&&n.call(o)}finally{if(r)throw r.error}}return s},__spread=this&&this.__spread||function(){for(var t=[],e=0;e=1)){var e=window.performance.memory;null!=e&&(this._totalMemory=Number((e.totalJSHeapSize/1048576).toFixed(2))),this._titleMemory&&this._titleMemory(this._totalMemory,this._frameCounter),this._frameCounter=0,this._frameCounterElapsedTime-=1}},e.prototype.onSceneChanged=function(){t.Time.sceneChanged()},e.prototype.initialize=function(){},e.prototype.update=function(e){return void 0===e&&(e=-1),__awaiter(this,void 0,void 0,function(){var n;return __generator(this,function(i){if(this.startDebugUpdate(),t.Time.update(e),null!=this._scene){for(n=this._globalManagers.length-1;n>=0;n--)this._globalManagers[n].enabled&&this._globalManagers[n].update();this._scene.update(),null!=this._nextScene&&(this._scene.end(),this._scene=this._nextScene,this._nextScene=null,this.onSceneChanged(),this._scene.begin())}return this.endDebugUpdate(),this.startDebugDraw(),[2]})})},e.pauseOnFocusLost=!0,e.debugRenderEndabled=!1,e}();t.Core=e}(es||(es={})),function(t){var e;!function(t){t[t.error=0]="error",t[t.warn=1]="warn",t[t.log=2]="log",t[t.info=3]="info",t[t.trace=4]="trace"}(e=t.LogType||(t.LogType={}));var n=function(){function t(){}return t.warnIf=function(t,n){for(var i=[],r=2;r=0;t--){this.transform.getChild(t).entity.destroy()}},n.prototype.detachFromScene=function(){this.scene.entities.remove(this),this.components.deregisterAllComponents();for(var t=0;t=0;t--)this._sceneComponents[t].enabled&&this._sceneComponents[t].update();null!=this.entityProcessors&&this.entityProcessors.update(),this.entities.update(),null!=this.entityProcessors&&this.entityProcessors.lateUpdate()},e.prototype.addSceneComponent=function(t){return t.scene=this,t.onEnabled(),this._sceneComponents.push(t),this._sceneComponents.sort(t.compare),t},e.prototype.getSceneComponent=function(t){for(var e=0;ee.x?-1:1,i=t.Vector2.normalize(t.Vector2.subtract(this.position,e));this.rotation=n*Math.acos(t.Vector2.dot(i,t.Vector2.unitY))},n.prototype.setLocalRotation=function(t){return this._localRotation=t,this._localDirty=this._positionDirty=this._localPositionDirty=this._localRotationDirty=this._localScaleDirty=!0,this.setDirty(e.rotationDirty),this},n.prototype.setLocalRotationDegrees=function(e){return this.setLocalRotation(t.MathHelper.toRadians(e))},n.prototype.setScale=function(e){return this._scale=e,this.parent?this.localScale=t.Vector2.divide(e,this.parent._scale):this.localScale=e,this},n.prototype.setLocalScale=function(t){return this._localScale=t,this._localDirty=this._positionDirty=this._localScaleDirty=!0,this.setDirty(e.scaleDirty),this},n.prototype.roundPosition=function(){this.position=t.Vector2Ext.round(this._position)},n.prototype.updateTransform=function(){this.hierarchyDirty!=e.clean&&(null!=this.parent&&this.parent.updateTransform(),this._localDirty&&(this._localPositionDirty&&(this._translationMatrix=t.Matrix2D.createTranslation(this._localPosition.x,this._localPosition.y),this._localPositionDirty=!1),this._localRotationDirty&&(this._rotationMatrix=t.Matrix2D.createRotation(this._localRotation),this._localRotationDirty=!1),this._localScaleDirty&&(this._scaleMatrix=t.Matrix2D.createScale(this._localScale.x,this._localScale.y),this._localScaleDirty=!1),this._localTransform=this._scaleMatrix.multiply(this._rotationMatrix),this._localTransform=this._localTransform.multiply(this._translationMatrix),null==this.parent&&(this._worldTransform=this._localTransform,this._rotation=this._localRotation,this._scale=this._localScale,this._worldInverseDirty=!0),this._localDirty=!1),null!=this.parent&&(this._worldTransform=this._localTransform.multiply(this.parent._worldTransform),this._rotation=this._localRotation+this.parent._rotation,this._scale=t.Vector2.multiply(this.parent._scale,this._localScale),this._worldInverseDirty=!0),this._worldToLocalDirty=!0,this._positionDirty=!0,this.hierarchyDirty=e.clean)},n.prototype.setDirty=function(e){if(0==(this.hierarchyDirty&e)){switch(this.hierarchyDirty|=e,e){case t.DirtyType.positionDirty:this.entity.onTransformChanged(transform.Component.position);break;case t.DirtyType.rotationDirty:this.entity.onTransformChanged(transform.Component.rotation);break;case t.DirtyType.scaleDirty:this.entity.onTransformChanged(transform.Component.scale)}for(var n=0;n1e-4?this._inverseMass=1/this._mass:this._inverseMass=0,this},n.prototype.setElasticity=function(e){return this._elasticity=t.MathHelper.clamp01(e),this},n.prototype.setFriction=function(e){return this._friction=t.MathHelper.clamp01(e),this},n.prototype.setGlue=function(e){return this._glue=t.MathHelper.clamp(e,0,10),this},n.prototype.addImpulse=function(e){this.isImmovable||(this.velocity=t.Vector2.add(this.velocity,t.Vector2.multiply(e,new t.Vector2(1e5)).multiply(new t.Vector2(this._inverseMass*t.Time.deltaTime))))},n.prototype.onAddedToEntity=function(){this._collider=this.entity.getComponent(t.Collider),t.Debug.warnIf(null==this._collider,"ArcadeRigidbody 没有 Collider。ArcadeRigidbody需要一个Collider!")},n.prototype.update=function(){var e,i;if(this.isImmovable||null==this._collider)this.velocity=t.Vector2.zero;else{this.shouldUseGravity&&(this.velocity=t.Vector2.add(this.velocity,t.Vector2.multiply(t.Physics.gravity,new t.Vector2(t.Time.deltaTime)))),this.entity.transform.position=t.Vector2.add(this.entity.transform.position,t.Vector2.multiply(this.velocity,new t.Vector2(t.Time.deltaTime)));var r=new t.CollisionResult,o=t.Physics.boxcastBroadphaseExcludingSelfNonRect(this._collider,this._collider.collidesWithLayers.value);try{for(var s=__values(o),a=s.next();!a.done;a=s.next()){var c=a.value;if(!c.entity.equals(this.entity)&&this._collider.collidesWithNonMotion(c,r)){var h=c.entity.getComponent(n);if(null!=h)this.processOverlap(h,r.minimumTranslationVector),this.processCollision(h,r.minimumTranslationVector);else{this.entity.transform.position=t.Vector2.subtract(this.entity.transform.position,r.minimumTranslationVector);var u=this.velocity.clone();this.calculateResponseVelocity(u,r.minimumTranslationVector,u),this.velocity=t.Vector2.add(this.velocity,u)}}}}catch(t){e={error:t}}finally{try{a&&!a.done&&(i=s.return)&&i.call(s)}finally{if(e)throw e.error}}}},n.prototype.processOverlap=function(e,n){this.isImmovable?e.entity.transform.position=t.Vector2.add(e.entity.transform.position,n):e.isImmovable?this.entity.transform.position=t.Vector2.subtract(this.entity.transform.position,n):(this.entity.transform.position=t.Vector2.subtract(this.entity.transform.position,t.Vector2.multiply(n,t.Vector2Ext.halfVector())),e.entity.transform.position=t.Vector2.add(e.entity.transform.position,t.Vector2.multiply(n,t.Vector2Ext.halfVector())))},n.prototype.processCollision=function(e,n){var i=t.Vector2.subtract(this.velocity,e.velocity);this.calculateResponseVelocity(i,n,i);var r=this._inverseMass+e._inverseMass,o=this._inverseMass/r,s=e._inverseMass/r;this.velocity=t.Vector2.add(this.velocity,new t.Vector2(i.x*o,i.y*o)),e.velocity=t.Vector2.subtract(e.velocity,new t.Vector2(i.x*s,i.y*s))},n.prototype.calculateResponseVelocity=function(e,n,i){void 0===i&&(i=new t.Vector2);var r=t.Vector2.multiply(n,new t.Vector2(-1)),o=t.Vector2.normalize(r),s=t.Vector2.dot(e,o),a=new t.Vector2(o.x*s,o.y*s),c=t.Vector2.subtract(e,a);s>0&&(a=t.Vector2.zero);var h=this._friction;c.lengthSquared()n;n++){var i=t[n];this.processDelta(i,this.acc);var r=this.getRemainingDelay(i);r<=0?this.processExpired(i):this.offerDelay(r)}this.acc=0}else this.stop()},n.prototype.checkProcessing=function(){return!!this.running&&(this.acc+=t.Time.deltaTime,this.acc>=this.delay)},n.prototype.offerDelay=function(t){this.running?this.delay=Math.min(this.delay,t):(this.running=!0,this.delay=t)},n.prototype.getInitialTimeDelay=function(){return this.delay},n.prototype.getRemainingTimeUntilProcessing=function(){return this.running?this.delay-this.acc:0},n.prototype.isRunning=function(){return this.running},n.prototype.stop=function(){this.running=!1,this.acc=0},n}(t.EntitySystem);t.DelayedIteratingSystem=e}(es||(es={})),function(t){var e=function(t){function e(e){return t.call(this,e)||this}return __extends(e,t),e.prototype.lateProcessEntity=function(t){},e.prototype.process=function(t){var e=this;t.forEach(function(t){return e.processEntity(t)})},e.prototype.lateProcess=function(t){var e=this;t.forEach(function(t){return e.lateProcessEntity(t)})},e}(t.EntitySystem);t.EntityProcessingSystem=e}(es||(es={})),function(t){var e=function(e){function n(t,n){var i=e.call(this,t)||this;return i.acc=0,i.interval=0,i.intervalDelta=0,i.interval=n,i}return __extends(n,e),n.prototype.checkProcessing=function(){return this.acc+=t.Time.deltaTime,this.acc>=this.interval&&(this.acc-=this.interval,this.intervalDelta=this.acc-this.intervalDelta,!0)},n.prototype.getIntervalDelta=function(){return this.interval+this.intervalDelta},n}(t.EntitySystem);t.IntervalSystem=e}(es||(es={})),function(t){var e=function(t){function e(e,n){return t.call(this,e,n)||this}return __extends(e,t),e.prototype.process=function(t){var e=this;t.forEach(function(t){return e.processEntity(t)})},e}(t.IntervalSystem);t.IntervalIteratingSystem=e}(es||(es={})),function(t){var e=function(t){function e(){return null!==t&&t.apply(this,arguments)||this}return __extends(e,t),e.prototype.onChanged=function(t){},e.prototype.process=function(t){this.begin(),this.end()},e}(t.EntitySystem);t.PassiveSystem=e}(es||(es={})),function(t){var e=function(t){function e(){return null!==t&&t.apply(this,arguments)||this}return __extends(e,t),e.prototype.onChanged=function(t){},e.prototype.process=function(t){this.begin(),this.processSystem(),this.end()},e}(t.EntitySystem);t.ProcessingSystem=e}(es||(es={})),function(t){var e=function(){function t(e){void 0===e&&(e=64);var n=e>>6;0!=(e&t.LONG_MASK)&&n++,this._bits=new Array(n),this._bits.fill(0)}return t.prototype.and=function(t){for(var e,n=Math.min(this._bits.length,t._bits.length),i=0;i=0;)this._bits[e]&=~t._bits[e]},t.prototype.cardinality=function(){for(var t=0,e=this._bits.length-1;e>=0;e--){var n=this._bits[e];if(0!=n)if(-1!=n){var i=((n=((n=(n>>1&0x5555555555555400)+(0x5555555555555400&n))>>2&0x3333333333333400)+(0x3333333333333400&n))>>32)+n>>>0;t+=((i=((i=(i>>4&252645135)+(252645135&i))>>8&16711935)+(16711935&i))>>16&65535)+(65535&i)}else t+=64}return t},t.prototype.clear=function(t){if(null!=t){var e=t>>6;this.ensure(e),this._bits[e]&=~(1<>6;return!(e>=this._bits.length)&&0!=(this._bits[e]&1<=0;)if(0!=(this._bits[e]&t._bits[e]))return!0;return!1},t.prototype.isEmpty=function(){for(var t=this._bits.length-1;t>=0;t--)if(this._bits[t])return!1;return!0},t.prototype.nextSetBit=function(t){for(var e=t>>6,n=1<>6;this.ensure(n),this._bits[n]|=1<=this._bits.length){var e=this._bits.length;this._bits.length=t+1,this._bits.fill(0,e,t+1)}},t.LONG_MASK=63,t}();t.BitSet=e}(es||(es={})),function(t){var e=function(){function e(t){this._components=[],this._updatableComponents=[],this._componentsToAdd=[],this._componentsToRemove=[],this._tempBufferList=[],this._entity=t}return Object.defineProperty(e.prototype,"count",{get:function(){return this._components.length},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"buffer",{get:function(){return this._components},enumerable:!0,configurable:!0}),e.prototype.markEntityListUnsorted=function(){this._isComponentListUnsorted=!0},e.prototype.add=function(t){this._componentsToAdd.push(t)},e.prototype.remove=function(e){var n=new linq.List(this._componentsToRemove),i=new linq.List(this._componentsToAdd);t.Debug.warnIf(n.contains(e),"您正在尝试删除一个您已经删除的组件("+e+")"),i.contains(e)?i.remove(e):n.add(e)},e.prototype.removeAllComponents=function(){for(var t=0;t0){for(var n=0;n0){n=0;for(var i=this._componentsToAdd.length;n0&&(this._entitiesToRemove.toArray().forEach(function(t){e.removeFromTagList(t),new linq.List(e._entities).remove(t),t.onRemovedFromScene(),t.scene=null,e.scene.entityProcessors.onEntityRemoved(t)}),this._entitiesToRemove.clear()),this._entitiesToAdded.getCount()>0&&(this._entitiesToAdded.toArray().forEach(function(t){e._entities.push(t),t.scene=e.scene,e.addToTagList(t),e.scene.entityProcessors.onEntityAdded(t)}),this._entitiesToAdded.toArray().forEach(function(t){t.onAddedToScene()}),this._entitiesToAdded.clear(),this._isEntityListUnsorted=!0),this._isEntityListUnsorted&&(this._entities.sort(t.Entity.entityComparer.compare),this._isEntityListUnsorted=!1),this._unsortedTags.size>0&&(this._unsortedTags.forEach(function(t){return e._entityDict.get(t).sort(function(t,e){return t.compareTo(e)})}),this._unsortedTags.clear())},e.prototype.findEntity=function(t){for(var e=0;e=t)return n}for(e=1|t;ethis.maxPrimeArrayLength&&this.maxPrimeArrayLength>t?this.maxPrimeArrayLength:this.getPrime(e)},t.getHashCode=function(t){var e,n=0;if(0==(e="object"==typeof t?JSON.stringify(t):t.toString()).length)return n;for(var i=0;i=0;e=this.allSet.nextSetBit(e+1))if(!t.get(e))return!1;return!(!this.exclusionSet.isEmpty()&&this.exclusionSet.intersects(t))&&!(!this.oneSet.isEmpty()&&!this.oneSet.intersects(t))},e.prototype.all=function(){for(var e=this,n=[],i=0;i=e)return t;var i=!1;"-"==t.substr(0,1)&&(i=!0,t=t.substr(1));for(var r=e-n,o=0;o1?this.reverse(t.substring(1))+t.substring(0,1):t},t.cutOff=function(t,e,n,i){void 0===i&&(i=!0),e=Math.floor(e),n=Math.floor(n);var r=t.length;e>r&&(e=r);var o,s=e,a=e+n;return i?o=t.substring(0,s)+t.substr(a,r):(a=(s=r-1-e-n)+n,o=t.substring(0,s+1)+t.substr(a+1,r)),o},t.strReplace=function(t,e){for(var n=0,i=e.length;n",">",'"',""","'","'","®","®","©","©","™","™"],t}();!function(t){var e=function(){function t(){}return t.update=function(t){-1==t&&(t=Date.now()),-1==this._lastTime&&(this._lastTime=t);var e=t-this._lastTime;this.totalTime+=e,this.deltaTime=e*this.timeScale,this.unscaledDeltaTime=e,this.timeSinceSceneLoad+=e,this.frameCount++,this._lastTime=t},t.sceneChanged=function(){this.timeSinceSceneLoad=0},t.checkEvery=function(t){return this.timeSinceSceneLoad/t>(this.timeSinceSceneLoad-this.deltaTime)/t},t.totalTime=0,t.unscaledDeltaTime=0,t.deltaTime=0,t.timeScale=1,t.frameCount=0,t.timeSinceSceneLoad=0,t._lastTime=-1,t}();t.Time=e}(es||(es={}));var TimeUtils=function(){function t(){}return t.monthId=function(t){void 0===t&&(t=null);var e=(t=t||new Date).getFullYear(),n=t.getMonth()+1;return parseInt(e+(n<10?"0":"")+n)},t.dateId=function(t){void 0===t&&(t=null);var e=(t=t||new Date).getMonth()+1,n=e<10?"0":"",i=t.getDate(),r=i<10?"0":"";return parseInt(t.getFullYear()+n+e+r+i)},t.weekId=function(t,e){void 0===t&&(t=null),void 0===e&&(e=!0),t=t||new Date;var n=new Date;n.setTime(t.getTime()),n.setDate(1),n.setMonth(0);var i=n.getFullYear(),r=n.getDay();0==r&&(r=7);var o=!1;r<=4?(o=r>1,n.setDate(n.getDate()-(r-1))):n.setDate(n.getDate()+7-r+1);var s=this.diffDay(t,n,!1);if(s<0)return n.setDate(1),n.setMonth(0),n.setDate(n.getDate()-1),this.weekId(n,!1);var a=s/7,c=Math.floor(a)+1;if(53==c){n.setTime(t.getTime()),n.setDate(n.getDate()-1);var h=n.getDay();if(0==h&&(h=7),e&&(!o||h<4))return n.setFullYear(n.getFullYear()+1),n.setDate(1),n.setMonth(0),this.weekId(n,!1)}return parseInt(i+"00"+(c>9?"":"0")+c)},t.diffDay=function(t,e,n){void 0===n&&(n=!1);var i=(t.getTime()-e.getTime())/864e5;return n?Math.ceil(i):Math.floor(i)},t.getFirstDayOfWeek=function(t){var e=(t=t||new Date).getDay()||7;return new Date(t.getFullYear(),t.getMonth(),t.getDate()+1-e,0,0,0,0)},t.getFirstOfDay=function(t){return(t=t||new Date).setHours(0,0,0,0),t},t.getNextFirstOfDay=function(t){return new Date(this.getFirstOfDay(t).getTime()+864e5)},t.formatDate=function(t){var e=t.getFullYear(),n=t.getMonth()+1;n=n<10?"0"+n:n;var i=t.getDate();return e+"-"+n+"-"+(i=i<10?"0"+i:i)},t.formatDateTime=function(t){var e=t.getFullYear(),n=t.getMonth()+1;n=n<10?"0"+n:n;var i=t.getDate();i=i<10?"0"+i:i;var r=t.getHours(),o=t.getMinutes();o=o<10?"0"+o:o;var s=t.getSeconds();return e+"-"+n+"-"+i+" "+r+":"+o+":"+(s=s<10?"0"+s:s)},t.parseDate=function(t){var e=Date.parse(t);return isNaN(e)?new Date:new Date(Date.parse(t.replace(/-/g,"/")))},t.secondToTime=function(t,e,n){void 0===t&&(t=0),void 0===e&&(e=":"),void 0===n&&(n=!0);var i=Math.floor(t/3600),r=Math.floor(t%3600/60),o=Math.floor(t%3600%60),s=i.toString(),a=r.toString(),c=o.toString();return i<10&&(s="0"+s),r<10&&(a="0"+a),o<10&&(c="0"+c),n?s+e+a+e+c:a+e+c},t.timeToMillisecond=function(t,e){void 0===e&&(e=":");for(var n=t.split(e),i=0,r=n.length,o=0;o=1?(e.value=1,n=this._points.length-4):(e.value=t.MathHelper.clamp01(e.value)*this._curveCount,n=~~e,e.value-=n,n*=3),n},e.prototype.setControlPoint=function(e,n){if(e%3==0){var i=t.Vector2.subtract(n,this._points[e]);e>0&&this._points[e-1].add(i),e+1n?n:t},e.pointOnCirlce=function(n,i,r){var o=e.toRadians(r);return new t.Vector2(Math.cos(o)*o+n.x,Math.sin(o)*o+n.y)},e.isEven=function(t){return t%2==0},e.clamp01=function(t){return t<0?0:t>1?1:t},e.angleBetweenVectors=function(t,e){return Math.atan2(e.y-t.y,e.x-t.x)},e.angleToVector=function(e,n){return new t.Vector2(Math.cos(e)*n,Math.sin(e)*n)},e.incrementWithWrap=function(t,e){return++t==e?0:t},e.roundToNearest=function(t,e){return Math.round(t/e)*e},e.withinEpsilon=function(t,e){return void 0===e&&(e=this.Epsilon),Math.abs(t)180&&(n-=360),n},e.repeat=function(t,e){return t-Math.floor(t/e)*e},e.Epsilon=1e-5,e.Rad2Deg=57.29578,e.Deg2Rad=.0174532924,e.PiOver2=Math.PI/2,e}();t.MathHelper=e}(es||(es={})),function(t){var e=function(){function t(){}return t.createOrthographicOffCenter=function(e,n,i,r,o,s,a){void 0===a&&(a=new t),a.m11=2/(n-e),a.m12=0,a.m13=0,a.m14=0,a.m21=0,a.m22=2/(r-i),a.m23=0,a.m24=0,a.m31=0,a.m32=0,a.m33=1/(o-s),a.m34=0,a.m41=(e+n)/(e-n),a.m42=(r+i)/(i-r),a.m43=o/(o-s),a.m44=1},t.multiply=function(e,n,i){void 0===i&&(i=new t);var r=e.m11*n.m11+e.m12*n.m21+e.m13*n.m31+e.m14*n.m41,o=e.m11*n.m12+e.m12*n.m22+e.m13*n.m32+e.m14*n.m42,s=e.m11*n.m13+e.m12*n.m23+e.m13*n.m33+e.m14*n.m43,a=e.m11*n.m14+e.m12*n.m24+e.m13*n.m34+e.m14*n.m44,c=e.m21*n.m11+e.m22*n.m21+e.m23*n.m31+e.m24*n.m41,h=e.m21*n.m12+e.m22*n.m22+e.m23*n.m32+e.m24*n.m42,u=e.m21*n.m13+e.m22*n.m23+e.m23*n.m33+e.m24*n.m43,l=e.m21*n.m14+e.m22*n.m24+e.m23*n.m34+e.m24*n.m44,p=e.m31*n.m11+e.m32*n.m21+e.m33*n.m31+e.m34*n.m41,f=e.m31*n.m12+e.m32*n.m22+e.m33*n.m32+e.m34*n.m42,d=e.m31*n.m13+e.m32*n.m23+e.m33*n.m33+e.m34*n.m43,m=e.m31*n.m14+e.m32*n.m24+e.m33*n.m34+e.m34*n.m44,y=e.m41*n.m11+e.m42*n.m21+e.m43*n.m31+e.m44*n.m41,g=e.m41*n.m12+e.m42*n.m22+e.m43*n.m32+e.m44*n.m42,v=e.m41*n.m13+e.m42*n.m23+e.m43*n.m33+e.m44*n.m43,_=e.m41*n.m14+e.m42*n.m24+e.m43*n.m34+e.m44*n.m44;i.m11=r,i.m12=o,i.m13=s,i.m14=a,i.m21=c,i.m22=h,i.m23=u,i.m24=l,i.m31=p,i.m32=f,i.m33=d,i.m34=m,i.m41=y,i.m42=g,i.m43=v,i.m44=_},t}();t.Matrix=e}(es||(es={})),function(t){var e=function(){function e(t,e,n,i,r,o){this.m11=0,this.m12=0,this.m21=0,this.m22=0,this.m31=0,this.m32=0,this.m11=t,this.m12=e,this.m21=n,this.m22=i,this.m31=r,this.m32=o}return Object.defineProperty(e,"identity",{get:function(){return new e(1,0,0,1,0,0)},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"translation",{get:function(){return new t.Vector2(this.m31,this.m32)},set:function(t){this.m31=t.x,this.m32=t.y},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"rotation",{get:function(){return Math.atan2(this.m21,this.m11)},set:function(t){var e=Math.cos(t),n=Math.sin(t);this.m11=e,this.m12=n,this.m21=-n,this.m22=e},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"rotationDegrees",{get:function(){return t.MathHelper.toDegrees(this.rotation)},set:function(e){this.rotation=t.MathHelper.toRadians(e)},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"scale",{get:function(){return new t.Vector2(this.m11,this.m22)},set:function(t){this.m11=t.x,this.m22=t.y},enumerable:!0,configurable:!0}),e.createRotation=function(t){var e=this.identity,n=Math.cos(t),i=Math.sin(t);return e.m11=n,e.m12=i,e.m21=-i,e.m22=n,e},e.createScale=function(t,e){var n=this.identity;return n.m11=t,n.m12=0,n.m21=0,n.m22=e,n.m31=0,n.m32=0,n},e.createTranslation=function(t,e){var n=this.identity;return n.m11=1,n.m12=0,n.m21=0,n.m22=1,n.m31=t,n.m32=e,n},e.invert=function(t){var e=1/t.determinant(),n=this.identity;return n.m11=t.m22*e,n.m12=-t.m12*e,n.m21=-t.m21*e,n.m22=t.m11*e,n.m31=(t.m32*t.m21-t.m31*t.m22)*e,n.m32=-(t.m32*t.m11-t.m31*t.m12)*e,n},e.prototype.add=function(t){return this.m11+=t.m11,this.m12+=t.m12,this.m21+=t.m21,this.m22+=t.m22,this.m31+=t.m31,this.m32+=t.m32,this},e.prototype.substract=function(t){return this.m11-=t.m11,this.m12-=t.m12,this.m21-=t.m21,this.m22-=t.m22,this.m31-=t.m31,this.m32-=t.m32,this},e.prototype.divide=function(t){return this.m11/=t.m11,this.m12/=t.m12,this.m21/=t.m21,this.m22/=t.m22,this.m31/=t.m31,this.m32/=t.m32,this},e.prototype.multiply=function(t){var e=this.m11*t.m11+this.m12*t.m21,n=this.m11*t.m12+this.m12*t.m22,i=this.m21*t.m11+this.m22*t.m21,r=this.m21*t.m12+this.m22*t.m22,o=this.m31*t.m11+this.m32*t.m21+t.m31,s=this.m31*t.m12+this.m32*t.m22+t.m32;return this.m11=e,this.m12=n,this.m21=i,this.m22=r,this.m31=o,this.m32=s,this},e.prototype.determinant=function(){return this.m11*this.m22-this.m12*this.m21},e.lerp=function(t,e,n){return t.m11=t.m11+(e.m11-t.m11)*n,t.m12=t.m12+(e.m12-t.m12)*n,t.m21=t.m21+(e.m21-t.m21)*n,t.m22=t.m22+(e.m22-t.m22)*n,t.m31=t.m31+(e.m31-t.m31)*n,t.m32=t.m32+(e.m32-t.m32)*n,t},e.transpose=function(t){var e=this.identity;return e.m11=t.m11,e.m12=t.m21,e.m21=t.m12,e.m22=t.m22,e.m31=0,e.m32=0,e},e.prototype.mutiplyTranslation=function(n,i){var r=e.createTranslation(n,i);return t.MatrixHelper.mutiply(this,r)},e.prototype.equals=function(t){return this==t},e.toMatrix=function(e){var n=new t.Matrix;return n.m11=e.m11,n.m12=e.m12,n.m13=0,n.m14=0,n.m21=e.m21,n.m22=e.m22,n.m23=0,n.m24=0,n.m31=0,n.m32=0,n.m33=1,n.m34=0,n.m41=e.m31,n.m42=e.m32,n.m43=0,n.m44=1,n},e.prototype.toString=function(){return"{m11:"+this.m11+" m12:"+this.m12+" m21:"+this.m21+" m22:"+this.m22+" m31:"+this.m31+" m32:"+this.m32+"}"},e}();t.Matrix2D=e}(es||(es={})),function(t){var e=function(){function e(){}return e.add=function(e,n){var i=t.Matrix2D.identity;return i.m11=e.m11+n.m11,i.m12=e.m12+n.m12,i.m21=e.m21+n.m21,i.m22=e.m22+n.m22,i.m31=e.m31+n.m31,i.m32=e.m32+n.m32,i},e.divide=function(e,n){var i=t.Matrix2D.identity;return i.m11=e.m11/n.m11,i.m12=e.m12/n.m12,i.m21=e.m21/n.m21,i.m22=e.m22/n.m22,i.m31=e.m31/n.m31,i.m32=e.m32/n.m32,i},e.mutiply=function(e,n){var i=t.Matrix2D.identity;if(n instanceof t.Matrix2D){var r=e.m11*n.m11+e.m12*n.m21,o=n.m11*n.m12+e.m12*n.m22,s=e.m21*n.m11+e.m22*n.m21,a=e.m21*n.m12+e.m22*n.m22,c=e.m31*n.m11+e.m32*n.m21+n.m31,h=e.m31*n.m12+e.m32*n.m22+n.m32;i.m11=r,i.m12=o,i.m21=s,i.m22=a,i.m31=c,i.m32=h}else"number"==typeof n&&(i.m11=e.m11*n,i.m12=e.m12*n,i.m21=e.m21*n,i.m22=e.m22*n,i.m31=e.m31*n,i.m32=e.m32*n);return i},e.subtract=function(e,n){var i=t.Matrix2D.identity;return i.m11=e.m11-n.m11,i.m12=e.m12-n.m12,i.m21=e.m21-n.m21,i.m22=e.m22-n.m22,i.m31=e.m31-n.m31,i.m32=e.m32-n.m32,i},e}();t.MatrixHelper=e}(es||(es={})),function(t){var e=function(){function e(t,e,n,i){void 0===t&&(t=0),void 0===e&&(e=0),void 0===n&&(n=0),void 0===i&&(i=0),this.x=0,this.y=0,this.width=0,this.height=0,this.x=t,this.y=e,this.width=n,this.height=i}return Object.defineProperty(e,"empty",{get:function(){return new e},enumerable:!0,configurable:!0}),Object.defineProperty(e,"maxRect",{get:function(){return new e(Number.MIN_VALUE/2,Number.MIN_VALUE/2,Number.MAX_VALUE,Number.MAX_VALUE)},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"left",{get:function(){return this.x},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"right",{get:function(){return this.x+this.width},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"top",{get:function(){return this.y},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"bottom",{get:function(){return this.y+this.height},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"max",{get:function(){return new t.Vector2(this.right,this.bottom)},enumerable:!0,configurable:!0}),e.prototype.isEmpty=function(){return 0==this.width&&0==this.height&&0==this.x&&0==this.y},Object.defineProperty(e.prototype,"location",{get:function(){return new t.Vector2(this.x,this.y)},set:function(t){this.x=t.x,this.y=t.y},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"size",{get:function(){return new t.Vector2(this.width,this.height)},set:function(t){this.width=t.x,this.height=t.y},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"center",{get:function(){return new t.Vector2(this.x+this.width/2,this.y+this.height/2)},enumerable:!0,configurable:!0}),e.fromMinMax=function(t,n,i,r){return new e(t,n,i-t,r-n)},e.rectEncompassingPoints=function(t){for(var e=Number.POSITIVE_INFINITY,n=Number.POSITIVE_INFINITY,i=Number.NEGATIVE_INFINITY,r=Number.NEGATIVE_INFINITY,o=0;oi&&(i=s.x),s.yr&&(r=s.y)}return this.fromMinMax(e,n,i,r)},e.prototype.getSide=function(e){switch(e){case t.Edge.top:return this.top;case t.Edge.bottom:return this.bottom;case t.Edge.left:return this.left;case t.Edge.right:return this.right;default:throw new Error("Argument Out Of Range")}},e.prototype.contains=function(t,e){return this.x<=t&&tthis.x+this.width)return!1}else{var i=1/t.direction.x,r=(this.x-t.start.x)*i,o=(this.x+this.width-t.start.x)*i;if(r>o){var s=r;r=o,o=s}if(e.value=Math.max(r,e.value),n=Math.min(o,n),e.value>n)return!1}if(Math.abs(t.direction.y)<1e-6){if(t.start.ythis.y+this.height)return!1}else{var a=1/t.direction.y,c=(this.y-t.start.y)*a,h=(this.y+this.height-t.start.y)*a;if(c>h){var u=c;c=h,h=u}if(e.value=Math.max(c,e.value),n=Math.max(h,n),e.value>n)return!1}return!0},e.prototype.containsRect=function(t){return this.x<=t.x&&t.x0?this.x:this.x+t,i.y=n>0?this.y:this.y+n,i.width=t>0?t+this.width:this.width-t,i.height=n>0?n+this.height:this.height-n,i},e.prototype.collisionCheck=function(t,e,n){e.value=n.value=0;var i=t.x-(this.x+this.width),r=t.x+t.width-this.x,o=t.y-(this.y+this.height),s=t.y+t.height-this.y;return!(i>0||r<0||o>0||s<0)&&(e.value=Math.abs(i)=l||Math.abs(u)>=p)return t.Vector2.zero;var f=h>0?l-h:-l-h,d=u>0?p-u:-p-u;return new t.Vector2(f,d)},e.prototype.equals=function(t){return this===t},e.prototype.getHashCode=function(){return this.x^this.y^this.width^this.height},e.prototype.clone=function(){return new e(this.x,this.y,this.width,this.height)},e}();t.Rectangle=e}(es||(es={})),function(t){var e=function(){function t(){this.remainder=0}return t.prototype.update=function(t){this.remainder+=t;var e=Math.floor(Math.trunc(this.remainder));return this.remainder-=e,t=e},t.prototype.reset=function(){this.remainder=0},t}();t.SubpixelFloat=e}(es||(es={})),function(t){var e=function(){function e(){this._x=new t.SubpixelFloat,this._y=new t.SubpixelFloat}return e.prototype.update=function(t){t.x=this._x.update(t.x),t.y=this._y.update(t.y)},e.prototype.reset=function(){this._x.reset(),this._y.reset()},e}();t.SubpixelVector2=e}(es||(es={})),function(t){var e=function(){function e(e){this._activeTriggerIntersections=new t.HashSet,this._previousTriggerIntersections=new t.HashSet,this._tempTriggerList=[],this._entity=e}return e.prototype.update=function(){for(var e=this._entity.getComponents(t.Collider),n=0;n1)return!1;var u=(c.x*o.y-c.y*o.x)/a;return!(u<0||u>1)},n.lineToLineIntersection=function(e,n,i,r,o){void 0===o&&(o=new t.Vector2),o.x=0,o.y=0;var s=t.Vector2.subtract(n,e),a=t.Vector2.subtract(r,i),c=s.x*a.y-s.y*a.x;if(0==c)return!1;var h=t.Vector2.subtract(i,e),u=(h.x*a.y-h.y*a.x)/c;if(u<0||u>1)return!1;var l=(h.x*s.y-h.y*s.x)/c;if(l<0||l>1)return!1;var p=t.Vector2.add(e,new t.Vector2(u*s.x,u*s.y));return o.x=p.x,o.y=p.y,!0},n.closestPointOnLine=function(e,n,i){var r=t.Vector2.subtract(n,e),o=t.Vector2.subtract(i,e),s=t.Vector2.dot(o,r)/t.Vector2.dot(r,r);return s=t.MathHelper.clamp(s,0,1),t.Vector2.add(e,new t.Vector2(r.x*s,r.y*s))},n.circleToCircle=function(e,n,i,r){return t.Vector2.distanceSquared(e,i)<(n+r)*(n+r)},n.circleToLine=function(e,n,i,r){return t.Vector2.distanceSquared(e,this.closestPointOnLine(i,r,e))=t&&r.y>=e&&r.x=t+i&&(s|=e.right),o.y=n+r&&(s|=e.bottom),s},n}();t.Collisions=n}(es||(es={})),function(t){var e=function(){function e(e,n,i,r,o){this.fraction=0,this.distance=0,this.point=t.Vector2.zero,this.normal=t.Vector2.zero,this.collider=e,this.fraction=n,this.distance=i,this.point=r,this.centroid=t.Vector2.zero}return e.prototype.setValues=function(t,e,n,i){this.collider=t,this.fraction=e,this.distance=n,this.point=i},e.prototype.setValuesNonCollider=function(t,e,n,i){this.fraction=t,this.distance=e,this.point=n,this.normal=i},e.prototype.reset=function(){this.collider=null,this.fraction=this.distance=0},e.prototype.toString=function(){return"[RaycastHit] fraction: "+this.fraction+", distance: "+this.distance+", normal: "+this.normal+", centroid: "+this.centroid+", point: "+this.point},e}();t.RaycastHit=e}(es||(es={})),function(t){var e=function(){function e(){}return e.reset=function(){this._spatialHash=new t.SpatialHash(this.spatialHashCellSize),this._hitArray[0].reset(),this._colliderArray[0]=null},e.clear=function(){this._spatialHash.clear()},e.overlapCircle=function(t,n,i){return void 0===i&&(i=e.allLayers),this._colliderArray[0]=null,this._spatialHash.overlapCircle(t,n,this._colliderArray,i),this._colliderArray[0]},e.overlapCircleAll=function(t,e,n,i){if(void 0===i&&(i=-1),0!=n.length)return this._spatialHash.overlapCircle(t,e,n,i);console.warn("传入了一个空的结果数组。不会返回任何结果")},e.boxcastBroadphase=function(t,e){return void 0===e&&(e=this.allLayers),this._spatialHash.aabbBroadphase(t,null,e)},e.boxcastBroadphaseExcludingSelf=function(t,e,n){return void 0===n&&(n=this.allLayers),this._spatialHash.aabbBroadphase(e,t,n)},e.boxcastBroadphaseExcludingSelfNonRect=function(t,e){void 0===e&&(e=this.allLayers);var n=t.bounds.clone();return this._spatialHash.aabbBroadphase(n,t,e)},e.boxcastBroadphaseExcludingSelfDelta=function(t,n,i,r){void 0===r&&(r=e.allLayers);var o=t.bounds.clone().getSweptBroadphaseBounds(n,i);return this._spatialHash.aabbBroadphase(o,t,r)},e.addCollider=function(t){e._spatialHash.register(t)},e.removeCollider=function(t){e._spatialHash.remove(t)},e.updateCollider=function(t){this._spatialHash.remove(t),this._spatialHash.register(t)},e.linecast=function(t,n,i){return void 0===i&&(i=e.allLayers),this._hitArray[0].reset(),this.linecastAll(t,n,this._hitArray,i),this._hitArray[0]},e.linecastAll=function(t,n,i,r){return void 0===r&&(r=e.allLayers),0==i.length?(console.warn("传入了一个空的hits数组。没有点击会被返回"),0):this._spatialHash.linecast(t,n,i,r)},e.overlapRectangle=function(t,n){return void 0===n&&(n=e.allLayers),this._colliderArray[0]=null,this._spatialHash.overlapRectangle(t,this._colliderArray,n),this._colliderArray[0]},e.overlapRectangleAll=function(t,n,i){return void 0===i&&(i=e.allLayers),0==n.length?(console.warn("传入了一个空的结果数组。不会返回任何结果"),0):this._spatialHash.overlapRectangle(t,n,i)},e.gravity=new t.Vector2(0,300),e.spatialHashCellSize=100,e.allLayers=-1,e.raycastsHitTriggers=!1,e.raycastsStartInColliders=!1,e._hitArray=[new t.RaycastHit],e._colliderArray=[null],e}();t.Physics=e}(es||(es={})),function(t){var e=function(){return function(e,n){this.start=e,this.end=n,this.direction=t.Vector2.subtract(this.end,this.start)}}();t.Ray2D=e}(es||(es={})),function(t){var e=function(){function e(e){void 0===e&&(e=100),this.gridBounds=new t.Rectangle,this._overlapTestBox=new t.Box(0,0),this._overlapTestCircle=new t.Circle(0),this._cellDict=new n,this._tempHashSet=new Set,this._cellSize=e,this._inverseCellSize=1/this._cellSize,this._raycastParser=new i}return e.prototype.register=function(e){var n=e.bounds.clone();e.registeredPhysicsBounds=n;var i=this.cellCoords(n.x,n.y),r=this.cellCoords(n.right,n.bottom);this.gridBounds.contains(i.x,i.y)||(this.gridBounds=t.RectangleExt.union(this.gridBounds,i)),this.gridBounds.contains(r.x,r.y)||(this.gridBounds=t.RectangleExt.union(this.gridBounds,r));for(var o=i.x;o<=r.x;o++)for(var s=i.y;s<=r.y;s++){this.cellAtPosition(o,s,!0).push(e)}},e.prototype.remove=function(e){for(var n=e.registeredPhysicsBounds.clone(),i=this.cellCoords(n.x,n.y),r=this.cellCoords(n.right,n.bottom),o=i.x;o<=r.x;o++)for(var s=i.y;s<=r.y;s++){var a=this.cellAtPosition(o,s);t.Insist.isNotNull(a,"从不存在碰撞器的单元格中移除碰撞器: ["+e+"]"),null!=a&&new linq.List(a).remove(e)}},e.prototype.removeWithBruteForce=function(t){this._cellDict.remove(t)},e.prototype.clear=function(){this._cellDict.clear()},e.prototype.aabbBroadphase=function(e,n,i){this._tempHashSet.clear();for(var r=this.cellCoords(e.x,e.y),o=this.cellCoords(e.right,e.bottom),s=r.x;s<=o.x;s++)for(var a=r.y;a<=o.y;a++){var c=this.cellAtPosition(s,a);if(null!=c)for(var h=0;h>>0},t.prototype.clear=function(){this._store.clear()},t}();t.NumberDictionary=n;var i=function(){function e(){this._tempHit=new t.RaycastHit,this._checkedColliders=[],this._cellHits=[]}return e.prototype.start=function(t,e,n){this._ray=t,this._hits=e,this._layerMask=n,this.hitCounter=0},e.prototype.checkRayIntersection=function(n,i,r){for(var o=new t.Ref(0),s=0;s=this.points.length?this.points[0]:this.points[i+1];var o=t.Vector2Ext.perpendicular(r,e);t.Vector2Ext.normalize(o),this._edgeNormals[i]=o}},n.buildSymmetricalPolygon=function(e,n){for(var i=new Array(e),r=0;rr&&(r=s,i=o)}return e[i]},n.getClosestPointOnPolygonToPoint=function(e,n,i,r){i.value=Number.MAX_VALUE,r.x=0,r.y=0;for(var o=t.Vector2.zero,s=0,a=0;at.y!=this.points[i].y>t.y&&t.x<(this.points[i].x-this.points[n].x)*(t.y-this.points[n].y)/(this.points[i].y-this.points[n].y)+this.points[n].x&&(e=!e);return e},n.prototype.pointCollidesWithShape=function(e,n){return t.ShapeCollisions.pointToPoly(e,this,n)},n}(t.Shape);t.Polygon=e}(es||(es={})),function(t){var e=function(e){function n(t,i){var r=e.call(this,n.buildBox(t,i),!0)||this;return r.width=t,r.height=i,r}return __extends(n,e),n.buildBox=function(e,n){var i=e/2,r=n/2,o=new Array(4);return o[0]=new t.Vector2(-i,-r),o[1]=new t.Vector2(i,-r),o[2]=new t.Vector2(i,r),o[3]=new t.Vector2(-i,r),o},n.prototype.updateBox=function(e,n){this.width=e,this.height=n;var i=e/2,r=n/2;this.points[0]=new t.Vector2(-i,-r),this.points[1]=new t.Vector2(i,-r),this.points[2]=new t.Vector2(i,r),this.points[3]=new t.Vector2(-i,r);for(var o=0;o1)return!1;var a,c=t.Vector2.add(s.start,t.Vector2.multiply(s.direction,new t.Vector2(r.value))),h=0;c.xn.bounds.right&&(h|=1),c.yn.bounds.bottom&&(h|=2);var u=a+h;return 3==u&&console.log("m == 3. corner "+t.Time.frameCount),!0},e.corner=function(e,n){var i=new t.Vector2;return i.x=0==(1&n)?e.right:e.left,i.y=0==(1&n)?e.bottom:e.top,i},e.testCircleBox=function(e,n,i){i=n.bounds.getClosestPointOnRectangleToPoint(e.position);var r=t.Vector2.subtract(i,e.position);return t.Vector2.dot(r,r)<=e.radius*e.radius},e}();t.RealtimeCollisions=e}(es||(es={})),function(t){var e=function(){function e(){}return e.polygonToPolygon=function(e,n,i){for(var r,o=!0,s=e.edgeNormals.slice(),a=n.edgeNormals.slice(),c=Number.POSITIVE_INFINITY,h=new t.Vector2,u=t.Vector2.subtract(e.position,n.position),l=0;l0&&(o=!1),!o)return!1;(y=Math.abs(y))r.value&&(r.value=o)},e.circleToPolygon=function(e,n,i){void 0===i&&(i=new t.CollisionResult);var r,o=t.Vector2.subtract(e.position,n.position),s=new t.Ref(0),a=t.Polygon.getClosestPointOnPolygonToPoint(n.points,o,s,i.normal),c=n.containsPoint(e.position);if(s.value>e.radius*e.radius&&!c)return!1;if(c)r=t.Vector2.multiply(i.normal,new t.Vector2(Math.sqrt(s.value)-e.radius));else if(0==s.value)r=new t.Vector2(i.normal.x*e.radius,i.normal.y*e.radius);else{var h=Math.sqrt(s.value);r=t.Vector2.subtract(new t.Vector2(-1),t.Vector2.subtract(o,a)).multiply(new t.Vector2((e.radius-h)/h))}return i.minimumTranslationVector=r,i.point=t.Vector2.add(a,n.position),!0},e.circleToBox=function(e,n,i){void 0===i&&(i=new t.CollisionResult);var r=n.bounds.getClosestPointOnRectangleBorderToPoint(e.position,i.normal);if(n.containsPoint(e.position)){i.point=r.clone();var o=t.Vector2.add(r,t.Vector2.multiply(i.normal,new t.Vector2(e.radius)));return i.minimumTranslationVector=t.Vector2.subtract(e.position,o),!0}var s=t.Vector2.distanceSquared(r,e.position);if(0==s)i.minimumTranslationVector=t.Vector2.multiply(i.normal,new t.Vector2(e.radius));else if(s<=e.radius*e.radius){i.normal=t.Vector2.subtract(e.position,r);var a=i.normal.length()-e.radius;return i.point=r,t.Vector2Ext.normalize(i.normal),i.minimumTranslationVector=t.Vector2.multiply(new t.Vector2(a),i.normal),!0}return!1},e.pointToCircle=function(e,n,i){var r=t.Vector2.distanceSquared(e,n.position),o=1+n.radius;if(r1)return!1;var l=(h.x*s.y-h.y*s.x)/c;return!(l<0||l>1)&&(t.Vector2.add(e,t.Vector2.multiply(new t.Vector2(u),s)),!0)},e.lineToCircle=function(e,n,i,r){var o=t.Vector2.distance(e,n),s=t.Vector2.divide(t.Vector2.subtract(n,e),new t.Vector2(o)),a=t.Vector2.subtract(e,i.position),c=t.Vector2.dot(a,s),h=t.Vector2.dot(a,a)-i.radius*i.radius;if(h>0&&c>0)return!1;var u=c*c-h;return!(u<0)&&(r.fraction=-c-Math.sqrt(u),r.fraction<0&&(r.fraction=0),r.point=t.Vector2.add(e,t.Vector2.multiply(new t.Vector2(r.fraction),s)),r.distance=t.Vector2.distance(e,r.point),r.normal=t.Vector2.normalize(t.Vector2.subtract(r.point,i.position)),r.fraction=r.distance/o,!0)},e.boxToBoxCast=function(e,n,i,r){var o=this.minkowskiDifference(e,n);if(o.contains(0,0)){var s=o.getClosestPointOnBoundsToOrigin();return!s.equals(t.Vector2.zero)&&(r.normal=new t.Vector2(-s.x),r.normal.normalize(),r.distance=0,r.fraction=0,!0)}var a=new t.Ray2D(t.Vector2.zero,new t.Vector2(-i.x)),c=new t.Ref(0);return!!(o.rayIntersects(a,c)&&c.value<=1)&&(r.fraction=c.value,r.distance=i.length()*c.value,r.normal=new t.Vector2(-i.x,-i.y),r.normal.normalize(),r.centroid=t.Vector2.add(e.bounds.center,t.Vector2.multiply(i,new t.Vector2(c.value))),!0)},e}();t.ShapeCollisions=e}(es||(es={})),function(t){var e=function(){return function(t,e){this.func=t,this.context=e}}();t.FuncPack=e;var n=function(){function n(){this._messageTable=new Map}return n.prototype.addObserver=function(n,i,r){var o=this._messageTable.get(n);o||(o=[],this._messageTable.set(n,o)),t.Insist.isFalse(-1!=o.findIndex(function(t){return t.func==i}),"您试图添加相同的观察者两次"),o.push(new e(i,r))},n.prototype.removeObserver=function(t,e){var n=this._messageTable.get(t),i=n.findIndex(function(t){return t.func==e});-1!=i&&new linq.List(n).removeAt(i)},n.prototype.emit=function(t){for(var e,n=[],i=1;i=0;o--)(e=r[o].func).call.apply(e,__spread([r[o].context],n))},n}();t.Emitter=n}(es||(es={})),function(t){!function(t){t[t.top=0]="top",t[t.bottom=1]="bottom",t[t.left=2]="left",t[t.right=3]="right"}(t.Edge||(t.Edge={}))}(es||(es={})),function(t){var e=function(){function t(){}return t.repeat=function(t,e){for(var n=[];e--;)n.push(t);return n},t}();t.Enumerable=e}(es||(es={})),function(t){var e=function(){function t(){}return t.default=function(){return new t},t.prototype.equals=function(t,e){return"function"==typeof t.equals?t.equals(e):t===e},t.prototype.getHashCode=function(t){var e=this;if("number"==typeof t)return this._getHashCodeForNumber(t);if("string"==typeof t)return this._getHashCodeForString(t);var n=385229220;return this.forOwn(t,function(t){"number"==typeof t?n+=e._getHashCodeForNumber(t):"string"==typeof t?n+=e._getHashCodeForString(t):"object"==typeof t&&e.forOwn(t,function(){n+=e.getHashCode(t)})}),n},t.prototype._getHashCodeForNumber=function(t){return t},t.prototype._getHashCodeForString=function(t){for(var e=385229220,n=0;n>7,n+=n<<3,n^=n>>17,n+=n<<5},t}();t.Hash=e}(es||(es={})),function(t){var e=function(){return function(t){this.value=t}}();t.Ref=e}(es||(es={})),function(t){var e=function(){function e(){}return Object.defineProperty(e,"size",{get:function(){return new t.Vector2(this.width,this.height)},enumerable:!0,configurable:!0}),Object.defineProperty(e,"center",{get:function(){return new t.Vector2(this.width/2,this.height/2)},enumerable:!0,configurable:!0}),e}();t.Screen=e}(es||(es={})),function(t){var e=function(){function t(){}return t.prototype.update=function(t){this.remainder+=t;var e=Math.trunc(this.remainder);return this.remainder-=e,e},t.prototype.reset=function(){this.remainder=0},t}();t.SubpixelNumber=e}(es||(es={})),function(t){var e=function(){function e(){this.triangleIndices=[],this._triPrev=new Array(12),this._triNext=new Array(12)}return e.testPointTriangle=function(e,n,i,r){return!(t.Vector2Ext.cross(t.Vector2.subtract(e,n),t.Vector2.subtract(i,n))<0)&&(!(t.Vector2Ext.cross(t.Vector2.subtract(e,i),t.Vector2.subtract(r,i))<0)&&!(t.Vector2Ext.cross(t.Vector2.subtract(e,r),t.Vector2.subtract(n,r))<0))},e.prototype.triangulate=function(n,i){void 0===i&&(i=!0);var r=n.length;this.initialize(r);for(var o=0,s=0;r>3&&o<500;){o++;var a=!0,c=n[this._triPrev[s]],h=n[s],u=n[this._triNext[s]];if(t.Vector2Ext.isTriangleCCW(c,h,u)){var l=this._triNext[this._triNext[s]];do{if(e.testPointTriangle(n[l],c,h,u)){a=!1;break}l=this._triNext[l]}while(l!=this._triPrev[s])}else a=!1;a?(this.triangleIndices.push(this._triPrev[s]),this.triangleIndices.push(s),this.triangleIndices.push(this._triNext[s]),this._triNext[this._triPrev[s]]=this._triNext[s],this._triPrev[this._triNext[s]]=this._triPrev[s],r--,s=this._triPrev[s]):s=this._triNext[s]}this.triangleIndices.push(this._triPrev[s]),this.triangleIndices.push(s),this.triangleIndices.push(this._triNext[s]),i||this.triangleIndices.reverse()},e.prototype.initialize=function(t){this.triangleIndices.length=0,this._triNext.length=e.logSnapDuration&&(l.logs[r].snapMin=l.logs[r].min,l.logs[r].snapMax=l.logs[r].max,l.logs[r].snapAvg=l.logs[r].avg,l.logs[r].samples=0)):(l.logs[r].min=h,l.logs[r].max=h,l.logs[r].avg=h,l.logs[r].initialized=!0)}s.markCount=o.nestCount,s.nestCount=o.nestCount}this.stopwatch.reset(),this.stopwatch.start()}}},e.prototype.beginMark=function(i,r,o){if(void 0===o&&(o=0),t.Core.Instance.debug){if(o<0||o>=e.maxBars)throw new Error("barIndex 越位");var s=this.curLog.bars[o];if(s.markCount>=e.maxSamples)throw new Error("超出样本数.\n 要么设置更大的数字为TimeRuler.MaxSmpale,要么降低样本数");if(s.nestCount>=e.maxNestCall)throw new Error("nestCount超出.\n 要么将大的设置为TimeRuler.MaxNestCall,要么将小的设置为NestCall");var a=this.markerNameToIdMap.get(i);null==a&&(a=this.markers.length,this.markerNameToIdMap.set(i,a),this.markers.push(new n(i))),s.markerNests[s.nestCount++]=s.markCount,s.markers[s.markCount].markerId=a,s.markers[s.markCount].color=r,s.markers[s.markCount].beginTime=this.stopwatch.getTime(),s.markers[s.markCount].endTime=-1,s.markCount++}},e.prototype.endMark=function(n,i){if(void 0===i&&(i=0),t.Core.Instance.debug){if(i<0||i>=e.maxBars)throw new Error("barIndex 越位");var r=this.curLog.bars[i];if(r.nestCount<=0)throw new Error("在调用结束标记方法之前调用beginMark方法");var o=this.markerNameToIdMap.get(n);if(null==o)throw new Error("标记"+n+"没有注册。请确认您指定的名称与BeginMark方法使用的名称相同");var s=r.markerNests[--r.nestCount];if(r.markers[s].markerId!=o)throw new Error("beginMark/endMark方法的调用顺序不正确. beginMark(A), beginMark(B), endMark(B), endMark(A).但你不能像这样叫它 beginMark(A), beginMark(B), endMark(A), endMark(B)");r.markers[s].endTime=this.stopwatch.getTime()}},e.prototype.getAverageTime=function(t,n){if(t<0||t>=e.maxBars)throw new Error("barIndex 越位");var i=0,r=this.markerNameToIdMap.get(n);return null!=r&&(i=this.markers[r].logs[t].avg),i},e.prototype.resetLog=function(){var e,n;if(t.Core.Instance.debug)try{for(var i=__values(this.markers),r=i.next();!r.done;r=i.next())for(var o=r.value,s=0;sthis._buckets.length){this._buckets=new Array(t.HashHelpers.expandPrime(this._collisions)),this._collisions=0;for(var l=0;l=e?t%e:t},e}();t.FasterDictionary=e;var n=function(){return function(t,e,n){void 0===n&&(n=-1),this.key=t,this.hashcode=e,this.previous=n,this.next=-1}}();t.FastNode=n}(es||(es={})),function(t){var e=function(){return function(t,e){this.element=t,this.next=e}}();function n(t,e){return t===e}t.Node=e,t.defaultEquals=n;var i=function(){function t(t){void 0===t&&(t=n),this.count=0,this.next=void 0,this.equalsFn=t,this.head=null}return t.prototype.push=function(t){var n,i=new e(t);if(null==this.head)this.head=i;else{for(n=this.head;null!=n.next;)n=n.next;n.next=i}this.count++},t.prototype.removeAt=function(t){if(t>=0&&t=0&&t<=this.count){for(var e=this.head,n=0;n=0&&n<=this.count){var i=new e(t);if(0===n)i.next=this.head,this.head=i;else{var r=this.getElementAt(n-1);i.next=r.next,r.next=i}return this.count++,!0}return!1},t.prototype.indexOf=function(t){for(var e=this.head,n=0;n0)for(var e=0;ethis._objectQueue.length;)this._objectQueue.shift()},t.clearCache=function(){this._objectQueue.length=0},t.obtain=function(){return this._objectQueue.length>0?this._objectQueue.shift():[]},t.free=function(t){this._objectQueue.unshift(t),t.length=0},t._objectQueue=[],t}();t.ListPool=e}(es||(es={})),function(t){var e=function(){function e(t,e){this.first=t,this.second=e}return e.prototype.clear=function(){this.first=this.second=null},e.prototype.equals=function(t){return this.first==t.first&&this.second==t.second},e.prototype.getHashCode=function(){return 37*t.EqualityComparer.default().getHashCode(this.first)+t.EqualityComparer.default().getHashCode(this.second)},e}();t.Pair=e}(es||(es={})),function(t){var e=function(){function e(){}return e.warmCache=function(t,e){if((e-=this._objectQueue.length)>0)for(var n=0;nthis._objectQueue.length;)this._objectQueue.shift()},e.clearCache=function(){this._objectQueue.length=0},e.obtain=function(t){return this._objectQueue.length>0?this._objectQueue.shift():new t},e.free=function(e){this._objectQueue.unshift(e),t.isIPoolable(e)&&e.reset()},e._objectQueue=[],e}();t.Pool=e,t.isIPoolable=function(t){return void 0!==t.reset}}(es||(es={})),function(t){var e=function(t){function e(e){return t.call(this,e)||this}return __extends(e,t),e.prototype.getHashCode=function(t){return t.getHashCode()},e.prototype.areEqual=function(t,e){return t.equals(e)},e}(function(){function t(t){var e=this;this.clear(),t&&t.forEach(function(t){e.add(t)})}return t.prototype.add=function(t){var e=this,n=this.getHashCode(t),i=this.buckets[n];if(void 0===i){var r=new Array;return r.push(t),this.buckets[n]=r,this.count=this.count+1,!0}return!i.some(function(n){return e.areEqual(n,t)})&&(i.push(t),this.count=this.count+1,!0)},t.prototype.remove=function(t){var e=this,n=this.getHashCode(t),i=this.buckets[n];if(void 0===i)return!1;var r=!1,o=new Array;return i.forEach(function(n){e.areEqual(n,t)?r=!0:o.push(t)}),this.buckets[n]=o,r&&(this.count=this.count-1),r},t.prototype.contains=function(t){return this.bucketsContains(this.buckets,t)},t.prototype.getCount=function(){return this.count},t.prototype.clear=function(){this.buckets=new Array,this.count=0},t.prototype.toArray=function(){var t=new Array;return this.buckets.forEach(function(e){e.forEach(function(e){t.push(e)})}),t},t.prototype.exceptWith=function(t){var e=this;t&&t.forEach(function(t){e.remove(t)})},t.prototype.intersectWith=function(t){var e=this;if(t){var n=this.buildInternalBuckets(t);this.toArray().forEach(function(t){e.bucketsContains(n.Buckets,t)||e.remove(t)})}else this.clear()},t.prototype.unionWith=function(t){var e=this;t.forEach(function(t){e.add(t)})},t.prototype.isSubsetOf=function(t){var e=this,n=this.buildInternalBuckets(t);return this.toArray().every(function(t){return e.bucketsContains(n.Buckets,t)})},t.prototype.isSupersetOf=function(t){var e=this;return t.every(function(t){return e.contains(t)})},t.prototype.overlaps=function(t){var e=this;return t.some(function(t){return e.contains(t)})},t.prototype.setEquals=function(t){var e=this;return this.buildInternalBuckets(t).Count===this.count&&t.every(function(t){return e.contains(t)})},t.prototype.buildInternalBuckets=function(t){var e=this,n=new Array,i=0;return t.forEach(function(t){var r=e.getHashCode(t),o=n[r];if(void 0===o){var s=new Array;s.push(t),n[r]=s,i+=1}else o.some(function(n){return e.areEqual(n,t)})||(o.push(t),i+=1)}),{Buckets:n,Count:i}},t.prototype.bucketsContains=function(t,e){var n=this,i=t[this.getHashCode(e)];return void 0!==i&&i.some(function(t){return n.areEqual(t,e)})},t}());t.HashSet=e}(es||(es={})),function(t){var e=function(){function t(){}return t.waitForSeconds=function(t){return n.waiter.wait(t)},t}();t.Coroutine=e;var n=function(){function t(){this.waitTime=0}return t.prototype.wait=function(e){return t.waiter.waitTime=e,t.waiter},t.waiter=new t,t}();t.WaitForSeconds=n}(es||(es={})),function(t){var e=function(){function t(){this.waitTimer=0,this.useUnscaledDeltaTime=!1}return t.prototype.stop=function(){this.isDone=!0},t.prototype.setUseUnscaledDeltaTime=function(t){return this.useUnscaledDeltaTime=t,this},t.prototype.prepareForUse=function(){this.isDone=!1},t.prototype.reset=function(){this.isDone=!0,this.waitTimer=0,this.waitForCoroutine=null,this.enumerator=null,this.useUnscaledDeltaTime=!1},t}();t.CoroutineImpl=e;var n=function(n){function i(){var t=null!==n&&n.apply(this,arguments)||this;return t._unblockedCoroutines=[],t._shouldRunNextFrame=[],t}return __extends(i,n),i.prototype.startCoroutine=function(n){var i=t.Pool.obtain(e);return i.prepareForUse(),i.enumerator=n,this.tickCoroutine(i)?(this._isInUpdate?this._shouldRunNextFrame.push(i):this._unblockedCoroutines.push(i),i):null},i.prototype.update=function(){this._isInUpdate=!0;for(var e=0;e0?(n.waitTimer-=n.useUnscaledDeltaTime?t.Time.unscaledDeltaTime:t.Time.deltaTime,this._shouldRunNextFrame.push(n)):this.tickCoroutine(n)&&this._shouldRunNextFrame.push(n)}}var i=new linq.List(this._unblockedCoroutines);i.clear(),i.addRange(this._shouldRunNextFrame),this._shouldRunNextFrame.length=0,this._isInUpdate=!1},i.prototype.tickCoroutine=function(n){var i=n.enumerator.next();return i.done||n.isDone?(t.Pool.free(n),!1):null==i.value||(i.value instanceof t.WaitForSeconds?(n.waitTimer=i.value.waitTime,!0):"number"==typeof i.value?(n.waitTimer=i.value,!0):"string"==typeof i.value?"break"!=i.value||(t.Pool.free(n),!1):!(i.value instanceof e)||(n.waitForCoroutine=i.value,!0))},i}(t.GlobalManager);t.CoroutineManager=n}(es||(es={})),function(t){var e=function(){function e(t,e,n){void 0===n&&(n=!0),this.binWidth=0,this.binHeight=0,this.usedRectangles=[],this.freeRectangles=[],this.init(t,e,n)}return e.prototype.init=function(e,n,i){void 0===i&&(i=!0),this.binWidth=e,this.binHeight=n,this.allowRotations=i;var r=new t.Rectangle;r.x=0,r.y=0,r.width=e,r.height=n,this.usedRectangles.length=0,this.freeRectangles.length=0,this.freeRectangles.push(r)},e.prototype.insert=function(e,n){var i=new t.Rectangle,r=new t.Ref(0),o=new t.Ref(0);if(0==(i=this.findPositionForNewNodeBestAreaFit(e,n,r,o)).height)return i;for(var s=this.freeRectangles.length,a=0;a=e&&this.freeRectangles[s].height>=n){var c=Math.abs(this.freeRectangles[s].width-e),h=Math.abs(this.freeRectangles[s].height-n),u=Math.min(c,h);(a=n&&this.freeRectangles[s].height>=e){c=Math.abs(this.freeRectangles[s].width-n),h=Math.abs(this.freeRectangles[s].height-e),u=Math.min(c,h);(a=t.x+t.width||e.x+e.width<=t.x||e.y>=t.y+t.height||e.y+e.height<=t.y)return!1;if(e.xt.x){if(e.y>t.y&&e.yt.y){var n;if(e.x>t.x&&e.x=e.x&&t.y>=e.y&&t.x+t.width<=e.x+e.width&&t.y+t.height<=e.y+e.height},e}();t.MaxRectsBinPack=e}(es||(es={}));var ArrayUtils=function(){function t(){}return t.bubbleSort=function(t){for(var e=!1,n=0;nn;i--)if(t[i]0&&t[r-1]>i;r--)t[r]=t[r-1];t[r]=i}},t.binarySearch=function(t,e){for(var n=0,i=t.length,r=n+i>>1;n=t[r]&&(n=r+1),r=n+i>>1;return t[n]==e?n:-1},t.findElementIndex=function(t,e){for(var n=t.length,i=0;it[e]&&(e=i);return e},t.getMinElementIndex=function(t){for(var e=0,n=t.length,i=1;i=0;--r)n.unshift(e[r]);return n},t.getDifferAry=function(t,e){t=this.getUniqueAry(t),e=this.getUniqueAry(e);for(var n=t.concat(e),i={},r=[],o=n.length,s=0;s=0;e-=1)t.splice(e,1)},t.cloneList=function(t){return t?t.slice(0,t.length):null},t.equals=function(t,e){if(t==e)return!0;var n=t.length;if(n!=e.length)return!1;for(;n--;)if(t[n]!=e[n])return!1;return!0},t.insert=function(t,e,n){if(!t)return null;var i=t.length;if(e>i&&(e=i),e<0&&(e=0),e==i)t.push(n);else if(0==e)t.unshift(n);else{for(var r=i-1;r>=e;r-=1)t[r+1]=t[r];t[e]=n}return n},t.shuffle=function(t){for(var e=t.length;e>1;){e--;var n=RandomUtils.randint(0,e+1),i=t[n];t[n]=t[e],t[e]=i}},t.addIfNotPresent=function(t,e){return!new linq.List(t).contains(e)&&(t.push(e),!0)},t.lastItem=function(t){return t[t.length-1]},t.randomItem=function(t){return t[RandomUtils.randint(0,t.length-1)]},t.randomItems=function(t,e){for(var n=new Set;n.size!=e;){var i=this.randomItem(t);n.has(i)||n.add(i)}var r=es.ListPool.obtain();return n.forEach(function(t){return r.push(t)}),r},t}();!function(t){var e=function(){function t(){}return Object.defineProperty(t,"nativeBase64",{get:function(){return"function"==typeof window.atob},enumerable:!0,configurable:!0}),t.decode=function(t){if(t=t.replace(/[^A-Za-z0-9\+\/\=]/g,""),this.nativeBase64)return window.atob(t);for(var e,n,i,r,o,s,a=[],c=0;c>4,n=(15&r)<<4|(o=this._keyStr.indexOf(t.charAt(c++)))>>2,i=(3&o)<<6|(s=this._keyStr.indexOf(t.charAt(c++))),a.push(String.fromCharCode(e)),64!==o&&a.push(String.fromCharCode(n)),64!==s&&a.push(String.fromCharCode(i));return a=a.join("")},t.encode=function(t){if(t=t.replace(/\r\n/g,"\n"),!this.nativeBase64){for(var e,n,i,r,o,s,a,c=[],h=0;h>2,o=(3&e)<<4|(n=t.charCodeAt(h++))>>4,s=(15&n)<<2|(i=t.charCodeAt(h++))>>6,a=63&i,isNaN(n)?s=a=64:isNaN(i)&&(a=64),c.push(this._keyStr.charAt(r)),c.push(this._keyStr.charAt(o)),c.push(this._keyStr.charAt(s)),c.push(this._keyStr.charAt(a));return c=c.join("")}window.btoa(t)},t.decodeBase64AsArray=function(e,n){n=n||1;var i,r,o,s=t.decode(e),a=new Uint32Array(s.length/n);for(i=0,o=s.length/n;i=0;--r)a[i]+=s.charCodeAt(i*n+r)<<(r<<3);return a},t.decompress=function(t,e,n){throw new Error("GZIP/ZLIB compressed TMX Tile Map not supported!")},t.decodeCSV=function(t){for(var e=t.replace("\n","").trim().split(","),n=[],i=0;i(e=Math.floor(e))?t++:e++,this.randrange(t,e)},t.randnum=function(t,e){return this.random()*(e-t)+t},t.shuffle=function(t){return t.sort(this._randomCompare),t},t.choice=function(t){if(!t.hasOwnProperty("length"))throw new Error("无法对此对象执行此操作");var e=Math.floor(this.random()*t.length);return t instanceof String?String(t).charAt(e):t[e]},t.sample=function(t,e){var n=t.length;if(e<=0||n=0;)s=Math.floor(this.random()*n);i.push(t[s]),r.push(s)}return i},t.random=function(){return Math.random()},t.boolean=function(t){return void 0===t&&(t=.5),this.random().5?1:-1},t}();!function(t){var e=function(){function e(){}return e.getSide=function(e,n){switch(n){case t.Edge.top:return e.top;case t.Edge.bottom:return e.bottom;case t.Edge.left:return e.left;case t.Edge.right:return e.right}},e.union=function(e,n){var i=new t.Rectangle(n.x,n.y,0,0),r=new t.Rectangle;return r.x=Math.min(e.x,i.x),r.y=Math.min(e.y,i.y),r.width=Math.max(e.right,i.right)-r.x,r.height=Math.max(e.bottom,i.bottom)-r.y,r},e.getHalfRect=function(e,n){switch(n){case t.Edge.top:return new t.Rectangle(e.x,e.y,e.width,e.height/2);case t.Edge.bottom:return new t.Rectangle(e.x,e.y+e.height/2,e.width,e.height/2);case t.Edge.left:return new t.Rectangle(e.x,e.y,e.width/2,e.height);case t.Edge.right:return new t.Rectangle(e.x+e.width/2,e.y,e.width/2,e.height)}},e.getRectEdgePortion=function(e,n,i){switch(void 0===i&&(i=1),n){case t.Edge.top:return new t.Rectangle(e.x,e.y,e.width,i);case t.Edge.bottom:return new t.Rectangle(e.x,e.y+e.height-i,e.width,i);case t.Edge.left:return new t.Rectangle(e.x,e.y,i,e.height);case t.Edge.right:return new t.Rectangle(e.x+e.width-i,e.y,i,e.height)}},e.expandSide=function(e,n,i){switch(i=Math.abs(i),n){case t.Edge.top:e.y-=i,e.height+=i;break;case t.Edge.bottom:e.height+=i;break;case t.Edge.left:e.x-=i,e.width+=i;break;case t.Edge.right:e.width+=i}},e.contract=function(t,e,n){t.x+=e,t.y+=n,t.width-=2*e,t.height-=2*n},e.boundsFromPolygonVector=function(e){for(var n=Number.POSITIVE_INFINITY,i=Number.POSITIVE_INFINITY,r=Number.NEGATIVE_INFINITY,o=Number.NEGATIVE_INFINITY,s=0;sr&&(r=a.x),a.yo&&(o=a.y)}return this.fromMinMaxVector(new t.Vector2(n,i),new t.Vector2(r,o))},e.fromMinMaxVector=function(e,n){return new t.Rectangle(e.x,e.y,n.x-e.x,n.y-e.y)},e.getSweptBroadphaseBounds=function(e,n,i){var r=t.Rectangle.empty;return r.x=n>0?e.x:e.x+n,r.y=i>0?e.y:e.y+i,r.width=n>0?n+e.width:e.width-n,r.height=i>0?i+e.height:e.height-i,r},e.prototype.collisionCheck=function(t,e,n,i){n.value=i.value=0;var r=e.x-(t.x+t.width),o=e.x+e.width-t.x,s=e.y-(t.y+t.height),a=e.y+e.height-t.y;return!(r>0||o<0||s>0||a<0)&&(n.value=Math.abs(r)=l||Math.abs(u)>=p)return t.Vector2.zero;var f=h>0?l-h:-l-h,d=u>0?p-u:-p-u;return new t.Vector2(f,d)},e}();t.RectangleExt=e}(es||(es={})),function(t){var e=function(){function t(){}return t.premultiplyAlpha=function(t){for(var e=t[0],n=0;nt.MathHelper.Epsilon?e.divide(new t.Vector2(n)):e.x=e.y=0},e.transformA=function(t,e,n,i,r,o){for(var s=0;so?e?-1:1:r0},e.prototype.average=function(t){return this.sum(t)/this.count(t)},e.prototype.cast=function(){return new e(this._elements)},e.prototype.clear=function(){this._elements.length=0},e.prototype.concat=function(t){return new e(this._elements.concat(t.toArray()))},e.prototype.contains=function(t){return this.any(function(e){return e===t})},e.prototype.count=function(t){return t?this.where(t).count():this._elements.length},e.prototype.defaultIfEmpty=function(t){return this.count()?this:new e([t])},e.prototype.distinctBy=function(t){var n=this.groupBy(t);return Object.keys(n).reduce(function(t,e){return t.add(n[e][0]),t},new e)},e.prototype.elementAt=function(t){if(t=0)return this._elements[t];throw new Error("ArgumentOutOfRangeException: index is less than 0 or greater than or equal to the number of elements in source.")},e.prototype.elementAtOrDefault=function(t){return t=0?this._elements[t]:void 0},e.prototype.except=function(t){return this.where(function(e){return!t.contains(e)})},e.prototype.first=function(t){if(this.count())return t?this.where(t).first():this._elements[0];throw new Error("InvalidOperationException: The source sequence is empty.")},e.prototype.firstOrDefault=function(t){return this.count(t)?this.first(t):void 0},e.prototype.forEach=function(t){return this._elements.forEach(t)},e.prototype.groupBy=function(t,e){void 0===e&&(e=function(t){return t});return this.aggregate(function(n,i){var r=t(i),o=n[r],s=e(i);return o?o.push(s):n[r]=[s],n},{})},e.prototype.groupJoin=function(t,e,n,i){return this.select(function(r){return i(r,t.where(function(t){return e(r)===n(t)}))})},e.prototype.indexOf=function(t){return this._elements.indexOf(t)},e.prototype.insert=function(t,e){if(t<0||t>this._elements.length)throw new Error("Index is out of range.");this._elements.splice(t,0,e)},e.prototype.intersect=function(t){return this.where(function(e){return t.contains(e)})},e.prototype.join=function(t,e,n,i){return this.selectMany(function(r){return t.where(function(t){return n(t)===e(r)}).select(function(t){return i(r,t)})})},e.prototype.last=function(t){if(this.count())return t?this.where(t).last():this._elements[this.count()-1];throw Error("InvalidOperationException: The source sequence is empty.")},e.prototype.lastOrDefault=function(t){return this.count(t)?this.last(t):void 0},e.prototype.max=function(t){return Math.max.apply(Math,__spread(this._elements.map(t||function(t){return t})))},e.prototype.min=function(t){return Math.min.apply(Math,__spread(this._elements.map(t||function(t){return t})))},e.prototype.ofType=function(t){var e;switch(t){case Number:e="number";break;case String:e="string";break;case Boolean:e=typeof!0;break;case Function:e="function";break;default:e=null}return null===e?this.where(function(e){return e instanceof t}).cast():this.where(function(t){return typeof t===e}).cast()},e.prototype.orderBy=function(e,i){return void 0===i&&(i=t.keyComparer(e,!1)),new n(this._elements,i)},e.prototype.orderByDescending=function(e,i){return void 0===i&&(i=t.keyComparer(e,!0)),new n(this._elements,i)},e.prototype.thenBy=function(t){return this.orderBy(t)},e.prototype.thenByDescending=function(t){return this.orderByDescending(t)},e.prototype.remove=function(t){return-1!==this.indexOf(t)&&(this.removeAt(this.indexOf(t)),!0)},e.prototype.removeAll=function(e){return this.where(t.negate(e))},e.prototype.removeAt=function(t){this._elements.splice(t,1)},e.prototype.reverse=function(){return new e(this._elements.reverse())},e.prototype.select=function(t){return new e(this._elements.map(t))},e.prototype.selectMany=function(t){var n=this;return this.aggregate(function(e,i,r){return e.addRange(n.select(t).elementAt(r).toArray()),e},new e)},e.prototype.sequenceEqual=function(t){return this.all(function(e){return t.contains(e)})},e.prototype.single=function(t){if(1!==this.count(t))throw new Error("The collection does not contain exactly one element.");return this.first(t)},e.prototype.singleOrDefault=function(t){return this.count(t)?this.single(t):void 0},e.prototype.skip=function(t){return new e(this._elements.slice(Math.max(0,t)))},e.prototype.skipLast=function(t){return new e(this._elements.slice(0,-Math.max(0,t)))},e.prototype.skipWhile=function(t){var e=this;return this.skip(this.aggregate(function(n){return t(e.elementAt(n))?++n:n},0))},e.prototype.sum=function(t){return t?this.select(t).sum():this.aggregate(function(t,e){return t+ +e},0)},e.prototype.take=function(t){return new e(this._elements.slice(0,Math.max(0,t)))},e.prototype.takeLast=function(t){return new e(this._elements.slice(-Math.max(0,t)))},e.prototype.takeWhile=function(t){var e=this;return this.take(this.aggregate(function(n){return t(e.elementAt(n))?++n:n},0))},e.prototype.toArray=function(){return this._elements},e.prototype.toDictionary=function(t,n){var i=this;return this.aggregate(function(e,r,o){return e[i.select(t).elementAt(o).toString()]=n?i.select(n).elementAt(o):r,e.add({Key:i.select(t).elementAt(o),Value:n?i.select(n).elementAt(o):r}),e},new e)},e.prototype.toSet=function(){var t,e,n=new Set;try{for(var i=__values(this._elements),r=i.next();!r.done;r=i.next()){var o=r.value;n.add(o)}}catch(e){t={error:e}}finally{try{r&&!r.done&&(e=i.return)&&e.call(i)}finally{if(t)throw t.error}}return n},e.prototype.toList=function(){return this},e.prototype.toLookup=function(t,e){return this.groupBy(t,e)},e.prototype.where=function(t){return new e(this._elements.filter(t))},e.prototype.zip=function(t,e){var n=this;return t.count()e.angle?1:t.angleMath.PI&&(o-=2*Math.PI),r.p1.begin=o>0,r.p2.begin=!r.p1.begin}}catch(e){t={error:e}}finally{try{i&&!i.done&&(e=n.return)&&e.call(n)}finally{if(t)throw t.error}}this._isSpotLight&&(this._spotStartAngle=this._segments[0].p2.angle,this._spotEndAngle=this._segments[1].p2.angle)},e._cornerCache=[],e._openSegments=new t.LinkedList,e}();t.VisibilityComputer=e}(es||(es={})),function(t){var e=function(){function e(){this._timeInSeconds=0,this._repeats=!1,this._isDone=!1,this._elapsedTime=0}return e.prototype.getContext=function(){return this.context},e.prototype.reset=function(){this._elapsedTime=0},e.prototype.stop=function(){this._isDone=!0},e.prototype.tick=function(){return!this._isDone&&this._elapsedTime>this._timeInSeconds&&(this._elapsedTime-=this._timeInSeconds,this._onTime(this),this._isDone||this._repeats||(this._isDone=!0)),this._elapsedTime+=t.Time.deltaTime,this._isDone},e.prototype.initialize=function(t,e,n,i){this._timeInSeconds=t,this._repeats=e,this.context=n,this._onTime=i},e.prototype.unload=function(){this.context=null,this._onTime=null},e}();t.Timer=e}(es||(es={})),function(t){var e=function(e){function n(){var t=null!==e&&e.apply(this,arguments)||this;return t._timers=[],t}return __extends(n,e),n.prototype.update=function(){for(var t=this._timers.length-1;t>=0;t--)this._timers[t].tick()&&(this._timers[t].unload(),new linq.List(this._timers).removeAt(t))},n.prototype.schedule=function(e,n,i,r){var o=new t.Timer;return o.initialize(e,n,i,r),this._timers.push(o),o},n}(t.GlobalManager);t.TimerManager=e}(es||(es={})); \ No newline at end of file +window.es={};var __awaiter=this&&this.__awaiter||function(t,e,n,i){return new(n||(n=Promise))(function(r,o){function s(t){try{h(i.next(t))}catch(t){o(t)}}function a(t){try{h(i.throw(t))}catch(t){o(t)}}function h(t){t.done?r(t.value):new n(function(e){e(t.value)}).then(s,a)}h((i=i.apply(t,e||[])).next())})},__generator=this&&this.__generator||function(t,e){var n,i,r,o,s={label:0,sent:function(){if(1&r[0])throw r[1];return r[1]},trys:[],ops:[]};return o={next:a(0),throw:a(1),return:a(2)},"function"==typeof Symbol&&(o[Symbol.iterator]=function(){return this}),o;function a(o){return function(a){return function(o){if(n)throw new TypeError("Generator is already executing.");for(;s;)try{if(n=1,i&&(r=2&o[0]?i.return:o[0]?i.throw||((r=i.return)&&r.call(i),0):i.next)&&!(r=r.call(i,o[1])).done)return r;switch(i=0,r&&(o=[2&o[0],r.value]),o[0]){case 0:case 1:r=o;break;case 4:return s.label++,{value:o[1],done:!1};case 5:s.label++,i=o[1],o=[0];continue;case 7:o=s.ops.pop(),s.trys.pop();continue;default:if(!(r=(r=s.trys).length>0&&r[r.length-1])&&(6===o[0]||2===o[0])){s=0;continue}if(3===o[0]&&(!r||o[1]>r[0]&&o[1]=t.length&&(t=void 0),{value:t&&t[n++],done:!t}}}},__read=this&&this.__read||function(t,e){var n="function"==typeof Symbol&&t[Symbol.iterator];if(!n)return t;var i,r,o=n.call(t),s=[];try{for(;(void 0===e||e-- >0)&&!(i=o.next()).done;)s.push(i.value)}catch(t){r={error:t}}finally{try{i&&!i.done&&(n=o.return)&&n.call(o)}finally{if(r)throw r.error}}return s},__spread=this&&this.__spread||function(){for(var t=[],e=0;e=1)){var e=window.performance.memory;null!=e&&(this._totalMemory=Number((e.totalJSHeapSize/1048576).toFixed(2))),this._titleMemory&&this._titleMemory(this._totalMemory,this._frameCounter),this._frameCounter=0,this._frameCounterElapsedTime-=1}},e.prototype.onSceneChanged=function(){t.Time.sceneChanged()},e.prototype.initialize=function(){},e.prototype.update=function(e){return void 0===e&&(e=-1),__awaiter(this,void 0,void 0,function(){var n;return __generator(this,function(i){if(this.startDebugUpdate(),t.Time.update(e),null!=this._scene){for(n=this._globalManagers.length-1;n>=0;n--)this._globalManagers[n].enabled&&this._globalManagers[n].update();this._scene.update(),null!=this._nextScene&&(this._scene.end(),this._scene=this._nextScene,this._nextScene=null,this.onSceneChanged(),this._scene.begin())}return this.endDebugUpdate(),this.startDebugDraw(),[2]})})},e.pauseOnFocusLost=!0,e.debugRenderEndabled=!1,e}();t.Core=e}(es||(es={})),function(t){var e;!function(t){t[t.error=0]="error",t[t.warn=1]="warn",t[t.log=2]="log",t[t.info=3]="info",t[t.trace=4]="trace"}(e=t.LogType||(t.LogType={}));var n=function(){function t(){}return t.warnIf=function(t,n){for(var i=[],r=2;r=0;t--){this.transform.getChild(t).entity.destroy()}},n.prototype.detachFromScene=function(){this.scene.entities.remove(this),this.components.deregisterAllComponents();for(var t=0;t=0;t--)this._sceneComponents[t].enabled&&this._sceneComponents[t].update();null!=this.entityProcessors&&this.entityProcessors.update(),this.entities.update(),null!=this.entityProcessors&&this.entityProcessors.lateUpdate()},e.prototype.addSceneComponent=function(t){return t.scene=this,t.onEnabled(),this._sceneComponents.push(t),this._sceneComponents.sort(t.compare),t},e.prototype.getSceneComponent=function(t){for(var e=0;ee.x?-1:1,i=t.Vector2.normalize(t.Vector2.subtract(this.position,e));this.rotation=n*Math.acos(t.Vector2.dot(i,t.Vector2.unitY))},n.prototype.setLocalRotation=function(t){return this._localRotation=t,this._localDirty=this._positionDirty=this._localPositionDirty=this._localRotationDirty=this._localScaleDirty=!0,this.setDirty(e.rotationDirty),this},n.prototype.setLocalRotationDegrees=function(e){return this.setLocalRotation(t.MathHelper.toRadians(e))},n.prototype.setScale=function(e){return this._scale=e,this.parent?this.localScale=t.Vector2.divide(e,this.parent._scale):this.localScale=e,this},n.prototype.setLocalScale=function(t){return this._localScale=t,this._localDirty=this._positionDirty=this._localScaleDirty=!0,this.setDirty(e.scaleDirty),this},n.prototype.roundPosition=function(){this.position=t.Vector2Ext.round(this._position)},n.prototype.updateTransform=function(){this.hierarchyDirty!=e.clean&&(null!=this.parent&&this.parent.updateTransform(),this._localDirty&&(this._localPositionDirty&&(this._translationMatrix=t.Matrix2D.createTranslation(this._localPosition.x,this._localPosition.y),this._localPositionDirty=!1),this._localRotationDirty&&(this._rotationMatrix=t.Matrix2D.createRotation(this._localRotation),this._localRotationDirty=!1),this._localScaleDirty&&(this._scaleMatrix=t.Matrix2D.createScale(this._localScale.x,this._localScale.y),this._localScaleDirty=!1),this._localTransform=this._scaleMatrix.multiply(this._rotationMatrix),this._localTransform=this._localTransform.multiply(this._translationMatrix),null==this.parent&&(this._worldTransform=this._localTransform,this._rotation=this._localRotation,this._scale=this._localScale,this._worldInverseDirty=!0),this._localDirty=!1),null!=this.parent&&(this._worldTransform=this._localTransform.multiply(this.parent._worldTransform),this._rotation=this._localRotation+this.parent._rotation,this._scale=t.Vector2.multiply(this.parent._scale,this._localScale),this._worldInverseDirty=!0),this._worldToLocalDirty=!0,this._positionDirty=!0,this.hierarchyDirty=e.clean)},n.prototype.setDirty=function(e){if(0==(this.hierarchyDirty&e)){switch(this.hierarchyDirty|=e,e){case t.DirtyType.positionDirty:this.entity.onTransformChanged(transform.Component.position);break;case t.DirtyType.rotationDirty:this.entity.onTransformChanged(transform.Component.rotation);break;case t.DirtyType.scaleDirty:this.entity.onTransformChanged(transform.Component.scale)}for(var n=0;n1e-4?this._inverseMass=1/this._mass:this._inverseMass=0,this},n.prototype.setElasticity=function(e){return this._elasticity=t.MathHelper.clamp01(e),this},n.prototype.setFriction=function(e){return this._friction=t.MathHelper.clamp01(e),this},n.prototype.setGlue=function(e){return this._glue=t.MathHelper.clamp(e,0,10),this},n.prototype.addImpulse=function(e){this.isImmovable||(this.velocity=t.Vector2.add(this.velocity,t.Vector2.multiply(e,new t.Vector2(1e5)).multiply(new t.Vector2(this._inverseMass*t.Time.deltaTime))))},n.prototype.onAddedToEntity=function(){this._collider=this.entity.getComponent(t.Collider),t.Debug.warnIf(null==this._collider,"ArcadeRigidbody 没有 Collider。ArcadeRigidbody需要一个Collider!")},n.prototype.update=function(){var e,i;if(this.isImmovable||null==this._collider)this.velocity=t.Vector2.zero;else{this.shouldUseGravity&&(this.velocity=t.Vector2.add(this.velocity,t.Vector2.multiply(t.Physics.gravity,new t.Vector2(t.Time.deltaTime)))),this.entity.transform.position=t.Vector2.add(this.entity.transform.position,t.Vector2.multiply(this.velocity,new t.Vector2(t.Time.deltaTime)));var r=new t.CollisionResult,o=t.Physics.boxcastBroadphaseExcludingSelfNonRect(this._collider,this._collider.collidesWithLayers.value);try{for(var s=__values(o),a=s.next();!a.done;a=s.next()){var h=a.value;if(!h.entity.equals(this.entity)&&this._collider.collidesWithNonMotion(h,r)){var c=h.entity.getComponent(n);if(null!=c)this.processOverlap(c,r.minimumTranslationVector),this.processCollision(c,r.minimumTranslationVector);else{this.entity.transform.position=t.Vector2.subtract(this.entity.transform.position,r.minimumTranslationVector);var u=this.velocity.clone();this.calculateResponseVelocity(u,r.minimumTranslationVector,u),this.velocity=t.Vector2.add(this.velocity,u)}}}}catch(t){e={error:t}}finally{try{a&&!a.done&&(i=s.return)&&i.call(s)}finally{if(e)throw e.error}}}},n.prototype.processOverlap=function(e,n){this.isImmovable?e.entity.transform.position=t.Vector2.add(e.entity.transform.position,n):e.isImmovable?this.entity.transform.position=t.Vector2.subtract(this.entity.transform.position,n):(this.entity.transform.position=t.Vector2.subtract(this.entity.transform.position,t.Vector2.multiply(n,t.Vector2Ext.halfVector())),e.entity.transform.position=t.Vector2.add(e.entity.transform.position,t.Vector2.multiply(n,t.Vector2Ext.halfVector())))},n.prototype.processCollision=function(e,n){var i=t.Vector2.subtract(this.velocity,e.velocity);this.calculateResponseVelocity(i,n,i);var r=this._inverseMass+e._inverseMass,o=this._inverseMass/r,s=e._inverseMass/r;this.velocity=t.Vector2.add(this.velocity,new t.Vector2(i.x*o,i.y*o)),e.velocity=t.Vector2.subtract(e.velocity,new t.Vector2(i.x*s,i.y*s))},n.prototype.calculateResponseVelocity=function(e,n,i){void 0===i&&(i=new t.Vector2);var r=t.Vector2.multiply(n,new t.Vector2(-1)),o=t.Vector2.normalize(r),s=t.Vector2.dot(e,o),a=new t.Vector2(o.x*s,o.y*s),h=t.Vector2.subtract(e,a);s>0&&(a=t.Vector2.zero);var c=this._friction;h.lengthSquared()n;n++){var i=t[n];this.processDelta(i,this.acc);var r=this.getRemainingDelay(i);r<=0?this.processExpired(i):this.offerDelay(r)}this.acc=0}else this.stop()},n.prototype.checkProcessing=function(){return!!this.running&&(this.acc+=t.Time.deltaTime,this.acc>=this.delay)},n.prototype.offerDelay=function(t){this.running?this.delay=Math.min(this.delay,t):(this.running=!0,this.delay=t)},n.prototype.getInitialTimeDelay=function(){return this.delay},n.prototype.getRemainingTimeUntilProcessing=function(){return this.running?this.delay-this.acc:0},n.prototype.isRunning=function(){return this.running},n.prototype.stop=function(){this.running=!1,this.acc=0},n}(t.EntitySystem);t.DelayedIteratingSystem=e}(es||(es={})),function(t){var e=function(t){function e(e){return t.call(this,e)||this}return __extends(e,t),e.prototype.lateProcessEntity=function(t){},e.prototype.process=function(t){var e=this;t.forEach(function(t){return e.processEntity(t)})},e.prototype.lateProcess=function(t){var e=this;t.forEach(function(t){return e.lateProcessEntity(t)})},e}(t.EntitySystem);t.EntityProcessingSystem=e}(es||(es={})),function(t){var e=function(e){function n(t,n){var i=e.call(this,t)||this;return i.acc=0,i.interval=0,i.intervalDelta=0,i.interval=n,i}return __extends(n,e),n.prototype.checkProcessing=function(){return this.acc+=t.Time.deltaTime,this.acc>=this.interval&&(this.acc-=this.interval,this.intervalDelta=this.acc-this.intervalDelta,!0)},n.prototype.getIntervalDelta=function(){return this.interval+this.intervalDelta},n}(t.EntitySystem);t.IntervalSystem=e}(es||(es={})),function(t){var e=function(t){function e(e,n){return t.call(this,e,n)||this}return __extends(e,t),e.prototype.process=function(t){var e=this;t.forEach(function(t){return e.processEntity(t)})},e}(t.IntervalSystem);t.IntervalIteratingSystem=e}(es||(es={})),function(t){var e=function(t){function e(){return null!==t&&t.apply(this,arguments)||this}return __extends(e,t),e.prototype.onChanged=function(t){},e.prototype.process=function(t){this.begin(),this.end()},e}(t.EntitySystem);t.PassiveSystem=e}(es||(es={})),function(t){var e=function(t){function e(){return null!==t&&t.apply(this,arguments)||this}return __extends(e,t),e.prototype.onChanged=function(t){},e.prototype.process=function(t){this.begin(),this.processSystem(),this.end()},e}(t.EntitySystem);t.ProcessingSystem=e}(es||(es={})),function(t){var e=function(){function t(e){void 0===e&&(e=64);var n=e>>6;0!=(e&t.LONG_MASK)&&n++,this._bits=new Array(n),this._bits.fill(0)}return t.prototype.and=function(t){for(var e,n=Math.min(this._bits.length,t._bits.length),i=0;i=0;)this._bits[e]&=~t._bits[e]},t.prototype.cardinality=function(){for(var t=0,e=this._bits.length-1;e>=0;e--){var n=this._bits[e];if(0!=n)if(-1!=n){var i=((n=((n=(n>>1&0x5555555555555400)+(0x5555555555555400&n))>>2&0x3333333333333400)+(0x3333333333333400&n))>>32)+n>>>0;t+=((i=((i=(i>>4&252645135)+(252645135&i))>>8&16711935)+(16711935&i))>>16&65535)+(65535&i)}else t+=64}return t},t.prototype.clear=function(t){if(null!=t){var e=t>>6;this.ensure(e),this._bits[e]&=~(1<>6;return!(e>=this._bits.length)&&0!=(this._bits[e]&1<=0;)if(0!=(this._bits[e]&t._bits[e]))return!0;return!1},t.prototype.isEmpty=function(){for(var t=this._bits.length-1;t>=0;t--)if(this._bits[t])return!1;return!0},t.prototype.nextSetBit=function(t){for(var e=t>>6,n=1<>6;this.ensure(n),this._bits[n]|=1<=this._bits.length){var e=this._bits.length;this._bits.length=t+1,this._bits.fill(0,e,t+1)}},t.LONG_MASK=63,t}();t.BitSet=e}(es||(es={})),function(t){var e=function(){function t(t){this.words=[0],t&&("number"==typeof t?this.checkCapacity(t>>>6):this.words=t.words.slice(0))}return t.prototype.get=function(t){var e=t>>>6;return e>>6;this.checkCapacity(n),this.words[n]|=1<>>6]&1<>>6]|=1<>>6;this.checkCapacity(e),this.words[e]^=1<>>6;if(e>=this.words.length)return;this.words[e]&=~(1<=0;--e){var n=t[e];if(0!=n)return 64+(e<<6)-this.numberOfLeadingZeros(n)}return 0},t.prototype.isEmpty=function(){for(var t=this.words.slice(0),e=t.length,n=0;n>>6;if(e>=this.words.length)return-1;var n=this.words[e]>>>t;if(0!=n)return t+this.numberOfTrailingZeros(n);for(var i=1+e;i>>6;if(e>=this.words.length)return Math.min(t,this.words.length<<6);var n=~(this.words[e]>>>t);if(0!=n)return t+this.numberOfTrailingZeros(n);for(var i=1+e;in;n++)this.words[n]&=t.words[n];if(this.words.length>e){n=e;for(var i=this.words.length;i>n;n++)this.words[n]=0}},t.prototype.andNot=function(t){for(var e=Math.min(this.words.length,t.words.length),n=0;e>n;n++)this.words[n]&=~t.words[n]},t.prototype.or=function(t){for(var e=Math.min(this.words.length,t.words.length),n=0;e>n;n++)this.words[n]|=t.words[n];if(en;n++)this.words[n]=t.words[n]}},t.prototype.xor=function(t){for(var e=Math.min(this.words.length,t.words.length),n=0;e>n;n++)this.words[n]^=t.words[n];if(en;n++)this.words[n]=t.words[n]}},t.prototype.intersects=function(t){for(var e=this.words.slice(0),n=t.words,i=0,r=Math.min(e.length,n.length);r>i;i++)if(0!=(e[i]&n[i]))return!0;return!1},t.prototype.containsAll=function(t){for(var e=this.words.slice(0),n=t.words,i=n.length,r=e.length,o=r;oo;o++)if((e[o]&n[o])!=n[o])return!1;return!0},t.prototype.cardinality=function(){for(var t=0,e=0;e>>6,e=0,n=0;t>=n;n++)e=127*e+(this.words[n]^this.words[n]>>>32);return e},t.prototype.bitCount=function(t){return t=(t=(858993459&(t-=t>>>1&1431655765))+(t>>>2&858993459))+(t>>>4)&252645135,t+=t>>>8,63&(t+=t>>>16)},t.prototype.numberOfLeadingZeros=function(t){if(0==t)return 64;var e=1,n=t>>>32;return 0==n&&(e+=32,n=t),n>>>16==0&&(e+=16,n<<=16),n>>>24==0&&(e+=8,n<<=8),n>>>28==0&&(e+=4,n<<=4),n>>>30==0&&(e+=2,n<<=2),e-=n>>>31},t.prototype.numberOfTrailingZeros=function(t){var e=0,n=0;if(0==t)return 64;var i=63;return 0!=(n=t)?(i-=32,e=n):e=t>>>32,0!=(n=e<<16)&&(i-=16,e=n),0!=(n=e<<8)&&(i-=8,e=n),0!=(n=e<<4)&&(i-=4,e=n),0!=(n=e<<2)&&(i-=2,e=n),i-(e<<1>>>31)},t.prototype.unsafeClear=function(t){this.words[t>>>6]&=~(1<>>6)},t.prototype.checkCapacity=function(t){if(t>=this.words.length){for(var e=new Array(t+1),n=0;n0){for(var n=0;n0){n=0;for(var i=this._componentsToAdd.length;n0&&(this._entitiesToRemove.toArray().forEach(function(t){e.removeFromTagList(t),new linq.List(e._entities).remove(t),t.onRemovedFromScene(),t.scene=null,e.scene.entityProcessors.onEntityRemoved(t)}),this._entitiesToRemove.clear()),this._entitiesToAdded.getCount()>0&&(this._entitiesToAdded.toArray().forEach(function(t){e._entities.push(t),t.scene=e.scene,e.addToTagList(t),e.scene.entityProcessors.onEntityAdded(t)}),this._entitiesToAdded.toArray().forEach(function(t){t.onAddedToScene()}),this._entitiesToAdded.clear(),this._isEntityListUnsorted=!0),this._isEntityListUnsorted&&(this._entities.sort(t.Entity.entityComparer.compare),this._isEntityListUnsorted=!1),this._unsortedTags.size>0&&(this._unsortedTags.forEach(function(t){return e._entityDict.get(t).sort(function(t,e){return t.compareTo(e)})}),this._unsortedTags.clear())},e.prototype.findEntity=function(t){for(var e=0;e=t)return n}for(e=1|t;ethis.maxPrimeArrayLength&&this.maxPrimeArrayLength>t?this.maxPrimeArrayLength:this.getPrime(e)},t.getHashCode=function(t){var e,n=0;if(0==(e="object"==typeof t?JSON.stringify(t):t.toString()).length)return n;for(var i=0;i=0;e=this.allSet.nextSetBit(e+1))if(!t.get(e))return!1;return!(!this.exclusionSet.isEmpty()&&this.exclusionSet.intersects(t))&&!(!this.oneSet.isEmpty()&&!this.oneSet.intersects(t))},e.prototype.all=function(){for(var e=this,n=[],i=0;i=e)return t;var i=!1;"-"==t.substr(0,1)&&(i=!0,t=t.substr(1));for(var r=e-n,o=0;o1?this.reverse(t.substring(1))+t.substring(0,1):t},t.cutOff=function(t,e,n,i){void 0===i&&(i=!0),e=Math.floor(e),n=Math.floor(n);var r=t.length;e>r&&(e=r);var o,s=e,a=e+n;return i?o=t.substring(0,s)+t.substr(a,r):(a=(s=r-1-e-n)+n,o=t.substring(0,s+1)+t.substr(a+1,r)),o},t.strReplace=function(t,e){for(var n=0,i=e.length;n",">",'"',""","'","'","®","®","©","©","™","™"],t}();!function(t){var e=function(){function t(){}return t.update=function(t){-1==t&&(t=Date.now()),-1==this._lastTime&&(this._lastTime=t);var e=t-this._lastTime;this.totalTime+=e,this.deltaTime=e*this.timeScale,this.unscaledDeltaTime=e,this.timeSinceSceneLoad+=e,this.frameCount++,this._lastTime=t},t.sceneChanged=function(){this.timeSinceSceneLoad=0},t.checkEvery=function(t){return this.timeSinceSceneLoad/t>(this.timeSinceSceneLoad-this.deltaTime)/t},t.totalTime=0,t.unscaledDeltaTime=0,t.deltaTime=0,t.timeScale=1,t.frameCount=0,t.timeSinceSceneLoad=0,t._lastTime=-1,t}();t.Time=e}(es||(es={}));var TimeUtils=function(){function t(){}return t.monthId=function(t){void 0===t&&(t=null);var e=(t=t||new Date).getFullYear(),n=t.getMonth()+1;return parseInt(e+(n<10?"0":"")+n)},t.dateId=function(t){void 0===t&&(t=null);var e=(t=t||new Date).getMonth()+1,n=e<10?"0":"",i=t.getDate(),r=i<10?"0":"";return parseInt(t.getFullYear()+n+e+r+i)},t.weekId=function(t,e){void 0===t&&(t=null),void 0===e&&(e=!0),t=t||new Date;var n=new Date;n.setTime(t.getTime()),n.setDate(1),n.setMonth(0);var i=n.getFullYear(),r=n.getDay();0==r&&(r=7);var o=!1;r<=4?(o=r>1,n.setDate(n.getDate()-(r-1))):n.setDate(n.getDate()+7-r+1);var s=this.diffDay(t,n,!1);if(s<0)return n.setDate(1),n.setMonth(0),n.setDate(n.getDate()-1),this.weekId(n,!1);var a=s/7,h=Math.floor(a)+1;if(53==h){n.setTime(t.getTime()),n.setDate(n.getDate()-1);var c=n.getDay();if(0==c&&(c=7),e&&(!o||c<4))return n.setFullYear(n.getFullYear()+1),n.setDate(1),n.setMonth(0),this.weekId(n,!1)}return parseInt(i+"00"+(h>9?"":"0")+h)},t.diffDay=function(t,e,n){void 0===n&&(n=!1);var i=(t.getTime()-e.getTime())/864e5;return n?Math.ceil(i):Math.floor(i)},t.getFirstDayOfWeek=function(t){var e=(t=t||new Date).getDay()||7;return new Date(t.getFullYear(),t.getMonth(),t.getDate()+1-e,0,0,0,0)},t.getFirstOfDay=function(t){return(t=t||new Date).setHours(0,0,0,0),t},t.getNextFirstOfDay=function(t){return new Date(this.getFirstOfDay(t).getTime()+864e5)},t.formatDate=function(t){var e=t.getFullYear(),n=t.getMonth()+1;n=n<10?"0"+n:n;var i=t.getDate();return e+"-"+n+"-"+(i=i<10?"0"+i:i)},t.formatDateTime=function(t){var e=t.getFullYear(),n=t.getMonth()+1;n=n<10?"0"+n:n;var i=t.getDate();i=i<10?"0"+i:i;var r=t.getHours(),o=t.getMinutes();o=o<10?"0"+o:o;var s=t.getSeconds();return e+"-"+n+"-"+i+" "+r+":"+o+":"+(s=s<10?"0"+s:s)},t.parseDate=function(t){var e=Date.parse(t);return isNaN(e)?new Date:new Date(Date.parse(t.replace(/-/g,"/")))},t.secondToTime=function(t,e,n){void 0===t&&(t=0),void 0===e&&(e=":"),void 0===n&&(n=!0);var i=Math.floor(t/3600),r=Math.floor(t%3600/60),o=Math.floor(t%3600%60),s=i.toString(),a=r.toString(),h=o.toString();return i<10&&(s="0"+s),r<10&&(a="0"+a),o<10&&(h="0"+h),n?s+e+a+e+h:a+e+h},t.timeToMillisecond=function(t,e){void 0===e&&(e=":");for(var n=t.split(e),i=0,r=n.length,o=0;o=1?(e.value=1,n=this._points.length-4):(e.value=t.MathHelper.clamp01(e.value)*this._curveCount,n=~~e,e.value-=n,n*=3),n},e.prototype.setControlPoint=function(e,n){if(e%3==0){var i=t.Vector2.subtract(n,this._points[e]);e>0&&this._points[e-1].add(i),e+1n?n:t},e.pointOnCirlce=function(n,i,r){var o=e.toRadians(r);return new t.Vector2(Math.cos(o)*o+n.x,Math.sin(o)*o+n.y)},e.isEven=function(t){return t%2==0},e.clamp01=function(t){return t<0?0:t>1?1:t},e.angleBetweenVectors=function(t,e){return Math.atan2(e.y-t.y,e.x-t.x)},e.angleToVector=function(e,n){return new t.Vector2(Math.cos(e)*n,Math.sin(e)*n)},e.incrementWithWrap=function(t,e){return++t==e?0:t},e.roundToNearest=function(t,e){return Math.round(t/e)*e},e.withinEpsilon=function(t,e){return void 0===e&&(e=this.Epsilon),Math.abs(t)180&&(n-=360),n},e.repeat=function(t,e){return t-Math.floor(t/e)*e},e.Epsilon=1e-5,e.Rad2Deg=57.29578,e.Deg2Rad=.0174532924,e.PiOver2=Math.PI/2,e}();t.MathHelper=e}(es||(es={})),function(t){var e=function(){function t(){}return t.createOrthographicOffCenter=function(e,n,i,r,o,s,a){void 0===a&&(a=new t),a.m11=2/(n-e),a.m12=0,a.m13=0,a.m14=0,a.m21=0,a.m22=2/(r-i),a.m23=0,a.m24=0,a.m31=0,a.m32=0,a.m33=1/(o-s),a.m34=0,a.m41=(e+n)/(e-n),a.m42=(r+i)/(i-r),a.m43=o/(o-s),a.m44=1},t.multiply=function(e,n,i){void 0===i&&(i=new t);var r=e.m11*n.m11+e.m12*n.m21+e.m13*n.m31+e.m14*n.m41,o=e.m11*n.m12+e.m12*n.m22+e.m13*n.m32+e.m14*n.m42,s=e.m11*n.m13+e.m12*n.m23+e.m13*n.m33+e.m14*n.m43,a=e.m11*n.m14+e.m12*n.m24+e.m13*n.m34+e.m14*n.m44,h=e.m21*n.m11+e.m22*n.m21+e.m23*n.m31+e.m24*n.m41,c=e.m21*n.m12+e.m22*n.m22+e.m23*n.m32+e.m24*n.m42,u=e.m21*n.m13+e.m22*n.m23+e.m23*n.m33+e.m24*n.m43,l=e.m21*n.m14+e.m22*n.m24+e.m23*n.m34+e.m24*n.m44,p=e.m31*n.m11+e.m32*n.m21+e.m33*n.m31+e.m34*n.m41,f=e.m31*n.m12+e.m32*n.m22+e.m33*n.m32+e.m34*n.m42,d=e.m31*n.m13+e.m32*n.m23+e.m33*n.m33+e.m34*n.m43,m=e.m31*n.m14+e.m32*n.m24+e.m33*n.m34+e.m34*n.m44,y=e.m41*n.m11+e.m42*n.m21+e.m43*n.m31+e.m44*n.m41,g=e.m41*n.m12+e.m42*n.m22+e.m43*n.m32+e.m44*n.m42,v=e.m41*n.m13+e.m42*n.m23+e.m43*n.m33+e.m44*n.m43,_=e.m41*n.m14+e.m42*n.m24+e.m43*n.m34+e.m44*n.m44;i.m11=r,i.m12=o,i.m13=s,i.m14=a,i.m21=h,i.m22=c,i.m23=u,i.m24=l,i.m31=p,i.m32=f,i.m33=d,i.m34=m,i.m41=y,i.m42=g,i.m43=v,i.m44=_},t}();t.Matrix=e}(es||(es={})),function(t){var e=function(){function e(t,e,n,i,r,o){this.m11=0,this.m12=0,this.m21=0,this.m22=0,this.m31=0,this.m32=0,this.m11=t,this.m12=e,this.m21=n,this.m22=i,this.m31=r,this.m32=o}return Object.defineProperty(e,"identity",{get:function(){return new e(1,0,0,1,0,0)},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"translation",{get:function(){return new t.Vector2(this.m31,this.m32)},set:function(t){this.m31=t.x,this.m32=t.y},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"rotation",{get:function(){return Math.atan2(this.m21,this.m11)},set:function(t){var e=Math.cos(t),n=Math.sin(t);this.m11=e,this.m12=n,this.m21=-n,this.m22=e},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"rotationDegrees",{get:function(){return t.MathHelper.toDegrees(this.rotation)},set:function(e){this.rotation=t.MathHelper.toRadians(e)},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"scale",{get:function(){return new t.Vector2(this.m11,this.m22)},set:function(t){this.m11=t.x,this.m22=t.y},enumerable:!0,configurable:!0}),e.createRotation=function(t){var e=this.identity,n=Math.cos(t),i=Math.sin(t);return e.m11=n,e.m12=i,e.m21=-i,e.m22=n,e},e.createScale=function(t,e){var n=this.identity;return n.m11=t,n.m12=0,n.m21=0,n.m22=e,n.m31=0,n.m32=0,n},e.createTranslation=function(t,e){var n=this.identity;return n.m11=1,n.m12=0,n.m21=0,n.m22=1,n.m31=t,n.m32=e,n},e.invert=function(t){var e=1/t.determinant(),n=this.identity;return n.m11=t.m22*e,n.m12=-t.m12*e,n.m21=-t.m21*e,n.m22=t.m11*e,n.m31=(t.m32*t.m21-t.m31*t.m22)*e,n.m32=-(t.m32*t.m11-t.m31*t.m12)*e,n},e.prototype.add=function(t){return this.m11+=t.m11,this.m12+=t.m12,this.m21+=t.m21,this.m22+=t.m22,this.m31+=t.m31,this.m32+=t.m32,this},e.prototype.substract=function(t){return this.m11-=t.m11,this.m12-=t.m12,this.m21-=t.m21,this.m22-=t.m22,this.m31-=t.m31,this.m32-=t.m32,this},e.prototype.divide=function(t){return this.m11/=t.m11,this.m12/=t.m12,this.m21/=t.m21,this.m22/=t.m22,this.m31/=t.m31,this.m32/=t.m32,this},e.prototype.multiply=function(t){var e=this.m11*t.m11+this.m12*t.m21,n=this.m11*t.m12+this.m12*t.m22,i=this.m21*t.m11+this.m22*t.m21,r=this.m21*t.m12+this.m22*t.m22,o=this.m31*t.m11+this.m32*t.m21+t.m31,s=this.m31*t.m12+this.m32*t.m22+t.m32;return this.m11=e,this.m12=n,this.m21=i,this.m22=r,this.m31=o,this.m32=s,this},e.prototype.determinant=function(){return this.m11*this.m22-this.m12*this.m21},e.lerp=function(t,e,n){return t.m11=t.m11+(e.m11-t.m11)*n,t.m12=t.m12+(e.m12-t.m12)*n,t.m21=t.m21+(e.m21-t.m21)*n,t.m22=t.m22+(e.m22-t.m22)*n,t.m31=t.m31+(e.m31-t.m31)*n,t.m32=t.m32+(e.m32-t.m32)*n,t},e.transpose=function(t){var e=this.identity;return e.m11=t.m11,e.m12=t.m21,e.m21=t.m12,e.m22=t.m22,e.m31=0,e.m32=0,e},e.prototype.mutiplyTranslation=function(n,i){var r=e.createTranslation(n,i);return t.MatrixHelper.mutiply(this,r)},e.prototype.equals=function(t){return this==t},e.toMatrix=function(e){var n=new t.Matrix;return n.m11=e.m11,n.m12=e.m12,n.m13=0,n.m14=0,n.m21=e.m21,n.m22=e.m22,n.m23=0,n.m24=0,n.m31=0,n.m32=0,n.m33=1,n.m34=0,n.m41=e.m31,n.m42=e.m32,n.m43=0,n.m44=1,n},e.prototype.toString=function(){return"{m11:"+this.m11+" m12:"+this.m12+" m21:"+this.m21+" m22:"+this.m22+" m31:"+this.m31+" m32:"+this.m32+"}"},e}();t.Matrix2D=e}(es||(es={})),function(t){var e=function(){function e(){}return e.add=function(e,n){var i=t.Matrix2D.identity;return i.m11=e.m11+n.m11,i.m12=e.m12+n.m12,i.m21=e.m21+n.m21,i.m22=e.m22+n.m22,i.m31=e.m31+n.m31,i.m32=e.m32+n.m32,i},e.divide=function(e,n){var i=t.Matrix2D.identity;return i.m11=e.m11/n.m11,i.m12=e.m12/n.m12,i.m21=e.m21/n.m21,i.m22=e.m22/n.m22,i.m31=e.m31/n.m31,i.m32=e.m32/n.m32,i},e.mutiply=function(e,n){var i=t.Matrix2D.identity;if(n instanceof t.Matrix2D){var r=e.m11*n.m11+e.m12*n.m21,o=n.m11*n.m12+e.m12*n.m22,s=e.m21*n.m11+e.m22*n.m21,a=e.m21*n.m12+e.m22*n.m22,h=e.m31*n.m11+e.m32*n.m21+n.m31,c=e.m31*n.m12+e.m32*n.m22+n.m32;i.m11=r,i.m12=o,i.m21=s,i.m22=a,i.m31=h,i.m32=c}else"number"==typeof n&&(i.m11=e.m11*n,i.m12=e.m12*n,i.m21=e.m21*n,i.m22=e.m22*n,i.m31=e.m31*n,i.m32=e.m32*n);return i},e.subtract=function(e,n){var i=t.Matrix2D.identity;return i.m11=e.m11-n.m11,i.m12=e.m12-n.m12,i.m21=e.m21-n.m21,i.m22=e.m22-n.m22,i.m31=e.m31-n.m31,i.m32=e.m32-n.m32,i},e}();t.MatrixHelper=e}(es||(es={})),function(t){var e=function(){function e(t,e,n,i){void 0===t&&(t=0),void 0===e&&(e=0),void 0===n&&(n=0),void 0===i&&(i=0),this.x=0,this.y=0,this.width=0,this.height=0,this.x=t,this.y=e,this.width=n,this.height=i}return Object.defineProperty(e,"empty",{get:function(){return new e},enumerable:!0,configurable:!0}),Object.defineProperty(e,"maxRect",{get:function(){return new e(Number.MIN_VALUE/2,Number.MIN_VALUE/2,Number.MAX_VALUE,Number.MAX_VALUE)},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"left",{get:function(){return this.x},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"right",{get:function(){return this.x+this.width},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"top",{get:function(){return this.y},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"bottom",{get:function(){return this.y+this.height},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"max",{get:function(){return new t.Vector2(this.right,this.bottom)},enumerable:!0,configurable:!0}),e.prototype.isEmpty=function(){return 0==this.width&&0==this.height&&0==this.x&&0==this.y},Object.defineProperty(e.prototype,"location",{get:function(){return new t.Vector2(this.x,this.y)},set:function(t){this.x=t.x,this.y=t.y},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"size",{get:function(){return new t.Vector2(this.width,this.height)},set:function(t){this.width=t.x,this.height=t.y},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"center",{get:function(){return new t.Vector2(this.x+this.width/2,this.y+this.height/2)},enumerable:!0,configurable:!0}),e.fromMinMax=function(t,n,i,r){return new e(t,n,i-t,r-n)},e.rectEncompassingPoints=function(t){for(var e=Number.POSITIVE_INFINITY,n=Number.POSITIVE_INFINITY,i=Number.NEGATIVE_INFINITY,r=Number.NEGATIVE_INFINITY,o=0;oi&&(i=s.x),s.yr&&(r=s.y)}return this.fromMinMax(e,n,i,r)},e.prototype.getSide=function(e){switch(e){case t.Edge.top:return this.top;case t.Edge.bottom:return this.bottom;case t.Edge.left:return this.left;case t.Edge.right:return this.right;default:throw new Error("Argument Out Of Range")}},e.prototype.contains=function(t,e){return this.x<=t&&tthis.x+this.width)return!1}else{var i=1/t.direction.x,r=(this.x-t.start.x)*i,o=(this.x+this.width-t.start.x)*i;if(r>o){var s=r;r=o,o=s}if(e.value=Math.max(r,e.value),n=Math.min(o,n),e.value>n)return!1}if(Math.abs(t.direction.y)<1e-6){if(t.start.ythis.y+this.height)return!1}else{var a=1/t.direction.y,h=(this.y-t.start.y)*a,c=(this.y+this.height-t.start.y)*a;if(h>c){var u=h;h=c,c=u}if(e.value=Math.max(h,e.value),n=Math.max(c,n),e.value>n)return!1}return!0},e.prototype.containsRect=function(t){return this.x<=t.x&&t.x0?this.x:this.x+t,i.y=n>0?this.y:this.y+n,i.width=t>0?t+this.width:this.width-t,i.height=n>0?n+this.height:this.height-n,i},e.prototype.collisionCheck=function(t,e,n){e.value=n.value=0;var i=t.x-(this.x+this.width),r=t.x+t.width-this.x,o=t.y-(this.y+this.height),s=t.y+t.height-this.y;return!(i>0||r<0||o>0||s<0)&&(e.value=Math.abs(i)=l||Math.abs(u)>=p)return t.Vector2.zero;var f=c>0?l-c:-l-c,d=u>0?p-u:-p-u;return new t.Vector2(f,d)},e.prototype.equals=function(t){return this===t},e.prototype.getHashCode=function(){return this.x^this.y^this.width^this.height},e.prototype.clone=function(){return new e(this.x,this.y,this.width,this.height)},e}();t.Rectangle=e}(es||(es={})),function(t){var e=function(){function t(){this.remainder=0}return t.prototype.update=function(t){this.remainder+=t;var e=Math.floor(Math.trunc(this.remainder));return this.remainder-=e,t=e},t.prototype.reset=function(){this.remainder=0},t}();t.SubpixelFloat=e}(es||(es={})),function(t){var e=function(){function e(){this._x=new t.SubpixelFloat,this._y=new t.SubpixelFloat}return e.prototype.update=function(t){t.x=this._x.update(t.x),t.y=this._y.update(t.y)},e.prototype.reset=function(){this._x.reset(),this._y.reset()},e}();t.SubpixelVector2=e}(es||(es={})),function(t){var e=function(){function e(e){this._activeTriggerIntersections=new t.HashSet,this._previousTriggerIntersections=new t.HashSet,this._tempTriggerList=[],this._entity=e}return e.prototype.update=function(){for(var e=this._entity.getComponents(t.Collider),n=0;n1)return!1;var u=(h.x*o.y-h.y*o.x)/a;return!(u<0||u>1)},n.lineToLineIntersection=function(e,n,i,r,o){void 0===o&&(o=new t.Vector2),o.x=0,o.y=0;var s=t.Vector2.subtract(n,e),a=t.Vector2.subtract(r,i),h=s.x*a.y-s.y*a.x;if(0==h)return!1;var c=t.Vector2.subtract(i,e),u=(c.x*a.y-c.y*a.x)/h;if(u<0||u>1)return!1;var l=(c.x*s.y-c.y*s.x)/h;if(l<0||l>1)return!1;var p=t.Vector2.add(e,new t.Vector2(u*s.x,u*s.y));return o.x=p.x,o.y=p.y,!0},n.closestPointOnLine=function(e,n,i){var r=t.Vector2.subtract(n,e),o=t.Vector2.subtract(i,e),s=t.Vector2.dot(o,r)/t.Vector2.dot(r,r);return s=t.MathHelper.clamp(s,0,1),t.Vector2.add(e,new t.Vector2(r.x*s,r.y*s))},n.circleToCircle=function(e,n,i,r){return t.Vector2.distanceSquared(e,i)<(n+r)*(n+r)},n.circleToLine=function(e,n,i,r){return t.Vector2.distanceSquared(e,this.closestPointOnLine(i,r,e))=t&&r.y>=e&&r.x=t+i&&(s|=e.right),o.y=n+r&&(s|=e.bottom),s},n}();t.Collisions=n}(es||(es={})),function(t){var e=function(){function e(e,n,i,r,o){this.fraction=0,this.distance=0,this.point=t.Vector2.zero,this.normal=t.Vector2.zero,this.collider=e,this.fraction=n,this.distance=i,this.point=r,this.centroid=t.Vector2.zero}return e.prototype.setValues=function(t,e,n,i){this.collider=t,this.fraction=e,this.distance=n,this.point=i},e.prototype.setValuesNonCollider=function(t,e,n,i){this.fraction=t,this.distance=e,this.point=n,this.normal=i},e.prototype.reset=function(){this.collider=null,this.fraction=this.distance=0},e.prototype.toString=function(){return"[RaycastHit] fraction: "+this.fraction+", distance: "+this.distance+", normal: "+this.normal+", centroid: "+this.centroid+", point: "+this.point},e}();t.RaycastHit=e}(es||(es={})),function(t){var e=function(){function e(){}return e.reset=function(){this._spatialHash=new t.SpatialHash(this.spatialHashCellSize),this._hitArray[0].reset(),this._colliderArray[0]=null},e.clear=function(){this._spatialHash.clear()},e.overlapCircle=function(t,n,i){return void 0===i&&(i=e.allLayers),this._colliderArray[0]=null,this._spatialHash.overlapCircle(t,n,this._colliderArray,i),this._colliderArray[0]},e.overlapCircleAll=function(t,e,n,i){if(void 0===i&&(i=-1),0!=n.length)return this._spatialHash.overlapCircle(t,e,n,i);console.warn("传入了一个空的结果数组。不会返回任何结果")},e.boxcastBroadphase=function(t,e){return void 0===e&&(e=this.allLayers),this._spatialHash.aabbBroadphase(t,null,e)},e.boxcastBroadphaseExcludingSelf=function(t,e,n){return void 0===n&&(n=this.allLayers),this._spatialHash.aabbBroadphase(e,t,n)},e.boxcastBroadphaseExcludingSelfNonRect=function(t,e){void 0===e&&(e=this.allLayers);var n=t.bounds.clone();return this._spatialHash.aabbBroadphase(n,t,e)},e.boxcastBroadphaseExcludingSelfDelta=function(t,n,i,r){void 0===r&&(r=e.allLayers);var o=t.bounds.clone().getSweptBroadphaseBounds(n,i);return this._spatialHash.aabbBroadphase(o,t,r)},e.addCollider=function(t){e._spatialHash.register(t)},e.removeCollider=function(t){e._spatialHash.remove(t)},e.updateCollider=function(t){this._spatialHash.remove(t),this._spatialHash.register(t)},e.linecast=function(t,n,i){return void 0===i&&(i=e.allLayers),this._hitArray[0].reset(),this.linecastAll(t,n,this._hitArray,i),this._hitArray[0]},e.linecastAll=function(t,n,i,r){return void 0===r&&(r=e.allLayers),0==i.length?(console.warn("传入了一个空的hits数组。没有点击会被返回"),0):this._spatialHash.linecast(t,n,i,r)},e.overlapRectangle=function(t,n){return void 0===n&&(n=e.allLayers),this._colliderArray[0]=null,this._spatialHash.overlapRectangle(t,this._colliderArray,n),this._colliderArray[0]},e.overlapRectangleAll=function(t,n,i){return void 0===i&&(i=e.allLayers),0==n.length?(console.warn("传入了一个空的结果数组。不会返回任何结果"),0):this._spatialHash.overlapRectangle(t,n,i)},e.gravity=new t.Vector2(0,300),e.spatialHashCellSize=100,e.allLayers=-1,e.raycastsHitTriggers=!1,e.raycastsStartInColliders=!1,e._hitArray=[new t.RaycastHit],e._colliderArray=[null],e}();t.Physics=e}(es||(es={})),function(t){var e=function(){return function(e,n){this.start=e,this.end=n,this.direction=t.Vector2.subtract(this.end,this.start)}}();t.Ray2D=e}(es||(es={})),function(t){var e=function(){function e(e){void 0===e&&(e=100),this.gridBounds=new t.Rectangle,this._overlapTestBox=new t.Box(0,0),this._overlapTestCircle=new t.Circle(0),this._cellDict=new n,this._tempHashSet=new Set,this._cellSize=e,this._inverseCellSize=1/this._cellSize,this._raycastParser=new i}return e.prototype.register=function(e){var n=e.bounds.clone();e.registeredPhysicsBounds=n;var i=this.cellCoords(n.x,n.y),r=this.cellCoords(n.right,n.bottom);this.gridBounds.contains(i.x,i.y)||(this.gridBounds=t.RectangleExt.union(this.gridBounds,i)),this.gridBounds.contains(r.x,r.y)||(this.gridBounds=t.RectangleExt.union(this.gridBounds,r));for(var o=i.x;o<=r.x;o++)for(var s=i.y;s<=r.y;s++){this.cellAtPosition(o,s,!0).push(e)}},e.prototype.remove=function(e){for(var n=e.registeredPhysicsBounds.clone(),i=this.cellCoords(n.x,n.y),r=this.cellCoords(n.right,n.bottom),o=i.x;o<=r.x;o++)for(var s=i.y;s<=r.y;s++){var a=this.cellAtPosition(o,s);t.Insist.isNotNull(a,"从不存在碰撞器的单元格中移除碰撞器: ["+e+"]"),null!=a&&new linq.List(a).remove(e)}},e.prototype.removeWithBruteForce=function(t){this._cellDict.remove(t)},e.prototype.clear=function(){this._cellDict.clear()},e.prototype.aabbBroadphase=function(e,n,i){this._tempHashSet.clear();for(var r=this.cellCoords(e.x,e.y),o=this.cellCoords(e.right,e.bottom),s=r.x;s<=o.x;s++)for(var a=r.y;a<=o.y;a++){var h=this.cellAtPosition(s,a);if(null!=h)for(var c=0;c>>0},t.prototype.clear=function(){this._store.clear()},t}();t.NumberDictionary=n;var i=function(){function e(){this._tempHit=new t.RaycastHit,this._checkedColliders=[],this._cellHits=[]}return e.prototype.start=function(t,e,n){this._ray=t,this._hits=e,this._layerMask=n,this.hitCounter=0},e.prototype.checkRayIntersection=function(n,i,r){for(var o=new t.Ref(0),s=0;s=this.points.length?this.points[0]:this.points[i+1];var o=t.Vector2Ext.perpendicular(r,e);t.Vector2Ext.normalize(o),this._edgeNormals[i]=o}},n.buildSymmetricalPolygon=function(e,n){for(var i=new Array(e),r=0;rr&&(r=s,i=o)}return e[i]},n.getClosestPointOnPolygonToPoint=function(e,n,i,r){i.value=Number.MAX_VALUE,r.x=0,r.y=0;for(var o=t.Vector2.zero,s=0,a=0;at.y!=this.points[i].y>t.y&&t.x<(this.points[i].x-this.points[n].x)*(t.y-this.points[n].y)/(this.points[i].y-this.points[n].y)+this.points[n].x&&(e=!e);return e},n.prototype.pointCollidesWithShape=function(e,n){return t.ShapeCollisions.pointToPoly(e,this,n)},n}(t.Shape);t.Polygon=e}(es||(es={})),function(t){var e=function(e){function n(t,i){var r=e.call(this,n.buildBox(t,i),!0)||this;return r.width=t,r.height=i,r}return __extends(n,e),n.buildBox=function(e,n){var i=e/2,r=n/2,o=new Array(4);return o[0]=new t.Vector2(-i,-r),o[1]=new t.Vector2(i,-r),o[2]=new t.Vector2(i,r),o[3]=new t.Vector2(-i,r),o},n.prototype.updateBox=function(e,n){this.width=e,this.height=n;var i=e/2,r=n/2;this.points[0]=new t.Vector2(-i,-r),this.points[1]=new t.Vector2(i,-r),this.points[2]=new t.Vector2(i,r),this.points[3]=new t.Vector2(-i,r);for(var o=0;o1)return!1;var a,h=t.Vector2.add(s.start,t.Vector2.multiply(s.direction,new t.Vector2(r.value))),c=0;h.xn.bounds.right&&(c|=1),h.yn.bounds.bottom&&(c|=2);var u=a+c;return 3==u&&console.log("m == 3. corner "+t.Time.frameCount),!0},e.corner=function(e,n){var i=new t.Vector2;return i.x=0==(1&n)?e.right:e.left,i.y=0==(1&n)?e.bottom:e.top,i},e.testCircleBox=function(e,n,i){i=n.bounds.getClosestPointOnRectangleToPoint(e.position);var r=t.Vector2.subtract(i,e.position);return t.Vector2.dot(r,r)<=e.radius*e.radius},e}();t.RealtimeCollisions=e}(es||(es={})),function(t){var e=function(){function e(){}return e.polygonToPolygon=function(e,n,i){for(var r,o=!0,s=e.edgeNormals.slice(),a=n.edgeNormals.slice(),h=Number.POSITIVE_INFINITY,c=new t.Vector2,u=t.Vector2.subtract(e.position,n.position),l=0;l0&&(o=!1),!o)return!1;(y=Math.abs(y))r.value&&(r.value=o)},e.circleToPolygon=function(e,n,i){void 0===i&&(i=new t.CollisionResult);var r,o=t.Vector2.subtract(e.position,n.position),s=new t.Ref(0),a=t.Polygon.getClosestPointOnPolygonToPoint(n.points,o,s,i.normal),h=n.containsPoint(e.position);if(s.value>e.radius*e.radius&&!h)return!1;if(h)r=t.Vector2.multiply(i.normal,new t.Vector2(Math.sqrt(s.value)-e.radius));else if(0==s.value)r=new t.Vector2(i.normal.x*e.radius,i.normal.y*e.radius);else{var c=Math.sqrt(s.value);r=t.Vector2.subtract(new t.Vector2(-1),t.Vector2.subtract(o,a)).multiply(new t.Vector2((e.radius-c)/c))}return i.minimumTranslationVector=r,i.point=t.Vector2.add(a,n.position),!0},e.circleToBox=function(e,n,i){void 0===i&&(i=new t.CollisionResult);var r=n.bounds.getClosestPointOnRectangleBorderToPoint(e.position,i.normal);if(n.containsPoint(e.position)){i.point=r.clone();var o=t.Vector2.add(r,t.Vector2.multiply(i.normal,new t.Vector2(e.radius)));return i.minimumTranslationVector=t.Vector2.subtract(e.position,o),!0}var s=t.Vector2.distanceSquared(r,e.position);if(0==s)i.minimumTranslationVector=t.Vector2.multiply(i.normal,new t.Vector2(e.radius));else if(s<=e.radius*e.radius){i.normal=t.Vector2.subtract(e.position,r);var a=i.normal.length()-e.radius;return i.point=r,t.Vector2Ext.normalize(i.normal),i.minimumTranslationVector=t.Vector2.multiply(new t.Vector2(a),i.normal),!0}return!1},e.pointToCircle=function(e,n,i){var r=t.Vector2.distanceSquared(e,n.position),o=1+n.radius;if(r1)return!1;var l=(c.x*s.y-c.y*s.x)/h;return!(l<0||l>1)&&(t.Vector2.add(e,t.Vector2.multiply(new t.Vector2(u),s)),!0)},e.lineToCircle=function(e,n,i,r){var o=t.Vector2.distance(e,n),s=t.Vector2.divide(t.Vector2.subtract(n,e),new t.Vector2(o)),a=t.Vector2.subtract(e,i.position),h=t.Vector2.dot(a,s),c=t.Vector2.dot(a,a)-i.radius*i.radius;if(c>0&&h>0)return!1;var u=h*h-c;return!(u<0)&&(r.fraction=-h-Math.sqrt(u),r.fraction<0&&(r.fraction=0),r.point=t.Vector2.add(e,t.Vector2.multiply(new t.Vector2(r.fraction),s)),r.distance=t.Vector2.distance(e,r.point),r.normal=t.Vector2.normalize(t.Vector2.subtract(r.point,i.position)),r.fraction=r.distance/o,!0)},e.boxToBoxCast=function(e,n,i,r){var o=this.minkowskiDifference(e,n);if(o.contains(0,0)){var s=o.getClosestPointOnBoundsToOrigin();return!s.equals(t.Vector2.zero)&&(r.normal=new t.Vector2(-s.x),r.normal.normalize(),r.distance=0,r.fraction=0,!0)}var a=new t.Ray2D(t.Vector2.zero,new t.Vector2(-i.x)),h=new t.Ref(0);return!!(o.rayIntersects(a,h)&&h.value<=1)&&(r.fraction=h.value,r.distance=i.length()*h.value,r.normal=new t.Vector2(-i.x,-i.y),r.normal.normalize(),r.centroid=t.Vector2.add(e.bounds.center,t.Vector2.multiply(i,new t.Vector2(h.value))),!0)},e}();t.ShapeCollisions=e}(es||(es={})),function(t){var e=function(){return function(t,e){this.func=t,this.context=e}}();t.FuncPack=e;var n=function(){function n(){this._messageTable=new Map}return n.prototype.addObserver=function(n,i,r){var o=this._messageTable.get(n);o||(o=[],this._messageTable.set(n,o)),t.Insist.isFalse(-1!=o.findIndex(function(t){return t.func==i}),"您试图添加相同的观察者两次"),o.push(new e(i,r))},n.prototype.removeObserver=function(t,e){var n=this._messageTable.get(t),i=n.findIndex(function(t){return t.func==e});-1!=i&&new linq.List(n).removeAt(i)},n.prototype.emit=function(t){for(var e,n=[],i=1;i=0;o--)(e=r[o].func).call.apply(e,__spread([r[o].context],n))},n}();t.Emitter=n}(es||(es={})),function(t){!function(t){t[t.top=0]="top",t[t.bottom=1]="bottom",t[t.left=2]="left",t[t.right=3]="right"}(t.Edge||(t.Edge={}))}(es||(es={})),function(t){var e=function(){function t(){}return t.repeat=function(t,e){for(var n=[];e--;)n.push(t);return n},t}();t.Enumerable=e}(es||(es={})),function(t){var e=function(){function t(){}return t.default=function(){return new t},t.prototype.equals=function(t,e){return"function"==typeof t.equals?t.equals(e):t===e},t.prototype.getHashCode=function(t){var e=this;if("number"==typeof t)return this._getHashCodeForNumber(t);if("string"==typeof t)return this._getHashCodeForString(t);var n=385229220;return this.forOwn(t,function(t){"number"==typeof t?n+=e._getHashCodeForNumber(t):"string"==typeof t?n+=e._getHashCodeForString(t):"object"==typeof t&&e.forOwn(t,function(){n+=e.getHashCode(t)})}),n},t.prototype._getHashCodeForNumber=function(t){return t},t.prototype._getHashCodeForString=function(t){for(var e=385229220,n=0;n>7,n+=n<<3,n^=n>>17,n+=n<<5},t}();t.Hash=e}(es||(es={})),function(t){var e=function(){return function(t){this.value=t}}();t.Ref=e}(es||(es={})),function(t){var e=function(){function e(){}return Object.defineProperty(e,"size",{get:function(){return new t.Vector2(this.width,this.height)},enumerable:!0,configurable:!0}),Object.defineProperty(e,"center",{get:function(){return new t.Vector2(this.width/2,this.height/2)},enumerable:!0,configurable:!0}),e}();t.Screen=e}(es||(es={})),function(t){var e=function(){function t(){}return t.prototype.update=function(t){this.remainder+=t;var e=Math.trunc(this.remainder);return this.remainder-=e,e},t.prototype.reset=function(){this.remainder=0},t}();t.SubpixelNumber=e}(es||(es={})),function(t){var e=function(){function e(){this.triangleIndices=[],this._triPrev=new Array(12),this._triNext=new Array(12)}return e.testPointTriangle=function(e,n,i,r){return!(t.Vector2Ext.cross(t.Vector2.subtract(e,n),t.Vector2.subtract(i,n))<0)&&(!(t.Vector2Ext.cross(t.Vector2.subtract(e,i),t.Vector2.subtract(r,i))<0)&&!(t.Vector2Ext.cross(t.Vector2.subtract(e,r),t.Vector2.subtract(n,r))<0))},e.prototype.triangulate=function(n,i){void 0===i&&(i=!0);var r=n.length;this.initialize(r);for(var o=0,s=0;r>3&&o<500;){o++;var a=!0,h=n[this._triPrev[s]],c=n[s],u=n[this._triNext[s]];if(t.Vector2Ext.isTriangleCCW(h,c,u)){var l=this._triNext[this._triNext[s]];do{if(e.testPointTriangle(n[l],h,c,u)){a=!1;break}l=this._triNext[l]}while(l!=this._triPrev[s])}else a=!1;a?(this.triangleIndices.push(this._triPrev[s]),this.triangleIndices.push(s),this.triangleIndices.push(this._triNext[s]),this._triNext[this._triPrev[s]]=this._triNext[s],this._triPrev[this._triNext[s]]=this._triPrev[s],r--,s=this._triPrev[s]):s=this._triNext[s]}this.triangleIndices.push(this._triPrev[s]),this.triangleIndices.push(s),this.triangleIndices.push(this._triNext[s]),i||this.triangleIndices.reverse()},e.prototype.initialize=function(t){this.triangleIndices.length=0,this._triNext.length=e.logSnapDuration&&(l.logs[r].snapMin=l.logs[r].min,l.logs[r].snapMax=l.logs[r].max,l.logs[r].snapAvg=l.logs[r].avg,l.logs[r].samples=0)):(l.logs[r].min=c,l.logs[r].max=c,l.logs[r].avg=c,l.logs[r].initialized=!0)}s.markCount=o.nestCount,s.nestCount=o.nestCount}this.stopwatch.reset(),this.stopwatch.start()}}},e.prototype.beginMark=function(i,r,o){if(void 0===o&&(o=0),t.Core.Instance.debug){if(o<0||o>=e.maxBars)throw new Error("barIndex 越位");var s=this.curLog.bars[o];if(s.markCount>=e.maxSamples)throw new Error("超出样本数.\n 要么设置更大的数字为TimeRuler.MaxSmpale,要么降低样本数");if(s.nestCount>=e.maxNestCall)throw new Error("nestCount超出.\n 要么将大的设置为TimeRuler.MaxNestCall,要么将小的设置为NestCall");var a=this.markerNameToIdMap.get(i);null==a&&(a=this.markers.length,this.markerNameToIdMap.set(i,a),this.markers.push(new n(i))),s.markerNests[s.nestCount++]=s.markCount,s.markers[s.markCount].markerId=a,s.markers[s.markCount].color=r,s.markers[s.markCount].beginTime=this.stopwatch.getTime(),s.markers[s.markCount].endTime=-1,s.markCount++}},e.prototype.endMark=function(n,i){if(void 0===i&&(i=0),t.Core.Instance.debug){if(i<0||i>=e.maxBars)throw new Error("barIndex 越位");var r=this.curLog.bars[i];if(r.nestCount<=0)throw new Error("在调用结束标记方法之前调用beginMark方法");var o=this.markerNameToIdMap.get(n);if(null==o)throw new Error("标记"+n+"没有注册。请确认您指定的名称与BeginMark方法使用的名称相同");var s=r.markerNests[--r.nestCount];if(r.markers[s].markerId!=o)throw new Error("beginMark/endMark方法的调用顺序不正确. beginMark(A), beginMark(B), endMark(B), endMark(A).但你不能像这样叫它 beginMark(A), beginMark(B), endMark(A), endMark(B)");r.markers[s].endTime=this.stopwatch.getTime()}},e.prototype.getAverageTime=function(t,n){if(t<0||t>=e.maxBars)throw new Error("barIndex 越位");var i=0,r=this.markerNameToIdMap.get(n);return null!=r&&(i=this.markers[r].logs[t].avg),i},e.prototype.resetLog=function(){var e,n;if(t.Core.Instance.debug)try{for(var i=__values(this.markers),r=i.next();!r.done;r=i.next())for(var o=r.value,s=0;sthis._buckets.length){this._buckets=new Array(t.HashHelpers.expandPrime(this._collisions)),this._collisions=0;for(var l=0;l=e?t%e:t},e}();t.FasterDictionary=e;var n=function(){return function(t,e,n){void 0===n&&(n=-1),this.key=t,this.hashcode=e,this.previous=n,this.next=-1}}();t.FastNode=n}(es||(es={})),function(t){var e=function(){return function(t,e){this.element=t,this.next=e}}();function n(t,e){return t===e}t.Node=e,t.defaultEquals=n;var i=function(){function t(t){void 0===t&&(t=n),this.count=0,this.next=void 0,this.equalsFn=t,this.head=null}return t.prototype.push=function(t){var n,i=new e(t);if(null==this.head)this.head=i;else{for(n=this.head;null!=n.next;)n=n.next;n.next=i}this.count++},t.prototype.removeAt=function(t){if(t>=0&&t=0&&t<=this.count){for(var e=this.head,n=0;n=0&&n<=this.count){var i=new e(t);if(0===n)i.next=this.head,this.head=i;else{var r=this.getElementAt(n-1);i.next=r.next,r.next=i}return this.count++,!0}return!1},t.prototype.indexOf=function(t){for(var e=this.head,n=0;n0)for(var e=0;ethis._objectQueue.length;)this._objectQueue.shift()},t.clearCache=function(){this._objectQueue.length=0},t.obtain=function(){return this._objectQueue.length>0?this._objectQueue.shift():[]},t.free=function(t){this._objectQueue.unshift(t),t.length=0},t._objectQueue=[],t}();t.ListPool=e}(es||(es={})),function(t){var e=function(){function e(t,e){this.first=t,this.second=e}return e.prototype.clear=function(){this.first=this.second=null},e.prototype.equals=function(t){return this.first==t.first&&this.second==t.second},e.prototype.getHashCode=function(){return 37*t.EqualityComparer.default().getHashCode(this.first)+t.EqualityComparer.default().getHashCode(this.second)},e}();t.Pair=e}(es||(es={})),function(t){var e=function(){function e(){}return e.warmCache=function(t,e){if((e-=this._objectQueue.length)>0)for(var n=0;nthis._objectQueue.length;)this._objectQueue.shift()},e.clearCache=function(){this._objectQueue.length=0},e.obtain=function(t){return this._objectQueue.length>0?this._objectQueue.shift():new t},e.free=function(e){this._objectQueue.unshift(e),t.isIPoolable(e)&&e.reset()},e._objectQueue=[],e}();t.Pool=e,t.isIPoolable=function(t){return void 0!==t.reset}}(es||(es={})),function(t){var e=function(t){function e(e){return t.call(this,e)||this}return __extends(e,t),e.prototype.getHashCode=function(t){return t.getHashCode()},e.prototype.areEqual=function(t,e){return t.equals(e)},e}(function(){function t(t){var e=this;this.clear(),t&&t.forEach(function(t){e.add(t)})}return t.prototype.add=function(t){var e=this,n=this.getHashCode(t),i=this.buckets[n];if(void 0===i){var r=new Array;return r.push(t),this.buckets[n]=r,this.count=this.count+1,!0}return!i.some(function(n){return e.areEqual(n,t)})&&(i.push(t),this.count=this.count+1,!0)},t.prototype.remove=function(t){var e=this,n=this.getHashCode(t),i=this.buckets[n];if(void 0===i)return!1;var r=!1,o=new Array;return i.forEach(function(n){e.areEqual(n,t)?r=!0:o.push(t)}),this.buckets[n]=o,r&&(this.count=this.count-1),r},t.prototype.contains=function(t){return this.bucketsContains(this.buckets,t)},t.prototype.getCount=function(){return this.count},t.prototype.clear=function(){this.buckets=new Array,this.count=0},t.prototype.toArray=function(){var t=new Array;return this.buckets.forEach(function(e){e.forEach(function(e){t.push(e)})}),t},t.prototype.exceptWith=function(t){var e=this;t&&t.forEach(function(t){e.remove(t)})},t.prototype.intersectWith=function(t){var e=this;if(t){var n=this.buildInternalBuckets(t);this.toArray().forEach(function(t){e.bucketsContains(n.Buckets,t)||e.remove(t)})}else this.clear()},t.prototype.unionWith=function(t){var e=this;t.forEach(function(t){e.add(t)})},t.prototype.isSubsetOf=function(t){var e=this,n=this.buildInternalBuckets(t);return this.toArray().every(function(t){return e.bucketsContains(n.Buckets,t)})},t.prototype.isSupersetOf=function(t){var e=this;return t.every(function(t){return e.contains(t)})},t.prototype.overlaps=function(t){var e=this;return t.some(function(t){return e.contains(t)})},t.prototype.setEquals=function(t){var e=this;return this.buildInternalBuckets(t).Count===this.count&&t.every(function(t){return e.contains(t)})},t.prototype.buildInternalBuckets=function(t){var e=this,n=new Array,i=0;return t.forEach(function(t){var r=e.getHashCode(t),o=n[r];if(void 0===o){var s=new Array;s.push(t),n[r]=s,i+=1}else o.some(function(n){return e.areEqual(n,t)})||(o.push(t),i+=1)}),{Buckets:n,Count:i}},t.prototype.bucketsContains=function(t,e){var n=this,i=t[this.getHashCode(e)];return void 0!==i&&i.some(function(t){return n.areEqual(t,e)})},t}());t.HashSet=e}(es||(es={})),function(t){var e=function(){function t(){}return t.waitForSeconds=function(t){return n.waiter.wait(t)},t}();t.Coroutine=e;var n=function(){function t(){this.waitTime=0}return t.prototype.wait=function(e){return t.waiter.waitTime=e,t.waiter},t.waiter=new t,t}();t.WaitForSeconds=n}(es||(es={})),function(t){var e=function(){function t(){this.waitTimer=0,this.useUnscaledDeltaTime=!1}return t.prototype.stop=function(){this.isDone=!0},t.prototype.setUseUnscaledDeltaTime=function(t){return this.useUnscaledDeltaTime=t,this},t.prototype.prepareForUse=function(){this.isDone=!1},t.prototype.reset=function(){this.isDone=!0,this.waitTimer=0,this.waitForCoroutine=null,this.enumerator=null,this.useUnscaledDeltaTime=!1},t}();t.CoroutineImpl=e;var n=function(n){function i(){var t=null!==n&&n.apply(this,arguments)||this;return t._unblockedCoroutines=[],t._shouldRunNextFrame=[],t}return __extends(i,n),i.prototype.startCoroutine=function(n){var i=t.Pool.obtain(e);return i.prepareForUse(),i.enumerator=n,this.tickCoroutine(i)?(this._isInUpdate?this._shouldRunNextFrame.push(i):this._unblockedCoroutines.push(i),i):null},i.prototype.update=function(){this._isInUpdate=!0;for(var e=0;e0?(n.waitTimer-=n.useUnscaledDeltaTime?t.Time.unscaledDeltaTime:t.Time.deltaTime,this._shouldRunNextFrame.push(n)):this.tickCoroutine(n)&&this._shouldRunNextFrame.push(n)}}var i=new linq.List(this._unblockedCoroutines);i.clear(),i.addRange(this._shouldRunNextFrame),this._shouldRunNextFrame.length=0,this._isInUpdate=!1},i.prototype.tickCoroutine=function(n){var i=n.enumerator.next();return i.done||n.isDone?(t.Pool.free(n),!1):null==i.value||(i.value instanceof t.WaitForSeconds?(n.waitTimer=i.value.waitTime,!0):"number"==typeof i.value?(n.waitTimer=i.value,!0):"string"==typeof i.value?"break"!=i.value||(t.Pool.free(n),!1):!(i.value instanceof e)||(n.waitForCoroutine=i.value,!0))},i}(t.GlobalManager);t.CoroutineManager=n}(es||(es={})),function(t){var e=function(){function e(t,e,n){void 0===n&&(n=!0),this.binWidth=0,this.binHeight=0,this.usedRectangles=[],this.freeRectangles=[],this.init(t,e,n)}return e.prototype.init=function(e,n,i){void 0===i&&(i=!0),this.binWidth=e,this.binHeight=n,this.allowRotations=i;var r=new t.Rectangle;r.x=0,r.y=0,r.width=e,r.height=n,this.usedRectangles.length=0,this.freeRectangles.length=0,this.freeRectangles.push(r)},e.prototype.insert=function(e,n){var i=new t.Rectangle,r=new t.Ref(0),o=new t.Ref(0);if(0==(i=this.findPositionForNewNodeBestAreaFit(e,n,r,o)).height)return i;for(var s=this.freeRectangles.length,a=0;a=e&&this.freeRectangles[s].height>=n){var h=Math.abs(this.freeRectangles[s].width-e),c=Math.abs(this.freeRectangles[s].height-n),u=Math.min(h,c);(a=n&&this.freeRectangles[s].height>=e){h=Math.abs(this.freeRectangles[s].width-n),c=Math.abs(this.freeRectangles[s].height-e),u=Math.min(h,c);(a=t.x+t.width||e.x+e.width<=t.x||e.y>=t.y+t.height||e.y+e.height<=t.y)return!1;if(e.xt.x){if(e.y>t.y&&e.yt.y){var n;if(e.x>t.x&&e.x=e.x&&t.y>=e.y&&t.x+t.width<=e.x+e.width&&t.y+t.height<=e.y+e.height},e}();t.MaxRectsBinPack=e}(es||(es={}));var ArrayUtils=function(){function t(){}return t.bubbleSort=function(t){for(var e=!1,n=0;nn;i--)if(t[i]0&&t[r-1]>i;r--)t[r]=t[r-1];t[r]=i}},t.binarySearch=function(t,e){for(var n=0,i=t.length,r=n+i>>1;n=t[r]&&(n=r+1),r=n+i>>1;return t[n]==e?n:-1},t.findElementIndex=function(t,e){for(var n=t.length,i=0;it[e]&&(e=i);return e},t.getMinElementIndex=function(t){for(var e=0,n=t.length,i=1;i=0;--r)n.unshift(e[r]);return n},t.getDifferAry=function(t,e){t=this.getUniqueAry(t),e=this.getUniqueAry(e);for(var n=t.concat(e),i={},r=[],o=n.length,s=0;s=0;e-=1)t.splice(e,1)},t.cloneList=function(t){return t?t.slice(0,t.length):null},t.equals=function(t,e){if(t==e)return!0;var n=t.length;if(n!=e.length)return!1;for(;n--;)if(t[n]!=e[n])return!1;return!0},t.insert=function(t,e,n){if(!t)return null;var i=t.length;if(e>i&&(e=i),e<0&&(e=0),e==i)t.push(n);else if(0==e)t.unshift(n);else{for(var r=i-1;r>=e;r-=1)t[r+1]=t[r];t[e]=n}return n},t.shuffle=function(t){for(var e=t.length;e>1;){e--;var n=RandomUtils.randint(0,e+1),i=t[n];t[n]=t[e],t[e]=i}},t.addIfNotPresent=function(t,e){return!new linq.List(t).contains(e)&&(t.push(e),!0)},t.lastItem=function(t){return t[t.length-1]},t.randomItem=function(t){return t[RandomUtils.randint(0,t.length-1)]},t.randomItems=function(t,e){for(var n=new Set;n.size!=e;){var i=this.randomItem(t);n.has(i)||n.add(i)}var r=es.ListPool.obtain();return n.forEach(function(t){return r.push(t)}),r},t}();!function(t){var e=function(){function t(){}return Object.defineProperty(t,"nativeBase64",{get:function(){return"function"==typeof window.atob},enumerable:!0,configurable:!0}),t.decode=function(t){if(t=t.replace(/[^A-Za-z0-9\+\/\=]/g,""),this.nativeBase64)return window.atob(t);for(var e,n,i,r,o,s,a=[],h=0;h>4,n=(15&r)<<4|(o=this._keyStr.indexOf(t.charAt(h++)))>>2,i=(3&o)<<6|(s=this._keyStr.indexOf(t.charAt(h++))),a.push(String.fromCharCode(e)),64!==o&&a.push(String.fromCharCode(n)),64!==s&&a.push(String.fromCharCode(i));return a=a.join("")},t.encode=function(t){if(t=t.replace(/\r\n/g,"\n"),!this.nativeBase64){for(var e,n,i,r,o,s,a,h=[],c=0;c>2,o=(3&e)<<4|(n=t.charCodeAt(c++))>>4,s=(15&n)<<2|(i=t.charCodeAt(c++))>>6,a=63&i,isNaN(n)?s=a=64:isNaN(i)&&(a=64),h.push(this._keyStr.charAt(r)),h.push(this._keyStr.charAt(o)),h.push(this._keyStr.charAt(s)),h.push(this._keyStr.charAt(a));return h=h.join("")}window.btoa(t)},t.decodeBase64AsArray=function(e,n){n=n||1;var i,r,o,s=t.decode(e),a=new Uint32Array(s.length/n);for(i=0,o=s.length/n;i=0;--r)a[i]+=s.charCodeAt(i*n+r)<<(r<<3);return a},t.decompress=function(t,e,n){throw new Error("GZIP/ZLIB compressed TMX Tile Map not supported!")},t.decodeCSV=function(t){for(var e=t.replace("\n","").trim().split(","),n=[],i=0;i(e=Math.floor(e))?t++:e++,this.randrange(t,e)},t.randnum=function(t,e){return this.random()*(e-t)+t},t.shuffle=function(t){return t.sort(this._randomCompare),t},t.choice=function(t){if(!t.hasOwnProperty("length"))throw new Error("无法对此对象执行此操作");var e=Math.floor(this.random()*t.length);return t instanceof String?String(t).charAt(e):t[e]},t.sample=function(t,e){var n=t.length;if(e<=0||n=0;)s=Math.floor(this.random()*n);i.push(t[s]),r.push(s)}return i},t.random=function(){return Math.random()},t.boolean=function(t){return void 0===t&&(t=.5),this.random().5?1:-1},t}();!function(t){var e=function(){function e(){}return e.getSide=function(e,n){switch(n){case t.Edge.top:return e.top;case t.Edge.bottom:return e.bottom;case t.Edge.left:return e.left;case t.Edge.right:return e.right}},e.union=function(e,n){var i=new t.Rectangle(n.x,n.y,0,0),r=new t.Rectangle;return r.x=Math.min(e.x,i.x),r.y=Math.min(e.y,i.y),r.width=Math.max(e.right,i.right)-r.x,r.height=Math.max(e.bottom,i.bottom)-r.y,r},e.getHalfRect=function(e,n){switch(n){case t.Edge.top:return new t.Rectangle(e.x,e.y,e.width,e.height/2);case t.Edge.bottom:return new t.Rectangle(e.x,e.y+e.height/2,e.width,e.height/2);case t.Edge.left:return new t.Rectangle(e.x,e.y,e.width/2,e.height);case t.Edge.right:return new t.Rectangle(e.x+e.width/2,e.y,e.width/2,e.height)}},e.getRectEdgePortion=function(e,n,i){switch(void 0===i&&(i=1),n){case t.Edge.top:return new t.Rectangle(e.x,e.y,e.width,i);case t.Edge.bottom:return new t.Rectangle(e.x,e.y+e.height-i,e.width,i);case t.Edge.left:return new t.Rectangle(e.x,e.y,i,e.height);case t.Edge.right:return new t.Rectangle(e.x+e.width-i,e.y,i,e.height)}},e.expandSide=function(e,n,i){switch(i=Math.abs(i),n){case t.Edge.top:e.y-=i,e.height+=i;break;case t.Edge.bottom:e.height+=i;break;case t.Edge.left:e.x-=i,e.width+=i;break;case t.Edge.right:e.width+=i}},e.contract=function(t,e,n){t.x+=e,t.y+=n,t.width-=2*e,t.height-=2*n},e.boundsFromPolygonVector=function(e){for(var n=Number.POSITIVE_INFINITY,i=Number.POSITIVE_INFINITY,r=Number.NEGATIVE_INFINITY,o=Number.NEGATIVE_INFINITY,s=0;sr&&(r=a.x),a.yo&&(o=a.y)}return this.fromMinMaxVector(new t.Vector2(n,i),new t.Vector2(r,o))},e.fromMinMaxVector=function(e,n){return new t.Rectangle(e.x,e.y,n.x-e.x,n.y-e.y)},e.getSweptBroadphaseBounds=function(e,n,i){var r=t.Rectangle.empty;return r.x=n>0?e.x:e.x+n,r.y=i>0?e.y:e.y+i,r.width=n>0?n+e.width:e.width-n,r.height=i>0?i+e.height:e.height-i,r},e.prototype.collisionCheck=function(t,e,n,i){n.value=i.value=0;var r=e.x-(t.x+t.width),o=e.x+e.width-t.x,s=e.y-(t.y+t.height),a=e.y+e.height-t.y;return!(r>0||o<0||s>0||a<0)&&(n.value=Math.abs(r)=l||Math.abs(u)>=p)return t.Vector2.zero;var f=c>0?l-c:-l-c,d=u>0?p-u:-p-u;return new t.Vector2(f,d)},e}();t.RectangleExt=e}(es||(es={})),function(t){var e=function(){function t(){}return t.premultiplyAlpha=function(t){for(var e=t[0],n=0;nt.MathHelper.Epsilon?e.divide(new t.Vector2(n)):e.x=e.y=0},e.transformA=function(t,e,n,i,r,o){for(var s=0;so?e?-1:1:r0},e.prototype.average=function(t){return this.sum(t)/this.count(t)},e.prototype.cast=function(){return new e(this._elements)},e.prototype.clear=function(){this._elements.length=0},e.prototype.concat=function(t){return new e(this._elements.concat(t.toArray()))},e.prototype.contains=function(t){return this.any(function(e){return e===t})},e.prototype.count=function(t){return t?this.where(t).count():this._elements.length},e.prototype.defaultIfEmpty=function(t){return this.count()?this:new e([t])},e.prototype.distinctBy=function(t){var n=this.groupBy(t);return Object.keys(n).reduce(function(t,e){return t.add(n[e][0]),t},new e)},e.prototype.elementAt=function(t){if(t=0)return this._elements[t];throw new Error("ArgumentOutOfRangeException: index is less than 0 or greater than or equal to the number of elements in source.")},e.prototype.elementAtOrDefault=function(t){return t=0?this._elements[t]:void 0},e.prototype.except=function(t){return this.where(function(e){return!t.contains(e)})},e.prototype.first=function(t){if(this.count())return t?this.where(t).first():this._elements[0];throw new Error("InvalidOperationException: The source sequence is empty.")},e.prototype.firstOrDefault=function(t){return this.count(t)?this.first(t):void 0},e.prototype.forEach=function(t){return this._elements.forEach(t)},e.prototype.groupBy=function(t,e){void 0===e&&(e=function(t){return t});return this.aggregate(function(n,i){var r=t(i),o=n[r],s=e(i);return o?o.push(s):n[r]=[s],n},{})},e.prototype.groupJoin=function(t,e,n,i){return this.select(function(r){return i(r,t.where(function(t){return e(r)===n(t)}))})},e.prototype.indexOf=function(t){return this._elements.indexOf(t)},e.prototype.insert=function(t,e){if(t<0||t>this._elements.length)throw new Error("Index is out of range.");this._elements.splice(t,0,e)},e.prototype.intersect=function(t){return this.where(function(e){return t.contains(e)})},e.prototype.join=function(t,e,n,i){return this.selectMany(function(r){return t.where(function(t){return n(t)===e(r)}).select(function(t){return i(r,t)})})},e.prototype.last=function(t){if(this.count())return t?this.where(t).last():this._elements[this.count()-1];throw Error("InvalidOperationException: The source sequence is empty.")},e.prototype.lastOrDefault=function(t){return this.count(t)?this.last(t):void 0},e.prototype.max=function(t){return Math.max.apply(Math,__spread(this._elements.map(t||function(t){return t})))},e.prototype.min=function(t){return Math.min.apply(Math,__spread(this._elements.map(t||function(t){return t})))},e.prototype.ofType=function(t){var e;switch(t){case Number:e="number";break;case String:e="string";break;case Boolean:e=typeof!0;break;case Function:e="function";break;default:e=null}return null===e?this.where(function(e){return e instanceof t}).cast():this.where(function(t){return typeof t===e}).cast()},e.prototype.orderBy=function(e,i){return void 0===i&&(i=t.keyComparer(e,!1)),new n(this._elements,i)},e.prototype.orderByDescending=function(e,i){return void 0===i&&(i=t.keyComparer(e,!0)),new n(this._elements,i)},e.prototype.thenBy=function(t){return this.orderBy(t)},e.prototype.thenByDescending=function(t){return this.orderByDescending(t)},e.prototype.remove=function(t){return-1!==this.indexOf(t)&&(this.removeAt(this.indexOf(t)),!0)},e.prototype.removeAll=function(e){return this.where(t.negate(e))},e.prototype.removeAt=function(t){this._elements.splice(t,1)},e.prototype.reverse=function(){return new e(this._elements.reverse())},e.prototype.select=function(t){return new e(this._elements.map(t))},e.prototype.selectMany=function(t){var n=this;return this.aggregate(function(e,i,r){return e.addRange(n.select(t).elementAt(r).toArray()),e},new e)},e.prototype.sequenceEqual=function(t){return this.all(function(e){return t.contains(e)})},e.prototype.single=function(t){if(1!==this.count(t))throw new Error("The collection does not contain exactly one element.");return this.first(t)},e.prototype.singleOrDefault=function(t){return this.count(t)?this.single(t):void 0},e.prototype.skip=function(t){return new e(this._elements.slice(Math.max(0,t)))},e.prototype.skipLast=function(t){return new e(this._elements.slice(0,-Math.max(0,t)))},e.prototype.skipWhile=function(t){var e=this;return this.skip(this.aggregate(function(n){return t(e.elementAt(n))?++n:n},0))},e.prototype.sum=function(t){return t?this.select(t).sum():this.aggregate(function(t,e){return t+ +e},0)},e.prototype.take=function(t){return new e(this._elements.slice(0,Math.max(0,t)))},e.prototype.takeLast=function(t){return new e(this._elements.slice(-Math.max(0,t)))},e.prototype.takeWhile=function(t){var e=this;return this.take(this.aggregate(function(n){return t(e.elementAt(n))?++n:n},0))},e.prototype.toArray=function(){return this._elements},e.prototype.toDictionary=function(t,n){var i=this;return this.aggregate(function(e,r,o){return e[i.select(t).elementAt(o).toString()]=n?i.select(n).elementAt(o):r,e.add({Key:i.select(t).elementAt(o),Value:n?i.select(n).elementAt(o):r}),e},new e)},e.prototype.toSet=function(){var t,e,n=new Set;try{for(var i=__values(this._elements),r=i.next();!r.done;r=i.next()){var o=r.value;n.add(o)}}catch(e){t={error:e}}finally{try{r&&!r.done&&(e=i.return)&&e.call(i)}finally{if(t)throw t.error}}return n},e.prototype.toList=function(){return this},e.prototype.toLookup=function(t,e){return this.groupBy(t,e)},e.prototype.where=function(t){return new e(this._elements.filter(t))},e.prototype.zip=function(t,e){var n=this;return t.count()e.angle?1:t.angleMath.PI&&(o-=2*Math.PI),r.p1.begin=o>0,r.p2.begin=!r.p1.begin}}catch(e){t={error:e}}finally{try{i&&!i.done&&(e=n.return)&&e.call(n)}finally{if(t)throw t.error}}this._isSpotLight&&(this._spotStartAngle=this._segments[0].p2.angle,this._spotEndAngle=this._segments[1].p2.angle)},e._cornerCache=[],e._openSegments=new t.LinkedList,e}();t.VisibilityComputer=e}(es||(es={})),function(t){var e=function(){function e(){this._timeInSeconds=0,this._repeats=!1,this._isDone=!1,this._elapsedTime=0}return e.prototype.getContext=function(){return this.context},e.prototype.reset=function(){this._elapsedTime=0},e.prototype.stop=function(){this._isDone=!0},e.prototype.tick=function(){return!this._isDone&&this._elapsedTime>this._timeInSeconds&&(this._elapsedTime-=this._timeInSeconds,this._onTime(this),this._isDone||this._repeats||(this._isDone=!0)),this._elapsedTime+=t.Time.deltaTime,this._isDone},e.prototype.initialize=function(t,e,n,i){this._timeInSeconds=t,this._repeats=e,this.context=n,this._onTime=i},e.prototype.unload=function(){this.context=null,this._onTime=null},e}();t.Timer=e}(es||(es={})),function(t){var e=function(e){function n(){var t=null!==e&&e.apply(this,arguments)||this;return t._timers=[],t}return __extends(n,e),n.prototype.update=function(){for(var t=this._timers.length-1;t>=0;t--)this._timers[t].tick()&&(this._timers[t].unload(),new linq.List(this._timers).removeAt(t))},n.prototype.schedule=function(e,n,i,r){var o=new t.Timer;return o.initialize(e,n,i,r),this._timers.push(o),o},n}(t.GlobalManager);t.TimerManager=e}(es||(es={})); \ No newline at end of file diff --git a/source/src/ECS/Utils/BitVector.ts b/source/src/ECS/Utils/BitVector.ts new file mode 100644 index 00000000..d7253d9d --- /dev/null +++ b/source/src/ECS/Utils/BitVector.ts @@ -0,0 +1,353 @@ +module es { + /** + * 性能优化的位组实现。某些操作是以不安全为前缀的, 这些方法不执行验证,主要是在内部利用来优化实体ID位集的访问 + */ + export class BitVector { + private words: number[] = [0]; + + /** + * 创建一个初始大小足够大的bitset,以明确表示0到nbits-1范围内指数的bit + * @param nbits nbits 位集的初始大小 + */ + constructor(nbits?: number | BitVector) { + if (nbits) { + if (typeof nbits == 'number') + this.checkCapacity(nbits >>> 6); + else { + // 基于另一个位向量创建一个位集 + this.words = nbits.words.slice(0); + } + } + } + + /** + * + * @param index 位的索引 + * @returns 该位是否被设置 + */ + public get(index: number): boolean { + const word = index >>> 6; + return word < this.words.length && + (this.words[word] & (1 << index)) != 0; + } + + /** + * + * @param index 位的索引 + */ + public set(index: number, value: boolean = true) { + if (value) { + const word = index >>> 6; + this.checkCapacity(word); + this.words[word] |= 1 << index; + } else { + this.clear(index); + } + } + + /** + * + * @param index 位的索引 + * @returns 该位是否被设置 + */ + public unsafeGet(index: number): boolean { + return (this.words[index >>> 6] & (1 << index)) != 0; + } + + /** + * + * @param index 要设置的位的索引 + */ + public unsafeSet(index: number) { + this.words[index >>> 6] |= 1 << index; + } + + /** + * + * @param index 要翻转的位的索引 + */ + public flip(index: number) { + const word = index >>> 6; + this.checkCapacity(word); + this.words[word] ^= 1 << index; + } + + /** + * 要清除的位的索引 + * @param index + */ + public clear(index?: number) { + if (index != null) { + const word = index >>> 6; + if (word >= this.words.length) return; + this.words[word] &= ~(1 << index); + } else { + this.words.fill(0); + } + } + + /** + * 返回该位组的 "逻辑大小":位组中最高设置位的索引加1。如果比特集不包含集合位,则返回0 + */ + public length(): number { + let bits = this.words.slice(0); + for (let word = bits.length - 1; word >= 0; --word) { + let bitsAtWord = bits[word]; + if (bitsAtWord != 0) + return (word << 6) + 64 - this.numberOfLeadingZeros(bitsAtWord); + } + + return 0; + } + + /** + * @returns 如果这个位组中没有设置为true的位,则为true + */ + public isEmpty(): boolean { + let bits = this.words.slice(0); + let length = bits.length; + for (let i = 0; i < length; i++) { + if (bits[i] != 0) + return false; + } + + return true; + } + + /** + * 返回在指定的起始索引上或之后出现的第一个被设置为真的位的索引。 + * 如果不存在这样的位,则返回-1 + * @param fromIndex + */ + public nextSetBit(fromIndex: number): number { + let word = fromIndex >>> 6; + if (word >= this.words.length) + return -1; + + let bitmap = this.words[word] >>> fromIndex; + if (bitmap != 0) + return fromIndex + this.numberOfTrailingZeros(bitmap); + + for (let i = 1 + word; i < this.words.length; i++) { + bitmap = this.words[i]; + if (bitmap != 0) { + return i * 64 + this.numberOfTrailingZeros(bitmap); + } + } + + return -1; + } + + /** + * 返回在指定的起始索引上或之后发生的第一个被设置为false的位的索引 + * @param fromIndex + */ + public nextClearBit(fromIndex: number): number { + let word = fromIndex >>> 6; + if (word >= this.words.length) + return Math.min(fromIndex, this.words.length << 6); + + let bitmap = ~(this.words[word] >>> fromIndex); + if (bitmap != 0) + return fromIndex + this.numberOfTrailingZeros(bitmap); + + for (let i = 1 + word; i < this.words.length; i++) { + bitmap = ~this.words[i]; + if (bitmap != 0) { + return i * 64 + this.numberOfTrailingZeros(bitmap); + } + } + + return Math.min(fromIndex, this.words.length << 6); + } + + /** + * 对这个目标位集和参数位集进行逻辑AND。 + * 这个位集被修改,使它的每一个位都有值为真,如果且仅当它最初的值为真,并且位集参数中的相应位也有值为真 + * @param other + */ + public and(other: BitVector) { + let commonWords = Math.min(this.words.length, other.words.length); + for (let i = 0; commonWords > i; i++) { + this.words[i] &= other.words[i]; + } + + if (this.words.length > commonWords) { + for (let i = commonWords, s = this.words.length; s > i; i++) { + this.words[i] = 0; + } + } + } + + /** + * 清除该位集的所有位,其对应的位被设置在指定的位集中 + * @param other + */ + public andNot(other: BitVector) { + let commonWords = Math.min(this.words.length, other.words.length); + for (let i = 0; commonWords > i; i++) + this.words[i] &= ~other.words[i]; + } + + /** + * 用位集参数执行这个位集的逻辑OR。 + * 如果且仅当位集参数中的位已经有值为真或位集参数中的对应位有值为真时,该位集才会被修改,从而使位集中的位有值为真 + * @param other + */ + public or(other: BitVector) { + let commonWords = Math.min(this.words.length, other.words.length); + for (let i = 0; commonWords > i; i++) + this.words[i] |= other.words[i]; + + if (commonWords < other.words.length) { + this.checkCapacity(other.words.length); + for (let i = commonWords, s = other.words.length; s > i; i++) { + this.words[i] = other.words[i]; + } + } + } + + /** + * 用位集参数对这个位集进行逻辑XOR。 + * 这个位集被修改了,所以如果且仅当以下语句之一成立时,位集中的一个位的值为真 + * @param other + */ + public xor(other: BitVector) { + let commonWords = Math.min(this.words.length, other.words.length); + + for (let i = 0; commonWords > i; i++) + this.words[i] ^= other.words[i]; + + if (commonWords < other.words.length) { + this.checkCapacity(other.words.length); + for (let i = commonWords, s = other.words.length; s > i; i++) { + this.words[i] = other.words[i]; + } + } + } + + /** + * 如果指定的BitVector有任何位被设置为true,并且在这个BitVector中也被设置为true,则返回true + * @param other + */ + public intersects(other: BitVector): boolean { + let bits = this.words.slice(0); + let otherBits = other.words; + for (let i = 0, s = Math.min(bits.length, otherBits.length); s > i; i++) { + if ((bits[i] & otherBits[i]) != 0) + return true; + } + return false; + } + + /** + * 如果这个位集是指定位集的超级集,即它的所有位都被设置为真,那么返回true + * @param other + */ + public containsAll(other: BitVector): boolean { + let bits = this.words.slice(0); + let otherBits = other.words; + let otherBitsLength = otherBits.length; + let bitsLength = bits.length; + + + for (let i = bitsLength; i < otherBitsLength; i++) { + if (otherBits[i] != 0) { + return false; + } + } + + for (let i = 0, s = Math.min(bitsLength, otherBitsLength); s > i; i++) { + if ((bits[i] & otherBits[i]) != otherBits[i]) { + return false; + } + } + + return true; + } + + public cardinality() { + let count = 0; + for (let i = 0; i < this.words.length; i++) + count += this.bitCount(this.words[i]); + + return count; + } + + public hashCode() { + const word = this.length() >>> 6; + let hash = 0; + for (let i = 0; word >= i; i++) + hash = 127 * hash + (this.words[i] ^ (this.words[i] >>> 32)); + return hash; + } + + private bitCount(i: number) { + i = i - ((i >>> 1) & 0x55555555); + i = (i & 0x33333333) + ((i >>> 2) & 0x33333333); + i = (i + (i >>> 4)) & 0x0f0f0f0f; + i = i + (i >>> 8); + i = i + (i >>> 16); + return i & 0x3f; + } + + /** + * 返回二进制补码二进制表示形式中最高位(“最左端”)一位之前的零位数量 + * @param i + */ + private numberOfLeadingZeros(i: number) { + if (i == 0) return 64; + let n = 1; + let x = i >>> 32; + if (x == 0) { n += 32; x = i; } + if (x >>> 16 == 0) { n += 16; x <<= 16; } + if (x >>> 24 == 0) { n += 8; x <<= 8; } + if (x >>> 28 == 0) { n += 4; x <<= 4; } + if (x >>> 30 == 0) { n += 2; x <<= 2; } + n -= x >>> 31; + return n; + } + + /** + * 返回指定二进制数的补码二进制表示形式中最低序(“最右”)一位之后的零位数量 + * @param i + */ + public numberOfTrailingZeros(i: number) { + let x: number = 0, y: number = 0; + if (i == 0) return 64; + let n = 63; + y = i; if (y != 0) { n = n - 32; x = y; } else x = (i >>> 32); + y = x << 16; if (y != 0) { n = n - 16; x = y; } + y = x << 8; if (y != 0) { n = n - 8; x = y; } + y = x << 4; if (y != 0) { n = n - 4; x = y; } + y = x << 2; if (y != 0) { n = n - 2; x = y; } + return n - ((x << 1) >>> 31); + } + + /** + * + * @param index 要清除的位的索引 + */ + public unsafeClear(index: number) { + this.words[index >>> 6] &= ~(1 << index); + } + + /** + * 增长支持数组,使其能够容纳所请求的位 + * @param bits 位数 + */ + public ensureCapacity(bits: number) { + this.checkCapacity(bits >>> 6); + } + + private checkCapacity(len: number) { + if (len >= this.words.length) { + let newBits: number[] = new Array(len + 1); + for (let i = 0; i < this.words.length; i++) { + newBits[i] = this.words[i]; + } + this.words = newBits; + } + } + } +} \ No newline at end of file