Question: table similar to C++ std::unordered_map

Hello everybody,

i'm searching for a data-structure similar to the C++ std::unordered_map, so that the access time is konstant O(1) and no matter about the order. What access time does a table() in Maple have, it seems to be not O(1).

 

 

 

Please Wait...