Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 5 of 5 for tie_breaker (0.06 seconds)

  1. src/main/resources/fess_config.properties

    # Whether to allow transpositions in fuzzy content queries.
    query.boost.fuzzy.content.transpositions=true
    
    # Default query type.
    query.default.query_type=bool
    # Tie breaker value for dismax queries.
    query.dismax.tie_breaker=0.1
    # Minimum should match value for boolean queries.
    query.bool.minimum_should_match=
    
    # Number of expansions for prefix queries.
    query.prefix.expansions=50
    # Slop value for prefix queries.
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Mar 28 06:59:19 GMT 2026
    - 59.3K bytes
    - Click Count (0)
  2. src/test/java/org/codelibs/fess/helper/QueryHelperTest.java

            if ("dismax".equals(ComponentUtil.getFessConfig().getQueryDefaultQueryType())) {
                return QueryBuilders.disMaxQuery()
                        .tieBreaker(0.1f)//
                        .add(QueryBuilders.matchPhraseQuery("title", query).boost(titleBoost))//
                        .add(QueryBuilders.matchPhraseQuery("content", query).boost(contentBoost))//
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Fri Mar 13 23:01:26 GMT 2026
    - 53.2K bytes
    - Click Count (0)
  3. android/guava/src/com/google/common/collect/Iterators.java

          // A comparator that's used by the heap, allowing the heap
          // to be sorted based on the top of each iterator, with insertion order as tiebreaker
          Comparator<IndexedIterator<T>> heapComparator =
              (o1, o2) ->
                  ComparisonChain.start()
                      .compare(o1.iterator.peek(), o2.iterator.peek(), itemComparator)
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Sep 16 12:42:11 GMT 2025
    - 51.4K bytes
    - Click Count (0)
  4. guava/src/com/google/common/collect/Iterators.java

          // A comparator that's used by the heap, allowing the heap
          // to be sorted based on the top of each iterator, with insertion order as tiebreaker
          Comparator<IndexedIterator<T>> heapComparator =
              (o1, o2) ->
                  ComparisonChain.start()
                      .compare(o1.iterator.peek(), o2.iterator.peek(), itemComparator)
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Sep 16 12:42:11 GMT 2025
    - 51.4K bytes
    - Click Count (0)
  5. cmd/xl-storage-format-v2.go

    	return true
    }
    
    // hasEC will return true if the version has erasure coding information.
    func (x xlMetaV2VersionHeader) hasEC() bool {
    	return x.EcM > 0 && x.EcN > 0
    }
    
    // sortsBefore can be used as a tiebreaker for stable sorting/selecting.
    // Returns false on ties.
    func (x xlMetaV2VersionHeader) sortsBefore(o xlMetaV2VersionHeader) bool {
    	if x == o {
    		return false
    	}
    	// Prefer newest modtime.
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 65.6K bytes
    - Click Count (1)
Back to Top