Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 412 for appendix (0.12 seconds)

  1. android/guava-tests/test/com/google/common/hash/SipHashFunctionTest.java

          for (int j = 0; j < i; ++j) {
            msg[j] = (byte) j;
          }
          assertSip(msg, EXPECTED[i]);
        }
      }
    
      // This test data comes from "SipHash: a fast short-input PRF", "Appendix A: Test values".
      // It can be downloaded here: https://131002.net/siphash/siphash.pdf
      public void test15ByteStringFromSipHashPaper() {
        byte[] message =
            new byte[] {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 19 18:53:45 GMT 2026
    - 6.8K bytes
    - Click Count (0)
  2. guava-tests/test/com/google/common/hash/SipHashFunctionTest.java

          for (int j = 0; j < i; ++j) {
            msg[j] = (byte) j;
          }
          assertSip(msg, EXPECTED[i]);
        }
      }
    
      // This test data comes from "SipHash: a fast short-input PRF", "Appendix A: Test values".
      // It can be downloaded here: https://131002.net/siphash/siphash.pdf
      public void test15ByteStringFromSipHashPaper() {
        byte[] message =
            new byte[] {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 19 18:53:45 GMT 2026
    - 6.8K bytes
    - Click Count (0)
  3. src/test/java/jcifs/pac/PacMacTest.java

            int outlen = 5;
            byte[] expanded = PacMac.expandNFold(data, outlen);
            assertNotNull(expanded);
            assertEquals(outlen, expanded.length);
    
            // Test vectors from RFC 3961 Appendix A.1
            // 64-fold("012345")
            verifyNfold("012345", 8,
                    new byte[] { (byte) 0xbe, (byte) 0x07, (byte) 0x26, (byte) 0x31, (byte) 0x27, (byte) 0x6b, (byte) 0x19, (byte) 0x55 });
    
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 07:14:38 GMT 2025
    - 7.1K bytes
    - Click Count (0)
  4. LICENSE

          Object form, made available under the License, as indicated by a
          copyright notice that is included in or attached to the work
          (an example is provided in the Appendix below).
    
          "Derivative Works" shall mean any work, whether in Source or Object
          form, that is based on (or derived from) the Work and for which the
    Created: Fri Apr 03 20:58:12 GMT 2026
    - Last Modified: Fri Apr 18 13:54:00 GMT 2025
    - 11.1K bytes
    - Click Count (0)
  5. LICENSE

          Object form, made available under the License, as indicated by a
          copyright notice that is included in or attached to the work
          (an example is provided in the Appendix below).
    
          "Derivative Works" shall mean any work, whether in Source or Object
          form, that is based on (or derived from) the Work and for which the
    Created: Wed Apr 01 11:36:16 GMT 2026
    - Last Modified: Thu Mar 12 16:29:02 GMT 2026
    - 9.9K bytes
    - Click Count (0)
  6. gradle/wrapper/gradle-wrapper.jar

    class package org.gradle.wrapper; public final class Logger implements Appendable { public final boolean quiet; public void Logger(boolean); public final void log(String); public final Appendable append(CharSequence); public final Appendable append(CharSequence, int, int); public final Appendable append(char); } org/gradle/wrapper/PathAssembler.class package org.gradle.wrapper; public final class PathAssembler { public void PathAssembler(java.io.File, java.io.File); } org/gradle/wrapper/PropertiesFileHandle.class...
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Wed Mar 04 20:34:40 GMT 2026
    - 47.8K bytes
    - Click Count (1)
  7. doc/go_spec.html

    s3 := append(s2, s0...)            // append a slice              s3 is []int{0, 0, 2, 3, 5, 7, 0, 0}
    s4 := append(s3[3:6], s3[2:]...)   // append overlapping slice    s4 is []int{3, 5, 7, 2, 3, 5, 7, 0, 0}
    
    var t []interface{}
    t = append(t, 42, 3.1415, "foo")   //                             t is []interface{}{42, 3.1415, "foo"}
    
    var b []byte
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Wed Apr 01 23:39:18 GMT 2026
    - 287.8K bytes
    - Click Count (1)
  8. lib/fips140/v1.26.0.zip

    func (d *Digest) AppendBinary(b []byte) ([]byte, error) { switch d.dsbyte { case dsbyteSHA3: b = append(b, magicSHA3...) case dsbyteShake: b = append(b, magicShake...) case dsbyteCShake: b = append(b, magicCShake...) case dsbyteKeccak: b = append(b, magicKeccak...) default: panic("unknown dsbyte") } // rate is at most 168, and n is at most rate. b = append(b, byte(d.rate)) b = append(b, d.a[:]...) b = append(b, byte(d.n), byte(d.state)) return b, nil } func (d *Digest) UnmarshalBinary(b []byte) error...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Jan 08 17:58:32 GMT 2026
    - 660.3K bytes
    - Click Count (0)
  9. lib/fips140/v1.0.0-c2097c7c.zip

    func (d *Digest) AppendBinary(b []byte) ([]byte, error) { switch d.dsbyte { case dsbyteSHA3: b = append(b, magicSHA3...) case dsbyteShake: b = append(b, magicShake...) case dsbyteCShake: b = append(b, magicCShake...) case dsbyteKeccak: b = append(b, magicKeccak...) default: panic("unknown dsbyte") } // rate is at most 168, and n is at most rate. b = append(b, byte(d.rate)) b = append(b, d.a[:]...) b = append(b, byte(d.n), byte(d.state)) return b, nil } func (d *Digest) UnmarshalBinary(b []byte) error...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  10. src/main/java/org/codelibs/fess/query/QueryProcessor.java

         * @param chain the existing filter chain to append to
         * @return a new filter chain that includes the appended filter
         */
        protected FilterChain appendFilterChain(final Filter filter, final FilterChain chain) {
            return (context, query, boost) -> filter.execute(context, query, boost, chain);
        }
    
        /**
         * Creates the default filter chain that executes query commands.
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Fri Nov 28 16:29:12 GMT 2025
    - 7.2K bytes
    - Click Count (0)
Back to Top