lsm/konva
1
0
Fork 0
mirror of https://github.com/konvajs/konva.git synced 2025-06-28 15:23:44 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

feat: more improved types in Node

Browse Source
This commit is contained in:
psychedelicious 2024-08-25 20:52:41 +10:00
parent 5e152a0e90
commit e968be7b5f
1 changed files with 13 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
src/Container.ts
View File

@ -282,7 +282,7 @@ export abstract class Container<
* @name Konva.Container#isAncestorOf * @name Konva.Container#isAncestorOf
* @param {Konva.Node} node * @param {Konva.Node} node
*/ */
isAncestorOf(node: Node) { isAncestorOf(node: Node): boolean {
var parent = node.getParent(); var parent = node.getParent();
while (parent) { while (parent) {
if (parent._id === this._id) { if (parent._id === this._id) {
@ -293,14 +293,14 @@ export abstract class Container<
return false; return false;
} }
clone(obj?: any) { clone(obj?: any): typeof this {
// call super method // call super method
var node = Node.prototype.clone.call(this, obj); var node = Node.prototype.clone.call(this, obj);
this.getChildren().forEach(function (no) { this.getChildren().forEach(function (no) {
node.add(no.clone()); node.add(no.clone());
}); });
return node as this; return node;
} }
/** /**
* get all shapes that intersect a point. Note: because this method must clear a temporary * get all shapes that intersect a point. Note: because this method must clear a temporary
@ -315,7 +315,7 @@ export abstract class Container<
* @param {Number} pos.y * @param {Number} pos.y
* @returns {Array} array of shapes * @returns {Array} array of shapes
*/ */
getAllIntersections(pos) { getAllIntersections(pos): Shape[] {
var arr: Shape[] = []; var arr: Shape[] = [];
this.find<Shape>('Shape').forEach((shape) => { this.find<Shape>('Shape').forEach((shape) => {
@ -326,7 +326,7 @@ export abstract class Container<
return arr; return arr;
} }
_clearSelfAndDescendantCache(attr?: string) { _clearSelfAndDescendantCache(attr?: string): void {
super._clearSelfAndDescendantCache(attr); super._clearSelfAndDescendantCache(attr);
// skip clearing if node is cached with canvas // skip clearing if node is cached with canvas
// for performance reasons !!! // for performance reasons !!!
@ -337,13 +337,17 @@ export abstract class Container<
node._clearSelfAndDescendantCache(attr); node._clearSelfAndDescendantCache(attr);
}); });
} }
_setChildrenIndices() { _setChildrenIndices(): void {
this.children?.forEach(function (child, n) { this.children?.forEach(function (child, n) {
child.index = n; child.index = n;
}); });
this._requestDraw(); this._requestDraw();
} }
drawScene(can?: SceneCanvas, top?: Node, bufferCanvas?: SceneCanvas) { drawScene(
can?: SceneCanvas,
top?: Node,
bufferCanvas?: SceneCanvas
): typeof this {
var layer = this.getLayer()!, var layer = this.getLayer()!,
canvas = can || (layer && layer.getCanvas()), canvas = can || (layer && layer.getCanvas()),
context = canvas && canvas.getContext(), context = canvas && canvas.getContext(),
@ -366,7 +370,7 @@ export abstract class Container<
} }
return this; return this;
} }
drawHit(can?: HitCanvas, top?: Node) { drawHit(can?: HitCanvas, top?: Node): typeof this {
if (!this.shouldDrawHit(top)) { if (!this.shouldDrawHit(top)) {
return this; return this;
} }
@ -388,7 +392,7 @@ export abstract class Container<
} }
return this; return this;
} }
_drawChildren(drawMethod, canvas, top, bufferCanvas?) { _drawChildren(drawMethod, canvas, top, bufferCanvas?): void {
var context = canvas && canvas.getContext(), var context = canvas && canvas.getContext(),
clipWidth = this.clipWidth(), clipWidth = this.clipWidth(),
clipHeight = this.clipHeight(), clipHeight = this.clipHeight(),