Search Options

Results per page
Sort
Preferred Languages
Advance

Results 431 - 440 of 1,763 for lengths (0.09 sec)

  1. src/main/webapp/js/search.js

        }
      });
    
      $result.on("click", "a.favorite", function(e) {
        var $favorite = $(this),
            values = $favorite.attr("href").split("#"),
            actionUrl,
            docId;
        if (values.length === 2 && $queryId.length > 0) {
          docId = values[1];
          actionUrl = contextPath + "/api/v1/documents/" + docId + "/favorite";
          $.ajax({
            dataType: "json",
            cache: false,
            type: "post",
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Jun 19 07:14:01 UTC 2025
    - 7.5K bytes
    - Viewed (0)
  2. src/test/java/jcifs/internal/smb2/lease/DirectoryLeasingIntegrationTest.java

            String directoryPath = "/test/integration";
    
            // Setup mock files
            when(mockFile1.getName()).thenReturn("document.txt");
            when(mockFile1.length()).thenReturn(2048L);
            when(mockFile1.lastModified()).thenReturn(System.currentTimeMillis() - 3600000);
            when(mockFile1.isDirectory()).thenReturn(false);
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 23 01:47:47 UTC 2025
    - 14.2K bytes
    - Viewed (0)
  3. src/main/java/jcifs/dcerpc/UUID.java

                }
                count++;
            }
    
            return value;
        }
    
        static final char[] HEXCHARS = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F' };
    
        private static String bin_to_hex(int value, final int length) {
            final char[] arr = new char[length];
            int ai = arr.length;
            while (ai-- > 0) {
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 4.7K bytes
    - Viewed (0)
  4. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/tls/OkHostnameVerifier.kt

        // least as long as the pattern because asterisk must match the whole left-most label and
        // hostname starts with a non-empty label. Thus, asterisk has to match one or more characters.
        if (hostname.length < pattern.length) {
          return false // Hostname too short to match the pattern.
        }
    
        if ("*." == pattern) {
          return false // Wildcard pattern for single-label domain name -- not permitted.
        }
    
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Wed Mar 19 19:25:20 UTC 2025
    - 7.6K bytes
    - Viewed (0)
  5. src/test/java/jcifs/ntlmssp/Type3MessageTest.java

        }
    
        /**
         * Helper method to create a test string of specified length
         */
        private String createTestString(int length) {
            StringBuilder sb = new StringBuilder(length);
            for (int i = 0; i < length; i++) {
                sb.append((char) ('A' + (i % 26)));
            }
            return sb.toString();
        }
    
        /**
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 17.3K bytes
    - Viewed (0)
  6. android/guava-testlib/src/com/google/common/collect/testing/TestIntegerSetGenerator.java

        Integer[] array = new Integer[elements.length];
        int i = 0;
        for (Object e : elements) {
          array[i++] = (Integer) e;
        }
        return create(array);
      }
    
      protected abstract Set<Integer> create(Integer[] elements);
    
      @Override
      public Integer[] createArray(int length) {
        return new Integer[length];
      }
    
      /**
       * {@inheritDoc}
       *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Dec 21 14:50:24 UTC 2024
    - 2.1K bytes
    - Viewed (0)
  7. android/guava-testlib/src/com/google/common/collect/testing/google/TestEnumMultisetGenerator.java

        AnEnum[] array = new AnEnum[elements.length];
        int i = 0;
        for (Object e : elements) {
          array[i++] = (AnEnum) e;
        }
        return create(array);
      }
    
      protected abstract Multiset<AnEnum> create(AnEnum[] elements);
    
      @Override
      public AnEnum[] createArray(int length) {
        return new AnEnum[length];
      }
    
      /** Sorts the enums according to their natural ordering. */
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue Feb 11 19:03:19 UTC 2025
    - 2.2K bytes
    - Viewed (0)
  8. src/main/webapp/js/admin/plugins/form-validator/sanitize.js

    n(a){return a.replace(/\s+$/,"")},capitalize:function(b){var c=b.split(" ");return a.each(c,function(a,b){c[a]=b.substr(0,1).toUpperCase()+b.substr(1,b.length)}),c.join(" ")},insert:function(a,b,c){var d=(b.attr("data-sanitize-insert-"+c)||"").replace(/\[SPACE\]/g," ");return"left"===c&&0===a.indexOf(d)||"right"===c&&a.substring(a.length-d.length)===d?a:("left"===c?d:"")+a+("right"===c?d:"")},insertRight:function(a,b){return this.insert(a,b,"right")},insertLeft:function(a,b){return this.insert(a...
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Mon Jan 01 05:12:47 UTC 2018
    - 2.7K bytes
    - Viewed (0)
  9. src/main/java/jcifs/smb1/util/HMACT64.java

         */
        public HMACT64(final byte[] key) {
            super("HMACT64");
            final int length = Math.min(key.length, BLOCK_LENGTH);
            for (int i = 0; i < length; i++) {
                ipad[i] = (byte) (key[i] ^ IPAD);
                opad[i] = (byte) (key[i] ^ OPAD);
            }
            for (int i = length; i < BLOCK_LENGTH; i++) {
                ipad[i] = IPAD;
                opad[i] = OPAD;
            }
            try {
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 07:14:38 UTC 2025
    - 3.6K bytes
    - Viewed (0)
  10. src/main/java/jcifs/util/HMACT64.java

         */
        public HMACT64(final byte[] key) {
            super("HMACT64");
            final int length = Math.min(key.length, BLOCK_LENGTH);
            for (int i = 0; i < length; i++) {
                this.ipad[i] = (byte) (key[i] ^ IPAD);
                this.opad[i] = (byte) (key[i] ^ OPAD);
            }
            for (int i = length; i < BLOCK_LENGTH; i++) {
                this.ipad[i] = IPAD;
                this.opad[i] = OPAD;
            }
    
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 07:14:38 UTC 2025
    - 3.6K bytes
    - Viewed (0)
Back to top