| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
|
| |
iterating across a scope entry map
|
| | |
|
| | |
|
| |
|
|
| |
unchecked procedure bodies
|
| |
|
|
| |
`for`/`switch` statement
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
but are from different packages
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
simplify behaviour
|
| |
|
|
| |
system to be much more thread-friendly
|
| | |
|
| | |
|
| |
|
|
| |
This now replaces Bill's crappy big int implementation
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
|
|
| |
variables of contention
NOTE(bill): I know this is dodgy, but I want to make sure it is correct logic before improve those data structures
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
Allowing for `i, ok := &x.(T);` (type assertions) and `v, ok := &m[k];` (map indexing)
|
| | |
|
| |
|
|
| |
`v.xyz`, `v.argb`, `v.xxx`
|