- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 450 for HI (0.02 sec)
-
src/vendor/golang.org/x/text/unicode/norm/tables13.0.0.go
{value: 0x812e, lo: 0xb1, hi: 0xb1}, {value: 0x8133, lo: 0xb2, hi: 0xb3}, {value: 0x812e, lo: 0xb4, hi: 0xb4}, {value: 0x8133, lo: 0xb5, hi: 0xb6}, {value: 0x812e, lo: 0xb7, hi: 0xb9}, {value: 0x8133, lo: 0xba, hi: 0xba}, {value: 0x812e, lo: 0xbb, hi: 0xbc}, {value: 0x8133, lo: 0xbd, hi: 0xbd}, {value: 0x812e, lo: 0xbe, hi: 0xbe}, {value: 0x8133, lo: 0xbf, hi: 0xbf},
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:33 UTC 2023 - 378.6K bytes - Viewed (0) -
src/math/bits/bits.go
return uint(q), uint(r) } // Div32 returns the quotient and remainder of (hi, lo) divided by y: // quo = (hi, lo)/y, rem = (hi, lo)%y with the dividend bits' upper // half in parameter hi and the lower half in parameter lo. // Div32 panics for y == 0 (division by zero) or y <= hi (quotient overflow). func Div32(hi, lo, y uint32) (quo, rem uint32) { if y != 0 && y <= hi { panic(overflowError) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 17.9K bytes - Viewed (0) -
subprojects/core/src/test/groovy/org/gradle/groovy/scripts/internal/BuildScriptTransformerSpec.groovy
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Nov 04 22:26:51 UTC 2021 - 7.5K bytes - Viewed (0) -
src/math/trig_reduce.go
// Multiply mantissa by the digits and extract the upper two digits (hi, lo). z2hi, _ := bits.Mul64(z2, ix) z1hi, z1lo := bits.Mul64(z1, ix) z0lo := z0 * ix lo, c := bits.Add64(z1lo, z2hi, 0) hi, _ := bits.Add64(z0lo, z1hi, c) // The top 3 bits are j. j = hi >> 61 // Extract the fraction and find its magnitude. hi = hi<<3 | lo>>61 lz := uint(bits.LeadingZeros64(hi)) e := uint64(bias - (lz + 1))
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 3.3K bytes - Viewed (0) -
src/unicode/letter.go
if r < range_.Lo { return false } if r <= range_.Hi { return range_.Stride == 1 || (r-range_.Lo)%range_.Stride == 0 } } return false } // binary search over ranges lo := 0 hi := len(ranges) for lo < hi { m := int(uint(lo+hi) >> 1) range_ := &ranges[m] if range_.Lo <= r && r <= range_.Hi { return range_.Stride == 1 || (r-range_.Lo)%range_.Stride == 0 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 06 20:02:46 UTC 2023 - 10K bytes - Viewed (0) -
src/vendor/golang.org/x/net/idna/trie.go
func (t *sparseBlocks) lookup(n uint32, b byte) uint16 { offset := t.offset[n] header := t.values[offset] lo := offset + 1 hi := lo + uint16(header.lo) for lo < hi { m := lo + (hi-lo)/2 r := t.values[m] if r.lo <= b && b <= r.hi { return r.value + uint16(b-r.lo)*header.value } if b < r.lo { hi = m } else { lo = m + 1 } } return 0
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 13 21:37:23 UTC 2023 - 1.3K bytes - Viewed (0) -
src/compress/lzw/reader.go
r.o += copy(r.output[r.o:], r.output[i:]) if r.last != decoderInvalidCode { // Save what the hi code expands to. r.suffix[r.hi] = uint8(c) r.prefix[r.hi] = r.last } default: r.err = errors.New("lzw: invalid code") break loop } r.last, r.hi = code, r.hi+1 if r.hi >= r.overflow { if r.hi > r.overflow { panic("unreachable") } if r.width == maxWidth {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 12 14:39:39 UTC 2023 - 8K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/unicode/norm/trie.go
func (t *sparseBlocks) lookup(n uint32, b byte) uint16 { offset := t.offset[n] header := t.values[offset] lo := offset + 1 hi := lo + uint16(header.lo) for lo < hi { m := lo + (hi-lo)/2 r := t.values[m] if r.lo <= b && b <= r.hi { return r.value + uint16(b-r.lo)*header.value } if b < r.lo { hi = m } else { lo = m + 1 } } return 0
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 1.2K bytes - Viewed (0) -
test/fixedbugs/bug311.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 02 13:43:18 UTC 2016 - 377 bytes - Viewed (0) -
test/64bit.go
func (a Uint64) And(b Uint64) (c Uint64) { c.hi = a.hi & b.hi c.lo = a.lo & b.lo return } func (a Uint64) AndNot(b Uint64) (c Uint64) { c.hi = a.hi &^ b.hi c.lo = a.lo &^ b.lo return } func (a Uint64) Or(b Uint64) (c Uint64) { c.hi = a.hi | b.hi c.lo = a.lo | b.lo return } func (a Uint64) Xor(b Uint64) (c Uint64) { c.hi = a.hi ^ b.hi c.lo = a.lo ^ b.lo return }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 30 19:21:08 UTC 2013 - 24.8K bytes - Viewed (0)