public int compareTo()

in AsynchronousRatchetingTree/src/main/java/com/facebook/research/asynchronousratchetingtree/dhratchet/message/thrift/DHRatchetSetupMessageStruct.java [369:407]

37 lines of code
11 McCabe index (conditional complexity)


  public int compareTo(DHRatchetSetupMessageStruct other) {
    if (!getClass().equals(other.getClass())) {
      return getClass().getName().compareTo(other.getClass().getName());
    }

    int lastComparison = 0;

    lastComparison = java.lang.Boolean.valueOf(isSetPeerNum()).compareTo(other.isSetPeerNum());
    if (lastComparison != 0) {
      return lastComparison;
    }
    if (isSetPeerNum()) {
      lastComparison = org.apache.thrift.TBaseHelper.compareTo(this.peerNum, other.peerNum);
      if (lastComparison != 0) {
        return lastComparison;
      }
    }
    lastComparison = java.lang.Boolean.valueOf(isSetIdentityKey()).compareTo(other.isSetIdentityKey());
    if (lastComparison != 0) {
      return lastComparison;
    }
    if (isSetIdentityKey()) {
      lastComparison = org.apache.thrift.TBaseHelper.compareTo(this.identityKey, other.identityKey);
      if (lastComparison != 0) {
        return lastComparison;
      }
    }
    lastComparison = java.lang.Boolean.valueOf(isSetEphemeralKey()).compareTo(other.isSetEphemeralKey());
    if (lastComparison != 0) {
      return lastComparison;
    }
    if (isSetEphemeralKey()) {
      lastComparison = org.apache.thrift.TBaseHelper.compareTo(this.ephemeralKey, other.ephemeralKey);
      if (lastComparison != 0) {
        return lastComparison;
      }
    }
    return 0;
  }