… | |
… | |
76 | for (i = 0; i < RP->Xsize; i++) |
76 | for (i = 0; i < RP->Xsize; i++) |
77 | for (j = 0; j < RP->Ysize; j++) |
77 | for (j = 0; j < RP->Ysize; j++) |
78 | { |
78 | { |
79 | if (maze[i][j] == 'D') |
79 | if (maze[i][j] == 'D') |
80 | { |
80 | { |
81 | int sindex; |
81 | int sindex = surround_check2 (maze, i, j, RP->Xsize, RP->Ysize); |
82 | object *this_door, *new_door; |
|
|
83 | |
82 | |
84 | sindex = surround_check2 (maze, i, j, RP->Xsize, RP->Ysize); |
83 | object *this_door = (sindex == 3 ? hdoors : vdoors) |
85 | if (sindex == 3) |
84 | ->pick_random_object (); |
86 | this_door = hdoors->pick_random_object (); |
|
|
87 | else |
|
|
88 | this_door = vdoors->pick_random_object (); |
|
|
89 | |
85 | |
90 | if (!this_door) |
86 | if (!this_door)//TODO not necessary? |
91 | abort (); |
87 | abort (); |
92 | |
88 | |
93 | new_door = arch_to_object (this_door->arch); |
89 | object *new_door = this_door->clone (); |
94 | this_door->copy_to (new_door); |
|
|
95 | new_door->x = i; |
90 | new_door->x = i; |
96 | new_door->y = j; |
91 | new_door->y = j; |
97 | insert_ob_in_map (new_door, the_map, NULL, 0); |
92 | insert_ob_in_map (new_door, the_map, NULL, 0); |
98 | } |
93 | } |
99 | } |
94 | } |