- Sort Score
- Result 10 results
- Languages All
Results 731 - 740 of 773 for 11 (0.03 sec)
-
guava-tests/test/com/google/common/collect/ImmutableSortedSetTest.java
return false; } } return true; }; TypeWithDuplicates a = new TypeWithDuplicates(1, 1); TypeWithDuplicates b1 = new TypeWithDuplicates(2, 1); TypeWithDuplicates b2 = new TypeWithDuplicates(2, 2); TypeWithDuplicates c = new TypeWithDuplicates(3, 1); CollectorTester.of(collector, equivalence)
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 46.7K bytes - Viewed (0) -
pom.xml
<artifactId>sai</artifactId> <version>${sai.version}</version> </dependency> <dependency> <groupId>org.codelibs</groupId> <artifactId>xpp3</artifactId> <version>1.1.4c.0</version> </dependency> <dependency> <groupId>org.codelibs</groupId> <artifactId>curl4j</artifactId> <version>${curl4j.version}</version> </dependency> <dependency>
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Sat Oct 26 02:16:03 UTC 2024 - 49.1K bytes - Viewed (0) -
src/main/webapp/css/font-awesome.min.css
/*! * Font Awesome Free 5.12.0 by @fontawesome - https://fontawesome.com * License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) */
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Sat Dec 14 21:22:25 UTC 2019 - 55.8K bytes - Viewed (1) -
cmd/object-api-utils.go
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Aug 08 15:29:58 UTC 2024 - 37.1K bytes - Viewed (0) -
helm-releases/minio-3.4.6.tgz
minio-3.4.6.tar minio/Chart.yaml apiVersion: v1 appVersion: RELEASE.2022-01-08T03-11-54Z description: Multi-Cloud Object Storage home: https://min.io icon: https://min.io/resources/img/logo/MINIO_wordmark.png keywords: - minio - storage - object-storage - s3 - cluster maintainers: - email: ******@****.*** name: MinIO, Inc name: minio sources: - https://github.com/minio/minio version: 3.4.6 minio/values.yaml ## Provide a name in place of minio for `app:` labels ## nameOverride: "" ## Provide a name...
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Sat Jan 08 06:24:06 UTC 2022 - 15.2K bytes - Viewed (0) -
internal/bucket/lifecycle/lifecycle_test.go
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu May 23 01:12:48 UTC 2024 - 55.1K bytes - Viewed (0) -
cmd/xl-storage-format-v1_gen.go
return } // Msgsize returns an upper bound estimate of the number of bytes occupied by the serialized message func (z *ErasureInfo) Msgsize() (s int) { s = 1 + 10 + msgp.StringPrefixSize + len(z.Algorithm) + 11 + msgp.IntSize + 13 + msgp.IntSize + 10 + msgp.Int64Size + 6 + msgp.IntSize + 13 + msgp.ArrayHeaderSize + (len(z.Distribution) * (msgp.IntSize)) + 10 + msgp.ArrayHeaderSize for za0002 := range z.Checksums {
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Tue Oct 22 15:30:50 UTC 2024 - 41.2K bytes - Viewed (0) -
.bazelrc
build:macos_arm64 --macos_minimum_os=11.0 # iOS configs for each architecture and the fat binary builds. build:ios --apple_platform_type=ios build:ios --apple_bitcode=embedded --copt=-fembed-bitcode build:ios --copt=-Wno-c++11-narrowing build:ios_armv7 --config=ios build:ios_armv7 --cpu=ios_armv7 build:ios_arm64 --config=ios build:ios_arm64 --cpu=ios_arm64 build:ios_arm64e --config=ios build:ios_arm64e --cpu=ios_arm64e
Registered: Tue Nov 05 12:39:12 UTC 2024 - Last Modified: Mon Oct 28 22:02:31 UTC 2024 - 51.3K bytes - Viewed (0) -
docs/ja/docs/deployment/docker.md
# (8) COPY --from=requirements-stage /tmp/requirements.txt /code/requirements.txt # (9) RUN pip install --no-cache-dir --upgrade -r /code/requirements.txt # (10) COPY ./app /code/app # (11) CMD ["uvicorn", "app.main:app", "--host", "0.0.0.0", "--port", "80"] ``` 1. これは最初のステージで、`requirements-stage`と名付けられます 2. `/tmp` を現在の作業ディレクトリに設定します ここで `requirements.txt` というファイルを生成します。
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Mon Aug 12 21:47:53 UTC 2024 - 44.3K bytes - Viewed (0) -
docs/debugging/xl-meta/main.go
return err } // Fill padding... padding := len(splitFilled[0])*k - len(m.filled) for i := 0; i < padding; i++ { arr := splitFilled[k-1] arr[len(arr)-i-1] = 1 } hasParity := 0 parityOK := make([]bool, m.shards) for idx, sh := range v { splitData[idx] = sh if idx >= k && len(sh) > 0 { parityOK[idx] = true
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Sep 05 11:57:44 UTC 2024 - 40.3K bytes - Viewed (0)