- Sort Score
- Result 10 results
- Languages All
Results 141 - 150 of 359 for Hasher (0.04 sec)
-
guava/src/com/google/common/util/concurrent/ListenableFuture.java
* Futures#transform(ListenableFuture, com.google.common.base.Function, Executor) Futures.transform} * (or {@link FluentFuture#transform(com.google.common.base.Function, Executor) * FluentFuture.transform}), but you will often find it easier to use a framework. Frameworks * automate the process, often adding features like monitoring, debugging, and cancellation. * Examples of frameworks include: * * <ul>
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 8K bytes - Viewed (0) -
docs/en/docs/tutorial/extra-models.md
This is especially the case for user models, because: * The **input model** needs to be able to have a password. * The **output model** should not have a password. * The **database model** would probably need to have a hashed password. /// danger Never store user's plaintext passwords. Always store a "secure hash" that you can then verify.
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:15:41 UTC 2025 - 7.2K bytes - Viewed (0) -
guava/src/com/google/common/primitives/UnsignedInteger.java
import org.jspecify.annotations.Nullable; /** * A wrapper class for unsigned {@code int} values, supporting arithmetic operations. * * <p>In some cases, when speed is more important than code readability, it may be faster simply to * treat primitive {@code int} values as unsigned, using the methods from {@link UnsignedInts}. * * <p>See the Guava User Guide article on <a
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 8.3K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Chars.java
* moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Chars.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <p>The provided "distance" may be negative, which will rotate left. * * @since 32.0.0 */ public static void rotate(char[] array, int distance) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 24.2K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Shorts.java
* moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Shorts.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <p>The provided "distance" may be negative, which will rotate left. * * @since 32.0.0 */ public static void rotate(short[] array, int distance) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 25.8K bytes - Viewed (0) -
android/guava/src/com/google/common/io/CharSource.java
* * <p>If {@link ByteSource#asCharSource} is called on the returned source with the same charset, * the default implementation of this method will ensure that the original {@code CharSource} is * returned, rather than round-trip encoding. Subclasses that override this method should behave * the same way. * * @since 20.0 */ public ByteSource asByteSource(Charset charset) { return new AsByteSource(charset);
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Jul 16 17:42:14 UTC 2025 - 25.7K bytes - Viewed (0) -
guava/src/com/google/common/io/CharSource.java
* * <p>If {@link ByteSource#asCharSource} is called on the returned source with the same charset, * the default implementation of this method will ensure that the original {@code CharSource} is * returned, rather than round-trip encoding. Subclasses that override this method should behave * the same way. * * @since 20.0 */ public ByteSource asByteSource(Charset charset) { return new AsByteSource(charset);
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Jul 16 17:42:14 UTC 2025 - 25.3K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Shorts.java
* moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Shorts.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <p>The provided "distance" may be negative, which will rotate left. * * @since 32.0.0 */ public static void rotate(short[] array, int distance) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 25.8K bytes - Viewed (0) -
CONTRIBUTING.md
[security]: https://square.github.io/okhttp/security/ [works_with_okhttp]: https://square.github.io/okhttp/works_with_okhttp/
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Tue Feb 14 08:26:50 UTC 2023 - 2K bytes - Viewed (0) -
docs/contribute/contributing.md
[security]: https://square.github.io/okhttp/security/ [works_with_okhttp]: https://square.github.io/okhttp/works_with_okhttp/
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Tue Feb 14 08:26:50 UTC 2023 - 2K bytes - Viewed (0)