Consider using an std::unordered_map rather than an std::map in WhiteBoard (was ACTSFW-58)
Original author Hadrien Benjamin Grasland @hgraslan.
Since std::string is hashable, we can get an algorithmic complexity boost from O(log(N)) to O(1) for free by using a hashed map for whiteboard lookup. Is there a good reason not to?