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>

include/game.h

@@ -91,7 +91,6 @@ void game_init();
 void game_update();
 void game_change_state(enum GameState new_game_state);
 
-// Forward declaration
 struct List; 
 typedef struct List List;
 
@@ -106,9 +105,9 @@ int             hand_get_size(void);
 CardObject**    get_played_array(void);
 int             get_played_top(void);
 int             get_scored_card_index(void);
-List*           get_jokers(void);
 bool            is_joker_owned(int joker_id);
 bool            card_is_face(Card *card);
+List*           get_jokers_list(void);
 
 int get_deck_top(void);
 int get_num_discards_remaining(void);
@@ -122,4 +121,4 @@ void set_game_speed(int new_game_speed);
 bool is_shortcut_joker_active(void);
 int get_straight_and_flush_size(void);
 
-#endif // GAME_H
+#endif // GAME_H