Improve performance of membership checks in `replace_at` and `_initialize_color_dictionary` using sets

[allrob23]

This PR optimizes membership checks by replacing lists with sets in two key functions:

1. replace_at function:

• The index_values used in the if index % index_period in index_values: check has been converted to a set for faster membership testing. This change improves performance when index_values contains multiple elements, as the in operation on a set has an average time complexity of O(1), compared to O(n) for a list.

2. _initialize_color_dictionary function:

• The keys from the dictionary were previously converted to a list for membership testing. This has been replaced by using a set, significantly improving performance, especially when the dictionary is large. The in operation on the set reduces the time complexity from O(n) to O(1).

Both changes are aimed at enhancing the performance of membership tests without altering the logic or behavior of the existing code. These improvements are particularly beneficial in cases where the collections being checked contain many elements.

Let me know if you'd like to add or adjust anything!