- Sort Score
- Num 10 results
- Language All
Results 311 - 320 of 594 for codes (0.04 seconds)
-
benchmarks/src/main/java/org/elasticsearch/benchmark/routing/allocation/AllocationBenchmark.java
// need its own main method and we cannot execute more than one class with a main method per JAR. @Param( { // indices| shards| replicas| nodes " 10| 1| 0| 1", " 10| 3| 0| 1", " 10| 10| 0| 1", " 100| 1| 0| 1",Created: Wed Apr 08 16:19:15 GMT 2026 - Last Modified: Tue Apr 13 08:33:41 GMT 2021 - 6.7K bytes - Click Count (0) -
README.md
* Composite Primary Key * Auto Migrations * Logger * Extendable, flexible plugin API: Database Resolver (Multiple Databases, Read/Write Splitting) / Prometheus… * Every feature comes with tests * Developer Friendly ## Getting Started * GORM Guides [https://gorm.io](https://gorm.io) * Gen Guides [https://gorm.io/gen/index.html](https://gorm.io/gen/index.html) ## Contributing
Created: Sun Apr 05 09:35:12 GMT 2026 - Last Modified: Thu Oct 30 09:30:20 GMT 2025 - 1.8K bytes - Click Count (0) -
docs/erasure/README.md
# MinIO Erasure Code Quickstart Guide [](https://slack.min.io) MinIO protects data against hardware failures and silent data corruption using erasure code and checksums. With the highest level of redundancy, you may lose up to half (N/2) of the total drives and still be able to recover the data. ## What is Erasure Code?
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Tue Aug 12 18:20:36 GMT 2025 - 4.2K bytes - Click Count (0) -
.ci/jobs.t/elastic+elasticsearch+pull-request+packaging-tests-windows-sample-nojdk.yml
display-name: "elastic / elasticsearch - pull request packaging-tests-windows-sample-nojdk" description: "Testing of Elasticsearch pull requests - packaging-tests-windows-sample-nojdk" # We use a hard-coded workspace directory here to avoid hitting windows path length limits child-workspace: "C:\\Users\\jenkins\\workspace\\pr-packaging-windows\\${BUILD_NUMBER}" project-type: matrix node: master scm: - git:Created: Wed Apr 08 16:19:15 GMT 2026 - Last Modified: Tue Aug 24 19:49:58 GMT 2021 - 2.2K bytes - Click Count (0) -
src/cmd/asm/doc.go
-shared Generate code that can be linked into a shared library. -spectre list Enable spectre mitigations in list (all, ret). -trimpath prefix Remove prefix from recorded source file paths. -v Print debug output. Input language: The assembler uses mostly the same syntax for all architectures, the main variation having to do with addressing modes. Input is
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Tue Aug 22 20:46:45 GMT 2023 - 1.8K bytes - Click Count (0) -
build-logic/documentation/src/main/groovy/gradlebuild/docs/ReleaseNotesTransformer.java
import com.google.common.io.CharStreams; import org.gradle.api.GradleException; import org.gradle.internal.UncheckedException; import org.jsoup.Jsoup; import org.jsoup.nodes.Document; import org.jsoup.nodes.DocumentType; import org.jsoup.nodes.Element; import org.jsoup.nodes.Node; import org.jsoup.select.Elements; import org.jsoup.select.NodeVisitor; import java.io.File; import java.io.FileReader; import java.io.FilterReader;
Created: Wed Apr 01 11:36:16 GMT 2026 - Last Modified: Tue Mar 03 01:59:51 GMT 2026 - 11.3K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/PredecessorsFunction.java
public interface PredecessorsFunction<N> { /** * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing * {@code node}'s incoming edges <i>against</i> the direction (if any) of the edge. * * <p>Some algorithms that operate on a {@code PredecessorsFunction} may produce undesired results
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 4K bytes - Click Count (0) -
benchmarks/src/main/java/org/elasticsearch/benchmark/search/aggregations/AggConstructionContentionBenchmark.java
import java.util.function.Function; /** * Benchmarks the overhead of constructing {@link Aggregator}s in many * parallel threads. Machines with different numbers of cores will see * wildly different results running this from running this with more * cores seeing more benefits from preallocation. */ @Fork(2) @Warmup(iterations = 10) @Measurement(iterations = 5) @BenchmarkMode(Mode.AverageTime)Created: Wed Apr 08 16:19:15 GMT 2026 - Last Modified: Wed Jun 16 08:22:22 GMT 2021 - 12.3K bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
Copyright 2016 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. //go:build !purego package aes import ( "crypto/internal/fips140deps/cpu" "crypto/internal/impl" ) type code int // Function codes for the cipher message family of instructions. const ( aes128 code = 18 aes192 code = 19 aes256 code = 20 ) type block struct { function code // code for cipher message instruction key []byte // key (128, 192 or 256 bits)...
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0) -
docs/en/docs/virtual-environments.md
What I normally do is that I create a directory named `code` inside my home/user directory. And inside of that I create one directory per project. <div class="termy"> ```console // Go to the home directory $ cd // Create a directory for all your code projects $ mkdir code // Enter into that code directory $ cd code // Create a directory for this project $ mkdir awesome-project
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 05 18:13:19 GMT 2026 - 22.1K bytes - Click Count (0)