Searched refs:maXAccessibleToNode (Results 1 – 1 of 1) sorted by relevance
38 maXAccessibleToNode = new HashMap (); in NodeMap()45 maXAccessibleToNode.clear(); in Clear()54 AccessibleTreeNode aPreviousNode = (AccessibleTreeNode)maXAccessibleToNode.put ( in InsertNode()66 maXAccessibleToNode.remove (((AccTreeNode)aNode).getContext()); in RemoveNode()80 Object[] aNodes = maXAccessibleToNode.values().toArray(); in ForEach()101 return (AccessibleTreeNode)maXAccessibleToNode.get (xContext); in GetNode()122 return maXAccessibleToNode.containsKey(xContext); in IsMember()127 return maXAccessibleToNode.containsValue(aNode); in ValueIsMember()132 private HashMap maXAccessibleToNode; field in NodeMap
Completed in 14 milliseconds