o(1) means constant lookup speeds, whereas o(n) means the speed will depend on the amount of entries within the collection. not that lookup time should even matter for something as simple as commands, he was still wrong
just to not clutter that thread, the reason i said o(1) is because the person stated that 'to use 1 hashmap for all commands is 1 slow af'
Registered Member
Extreme Donator