mirror of https://github.com/golang/go.git
196b663075
To allow these types as map keys, we must fill in equal and hash functions in their algorithm tables. Structs or arrays that are "just memory", like [2]int, can and do continue to use the AMEM algorithm. Structs or arrays that contain special values like strings or interface values use generated functions for both equal and hash. The runtime helper func runtime.equal(t, x, y) bool handles the general equality case for x == y and calls out to the equal implementation in the algorithm table. For short values (<= 4 struct fields or array elements), the sequence of elementwise comparisons is inlined instead of calling runtime.equal. R=ken, mpimenov CC=golang-dev https://golang.org/cl/5451105 |
||
|---|---|---|
| .. | ||
| data.c | ||
| doc.go | ||
| dwarf.c | ||
| dwarf.h | ||
| dwarf_defs.h | ||
| elf.c | ||
| elf.h | ||
| go.c | ||
| ldelf.c | ||
| ldmacho.c | ||
| ldpe.c | ||
| lib.c | ||
| lib.h | ||
| macho.c | ||
| macho.h | ||
| pe.c | ||
| pe.h | ||
| symtab.c | ||