Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 581 - 590 of 727 for jour (0.02 seconds)

  1. src/main/resources/fess_message_it.properties

    errors.app.double.submit.request = Questa richiesta potrebbe essere giĆ  stata elaborata. Riprova l'operazione.
    # _/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/
    # you can define your messages here:
    # e.g.
    # errors.xxx = ...
    # info.xxx = ...
    # _/_/_/_/_/_/_/_/_/_/
    # ========================================================================================
    # Fess
    # ======
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Mar 28 06:59:19 GMT 2026
    - 13.3K bytes
    - Click Count (0)
  2. android/guava/src/com/google/common/hash/HashFunction.java

     *   <li><b>fast:</b> perhaps self-explanatory, but often the most important consideration.
     * </ul>
     *
     * <h3>Providing input to a hash function</h3>
     *
     * <p>The primary way to provide the data that your hash function should act on is via a {@link
     * Hasher}. Obtain a new hasher from the hash function using {@link #newHasher}, "push" the relevant
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 10.9K bytes
    - Click Count (0)
  3. guava-tests/test/com/google/common/collect/ImmutableSortedSetTest.java

        return ImmutableList.copyOf(SORTED_NUMBER_NAMES.subList(i, j));
      }
    
      private static final ImmutableList<String> NUMBER_NAMES =
          ImmutableList.of("one", "two", "three", "four", "five", "six", "seven");
    
      private static final ImmutableList<String> SORTED_NUMBER_NAMES =
          Ordering.<String>natural().immutableSortedCopy(NUMBER_NAMES);
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Mar 13 13:01:07 GMT 2026
    - 47.2K bytes
    - Click Count (0)
  4. android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java

     *       significantly worse than a {@code PriorityQueue} with manual eviction above the maximum
     *       size. In many cases {@link Ordering#leastOf} may work for your use case with significantly
     *       improved (and asymptotically superior) performance.
     *   <li>The retrieval operations {@link #peek}, {@link #peekFirst}, {@link #peekLast}, {@link
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 16 13:11:08 GMT 2026
    - 34K bytes
    - Click Count (0)
  5. CHANGELOG/CHANGELOG-1.6.md

    * **Taints**
      * You will need to use `kubectl taint` to re-create all of your taints after kubectl and the master are upgraded to 1.6. Between the time the master is upgraded to 1.6 and when you do this, your existing taints will have no effect.
    Created: Fri Apr 03 09:05:14 GMT 2026
    - Last Modified: Thu Dec 24 02:28:26 GMT 2020
    - 304K bytes
    - Click Count (0)
  6. okhttp-testing-support/src/main/kotlin/okhttp3/testing/PlatformRule.kt

          const val OPENJSSE_PROPERTY = "openjsse"
          const val BOUNCYCASTLE_PROPERTY = "bouncycastle"
          const val LOOM_PROPERTY = "loom"
    
          /**
           * For whatever reason our BouncyCastle provider doesn't work with ECDSA keys. Just configure it
           * to use RSA-2048 instead.
           *
           * (We otherwise prefer ECDSA because it's faster.)
           */
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Jan 27 09:00:39 GMT 2026
    - 15.5K bytes
    - Click Count (1)
  7. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/connection/RealRoutePlanner.kt

            address = address,
            call = call,
            routes = routes,
            requireMultiplexed = planToReplace != null && planToReplace.isReady,
          ) ?: return null
    
        // If we coalesced our connection, remember the replaced connection's route. That way if the
        // coalesced connection later fails we don't waste a valid route.
        if (planToReplace != null) {
          nextRouteToTry = planToReplace.route
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Jan 27 09:00:39 GMT 2026
    - 12.1K bytes
    - Click Count (0)
  8. android/guava-tests/test/com/google/common/util/concurrent/AtomicDoubleArrayTest.java

        a.set(0, 1.0);
        Thread t =
            newStartedThread(
                new CheckedRunnable() {
                  @Override
                  @SuppressWarnings("ThreadPriorityCheck") // doing our best to test for races
                  public void realRun() {
                    while (!a.compareAndSet(0, 2.0, 3.0)) {
                      Thread.yield();
                    }
                  }
                });
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 12 17:47:10 GMT 2026
    - 10.8K bytes
    - Click Count (0)
  9. android/guava/src/com/google/common/hash/LittleEndianByteArray.java

          if (theUnsafe.arrayIndexScale(byte[].class) != 1) {
            throw new AssertionError();
          }
        }
      }
    
      /**
       * Fallback implementation for when VarHandle and Unsafe are not available in our current
       * environment.
       */
      private enum JavaLittleEndianBytes implements LittleEndianBytes {
        INSTANCE {
          @Override
          public long getLongLittleEndian(byte[] source, int offset) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Apr 01 17:27:13 GMT 2026
    - 10.1K bytes
    - Click Count (0)
  10. android/guava-tests/test/com/google/common/util/concurrent/TestThread.java

       * of Java 20, it always throws an exception, and as of Java 26, the method does not even exist.
       * For now, we continue using it to clean up under older JDKs.
       *
       * Our usages should at least be *relatively* safe: Typically, threads started by a test are dying
       * at the end of the test, so there is no object state put at risk by stopping the threads
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Mar 13 13:01:07 GMT 2026
    - 11.5K bytes
    - Click Count (0)
Back to Top