Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 4 of 4 for popular (0.06 seconds)

  1. src/main/java/org/codelibs/fess/mylasta/direction/FessConfig.java

        /** The key of the configuration. e.g. 10 */
        String SUGGEST_POPULAR_WORD_SIZE = "suggest.popular.word.size";
    
        /** The key of the configuration. e.g. 30 */
        String SUGGEST_POPULAR_WORD_WINDOW_SIZE = "suggest.popular.word.window.size";
    
        /** The key of the configuration. e.g. 10 */
        String SUGGEST_POPULAR_WORD_QUERY_FREQ = "suggest.popular.word.query.freq";
    
    Created: Sat Dec 20 09:19:18 GMT 2025
    - Last Modified: Sat Dec 13 02:21:17 GMT 2025
    - 525.7K bytes
    - Click Count (2)
  2. RELEASE.md

            selective op registration headers else execution would fail with
            unregistered kernels error.
    
    *   Modular File System Migration:
    
        *   Support for S3 and HDFS file systems has been migrated to a modular file
            systems based approach and is now available in
            https://github.com/tensorflow/io. The `tensorflow-io` python package
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Tue Oct 28 22:27:41 GMT 2025
    - 740.4K bytes
    - Click Count (3)
  3. lib/fips140/v1.0.0-c2097c7c.zip

    bits on some architectures. func bitLen(n uint) int { len := 0 // We assume, here and elsewhere, that comparison to zero is constant time // with respect to different non-zero values. for n != 0 { len++ n >>= 1 } return len } // Modulus is used for modular arithmetic, precomputing relevant constants. // // A Modulus can leak the exact number of bits needed to store its value // and is stored without padding. Its actual value is still kept secret. type Modulus struct { // The underlying natural number...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  4. lib/fips140/v1.1.0-rc1.zip

    bits on some architectures. func bitLen(n uint) int { len := 0 // We assume, here and elsewhere, that comparison to zero is constant time // with respect to different non-zero values. for n != 0 { len++ n >>= 1 } return len } // Modulus is used for modular arithmetic, precomputing relevant constants. // // A Modulus can leak the exact number of bits needed to store its value // and is stored without padding. Its actual value is still kept secret. type Modulus struct { // The underlying natural number...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
Back to Top