CodePudding user response:
The map reading process? Refers to the process get the map?That's not the data structures and algorithms are the map? Position by the key to calculate a hash bucket (buckets), then remove the value from the corresponding buckets
Of course, there are divided into existence and there is no two cases, the key
There is a key, they took the value as
Is a key does not exist, and two kinds of circumstances, one kind is to return to the success of flag (v, ok:=m [" key "]), one kind is not return flag directly return null (v:=m (" key "), the null value according to type, such as int is 0, the string is an empty string, etc.)