Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/antouhou/hexcore
Library for working with hex grids. Finds paths and ranges, has terrain and movement types, stores the graph, supports the offset and cube coordinate systems.
https://github.com/antouhou/hexcore
game game-dev gamedev grid hex hexagonal-grid-library hexagonal-grids hexcore hexgrid unity unity2d unity3d
Last synced: 15 days ago
JSON representation
Library for working with hex grids. Finds paths and ranges, has terrain and movement types, stores the graph, supports the offset and cube coordinate systems.
- Host: GitHub
- URL: https://github.com/antouhou/hexcore
- Owner: antouhou
- License: mit
- Created: 2018-05-17T15:23:36.000Z (over 6 years ago)
- Default Branch: master
- Last Pushed: 2024-04-16T12:59:57.000Z (8 months ago)
- Last Synced: 2024-04-16T15:24:03.764Z (8 months ago)
- Topics: game, game-dev, gamedev, grid, hex, hexagonal-grid-library, hexagonal-grids, hexcore, hexgrid, unity, unity2d, unity3d
- Language: C#
- Homepage:
- Size: 486 KB
- Stars: 19
- Watchers: 2
- Forks: 4
- Open Issues: 2
-
Metadata Files:
- Readme: README.md
- Contributing: CONTRIBUTING.md
- License: LICENSE.md
Awesome Lists containing this project
README
[logo]: ./icon48.png "HexCore logo"
# HexCore ![alt text][logo]
HexCore is a library to perform various operations with a hexagonal grid, such as finding shortest paths from one cell to another, managing terrains and movement types, maintaining the grid state, finding various ranges, neighbors, various coordinate systems and converters between them, and some more stuff you may want to do with a hex grid.
HexCore is designed with performance in mind: it is a zero runtime heap allocation library.
HexCore achieves zero runtime allocations by using an object pool with preallocated lists.
Pass any list returned by the library to the `Graph#ReturnListToPool` method after you no longer need it, and it will be recycled without any memory allocation.
## Installation
### Unity:
1. Open the terminal, go to the Assets directory of your Unity project
2. Run `git clone https://github.com/antouhou/HexCore.git` (or `git submodule add https://github.com/antouhou/HexCore.git` if you're already using git in your project)
3. Go to the `HexCore` directory that was created on step 2 and delete `HexCore.Tests` directory
(This directory contains unit tests, and will prevent Unity from building the project)
### NuGet:
The library can be installed from [NuGet](https://www.nuget.org/packages/HexCore). Run from the command line `dotnet add package HexCore` in your project or use your IDE of choice.
## Usage
For the detailed explanations please see [the docs](./Docs).
### Quickstart
```c#
using System.Collections.Generic;
using HexCore;
namespace HexCoreTests
{
public class QuickStart
{
public static void Demo()
{
var ground = new TerrainType(1, "Ground");
var water = new TerrainType(2, "Water");
var walkingType = new MovementType(1, "Walking");
var swimmingType = new MovementType(2, "Swimming");
var movementTypes = new MovementTypes(
new[] {ground, water},
new Dictionary>
{
[walkingType] = new Dictionary
{
[ground] = 1,
[water] = 2
},
[swimmingType] = new Dictionary
{
[ground] = 2,
[water] = 1
}
}
);
var graph = new Graph(new List
{
new CellState(false, new Coordinate2D(0, 0, OffsetTypes.OddRowsRight), ground),
new CellState(false, new Coordinate2D(0, 1, OffsetTypes.OddRowsRight), ground),
new CellState(true, new Coordinate2D(1, 0, OffsetTypes.OddRowsRight), water),
new CellState(false, new Coordinate2D(1, 1, OffsetTypes.OddRowsRight), water),
new CellState(false, new Coordinate2D(1, 2, OffsetTypes.OddRowsRight), ground)
}, movementTypes);
var pawnPosition = new Coordinate2D(0, 0, OffsetTypes.OddRowsRight).To3D();
// Mark pawn's position as occupied
graph.BlockCells(pawnPosition);
const int pawnMovementPoints = 3;
var pawnMovementRange = graph.GetMovementRange(
pawnPosition, pawnMovementPoints, walkingType
);
var pawnGoal = new Coordinate2D(1, 2, OffsetTypes.OddRowsRight).To3D();
var theShortestPath = graph.GetShortestPath(
pawnPosition,
pawnGoal,
walkingType
);
// When moving pawn, unblock old position and block the new one.
graph.UnblockCells(pawnPosition);
pawnPosition = pawnGoal;
graph.BlockCells(pawnGoal);
var expectedMovementRange = new List
{
new Coordinate2D(0, 1, OffsetTypes.OddRowsRight).To3D(),
new Coordinate2D(1, 1, OffsetTypes.OddRowsRight).To3D(),
new Coordinate2D(1, 2, OffsetTypes.OddRowsRight).To3D()
};
var expectedPath = new List
{
new Coordinate2D(0, 1, OffsetTypes.OddRowsRight).To3D(),
pawnGoal
};
}
}
}
```
The resulting graph would look like this:
```
⬡⬡
⬡⬡⬡
```
The two cells on top would have terrain type "ground", the two cells in the second row would represent our first lake, and the first water cell would be not passable - we can imagine that there's a sharp rock in the lake at that spot.
For the detailed explanations please see [the docs](./Docs).
## Contributing
Everyone is welcome to contribute in any way of form! For the further details, please read [CONTRIBUTING.md](./CONTRIBUTING.md)
## Authors
- [Anton Suprunchuk](https://github.com/antouhou) - [Website](https://antouhou.com)
See also the list of contributors who participated in this project.
## License
This project is licensed under the MIT License - see the [LICENSE.md](./LICENSE.md) file for details