Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 5 of 5 for 22021002 (0.06 seconds)

  1. okhttp/src/jvmTest/kotlin/okhttp3/internal/ws/MessageDeflaterInflaterTest.kt

       */
      @Test fun `inflate returns finished before bytesRead reaches input length`() {
        val inflater = MessageInflater(false)
        val message = "53621260020000".decodeHex()
        assertThat(inflater.inflate(message)).isEqualTo("22021002".decodeHex())
      }
    
      @Test fun `deflate golden value`() {
        val deflater = MessageDeflater(false)
        val deflated = deflater.deflate("Hello deflate!".encodeUtf8())
    Created: Fri Dec 26 11:42:13 GMT 2025
    - Last Modified: Sun Sep 21 06:26:07 GMT 2025
    - 6.4K bytes
    - Click Count (0)
  2. internal/s3select/sql/timestampfuncs_test.go

    		{"2010-02-03T", time.Date(2010, 2, 3, 0, 0, 0, 0, time.UTC)},
    		{"2010-02-03T04:11Z", time.Date(2010, 2, 3, 4, 11, 0, 0, time.UTC)},
    		{"2010-02-03T04:11:30Z", time.Date(2010, 2, 3, 4, 11, 30, 0, time.UTC)},
    		{"2010-02-03T04:11:30.23Z", time.Date(2010, 2, 3, 4, 11, 30, 230000000, time.UTC)},
    		{"2010-02-03T04:11+08:00", time.Date(2010, 2, 3, 4, 11, 0, 0, beijing)},
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Tue Jun 01 21:59:40 GMT 2021
    - 2.2K bytes
    - Click Count (0)
  3. src/test/java/jcifs/dcerpc/msrpc/lsarpcTest.java

            // The implementation uses maximum_length/2 for _name_buffers, not length
            when(mockDeferredNdrBuffer.dec_ndr_long()).thenReturn(10, 0, 5); // _name_buffers (max_length/2 = 20/2 = 10), 0, _name_bufferl (5)
            when(mockDeferredNdrBuffer.dec_ndr_short()).thenReturn((int) (short) 'a', (int) (short) 'b', (int) (short) 'c', (int) (short) 'd',
                    (int) (short) 'e');
    
    Created: Sat Dec 20 13:44:44 GMT 2025
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 60.8K bytes
    - Click Count (0)
  4. lib/fips140/v1.0.0-c2097c7c.zip

    z2_50_0.Multiply(&t, &z2_10_0) // 2^50 - 2^0 t.Square(&z2_50_0) // 2^51 - 2^1 for i := 0; i < 49; i++ { t.Square(&t) // 2^100 - 2^50 } z2_100_0.Multiply(&t, &z2_50_0) // 2^100 - 2^0 t.Square(&z2_100_0) // 2^101 - 2^1 for i := 0; i < 99; i++ { t.Square(&t) // 2^200 - 2^100 } t.Multiply(&t, &z2_100_0) // 2^200 - 2^0 t.Square(&t) // 2^201 - 2^1 for i := 0; i < 49; i++ { t.Square(&t) // 2^250 - 2^50 } t.Multiply(&t, &z2_50_0) // 2^250 - 2^0 t.Square(&t) // 2^251 - 2^1 t.Square(&t) // 2^252 - 2^2 t.Square(&t) // 2^253...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  5. lib/fips140/v1.1.0-rc1.zip

    z2_50_0.Multiply(&t, &z2_10_0) // 2^50 - 2^0 t.Square(&z2_50_0) // 2^51 - 2^1 for i := 0; i < 49; i++ { t.Square(&t) // 2^100 - 2^50 } z2_100_0.Multiply(&t, &z2_50_0) // 2^100 - 2^0 t.Square(&z2_100_0) // 2^101 - 2^1 for i := 0; i < 99; i++ { t.Square(&t) // 2^200 - 2^100 } t.Multiply(&t, &z2_100_0) // 2^200 - 2^0 t.Square(&t) // 2^201 - 2^1 for i := 0; i < 49; i++ { t.Square(&t) // 2^250 - 2^50 } t.Multiply(&t, &z2_50_0) // 2^250 - 2^0 t.Square(&t) // 2^251 - 2^1 t.Square(&t) // 2^252 - 2^2 t.Square(&t) // 2^253...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
Back to Top