- Sort Score
- Result 10 results
- Languages All
Results 221 - 230 of 977 for dash (0.09 sec)
-
.github/workflows/maven_build_itself.yml
- name: Build with Maven run: ./mvnw install -e -B -V -DdistributionFileName=apache-maven - name: Extract tarball shell: bash run: | set +e if [ -f ${{ env.TAR_BALL }} ]; then temp_dir=$(mktemp -d) tar -xzf ${{ env.TAR_BALL }} -C "$temp_dir" --strip 1 maven_bin_dir=$temp_dir/bin
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Mon Jun 03 17:58:28 UTC 2024 - 2.8K bytes - Viewed (0) -
docs/pt/docs/tutorial/sql-databases.md
/// tip | Dica É assim que você trataria **senhas**. Receba-as, mas não as retorne na API. Você também faria um **hash** com os valores das senhas antes de armazená-los, **nunca os armazene em texto simples**. /// Os campos de `HeroCreate` são: * `name` * `age` * `secret_name`
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 27 15:25:29 UTC 2024 - 15.8K bytes - Viewed (0) -
cmd/erasure-coding.go
encoded, err := e.EncodeData(GlobalContext, testData[:]) failOnErr(err) hash := xxhash.New() for i, data := range encoded { // Write index to keep track of sizes of each. _, err = hash.Write([]byte{byte(i)}) failOnErr(err) _, err = hash.Write(data) failOnErr(err) got[conf] = map[ErasureAlgo]uint64{algo: hash.Sum64()} } if a, b := want[conf], got[conf]; !reflect.DeepEqual(a, b) {
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Wed Jan 31 02:11:45 UTC 2024 - 8.6K bytes - Viewed (0) -
.github/workflows/arm-ci-extended.yml
runs-on: [self-hosted, linux, ARM64] strategy: fail-fast: false matrix: pyver: ['3.9', '3.10', '3.11', '3.12'] steps: - name: Stop old running containers (if any) shell: bash run: | running_containers=$(docker ps -q) && \ if [[ $running_containers == "" ]]; then echo "No running containers"; else
Registered: Tue Nov 05 12:39:12 UTC 2024 - Last Modified: Fri Nov 01 08:40:10 UTC 2024 - 2.6K bytes - Viewed (0) -
cmd/post-policy-fan-out.go
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Jan 18 07:03:17 UTC 2024 - 3.5K bytes - Viewed (0) -
compat/maven-compat/src/main/java/org/apache/maven/repository/legacy/DefaultUpdateCheckManager.java
Proxy proxy = repository.getProxy(); if (proxy != null) { if (proxy.getUserName() != null) { int hash = (proxy.getUserName() + proxy.getPassword()).hashCode(); buffer.append(hash).append('@'); } buffer.append(proxy.getHost()).append(':').append(proxy.getPort()).append('>'); }
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 12.1K bytes - Viewed (0) -
docs/de/docs/tutorial/body.md
<img src="/img/tutorial/body/image04.png"> Das ist nicht zufällig so, das ganze Framework wurde um dieses Design herum aufgebaut. Und es wurde in der Designphase gründlich getestet, vor der Implementierung, um sicherzustellen, dass es mit jedem Editor funktioniert. Es gab sogar ein paar Änderungen an Pydantic selbst, um das zu unterstützen.
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 8K bytes - Viewed (0) -
cmd/storage-datatypes_test.go
var buf bytes.Buffer msgp.Encode(&buf, &v) rd := msgp.NewEndlessReader(buf.Bytes(), b) dc := msgp.NewReader(rd) b.Log("Size:", buf.Len(), "bytes") b.SetBytes(1) b.ReportAllocs()
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Mon Sep 19 18:05:16 UTC 2022 - 9.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/MacHashFunctionTest.java
assertThrows(IllegalStateException.class, () -> hasher.putInt(42)); } public void testHashTwice() { Hasher hasher = Hashing.hmacMd5(MD5_KEY).newHasher(); assertEquals( "9753980fe94daa8ecaa82216519393a9", hasher.putString("The quick brown fox jumps over the lazy dog", UTF_8).hash().toString());
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Jul 23 14:22:54 UTC 2024 - 13.8K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/Striped64.java
* exists, a CAS is tried. Retries proceed by "double hashing", * using a secondary hash (Marsaglia XorShift) to try to find a * free slot. * * The table size is capped because, when there are more threads * than CPUs, supposing that each thread were bound to a CPU, * there would exist a perfect hash function mapping threads to * slots that eliminates collisions. When we reach capacity, we
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Jun 14 17:55:55 UTC 2024 - 11.5K bytes - Viewed (0)