Create hashmap.md #45
Conversation
| @@ -0,0 +1,20 @@ | |||
| ### Hashmaps | |||
|
|
|||
| With arrays you have to store data in an ordered sequence identified with a indx. `Hashmaps` store data in a (key, pair) sequence that you can access by the index referring to another Object(indx is also an Object) | |||
There was a problem hiding this comment.
This misses a pretty needed step of explaining how .equals and .hashCode work. Without that they would make a HashMap<Apple, Apple> and not be primed to understand what is going on.
That or they might have a mutable aggregate as a key.
|
|
||
| ```java | ||
| import java.util.HashMap; | ||
| HashMap<Type, Type> Name = new HashMap<Type, Type>(); |
There was a problem hiding this comment.
If its <Type, Type> , that implies that both the keys and the values are the same type? Thats confusing.
| map.size(); | ||
| ``` | ||
|
|
||
| Note: use `keyset()` to only get keys and `values()` to get specific Object values in loops |
There was a problem hiding this comment.
This note is silly without a clear example.
| **Functions:** | ||
|
|
||
| ```java | ||
| map.put(identifier, value); |
There was a problem hiding this comment.
The key is not an "identifier", its a key.
|
|
||
| ```java | ||
| map.put(identifier, value); | ||
| map.get(identifier); |
There was a problem hiding this comment.
Each of these should rightfully get their own page.
|
This pull request is stale because it has been open 30 days with no activity. Remove stale label, comment or add the valid label or this will be closed in 5 days. |
github-actions
bot
added
stale
inactivity-closed
2 participants
No description provided.