- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 30 for Poly (0.07 sec)
-
src/hash/crc32/gen_const_ppc64le.go
} return ref } func get_remainder(poly uint64, deg uint, n uint) uint64 { rem, _ := xnmodp(n, poly, deg) return rem } func get_quotient(poly uint64, bits, n uint) uint64 { _, div := xnmodp(n, poly, bits) return div } // xnmodp returns two values, p and div: // p is the representation of the binary polynomial x**n mod (x ** deg + "poly")
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 19 20:44:20 UTC 2024 - 4.5K bytes - Viewed (0) -
platforms/ide/tooling-api/src/crossVersionTest/groovy/org/gradle/integtests/tooling/r89/ToolingApiPolymorphismCrossVersionTest.groovy
assert ((ShallowChildModel) model).getShallowMessage() == "shallow poly from 'root'" assert model instanceof DeepChildModel assert ((DeepChildModel) model).getDeepMessage() == "deep poly from 'root'" assert model instanceof VeryDeepChildModel assert ((VeryDeepChildModel) model).getVeryDeepMessage() == "very deep poly from 'root'" assert !(model instanceof SideModel) }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Jun 11 11:03:18 UTC 2024 - 7.3K bytes - Viewed (0) -
src/math/erf.go
// erf(1+s) = erf(1) + s*Poly(s) // = 0.845.. + P1(s)/Q1(s) // That is, we use rational approximation to approximate // erf(1+s) - (c = (single)0.84506291151) // Note that |P1/Q1|< 0.078 for x in [0.84375,1.25] // where // P1(s) = degree 6 poly in s // Q1(s) = degree 6 poly in s // // 3. For x in [1.25,1/0.35(~2.857143)],
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 11.5K bytes - Viewed (0) -
src/hash/crc32/crc32_generic.go
// polynomial. The table is suitable for use with the simple algorithm // (simpleUpdate). func simpleMakeTable(poly uint32) *Table { t := new(Table) simplePopulateTable(poly, t) return t } // simplePopulateTable constructs a Table for the specified polynomial, suitable // for use with simpleUpdate. func simplePopulateTable(poly uint32, t *Table) { for i := 0; i < 256; i++ { crc := uint32(i) for j := 0; j < 8; j++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat May 18 22:36:41 UTC 2024 - 2.5K bytes - Viewed (0) -
src/hash/crc64/crc64.go
// The contents of this [Table] must not be modified. func MakeTable(poly uint64) *Table { buildSlicing8TablesOnce() switch poly { case ISO: return &slicing8TableISO[0] case ECMA: return &slicing8TableECMA[0] default: return makeTable(poly) } } func makeTable(poly uint64) *Table { t := new(Table) for i := 0; i < 256; i++ { crc := uint64(i)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat May 18 22:36:41 UTC 2024 - 5.2K bytes - Viewed (0) -
src/crypto/aes/gcm_amd64.s
PXOR ACC0, ACCM PXOR ACC1, ACCM MOVOU ACCM, T0 PSRLDQ $8, ACCM PSLLDQ $8, T0 PXOR ACCM, ACC1 PXOR T0, ACC0 MOVOU POLY, T0 PCLMULQDQ $0x01, ACC0, T0 PSHUFD $78, ACC0, ACC0 PXOR T0, ACC0 MOVOU POLY, T0 PCLMULQDQ $0x01, ACC0, T0 PSHUFD $78, ACC0, ACC0 PXOR T0, ACC0 PXOR ACC1, ACC0 PSHUFB BSWAP, ACC0 PXOR T2, ACC0 MOVOU ACC0, (tPtr)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 23.4K bytes - Viewed (0) -
src/crypto/aes/gcm_arm64.s
VEXT $8, ACCM.B16, ZERO.B16, ACCM.B16 \ VEOR ACCM.B16, ACC0.B16, ACC0.B16 \ VEOR T0.B16, ACC1.B16, ACC1.B16 \ VPMULL POLY.D1, ACC0.D1, T0.Q1 \ VEXT $8, ACC0.B16, ACC0.B16, ACC0.B16 \ VEOR T0.B16, ACC0.B16, ACC0.B16 \ VPMULL POLY.D1, ACC0.D1, T0.Q1 \ VEOR T0.B16, ACC1.B16, ACC1.B16 \ VEXT $8, ACC1.B16, ACC1.B16, ACC1.B16 \ VEOR ACC1.B16, ACC0.B16, ACC0.B16 \
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 21.5K bytes - Viewed (0) -
src/hash/crc32/crc32_test.go
return slicingUpdate(0, tab, b) }) // Cross-check various polys against the simple algorithm. for _, poly := range []uint32{IEEE, Castagnoli, Koopman, 0xD5828281} { t1 := simpleMakeTable(poly) f1 := func(crc uint32, b []byte) uint32 { return simpleUpdate(crc, t1, b) } t2 := slicingMakeTable(poly) f2 := func(crc uint32, b []byte) uint32 { return slicingUpdate(crc, t2, b) } testCrossCheck(t, f1, f2)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 03 14:56:25 UTC 2024 - 12.1K bytes - Viewed (0) -
src/hash/crc32/crc32.go
// The contents of this [Table] must not be modified. func MakeTable(poly uint32) *Table { switch poly { case IEEE: ieeeOnce.Do(ieeeInit) return IEEETable case Castagnoli: castagnoliOnce.Do(castagnoliInit) return castagnoliTable default: return simpleMakeTable(poly) } } // digest represents the partial evaluation of a checksum. type digest struct {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun May 12 05:36:29 UTC 2024 - 7.5K bytes - Viewed (0) -
src/hash/crc32/crc32_ppc64le.go
//go:noescape func ppc64SlicingUpdateBy8(crc uint32, table8 *slicing8Table, p []byte) uint32 // this function requires the buffer to be 16 byte aligned and > 16 bytes long. // //go:noescape func vectorCrc32(crc uint32, poly uint32, p []byte) uint32 var archCastagnoliTable8 *slicing8Table func archInitCastagnoli() { archCastagnoliTable8 = slicingMakeTable(Castagnoli) } func archUpdateCastagnoli(crc uint32, p []byte) uint32 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 2.2K bytes - Viewed (0)