- Sort Score
- Num 10 results
- Language All
Results 1 - 5 of 5 for handler (0.08 seconds)
-
docs/en/docs/release-notes.md
* [Override the default exception handlers](https://fastapi.tiangolo.com/tutorial/handling-errors/#override-the-default-exception-handlers). * [Reuse **FastAPI's** exception handlers](https://fastapi.tiangolo.com/tutorial/handling-errors/#reuse-fastapis-exception-handlers). * PR [#273](https://github.com/tiangolo/fastapi/pull/273).Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Sat Dec 27 19:06:15 GMT 2025 - 586.7K bytes - Click Count (0) -
RELEASE.md
* Updates `libjpeg-turbo` to `2.0.5` to handle [CVE-2020-13790](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2020-13790). * Updates `junit` to `4.13.1` to handle [CVE-2020-15250](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2020-15250). * Updates `PCRE` to `8.44` to handle [CVE-2019-20838](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2019-20838) andCreated: Tue Dec 30 12:39:10 GMT 2025 - Last Modified: Tue Oct 28 22:27:41 GMT 2025 - 740.4K bytes - Click Count (3) -
api/go1.20.txt
pkg runtime (freebsd-riscv64-cgo), const GOOS = "freebsd" #53466 pkg runtime/cgo (freebsd-riscv64-cgo), func NewHandle(interface{}) Handle #53466 pkg runtime/cgo (freebsd-riscv64-cgo), method (Handle) Delete() #53466 pkg runtime/cgo (freebsd-riscv64-cgo), method (Handle) Value() interface{} #53466 pkg runtime/cgo (freebsd-riscv64-cgo), type Handle uintptr #53466 pkg runtime/cgo (freebsd-riscv64-cgo), type Incomplete struct #53466
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Fri Feb 17 21:23:32 GMT 2023 - 602.6K bytes - Click Count (0) -
lib/fips140/v1.1.0-rc1.zip
Following the proof linked in the PR above, the changes are: // // 1. Negate [B] and [C] so they are positive. The invariant now involves a // subtraction. // 2. If step 2 (both [x] and [y] are even) runs, abort immediately. This // case needs to be handled by the caller. // 3. Subtract copies of [x] and [y] as needed in step 6 (both [u] and [v] // are odd) so coefficients stay in bounds. // 4. Replace the [u >= v] check with [u > v]. This changes the end // condition to [v = 0] rather than [u = 0]....
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Dec 11 16:27:41 GMT 2025 - 663K bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
Following the proof linked in the PR above, the changes are: // // 1. Negate [B] and [C] so they are positive. The invariant now involves a // subtraction. // 2. If step 2 (both [x] and [y] are even) runs, abort immediately. This // case needs to be handled by the caller. // 3. Subtract copies of [x] and [y] as needed in step 6 (both [u] and [v] // are odd) so coefficients stay in bounds. // 4. Replace the [u >= v] check with [u > v]. This changes the end // condition to [v = 0] rather than [u = 0]....
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0)