John Breaux
fc8f8b9622
- Everything has been rewritten - Modularity is improved somewhat - No dependency injection in preprocessor/parser, though - There are now early and late constant evaluation engines - This engine allows for by-value access to already-assembled code - Performs basic math operations, remainder, bitwise logic, bit shifts, negation, and bit inversion - Also allows for indexing into already-generated code using pointer-arithmetic syntax: `*(&main + 10)`. This is subject to change? It's clunky, and only allows word-aligned access. However, this rewrite is taking far too long, so I'll call the bikeshedding here. - Pretty sure this constant evaluation is computationally equivalent to Deadfish?
15 lines
321 B
TOML
15 lines
321 B
TOML
unstable_features = true
|
|
max_width = 100
|
|
wrap_comments = true
|
|
comment_width = 100
|
|
|
|
# Allow structs to fill an entire line
|
|
use_small_heuristics = "Max"
|
|
# Allow small functions on single line
|
|
# fn_single_line = true
|
|
|
|
# Alignment
|
|
enum_discrim_align_threshold = 12
|
|
#struct_field_align_threshold = 12
|
|
where_single_line = true
|