String tree support

Provides support specifically for string based trees and nodes.

Лицензия

Лицензия

Группа

Группа

com.mattunderscore.tree.root
Идентификатор

Идентификатор

string-trees
Последняя версия

Последняя версия

0.0.9
Дата

Дата

Тип

Тип

jar
Описание

Описание

String tree support
Provides support specifically for string based trees and nodes.

Скачать string-trees

Как подключить последнюю версию

<!-- https://jarcasting.com/artifacts/com.mattunderscore.tree.root/string-trees/ -->
<dependency>
    <groupId>com.mattunderscore.tree.root</groupId>
    <artifactId>string-trees</artifactId>
    <version>0.0.9</version>
</dependency>
// https://jarcasting.com/artifacts/com.mattunderscore.tree.root/string-trees/
implementation 'com.mattunderscore.tree.root:string-trees:0.0.9'
// https://jarcasting.com/artifacts/com.mattunderscore.tree.root/string-trees/
implementation ("com.mattunderscore.tree.root:string-trees:0.0.9")
'com.mattunderscore.tree.root:string-trees:jar:0.0.9'
<dependency org="com.mattunderscore.tree.root" name="string-trees" rev="0.0.9">
  <artifact name="string-trees" type="jar" />
</dependency>
@Grapes(
@Grab(group='com.mattunderscore.tree.root', module='string-trees', version='0.0.9')
)
libraryDependencies += "com.mattunderscore.tree.root" % "string-trees" % "0.0.9"
[com.mattunderscore.tree.root/string-trees "0.0.9"]

Зависимости

compile (1)

Идентификатор библиотеки Тип Версия
com.mattunderscore.tree.root : trees-immutable jar 0.0.9

test (1)

Идентификатор библиотеки Тип Версия
junit : junit jar 4.12

Модули Проекта

Данный проект не имеет модулей.

#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: Build Status

Coveralls: Coverage Status

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

####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

Версии библиотеки

Версия
0.0.9
0.0.8
0.0.7