-
Notifications
You must be signed in to change notification settings - Fork 3
Home
Add script to you webpage
<script src="../lib/arboreal.min.js" type="text/javascript"></script>
Arboreal.js provides a set of methods for parsing, manipulating, and traversing tree like data structures. A tree can be created from scratch and then extended with child elements.
var tree = new Arboreal(null, {category: 'JavaScript'});
tree.appendChild({category: 'Ajax (programming)'})
.appendChild({category: 'JavaScript engines'})
.appendChild({category: 'JavaScript programming languages family'})
.children[2]
.appendChild({category: 'JavaScript dialect engines'})
.parent
.appendChild({category: 'JavaScript based calendar components'})
.appendChild({category: 'JavaScript based HTML editors'});
For each child node, Arboreal.js will automatically assign an id string representing the depth and the index the position of the node within the tree structure.
0 {"category":"JavaScript"}
|- 0/0 {"category":"Ajax (programming)"}
|- 0/1 {"category":"JavaScript engines"}
|- 0/2 {"category":"JavaScript programming languages family"}
|- 0/2/0 {"category":"JavaScript dialect engines"}
|- 0/3 {"category":"JavaScript based calendar components"}
|- 0/4 {"category":"JavaScript based HTML editors"}
Alternatively, Arboreal.js can also parse an existing object into a tree (though it will need to know the name of the 'children' attribute).
var wikipediaJsCategory = {
category: 'JavaScript',
subcategories: [
{category: 'Ajax (programming)'},
{category: 'JavaScript engines'},
{category: 'JavaScript programming languages family',
subcategories: [{
category: 'JavaScript dialect engines'
}]
},
{category: 'JavaScript based calendar components'},
{category: 'JavaScript based HTML editors'}
]
};
var tree = Arboreal.parse(wikipediaJsCategory, 'subcategories');
console.log(tree.toString(true));
returns:
0 {"category":"JavaScript"}
|- 0/0 {"category":"Ajax (programming)"}
|- 0/1 {"category":"JavaScript engines"}
|- 0/2 {"category":"JavaScript programming languages family"}
|- 0/2/0 {"category":"JavaScript dialect engines"}
|- 0/3 {"category":"JavaScript based calendar components"}
|- 0/4 {"category":"JavaScript based HTML editors"}
Also several children (or even the whole tree) can be added at the same time (syntax is similar as parse)
tree.children[1].appendChildren({category:'C#', subitems:[{category:'WPF'}]}, "subitems" );
console.log(tree.toString(true));
returns:
0 {"category":"JavaScript"}
|- 0/0 {"category":"Ajax (programming)"}
|- 0/1 {"category":"JavaScript engines"}
|- 0/1/0 {"category":"C#"}
|- 0/1/0/0 {"category":"WPF"}
|- 0/2 {"category":"JavaScript programming languages family"}
|- 0/2/0 {"category":"JavaScript dialect engines"}
|- 0/3 {"category":"JavaScript based calendar components"}
|- 0/4 {"category":"JavaScript based HTML editors"}
An Arboreal.js object can be traversed either upwards or downwards. To do so, you need to use iterator function, like that:
function iterator (node) {
var depth = "", i;
for (i = 1; i <= node.depth; i++) depth += ">>";
console.log([depth, node.data.category].join(" "));
}
tree.traverseDown(iterator);
returns:
JavaScript
>> Ajax (programming)
>> JavaScript engines
>> JavaScript programming languages family
>>>> JavaScript dialect engines
>> JavaScript based calendar components
>> JavaScript based HTML editors
tree.children[2].traverseUp(iterator);
>> JavaScript programming languages family
>>>> JavaScript dialect engines
JavaScript
>> Ajax (programming)
>> JavaScript engines
>> JavaScript based calendar components
>> JavaScript based HTML editors
Note that in both the traverseDown
and the traverseUp
methods, the
value of this
in the iterator is bound to the value of the
currently traversed node
. Our iterator function can in fact be
rewritten as:
function iterator () {
var depth = "", i;
for (i = 1; i <= this.depth; i++) depth += ">>";
console.log([depth, this.data.category].join(" "));
}
What if we want to build HTML list from our tree? It not big deal, but there a catch - we need a way to close tags. So here solution for it:
var rowStr = "<ul>";
var wikipediaJsCategory = {
category: 'JavaScript',
subcategories: [
{category: 'Ajax (programming)'},
{category: 'JavaScript engines'},
{category: 'JavaScript programming languages family',
subcategories: [{
category: 'JavaScript dialect engines'
}]
},
{category: 'JavaScript based calendar components'},
{category: 'JavaScript based HTML editors'}
]
};
var tree = Arboreal.parse(wikipediaJsCategory, 'subcategories');
function iterator(node) {
if (node.children.length > 0)
{
rowStr += '';
rowStr += '<li class="jstree-open">' + node.data.category + '<ul>';
} else
{
rowStr += '<li>' + node.data.category + '</li>';
}
}
function iteratorAfter(node) {
if (node.children.length > 0)
{
rowStr += '</ul></li>';
}
}
tree.traverseDown(iterator, iteratorAfter);
rowStr += "</ul>";
Check this demo to see how it works.
Arboreal object can be iterated up to the root using method 'bubbleUp':
tree.children[2].children[0].bubbleUp(iterator)
>>>> JavaScript dialect engines
>> JavaScript programming languages family
JavaScript
In order to search for a single node into an arboreal object, one can use the find
method.
tree.find(function (node) {
return (/calendar/).test(node.data.category)
}).data.category;
returns:
JavaScript based calendar components
The find method will also accept a string as an argument. In that case, it will try to find a node by id.
tree.find("0/2/0").data.category
JavaScript dialect engines
You can use node id to get actual Arboreal.js object. To do so use
.path()
function
tree.path("/2/0").data.category
returns:
JavaScript dialect engines
If you use different separator for Id's then you must pass it as second parameter
tree.path("_2_0","_").data.category
returns:
JavaScript dialect engines
While traversing a tree, nodes can be deleted by calling the remove
method on the node object bound to the iterator function.
tree.length;
// => 7
tree.traverseDown(function (item) {
var toDelete = 'JavaScript programming languages family';
if (item.data.category === toDelete) {
this.remove();
}
});
tree.length;
// 5