Tree wrappers

Wrap nodes as a tree.

License	BSD 3-clause License
GroupId	com.mattunderscore.tree.root
ArtifactId	tree-wrappers
Last Version	0.0.9
Release Date	Jul 12, 2015
Type	jar
Description	Tree wrappers Wrap nodes as a tree.

Download tree-wrappers

Filename	Size
tree-wrappers-0.0.9.pom
tree-wrappers-0.0.9.jar	3 KB
tree-wrappers-0.0.9-sources.jar	3 KB
tree-wrappers-0.0.9-javadoc.jar	28 KB

How to add to project

Apache Maven

<!-- https://jarcasting.com/artifacts/com.mattunderscore.tree.root/tree-wrappers/ -->
<dependency>
    <groupId>com.mattunderscore.tree.root</groupId>
    <artifactId>tree-wrappers</artifactId>
    <version>0.0.9</version>
</dependency>

Gradle Groovy

// https://jarcasting.com/artifacts/com.mattunderscore.tree.root/tree-wrappers/
implementation 'com.mattunderscore.tree.root:tree-wrappers:0.0.9'

Gradle Kotlin

// https://jarcasting.com/artifacts/com.mattunderscore.tree.root/tree-wrappers/
implementation ("com.mattunderscore.tree.root:tree-wrappers:0.0.9")

Apache Buildr

'com.mattunderscore.tree.root:tree-wrappers:jar:0.0.9'

Apache Ivy

<dependency org="com.mattunderscore.tree.root" name="tree-wrappers" rev="0.0.9">
  <artifact name="tree-wrappers" type="jar" />
</dependency>

Groovy Grape

@Grapes(
@Grab(group='com.mattunderscore.tree.root', module='tree-wrappers', version='0.0.9')
)

Scala SBT

libraryDependencies += "com.mattunderscore.tree.root" % "tree-wrappers" % "0.0.9"

Leiningen

[com.mattunderscore.tree.root/tree-wrappers "0.0.9"]

Dependencies

compile (1)

Group / Artifact	Type	Version
com.mattunderscore.tree.root : trees-api	jar	0.0.9

Project Modules

There are no modules declared in this project.

#Tree Root

A tree structure and utility library called Tree Root.

####Status This library is sill in an early stage of development. The first major release has not yet been made and the API has not been fixed. No formalised version scheme is currently being followed.

Travis CI:

Coveralls:

Maven site

API Javadoc

####Binary search tree example

final Trees trees = Trees.get();

final SortingTreeBuilder<Integer, BinaryTreeNode<Integer>> builder = trees
    .treeBuilders()
    .sortingTreeBuilder();
final BinarySearchTree<Integer> tree = builder
    .addElement(2)
    .addElement(1)
    .addElement(3)
    .build(BinarySearchTree.<Integer>typeKey());

tree
    .addElement(4)
    .addElement(6)
    .addElement(5);

final Iterator<Integer> iterator = trees
    .treeIterators()
    .inOrderElementsIterator(tree);

while (iterator.hasNext()) {
    System.out.println("Element: " + iterator.next());
}

This example builds a mutable, binary search tree and iterates over the elements in order, left, root, right, generating the output:

Element: 1
Element: 2
Element: 3
Element: 5
Element: 6

####Documentation

• Prior art
• Design principles
• Changelog
• API
  • Definitions
  • Concepts
  • Examples
  • Tree implementations
  • Setup
• SPI
• Custom tree implementations
• Simple collections
• Iterators
• Tree reducers

####Targeted Language

The current target is Java 8. Some Java 8 features are being used in the API.

####License

Copyright (c) 2014, 2015 Matthew Champion

Licensed under BSD 3-clause license

Versions

Version
0.0.9 Jul 12, 2015
0.0.8 Jun 12, 2015
0.0.7 Jun 11, 2015