Timeline for Comparing two arrays to see if they contain objects with different IDs
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 22, 2012 at 16:16 | comment | added | Domenic | +1 for the loop-labeling novelty, but not really much better than what I already have, considering performance doesn't matter. | |
| Feb 22, 2012 at 12:16 | comment | added | Gerben |
if a is [{x:1},{x:1}] and b is [{x:1}] your code would say they are different. I didn't know you could label loops.
|
|
| Feb 22, 2012 at 11:10 | comment | added | Quentin Pradet | Also, your solution is all about performance, but not about concise code, which is not what the OP asked. It's still a nice trick, thanks for sharing. | |
| Feb 22, 2012 at 10:49 | comment | added | Quentin Pradet | I fail to see why anyone would implement a O(n²) sort? | |
| Feb 22, 2012 at 3:01 | history | answered | Ross Patterson | CC BY-SA 3.0 |