Grid of the steps of a bar at which each lane of a duel track may have a gem.
More...
#include <duelpattern.h>
|
| | DuelPattern (const DataArray *pLanes) |
| | Read a grid from three symbols, one per lane, where x at a step allows a gem.
|
| bool | IsAllowed (int nStep, int nLane) const |
| | Report whether a step allows a gem in a lane.
|
Grid of the steps of a bar at which each lane of a duel track may have a gem.
The class is not polymorphic and has no RTTI. The name is inferred from the duel_patterns configuration the grid is read from.
◆ DuelPattern()
| DuelPattern::DuelPattern |
( |
const DataArray * | pLanes | ) |
|
|
explicit |
Read a grid from three symbols, one per lane, where x at a step allows a gem.
- Parameters
-
| pLanes | The lane symbols, or null for the grid that allows all but the last 3 steps. |
- Ghidra address:
- NTSC-U/C: 0x00128798
- Ghidra address:
- PAL: 0x00129f90
◆ IsAllowed()
| bool DuelPattern::IsAllowed |
( |
int | nStep, |
|
|
int | nLane ) const |
|
inline |
Report whether a step allows a gem in a lane.
- Parameters
-
| nStep | The step. |
| nLane | The lane. |
- Returns
- Whether the step allows a gem.
The documentation for this class was generated from the following file: