*
     * We start out with a double-precision approximation, which may be higher or lower than the
     * true value. Therefore, we perform at least one Newton iteration to get a guess that's
     * definitely >= floor(sqrt(x)), and then continue the iteration until we reach a fixed point.
     */
    BigInteger sqrt0;
    int log2 = log2(x, FLOOR);

2/", "src/compress/bzip2/bit_reader.go", "src/compress/bzip2/bzip2.go", "src/compress/bzip2/bzip2_test.go", "src/compress/bzip2/huffman.go", "src/compress/bzip2/move_to_front.go", "src/compress/bzip2/testdata/", "src/compress/bzip2/testdata/Isaac.Newton-Opticks.txt.bz2", "src/compress/bzip2/testdata/e.txt.bz2", "src/compress/bzip2/testdata/fail-issue5747.bz2", "src/compress/bzip2/testdata/pass-random1.bin", "src/compress/bzip2/testdata/pass-random1.bz2", "src/compress/bzip2/testdata/pass-random2.bin",...

kork?reiks??wh-antouvn--nx?x&9-dlofts--nx.aoq-relv--nx?d-nmaherk--nx?f-dnalnks--nx?h-neltloh--nx?i-drgeppo--nx?j-gve&gnal--nx?lreb--nx??m-negnilr--nx?n-drojfvk--nx??y&7-ujdaehal--nx?8-antouvig--nx?b-&dlofrs--nx?goksmr--nx?kivryr--nx?retslj--nx??e-nejsom--nx?f-y&re&dni--nx?tso--nx??stivk--nx??g-regark--nx?orf?ørf??z9-drojfstb--nx??b&25-akiivagael--nx?53ay7-olousech--nx?a&iy-gv--nx?le-tl&b--nx?s--nx??n0-ydr--nx??c&0-dnal-erdns--nx?z-netot-erts--nx??g&g-regnarav-rs--nx?o-nejssendnas--nx??ju-erdils-...

gcmPlatformData } func New(cipher *aes.Block, nonceSize, tagSize int) (*GCM, error) { // This function is outlined to let the allocation happen on the parent stack. return newGCM(&GCM{}, cipher, nonceSize, tagSize) } // newGCM is marked go:noinline to avoid it inlining into New, and making New // too complex to inline itself. // //go:noinline func newGCM(g *GCM, cipher *aes.Block, nonceSize, tagSize int) (*GCM, error) { if tagSize < gcmMinimumTagSize || tagSize > gcmBlockSize { return nil, errors.New("cipher:...

    <glob pattern="*.MYD"/>
    <!-- MISAM Data files are header-less, so no magic -->
    <sub-class-of type="application/x-mysql-db"/>
  </mime-type>
  <mime-type type="application/x-nesrom">
    <_comment>Nintendo Entertainment System ROM</_comment>
    <glob pattern="*.nes"/>
    <magic priority="50">
      <match value="0x4E45531A" type="string" offset="0" />
    </magic>
  </mime-type>

gcmPlatformData } func New(cipher *aes.Block, nonceSize, tagSize int) (*GCM, error) { // This function is outlined to let the allocation happen on the parent stack. return newGCM(&GCM{}, cipher, nonceSize, tagSize) } // newGCM is marked go:noinline to avoid it inlining into New, and making New // too complex to inline itself. // //go:noinline func newGCM(g *GCM, cipher *aes.Block, nonceSize, tagSize int) (*GCM, error) { if tagSize < gcmMinimumTagSize || tagSize > gcmBlockSize { return nil, errors.New("cipher:...

pkg container/list, method (*List) MoveAfter(*Element, *Element)
pkg container/list, method (*List) MoveBefore(*Element, *Element)
pkg crypto, type PublicKey interface {}
pkg crypto/cipher, func NewGCM(Block) (AEAD, error)
pkg crypto/cipher, type AEAD interface { NonceSize, Open, Overhead, Seal }
pkg crypto/cipher, type AEAD interface, NonceSize() int