@Override public boolean addAll(int index, Collection<? extends TreeNode> collection) { Iterator<TreeNode> elements = (new ArrayList<TreeNode>(collection)).iterator(); boolean changed = false; while (elements.hasNext()) { TreeNode node = elements.next(); if (node == null) { throw new NullPointerException(); } else { eraseParent(node); super.add(index++, node); node.setParent(parent); changed = true; } } if (changed) { updateRowKeys(parent); } return (changed); }
@Override public boolean add(TreeNode node) { if (node == null) { throw new NullPointerException(); } else { eraseParent(node); boolean result = super.add(node); node.setParent(parent); updateRowKeys(parent); return result; } }
@Override public boolean addAll(Collection<? extends TreeNode> collection) { Iterator<TreeNode> elements = (new ArrayList<TreeNode>(collection)).iterator(); boolean changed = false; while (elements.hasNext()) { TreeNode node = elements.next(); if (node == null) { throw new NullPointerException(); } else { eraseParent(node); super.add(node); node.setParent(parent); changed = true; } } if (changed) { updateRowKeys(parent); } return (changed); }
@Override public void add(int index, TreeNode node) { if (node == null) { throw new NullPointerException(); } else if ((index < 0) || (index > size())) { throw new IndexOutOfBoundsException(); } else { eraseParent(node); super.add(index, node); node.setParent(parent); updateRowKeys(parent); } }
@Override public TreeNode set(int index, TreeNode node) { if (node == null) { throw new NullPointerException(); } else if ((index < 0) || (index >= size())) { throw new IndexOutOfBoundsException(); } else { if (!parent.equals(node.getParent())) { eraseParent(node); } TreeNode previous = get(index); super.set(index, node); previous.setParent(null); node.setParent(parent); updateRowKeys(parent); return previous; } }
/** * Optimized set implementation to be used in sorting * * @param index index of the element to replace * @param node node to be stored at the specified position * @return the node previously at the specified position */ @Override public TreeNode setSibling(int index, TreeNode node) { if (node == null) { throw new NullPointerException(); } else if ((index < 0) || (index >= size())) { throw new IndexOutOfBoundsException(); } else { if (!parent.equals(node.getParent())) { eraseParent(node); } TreeNode previous = get(index); super.set(index, node); node.setParent(parent); updateRowKeys(parent); return previous; } }
@Override public boolean addAll(Collection<? extends TreeNode> collection) { Iterator<TreeNode> elements = (new ArrayList<TreeNode>(collection)).iterator(); boolean changed = false; while (elements.hasNext()) { TreeNode node = elements.next(); if (node == null) { throw new NullPointerException(); } else { eraseParent(node); super.add(node); node.setParent(parent); changed = true; } } if (changed) { updateRowKeys(parent); } return (changed); }
@Override public boolean addAll(int index, Collection<? extends TreeNode> collection) { Iterator<TreeNode> elements = (new ArrayList<TreeNode>(collection)).iterator(); boolean changed = false; while (elements.hasNext()) { TreeNode node = elements.next(); if (node == null) { throw new NullPointerException(); } else { eraseParent(node); super.add(index++, node); node.setParent(parent); changed = true; } } if (changed) { updateRowKeys(parent); } return (changed); }
@Override public boolean add(TreeNode node) { if (node == null) { throw new NullPointerException(); } else { eraseParent(node); boolean result = super.add(node); node.setParent(parent); updateRowKeys(parent); return result; } }
@Override public void add(int index, TreeNode node) { if (node == null) { throw new NullPointerException(); } else if ((index < 0) || (index > size())) { throw new IndexOutOfBoundsException(); } else { eraseParent(node); super.add(index, node); node.setParent(parent); updateRowKeys(parent); } }
/** * Optimized set implementation to be used in sorting * * @param index index of the element to replace * @param node node to be stored at the specified position * @return the node previously at the specified position */ public TreeNode setSibling(int index, TreeNode node) { if (node == null) { throw new NullPointerException(); } else if ((index < 0) || (index >= size())) { throw new IndexOutOfBoundsException(); } else { if (!parent.equals(node.getParent())) { eraseParent(node); } TreeNode previous = get(index); super.set(index, node); node.setParent(parent); updateRowKeys(parent); return previous; } }
@Override public TreeNode set(int index, TreeNode node) { if (node == null) { throw new NullPointerException(); } else if ((index < 0) || (index >= size())) { throw new IndexOutOfBoundsException(); } else { if (!parent.equals(node.getParent())) { eraseParent(node); } TreeNode previous = get(index); super.set(index, node); previous.setParent(null); node.setParent(parent); updateRowKeys(parent); return previous; } }