byte[] buf = new byte[bodyLen];
        int pos = 0;

        // structureSize (LE) - includes 1 byte of the variable part
        SMBUtil.writeInt2(49, buf, pos);
        pos += 2;
        // 2 reserved bytes
        pos += 2;
        // ctlCode
        SMBUtil.writeInt4(ctlCode, buf, pos);
        pos += 4;
        // fileId (16 bytes)
        byte[] fid = fileId != null ? fileId : new byte[16];

        dstIndex += 8;
        SMBUtil.writeInt8(this.targetOffset, dst, dstIndex);
        dstIndex += 8;
        SMBUtil.writeInt4(this.length, dst, dstIndex);
        dstIndex += 4;
        dstIndex += 4; // reserved
        return dstIndex - start;
    }

    /**
     * {@inheritDoc}
     *
     * @see jcifs.Encodable#size()
     */
    @Override
    public int size() {
        return 24;
    }

        System.arraycopy(this.sourceKey, 0, dst, dstIndex, 24);
        dstIndex += 24;

        SMBUtil.writeInt4(this.chunks.length, dst, dstIndex);
        dstIndex += 4;

        dstIndex += 4; // Reserved

        for (final SrvCopychunk chk : this.chunks) {
            dstIndex += chk.encode(dst, dstIndex);
        }
        return dstIndex - start;
    }

    /**
     * {@inheritDoc}
     *

## Contributors

[Thank you](https://github.com/go-gorm/gorm/graphs/contributors) for contributing to the GORM framework!

## License

© Jinzhu, 2013~time.Now

        dstIndex += 2;

        SMBUtil.writeInt2(4, dst, dstIndex); // NameLength
        dstIndex += 2;

        SMBUtil.writeInt2(0, dst, dstIndex); // Reserved
        dstIndex += 2;

        SMBUtil.writeInt2(24, dst, dstIndex); // DataOffset (from start of context)
        dstIndex += 2;

        SMBUtil.writeInt4(STRUCTURE_SIZE, dst, dstIndex); // DataLength

                List<E> list = new ArrayList<>();
                for (E e : delegate.order(insertionOrder)) {
                  list.add(e);
                }
                Collections.reverse(list);
                return list;
              }

              @Override
              public Set<E> create(Object... elements) {

	if ns.SingularTable {
		return ns.TablePrefix + ns.toDBName(str)
	}
	return ns.TablePrefix + inflection.Plural(ns.toDBName(str))
}

// SchemaName generate schema name from table name, don't guarantee it is the reverse value of TableName
func (ns NamingStrategy) SchemaName(table string) string {
	table = strings.TrimPrefix(table, ns.TablePrefix)

	if ns.SingularTable {
		return ns.toSchemaName(table)
	}

      ArrayList<LockGraphNode> acquiredLockList = requireNonNull(acquiredLocks.get());
      LockGraphNode node = lock.getLockGraphNode();
      // Iterate in reverse because locks are usually locked/unlocked in a
      // LIFO order.
      for (int i = acquiredLockList.size() - 1; i >= 0; i--) {
        if (acquiredLockList.get(i) == node) {
          acquiredLockList.remove(i);

 * ListenableFuture} directly.
 *
 * @author Sven Mawson
 * @author Nishant Thakkar
 * @since 1.0
 */
/*
 * Some of the annotations below were added after we released our separate
 * com.google.guava:listenablefuture:1.0 artifact. (For more on that artifact, see
 * https://github.com/google/guava/releases/tag/v27.0) This means that the copy of ListenableFuture

 * ListenableFuture} directly.
 *
 * @author Sven Mawson
 * @author Nishant Thakkar
 * @since 1.0
 */
/*
 * Some of the annotations below were added after we released our separate
 * com.google.guava:listenablefuture:1.0 artifact. (For more on that artifact, see
 * https://github.com/google/guava/releases/tag/v27.0) This means that the copy of ListenableFuture