Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 28 for complexity (0.07 seconds)

  1. src/main/java/org/codelibs/fess/suggest/entity/SuggestItemMerger.java

    import java.util.List;
    import java.util.Set;
    
    import org.codelibs.fess.suggest.constants.SuggestConstants;
    
    /**
     * Utility class for merging SuggestItem objects.
     * Centralizes merge logic to reduce complexity in SuggestItem.
     *
     * <p>This class provides methods for merging two SuggestItem instances,
     * combining their fields, frequencies, and other attributes while
     * maintaining uniqueness where appropriate.
     */
    Created: Fri Apr 17 09:08:13 GMT 2026
    - Last Modified: Sun Feb 01 12:48:24 GMT 2026
    - 5.4K bytes
    - Click Count (0)
  2. guava/src/com/google/common/cache/Cache.java

       * created, it is undefined which of the changes (if any) will be reflected in that iterator.
       */
      @J2ktIncompatible // Thread safety complexity
      ConcurrentMap<K, V> asMap();
    
      /**
       * Performs any pending maintenance operations needed by the cache. Exactly which activities are
       * performed -- if any -- is implementation-dependent.
       */
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 03 12:40:22 GMT 2026
    - 8K bytes
    - Click Count (0)
  3. android/guava/src/com/google/common/graph/StandardValueGraph.java

     *
     * <p>Collection-returning accessors return unmodifiable views: the view returned will reflect
     * changes to the graph (if the graph is mutable) but may not be modified by the user.
     *
     * <p>The time complexity of all collection-returning accessors is O(1), since views are returned.
     *
     * @author James Sexton
     * @author Joshua O'Madadhain
     * @author Omar Darwish
     * @param <N> Node parameter type
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Apr 02 14:49:41 GMT 2026
    - 6K bytes
    - Click Count (0)
  4. apache-maven/src/assembly/maven/bin/JvmConfigParser.java

    import java.nio.file.Path;
    import java.nio.file.Paths;
    import java.util.ArrayList;
    import java.util.List;
    
    /**
     * Parses .mvn/jvm.config file for Windows batch/Unix shell scripts.
     * This avoids the complexity of parsing special characters (pipes, quotes, etc.) in scripts.
     *
     * Usage: java JvmConfigParser.java <jvm.config-path> <maven-project-basedir> [output-file]
     *
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Wed Dec 10 16:40:06 GMT 2025
    - 6.4K bytes
    - Click Count (0)
  5. android/guava/src/com/google/common/graph/StandardNetwork.java

     *
     * <p>Collection-returning accessors return unmodifiable views: the view returned will reflect
     * changes to the graph (if the graph is mutable) but may not be modified by the user.
     *
     * <p>The time complexity of all collection-returning accessors is O(1), since views are returned.
     *
     * @author James Sexton
     * @author Joshua O'Madadhain
     * @author Omar Darwish
     * @param <N> Node parameter type
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Apr 02 14:49:41 GMT 2026
    - 6.9K bytes
    - Click Count (0)
  6. src/main/java/org/codelibs/fess/suggest/entity/SuggestItemSerializer.java

    import org.codelibs.fess.suggest.constants.FieldNames;
    import org.codelibs.fess.suggest.util.SuggestUtil;
    
    /**
     * Utility class for serializing and deserializing SuggestItem objects.
     * Centralizes serialization logic to reduce complexity in SuggestItem.
     *
     * <p>This class provides methods for:
     * <ul>
     * <li>Converting SuggestItem to Map (for OpenSearch indexing)</li>
     * <li>Parsing Map back to SuggestItem (from OpenSearch documents)</li>
    Created: Fri Apr 17 09:08:13 GMT 2026
    - Last Modified: Sun Feb 01 12:48:24 GMT 2026
    - 13.5K bytes
    - Click Count (0)
  7. src/test/java/org/codelibs/fess/util/SearchEngineUtilTest.java

                @Override
                public XContentBuilder toXContent(XContentBuilder builder, Params params) throws IOException {
                    // This may cause IOException due to OpenSearch XContent complexity
                    builder.startObject();
                    builder.field("string", "test");
                    builder.endObject();
                    return builder;
                }
            };
    
            try {
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Fri Mar 13 23:01:26 GMT 2026
    - 13.8K bytes
    - Click Count (0)
  8. guava/src/com/google/common/cache/AbstractCache.java

        throw new UnsupportedOperationException();
      }
    
      @Override
      public CacheStats stats() {
        throw new UnsupportedOperationException();
      }
    
      @Override
      @J2ktIncompatible // Thread safety complexity
      public ConcurrentMap<K, V> asMap() {
        throw new UnsupportedOperationException();
      }
    
      /**
       * Accumulates statistics during the operation of a {@link Cache} for presentation by {@link
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 03 12:40:22 GMT 2026
    - 9.2K bytes
    - Click Count (0)
  9. okhttp/src/commonJvmAndroid/kotlin/okhttp3/CertificatePinner.kt

     *
     * ## Warning: Certificate Pinning is Dangerous!
     *
     * Pinning certificates limits your server team's abilities to update their TLS certificates. By
     * pinning certificates, you take on additional operational complexity and limit your ability to
     * migrate between certificate authorities. Do not use certificate pinning without the blessing of
     * your server's TLS administrator!
     *
     * ### Note about self-signed certificates
     *
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Jan 27 09:00:39 GMT 2026
    - 14.2K bytes
    - Click Count (1)
  10. android/guava/src/com/google/common/math/Quantiles.java

     * dataset contains no finite values).
     *
     * <h3>Performance</h3>
     *
     * <p>The average time complexity of the computation is O(N) in the size of the dataset. There is a
     * worst case time complexity of O(N^2). You are extremely unlikely to hit this quadratic case on
     * randomly ordered data (the probability decreases faster than exponentially in N), but if you are
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 23 21:06:42 GMT 2026
    - 30.1K bytes
    - Click Count (0)
Back to Top