public void write()

in AsynchronousRatchetingTree/src/main/java/com/facebook/research/asynchronousratchetingtree/art/message/thrift/SetupMessageStruct.java [800:847]

48 lines of code
13 McCabe index (conditional complexity)


    public void write(org.apache.thrift.protocol.TProtocol prot, SetupMessageStruct struct) throws org.apache.thrift.TException {
      org.apache.thrift.protocol.TTupleProtocol oprot = (org.apache.thrift.protocol.TTupleProtocol) prot;
      java.util.BitSet optionals = new java.util.BitSet();
      if (struct.isSetLeafNum()) {
        optionals.set(0);
      }
      if (struct.isSetIdentities()) {
        optionals.set(1);
      }
      if (struct.isSetEphemeralKeys()) {
        optionals.set(2);
      }
      if (struct.isSetKeyExchangeKey()) {
        optionals.set(3);
      }
      if (struct.isSetTree()) {
        optionals.set(4);
      }
      oprot.writeBitSet(optionals, 5);
      if (struct.isSetLeafNum()) {
        oprot.writeI32(struct.leafNum);
      }
      if (struct.isSetIdentities()) {
        {
          oprot.writeI32(struct.identities.size());
          for (java.lang.String _iter9 : struct.identities)
          {
            oprot.writeString(_iter9);
          }
        }
      }
      if (struct.isSetEphemeralKeys()) {
        {
          oprot.writeI32(struct.ephemeralKeys.size());
          for (java.util.Map.Entry<java.lang.Integer, java.lang.String> _iter10 : struct.ephemeralKeys.entrySet())
          {
            oprot.writeI32(_iter10.getKey());
            oprot.writeString(_iter10.getValue());
          }
        }
      }
      if (struct.isSetKeyExchangeKey()) {
        oprot.writeBinary(struct.keyExchangeKey);
      }
      if (struct.isSetTree()) {
        struct.tree.write(oprot);
      }
    }