Tree Root SPI

Provides an API for implementing services.

Лицензия

Лицензия

Группа

Группа

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

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

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

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

0.0.9
Дата

Дата

Тип

Тип

jar
Описание

Описание

Tree Root SPI
Provides an API for implementing services.

Скачать trees-spi

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

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

Зависимости

compile (1)

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

test (2)

Идентификатор библиотеки Тип Версия
junit : junit jar 4.12
org.mockito : mockito-all jar 1.10.19

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

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

#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