public R(Node n) { this.clazzName = n.getType().getName(); this.children = n.children; if (n.items instanceof LinkedHashSet || (n.items == null)) { this.items = n.items; } else { this.items = new LinkedHashSet<Pair>(n.items); } }
Iterator it; Class type = n.getType();
notify.add(node.getType());
public R(Node n) { this.clazzName = n.getType().getName(); this.children = n.children; if (n.items instanceof LinkedHashSet || (n.items == null)) { this.items = n.items; } else { this.items = new LinkedHashSet<Pair>(n.items); } }
public R (Node n) { this.clazzName = n.getType ().getName(); this.children = n.children; if (n.items instanceof ArrayList || n.items == null) { this.items = (ArrayList)n.items; } else { this.items = new ArrayList (n.items); } }
/** Removes an item. */ public void remove(AbstractLookup.Pair item, ArrayList<Class> affected) { Node n = removeClass(object, item); if (n != null) { affected.add(n.getType()); } removeInterface(item, affected); }
/** Removes an item. */ public void remove(AbstractLookup.Pair item, ArrayList<Class> affected) { Node n = removeClass(object, item); if (n != null) { affected.add(n.getType()); } removeInterface(item, affected); }
public R(Node n) { this.clazzName = n.getType().getName(); this.children = n.children; if (n.items instanceof LinkedHashSet || (n.items == null)) { this.items = n.items; } else { this.items = new LinkedHashSet<Pair>(n.items); } }
if (n.getType() == clazz) {
/** Adds an item into the tree. * @param item to add * @return true if the Item has been added for the first time or false if some other * item equal to this one already existed in the lookup */ public boolean add(AbstractLookup.Pair<?> item, ArrayList<Class> affected) { Node node = registerClass(object, item); affected.add(node.getType()); if (node.assignItem(this, item)) { // this is the first item added to n.items // ok, we have to test interfaces too } else { // equal item is already there => stop processing return false; } boolean registeredAsInterface = registerInterface(item, affected); return registeredAsInterface; }
/** Removes an item. */ public void remove(AbstractLookup.Pair item, ArrayList<Class> affected) { Node n = removeClass(object, item); if (n != null) { affected.add(n.getType()); } removeInterface(item, affected); }