Merge commit '42b2e5ca519766e37ce6941ba4faecc9691cc403' into upstream

[debian/openrocket] / android-libraries / TreeViewList / src / pl / polidea / treeview / InMemoryTreeNode.java

diff --git a/android-libraries/TreeViewList/src/pl/polidea/treeview/InMemoryTreeNode.java b/android-libraries/TreeViewList/src/pl/polidea/treeview/InMemoryTreeNode.java
new file mode 100644 (file)
index 0000000..6035369
--- /dev/null
+++ b/android-libraries/TreeViewList/src/pl/polidea/treeview/InMemoryTreeNode.java
@@ -0,0 +1,116 @@
+package pl.polidea.treeview;
+
+import java.io.Serializable;
+import java.util.LinkedList;
+import java.util.List;
+
+/**
+ * Node. It is package protected so that it cannot be used outside.
+ * 
+ * @param <T>
+ *            type of the identifier used by the tree
+ */
+class InMemoryTreeNode<T> implements Serializable {
+    private static final long serialVersionUID = 1L;
+    private final T id;
+    private final T parent;
+    private final int level;
+    private boolean visible = true;
+    private final List<InMemoryTreeNode<T>> children = new LinkedList<InMemoryTreeNode<T>>();
+    private List<T> childIdListCache = null;
+
+    public InMemoryTreeNode(final T id, final T parent, final int level,
+            final boolean visible) {
+        super();
+        this.id = id;
+        this.parent = parent;
+        this.level = level;
+        this.visible = visible;
+    }
+
+    public int indexOf(final T id) {
+        return getChildIdList().indexOf(id);
+    }
+
+    /**
+     * Cache is built lasily only if needed. The cache is cleaned on any
+     * structure change for that node!).
+     * 
+     * @return list of ids of children
+     */
+    public synchronized List<T> getChildIdList() {
+        if (childIdListCache == null) {
+            childIdListCache = new LinkedList<T>();
+            for (final InMemoryTreeNode<T> n : children) {
+                childIdListCache.add(n.getId());
+            }
+        }
+        return childIdListCache;
+    }
+
+    public boolean isVisible() {
+        return visible;
+    }
+
+    public void setVisible(final boolean visible) {
+        this.visible = visible;
+    }
+
+    public int getChildrenListSize() {
+        return children.size();
+    }
+
+    public synchronized InMemoryTreeNode<T> add(final int index, final T child,
+            final boolean visible) {
+        childIdListCache = null;
+        // Note! top levell children are always visible (!)
+        final InMemoryTreeNode<T> newNode = new InMemoryTreeNode<T>(child,
+                getId(), getLevel() + 1, getId() == null ? true : visible);
+        children.add(index, newNode);
+        return newNode;
+    }
+
+    /**
+     * Note. This method should technically return unmodifiable collection, but
+     * for performance reason on small devices we do not do it.
+     * 
+     * @return children list
+     */
+    public List<InMemoryTreeNode<T>> getChildren() {
+        return children;
+    }
+
+    public synchronized void clearChildren() {
+        children.clear();
+        childIdListCache = null;
+    }
+
+    public synchronized void removeChild(final T child) {
+        final int childIndex = indexOf(child);
+        if (childIndex != -1) {
+            children.remove(childIndex);
+            childIdListCache = null;
+        }
+    }
+
+    @Override
+    public String toString() {
+        return "InMemoryTreeNode [id=" + getId() + ", parent=" + getParent()
+                + ", level=" + getLevel() + ", visible=" + visible
+                + ", children=" + children + ", childIdListCache="
+                + childIdListCache + "]";
+    }
+
+    T getId() {
+        return id;
+    }
+
+    T getParent() {
+        return parent;
+    }
+
+    int getLevel() {
+        return level;
+    }
+
+}
\ No newline at end of file