- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 110 for atFile (2.18 sec)
-
cmd/update.go
if vsphereVersion != "" { uaAppend(" vsphere-plugin-", vsphereVersion) } } if IsPCFTile() { pcfTileVersion := env.Get("MINIO_PCF_TILE_VERSION", "") if pcfTileVersion != "" { uaAppend(" pcf-tile-", pcfTileVersion) } } uaAppend("; ", "") if cpus, err := gopsutilcpu.Info(); err == nil && len(cpus) > 0 { cpuMap := make(map[string]struct{}, len(cpus))Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Sun Sep 28 20:59:21 UTC 2025 - 18.9K bytes - Viewed (0) -
docs/fr/docs/index.md
* Valider que `item_id` existe dans le chemin des requêtes `GET` et `PUT`. * Valider que `item_id` est de type `int` pour les requêtes `GET` et `PUT`. * Si ce n'est pas le cas, le client voit une erreur utile et claire. * Vérifier qu'il existe un paramètre de requête facultatif nommé `q` (comme dans `http://127.0.0.1:8000/items/foo?q=somequery`) pour les requêtes `GET`.Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Sat Oct 11 17:48:49 UTC 2025 - 22K bytes - Viewed (0) -
docs/pt/docs/index.md
* <a href="https://docs.pydantic.dev/" class="external-link" target="_blank">Pydantic</a> para a parte de dados. ## Instalação { #installation } Crie e ative um <a href="https://fastapi.tiangolo.com/pt/virtual-environments/" class="external-link" target="_blank">ambiente virtual</a> e então instale o FastAPI: <div class="termy"> ```console $ pip install "fastapi[standard]"
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Tue Dec 16 20:32:40 UTC 2025 - 24.5K bytes - Viewed (0) -
src/archive/tar/common.go
paxPath = "path" paxLinkpath = "linkpath" paxSize = "size" paxUid = "uid" paxGid = "gid" paxUname = "uname" paxGname = "gname" paxMtime = "mtime" paxAtime = "atime" paxCtime = "ctime" // Removed from later revision of PAX spec, but was valid paxCharset = "charset" // Currently unused paxComment = "comment" // Currently unused paxSchilyXattr = "SCHILY.xattr."
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Tue Oct 07 19:46:36 UTC 2025 - 24.5K bytes - Viewed (0) -
docs/fr/docs/alternatives.md
que les données sont valides, compte tenu de certains paramètres. Par exemple, qu'un champ est un `int`, et non un string. Ceci est particulièrement utile pour les données entrantes. Sans un système de validation des données, vous devriez effectuer toutes les vérifications à la main, dans le code.
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Sat Oct 11 17:48:49 UTC 2025 - 27.5K bytes - Viewed (0) -
cmd/xl-storage.go
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Sun Sep 28 20:59:21 UTC 2025 - 91.7K bytes - Viewed (0) -
okhttp-idna-mapping-table/src/main/resources/okhttp3/internal/idna/IdnaMappingTable.txt
Registered: Fri Dec 26 11:42:13 UTC 2025 - Last Modified: Sat Feb 10 11:25:47 UTC 2024 - 854.1K bytes - Viewed (0) -
RELEASE.md
This release contains contributions from many people at Google, as well as:
Registered: Tue Dec 30 12:39:10 UTC 2025 - Last Modified: Tue Oct 28 22:27:41 UTC 2025 - 740.4K bytes - Viewed (3) -
lib/fips140/v1.0.0-c2097c7c.zip
magnitude up to 2^{w-1} so that the nonzero digits are as // sparse as possible. Intuitively, this "condenses" the // "mass" of the scalar onto sparse coefficients (meaning // fewer additions). basepointNafTable := basepointNafTable() var aTable nafLookupTable5 aTable.FromP3(A) // Because the basepoint is fixed, we can use a wider NAF // corresponding to a bigger table. aNaf := a.nonAdjacentForm(5) bNaf := b.nonAdjacentForm(8) // Find the first nonzero coefficient. i := 255 for j := i; j >= 0; j-- {...Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Sep 25 19:53:19 UTC 2025 - 642.7K bytes - Viewed (0) -
lib/fips140/v1.1.0-rc1.zip
magnitude up to 2^{w-1} so that the nonzero digits are as // sparse as possible. Intuitively, this "condenses" the // "mass" of the scalar onto sparse coefficients (meaning // fewer additions). basepointNafTable := basepointNafTable() var aTable nafLookupTable5 aTable.FromP3(A) // Because the basepoint is fixed, we can use a wider NAF // corresponding to a bigger table. aNaf := a.nonAdjacentForm(5) bNaf := b.nonAdjacentForm(8) // Find the first nonzero coefficient. i := 255 for j := i; j >= 0; j-- {...Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Dec 11 16:27:41 UTC 2025 - 663K bytes - Viewed (0)