summaryrefslogtreecommitdiffstats
path: root/crawl-ref/source/dgn-delve.cc
Commit message (Collapse)AuthorAgeFilesLines
* Drop a lot of superfluous parentheses.Adam Borowski2013-10-241-2/+2
| | | | | These can be really confusing, especially if there are operators of different priorities, or multiple levels of parentheses, nearby.
* Fix lots of typosChris Oelmueller2013-07-231-2/+2
|
* ASSERT_RANGEs other than >= <.Adam Borowski2013-06-081-4/+2
| | | | | | 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?
* Turn pairs of assertions with x > min, x <= max into ASSERT_RANGE.Adam Borowski2013-06-081-2/+1
| | | | | The perl regexp to do so is: s&ASSERT\(([^\n]+) >= ([^\n]+)\);\s*ASSERT\(\1 < ([^\n]+)\);&ASSERT_RANGE($1, $2, $3);&sg;
* Use std namespace.Raphael Langella2012-08-261-2/+2
| | | | | | | | | | | | | 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.
* Try to restart layout_devel when it gets stuck (likely for 2,2 and 3,3).Adam Borowski2011-09-061-1/+12
|
* Silence a bogus compiler warning.Adam Borowski2011-09-011-1/+1
| | | | prev2 will always be set when used, but the compiler doesn't notice that.
* layout_delve: in grd mode, don't trample upon MMT_VAULT.Adam Borowski2011-08-291-1/+2
|
* Allow delve() to operate on both grd or map_lines.Adam Borowski2011-08-291-38/+86
|
* Reimplement Kusigrosz' layout_delve.Adam Borowski2011-08-291-0/+257
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