コード例 #1
0
ファイル: GridPlane.cs プロジェクト: WishnusArmy/Game
 public override void Draw(GameTime gameTime, SpriteBatch spriteBatch)
 {
     if (RANDOM.Next(8) == 0)
     {
         SortingThread.AddRequest(this);
     }
     base.Draw(gameTime, spriteBatch);
     //Draw the grid outlines
     for (int i = 0; i < (LEVEL_SIZE.X + LEVEL_SIZE.Y); ++i)
     {
         //Right to left
         DrawingHelper.DrawLine(spriteBatch, GlobalPosition + new Vector2(LEVEL_SIZE.X * NODE_SIZE.X - NODE_SIZE.X * i, 0), GlobalPosition + new Vector2(LEVEL_SIZE.X * NODE_SIZE.X, NODE_SIZE.Y * i), Color.Black, 2, 0.0f);
         //Left to right
         DrawingHelper.DrawLine(spriteBatch, GlobalPosition + new Vector2(NODE_SIZE.X * i, 0), GlobalPosition + new Vector2(0, NODE_SIZE.Y * i), Color.Black, 2, 0.0f);
     }
 }
コード例 #2
0
ファイル: GridPlane.cs プロジェクト: WishnusArmy/Game
    public GridPlane(Camera.Plane planeType) : base()
    {
        spawnGrid      = new List <GridNode>();
        this.planeType = planeType;
        //Initialize the grid with the size of the level
        grid = new GridNode[LEVEL_SIZE.X, LEVEL_SIZE.Y];
        //Fill the grid with GridItems
        for (int y = 0; y < LEVEL_SIZE.Y; ++y)
        {
            for (int x = 0; x < LEVEL_SIZE.X; ++x) //Make sure the grid gets build up from the bottom
            {
                if (y % 2 == 0)                    //All odd rows will be shifted half a node in order to lock together
                {
                    grid[x, y] = new GridNode(planeType, new Vector2(NODE_SIZE.X * x, NODE_SIZE.Y / 2 * y), 0);
                }
                else
                {
                    grid[x, y] = new GridNode(planeType, new Vector2(NODE_SIZE.X * x + NODE_SIZE.X / 2, NODE_SIZE.Y / 2 * y), 0);
                }
                Add(grid[x, y]);
            }
        }
        //SET THE NEIGHBOURS
        for (int x = 0; x < LEVEL_SIZE.X; ++x)
        {
            for (int y = 0; y < LEVEL_SIZE.Y; ++y)
            {
                if (y % 2 == 0) //Even rows (4 cases)
                {
                    if (x > 0 && y > 0)
                    {
                        grid[x, y].neighbours.Add(grid[x - 1, y - 1]);
                    }                                                                      //TopLeft
                    if (y > 0)
                    {
                        grid[x, y].neighbours.Add(grid[x, y - 1]);
                    }                                                         //TopRight
                    if (y < LEVEL_SIZE.Y - 1)
                    {
                        grid[x, y].neighbours.Add(grid[x, y + 1]);
                    }                                                                       //BottomRight
                    if (x > 0 && y < LEVEL_SIZE.Y - 1)
                    {
                        grid[x, y].neighbours.Add(grid[x - 1, y + 1]);
                    }                                                                                     //BottomLeft
                }
                else //Odd rows (4 cases)
                {
                    if (y > 0)
                    {
                        grid[x, y].neighbours.Add(grid[x, y - 1]);
                    }                                                         //TopLeft
                    if (x < LEVEL_SIZE.X - 1 && y > 0)
                    {
                        grid[x, y].neighbours.Add(grid[x + 1, y - 1]);
                    }                                                                                     //TopRight
                    if (x < LEVEL_SIZE.X - 1 && y < LEVEL_SIZE.Y - 1)
                    {
                        grid[x, y].neighbours.Add(grid[x + 1, y + 1]);
                    }                                                                                                    //BottomRight
                    if (y < LEVEL_SIZE.Y - 1)
                    {
                        grid[x, y].neighbours.Add(grid[x, y + 1]);
                    }                                                                        //BottomLeft
                }
            }
        }

        for (int x = 0; x < LEVEL_SIZE.X; ++x) //set the extended neighbours
        {
            for (int y = 0; y < LEVEL_SIZE.Y; ++y)
            {
                if (x > 0)
                {
                    grid[x, y].extendedNeighbours.Add(grid[x - 1, y]);
                }
                if (x < LEVEL_SIZE.X - 1)
                {
                    grid[x, y].extendedNeighbours.Add(grid[x + 1, y]);
                }
                if (y > 1)
                {
                    grid[x, y].extendedNeighbours.Add(grid[x, y - 2]);
                }
                if (y < LEVEL_SIZE.Y - 2)
                {
                    grid[x, y].extendedNeighbours.Add(grid[x, y + 2]);
                }
            }
        }
        //Calculate the Heuristic for the pathfinding algorithm
        foreach (GridNode node in grid)
        {
            node.Hval       = (int)(Math.Abs(node.Position.X - LEVEL_CENTER.X) + Math.Abs(node.Position.Y - LEVEL_CENTER.Y)) / 64; //Calculate the Heuristic
            node.pathParent = node;                                                                                                //Reset the parent
        }

        //ADD LEVEL OBJECTS IN THE CAMERA CLASS.
        //ADDING THEM HERE WILL ADD THEM TO EVERY PLANE AL THE SAME
        Add(particleControl = new ParticleController());
        WishnusArmy.WishnusArmy.startSorting = true;
        SortingThread.AddRequest(this);
    }