- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 162 for resultats (0.15 sec)
-
guava-tests/benchmark/com/google/common/base/AsciiBenchmark.java
@Param boolean noWorkToDo; Random random; String testString; @BeforeExperiment void setUp() { random = new Random(0xdeadbeef); // fix the seed so results are comparable across runs int nonAlpha = size / nonAlphaRatio; int alpha = size - nonAlpha; List<Character> chars = Lists.newArrayListWithCapacity(size); for (int i = 0; i < alpha; i++) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 4.8K bytes - Viewed (0) -
android/guava/src/com/google/common/escape/Escaper.java
* {@code escape(s.substring(0, n)) + escape(s.substring(n))} for arbitrary {@code n}. This is * because of the possibility of splitting a surrogate pair. The only case in which it is safe to * escape strings and concatenate the results is if you can rule out this possibility, either by * splitting an existing long string into short strings adaptively around {@linkplain * Character#isHighSurrogate surrogate} {@linkplain Character#isLowSurrogate pairs}, or by starting
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 01 16:02:17 GMT 2021 - 4.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/PredecessorsFunction.java
* {@code node}'s incoming edges <i>against</i> the direction (if any) of the edge. * * <p>Some algorithms that operate on a {@code PredecessorsFunction} may produce undesired results * if the returned {@link Iterable} contains duplicate elements. Implementations of such * algorithms should document their behavior in the presence of duplicates. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/SuccessorsFunction.java
* edges". For that functionality, see {@link Graphs#reachableNodes(Graph, Object)}. * * <p>Some algorithms that operate on a {@code SuccessorsFunction} may produce undesired results * if the returned {@link Iterable} contains duplicate elements. Implementations of such * algorithms should document their behavior in the presence of duplicates. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/FarmHashFingerprint64Test.java
private static long fingerprint(byte[] bytes, int length) { return HASH_FN.hashBytes(bytes, 0, length).asLong(); } /** * Tests that the Java port of FarmHashFingerprint64 provides the same results on buffers up to * 800 bytes long as the C++ reference implementation. */ public void testMultipleLengths() { int iterations = 800; byte[] buf = new byte[iterations * 4]; int bufLen = 0;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Jul 19 14:00:24 GMT 2016 - 6.2K bytes - Viewed (0) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/DefaultModelBuilder.java
throw problems.newModelBuilderException(); } inputModel = activateFileModel(inputModel, request, result, problems); problems.setRootModel(inputModel); ModelData resultData = new ModelData(request.getSource(), inputModel); String superModelVersion = inputModel.getModelVersion() != null ? inputModel.getModelVersion() : "4.0.0"; if (!VALID_MODEL_VERSIONS.contains(superModelVersion)) {
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Fri May 03 08:48:38 GMT 2024 - 61.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/Fingerprint2011Test.java
private static long fingerprint(byte[] bytes, int length) { return HASH_FN.hashBytes(bytes, 0, length).asLong(); } /** * Tests that the Java port of Fingerprint2011 provides the same results on buffers up to 800 * bytes long as the original implementation in C++. See http://cl/106539598 */ public void testMultipleLengths() { int iterations = 800; byte[] buf = new byte[iterations * 4];
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Dec 29 14:55:25 GMT 2021 - 7.6K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/app/web/base/FessSearchAction.java
final HttpSession session = request.getSession(false); if (session != null) { final Object resultsPerPage = session.getAttribute(Constants.RESULTS_PER_PAGE); if (resultsPerPage instanceof Integer) { form.num = (Integer) resultsPerPage; } } // label
Java - Registered: Mon May 06 08:04:11 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 10K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Sets.java
* corresponding {@link Set} implementation (such as {@link java.util.HashMap} or {@link * java.util.TreeMap}). * * <p>Each method invocation on the set returned by this method results in exactly one method * invocation on the backing map or its {@code keySet} view, with one exception. The {@code * addAll} method is implemented as a sequence of {@code put} invocations on the backing map. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 77.4K bytes - Viewed (0) -
guava/src/com/google/common/cache/CacheStats.java
* loaded) value, or null. Multiple concurrent calls to {@link Cache} lookup methods on an absent * value can result in multiple misses, all returning the results of a single cache load * operation. */ public long missCount() { return missCount; } /** * Returns the ratio of cache requests which were misses. This is defined as {@code missCount /
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Sun Aug 07 02:38:22 GMT 2022 - 12.6K bytes - Viewed (0)