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

@atlaspack/graph

Package Overview
Dependencies
Maintainers
0
Versions
242
Alerts
File Explorer

Advanced tools

Socket logo

Install Socket

Detect and block malicious and high-risk dependencies

Install

@atlaspack/graph - npm Package Compare versions

Comparing version 3.2.1-dev.3450 to 3.2.1-dev.3460

6

package.json
{
"name": "@atlaspack/graph",
"version": "3.2.1-dev.3450+58845ef87",
"version": "3.2.1-dev.3460+340817991",
"description": "Blazing fast, zero configuration web application bundler",

@@ -19,6 +19,6 @@ "license": "(MIT OR Apache-2.0)",

"dependencies": {
"@atlaspack/feature-flags": "2.12.1-dev.3450+58845ef87",
"@atlaspack/feature-flags": "2.12.1-dev.3460+340817991",
"nullthrows": "^1.1.1"
},
"gitHead": "58845ef87446fcedb7d7d8876440c64184645cbb"
"gitHead": "3408179911d6c67e2bdad99e545dd7a0a9a6782c"
}

@@ -304,3 +304,3 @@ // @flow

this.#edges.forEach(
edge =>
(edge) =>
void link(

@@ -574,3 +574,3 @@ this.#edges.from(edge),

): NodeId[] {
let matches = node =>
let matches = (node) =>
type === ALL_EDGE_TYPES ||

@@ -633,3 +633,3 @@ (Array.isArray(type)

): NodeId[] {
let matches = node =>
let matches = (node) =>
type === ALL_EDGE_TYPES ||

@@ -636,0 +636,0 @@ (Array.isArray(type)

@@ -296,3 +296,3 @@ // @flow strict-local

toNodeIds: $ReadOnlyArray<NodeId>,
replaceFilter?: null | (NodeId => boolean),
replaceFilter?: null | ((NodeId) => boolean),
type?: TEdgeType | NullEdgeType = 1,

@@ -305,3 +305,3 @@ ): void {

replaceFilter
? outboundEdges.filter(toNodeId => replaceFilter(toNodeId))
? outboundEdges.filter((toNodeId) => replaceFilter(toNodeId))
: outboundEdges,

@@ -342,3 +342,3 @@ );

startNodeId,
getChildren: nodeId => this.getNodeIdsConnectedFrom(nodeId, type),
getChildren: (nodeId) => this.getNodeIdsConnectedFrom(nodeId, type),
});

@@ -369,3 +369,3 @@ }

startNodeId,
getChildren: nodeId => this.getNodeIdsConnectedTo(nodeId, type),
getChildren: (nodeId) => this.getNodeIdsConnectedTo(nodeId, type),
});

@@ -428,3 +428,3 @@ }

this.adjacencyList.forEachNodeIdConnectedFromReverse(nodeId, child => {
this.adjacencyList.forEachNodeIdConnectedFromReverse(nodeId, (child) => {
if (!visited.has(child)) {

@@ -481,8 +481,11 @@ queue.push({nodeId: child, context});

this.adjacencyList.forEachNodeIdConnectedFromReverse(nodeId, child => {
if (!visited.has(child)) {
queue.push(child);
}
return false;
});
this.adjacencyList.forEachNodeIdConnectedFromReverse(
nodeId,
(child) => {
if (!visited.has(child)) {
queue.push(child);
}
return false;
},
);
} else {

@@ -642,3 +645,3 @@ queue.pop();

{
exit: nodeId => {
exit: (nodeId) => {
sorted.push(nodeId);

@@ -645,0 +648,0 @@ },

@@ -292,3 +292,3 @@ // @flow strict-local

let originalEdges = [...originalSerialized.edges];
let work = new Promise(resolve => worker.on('message', resolve));
let work = new Promise((resolve) => worker.on('message', resolve));
worker.postMessage(originalSerialized);

@@ -295,0 +295,0 @@ let received = AdjacencyList.deserialize(await work);

@@ -8,3 +8,3 @@ // @flow strict-local

let setValues = [];
set.forEach(bit => {
set.forEach((bit) => {
setValues.push(bit);

@@ -16,3 +16,3 @@ });

assert(
setValues.some(v => v === value),
setValues.some((v) => v === value),
'Set values is missing value',

@@ -19,0 +19,0 @@ );

@@ -315,3 +315,3 @@ // @flow strict-local

graph.traverse(
nodeId => {
(nodeId) => {
visited.push(nodeId);

@@ -318,0 +318,0 @@ },

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