- Sort Score
- Num 10 results
- Language All
Results 1 - 4 of 4 for mipsle (0.07 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
okhttp-idna-mapping-table/src/main/resources/okhttp3/internal/idna/IdnaMappingTable.txt
0521 ; valid # 5.1 CYRILLIC SMALL LETTER EL WITH MIDDLE HOOK 0522 ; mapped ; 0523 # 5.1 CYRILLIC CAPITAL LETTER EN WITH MIDDLE HOOK 0523 ; valid # 5.1 CYRILLIC SMALL LETTER EN WITH MIDDLE HOOK
Created: Fri Dec 26 11:42:13 GMT 2025 - Last Modified: Sat Feb 10 11:25:47 GMT 2024 - 854.1K bytes - Click Count (0) -
src/main/webapp/css/admin/bootstrap.min.css.map
(matches our type styles).\n margin: 0 0 1rem;\n}\n\n\n//\n// Images and content\n//\n\nimg {\n vertical-align: middle;\n border-style: none; // Remove the border on images inside links in IE 10-.\n}\n\nsvg {\n // Workaround for the SVG overflow bug in IE10/11 is still required.\n // See https://github.com/twbs/bootstrap/issues/26878\n overflow: hidden;\n vertical-align: middle;\n}\n\n\n//\n// Tables\n//\n\ntable {\n border-collapse: collapse; // Prevent double borders\n}\n\ncaption {\n padding-top:...Created: Sat Dec 20 09:19:18 GMT 2025 - Last Modified: Sat Oct 26 01:49:09 GMT 2024 - 639.3K bytes - Click Count (1) -
lib/fips140/v1.0.0-c2097c7c.zip
bounds check s0 := byteorder.BEUint32(src[0:4]) s1 := byteorder.BEUint32(src[4:8]) s2 := byteorder.BEUint32(src[8:12]) s3 := byteorder.BEUint32(src[12:16]) // First round just XORs input with key. s0 ^= xk[0] s1 ^= xk[1] s2 ^= xk[2] s3 ^= xk[3] // Middle rounds shuffle using tables. k := 4 var t0, t1, t2, t3 uint32 for r := 0; r < c.rounds-1; r++ { t0 = xk[k+0] ^ te0[uint8(s0>>24)] ^ te1[uint8(s1>>16)] ^ te2[uint8(s2>>8)] ^ te3[uint8(s3)] t1 = xk[k+1] ^ te0[uint8(s1>>24)] ^ te1[uint8(s2>>16)] ^ te2[uint8(s3>>8)]...
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) -
lib/fips140/v1.1.0-rc1.zip
bounds check s0 := byteorder.BEUint32(src[0:4]) s1 := byteorder.BEUint32(src[4:8]) s2 := byteorder.BEUint32(src[8:12]) s3 := byteorder.BEUint32(src[12:16]) // First round just XORs input with key. s0 ^= xk[0] s1 ^= xk[1] s2 ^= xk[2] s3 ^= xk[3] // Middle rounds shuffle using tables. k := 4 var t0, t1, t2, t3 uint32 for r := 0; r < c.rounds-1; r++ { t0 = xk[k+0] ^ te0[uint8(s0>>24)] ^ te1[uint8(s1>>16)] ^ te2[uint8(s2>>8)] ^ te3[uint8(s3)] t1 = xk[k+1] ^ te0[uint8(s1>>24)] ^ te1[uint8(s2>>16)] ^ te2[uint8(s3>>8)]...
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Dec 11 16:27:41 GMT 2025 - 663K bytes - Click Count (0)