public boolean verifyIndexes() {
    if (!isPrefixFreeCode(this.forwardIndex.keySet())) {
      return false;
    }
    for (final Entry<Bits, T> e : this.forwardIndex.entrySet()) {
      if (!e.getKey().equals(this.reverseIndex.get(e.getValue()))) {
        return false;
      }
      if (!e.getValue().equals(this.forwardIndex.get(e.getKey()))) {
        return false;
      }
    }
    for (final Entry<T, Bits> e : this.reverseIndex.entrySet()) {
      if (!e.getKey().equals(this.forwardIndex.get(e.getValue()))) {
        return false;
      }
      if (!e.getValue().equals(this.reverseIndex.get(e.getKey()))) {
        return false;
      }
    }
    return this.reverseIndex.size() == this.forwardIndex.size();
  }
public boolean verifyIndexes ( ) { if ( ! isPrefixFreeCode ( this . forwardIndex . keySet ( ) ) ) { return false ; } for ( final Entry < Bits , T > e : this . forwardIndex . entrySet ( ) ) { if ( ! e . getKey ( ) . equals ( this . reverseIndex . get ( e . getValue ( ) ) ) ) { return false ; } if ( ! e . getValue ( ) . equals ( this . forwardIndex . get ( e . getKey ( ) ) ) ) { return false ; } } for ( final Entry < T , Bits > e : this . reverseIndex . entrySet ( ) ) { if ( ! e . getKey ( ) . equals ( this . forwardIndex . get ( e . getValue ( ) ) ) ) { return false ; } if ( ! e . getValue ( ) . equals ( this . reverseIndex . get ( e . getKey ( ) ) ) ) { return false ; } } return this . reverseIndex . size ( ) == this . forwardIndex . size ( ) ; }
Verify indexes boolean.

@return the boolean