pkg debug/macho, type FatArchHeader struct
pkg debug/macho, type FatArchHeader struct, Align uint32
pkg debug/macho, type FatArchHeader struct, Cpu Cpu
pkg debug/macho, type FatArchHeader struct, Offset uint32
pkg debug/macho, type FatArchHeader struct, Size uint32
pkg debug/macho, type FatArchHeader struct, SubCpu uint32
pkg debug/macho, type FatFile struct
pkg debug/macho, type FatFile struct, Arches []FatArch

pkg go/build/constraint, type OrExpr struct, Y Expr
pkg go/build/constraint, type SyntaxError struct
pkg go/build/constraint, type SyntaxError struct, Err string
pkg go/build/constraint, type SyntaxError struct, Offset int
pkg go/build/constraint, type TagExpr struct
pkg go/build/constraint, type TagExpr struct, Tag string
pkg html/template, func ParseFS(fs.FS, ...string) (*Template, error)

      }

      /*
       * Reclassify nodes in each list to new Map. Because we are using power-of-two expansion, the
       * elements from each bin must either stay at same index, or move with a power of two offset.
       * We eliminate unnecessary node creation by catching cases where old nodes can be reused
       * because their next fields won't change. Statistically, at the default threshold, only

    file: String,
    content: String,
  ) {
    val sink = fileSystem.sink(directory.div(file)).buffer()
    sink.writeUtf8(content)
    sink.close()
  }

  /**
   * @param delta the offset from the current date to use. Negative values yield dates in the past;
   * positive values yield dates in the future.
   */
  private fun formatDate(
    delta: Long,
    timeUnit: TimeUnit,

*b, ivlo: byteorder.BEUint64(iv[8:16]), ivhi: byteorder.BEUint64(iv[0:8]), offset: 0, } } func (c *CTR) XORKeyStream(dst, src []byte) { c.XORKeyStreamAt(dst, src, c.offset) var carry uint64 c.offset, carry = bits.Add64(c.offset, uint64(len(src)), 0) if carry != 0 { panic("crypto/aes: counter overflow") } } // RoundToBlock is used by CTR_DRBG, which discards the rightmost unused bits at // each request. It rounds the offset up to the next block boundary. func RoundToBlock(c *CTR) { if remainder :=...

		ServerSideEncryption: opts.ServerSideEncryption,
		Internal: minio.AdvancedGetOptions{
			ReplicationProxyRequest: "true",
		},
		PartNumber: opts.PartNumber,
	}
	// get correct offsets for encrypted object
	if rs != nil {
		h, err := rs.ToHeader()
		if err != nil {
			return nil, proxy, err
		}
		gopts.Set(xhttp.Range, h)
	}
	// Make sure to match ETag when proxying.

*b, ivlo: byteorder.BEUint64(iv[8:16]), ivhi: byteorder.BEUint64(iv[0:8]), offset: 0, } } func (c *CTR) XORKeyStream(dst, src []byte) { c.XORKeyStreamAt(dst, src, c.offset) var carry uint64 c.offset, carry = bits.Add64(c.offset, uint64(len(src)), 0) if carry != 0 { panic("crypto/aes: counter overflow") } } // RoundToBlock is used by CTR_DRBG, which discards the rightmost unused bits at // each request. It rounds the offset up to the next block boundary. func RoundToBlock(c *CTR) { if remainder :=...

      }

      /*
       * Reclassify nodes in each list to new Map. Because we are using power-of-two expansion, the
       * elements from each bin must either stay at same index, or move with a power of two offset.
       * We eliminate unnecessary node creation by catching cases where old nodes can be reused
       * because their next fields won't change. Statistically, at the default threshold, only about

    Google discovered in mid-December 2017 that the PTX-to-SASS compiler in CUDA
    9 and CUDA 9.1 sometimes does not properly compute the carry bit when
    decomposing 64-bit address calculations with large offsets (e.g. `load [x +
    large_constant]`) into 32-bit arithmetic in SASS.

    As a result, these versions of `ptxas` miscompile most XLA programs which

- Added a delay to node updates after kubelet startup. A random offset, based on the configured `nodeStatusReportFrequency`, helped distribute traffic and load from node status updates more evenly over time. The initial status update could occur up to 50% earlier or later than the regular schedule. ([#130919](https:...