| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
|
| |
These can be really confusing, especially if there are operators of different
priorities, or multiple levels of parentheses, nearby.
|
| |
|
|
|
|
|
|
| |
Committing separately as I'm not sure whether checking, for example,
ASSERT_RANGE(level, 1, 28) is that nice. Perhaps 27 + 1 could be better?
Perhaps some other syntax?
|
|
|
|
|
| |
The perl regexp to do so is:
s&ASSERT\(([^\n]+) >= ([^\n]+)\);\s*ASSERT\(\1 < ([^\n]+)\);&ASSERT_RANGE($1, $2, $3);&sg;
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
I had to rename distance() (in coord.h) to distance2() because it conflicts
with the STL function to compare 2 iterators. Not a bad change given how it
returns the square of the distance anyway.
I also had to rename the message global variable (in message.cc) to buffer.
I tried to fix and improve the coding style has much as I could, but I
probably missed a few given how huge and tedious it is.
I also didn't touch crawl-gdb.py, and the stuff in prebuilt, rltiles/tool
and util/levcomp.*, because I have no clue about those.
|
| |
|
|
|
|
| |
prev2 will always be set when used, but the compiler doesn't notice that.
|
| |
|
| |
|
|
TODO:
* operate on vault maps rather than grd -- Zaba, would that still allow
using it as a post-processor?
* support for non-empty initial maps -- every connector needs to have enough
seed grown next to it
* some arguments tend to stop prematurely, like 3,3,0,,125 -- we may either
restart or alter the algorithm to give-back squares rejected due to failing
ngb_min; we'd need some tests, preferably on non-empty maps
* delving too much at a boundary looks ugly
|