| Commit message (Collapse) | Author | Age | Files | Lines |
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
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`
|
| | |
|
| | |
|
| | |
|
| |
|
|
|
|
|
|
| |
Example:
Cannot convert '(1 + 2)' to 'untyped bool' from 'untyped integer'
x := (1 + 2) * true;
^~~~~~^
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
`core:odin/parser` etc
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
with no optimizations enabled
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|