int len = 2 + 2 + der.length + 4 + nb.length;
        byte[] out = new byte[len];
        int i = 0;
        out[i++] = 0x04; // TOK_ID[0]
        out[i++] = 0x01; // TOK_ID[1]
        out[i++] = (byte) ((der.length >> 8) & 0xFF);
        out[i++] = (byte) (der.length & 0xFF);
        System.arraycopy(der, 0, out, i, der.length);
        i += der.length;
        out[i++] = (byte) ((nb.length >> 24) & 0xFF);

     * of this method.
     */
    void putAll(LockFreeBitArray other) {
      checkArgument(
          data.length() == other.data.length(),
          "BitArrays must be of equal length (%s != %s)",
          data.length(),
          other.data.length());
      for (int i = 0; i < data.length(); i++) {
        putData(i, other.data.get(i));
      }
    }

    /**

    // step through the CharSequence 2 chars at a time
    for (int i = 1; i < input.length(); i += 2) {
      int k1 = input.charAt(i - 1) | (input.charAt(i) << 16);
      k1 = mixK1(k1);
      h1 = mixH1(h1, k1);
    }

    // deal with any remaining characters
    if ((input.length() & 1) == 1) {
      int k1 = input.charAt(input.length() - 1);
      k1 = mixK1(k1);
      h1 ^= k1;
    }

        // Combine all data
        int totalLength = avFlagsData.length + avTimestampData.length + avTargetNameData.length + eolData.length;
        byte[] fullData = new byte[totalLength];
        int pos = 0;
        System.arraycopy(avFlagsData, 0, fullData, pos, avFlagsData.length);
        pos += avFlagsData.length;
        System.arraycopy(avTimestampData, 0, fullData, pos, avTimestampData.length);
        pos += avTimestampData.length;

    assertTrue(x != y);
    assertEquals(x.length(), y.length());
    for (int i = 0; i < SIZE; i++) {
      assertBitEquals(x.get(i), y.get(i));
    }

    AtomicDoubleArray a = new AtomicDoubleArray(VALUES);
    AtomicDoubleArray b = serialClone(a);
    assertFalse(a.equals(b));
    assertFalse(b.equals(a));
    assertEquals(a.length(), b.length());
    for (int i = 0; i < VALUES.length; i++) {

            final String[] values = entry.getValue();
            if (values == null) {
                // nothing
            } else if (values.length == 1) {
                queryBuf.append(' ').append(key).append(":\"").append(values[0]).append('\"');
            } else if (values.length > 1) {
                boolean first = true;
                queryBuf.append(" (");
                for (final String value : values) {

      return delegate.order(insertionOrder);
    }

    @Override
    public K[] createKeyArray(int length) {
      return delegate.createKeyArray(length);
    }

    @Override
    public V[] createValueArray(int length) {
      return delegate.createValueArray(length);
    }

    @Override
    public SampleElements<Entry<K, V>> samples() {
      return delegate.samples();
    }

     *
     * @param rus wrapped string
     * @param zterm whether the string should be zero terminated
     */
    public UnicodeString(final rpc.unicode_string rus, final boolean zterm) {
        this.length = rus.length;
        this.maximum_length = rus.maximum_length;
        this.buffer = rus.buffer;
        this.zterm = zterm;
    }

    /**
     * Constructs a UnicodeString from a Java String.
     *

  public final Entry<AnEnum, String>[] createArray(int length) {
    return (Entry<AnEnum, String>[]) new Entry<?, ?>[length];
  }

  @Override
  public final AnEnum[] createKeyArray(int length) {
    return new AnEnum[length];
  }

  @Override
  public final String[] createValueArray(int length) {
    return new String[length];
  }

  /** Returns the elements sorted in natural order. */
  @Override

                  @Override
                  public Range<Integer>[] createKeyArray(int length) {
                    return (Range<Integer>[]) new Range<?>[length];
                  }

                  @Override
                  public String[] createValueArray(int length) {
                    return new String[length];
                  }
                })
            .named("TreeRangeMap.asMapOfRanges")