When working with JavaFX controls like ListView or TableView, you can populate these controls easily with a setItems method.
However, when working with the TreeView control, you don't have that method and you have to build up your tree directly in the UI layer.
That means, every time, you want to sort the tree or add or remove elements, you have to alter the control directly instead of doing that on an underlying data source.
I wrote some convenient code, which makes this easier. Let's go...
In order to define hierarchical data, we need an interface, which represents the recursive nature of the tree data:
import javafx.collections.ObservableList;
/**
* Used to mark an object as hierarchical data.
* This object can then be used as data source for an hierarchical control, like the {@link javafx.scene.control.TreeView}.
*
* @author Christian Schudt
*/
public interface HierarchyData<T extends HierarchyData> {
/**
* The children collection, which represents the recursive nature of the hierarchy.
* Each child is again a {@link HierarchyData}.
*
* @return A list of children.
*/
ObservableList<T> getChildren();
}
This is used to mark an object as hierarchical data. (By the way, the name was inspired by .NET's HierarchyData.)
The second step is to provide a TreeView control with a setItems method. We just derive from the JavaFX TreeView and add one public method. The data of the TreeView must implement our above mentioned interface:
import extfx.util.HierarchyData;
import javafx.beans.InvalidationListener;
import javafx.beans.Observable;
import javafx.beans.property.ObjectProperty;
import javafx.beans.property.SimpleObjectProperty;
import javafx.beans.value.ChangeListener;
import javafx.beans.value.ObservableValue;
import javafx.collections.FXCollections;
import javafx.collections.ListChangeListener;
import javafx.collections.ObservableList;
import javafx.collections.WeakListChangeListener;
import javafx.scene.control.TreeItem;
import javafx.scene.control.TreeView;
import java.util.HashMap;
import java.util.Map;
/**
* This class extends the {@link TreeView} to use items as a data source.
* <p/>
* This allows you to treat a {@link TreeView} in a similar way as a {@link javafx.scene.control.ListView} or {@link javafx.scene.control.TableView}.
* <p/>
* Each item in the list must implement the {@link HierarchyData} interface, in order to map the recursive nature of the tree data to the tree view.
* <p/>
* Each change in the underlying data (adding, removing, sorting) will then be automatically reflected in the UI.
*
* @author Christian Schudt
*/
public class TreeViewWithItems<T extends HierarchyData<T>> extends TreeView<T> {
/**
* Keep hard references for each listener, so that they don't get garbage collected too soon.
*/
private final Map<TreeItem<T>, ListChangeListener<T>> hardReferences = new HashMap<TreeItem<T>, ListChangeListener<T>>();
/**
* Also store a reference from each tree item to its weak listeners, so that the listener can be removed, when the tree item gets removed.
*/
private final Map<TreeItem<T>, WeakListChangeListener<T>> weakListeners = new HashMap<TreeItem<T>, WeakListChangeListener<T>>();
private ObjectProperty<ObservableList<? extends T>> items = new SimpleObjectProperty<ObservableList<? extends T>>(this, "items");
public TreeViewWithItems() {
super();
init();
}
/**
* Creates the tree view.
*
* @param root The root tree item.
* @see TreeView#TreeView(javafx.scene.control.TreeItem)
*/
public TreeViewWithItems(TreeItem<T> root) {
super(root);
init();
}
/**
* Initializes the tree view.
*/
private void init() {
rootProperty().addListener(new ChangeListener<TreeItem<T>>() {
@Override
public void changed(ObservableValue<? extends TreeItem<T>> observableValue, TreeItem<T> oldRoot, TreeItem<T> newRoot) {
clear(oldRoot);
updateItems();
}
});
setItems(FXCollections.<T>observableArrayList());
// Do not use ChangeListener, because it won't trigger if old list equals new list (but in fact different references).
items.addListener(new InvalidationListener() {
@Override
public void invalidated(Observable observable) {
clear(getRoot());
updateItems();
}
});
}
/**
* Removes all listener from a root.
*
* @param root The root.
*/
private void clear(TreeItem<T> root) {
if (root != null) {
for (TreeItem<T> treeItem : root.getChildren()) {
removeRecursively(treeItem);
}
removeRecursively(root);
root.getChildren().clear();
}
}
/**
* Updates the items.
*/
private void updateItems() {
if (getItems() != null) {
for (T value : getItems()) {
getRoot().getChildren().add(addRecursively(value));
}
ListChangeListener<T> rootListener = getListChangeListener(getRoot().getChildren());
WeakListChangeListener<T> weakListChangeListener = new WeakListChangeListener<T>(rootListener);
hardReferences.put(getRoot(), rootListener);
weakListeners.put(getRoot(), weakListChangeListener);
getItems().addListener(weakListChangeListener);
}
}
/**
* Gets a {@link javafx.collections.ListChangeListener} for a {@link TreeItem}. It listens to changes on the underlying list and updates the UI accordingly.
*
* @param treeItemChildren The associated tree item's children list.
* @return The listener.
*/
private ListChangeListener<T> getListChangeListener(final ObservableList<TreeItem<T>> treeItemChildren) {
return new ListChangeListener<T>() {
@Override
public void onChanged(final Change<? extends T> change) {
while (change.next()) {
if (change.wasUpdated()) {
// http://javafx-jira.kenai.com/browse/RT-23434
continue;
}
if (change.wasRemoved()) {
for (int i = change.getRemovedSize() - 1; i >= 0; i--) {
removeRecursively(treeItemChildren.remove(change.getFrom() + i));
}
}
// If items have been added
if (change.wasAdded()) {
// Get the new items
for (int i = change.getFrom(); i < change.getTo(); i++) {
treeItemChildren.add(i, addRecursively(change.getList().get(i)));
}
}
// If the list was sorted.
if (change.wasPermutated()) {
// Store the new order.
Map<Integer, TreeItem<T>> tempMap = new HashMap<Integer, TreeItem<T>>();
for (int i = change.getTo() - 1; i >= change.getFrom(); i--) {
int a = change.getPermutation(i);
tempMap.put(a, treeItemChildren.remove(i));
}
getSelectionModel().clearSelection();
// Add the items in the new order.
for (int i = change.getFrom(); i < change.getTo(); i++) {
treeItemChildren.add(tempMap.remove(i));
}
}
}
}
};
}
/**
* Removes the listener recursively.
*
* @param item The tree item.
*/
private TreeItem<T> removeRecursively(TreeItem<T> item) {
if (item.getValue() != null && item.getValue().getChildren() != null) {
if (weakListeners.containsKey(item)) {
item.getValue().getChildren().removeListener(weakListeners.remove(item));
hardReferences.remove(item);
}
for (TreeItem<T> treeItem : item.getChildren()) {
removeRecursively(treeItem);
}
}
return item;
}
/**
* Adds the children to the tree recursively.
*
* @param value The initial value.
* @return The tree item.
*/
private TreeItem<T> addRecursively(T value) {
TreeItem<T> treeItem = new TreeItem<T>();
treeItem.setValue(value);
treeItem.setExpanded(true);
if (value != null && value.getChildren() != null) {
ListChangeListener<T> listChangeListener = getListChangeListener(treeItem.getChildren());
WeakListChangeListener<T> weakListener = new WeakListChangeListener<T>(listChangeListener);
value.getChildren().addListener(weakListener);
hardReferences.put(treeItem, listChangeListener);
weakListeners.put(treeItem, weakListener);
for (T child : value.getChildren()) {
treeItem.getChildren().add(addRecursively(child));
}
}
return treeItem;
}
public ObservableList<? extends T> getItems() {
return items.get();
}
/**
* Sets items for the tree.
*
* @param items The list.
*/
public void setItems(ObservableList<? extends T> items) {
this.items.set(items);
}
}
What's the benefit?
Clearly, the benefit is, that you only need to make modifications in the data source rather doing it on the control directly. I found it quite convenient, if you have a lot of hierarchical data, which often changes.
E.g. you can just call FXCollections.sort() and the TreeView updates automatically (of course only the corresponding TreeItem), just like you are used it from ListView.
Theoretically the same could also be applied to a Menu structure.
Hope you find it useful ;)