799 karma · joined December 13, 2020
[ my public key: https://keybase.io/mvolfik; my proof: https://keybase.io/mvolfik/sigs/VJT0Utkifb_Y2h3hM7OYj50eT4rBTTmCAGhVg_1q7uw ]
{
"0": [
"CountAdjacentChance eq 1 1 1 0.01",
"CountAdjacentChance ge 1 2 1 0.03"
],
"1": [
"SpontaneousChange 2 0.00001",
"ChangeByBlockAge gt 200 3 0.1",
"CountAdjacentChance eq 2 1 2 0.4",
"CountAdjacentChance eq 2 2 2 0.8",
"CountAdjacentChance ge 2 3 2 1.0"
],
"2": [
"SpontaneousChange 3 1"
],
"3": [
"SpontaneousChange 0 0.25"
],
"InitialCondition": "1 0.0005",
"colorMap": {
"0": "black",
"1": "green",
"2": "red",
"3": "brown"
},
"timeStep": 30
}And Wikipedia has a tree-ish structure too, after all - look at portals, categories etc
Otoh, then I tried Pycharm community, and eventually redeemed my github student pack for free pro version, and now I can't imagine living without it. Also there's a great plugin that annoys you with small non-modal popup in LB corner whenever you use mouse and reminds you of the correct hotkey
As for the performance gain - 13.5 s with Python, 9 s compiled. It was a naive implementation of AoC 2020/23, so a lot of array cutting, concatenation etc. So this isn't really math, rather lot of RAM I/O
but the issuance time isn't relevant, they can easily backdate the cert
NOT_FOUND = 404
m = {"NOT_FOUND": NOT_FOUND}
match value:
case m["NOT_FOUND"]:
passthough there's also this screenshot: https://twitter.com/555Sunny/status/1354854993946406917?s=20
can anyone confirm if this is actually happening or if this is what margin trades at robinhood look like?