As indicated by the official website , deleting with a key from a dictionary (or map in other languages) is O (n) in Swift, which makes it rather inefficient.
Why is it not O (1) if put () and get () should be O (1) based on the hash?
No one has answered this question yet.
See related questions:
Source: https://habr.com/ru/post/1695940/More articles:Does it have access control for remote designers? - c ++how to apply tolower () to the capital letters of Germany Ä, Ö, Ü, ẞ in C ++ - c ++R markdown to PDF - print console output - rHow to use the functions in text files with different encoding in C ++ - c ++BigInteger.Parse () the problem of reading in large quantities - c #Writing table data for multiple records in ASP.NET MVC Core 2.0 - asp.net-core-2.0Real-time multiplayer Google Play game combined with LibGDX - javawhy does a button change the properties of an object only after a manual change? - javascriptЧто такое инверсия "_mm256_cvtepi16_epi32" - x86Why does this user introduce the fgets () function, causing the program to interrupt? - cAll Articles
