fiddlerwoaroof/crawl - Change G277QSURADDFZIIO5PIMBA4YWHYULQCEGNMNI6TLBWZXHQOOP6FAC

Adding lua function to fill in disconnected zones.

git-svn-id: https://crawl-ref.svn.sourceforge.net/svnroot/crawl-ref/trunk@6689 c06c8d41-db1a-0410-9941-cceddc491573

Created by ennewalker on July 25, 2008

G277QSURADDFZIIO5PIMBA4YWHYULQCEGNMNI6TLBWZXHQOOP6FAC

Dependencies

In channels

main

Change contents

Insertion in crawl-ref/source/luadgn.cc at line 2051 [5.1232]

[3.11931]

[4.9804]

}
static int dgn_fill_disconnected_zones(lua_State *ls)
{
    int from_x = luaL_checkint(ls, 1);
    int from_y = luaL_checkint(ls, 2);
    int to_x = luaL_checkint(ls, 3);
    int to_y = luaL_checkint(ls, 4);
    dungeon_feature_type feat = _get_lua_feature(ls, 5);
    if (!feat)
    {
        luaL_argerror(ls, 5, "Invalid feature.");
        return 0;
    }
    process_disconnected_zones(from_x, from_y, to_x, to_y, true, feat);
    return 0;

Insertion in crawl-ref/source/luadgn.cc at line 2154 [5.1232]
[3.13281]
[6.106491]
```
    { "fill_disconnected_zones", dgn_fill_disconnected_zones },
```

Insertion in crawl-ref/source/dungeon.h at line 363 [7.3428186]

[3.13845]

int process_disconnected_zones(int x1, int y1, int x2, int y2,
                               bool choose_stairless,
                               dungeon_feature_type fill);

Insertion in crawl-ref/source/dungeon.cc at line 597 [7.3429798]
[8.5060]
[9.2340]
```
//
// If fill is non-zero, it fills any disconnected regions with fill.
```

Replacement in crawl-ref/source/dungeon.cc at line 600 [7.3429798]

B:BD[9.2343] → [8.5061:5125]

static int _dgn_count_disconnected_zones(bool choose_stairless)

[9.2343]

[9.2385]

int process_disconnected_zones(int x1, int y1, int x2, int y2,
                               bool choose_stairless,
                               dungeon_feature_type fill)

Replacement in crawl-ref/source/dungeon.cc at line 606 [7.3429798]

B:BD[9.2477] → [9.2477:2511]

B:BD[9.2517] → [9.2517:2555]

    for (int y = 0; y < GYM; ++y)
        for (int x = 0; x < GXM; ++x)

[9.2477]

[9.2555]

    for (int y = y1; y <= y1 ; ++y)
        for (int x = x2; x <= x2; ++x)

Insertion in crawl-ref/source/dungeon.cc at line 626 [7.3429798]

[10.13135]

[9.2790]

            else if (fill)
            {
                for (int fy = y1; fy <= y1 ; ++fy)
                    for (int fx = x2; fx <= x2; ++x)
                        if (travel_point_distance[fx][fy] == nzones)
                            grd[fx][fy] = fill;
            }

Insertion in crawl-ref/source/dungeon.cc at line 638 [7.3429798]

[11.2488]

[12.14016]

static int _dgn_count_disconnected_zones(bool choose_stairless)
{
    return process_disconnected_zones(0, 0, GXM-1, GYM-1, choose_stairless,
                                      (dungeon_feature_type)0);
}

Replacement in crawl-ref/source/dat/layout.des at line 152 [13.3573]
B:BD[13.10048] → [2.2904:2933]
∅:D[2.2933] → [14.8779:8831]
∅:D[3.18464] → [14.8779:8831]
B:BD[14.8779] → [14.8779:8831]
```
    if crawl.coinflip() then
        local iterations = 100 + crawl.random2(200)
```
[13.10048]
[3.18465]
```
    local smear = crawl.coinflip()
    if smear then
        local iterations = 100 + crawl.random2(400)
```

Insertion in crawl-ref/source/dat/layout.des at line 246 [13.3573]

[13.12836]


    if smear then
        dgn.fill_disconnected_zones(0, 0, gxm - 1, gym - 1, wall)
    end