- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 172 for calculated (0.06 sec)
-
internal/event/target/webhook.go
args: args, loggerOnce: loggerOnce, transport: transport, store: queueStore, cancel: cancel, cancelCh: ctx.Done(), } // Calculate the webhook addr with the port number format target.addr = args.Endpoint.Host if _, _, err := net.SplitHostPort(args.Endpoint.Host); err != nil && strings.Contains(err.Error(), "missing port in address") {
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri Sep 06 23:06:30 UTC 2024 - 8.8K bytes - Viewed (0) -
docs/debugging/reorder-disks/main.go
if err != nil { log.Fatal(err) } setSize := len(format.XL.Sets[0]) expectedDisksName := make(map[string]string) actualDisksName := make(map[string]string) // Calculate the set/disk index for _, disk := range localDisks { expectedDisksName[fmt.Sprintf("%d-%d", disk.index/setSize, disk.index%setSize)] = disk.path format, err := getFormatJSON(disk.path) if err != nil {
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 5.4K bytes - Viewed (0) -
guava/src/com/google/common/graph/AbstractBaseGraph.java
* @param <N> Node parameter type */ @ElementTypesAreNonnullByDefault abstract class AbstractBaseGraph<N> implements BaseGraph<N> { /** * Returns the number of edges in this graph; used to calculate the size of {@link Graph#edges()}. * This implementation requires O(|N|) time. Classes extending this one may manually keep track of * the number of edges as the graph is updated, and override this method for better performance.
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 7.2K bytes - Viewed (0) -
cmd/bitrot-streaming.go
import ( "bytes" "context" "hash" "io" "sync" xhttp "github.com/minio/minio/internal/http" "github.com/minio/minio/internal/ioutil" "github.com/minio/minio/internal/ringbuffer" ) // Calculates bitrot in chunks and writes the hash into the stream. type streamingBitrotWriter struct { iow io.WriteCloser closeWithErr func(err error) h hash.Hash shardSize int64
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Wed Aug 21 12:20:54 UTC 2024 - 6K bytes - Viewed (0) -
compat/maven-compat/src/main/java/org/apache/maven/repository/RepositorySystem.java
String id, String url, ArtifactRepositoryLayout repositoryLayout, ArtifactRepositoryPolicy snapshots, ArtifactRepositoryPolicy releases); /** * Calculates the effective repositories for the given input repositories which are assumed to be already mirrored * (if applicable). This process will essentially remove duplicate repositories by merging them into one equivalent
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 7.7K bytes - Viewed (0) -
compat/maven-model-builder/src/main/java/org/apache/maven/model/inheritance/DefaultInheritanceAssembler.java
hints.put(MavenModelMerger.CHILD_PATH_ADJUSTMENT, getChildPathAdjustment(child, parent, childPath)); return merger.merge(child, parent, false, hints); } /** * Calculates the relative path from the base directory of the parent to the parent directory of the base directory * of the child. The general idea is to adjust inherited URLs to match the project layout (in SCM). *
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 13.9K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/WebSocket.kt
/** * Returns the size in bytes of all messages enqueued to be transmitted to the server. This * doesn't include framing overhead. If compression is enabled, uncompressed messages size * is used to calculate this value. It also doesn't include any bytes buffered by the operating * system or network intermediaries. This method returns 0 if no messages are waiting in the
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 5.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/Crc32cHashFunctionTest.java
String.format("expected: %08x, actual: %08x", expectedCrc, actualCrc), expectedCrc, actualCrcHasher); } // From RFC 3720, Section 12.1, the polynomial generator is 0x11EDC6F41. // We calculate the constant below by: // 1. Omitting the most significant bit (because it's always 1). => 0x1EDC6F41 // 2. Flipping the bits of the constant so we can process a byte at a time. => 0x82F63B78
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Jul 23 14:22:54 UTC 2024 - 6.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/Crc32cHashFunctionTest.java
String.format("expected: %08x, actual: %08x", expectedCrc, actualCrc), expectedCrc, actualCrcHasher); } // From RFC 3720, Section 12.1, the polynomial generator is 0x11EDC6F41. // We calculate the constant below by: // 1. Omitting the most significant bit (because it's always 1). => 0x1EDC6F41 // 2. Flipping the bits of the constant so we can process a byte at a time. => 0x82F63B78
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Jul 23 14:22:54 UTC 2024 - 6.5K bytes - Viewed (0) -
docs/en/docs/js/termynal.js
this.container.setAttribute('data-termynal', ''); } /** * Initialise the widget, get lines, clear container and start animation. */ init() { /** * Calculates width and height of Termynal container. * If container is empty and lines are dynamically loaded, defaults to browser `auto` or CSS. */ const containerStyle = getComputedStyle(this.container);
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Thu May 12 00:06:16 UTC 2022 - 9.3K bytes - Viewed (0)