- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 20 for Toor (0.15 sec)
-
src/main/resources/fess_indices/fess/nl/stopwords.txt
de en van ik te dat die in een hij het niet zijn is was op aan met als voor had er maar om hem dan zou of wat mijn men dit zo door over ze zich bij ook tot je mij uit der daar haar naar heb hoe heeft hebben deze u want nog zal me
Plain Text - Registered: Mon Apr 29 08:04:11 GMT 2024 - Last Modified: Mon Nov 27 12:59:36 GMT 2023 - 592 bytes - Viewed (0) -
android/guava/src/com/google/common/io/CharStreams.java
* close or flush the reader. * * <p>This is identical to {@link #copy(Readable, Appendable)} but optimized for these specific * types. CharBuffer has poor performance when being written into or read out of so round tripping * all the bytes through the buffer takes a long time. With these specialized types we can just * use a char array. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed May 17 14:35:11 GMT 2023 - 10.9K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/HashFunction.java
* between hash algorithms and the data they act on, so alternate hash algorithms can't be easily * substituted. Also, implementations of {@code hashCode} tend to be poor-quality, in part because * they end up depending on <i>other</i> existing poor-quality {@code hashCode} implementations, * including those in many JDK classes. * * <p>{@code Object.hashCode} implementations tend to be very fast, but have weak collision
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 25 18:22:59 GMT 2021 - 10.9K bytes - Viewed (0) -
okhttp/src/test/java/okhttp3/CallHandshakeTest.kt
TlsVersion.TLS_1_2, reversed, ) makeRequest(client) val expectedConnectionCipherSuites = expectedConnectionCipherSuites(client) // Will choose a poor cipher suite but not plaintext. // assertThat(handshake.cipherSuite).isEqualTo("TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256") assertThat(handshakeEnabledCipherSuites).containsExactly(
Plain Text - Registered: Fri Apr 26 11:42:10 GMT 2024 - Last Modified: Sat Jan 20 10:30:28 GMT 2024 - 11.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMaker.java
* WeakReference} (by default, strong references are used). * * <p>Weak values will be garbage collected once they are weakly reachable. This makes them a poor * candidate for caching. * * <p><b>Warning:</b> when this method is used, the resulting map will use identity ({@code ==})
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Mar 13 14:30:51 GMT 2023 - 12.8K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
* servers {@code alpha}, {@code bravo}, and {@code charlie} and you occasionally need to * take each of the servers offline, {@code consistentHash} will be a poor fit: It provides * no way for you to specify which of the three buckets is disappearing. Thus, if your * buckets change from {@code [alpha, bravo, charlie]} to {@code [bravo, charlie]}, it will
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 09 00:37:15 GMT 2024 - 29.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
* additional values interleaved with those shown above.) */ @CheckForNull abstract N visitNext(Deque<Iterator<? extends N>> horizon); } /** Poor man's method reference for {@code Deque::addFirst} and {@code Deque::addLast}. */ private enum InsertionOrder { FRONT { @Override <T> void insertInto(Deque<T> deque, T value) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 30 20:12:45 GMT 2023 - 19.8K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.java
// The Dolphin algorithm is attractive because it does the fewest array reads and writes: each // array slot is read and written exactly once. However, it can have very poor memory locality: // benchmarking shows it can take 7 times longer than the other two in some cases. The other two // do n swaps, minus a delta (0 or 2 for Reversal, gcd(d, n) for Successive), so that's about
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 29.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSet.java
// and reduces the false-positive probability. static final int MAX_RUN_MULTIPLIER = 13; /** * Checks the whole hash table for poor hash distribution. Takes O(n) in the worst case, O(n / * log n) on average. * * <p>The online hash flooding detecting in RegularSetBuilderImpl.add can detect e.g. many
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 35.4K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/CacheBuilder.java
* WeakReference} (by default, strong references are used). * * <p>Weak values will be garbage collected once they are weakly reachable. This makes them a poor * candidate for caching; consider {@link #softValues} instead. * * <p><b>Note:</b> when this method is used, the resulting cache will use identity ({@code ==}) * comparison to determine equality of values.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 44.8K bytes - Viewed (0)