Update list implementation to work with memory pools (#168)
* Introduce indexed list implementation * Fix CI tests for pool * Take bitset out of pool * Replace joker bitset interactions with wrappers * Add bitset tests * Add test to gitignore --------- Co-authored-by: rfehr-idexx <ric-fehr@idexx.com>
This commit is contained in:
+2
-1
@@ -12,6 +12,8 @@
|
||||
// plus the amount that can fit in the shop, 8 should be fine. For now...
|
||||
#define MAX_ACTIVE_JOKERS 8
|
||||
|
||||
#define MAX_DEFINABLE_JOKERS 150
|
||||
|
||||
#define JOKER_TID (MAX_HAND_SIZE + MAX_SELECTION_SIZE) * JOKER_SPRITE_OFFSET // Tile ID for the starting index in the tile memory
|
||||
#define JOKER_SPRITE_OFFSET 16 // Offset for the joker sprites
|
||||
#define JOKER_BASE_PB 4 // The starting palette index for the jokers
|
||||
@@ -68,7 +70,6 @@ enum JokerEvent
|
||||
#define SHORTCUT_JOKER_ID 26
|
||||
#define FOUR_FINGERS_JOKER_ID 48
|
||||
|
||||
|
||||
typedef struct
|
||||
{
|
||||
u8 id; // Unique ID for the joker, used to identify different jokers
|
||||
|
||||
Reference in New Issue
Block a user