return result
  }

  override fun toString(): String = "$tagClass/$tag"

  companion object {
    const val TAG_CLASS_UNIVERSAL = 0b0000_0000
    const val TAG_CLASS_APPLICATION = 0b0100_0000
    const val TAG_CLASS_CONTEXT_SPECIFIC = 0b1000_0000
    const val TAG_CLASS_PRIVATE = 0b1100_0000

    const val TAG_END_OF_CONTENTS = 0L
  }

    val length0 = source.readByte().toInt() and 0xff
    val length =
      when {
        length0 == 0b1000_0000 -> {
          throw ProtocolException("indefinite length not permitted for DER")
        }
        (length0 and 0b1000_0000) == 0b1000_0000 -> {
          // Length specified over multiple bytes.
          val lengthBytes = length0 and 0b0111_1111
          if (lengthBytes > 8) {

    } else {
      // count how many bytes we'll need to express the length.
      val lengthBitCount = 64 - java.lang.Long.numberOfLeadingZeros(length)
      val lengthByteCount = (lengthBitCount + 7) / 8
      sink.writeByte(0b1000_0000 or lengthByteCount)
      for (shift in (lengthByteCount - 1) * 8 downTo 0 step 8) {
        sink.writeByte((length shr shift).toInt())
      }
    }

    // Write the payload.
    sink.writeAll(content)
  }

  /** Map pre-created before experiment starts to only measure iteration cost during experiment. */
  Map<Element, Element> map;

  CollectionBenchmarkSampleData elems;

  @Param({"0", "1", "100", "10000"})
  int elements;

  @BeforeExperiment
  public void prepareContents() throws Exception {
    mapsImpl = mapEnums.get(implName);
    elems = new CollectionBenchmarkSampleData(elements);

  }

  @Test fun `decode length overflowing Long`() {
    val buffer =
      Buffer()
        .writeByte(0b00000010)
        .writeByte(0b10001000)
        .writeByte(0b10000000)
        .writeByte(0b00000000)
        .writeByte(0b00000000)
        .writeByte(0b00000000)
        .writeByte(0b00000000)
        .writeByte(0b00000000)
        .writeByte(0b00000000)

b.v, c.v, got, exp) } } } } } } func BitRev8(n uint8) uint8 { var r uint8 r |= n >> 7 & 0b0000_0001 r |= n >> 5 & 0b0000_0010 r |= n >> 3 & 0b0000_0100 r |= n >> 1 & 0b0000_1000 r |= n << 1 & 0b0001_0000 r |= n << 3 & 0b0010_0000 r |= n << 5 & 0b0100_0000 r |= n << 7 & 0b1000_0000 return r } func CenteredMod(x, m uint32) int32 { x = x % m if x > m/2 { return int32(x) - int32(m) } return int32(x) } func reduceModQ(x int32) uint32 { x %= q if x < 0 { return uint32(x + q) } return uint32(x) } func TestCenteredMod(t...

bits. // Setting the top two bits, rather than just the top bit, means that // when two of these values are multiplied together, the result isn't // ever one bit short. if excess := len(b)*8 - bits; excess < 7 { b[0] |= 0b1100_0000 >> excess } else { b[0] |= 0b0000_0001 b[1] |= 0b1000_0000 } // Make the value odd since an even number certainly isn't prime. b[len(b)-1] |= 1 // We don't need to check for p >= √2 × 2^(bits-1) (steps 4.4 and 5.4) // because we set the top two bits above, so // // p > 2^(bits-1)...