- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 394 for HI (0.29 sec)
-
src/vendor/golang.org/x/crypto/internal/poly1305/sum_generic.go
type uint128 struct { lo, hi uint64 } func mul64(a, b uint64) uint128 { hi, lo := bits.Mul64(a, b) return uint128{lo, hi} } func add128(a, b uint128) uint128 { lo, c := bits.Add64(a.lo, b.lo, 0) hi, c := bits.Add64(a.hi, b.hi, c) if c != 0 { panic("poly1305: unexpected overflow") } return uint128{lo, hi} } func shiftRightBy2(a uint128) uint128 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 22 19:00:13 UTC 2024 - 9.6K bytes - Viewed (0) -
src/encoding/xml/marshal_test.go
}, { ExpectXML: `<IndirComment><T1></T1><!--hi--><T2></T2></IndirComment>`, Value: &IndirComment{Comment: nil}, UnmarshalOnly: true, }, { ExpectXML: `<IfaceComment><T1></T1><!--hi--><T2></T2></IfaceComment>`, Value: &IfaceComment{Comment: "hi"}, MarshalOnly: true, }, { ExpectXML: `<IfaceComment><T1></T1><!--hi--><T2></T2></IfaceComment>`,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 08 18:46:41 UTC 2024 - 66K bytes - Viewed (0) -
platforms/documentation/docs/src/snippets/customPlugins/customPlugin/groovy/other.gradle
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Apr 05 22:35:53 UTC 2024 - 287 bytes - Viewed (0) -
src/cmd/compile/internal/ssa/rewritedec64.go
v.AuxInt = boolToAuxInt(c) v.AddArg2(x, lo) return true } // match: (Lsh16x64 x (Int64Make hi lo)) // cond: hi.Op != OpConst32 // result: (Lsh16x32 x (Or32 <typ.UInt32> (Zeromask hi) lo)) for { x := v_0 if v_1.Op != OpInt64Make { break } lo := v_1.Args[1] hi := v_1.Args[0] if !(hi.Op != OpConst32) { break } v.reset(OpLsh16x32)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jan 19 22:42:34 UTC 2023 - 65.3K bytes - Viewed (0) -
platforms/documentation/docs/src/snippets/providers/propertyAndProvider/kotlin/build.gradle.kts
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Nov 27 17:53:42 UTC 2023 - 395 bytes - Viewed (0) -
src/cmd/compile/internal/ssa/deadstore.go
} if hi < sr.lo() || lo > sr.hi() { // The two regions don't overlap or abut, so we would // have to keep track of multiple disjoint ranges. // Because we can only keep one, keep the larger one. if sr.hi()-sr.lo() >= hi-lo { return sr } return shadowRange(lo + hi<<16) } // Regions overlap or abut - compute the union. return shadowRange(min(lo, sr.lo()) + max(hi, sr.hi())<<16) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 25 20:07:26 UTC 2024 - 11K bytes - Viewed (0) -
test/typeparam/geninline.dir/a.go
check(want T) } type Val[T comparable] struct { val T } //go:noinline func (l *Val[T]) check(want T) { if l.val != want { panic("hi") } } func Test1() { var l Val[int] if l.val != 0 { panic("hi") } _ = IVal[int](&l) } func Test2() { var l Val[float64] l.val = 3.0 l.check(float64(3)) _ = IVal[float64](&l) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Oct 15 16:57:36 UTC 2021 - 799 bytes - Viewed (0) -
src/runtime/internal/math/math.go
return a * b, overflow } // Mul64 returns the 128-bit product of x and y: (hi, lo) = x * y // with the product bits' upper half returned in hi and the lower // half returned in lo. // This is a copy from math/bits.Mul64 // On supported platforms this is an intrinsic lowered by the compiler. func Mul64(x, y uint64) (hi, lo uint64) { const mask32 = 1<<32 - 1 x0 := x & mask32 x1 := x >> 32 y0 := y & mask32
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Aug 16 16:03:04 UTC 2023 - 1.7K bytes - Viewed (0) -
src/compress/lzw/reader_test.go
t.Fatalf("i=%d: %v", i, err) } // The hi code should never decrease. if d.hi < oldHi { t.Fatalf("i=%d: hi=%d decreased from previous value %d", i, d.hi, oldHi) } oldHi = d.hi } } // TestNoLongerSavingPriorExpansions tests the decoder state when codes other // than clear codes continue to be seen after decoder.hi and decoder.width
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 18 16:57:58 UTC 2024 - 7.6K bytes - Viewed (0) -
src/math/bits/example_math_test.go
hi, lo := bits.Mul32(n1[1], n2[1]) nsum := []uint32{hi, lo} fmt.Printf("%v * %v = %v\n", n1[1], n2[1], nsum) // First number is 0<<32 + 2147483648 n1 = []uint32{0, 0x80000000} // Second number is 0<<32 + 2 n2 = []uint32{0, 2} // Multiply them together producing overflow. hi, lo = bits.Mul32(n1[1], n2[1]) nsum = []uint32{hi, lo}
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Nov 11 21:27:05 UTC 2021 - 6.3K bytes - Viewed (0)