- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 101 for setoverflow (0.19 sec)
-
src/runtime/map.go
// If hint is large zeroing this memory could take a while. if h.B != 0 { var nextOverflow *bmap h.buckets, nextOverflow = makeBucketArray(t, h.B, nil) if nextOverflow != nil { h.extra = new(mapextra) h.extra.nextOverflow = nextOverflow } } return h } // makeBucketArray initializes a backing array for map buckets.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 57.6K bytes - Viewed (0) -
src/encoding/binary/varint_test.go
} } func TestOverflow(t *testing.T) { testOverflow(t, []byte{0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x2}, 0, -10, errOverflow) testOverflow(t, []byte{0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x1, 0, 0}, 0, -11, errOverflow)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 16 23:09:19 UTC 2023 - 5.5K bytes - Viewed (0) -
src/vendor/golang.org/x/text/unicode/norm/iter.go
i.setDone() i.info = Properties{} // Force BoundaryBefore to succeed. } else { i.info = i.rb.f.info(i.rb.src, i.p) } switch i.rb.ss.next(i.info) { case ssOverflow: i.next = nextCGJDecompose fallthrough case ssStarter: if outp > 0 { copy(i.buf[outp:], d) return i.buf[:p] } return d } copy(i.buf[outp:], d)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 26 19:27:51 UTC 2019 - 11K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/unicode/norm/normalize.go
return false } buf := rb.out[p:] rb.out = rb.out[:p] decomposeToLastBoundary(rb) if s := rb.ss.next(info); s == ssStarter { rb.doFlush() rb.ss.first(info) } else if s == ssOverflow { rb.doFlush() rb.insertCGJ() rb.ss = 0 } rb.insertUnsafe(inputBytes(buf), 0, info) return true } func appendQuick(rb *reorderBuffer, i int) int { if rb.nsrc == i { return i
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 14.9K bytes - Viewed (0) -
src/vendor/golang.org/x/text/unicode/norm/normalize.go
return false } buf := rb.out[p:] rb.out = rb.out[:p] decomposeToLastBoundary(rb) if s := rb.ss.next(info); s == ssStarter { rb.doFlush() rb.ss.first(info) } else if s == ssOverflow { rb.doFlush() rb.insertCGJ() rb.ss = 0 } rb.insertUnsafe(inputBytes(buf), 0, info) return true } func appendQuick(rb *reorderBuffer, i int) int { if rb.nsrc == i { return i
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 16 22:26:23 UTC 2022 - 14.9K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/unicode/norm/iter.go
i.setDone() i.info = Properties{} // Force BoundaryBefore to succeed. } else { i.info = i.rb.f.info(i.rb.src, i.p) } switch i.rb.ss.next(i.info) { case ssOverflow: i.next = nextCGJDecompose fallthrough case ssStarter: if outp > 0 { copy(i.buf[outp:], d) return i.buf[:p] } return d } copy(i.buf[outp:], d)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 11K bytes - Viewed (0) -
src/syscall/tables_wasip1.go
ENOTDIR Errno = 54 ENOTEMPTY Errno = 55 ENOTRECOVERABLE Errno = 56 ENOTSOCK Errno = 57 ENOTSUP Errno = 58 ENOTTY Errno = 59 ENXIO Errno = 60 EOVERFLOW Errno = 61 EOWNERDEAD Errno = 62 EPERM Errno = 63 EPIPE Errno = 64 EPROTO Errno = 65 EPROTONOSUPPORT Errno = 66 EPROTOTYPE Errno = 67 ERANGE Errno = 68
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 06 20:58:35 UTC 2023 - 6.5K bytes - Viewed (0) -
src/syscall/zerrors_windows.go
ENOPROTOOPT ENOSPC ENOSR ENOSTR ENOSYS ENOTBLK ENOTCONN ENOTEMPTY ENOTNAM ENOTRECOVERABLE ENOTSOCK ENOTSUP ENOTTY ENOTUNIQ ENXIO EOPNOTSUPP EOVERFLOW EOWNERDEAD EPERM EPFNOSUPPORT EPIPE EPROTO EPROTONOSUPPORT EPROTOTYPE ERANGE EREMCHG EREMOTE EREMOTEIO ERESTART EROFS ESHUTDOWN ESOCKTNOSUPPORT
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jun 14 13:21:46 UTC 2018 - 10K bytes - Viewed (0) -
src/syscall/tables_js.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 28 18:17:57 UTC 2021 - 19.2K bytes - Viewed (0) -
src/runtime/map_fast64.go
goto again // Growing the table invalidates everything, so try again } if insertb == nil { // The current bucket and all the overflow buckets connected to it are full, allocate a new one. insertb = h.newoverflow(t, b) inserti = 0 // not necessary, but avoids needlessly spilling inserti } insertb.tophash[inserti&(abi.MapBucketCount-1)] = tophash(hash) // mask inserti to avoid bounds checks
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:17:26 UTC 2024 - 14.1K bytes - Viewed (0)