info +=a.getContent().getInfoSize();
info +=base.getContent().getInfoSize();
  private int findCopyTree( BranchNode a, BaseNode base, boolean remove ) {    int info = 0;    if( a.getBaseMatch() == base && base.getLeft().getMatches().size() > 1 ) {      if( remove )        delMatching(a,base);      else       info +=a.getContent().getInfoSize();  // a is a n:th copy of base      if( a.getChildCount() == base.getChildCount() ) {        for( int i=0;i<a.getChildCount();i++) {          info += findCopyTree(a.getChild(i),base.getChild(i),remove);          info += EDGE_BYTES; // 8 bytes for each edge        }      }    }    return info;  }