Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 4 of 4 for Averaged (0.12 seconds)

  2. github.com/codelibs/fess

    src/main/resources/fess_label_en.properties 

    labels.searchlog_log_type_search_user_hour=User Count/Hour
labels.searchlog_log_type_search_user_day=User Count/Day
labels.searchlog_log_type_search_reqtimeavg_hour=Request Average Time/Hour
labels.searchlog_log_type_search_reqtimeavg_day=Request Average Time/Day
labels.searchlog_log_type_click_count=Click Count
labels.searchlog_log_type_favorite_count=Favorite Count
labels.searchlog_log_message=Message
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Mar 28 11:54:13 GMT 2026
    - 48.9K bytes
    - Click Count (0)
  3. github.com/codelibs/fess

    src/main/resources/fess_label.properties 

    labels.searchlog_log_type_search_user_hour=User Count/Hour
labels.searchlog_log_type_search_user_day=User Count/Day
labels.searchlog_log_type_search_reqtimeavg_hour=Request Average Time/Hour
labels.searchlog_log_type_search_reqtimeavg_day=Request Average Time/Day
labels.searchlog_log_type_click_count=Click Count
labels.searchlog_log_type_favorite_count=Favorite Count
labels.searchlog_log_message=Message
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Mar 28 11:54:13 GMT 2026
    - 48.9K bytes
    - Click Count (0)
  4. github.com/google/guava

    guava/src/com/google/common/collect/MapMakerInternalMap.java 

         * traverse. When nodes would otherwise be changed, new nodes are created to replace them. This
     * works well for hash tables since the bin lists tend to be short. (The average length is less
     * than two.)
     *
     * Read operations can thus proceed without locking, but rely on selected uses of volatiles to
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Apr 01 17:27:13 GMT 2026
    - 89.9K bytes
    - Click Count (0)
  5. github.com/google/guava

    android/guava/src/com/google/common/collect/MapMakerInternalMap.java 

         * traverse. When nodes would otherwise be changed, new nodes are created to replace them. This
     * works well for hash tables since the bin lists tend to be short. (The average length is less
     * than two.)
     *
     * Read operations can thus proceed without locking, but rely on selected uses of volatiles to
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Apr 01 17:27:13 GMT 2026
    - 89.9K bytes
    - Click Count (0)
Back to Top