func (out *Nat) ExpShortVarTime(x *Nat, e uint, m *Modulus) *Nat { if !m.odd { panic("bigmod: modulus for ExpShortVarTime must be odd") } // For short exponents, precomputing a table and using a window like in Exp // doesn't pay off. Instead, we do a simple conditional square-and-multiply // chain, skipping the initial run of zeroes. xR := NewNat().set(x).montgomeryRepresenta(m) out.set(xR) for i := bits.UintSize - bits.Len(e) + 1; i < bits.UintSize; i++ { out.montgomeryMul(out, out, m) if k := (e >>...

func (out *Nat) ExpShortVarTime(x *Nat, e uint, m *Modulus) *Nat { if !m.odd { panic("bigmod: modulus for ExpShortVarTime must be odd") } // For short exponents, precomputing a table and using a window like in Exp // doesn't pay off. Instead, we do a simple conditional square-and-multiply // chain, skipping the initial run of zeroes. xR := NewNat().set(x).montgomeryRepresenta(m) out.set(xR) for i := bits.UintSize - bits.Len(e) + 1; i < bits.UintSize; i++ { out.montgomeryMul(out, out, m) if k := (e >>...

pkg net/http, type Cookie struct, Name string
pkg net/http, type Cookie struct, Path string
pkg net/http, type Cookie struct, Raw string
pkg net/http, type Cookie struct, RawExpires string
pkg net/http, type Cookie struct, Secure bool
pkg net/http, type Cookie struct, Unparsed []string
pkg net/http, type Cookie struct, Value string
pkg net/http, type CookieJar interface { Cookies, SetCookies }

pkg regexp/syntax, const OpStar = 14
pkg regexp/syntax, const OpWordBoundary = 11
pkg regexp/syntax, const POSIX = 0
pkg regexp/syntax, const Perl = 212
pkg regexp/syntax, const PerlX = 64
pkg regexp/syntax, const Simple = 512
pkg regexp/syntax, const UnicodeGroups = 128
pkg regexp/syntax, const WasDollar = 256
pkg runtime (darwin-386), const GOARCH = "386"
pkg runtime (darwin-386), const GOOS = "darwin"