Stowage/go
2
0
Fork 0
mirror of https://github.com/golang/go.git synced 2025-12-08 06:10:04 +00:00
Code Issues Projects Releases Packages Wiki Activity

internal/runtime/maps: fix spelling errors in comments

Browse source 
Change-Id: I289d26f75bb556b46699159f06ce7eb03d34656d
GitHub-Last-Rev: 10ce76df1d
GitHub-Pull-Request: golang/go#74733
Reviewed-on: https://go-review.googlesource.com/c/go/+/690095
Reviewed-by: Keith Randall <khr@google.com>
LUCI-TryBot-Result: Go LUCI <golang-scoped@luci-project-accounts.iam.gserviceaccount.com>
Reviewed-by: Mark Freeman <mark@golang.org>
Reviewed-by: Keith Randall <khr@golang.org>
This commit is contained in:
Ruihua Wen 2025-07-24 02:36:26 +00:00 • committed by Keith Randall
parent d5dc36af45
commit cd3655a824
3 changed files with 5 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/internal/runtime/maps/group.go
View file

@ -39,7 +39,7 @@ const (
// On other architectures, bitset uses one byte per slot, where each byte is // On other architectures, bitset uses one byte per slot, where each byte is
// either 0x80 if the slot is part of the set or 0x00 otherwise. This makes it // either 0x80 if the slot is part of the set or 0x00 otherwise. This makes it
// convenient to calculate for an entire group at once using standard // convenient to calculate for an entire group at once using standard
// arithemetic instructions. // arithmetic instructions.
type bitset uint64 type bitset uint64
// first returns the relative index of the first control byte in the group that // first returns the relative index of the first control byte in the group that

6
src/internal/runtime/maps/map.go
View file

@ -113,7 +113,7 @@ import (
// Note that each table has its own load factor and grows independently. If the // Note that each table has its own load factor and grows independently. If the
// 1st bucket grows, it will split. We'll need 2 bits to select tables, though // 1st bucket grows, it will split. We'll need 2 bits to select tables, though
// we'll have 3 tables total rather than 4. We support this by allowing // we'll have 3 tables total rather than 4. We support this by allowing
// multiple indicies to point to the same table. This example: // multiple indices to point to the same table. This example:
// //
// directory (globalDepth=2) // directory (globalDepth=2)
// +----+ // +----+
@ -365,7 +365,7 @@ func (m *Map) installTableSplit(old, left, right *table) {
t := m.directoryAt(uintptr(i)) t := m.directoryAt(uintptr(i))
newDir[2*i] = t newDir[2*i] = t
newDir[2*i+1] = t newDir[2*i+1] = t
// t may already exist in multiple indicies. We should // t may already exist in multiple indices. We should
// only update t.index once. Since the index must // only update t.index once. Since the index must
// increase, seeing the original index means this must // increase, seeing the original index means this must
// be the first time we've encountered this table. // be the first time we've encountered this table.
@ -380,7 +380,7 @@ func (m *Map) installTableSplit(old, left, right *table) {
m.dirLen = len(newDir) m.dirLen = len(newDir)
} }
// N.B. left and right may still consume multiple indicies if the // N.B. left and right may still consume multiple indices if the
// directory has grown multiple times since old was last split. // directory has grown multiple times since old was last split.
left.index = old.index left.index = old.index
m.replaceTable(left) m.replaceTable(left)

2
src/internal/runtime/maps/table.go
View file

@ -53,7 +53,7 @@ type table struct {
// Index of this table in the Map directory. This is the index of the // Index of this table in the Map directory. This is the index of the
// _first_ location in the directory. The table may occur in multiple // _first_ location in the directory. The table may occur in multiple
// sequential indicies. // sequential indices.
// //
// index is -1 if the table is stale (no longer installed in the // index is -1 if the table is stale (no longer installed in the
// directory). // directory).