import edu.stanford.nlp.util.IdentityHashSet; //导入依赖的package包/类
public EventMention(String objectId, 
    CoreMap sentence,
    Span span,
    String type,
    String subtype,
    ExtractionObject anchor,
    List<ExtractionObject> args,
    List<String> argNames) {
  super(objectId, sentence, span, type, subtype, args, argNames);
  this.anchor = anchor;
  this.parents = new IdentityHashSet<ExtractionObject>();
  
  // set ourselves as the parent of any EventMentions in our args 
  for (ExtractionObject arg : args) {
    if (arg instanceof EventMention) {
      ((EventMention) arg).addParent(this);
    }
  }
}
 

import edu.stanford.nlp.util.IdentityHashSet; //导入依赖的package包/类
/** {@inheritDoc} */
@Override
Iterator<Tree> searchNodeIterator(final Tree t,
                                  final TregexMatcher matcher) {
  return new SearchNodeIterator() {
    private IdentityHashSet<Tree> nodesToSearch;
    private Stack<Tree> searchStack;

    @Override
    public void initialize() {
      nodesToSearch = new IdentityHashSet<Tree>();
      searchStack = new Stack<Tree>();
      initializeHelper(searchStack, t, matcher.getRoot());
      advance();
    }

    private void initializeHelper(Stack<Tree> stack, Tree node, Tree root) {
      if (node==root) {
        return;
      }
      Tree parent = matcher.getParent(node);
      int i = parent.objectIndexOf(node);
      while (i == parent.children().length-1 && parent != root) {
        node = parent;
        parent = matcher.getParent(parent);
        i = parent.objectIndexOf(node);
      }
      Tree followingNode;
      if (i+1 < parent.children().length) {
        followingNode = parent.children()[i+1];
      } else {
        followingNode = null;
      }
      while (followingNode != null) {
        //System.err.println("adding to stack node " + followingNode.toString());
        if (! nodesToSearch.contains(followingNode)) {
          stack.add(followingNode);
          nodesToSearch.add(followingNode);
        }
        if (pathMatchesNode(followingNode)) {
          initializeHelper(stack, followingNode, root);
        }
        if (! followingNode.isLeaf()) {
          followingNode = followingNode.children()[0];
        } else {
          followingNode = null;
        }
      }
    }

    @Override
    void advance() {
      if (searchStack.isEmpty()) {
        next = null;
      } else {
        next = searchStack.pop();
      }
    }
  };
}
 

import edu.stanford.nlp.util.IdentityHashSet; //导入依赖的package包/类
public void removeArgument(ExtractionObject argToRemove, boolean removeParent) {
  Set<ExtractionObject> thisEvent = new IdentityHashSet<ExtractionObject>();
  thisEvent.add(argToRemove);
  removeArguments(thisEvent, removeParent);
}