From 40637db7b98b86d6d2d441105acc2aa414abe64d Mon Sep 17 00:00:00 2001 From: Dan Kortschak Date: Sat, 5 Nov 2022 16:14:08 +1030 Subject: [PATCH] all: fix comment typos Change-Id: Ic16824482142d4de4d0b949459e36505ee944ff7 Reviewed-on: https://go-review.googlesource.com/c/go/+/448175 Reviewed-by: Robert Griesemer Run-TryBot: Dan Kortschak Auto-Submit: Robert Griesemer TryBot-Result: Gopher Robot Auto-Submit: Dan Kortschak Auto-Submit: Ian Lance Taylor Run-TryBot: Ian Lance Taylor Reviewed-by: Ian Lance Taylor --- tables.go | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/tables.go b/tables.go index 5ca40f7..83234bb 100644 --- a/tables.go +++ b/tables.go @@ -38,7 +38,7 @@ func (v *projLookupTable) FromP3(q *Point) { tmpP3 := Point{} tmpP1xP1 := projP1xP1{} for i := 0; i < 7; i++ { - // Compute (i+1)*Q as Q + i*Q and convert to a ProjCached + // Compute (i+1)*Q as Q + i*Q and convert 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]))) @@ -53,7 +53,7 @@ func (v *affineLookupTable) FromP3(q *Point) { tmpP3 := Point{} tmpP1xP1 := projP1xP1{} for i := 0; i < 7; i++ { - // Compute (i+1)*Q as Q + i*Q and convert to AffineCached + // Compute (i+1)*Q as Q + i*Q and convert to affineCached v.points[i+1].FromP3(tmpP3.fromP1xP1(tmpP1xP1.AddAffine(q, &v.points[i]))) } }