Map for data structures

[joshwget]

No description provided.

[eush77]

Why did you call it map exactly? IMO this is forEach.

[felipernb]

I agree with @eush77, map usually returns an Array with the transformed results while forEach doesn't (and that's what you're doing there)

[felipernb]

The linter is complaining about this space before function (to test it, run make locally)

[joshwget]

I had the same thought about the name, but I saw map was already used in linked lists so I just kept it for consistency. My local build didn't catch any of the syntax problems, but I think the problem was coming from running "make" as root. Thanks for the comments though, I'll make these changes soon.

[coveralls]

Coverage remained the same when pulling 5f7b84b on joshuacurl:map into fd04111 on felipernb:master.

[felipernb]

Yeah, you're right about the LinkedList map, I'll change it to forEach :)

[coveralls]

Coverage remained the same when pulling eed6f49 on joshuacurl:map into a4b8d5b on felipernb:master.

[joshwget]

The best way I could think of to iterate through a heap in order was to copy the elements and call extract until it was empty, like heap sort.

[felipernb]

Thanks for the contribution @joshuacurl!

I've merged it and changed somethings by myself as well:

1. f92635e - Having JSON.parse(JSON.stringify(...)) changes the items stored inside the array and we don't want that. The side-effects can be pretty bad if you're using regular objects (they lose their prototype and are become new objects with different references), so I'm just creating a new array and passing all the existing objects to it.
2. ecfb649 The forEach for a Hash Table should receive the key and the value.