- Sort Score
- Result 10 results
- Languages All
Results 1 - 5 of 5 for dev (0.04 sec)
-
docs/en/docs/release-notes.md
* [Microservice in Python using FastAPI](https://dev.to/paurakhsharma/microservice-in-python-using-fastapi-24cc) by [Paurakh Sharma Humagain](https://x.com/PaurakhSharma). * [Build simple API service with Python FastAPI — Part 1](https://dev.to/cuongld2/build-simple-api-service-with-python-fastapi-part-1-581o) by [cuongld2](https://dev.to/cuongld2).
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Fri Sep 05 12:48:45 UTC 2025 - 544.1K bytes - Viewed (0) -
api/go1.14.txt
pkg log/syslog (freebsd-arm64-cgo), type Writer struct pkg math/bits (freebsd-arm64), const UintSize = 64 pkg math/bits (freebsd-arm64-cgo), const UintSize = 64 pkg os (freebsd-arm64), const DevNull = "/dev/null" pkg os (freebsd-arm64), const O_APPEND = 8 pkg os (freebsd-arm64), const O_CREATE = 512 pkg os (freebsd-arm64), const O_EXCL = 2048 pkg os (freebsd-arm64), const O_SYNC = 128
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Fri Feb 17 20:31:46 UTC 2023 - 508.9K bytes - Viewed (0) -
RELEASE.md
location at `ai_edge_litert.interpreter`, as the API `tf.lite.Interpreter` will be deleted in TF 2.20. See the [migration guide](https://ai.google.dev/edge/litert/migration) for details. ### Known Caveats ### Major Features and Improvements * `tf.lite` * `tfl.Cast` op is now supporting `bfloat16` in runtime kernel.
Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Mon Aug 18 20:54:38 UTC 2025 - 740K bytes - Viewed (2) -
api/go1.20.txt
pkg math/bits (freebsd-riscv64), const UintSize = 64 #53466 pkg math/bits (freebsd-riscv64-cgo), const UintSize = 64 #53466 pkg os (freebsd-riscv64), const DevNull = "/dev/null" #53466 pkg os (freebsd-riscv64), const O_APPEND = 8 #53466 pkg os (freebsd-riscv64), const O_CREATE = 512 #53466 pkg os (freebsd-riscv64), const O_EXCL = 2048 #53466 pkg os (freebsd-riscv64), const O_SYNC = 128 #53466
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Fri Feb 17 21:23:32 UTC 2023 - 602.6K bytes - Viewed (0) -
lib/fips140/v1.0.0.zip
// Multiplication" by subtracting only in the overflow case, but the // cost is very similar since the constant time subtraction tells us if // x >= m as a side effect, and taking care of the broken invariant is // highly undesirable (see https://go.dev/issue/13907). copy(x.reset(n).limbs, T[n:]) x.maybeSubtractModulus(choice(c), m) // The following specialized cases follow the exact same algorithm, but // optimized for the sizes most used in RSA. addMulVVW is implemented in // assembly with loop unrolling...
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Jan 29 15:10:35 UTC 2025 - 635K bytes - Viewed (0)