- Sort Score
- Result 10 results
- Languages All
Results 81 - 90 of 173 for Ismail (0.15 sec)
-
src/main/java/org/codelibs/fess/app/web/admin/fileconfig/AdminFileconfigAction.java
} // =================================================================================== // Small Helper // ============ protected void verifyCrudMode(final int crudMode, final int expectedMode) { if (crudMode != expectedMode) {
Java - Registered: Mon May 06 08:04:11 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 17.1K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/util/ResourceUtil.java
public static Path getOrigPath(final String... names) { return getPath("WEB-INF/", "orig", names); } public static Path getMailTemplatePath(final String... names) { return getPath("WEB-INF/", "mail", names); } public static Path getViewTemplatePath(final String... names) { return getPath("WEB-INF/", "view", names); } public static Path getDictionaryPath(final String... names) {
Java - Registered: Mon May 06 08:04:11 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 7.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/MathTesting.java
ImmutableSet.Builder<Double> fractionalBuilder = ImmutableSet.builder(); integralBuilder.addAll(Doubles.asList(0.0, -0.0, Double.MAX_VALUE, -Double.MAX_VALUE)); // Add small multiples of MIN_VALUE and MIN_NORMAL for (int scale = 1; scale <= 4; scale++) { for (double d : Doubles.asList(Double.MIN_VALUE, Double.MIN_NORMAL)) { fractionalBuilder.add(d * scale).add(-d * scale);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 11.2K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/es/user/bsbhv/BsUserBhv.java
result.setLabeledURI(DfTypeUtil.toString(source.get("labeledURI"))); result.setMail(DfTypeUtil.toString(source.get("mail"))); result.setMobile(DfTypeUtil.toString(source.get("mobile"))); result.setName(DfTypeUtil.toString(source.get("name"))); result.setPager(DfTypeUtil.toString(source.get("pager")));
Java - Registered: Mon May 06 08:04:11 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 12K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/SmoothRateLimiter.java
double stableIntervalMicros; /** * The time when the next request (no matter its size) will be granted. After granting a request, * this is pushed further in the future. Large requests push this further than small requests. */ private long nextFreeTicketMicros = 0L; // could be either in the past or future private SmoothRateLimiter(SleepingStopwatch stopwatch) { super(stopwatch); } @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 19.3K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/Constants.java
"Crawler,crawler,Bot,bot,Slurp,Yeti,Baidu,Steeler,ichiro,hotpage,Feedfetcher,ia_archiver,Y!J-BRI,Google Desktop,Seznam,Tumblr,YandexBot,Chilkat,CloudFront,Mediapartners,MSIE 6"; public static final String DEFAULT_FROM_EMAIL = "Administrator <root@localhost>"; // info map public static final String CRAWLER_STATUS = "CrawlerStatus"; public static final String CRAWLER_ERRORS = "CrawlerErrors";
Java - Registered: Mon May 06 08:04:11 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 16.4K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
// Timed Get // There are a few design constraints to consider // * We want to be responsive to small timeouts, unpark() has non trivial latency overheads (I // have observed 12 micros on 64-bit linux systems to wake up a parked thread). So if the // timeout is small we shouldn't park(). This needs to be traded off with the cpu overhead of
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 63K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java
Random random = new Random(0); Multiset<Integer> elements = HashMultiset.create(); MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue.create(); int range = 10_000; // range should be small enough that equal elements occur semi-frequently for (int iter = 0; iter < reduceIterationsIfGwt(1000); iter++) { for (int i = 0; i < 100; i++) { Integer element = random.nextInt(range);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 36.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/ImmutableMapTest.java
.buildKeepingLast(); assertMapEquals(map, key1, 3, key2, 4); } // The java7 branch has different code depending on whether the entry indexes fit in a byte, // short, or int. The small table in testBuildKeepingLast_allowsOverwrite will test the byte // case. This method tests the short case. public void testBuildKeepingLast_shortTable() { Builder<Integer, String> builder = ImmutableMap.builder();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 27 13:27:08 GMT 2024 - 41.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableMap.java
* new ImmutableMap.Builder<String, Integer>() * .put("one", 1) * .put("two", 2) * .put("three", 3) * .buildOrThrow(); * }</pre> * * <p>For <i>small</i> immutable maps, the {@code ImmutableMap.of()} methods are even more * convenient. * * <p>By default, a {@code Builder} will generate maps that iterate over entries in the order they
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 41.7K bytes - Viewed (0)