ea.getNode(), eb.getNode()  );
ea.getNode() != START ? ea.getNode() : null , eb.getNode() != START ? eb.getNode() : null  );
  private boolean checkOtherHangons(MergeEntry ea, MergeEntry eb, MergeList mla, MergeList mlb ) {    boolean hangonsAreEqual = false;    if( ea.getHangonCount() > 0 ) {      // Check if the hangons match _exactly_ (no inserts, and exactly same sequence of copies)      // Then we can include the hangons just once. This resembles the case when content of      // two nodes has been updated the same way... not a conflict, but maybe suspicious      if( eb.getHangonCount() == ea.getHangonCount() ) {        hangonsAreEqual = true;        for(int i=0;hangonsAreEqual && i<ea.getHangonCount();i++)          hangonsAreEqual = matches( eb.getHangon(i).getNode(),  ea.getHangon(i).getNode() );      }      // Both have hangons,      // add CONFLICTCODE here      // for now, chain A and B hangons      if( hangonsAreEqual )        // Need: add with explicit childpos        // How should we encode the inserts, i.e. tell which nodes were inserted        clog.addListWarning(ConflictLog.INSERT,"Equal insertions/copies in both branches after the context nodes.",          ea.getNode().getBaseMatch() != null ? ea.getNode().getBaseMatch() : eb.getNode().getBaseMatch(),          ea.getNode(), eb.getNode() /*, mla, mlb*/ );        //System.out.println(); // as updated(or A if no update)-Other");      else        clog.addListWarning(ConflictLog.INSERT,"Insertions/copies in both branches after the context nodes. Sequencing the insertions.",          ea.getNode().getBaseMatch() != null ? ea.getNode().getBaseMatch() : eb.getNode().getBaseMatch(),          ea.getNode(), eb.getNode() /*, mla, mlb*/ );//            System.out.println("CONFLICTW; both nodes have hangons; sequencing them"); // as updated(or A if no update)-Other");/*        System.out.println("First list:");      mlistA.print();      System.out.println("Second list:");      mlistB.print();*/    }    return hangonsAreEqual;  }