| 1899 | } |
| 1900 | |
| 1901 | void ObjL2Special(int x1, int y1, int x2, int y2) |
| 1902 | { |
| 1903 | int i, j; |
| 1904 | |
| 1905 | for (j = y1; j <= y2; j++) { |
| 1906 | for (i = x1; i <= x2; i++) { |
| 1907 | dArch[i][j] = 0; |
| 1908 | if (dPiece[i][j] == 541) |
| 1909 | dArch[i][j] = 5; |
| 1910 | if (dPiece[i][j] == 178) |
| 1911 | dArch[i][j] = 5; |
| 1912 | if (dPiece[i][j] == 551) |
| 1913 | dArch[i][j] = 5; |
| 1914 | if (dPiece[i][j] == 542) |
| 1915 | dArch[i][j] = 6; |
| 1916 | if (dPiece[i][j] == 553) |
| 1917 | dArch[i][j] = 6; |
| 1918 | if (dPiece[i][j] == 13) |
| 1919 | dArch[i][j] = 5; |
| 1920 | if (dPiece[i][j] == 17) |
| 1921 | dArch[i][j] = 6; |
| 1922 | } |
| 1923 | } |
| 1924 | for (j = y1; j <= y2; j++) { |
| 1925 | for (i = x1; i <= x2; i++) { |
| 1926 | if (dPiece[i][j] == 132) { |
| 1927 | dArch[i][j + 1] = 2; |
| 1928 | dArch[i][j + 2] = 1; |
| 1929 | } |
| 1930 | if (dPiece[i][j] == 135 || dPiece[i][j] == 139) { |
| 1931 | dArch[i + 1][j] = 3; |
| 1932 | dArch[i + 2][j] = 4; |
| 1933 | } |
| 1934 | } |
| 1935 | } |
| 1936 | } |
| 1937 | |
| 1938 | void DoorSet(int oi, int dx, int dy) |
| 1939 | { |
no outgoing calls
no test coverage detected