New Research: Supply Chain Attack on Axios Pulls Malicious Dependency from npm.Details →
Socket
Book a DemoSign in
Socket

precedence-maps

Package Overview
Dependencies
Maintainers
1
Versions
4
Alerts
File Explorer

Advanced tools

Socket logo

Install Socket

Detect and block malicious and high-risk dependencies

Install

precedence-maps

Utilities to define graphs for your apps and schedule the execution of operations, fast.

latest
Source
npmnpm
Version
0.1.3
Version published
Maintainers
1
Created
Source

Precedence maps

Graphing and ordered maps for scheduling execution of tasks, fast.

Build Status

Installation

npm install precedence-maps

then in your code:

precedence = require('precedence-maps')

Usage

First we need to define a graph for our application.

var graphDefinitions = {
  "man": { incoming: ["god"], outgoing: ["animal"]},
  "god": { outgoing: ["animal","man"]}, // outgoing means things that come after
  "animal": { incoming: ["god","man"]}  // and incoming for things that come before
}
precedence.setGraph("mygraph", {
  map: graphDefinitions
});
precedence.getOrder("mygraph"); // [ 'god', 'man', 'animal' ]

The order will be flagged for refresh whenever setGraph is called for the specific graph. You can make several changes in the graph definitions, setGraph with/or without options(setting options refresh the configuration), and calculation will only take place when getOrder() is called or internally in the stores as needed.

var store = precedence.newStore("mygraph", Array) // Create a store where keys match properties in graphDefinitions
store('man').push("mike") // We declared Array to be the default constructor so that's what we get on new symbols.
store('god').push("loki");
store('man').push("bill");
store('animal').push("rat");
store('animal').push("pig");
store('man').push("kate");
store('god').push("thor");
// Calling store with no arguments returns an array orders by the graph
store().forEach(function (v) { console.log(v); });
/*
[ 'loki', 'thor' ]
[ 'mike', 'bill', 'kate' ]
[ 'rat', 'pig' ]
*/

Parsing the graph definitions can also be customized by providing/overriding two methods. Enumerate(graph) which must return an unordered array of graph symbols and collect(graph, symbolName) which will run per symbol and must return either an object like

{ 
  incoming: ["symbolNameBefore1","symbolNameBefore2",...],
  outgoing: ["symbolNameAfter1",...]
}

or a false value to omit this symbol from sorting.

API

precedence.setGraph(name, options)

  • name {String} Unique name to refer to this graph.
  • config {Object} Configurations for this graph.

precedence.getOrder(name)

  • name {String} name of the graph we want to get the order from

Returns: {Array} a list of names, sorted in the order of precedence

precedence.newStore(name, template)

  • name {String} name of the graph we want to order the map with.
  • template {Function} Optional, a constructor to create instances of when a new key is accessed.

Tests

Run the tests with node test.js.

MIT License

Keywords

precedence

FAQs

Package last updated on 01 Jun 2016

Did you know?

Socket

Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.

Install

Related posts