Can the search operation by key in Map be considered constant time complexity?

In Go, the operation of searching for a key in a map typically has an amortized time complexity close to O(1), meaning it is constant time on average. However, in the worst case, such as when there are many hash collisions, the complexity can worsen. Therefore, it cannot be strictly guaranteed to be constant time, but in practice, searching in a map is very fast and efficient.