- Sort Score
- Result 10 results
- Languages All
Results 541 - 550 of 696 for curLeft (0.12 sec)
-
docs/bucket/replication/DESIGN.md
### Existing object replication
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Tue Aug 12 18:20:36 UTC 2025 - 14.7K bytes - Viewed (0) -
cmd/bucket-replication-metrics.go
TotalDroppedBytes uint64 `json:"droppedBytes_since_uptime"` } // SMA struct for calculating simple moving average type SMA struct { buf []float64 window int // len of buf idx int // current index in buf CAvg float64 // cumulative average prevSMA float64 filledBuf bool } func newSMA(ln int) *SMA { if ln <= 0 { ln = defaultWindowSize } return &SMA{
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Thu Aug 15 12:04:40 UTC 2024 - 14.2K bytes - Viewed (0) -
cmd/data-usage-cache_gen.go
field, bts, err = msgp.ReadMapKeyZC(bts) if err != nil { err = msgp.WrapError(err) return } switch msgp.UnsafeString(field) { case "current": z.current, bts, err = msgp.ReadUint64Bytes(bts) if err != nil { err = msgp.WrapError(err, "current") return } case "next": z.next, bts, err = msgp.ReadUint64Bytes(bts) if err != nil { err = msgp.WrapError(err, "next")
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Sun Dec 15 22:50:12 UTC 2024 - 86.4K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Jul 18 15:05:43 UTC 2025 - 35.9K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/helper/DataIndexHelper.java
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Aug 07 03:06:29 UTC 2025 - 18.9K bytes - Viewed (0) -
src/main/java/jcifs/internal/smb1/AndXServerMessageBlock.java
// andx not used; return return dstIndex - start; } /* * The message provided to batch has a batchLimit that is * higher than the current batchLevel so we will now encode * that chained message. Before doing so we must increment * the batchLevel of the andx message in case it itself is an
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sun Aug 31 08:00:57 UTC 2025 - 15.8K bytes - Viewed (0) -
docs/en/docs/tutorial/security/oauth2-jwt.md
## Update the dependencies { #update-the-dependencies } Update `get_current_user` to receive the same token as before, but this time, using JWT tokens. Decode the received token, verify it, and return the current user. If the token is invalid, return an HTTP error right away. {* ../../docs_src/security/tutorial004_an_py310.py hl[90:107] *} ## Update the `/token` *path operation* { #update-the-token-path-operation }
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 10:49:48 UTC 2025 - 10.5K bytes - Viewed (0) -
api/maven-api-core/src/main/java/org/apache/maven/api/Session.java
*/ @Experimental @ThreadSafe public interface Session extends ProtoSession { /** * Returns the current maven version. * * @return the maven version, never {@code null} */ @Nonnull Version getMavenVersion(); /** * Retrieves the settings for the current session. * * @return the settings instance */ @Nonnull Settings getSettings(); /**
Registered: Sun Sep 07 03:35:12 UTC 2025 - Last Modified: Thu Jul 03 14:18:26 UTC 2025 - 36.5K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Booleans.java
// Obtain m = (-distance mod length), a non-negative value less than "length". This is how many // places left to rotate. int m = -distance % length; m = (m < 0) ? m + length : m; // The current index of what will become the first element of the rotated section. int newFirstIndex = m + fromIndex; if (newFirstIndex == fromIndex) { return; } reverse(array, fromIndex, newFirstIndex);
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Jul 17 15:26:41 UTC 2025 - 20.5K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Booleans.java
// Obtain m = (-distance mod length), a non-negative value less than "length". This is how many // places left to rotate. int m = -distance % length; m = (m < 0) ? m + length : m; // The current index of what will become the first element of the rotated section. int newFirstIndex = m + fromIndex; if (newFirstIndex == fromIndex) { return; } reverse(array, fromIndex, newFirstIndex);
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Jul 17 15:26:41 UTC 2025 - 20.5K bytes - Viewed (0)