- Sort Score
- Result 10 results
- Languages All
Results 181 - 190 of 349 for Forking (0.07 sec)
-
android/guava/src/com/google/common/primitives/UnsignedLongs.java
* unsigned. * * <p><b>Java 8+ users:</b> use {@link Long#toUnsignedString(long, int)} instead. * * @param x the value to convert to a string. * @param radix the radix to use while working with {@code x} * @throws IllegalArgumentException if {@code radix} is not between {@link Character#MIN_RADIX} * and {@link Character#MAX_RADIX}. */ public static String toString(long x, int radix) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Aug 12 21:04:48 UTC 2024 - 17.6K bytes - Viewed (0) -
guava/src/com/google/common/reflect/Types.java
import java.util.Map.Entry; import java.util.concurrent.atomic.AtomicReference; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * Utilities for working with {@link Type}. * * @author Ben Yu */ @ElementTypesAreNonnullByDefault final class Types { /** Class#toString without the "class " and "interface " prefixes */
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Oct 21 14:28:19 UTC 2024 - 23K bytes - Viewed (0) -
ci/official/utilities/extract_resultstore_links.py
f'Bazel invocations.\n' f'ResultStore contains individual representations of each target ' f'that were run/built during the invocation.\n' f'These results are generally easier to read than looking through ' f'the entire build log:\n') i = 1 for url, invocation_results in result_store_dict.items(): line_str = f'Invocation #{i} ({invocation_results["status"]}):\n'
Registered: Tue Nov 05 12:39:12 UTC 2024 - Last Modified: Wed Nov 08 17:50:27 UTC 2023 - 10.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableList.java
? ImmutableList.<E>of() : ImmutableList.<E>construct(elements.clone()); } /** * Returns an immutable list containing the given elements, sorted according to their natural * order. The sorting algorithm used is stable, so elements that compare as equal will stay in the * order in which they appear in the input. * * <p>If your data has no duplicates, or you wish to deduplicate elements, use {@code
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 16 21:21:17 UTC 2024 - 27.7K bytes - Viewed (0) -
internal/dsync/dsync_test.go
func TestFailedRefreshLock(t *testing.T) { if testing.Short() { t.Skip("skipping test in short mode.") } // Simulate Refresh response to return no locking found for i := range lockServers[:3] { lockServers[i].setRefreshReply(false) defer lockServers[i].setRefreshReply(true) } dm := NewDRWMutex(ds, "aap") dm.refreshInterval = 500 * time.Millisecond
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Wed Jun 19 14:35:19 UTC 2024 - 11.1K bytes - Viewed (0) -
docs/en/docs/management-tasks.md
* Start the title with a verb. For example `Add`, `Refactor`, `Fix`, etc. This way the title will say the action that the PR does. Like `Add support for teleporting`, instead of `Teleporting wasn't working, so this PR fixes it`. * Edit the text of the PR title to start in "imperative", like giving an order. So, instead of `Adding support for teleporting` use `Add support for teleporting`.
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Fri Aug 16 21:56:33 UTC 2024 - 14.2K bytes - Viewed (0) -
docs/features/interceptors.md
response.request().url(), (t2 - t1) / 1e6d, response.headers())); return response; } } ``` A call to `chain.proceed(request)` is a critical part of each interceptor’s implementation. This simple-looking method is where all the HTTP work happens, producing a response to satisfy the request. If `chain.proceed(request)` is being called more than once previous response bodies must be closed.
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Sun Feb 06 02:19:09 UTC 2022 - 8.1K bytes - Viewed (0) -
cmd/erasure-metadata-utils.go
} // hashOrder - hashes input key to return consistent // hashed integer slice. Returned integer order is salted // with an input key. This results in consistent order. // NOTE: collisions are fine, we are not looking for uniqueness // in the slices returned. func hashOrder(key string, cardinality int) []int { if cardinality <= 0 { // Returns an empty int slice for cardinality < 0. return nil }
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 11.7K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* * <ul> * <li>for an unnested {@code lock()} and {@code unlock()}, a cycle detecting lock takes 38ns as * opposed to the 24ns taken by a plain lock. * <li>for nested locking, the cost increases with the depth of the nesting: * <ul> * <li>2 levels: average of 64ns per lock()/unlock() * <li>3 levels: average of 77ns per lock()/unlock()
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Dec 15 19:31:54 UTC 2023 - 35.9K bytes - Viewed (0) -
android/guava/src/com/google/common/eventbus/SubscriberRegistry.java
* All registered subscribers, indexed by event type. * * <p>The {@link CopyOnWriteArraySet} values make it easy and relatively lightweight to get an * immutable snapshot of all current subscribers to an event without any locking. */ private final ConcurrentMap<Class<?>, CopyOnWriteArraySet<Subscriber>> subscribers = Maps.newConcurrentMap(); /** The event bus this registry belongs to. */ @Weak private final EventBus bus;
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 17 15:16:45 UTC 2024 - 10.8K bytes - Viewed (0)