final int range = max - min;
    final int s1 = min + (1 * range) / 4;
    final int s2 = min + (2 * range) / 4;
    final int s3 = min + (3 * range) / 4;
    final char[] dst = new char[12];

    // Put surrogate pairs at odd indices so they can be split easily
    dst[0] = 'x';
    Character.toChars(min, dst, 1);
    Character.toChars(s1, dst, 3);
    Character.toChars(s2, dst, 5);

  }

  @VisibleForTesting
  static long murmurHash64WithSeed(byte[] bytes, int offset, int length, long seed) {
    long mul = K3;
    int topBit = 0x7;

    int lengthAligned = length & ~topBit;
    int lengthRemainder = length & topBit;
    long hash = seed ^ (length * mul);

    for (int i = 0; i < lengthAligned; i += 8) {
      long loaded = load64(bytes, offset + i);

    SmbComWriteAndXResponse() {
    }

    int writeParameterWordsWireFormat( byte[] dst, int dstIndex ) {
        return 0;
    }
    int writeBytesWireFormat( byte[] dst, int dstIndex ) {
        return 0;
    }
    int readParameterWordsWireFormat( byte[] buffer, int bufferIndex ) {
        count = readInt2( buffer, bufferIndex ) & 0xFFFFL;
        return 8;
    }
    int readBytesWireFormat( byte[] buffer, int bufferIndex ) {

  }

  @Benchmark
  public long timeComplete_Normal(int reps) throws Exception {
    long r = 0;
    List<Facade<Integer>> list = new ArrayList<>(reps);
    for (int i = 0; i < reps; i++) {
      final Facade<Integer> localFuture = impl.newFacade();
      list.add(localFuture);
      localFuture.set(i);
    }
    for (int i = 0; i < reps; i++) {
      r += list.get(i).get();
    }
    return r;
  }

    protected int ptype = -1;
    protected int flags = 0;
    protected int length = 0;
    protected int call_id = 0;
    protected int alloc_hint = 0;
    protected int result = 0;


    /**
     * 
     * @param flag
     * @return whether flag is set
     */
    public boolean isFlagSet ( int flag ) {
        return ( this.flags & flag ) == flag;
    }

    name: str = Field(index=True)
    age: int | None = Field(default=None, index=True)


class Hero(HeroBase, table=True):
    id: int | None = Field(default=None, primary_key=True)
    secret_name: str


class HeroPublic(HeroBase):
    id: int


class HeroCreate(HeroBase):
    secret_name: str


class HeroUpdate(HeroBase):
    name: str | None = None
    age: int | None = None

    }


    @Override
    int writeBodyWireFormat ( byte[] dst, int dstIndex ) {
        return writeQuestionSectionWireFormat(dst, dstIndex);
    }


    @Override
    int readBodyWireFormat ( byte[] src, int srcIndex ) {
        return readQuestionSectionWireFormat(src, srcIndex);
    }


    @Override
    int writeRDataWireFormat ( byte[] dst, int dstIndex ) {
        return 0;
    }

/**
 * @author mbechler
 *
 */
public class ByteEncodable implements Encodable {

    private byte[] bytes;
    private int off;
    private int len;


    /**
     * @param b
     * @param off
     * @param len
     */
    public ByteEncodable ( byte[] b, int off, int len ) {
        this.bytes = b;
        this.off = off;
        this.len = len;
    }


    /**
     * {@inheritDoc}

All `go/types` data structures that expose sequences using a pair of
methods such as `Len() int` and `At(int) T` now also methods that
return iterators, allowing you to simplify code such as this:

```go
params := fn.Type.(*types.Signature).Params()
for i := 0; i < params.Len(); i++ {
   use(params.At(i))
}
```

to this:

```go
for param := range fn.Signature().Params().Variables() {
   use(param)
}
```

      return transferElement(nextElements, previousElements);
    }

    @Override
    public int nextIndex() {
      return previousElements.size();
    }

    @Override
    public E previous() {
      return transferElement(previousElements, nextElements);
    }

    @Override
    public int previousIndex() {
      return nextIndex() - 1;
    }

    @Override
    public void remove() {