Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 731 - 740 of 814 for intent (0.1 seconds)

  1. okhttp/src/jvmTest/kotlin/okhttp3/internal/cache/DiskLruCacheTest.kt

          }
        } catch (_: FileNotFoundException) {
          null
        }
    
      fun writeFile(
        file: Path,
        content: String,
      ) {
        file.parent?.let {
          filesystem.createDirectories(it)
        }
        filesystem.write(file) {
          writeUtf8(content)
        }
      }
    
      private fun generateSomeGarbageFiles() {
        val dir1 = cacheDir / "dir1"
        val dir2 = dir1 / "dir2"
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Feb 03 22:17:59 GMT 2026
    - 59.4K bytes
    - Click Count (0)
  2. src/test/java/org/codelibs/fess/cors/CorsHandlerTest.java

                        httpResponse.addHeader(ACCESS_CONTROL_ALLOW_METHODS, "GET, POST, OPTIONS");
                        httpResponse.addHeader(ACCESS_CONTROL_ALLOW_HEADERS, "Content-Type");
                        httpResponse.addHeader(ACCESS_CONTROL_MAX_AGE, "3600");
                        httpResponse.addHeader(ACCESS_CONTROL_ALLOW_CREDENTIALS, "true");
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Mar 21 06:04:58 GMT 2026
    - 26.3K bytes
    - Click Count (0)
  3. android/guava/src/com/google/common/collect/LinkedListMultimap.java

            keyList.count++;
            Node<K, V> keyTail = keyList.tail;
            keyTail.nextSibling = node;
            node.previousSibling = keyTail;
            keyList.tail = node;
          }
        } else { // non-empty list, insert before nextSibling
          /*
           * requireNonNull is safe as long as callers pass a nextSibling that (a) has the same key and
           * (b) is present in the multimap. (And they do, except maybe in case of concurrent
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Sep 22 18:35:44 GMT 2025
    - 26.6K bytes
    - Click Count (0)
  4. android/guava/src/com/google/common/collect/HashBiMap.java

        deleteFromTableKToV(entry, smearedHash(keys[entry]));
        keys[entry] = newKey;
        insertIntoTableKToV(entry, smearedHash(newKey));
    
        // insert into insertion order linked list, usually at the end
        setSucceeds(newPredecessor, entry);
        setSucceeds(entry, newSuccessor);
      }
    
      @CanIgnoreReturnValue
      @Override
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Mar 08 16:16:42 GMT 2026
    - 37K bytes
    - Click Count (0)
  5. android/guava/src/com/google/common/collect/Multimaps.java

      }
    
      /**
       * Returns a view of a multimap where each value is transformed by a function. All other
       * properties of the multimap, such as iteration order, are left intact. For example, the code:
       *
       * {@snippet :
       * Multimap<String, Integer> multimap =
       *     ImmutableSetMultimap.of("a", 2, "b", -3, "b", -3, "a", 4, "c", 6);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Feb 23 19:19:10 GMT 2026
    - 86K bytes
    - Click Count (0)
  6. guava/src/com/google/common/collect/Multimaps.java

      }
    
      /**
       * Returns a view of a multimap where each value is transformed by a function. All other
       * properties of the multimap, such as iteration order, are left intact. For example, the code:
       *
       * {@snippet :
       * Multimap<String, Integer> multimap =
       *     ImmutableSetMultimap.of("a", 2, "b", -3, "b", -3, "a", 4, "c", 6);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Feb 23 19:19:10 GMT 2026
    - 86.3K bytes
    - Click Count (0)
  7. src/main/java/org/codelibs/fess/opensearch/user/bsentity/BsUser.java

            sb.append(dm).append(uidNumber);
            sb.append(dm).append(x121Address);
            if (sb.length() > dm.length()) {
                sb.delete(0, dm.length());
            }
            sb.insert(0, "{").append("}");
            return sb.toString();
        }
    
        // ===================================================================================
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Mar 15 06:53:53 GMT 2025
    - 22.9K bytes
    - Click Count (0)
  8. src/test/java/org/codelibs/fess/dict/mapping/CharMappingItemTest.java

            assertEquals(0L, item.getId());
            assertNotNull(item.getNewInputs());
            assertEquals("result", item.getNewOutput());
            // NewInputs should have same content as inputs for id=0 (defensive copy is returned)
            assertArrayEquals(inputs, item.getNewInputs());
            assertEquals("result", item.getNewOutput());
        }
    
        @Test
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Fri Mar 13 23:01:26 GMT 2026
    - 16K bytes
    - Click Count (0)
  9. LICENSES/third_party/forked/gotestsum/LICENSE

          Work and such Derivative Works in Source or Object form.
    
       3. Grant of Patent License. Subject to the terms and conditions of
          this License, each Contributor hereby grants to You a perpetual,
          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
          (except as stated in this section) patent license to make, have made,
          use, offer to sell, sell, import, and otherwise transfer the Work,
    Created: Fri Apr 03 09:05:14 GMT 2026
    - Last Modified: Fri Apr 01 18:49:15 GMT 2022
    - 11.1K bytes
    - Click Count (0)
  10. guava/src/com/google/common/base/Strings.java

       * @param minLength the minimum length the resulting string must have. Can be zero or negative, in
       *     which case the input string is always returned.
       * @param padChar the character to insert at the beginning of the result until the minimum length
       *     is reached
       * @return the padded string
       */
      public static String padStart(String string, int minLength, char padChar) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Jan 29 22:14:05 GMT 2026
    - 12.5K bytes
    - Click Count (0)
Back to Top