- Sort Score
- Num 10 results
- Language All
Results 1 - 5 of 5 for 1L (0.04 seconds)
-
src/test/java/org/codelibs/fess/crawler/transformer/FessXpathTransformerTest.java
final Document document = getDocument(data); ComponentUtil.setFessConfig(new FessConfig.SimpleImpl() { private static final long serialVersionUID = 1L; @Override public String getCrawlerDocumentHtmlPrunedTags() { return ""; } });
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Fri Mar 13 23:01:26 GMT 2026 - 62.9K bytes - Click Count (0) -
src/test/java/org/codelibs/fess/helper/CoordinatorHelperTest.java
return response; } private void setupMockFessConfig() { ComponentUtil.setFessConfig(new FessConfig.SimpleImpl() { private static final long serialVersionUID = 1L; @Override public String getIndexConfigIndex() { return "fess_config"; } @Override public Integer getCoordinatorPollIntervalAsInteger() {Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Mar 28 06:59:19 GMT 2026 - 58.6K bytes - Click Count (0) -
src/test/java/org/codelibs/fess/job/IndexExportJobTest.java
assertFalse(json.contains("\"cache\"")); } private static class TestFessConfig extends FessConfig.SimpleImpl { private static final long serialVersionUID = 1L; private final String exportPath; private final String excludeFields; private final String scrollSize;
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sun Mar 15 09:08:38 GMT 2026 - 66.1K bytes - Click Count (0) -
guava/src/com/google/common/collect/MapMakerInternalMap.java
// CONTAINS_VALUE_RETRIES increases, though without locking it is theoretically possible. Segment<K, V, E, S>[] segments = this.segments; long last = -1L; for (int i = 0; i < CONTAINS_VALUE_RETRIES; i++) { long sum = 0L; for (Segment<K, V, E, S> segment : segments) { // ensure visibility of most recent completed writeCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 89.9K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
// CONTAINS_VALUE_RETRIES increases, though without locking it is theoretically possible. Segment<K, V, E, S>[] segments = this.segments; long last = -1L; for (int i = 0; i < CONTAINS_VALUE_RETRIES; i++) { long sum = 0L; for (Segment<K, V, E, S> segment : segments) { // ensure visibility of most recent completed writeCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 89.9K bytes - Click Count (0)