- Sort Score
- Result 10 results
- Languages All
Results 21 - 25 of 25 for AZ (0.05 sec)
-
docs/en/docs/release-notes.md
* 🌐 Update Chinese translation for `docs/zh/docs/contributing.md`. PR [#10887](https://github.com/tiangolo/fastapi/pull/10887) by [@Aruelius](https://github.com/Aruelius). * 🌐 Add Azerbaijani translation for `docs/az/docs/fastapi-people.md`. PR [#11195](https://github.com/tiangolo/fastapi/pull/11195) by [@vusallyv](https://github.com/vusallyv).
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Sat Dec 27 19:06:15 UTC 2025 - 586.7K bytes - Viewed (0) -
src/main/webapp/js/admin/moment-with-locales.min.js
\u044f\u0446\u044b_\u043c\u0435\u0441\u044f\u0446\u0430\u045e",yy:"\u0433\u043e\u0434_\u0433\u0430\u0434\u044b_\u0433\u0430\u0434\u043e\u045e"}[t].split("_"),s%10==1&&s%100!=11?n[0]:2<=s%10&&s%10<=4&&(s%100<10||20<=s%100)?n[1]:n[2])}M.defineLocale("az",{months:"yanvar_fevral_mart_aprel_may_iyun_iyul_avqust_sentyabr_oktyabr_noyabr_dekabr".split("_"),monthsShort:"yan_fev_mar_apr_may_iyn_iyl_avq_sen_okt_noy_dek".split("_"),weekdays:"Bazar_Bazar ert\u0259si_\xc7\u0259r\u015f\u0259nb\u0259 ax\u015fam...
Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Sat Oct 26 01:49:09 UTC 2024 - 360.5K bytes - Viewed (2) -
CHANGELOG/CHANGELOG-1.8.md
* AWS: Arbitrarily choose first (lexicographically) subnet in AZ ([#50255](https://github.com/kubernetes/kubernetes/pull/50255), [@mattlandis](https://github.com/mattlandis))
Registered: Fri Dec 26 09:05:12 UTC 2025 - Last Modified: Tue Feb 20 15:45:02 UTC 2024 - 312.2K bytes - Viewed (0) -
lib/fips140/v1.0.0-c2097c7c.zip
to preserve the larger prime power of each prime factor, so we can // right-shift the number with the fewest trailing zeros until it's odd. // For odd a, b and m >= n, lcm(a×2ᵐ, b×2ⁿ) = lcm(a×2ᵐ, b). az, bz := a.TrailingZeroBitsVarT(), b.TrailingZeroBitsVarT() if az < bz { a = a.ShiftRightVarTime(az) } else { b = b.ShiftRightVarTime(bz) } gcd, err := bigmod.NewNat().GCDVarTime(a, b) if err != nil { return nil, err } if gcd.IsOdd() == 0 { return nil, errors.New("rsa: internal error: gcd(a, b) is even")...
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
to preserve the larger prime power of each prime factor, so we can // right-shift the number with the fewest trailing zeros until it's odd. // For odd a, b and m >= n, lcm(a×2ᵐ, b×2ⁿ) = lcm(a×2ᵐ, b). az, bz := a.TrailingZeroBitsVarT(), b.TrailingZeroBitsVarT() if az < bz { a = a.ShiftRightVarTime(az) } else { b = b.ShiftRightVarTime(bz) } gcd, err := bigmod.NewNat().GCDVarTime(a, b) if err != nil { return nil, err } if gcd.IsOdd() == 0 { return nil, errors.New("rsa: internal error: gcd(a, b) is even")...
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Dec 11 16:27:41 UTC 2025 - 663K bytes - Viewed (0)