//go:norace func (out *Nat) Mod(x *Nat, m *Modulus) *Nat { out.resetFor(m) // Working our way from the most significant to the least significant limb, // we can insert each limb at the least significant position, shifting all // previous limbs left by _W. This way each limb will get shifted by the // correct number of bits. We can insert at least N - 1 limbs without // overflowing m. After that, we need to reduce every time we shift. i := len(x.limbs) - 1 // For the first N - 1 limbs we can skip...

mode .jsgrid-alt-row>.jsgrid-cell,.dark-mode .jsgrid-edit-row>.jsgrid-cell,.dark-mode .jsgrid-filter-row>.jsgrid-cell,.dark-mode .jsgrid-grid-body,.dark-mode .jsgrid-grid-header,.dark-mode .jsgrid-header-row>.jsgrid-header-cell,.dark-mode .jsgrid-insert-row>.jsgrid-cell,.dark-mode .jsgrid-row>.jsgrid-cell{border-color:#6c757d}.dark-mode .jsgrid-header-row>.jsgrid-header-cell,.dark-mode .jsgrid-row>.jsgrid-cell{background-color:#343a40}.dark-mode .jsgrid-alt-row>.jsgrid-cell{background-color:#3a4047}.dark-mode...

pkg go/ast, method (*RangeStmt) End() token.Pos
pkg go/ast, method (*RangeStmt) Pos() token.Pos
pkg go/ast, method (*ReturnStmt) End() token.Pos
pkg go/ast, method (*ReturnStmt) Pos() token.Pos
pkg go/ast, method (*Scope) Insert(*Object) *Object
pkg go/ast, method (*Scope) Lookup(string) *Object
pkg go/ast, method (*Scope) String() string
pkg go/ast, method (*SelectStmt) End() token.Pos
pkg go/ast, method (*SelectStmt) Pos() token.Pos