AND.S	$255, R0             // ff0010e2
	AND.S	$4278190080, R0      // ff0410e2
	AND	R0, R1, R2           // 002001e0
	AND.S	R0, R1, R2           // 002011e0
	AND	R0, R1               // 001001e0
	AND.S	R0, R1               // 001011e0
	AND	R0>>28, R1, R2       // 202e01e0
	AND	R0<<28, R1, R2       // 002e01e0
	AND	R0->28, R1, R2       // 402e01e0
	AND	R0@>28, R1, R2       // 602e01e0

    }

    @Test
    @DisplayName("Should check capability correctly")
    void testHaveCapability() throws Exception {
        // Given
        setPrivateField(response, "commonCapabilities", 0x2F); // 0010 1111

        // Then
        assertTrue(response.haveCapabilitiy(0x01)); // Has this bit
        assertTrue(response.haveCapabilitiy(0x0F)); // Has all these bits

import org.junit.jupiter.api.Disabled
import org.junit.jupiter.api.Test

internal class DerTest {
  @Test fun `decode tag and length`() {
    val buffer =
      Buffer()
        .writeByte(0b00011110)
        .writeByte(0b10000001)
        .writeByte(0b11001001)

    val derReader = DerReader(buffer)

    derReader.read("test") { header ->

color: #343a40 !important;\n}\n\n.elevation-0 {\n  box-shadow: none !important;\n}\n\n.elevation-1 {\n  box-shadow: 0 1px 3px rgba(0, 0, 0, 0.12), 0 1px 2px rgba(0, 0, 0, 0.24) !important;\n}\n\n.elevation-2 {\n  box-shadow: 0 3px 6px rgba(0, 0, 0, 0.16), 0 3px 6px rgba(0, 0, 0, 0.23) !important;\n}\n\n.elevation-3 {\n  box-shadow: 0 10px 20px rgba(0, 0, 0, 0.19), 0 6px 6px rgba(0, 0, 0, 0.23) !important;\n}\n\n.elevation-4 {\n  box-shadow: 0 14px 28px rgba(0, 0, 0, 0.25), 0 10px 10px rgba(0, 0,...

ex=Ze),this._weekdaysMinStrictRegex&&e?this._weekdaysMinStrictRegex:this._weekdaysMinRegex)},pt.isPM=function(e){return"p"===(e+"").toLowerCase().charAt(0)},pt.meridiem=function(e,a,t){return 11<e?t?"pm":"PM":t?"am":"AM"},oa("en",{eras:[{since:"0001-01-01",until:1/0,offset:1,name:"Anno Domini",narrow:"AD",abbr:"AD"},{since:"0000-12-31",until:-1/0,offset:1,name:"Before Christ",narrow:"BC",abbr:"BC"}],dayOfMonthOrdinalParse:/\d{1,2}(th|st|nd|rd)/,ordinal:function(e){var a=e%10;return e+(1===G(e%10...

a little-endian bit-ordering convention, these are "01" for SHA-3 // and "1111" for SHAKE, or 00000010b and 00001111b, respectively. Then the // padding rule from section 5.1 is applied to pad the message to a multiple // of the rate, which involves adding a "1" bit, zero or more "0" bits, and // a final "1" bit. We merge the first "1" bit from the padding into dsbyte, // giving 00000110b (0x06) and 00011111b (0x1f). // [1] http://csrc.nist.gov/publications/drafts/fips-202/fips_202_draft.pdf // "Draft...