Timeline for Sorting parallel ArrayList
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 21, 2013 at 22:57 | vote | accept | wtsang02 | ||
| Jan 18, 2013 at 3:18 | comment | added | Andrey Taptunov | @wtsang02, if you have 100% guarantee that they are close and will always be this close - it's not a problem. However, if by some accident you decide to compare two WinningSets by Unix time (month or so apart, if I recall correctly) you could have a problem. For example, if you decide in future to accumulate them somewhere for a long time then this way of comparison can result in a wrong behaviour. I just always prefer a usual way to write comparison just not to think about such cases. | |
| Jan 17, 2013 at 20:26 | comment | added | wtsang02 | I agree with point 2 and 3, but I am not understanding 1. If the two unixtime is very close then it should give a small Integer (less than 10 secs) . So how does Integer.MAX_VALUE have anything to do with this. Thanks. | |
| Jan 17, 2013 at 6:29 | history | edited | Andrey Taptunov | CC BY-SA 3.0 |
added 219 characters in body
|
| Jan 17, 2013 at 6:14 | history | edited | Andrey Taptunov | CC BY-SA 3.0 |
added 15 characters in body
|
| Jan 17, 2013 at 5:53 | history | answered | Andrey Taptunov | CC BY-SA 3.0 |