Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for calculation (0.09 sec)

  1. CHANGELOG/CHANGELOG-1.3.md

    * kubectl: don't display an empty list when trying to get a single resource that isn't found ([#28294](https://github.com/kubernetes/kubernetes/pull/28294), [@ncdc](https://github.com/ncdc))
    * Fix working_set calculation in kubelet ([#29154](https://github.com/kubernetes/kubernetes/pull/29154), [@vishh](https://github.com/vishh))
    Registered: Fri Sep 05 09:05:11 UTC 2025
    - Last Modified: Thu Dec 24 02:28:26 UTC 2020
    - 84K bytes
    - Viewed (0)
  2. src/main/resources/fess_config.properties

    search_engine.heartbeat_interval=10000
    
    # Cipher algorithm used for encryption.
    app.cipher.algorism=aes
    # Secret key for encryption (change this value for production).
    app.cipher.key=___change__me___
    # Algorithm for digest calculation.
    app.digest.algorism=sha256
    # Regex pattern for properties to encrypt.
    app.encrypt.property.pattern=.*password|.*key|.*token|.*secret
    
    # Extension names for application customization.
    app.extension.names=
    
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Jul 05 14:45:37 UTC 2025
    - 54.7K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/cache/CacheBuilder.java

       * cache whose key or value type is incompatible with the weigher, you will likely experience a
       * {@link ClassCastException} at some <i>undefined</i> point in the future.
       *
       * @param weigher the weigher to use in calculating the weight of cache entries
       * @return this {@code CacheBuilder} instance (for chaining)
       * @throws IllegalStateException if a weigher was already set or {@link #maximumSize(long)} was
       *     previously called
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 51.7K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/collect/Iterators.java

        checkNotNull(comparator, "comparator");
    
        return new MergingIterator<>(iterators, comparator);
      }
    
      /**
       * An iterator that performs a lazy N-way merge, calculating the next value each time the iterator
       * is polled. This amortizes the sorting cost over the iteration and requires less memory than
       * sorting all elements at once.
       *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 50.5K bytes
    - Viewed (0)
Back to top