Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 121 - 130 of 253 for Ford (0.04 seconds)

  1. src/test/java/org/codelibs/fess/suggest/index/contents/querylog/QueryLogTest.java

        }
    
        @Test
        public void test_longQuery() throws Exception {
            StringBuilder longQuery = new StringBuilder();
            for (int i = 0; i < 100; i++) {
                longQuery.append("word").append(i).append(" ");
            }
            String query = longQuery.toString().trim();
    
            QueryLog queryLog = new QueryLog(query, null);
    
            assertEquals(query, queryLog.getQueryString());
        }
    Created: Fri Apr 17 09:08:13 GMT 2026
    - Last Modified: Thu Nov 13 00:40:54 GMT 2025
    - 3.4K bytes
    - Click Count (0)
  2. 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: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Mar 28 06:59:19 GMT 2026
    - 576.9K bytes
    - Click Count (2)
  3. src/bufio/scan.go

    		if !isSpace(r) {
    			break
    		}
    	}
    	// Scan until space, marking end of word.
    	for width, i := 0, start; i < len(data); i += width {
    		var r rune
    		r, width = utf8.DecodeRune(data[i:])
    		if isSpace(r) {
    			return i + width, data[start:i], nil
    		}
    	}
    	// If we're at EOF, we have a final, non-empty, non-terminated word. Return it.
    	if atEOF && len(data) > start {
    		return len(data), data[start:], nil
    	}
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Wed May 21 18:05:26 GMT 2025
    - 14.2K bytes
    - Click Count (0)
  4. src/main/java/org/codelibs/fess/util/ComponentUtil.java

         */
        public static CrawlingInfoHelper getCrawlingInfoHelper() {
            return getComponent(CRAWLING_INFO_HELPER);
        }
    
        /**
         * Gets the popular word helper component.
         * @return The popular word helper.
         */
        public static PopularWordHelper getPopularWordHelper() {
            return getComponent(POPULAR_WORD_HELPER);
        }
    
        /**
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Mar 28 06:59:19 GMT 2026
    - 30.9K bytes
    - Click Count (0)
  5. docs/bigdata/README.md

    file: org.apache.spark.rdd.RDD[String] = s3a://testbucket/testdata MapPartitionsRDD[1] at textFile at <console>:24
    
    scala> val counts = file.flatMap(line => line.split(" ")).map(word => (word, 1)).reduceByKey(_ + _)
    counts: org.apache.spark.rdd.RDD[(String, Int)] = ShuffledRDD[4] at reduceByKey at <console>:25
    
    scala> counts.saveAsTextFile("s3a://testbucket/wordcount")
    ```
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Tue Aug 12 18:20:36 GMT 2025
    - 14.7K bytes
    - Click Count (0)
  6. src/main/webapp/WEB-INF/view/common/help.jsp

    		the end of the term you are searching.
    		<pre>Fess^100</pre>
    	</dd>
    	<dt>Fuzzy</dt>
    	<dd>
    		To do a fuzzy search use the "~" symbol at the end of a single word
    		term. For example to search for a term similar in spelling to "Fess"
    		use the fuzzy search:
    		<pre>Fess~0.5</pre>
    	</dd>
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Mon Feb 26 14:01:31 GMT 2018
    - 2.4K bytes
    - Click Count (0)
  7. src/test/java/org/codelibs/fess/rank/fusion/RankFusionSearcherTest.java

            protected SearchResult search(String query, SearchRequestParams params, OptionalThing<FessUserBean> userBean) {
                return SearchResult.create().build();
            }
        }
    
        /**
         * Multi-word class name searcher.
         */
        static class MyCustomSearcher extends RankFusionSearcher {
            @Override
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Fri Mar 13 23:01:26 GMT 2026
    - 6.5K bytes
    - Click Count (0)
  8. doc/go_mem.html

    </p>
    
    <p>
    Reads of memory locations larger than a single machine word
    are encouraged but not required to meet the same semantics
    as word-sized memory locations,
    observing a single allowed write <i>w</i>.
    For performance reasons,
    implementations may instead treat larger operations
    as a set of individual machine-word-sized operations
    in an unspecified order.
    This means that races on multiword data structures
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Tue Aug 05 15:41:37 GMT 2025
    - 26.6K bytes
    - Click Count (0)
  9. src/test/java/org/codelibs/fess/suggest/entity/SuggestItemBoundaryTest.java

            SuggestItem item2 = new SuggestItem(text2, readings2, null, 0L, 0L, 1.0f, null, null, null, SuggestItem.Kind.QUERY);
    
            // Different word order should produce different IDs (since text is "word1 word2" vs "word2 word1")
            assertFalse("Different word order should produce different IDs", item1.getId().equals(item2.getId()));
        }
    Created: Fri Apr 17 09:08:13 GMT 2026
    - Last Modified: Sat Jan 17 05:10:37 GMT 2026
    - 22.2K bytes
    - Click Count (0)
  10. .github/PULL_REQUEST_TEMPLATE.md

    #### What this PR does / why we need it:
    
    #### Which issue(s) this PR is related to:
    <!--
    Please link relevant issues to help with tracking.
    
    To automatically close the linked issue(s) when this PR is merged,
    add the word "Fixes" before the issue number or link.
    Do not use "Fixes" if the PR is of kind `failing-test` or `flake`.
    
    Reference KEPs when applicable in addition to specific issues.
    
    Examples:
    Fixes #<issue number>
    Created: Fri Apr 03 09:05:14 GMT 2026
    - Last Modified: Tue Jan 20 23:14:09 GMT 2026
    - 3.1K bytes
    - Click Count (0)
Back to Top