- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 779 for search_ (0.14 sec)
-
src/test/java/org/codelibs/core/beans/util/CopyOptionsTest.java
*/ @Test public void testPrefix() throws Exception { final CopyOptions option = new CopyOptions(); assertThat(option.prefix(BeanNames.search_()), is(sameInstance(option))); assertThat(option.prefix, is("search_")); } /** * @throws Exception */ @Test public void testBeanDelimiter() throws Exception { final CopyOptions option = new CopyOptions();Registered: Sat Dec 20 08:55:33 UTC 2025 - Last Modified: Fri Jun 20 13:40:57 UTC 2025 - 12K bytes - Viewed (0) -
src/test/java/org/codelibs/core/beans/util/BeanUtilTest.java
return createCharSequence("abc_exclude"); } /** * @return CharSequence */ public static CharSequence search_() { return createCharSequence("search_"); } /** * @return CharSequence */ public static CharSequence abc_() { return createCharSequence("abc_");
Registered: Sat Dec 20 08:55:33 UTC 2025 - Last Modified: Fri Jun 20 13:40:57 UTC 2025 - 34.5K bytes - Viewed (0) -
src/main/webapp/WEB-INF/orig/view/search.jsp
<c:if test="${s.index < 3}"> <la:link href="/search?q=${f:u(item)}${fe:facetQuery()}${fe:geoQuery()}">${f:h(item)}</la:link> </c:if> <c:if test="${3 <= s.index}"> <la:link styleClass="d-none d-sm-inline-block" href="/search?q=${f:u(item)}${fe:facetQuery()}${fe:geoQuery()}">${f:h(item)}</la:link> </c:if> </c:forEach> </p>Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Sat Jan 18 11:38:54 UTC 2025 - 6.8K bytes - Viewed (0) -
src/main/webapp/WEB-INF/view/search.jsp
<c:if test="${s.index < 3}"> <la:link href="/search?q=${f:u(item)}${fe:facetQuery()}${fe:geoQuery()}">${f:h(item)}</la:link> </c:if> <c:if test="${3 <= s.index}"> <la:link styleClass="d-none d-sm-inline-block" href="/search?q=${f:u(item)}${fe:facetQuery()}${fe:geoQuery()}">${f:h(item)}</la:link> </c:if> </c:forEach> </p>Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Thu Nov 13 05:54:52 UTC 2025 - 6.7K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/rank/fusion/RankFusionProcessor.java
} /** * Performs a search using only the main searcher without rank fusion. * This method is used when only one searcher is available or configured. * * @param searcher the main searcher to use for the search operation * @param query the search query string * @param params search request parameters including pagination and filtersRegistered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Fri Nov 28 16:29:12 UTC 2025 - 27.5K bytes - Viewed (0) -
src/main/resources/fess_indices/fess/alias/fess.search.json
Shinsuke Sugaya <******@****.***> 1472095477 +0900
Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Thu Aug 25 03:25:32 UTC 2016 - 2 bytes - Viewed (0) -
src/main/java/org/codelibs/fess/app/web/admin/general/EditForm.java
*/ @Size(max = 1000) public String notificationTo; /** * Enable or disable search suggestions based on search logs. * When enabled, suggestions are generated from previous searches. */ @Size(max = 10) public String suggestSearchLog; /** * Enable or disable search suggestions based on document content. * When enabled, suggestions are generated from indexed documents.Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Sat Dec 13 02:21:17 UTC 2025 - 10.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/SortedLists.java
@ParametricNullness E key, List<? extends E> list, int foundIndex) { // Of course, we have to use binary search to find the precise // breakpoint... int lower = 0; int upper = foundIndex; // Of course, we have to use binary search to find the precise breakpoint... // Everything between lower and upper inclusive compares at <= 0. while (lower < upper) {Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 10.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/SortedLists.java
@ParametricNullness E key, List<? extends E> list, int foundIndex) { // Of course, we have to use binary search to find the precise // breakpoint... int lower = 0; int upper = foundIndex; // Of course, we have to use binary search to find the precise breakpoint... // Everything between lower and upper inclusive compares at <= 0. while (lower < upper) {Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 10.9K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/rank/fusion/RankFusionSearcher.java
} return name; } /** * Executes a search operation with the specified parameters. * This method must be implemented by concrete searcher classes. * * @param query the search query string * @param params the search request parameters including pagination, filters, etc.Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Thu Jul 17 08:28:31 UTC 2025 - 2.5K bytes - Viewed (0)