| 01:17 | <snek> | oh yeah I thought we'd use the execution context to hold this kind of thing |
| 01:21 | <snek> | wrt number of variables... should we put bounds on the algorithmic complexity of variable.run/get like we do for Map/Set? |
| 02:40 | <littledan> | wrt number of variables... should we put bounds on the algorithmic complexity of variable.run/get like we do for Map/Set? |
| 02:40 | <snek> | well specifically just because we specify them with lists |
| 02:40 | <littledan> | wouldn't that mean every time the execution context changes we need to copy the value over |
| 02:41 | <littledan> | well specifically just because we specify them with lists |
| 02:45 | <snek> |
|
| 02:46 | <snek> | something like this could be reasonable i think |
| 02:46 | <snek> | i guess i can open an issue |
| 03:02 | <Steve Hicks> | wrt number of variables... should we put bounds on the algorithmic complexity of variable.run/get like we do for Map/Set? |
| 03:02 | <snek> | they're planning to start with a linked list but they've outlined a few other implementation strategies to try next |
| 03:03 | <snek> | either way, if we expect react apps to have 100 of these, O(n) might not be great |
| 03:04 | <Steve Hicks> | wouldn't that mean every time the execution context changes we need to copy the value over |
| 03:07 | <Steve Hicks> | either way, if we expect react apps to have 100 of these, O(n) might not be great |
| 03:07 | <Steve Hicks> | But I'm not against speccing defensively here |
| 11:01 | <littledan> | I think we should not spec asymptotic behavior here. First priority for engines should be to optimize the <100 common case. Better to just make a suggestion in a note. |
| 11:01 | <littledan> | they're planning to start with a linked list but they've outlined a few other implementation strategies to try next |