to a projCached // This is needlessly complicated because the API has explicit // receivers instead of creating stack objects and relying on RVO v.points[i+1].FromP3(tmpP3.fromP1xP1(tmpP1xP1.Add(q, &v.points[i]))) } } // This is not optimised for speed; fixed-base tables should be precomputed. func (v *affineLookupTable) FromP3(q *Point) { // Goal: v.points[i] = (i+1)*Q, i.e., Q, 2Q, ..., 8Q // This allows lookup of -8Q, ..., -Q, 0, Q, ..., 8Q v.points[0].FromP3(q) tmpP3 := Point{} tmpP1xP1 := projP1xP1{}...

pkg syscall (windows-386), type MibIfRow struct, PhysAddr [8]uint8
pkg syscall (windows-386), type MibIfRow struct, PhysAddrLen uint32
pkg syscall (windows-386), type MibIfRow struct, Speed uint32
pkg syscall (windows-386), type MibIfRow struct, Type uint32
pkg syscall (windows-386), type Overlapped struct
pkg syscall (windows-386), type Overlapped struct, HEvent Handle