示例#1
0
        private void GenRoom(TCODBsp bsp, ref Map map)
        {
            if (bsp.isLeaf())
            {
                float propX1 = _rand.getInt(0, 33);
                float propX2 = _rand.getInt(0, 33);
                float propY1 = _rand.getInt(0, 33);
                float propY2 = _rand.getInt(0, 33);

                int x = bsp.x + (int)(propX1 / 100f * bsp.w);
                int w = bsp.w - (x - bsp.x) - (int)(propX2 / 100f * bsp.w);
                int y = bsp.y + (int)(propY1 / 100f * bsp.h);
                int h = bsp.h - (y - bsp.y) - (int)(propY2 / 100f * bsp.h);

                for (int i = x; i < x + w; i++)
                {
                    for (int j = y; j < y + h; j++)
                    {
                        map[i, j] = false;
                    }
                }
            }
            else
            {
                TCODBsp left  = bsp.getLeft();
                TCODBsp right = bsp.getRight();

                GenRoom(left, ref map);
                GenRoom(right, ref map);

                if (bsp.horizontal)
                {
                    int midx = (left.x + left.x + left.w) / 2;
                    int midL = (left.y + left.y + left.h) / 2;
                    int midR = (right.y + right.y + right.h) / 2;
                    for (int y = midL; y < midR; y++)
                    {
                        map[midx, y] = false;
                    }
                }
                else
                {
                    int midy = (left.y + left.y + left.h) / 2;
                    int midL = (left.x + left.x + left.w) / 2;
                    int midR = (right.x + right.x + right.w) / 2;
                    for (int x = midL; x < midR; x++)
                    {
                        map[x, midy] = false;
                    }
                }
            }
        }
示例#2
0
            public override bool visitNode(TCODBsp node)
            {
                TCODRandom rnd = new TCODRandom();

                if (node.isLeaf())
                {
                    // calculate the room size
                    int minx = node.x + 1;
                    int maxx = node.x + node.w - 1;
                    int miny = node.y + 1;
                    int maxy = node.y + node.h - 1;
                    int x, y;
                    if (!roomWalls)
                    {
                        if (minx > 1) minx--;
                        if (miny > 1) miny--;
                    }
                    if (maxx == SAMPLE_SCREEN_WIDTH - 1) maxx--;
                    if (maxy == SAMPLE_SCREEN_HEIGHT - 1) maxy--;
                    if (randomRoom)
                    {
                        minx = rnd.getInt(minx, maxx - minRoomSize + 1);
                        miny = rnd.getInt(miny, maxy - minRoomSize + 1);
                        maxx = rnd.getInt(minx + minRoomSize - 1, maxx);
                        maxy = rnd.getInt(miny + minRoomSize - 1, maxy);
                    }
                    // resize the node to fit the room
                    //	printf("node %dx%d %dx%d => room %dx%d %dx%d\n",node->x,node->y,node->w,node->h,minx,miny,maxx-minx+1,maxy-miny+1);
                    node.x = minx;
                    node.y = miny;
                    node.w = maxx - minx + 1;
                    node.h = maxy - miny + 1;
                    // dig the room
                    for (x = minx; x <= maxx; x++)
                    {
                        for (y = miny; y <= maxy; y++)
                        {
                            bsp_map[x, y] = ' ';
                        }
                    }
                }
                else
                {
                    //	printf("lvl %d %dx%d %dx%d\n",node->level, node->x,node->y,node->w,node->h);
                    // resize the node to fit its sons
                    TCODBsp left = node.getLeft();
                    TCODBsp right = node.getRight();

                    node.x = System.Math.Min(left.x, right.x);
                    node.y = System.Math.Min(left.y, right.y);
                    node.w = System.Math.Max(left.x + left.w, right.x + right.w) - node.x;
                    node.h = System.Math.Max(left.y + left.h, right.y + right.h) - node.y;
                    // create a corridor between the two lower nodes
                    if (node.horizontal)
                    {
                        // vertical corridor
                        if (left.x + left.w - 1 < right.x || right.x + right.w - 1 < left.x)
                        {
                            // no overlapping zone. we need a Z shaped corridor
                            int x1 = rnd.getInt(left.x, left.x + left.w - 1);
                            int x2 = rnd.getInt(right.x, right.x + right.w - 1);
                            int y = rnd.getInt(left.y + left.h, right.y);
                            vline_up(bsp_map, x1, y - 1);
                            hline(bsp_map, x1, y, x2);
                            vline_down(bsp_map, x2, y + 1);
                        }
                        else
                        {
                            // straight vertical corridor
                            int minx = System.Math.Max(left.x, right.x);
                            int maxx = System.Math.Min(left.x + left.w - 1, right.x + right.w - 1);
                            int x = rnd.getInt(minx, maxx);
                            vline_down(bsp_map, x, right.y);
                            vline_up(bsp_map, x, right.y - 1);
                        }
                    }
                    else
                    {
                        // horizontal corridor
                        if (left.y + left.h - 1 < right.y || right.y + right.h - 1 < left.y)
                        {
                            // no overlapping zone. we need a Z shaped corridor
                            int y1 = rnd.getInt(left.y, left.y + left.h - 1);
                            int y2 = rnd.getInt(right.y, right.y + right.h - 1);
                            int x = rnd.getInt(left.x + left.w, right.x);
                            hline_left(bsp_map, x - 1, y1);
                            vline(bsp_map, x, y1, y2);
                            hline_right(bsp_map, x + 1, y2);
                        }
                        else
                        {
                            // straight horizontal corridor
                            int miny = System.Math.Max(left.y, right.y);
                            int maxy = System.Math.Min(left.y + left.h - 1, right.y + right.h - 1);
                            int y = rnd.getInt(miny, maxy);
                            hline_left(bsp_map, right.x - 1, y);
                            hline_right(bsp_map, right.x, y);
                        }
                    }
                }
                return true;
            }
示例#3
0
        private void GenRoom(TCODBsp bsp, ref Map map)
        {
            if (bsp.isLeaf())
            {
                float propX1 = _rand.getInt(0, 33);
                float propX2 = _rand.getInt(0, 33);
                float propY1 = _rand.getInt(0, 33);
                float propY2 = _rand.getInt(0, 33);

                int x = bsp.x + (int)(propX1 / 100f * bsp.w);
                int w = bsp.w - (x - bsp.x) - (int)(propX2 / 100f * bsp.w);
                int y = bsp.y + (int)(propY1 / 100f * bsp.h);
                int h = bsp.h - (y - bsp.y) - (int)(propY2 / 100f * bsp.h);

                for (int i = x; i < x + w; i++)
                    for (int j = y; j < y + h; j++)
                    {
                        map[i, j] = false;
                    }
            }
            else
            {
                TCODBsp left = bsp.getLeft();
                TCODBsp right = bsp.getRight();

                GenRoom(left, ref map);
                GenRoom(right, ref map);

                if (bsp.horizontal)
                {
                    int midx = (left.x + left.x + left.w) / 2;
                    int midL = (left.y + left.y + left.h) / 2;
                    int midR = (right.y + right.y + right.h) / 2;
                    for (int y = midL; y < midR; y++)
                    {
                        map[midx, y] = false;
                    }
                }
                else
                {
                    int midy = (left.y + left.y + left.h) / 2;
                    int midL = (left.x + left.x + left.w) / 2;
                    int midR = (right.x + right.x + right.w) / 2;
                    for (int x = midL; x < midR; x++)
                    {
                        map[x, midy] = false;
                    }
                }
            }
        }