-
Notifications
You must be signed in to change notification settings - Fork 3
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
fix: Create new, better, stronger, faster rope
- Loading branch information
1 parent
949e891
commit 5f141d7
Showing
12 changed files
with
230 additions
and
55 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,135 @@ | ||
| import { Vector } from 'kontra'; | ||
| import { fgc2, gravity, RESTING_DISTANCE } from './constants'; | ||
| import { gameHeight, gameWidth } from './store'; | ||
| import { isBoxCollision } from './utils'; | ||
| import { VerletLink } from './VerletLink'; | ||
| import { VerletNode } from './VerletNode'; | ||
|
|
||
| export class Rope { | ||
| nodes = []; | ||
| links = []; | ||
| anchor; | ||
| iterations = 20; | ||
|
|
||
| constructor({ x, y, numNodes, level }) { | ||
| this.level = level; | ||
| this.anchor = Vector(x, y); | ||
| for (let i = 0; i < numNodes; i++) { | ||
| this.nodes.push( | ||
| new VerletNode({ | ||
| x, | ||
| y: i * RESTING_DISTANCE + y, | ||
| }) | ||
| ); | ||
| } | ||
| console.log(this.nodes); | ||
| for (let i = 0; i < this.nodes.length - 1; i++) { | ||
| const n1 = this.nodes[i]; | ||
| const n2 = this.nodes[i + 1]; | ||
| this.links.push(new VerletLink(n1, n2)); | ||
| } | ||
| console.log('links', this.links); | ||
| } | ||
|
|
||
| update() { | ||
| this.updateNodes(); | ||
| for (let i = 0; i < this.iterations; i++) { | ||
| this.updateLinks(); | ||
| this.constrainNodes(); | ||
| } | ||
| } | ||
| render(ctx) { | ||
| if (!ctx) return; | ||
| this.renderRope(ctx); | ||
| } | ||
| updateNodes() { | ||
| this.nodes.forEach((n) => { | ||
| if (n === this.nodes[0]) n.pos = this.anchor; | ||
| const vxy = n.pos.subtract(n.oldPos); | ||
| n.oldPos = n.pos; | ||
| n.pos = n.pos.add(vxy).add(Vector(0, gravity)); | ||
| }); | ||
| } | ||
| constrainNodes() { | ||
| this.nodes.forEach((n) => { | ||
| if (n === this.nodes[0]) n.pos = this.anchor; | ||
| this.handleWallCollision(n); | ||
| this.handleBoxCollision(n); | ||
| }); | ||
| } | ||
| updateLinks() { | ||
| this.links.forEach((l) => { | ||
| const dxy = l.n2.pos.subtract(l.n1.pos); | ||
| // console.log(l.n1.pos); | ||
| const distance = dxy.length(); | ||
| const diff = RESTING_DISTANCE - distance; | ||
| // console.log(distance); | ||
| const percent = diff / distance / 2; | ||
| const offset = Vector(dxy.x * percent, dxy.y * percent); | ||
| l.n1.pos = l.n1.pos.subtract(offset); | ||
| l.n2.pos = l.n2.pos.add(offset); | ||
| }); | ||
| } | ||
|
|
||
| renderRope(ctx) { | ||
| ctx.lineWidth = 4; | ||
| ctx.strokeStyle = fgc2; | ||
|
|
||
| ctx.beginPath(); | ||
| this.links.forEach((l) => { | ||
| ctx.moveTo(l.n1.x, l.n1.y); | ||
| ctx.lineTo(l.n2.x, l.n2.y); | ||
| }); | ||
|
|
||
| ctx.stroke(); | ||
| } | ||
|
|
||
| handleWallCollision(node) { | ||
| if (node.x > gameWidth) { | ||
| node.pos.x = gameWidth; | ||
| } | ||
| if (node.x < 0) { | ||
| node.pos.x = 0; | ||
| } | ||
| if (node.y > gameHeight) { | ||
| node.pos.y = gameHeight; | ||
| } | ||
| if (node.y < 0) { | ||
| node.pos.y = 0; | ||
| } | ||
| } | ||
| handleBoxCollision(node, vxy) { | ||
| if (node === this.nodes[0]) return; | ||
| const bricks = this.level.bricks; | ||
| bricks.forEach((b) => { | ||
| // check left edge | ||
| if (isBoxCollision(b, node)) { | ||
| Math.max(); | ||
| const left = Math.abs(node.pos.x - b.x); | ||
| const right = Math.abs(node.pos.x - (b.x + b.width)); | ||
| const top = Math.abs(node.pos.y - b.y); | ||
| const bot = Math.abs(node.pos.y - (b.y + b.height)); | ||
| // hhit left wall | ||
| const max = Math.max(left, right, top, bot); | ||
|
|
||
| if (max === right) { | ||
| node.pos.x = b.x - 5; | ||
| } else if (max === left) { | ||
| node.pos.x = b.x + b.width + 5; | ||
| } else if (max === bot) { | ||
| node.pos.y = b.y - 5; | ||
| } else if (max === top) { | ||
| node.pos.y = b.y + b.height + 5; | ||
| } | ||
| } | ||
| }); | ||
| } | ||
|
|
||
| get length() { | ||
| return this.nodes.length; | ||
| } | ||
|
|
||
| get endNode() { | ||
| return this.nodes[this.nodes.length - 1]; | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,8 @@ | ||
| export class VerletLink { | ||
| n1; | ||
| n2; | ||
| constructor(n1, n2) { | ||
| this.n1 = n1; | ||
| this.n2 = n2; | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,24 @@ | ||
| import { Vector } from 'kontra'; | ||
|
|
||
| export class VerletNode { | ||
| pos; | ||
| oldPos; | ||
| width = 5; | ||
| height = 5; | ||
| constructor({ x, y }) { | ||
| this.pos = Vector(x, y); | ||
| console.log(this.pos); | ||
| this.oldPos = Vector(x, y); | ||
| } | ||
|
|
||
| get x() { | ||
| return this.pos.x; | ||
| } | ||
| get y() { | ||
| return this.pos.y; | ||
| } | ||
| applyForce(fX, fY) { | ||
| this.pos.x += fX; | ||
| this.pos.y += fY; | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.