- Sort Score
- Num 10 results
- Language All
Results 1 - 4 of 4 for leftEncode (0.1 seconds)
-
lib/fips140/v1.26.0.zip
[]byte, rate, outputLen int, dsbyte byte) *SHAKE { c.d = Digest{rate: rate, outputLen: outputLen, dsbyte: dsbyte} c.initBlock = make([]byte, 0, 9+len(N)+9+len(S)) // leftEncode returns max 9 bytes c.initBlock = append(c.initBlock, leftEncode(uint64(len(N))*8)...) c.initBlock = append(c.initBlock, N...) c.initBlock = append(c.initBlock, leftEncode(uint64(len(S))*8)...) c.initBlock = append(c.initBlock, S...) bytepadWrite(c, c.initBlock, c.d.rate) return c } func (s *SHAKE) BlockSize() int { return s.d.BlockSize()...Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Jan 08 17:58:32 GMT 2026 - 660.3K bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
outputLen int, dsbyte byte) *SHAKE { c := &SHAKE{d: Digest{rate: rate, outputLen: outputLen, dsbyte: dsbyte}} c.initBlock = make([]byte, 0, 9+len(N)+9+len(S)) // leftEncode returns max 9 bytes c.initBlock = append(c.initBlock, leftEncode(uint64(len(N))*8)...) c.initBlock = append(c.initBlock, N...) c.initBlock = append(c.initBlock, leftEncode(uint64(len(S))*8)...) c.initBlock = append(c.initBlock, S...) c.Write(bytepad(c.initBlock, c.d.rate)) return c } func (s *SHAKE) BlockSize() int { return s.d.BlockSize()...Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/Ordering.java
return 0; } else if (left == null) { return -1; } else if (right == null) { return 1; } int leftCode = identityHashCode(left); int rightCode = identityHashCode(right); if (leftCode != rightCode) { return leftCode < rightCode ? -1 : 1; } // identityHashCode collision (rare, but not as rare as you'd think)Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Feb 23 19:19:10 GMT 2026 - 39.4K bytes - Click Count (0) -
guava/src/com/google/common/collect/Ordering.java
return 0; } else if (left == null) { return -1; } else if (right == null) { return 1; } int leftCode = identityHashCode(left); int rightCode = identityHashCode(right); if (leftCode != rightCode) { return leftCode < rightCode ? -1 : 1; } // identityHashCode collision (rare, but not as rare as you'd think)Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Feb 23 19:19:10 GMT 2026 - 39.4K bytes - Click Count (0)