Huge News!Announcing our $40M Series B led by Abstract Ventures.Learn More
Socket
Socket
Sign inDemoInstall

@croquet/worldcore-kernel

Package Overview
Dependencies
Maintainers
1
Versions
35
Alerts
File Explorer

Advanced tools

Socket logo

Install Socket

Detect and block malicious and high-risk dependencies

Install

@croquet/worldcore-kernel - npm Package Compare versions

Comparing version 1.0.5 to 1.0.8

8

CHANGELOG.md

@@ -7,8 +7,14 @@ # Changelog

## [1.0.8] - 2021-12-17
### Changed
- Pawns are no longer created immediately to allow actors to set properties after super.init()
## [1.0.5] - 2021-12-08
### Fixed
- Fixed bug with view services being destroyed in wrong order.
## [1.0.4] - 2021-12-06
### Added
- Added FocusManager
## [1.0.3] - 2021-11-24

@@ -23,3 +29,3 @@ ### Added

- PlayerManager allows null return for CreatePlayer()
### Changed
### Fixed
- Fixed bug with initialization of async services

@@ -26,0 +32,0 @@

4

package.json
{
"name": "@croquet/worldcore-kernel",
"version": "1.0.5",
"version": "1.0.8",
"description": "3D World Engine for Croquet (minimal install)",

@@ -33,3 +33,3 @@ "keywords": [

},
"gitHead": "274161bf11c0a68b882e3a208a3e66e8cda99d57"
"gitHead": "18c44d4566337bd00a61ecce1754fc14769bd5eb"
}

@@ -20,6 +20,3 @@ /* eslint-disable new-cap */

// Spawning pawns is an immediate subscription because pawns often subscribe to actor messages in their
// constructors. This guarantees the pawn will be around if the new actor immediately sends a message.
this.subscribe("actor", {event: "createActor", handling: "immediate"}, this.spawnPawn);
this.subscribe("actor", "createActor", this.spawnPawn);
}

@@ -87,3 +84,2 @@

get actor() {return this._actor};
// get pawnManager() { return pm};

@@ -90,0 +86,0 @@ destroy() {

@@ -76,6 +76,6 @@ //------------------------------------------------------------------------------------------

generateHashTable() {
const table = [];
const q = new PriorityQueue((a, b) => a.key < b.key);
for (let n = 0; n < 256; n++) q.push({key: Math.random(), value: n});
while (!q.isEmpty) table.push(q.pop().value);
const permutation = [];
for (let n = 0; n < 256; n++) permutation.push({key: Math.random(), value: n});
permutation.sort((a, b) => a.key - b.key);
const table = permutation.map(a => a.value);
const table2 = table.concat(table);

@@ -82,0 +82,0 @@ return table2;

SocketSocket SOC 2 Logo

Product

  • Package Alerts
  • Integrations
  • Docs
  • Pricing
  • FAQ
  • Roadmap
  • Changelog

Packages

npm

Stay in touch

Get open source security insights delivered straight into your inbox.


  • Terms
  • Privacy
  • Security

Made with ⚡️ by Socket Inc