Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 371 - 374 of 374 for stat (0.06 seconds)

  1. okhttp-idna-mapping-table/src/main/resources/okhttp3/internal/idna/IdnaMappingTable.txt

    270C..2727    ; valid                  ;      ; NV8    # 1.1  VICTORY HAND..WHITE FOUR POINTED STAR
    2728          ; valid                  ;      ; NV8    # 6.0  SPARKLES
    2729..274B    ; valid                  ;      ; NV8    # 1.1  STRESS OUTLINED WHITE STAR..HEAVY EIGHT TEARDROP-SPOKED PROPELLER ASTERISK
    274C          ; valid                  ;      ; NV8    # 6.0  CROSS MARK
    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)
  2. CREDITS

    free software which everyone can redistribute and change under these terms.
    
      To do so, attach the following notices to the program.  It is safest
    to attach them to the start of each source file to most effectively
    state the exclusion of warranty; and each file should have at least
    the "copyright" line and a pointer to where the full notice is found.
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Thu Mar 13 05:29:51 GMT 2025
    - 1.8M bytes
    - Click Count (0)
  3. lib/fips140/v1.0.0-c2097c7c.zip

    dsbyteKeccak: default: return errors.New("sha3: invalid hash state identifier") } rate := int(b[0]) b = b[1:] if rate != d.rate { return errors.New("sha3: invalid hash state function") } copy(d.a[:], b) b = b[len(d.a):] n, state := int(b[0]), spongeDirection(b[1]) if n > d.rate { return errors.New("sha3: invalid hash state") } d.n = n if state != spongeAbsorbing && state != spongeSqueezing { return errors.New("sha3: invalid hash state") } d.state = state return nil } golang.org/fips140@v1.0.0-c2097c7c/fip...
    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)
  4. lib/fips140/v1.1.0-rc1.zip

    zetas[m] m-- t := f[start] f[start] = fieldAdd(t, f[start+2]) f[start+2] = fieldMontgomeryMulSu(zeta, f[start+2], t) t = f[start+1] f[start+1] = fieldAdd(t, f[start+3]) f[start+3] = fieldMontgomeryMulSu(zeta, f[start+3], t) } for start := 0; start < 256; start += 8 { zeta := zetas[m] m-- t := f[start] f[start] = fieldAdd(t, f[start+4]) f[start+4] = fieldMontgomeryMulSu(zeta, f[start+4], t) t = f[start+1] f[start+1] = fieldAdd(t, f[start+5]) f[start+5] = fieldMontgomeryMulSu(zeta, f[start+5], t) t = f[start+2]...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
Back to Top