Timeline for Ported C# scheduling to Scala
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 9, 2014 at 19:30 | comment | added | Benjamin Gruenbaum | Thanks, I'll give it a try and let you know how performance looks like. | |
| Nov 9, 2014 at 17:50 | comment | added | Bob Dalgleish | If you have to deal with millions of jobs, you likely don't want to keep the state history. However, calculation times would be very similar. Data structure manipulation would be similar, as immutable data would only ever be copied, and that, rarely. The list operations would be relatively cheap, as you construct new lists, perhaps using the tail of an existing list. | |
| Nov 9, 2014 at 16:39 | comment | added | Benjamin Gruenbaum | Thanks! I'll spend some time processing this. How would performance look like? This processes millions of jobs. | |
| Nov 9, 2014 at 16:17 | history | answered | Bob Dalgleish | CC BY-SA 3.0 |