// 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
// convenient to calculate for an entire group at once using standard
-// arithemetic instructions.
+// arithmetic instructions.
type bitset uint64
// first returns the relative index of the first control byte in the group that
// 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
// 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)
// +----+
t := m.directoryAt(uintptr(i))
newDir[2*i] = 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
// increase, seeing the original index means this must
// be the first time we've encountered this table.
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.
left.index = old.index
m.replaceTable(left)
// 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
- // sequential indicies.
+ // sequential indices.
//
// index is -1 if the table is stale (no longer installed in the
// directory).