Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 211 for appendix (0.16 seconds)

  1. okhttp/src/jvmTest/kotlin/okhttp3/WebPlatformToAsciiTest.kt

          "xn--a.ß",
          "xn--a.xn--zca",
          "xn--a-yoc",
          // OkHttp doesn't reject U+FFFD encoded in Punycode.
          "xn--zn7c.com",
          // OkHttp doesn't reject a U+200D. https://www.rfc-editor.org/rfc/rfc5892.html#appendix-A.2
          "xn--1ug.example",
          // OkHttp doesn't implement CheckJoiners.
          "\u200D.example",
          // OkHttp doesn't implement CheckBidi.
          "يa",
        )
    
      @Test
      fun test() {
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Fri Dec 27 13:39:56 GMT 2024
    - 3.5K bytes
    - Click Count (0)
  2. 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)
  3. 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)
  4. 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)
  5. docs/security/tls_configuration_history.md

    [googlecloud_ssl_policy]: https://cloud.google.com/load-balancing/docs/ssl-policies-concepts
    [http2_denylist]: https://tools.ietf.org/html/rfc7540#appendix-A
    [http2_naughty]: #http2_naughty
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Sun Feb 06 16:35:36 GMT 2022
    - 9K bytes
    - Click Count (0)
  6. android/guava/src/com/google/common/net/UrlEscapers.java

       *       uppercase, hexadecimal representation of the byte value.
       * </ul>
       *
       * <p>This escaper is suitable for escaping parameter names and values even when <a
       * href="https://www.w3.org/TR/html401/appendix/notes.html#h-B.2.2">using the non-standard
       * semicolon</a>, rather than the ampersand, as a parameter delimiter. Nevertheless, we recommend
       * using the ampersand unless you must interoperate with systems that require semicolons.
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sat Dec 21 03:10:51 GMT 2024
    - 7.1K bytes
    - Click Count (0)
  7. LICENSES/third_party/forked/shell2junit/LICENSE

    "Work" shall mean the work of authorship, whether in Source or 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 editorial 
    Created: Fri Apr 03 09:05:14 GMT 2026
    - Last Modified: Thu Jul 08 11:48:19 GMT 2021
    - 9.2K bytes
    - Click Count (0)
  8. internal/ioutil/append-file_windows.go

    // along with this program.  If not, see <http://www.gnu.org/licenses/>.
    
    package ioutil
    
    import (
    	"io"
    	"os"
    
    	"github.com/minio/minio/internal/lock"
    )
    
    // AppendFile - appends the file "src" to the file "dst"
    func AppendFile(dst string, src string, osync bool) error {
    	appendFile, err := lock.Open(dst, os.O_WRONLY|os.O_APPEND|os.O_CREATE, 0o666)
    	if err != nil {
    		return err
    	}
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Jan 02 17:15:06 GMT 2022
    - 1.2K bytes
    - Click Count (0)
  9. internal/ioutil/append-file_nix.go

    // You should have received a copy of the GNU Affero General Public License
    // along with this program.  If not, see <http://www.gnu.org/licenses/>.
    
    package ioutil
    
    import (
    	"io"
    	"os"
    )
    
    // AppendFile - appends the file "src" to the file "dst"
    func AppendFile(dst string, src string, osync bool) error {
    	flags := os.O_WRONLY | os.O_APPEND | os.O_CREATE
    	if osync {
    		flags |= os.O_SYNC
    	}
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Jan 02 17:15:06 GMT 2022
    - 1.3K 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