hierarchy-closure

WebJar for hierarchy-closure

License	MIT
GroupId	org.webjars.npm
ArtifactId	hierarchy-closure
Last Version	1.2.1
Release Date	Jul 11, 2019
Type	jar
Description	hierarchy-closure WebJar for hierarchy-closure
Project URL	http://webjars.org
Source Code Management	https://github.com/ericprud/hierarchy-closure

Download hierarchy-closure

Filename	Size
hierarchy-closure-1.2.1.pom
hierarchy-closure-1.2.1.jar	8 KB
hierarchy-closure-1.2.1-sources.jar	22 bytes
hierarchy-closure-1.2.1-javadoc.jar	22 bytes

How to add to project

Apache Maven

<!-- https://jarcasting.com/artifacts/org.webjars.npm/hierarchy-closure/ -->
<dependency>
    <groupId>org.webjars.npm</groupId>
    <artifactId>hierarchy-closure</artifactId>
    <version>1.2.1</version>
</dependency>

Gradle Groovy

// https://jarcasting.com/artifacts/org.webjars.npm/hierarchy-closure/
implementation 'org.webjars.npm:hierarchy-closure:1.2.1'

Gradle Kotlin

// https://jarcasting.com/artifacts/org.webjars.npm/hierarchy-closure/
implementation ("org.webjars.npm:hierarchy-closure:1.2.1")

Apache Buildr

'org.webjars.npm:hierarchy-closure:jar:1.2.1'

Apache Ivy

<dependency org="org.webjars.npm" name="hierarchy-closure" rev="1.2.1">
  <artifact name="hierarchy-closure" type="jar" />
</dependency>

Groovy Grape

@Grapes(
@Grab(group='org.webjars.npm', module='hierarchy-closure', version='1.2.1')
)

Scala SBT

libraryDependencies += "org.webjars.npm" % "hierarchy-closure" % "1.2.1"

Leiningen

[org.webjars.npm/hierarchy-closure "1.2.1"]

Dependencies

There are no dependencies for this project. It is a standalone project that does not depend on any other jars.

Project Modules

There are no modules declared in this project.

hierarchy-closure

Maintain simple hierarchy by adding members in any order.

install

npm install --save hierarchy-closure

create ()

This constructs a hierarchy.

// create hierarchy
myHierarchy = Hierarchy.create()

add (parent, child)

Adding parent/child pairs builds a structure called myHierarchy.roots with the trees of added parent/child pairs. It also creates two closures:

• parents: a mapping from child to its list of parents.
• children: a mapping from parent to its list of children.

No order dependence

You can fill in your tree in any order and get the same closures:

// populating myHierarchy created above...
// add single entry B->C
myHierarchy.add('B', 'C')
// add single entry B->C
myHierarchy.add('B', 'C')
// add child C->D
myHierarchy.add('C', 'D')
// add disconnected entry F->G
myHierarchy.add('F', 'G')
// add parent E->F
myHierarchy.add('E', 'F')
// add middle D->E
myHierarchy.add('D', 'E')
// add top A->B
myHierarchy.add('A', 'B')
// add bottom G->H
myHierarchy.add('G', 'H')
// add redundant entry (no effect)
myHierarchy.add('A', 'B')

add Exanple Results

{ add: myHierarchy.add,
  roots: {A: {B: {C: {D: {E: {F: {G: {H: {}}}}}}}}},
  parents: {
    A: [],
    B: ['A'],
    C: ['B', 'A'],
    D: ['C', 'B', 'A'],
    E: ['D', 'C', 'B', 'A'],
    F: ['E', 'D', 'C', 'B', 'A'],
    G: ['F', 'E', 'D', 'C', 'B', 'A'],
    H: ['G', 'F', 'E', 'D', 'C', 'B', 'A']
  },
  children: {
    A: ['B', 'C', 'D', 'E', 'F', 'G', 'H'],
    B: ['C', 'D', 'E', 'F', 'G', 'H'],
    C: ['D', 'E', 'F', 'G', 'H'],
    D: ['E', 'F', 'G', 'H'],
    E: ['F', 'G', 'H'],
    F: ['G', 'H'],
    G: ['H'],
    H: []
  }
}

depthFirst (root, (parent, child) => { ... })

This calls you callback function with parent/child pairs starting with any children:

// create hierarchy
h2 = Hierarchy.create()
h2.add('A', 'AB1')
h2.add('AB1', 'AB1C1')
h2.add('AB1C1', 'AB1C1D1')
h2.add('AB1C1', 'AB1C1D2')
h2.add('AB1', 'AB1C2')
h2.add('AB1C2', 'AB1C2D1')
h2.add('A', 'AB2')
h2.add('AB2', 'AB2C1')
h2.add('AB2C1', 'AB2C1D1')
const seen = []
Hierarchy.depthFirst(t.roots, (l, r) => seen.push([l, r]))

depthFirst Example Results

[
  [ "AB1C1D1", "AB1C1" ],
  [ "AB1C1D2", "AB1C1" ],
  [ "AB1C1", "AB1" ],
  [ "AB1C2D1", "AB1C2" ],
  [ "AB1C2", "AB1" ],
  [ "AB1", "A" ],
  [ "AB2C1D1", "AB2C1" ],
  [ "AB2C1", "AB2" ],
  [ "AB2", "A" ]
]

Versions

Version
1.2.1 Jul 11, 2019