workspace
stringclasses 1
value | channel
stringclasses 1
value | sentences
stringlengths 1
3.93k
| ts
stringlengths 26
26
| user
stringlengths 2
11
| sentence_id
stringlengths 44
53
| timestamp
float64 1.5B
1.56B
| __index_level_0__
int64 0
106k
|
|---|---|---|---|---|---|---|---|
pythondev | help | Yeah it pastes 2N but it's actually 2^N | 2019-04-02T01:34:30.094400 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:34:30.094400 | 1,554,168,870.0944 | 16,421 |
pythondev | help | Okay, that's much easier, so we have a complete tree, with no skipped rounds. | 2019-04-02T01:34:56.094800 | Sasha | pythondev_help_Sasha_2019-04-02T01:34:56.094800 | 1,554,168,896.0948 | 16,422 |
pythondev | help | I can't tell if it's easy or hard. Would we want to try to sort it? How would you approach this? | 2019-04-02T01:35:33.095500 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:35:33.095500 | 1,554,168,933.0955 | 16,423 |
pythondev | help | We know that if our team is the lowest ranked, it wins 0 rounds. If there is at least 1 lower-ranked team, it wins 1 round. If there are 3 lower-ranked teams, it can win 2 rounds. If there are 7 lower-ranked teams, it can win 3 rounds, etc. | 2019-04-02T01:36:36.096800 | Sasha | pythondev_help_Sasha_2019-04-02T01:36:36.096800 | 1,554,168,996.0968 | 16,424 |
pythondev | help | Okay, i didn't think of it in that way | 2019-04-02T01:37:00.097300 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:37:00.097300 | 1,554,169,020.0973 | 16,425 |
pythondev | help | So all you have to do is put our team in the first slot, put all the lower-ranked teams in the next slots, and then fill the rest with the higher-ranked teams. | 2019-04-02T01:37:48.098100 | Sasha | pythondev_help_Sasha_2019-04-02T01:37:48.098100 | 1,554,169,068.0981 | 16,426 |
pythondev | help | Huh | 2019-04-02T01:38:19.098400 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:38:19.098400 | 1,554,169,099.0984 | 16,427 |
pythondev | help | Yeah i mean that makes sense conceptually | 2019-04-02T01:38:27.098700 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:38:27.098700 | 1,554,169,107.0987 | 16,428 |
pythondev | help | Wait no that actually makes sense | 2019-04-02T01:38:55.099000 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:38:55.099000 | 1,554,169,135.099 | 16,429 |
pythondev | help | So you just arrange the teams in order of weakest to strongest | 2019-04-02T01:39:07.099400 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:39:07.099400 | 1,554,169,147.0994 | 16,430 |
pythondev | help | Place are team in the first slot and then fill out the bracket? | 2019-04-02T01:39:16.099700 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:39:16.099700 | 1,554,169,156.0997 | 16,431 |
pythondev | help | *** our | 2019-04-02T01:40:48.100700 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:40:48.100700 | 1,554,169,248.1007 | 16,432 |
pythondev | help | Yep, that seems to be a sufficient solution. The code would basically just be a print loop with an if or two. | 2019-04-02T01:41:21.101300 | Sasha | pythondev_help_Sasha_2019-04-02T01:41:21.101300 | 1,554,169,281.1013 | 16,433 |
pythondev | help | So we're just ordering the teams from weakest to strongest. bumping ours to the front slot and then printing the result? | 2019-04-02T01:42:12.102100 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:42:12.102100 | 1,554,169,332.1021 | 16,434 |
pythondev | help | That's it? | 2019-04-02T01:42:13.102400 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:42:13.102400 | 1,554,169,333.1024 | 16,435 |
pythondev | help | Pretty much, yep. Unless someone sees something we're missing about the problem. | 2019-04-02T01:42:50.102800 | Sasha | pythondev_help_Sasha_2019-04-02T01:42:50.102800 | 1,554,169,370.1028 | 16,436 |
pythondev | help | My friend asks what if we wanted to make the bracket random | 2019-04-02T01:43:50.103200 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:43:50.103200 | 1,554,169,430.1032 | 16,437 |
pythondev | help | Which isn't actually a requirement but would probably make it significantly harder | 2019-04-02T01:44:04.103600 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:44:04.103600 | 1,554,169,444.1036 | 16,438 |
pythondev | help | I don't quite understand. If it's random, we don't have any choice. | 2019-04-02T01:44:35.104000 | Sasha | pythondev_help_Sasha_2019-04-02T01:44:35.104000 | 1,554,169,475.104 | 16,439 |
pythondev | help | Well maybe not random | 2019-04-02T01:45:57.104200 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:45:57.104200 | 1,554,169,557.1042 | 16,440 |
pythondev | help | But not as ordered as our team, weakest -> strongest | 2019-04-02T01:46:17.104800 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:46:17.104800 | 1,554,169,577.1048 | 16,441 |
pythondev | help | Not random i guess just disorganized. to mimic an actual bracket | 2019-04-02T01:46:35.105200 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:46:35.105200 | 1,554,169,595.1052 | 16,442 |
pythondev | help | You can definitely scramble up the teams and still get the same result, as long as there are at least 2^m - 1 weaker teams in our team's tree (for winning m rounds). | 2019-04-02T01:49:09.106300 | Sasha | pythondev_help_Sasha_2019-04-02T01:49:09.106300 | 1,554,169,749.1063 | 16,443 |
pythondev | help | Okay, i think i understand the simple solution pretty well conceptually | 2019-04-02T01:50:02.106700 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:50:02.106700 | 1,554,169,802.1067 | 16,444 |
pythondev | help | But i wouldn't know how to conceptualize how to solve a the problem to get the scrambled version | 2019-04-02T01:50:25.107200 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:50:25.107200 | 1,554,169,825.1072 | 16,445 |
pythondev | help | That would be significantly harder, right? | 2019-04-02T01:50:34.107400 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:50:34.107400 | 1,554,169,834.1074 | 16,446 |
pythondev | help | Not necessarily. Step 1 would be to figure out how many rounds your team is supposed to win. Then you can fill out his nearby bracket with any random choice of 2^m - 1 out of the weaker teams. And then fill the rest of the brackets randomly from whoever is left, stronger or weaker. | 2019-04-02T01:52:26.108800 | Sasha | pythondev_help_Sasha_2019-04-02T01:52:26.108800 | 1,554,169,946.1088 | 16,447 |
pythondev | help | I think i'm almost there. I'm just struggling conceptualizing it because it scales so hard | 2019-04-02T01:54:21.109800 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:54:21.109800 | 1,554,170,061.1098 | 16,448 |
pythondev | help | if there's 100 rounds and we're supposed to win 40 | 2019-04-02T01:54:39.110100 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:54:39.110100 | 1,554,170,079.1101 | 16,449 |
pythondev | help | Then that would be err a lot of local brackets to fill out | 2019-04-02T01:55:08.110500 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:55:08.110500 | 1,554,170,108.1105 | 16,450 |
pythondev | help | Maybe there's a simple way to account for that that i'm not thinking of | 2019-04-02T01:55:15.110800 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:55:15.110800 | 1,554,170,115.1108 | 16,451 |
pythondev | help | Well, there's no way around that if you have 100 rounds... that's 2^100, or about 10^30, a really astronomical-sized tournament. | 2019-04-02T01:56:21.111800 | Sasha | pythondev_help_Sasha_2019-04-02T01:56:21.111800 | 1,554,170,181.1118 | 16,452 |
pythondev | help | lol somehow a tournament with more team's that humans on the planet | 2019-04-02T01:57:25.112200 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:57:25.112200 | 1,554,170,245.1122 | 16,453 |
pythondev | help | Maybe it's a universal tournament | 2019-04-02T01:57:31.112400 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:57:31.112400 | 1,554,170,251.1124 | 16,454 |
pythondev | help | Okay so maybe not 100 but say there's 10 | 2019-04-02T01:57:38.112700 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:57:38.112700 | 1,554,170,258.1127 | 16,455 |
pythondev | help | and we're supposed to win 8 | 2019-04-02T01:57:42.113000 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:57:42.113000 | 1,554,170,262.113 | 16,456 |
pythondev | help | "Pick the best atom on the planet!" | 2019-04-02T01:57:51.113200 | Sasha | pythondev_help_Sasha_2019-04-02T01:57:51.113200 | 1,554,170,271.1132 | 16,457 |
pythondev | help | lol | 2019-04-02T01:57:58.113400 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:57:58.113400 | 1,554,170,278.1134 | 16,458 |
pythondev | help | That's 64 "local" Teams to assign | 2019-04-02T01:58:09.113800 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:58:09.113800 | 1,554,170,289.1138 | 16,459 |
pythondev | help | as opposed to another example when there's only 2 if we're only winning one game | 2019-04-02T01:58:23.114200 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:58:23.114200 | 1,554,170,303.1142 | 16,460 |
pythondev | help | How do i account for that level of variance. The more i think about it the more i think there's probably a pretty easy way to write it. | 2019-04-02T01:58:48.115000 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:58:48.115000 | 1,554,170,328.115 | 16,461 |
pythondev | help | Yep. The more rounds you want to "fix", the more control you have to have over the brackets. But the problem as stated has you printing out all the brackets anyway, so it's the same amount of work either way, more or less. | 2019-04-02T01:59:27.115800 | Sasha | pythondev_help_Sasha_2019-04-02T01:59:27.115800 | 1,554,170,367.1158 | 16,462 |
pythondev | help | So when i know how many rounds our team should be winning just need put that many teams in the first x spaces and then randomize it? I suppose | 2019-04-02T02:00:36.116500 | Demetrice | pythondev_help_Demetrice_2019-04-02T02:00:36.116500 | 1,554,170,436.1165 | 16,463 |
pythondev | help | So if we're winning 3 rounds i'm only concerning myself with the first 8 entries and so on and so forth | 2019-04-02T02:00:54.116900 | Demetrice | pythondev_help_Demetrice_2019-04-02T02:00:54.116900 | 1,554,170,454.1169 | 16,464 |
pythondev | help | There's a lot of this that i can't write but i think i understand it for the most part now | 2019-04-02T02:01:04.117200 | Demetrice | pythondev_help_Demetrice_2019-04-02T02:01:04.117200 | 1,554,170,464.1172 | 16,465 |
pythondev | help | Yep | 2019-04-02T02:01:22.117400 | Sasha | pythondev_help_Sasha_2019-04-02T02:01:22.117400 | 1,554,170,482.1174 | 16,466 |
pythondev | help | :taco: <@Sasha> Make that a mega Taco | 2019-04-02T02:02:02.118400 | Demetrice | pythondev_help_Demetrice_2019-04-02T02:02:02.118400 | 1,554,170,522.1184 | 16,467 |
pythondev | help | And if there are, say, 12 lower-ranked teams, you can pick any 7 of them. | 2019-04-02T02:02:04.118600 | Sasha | pythondev_help_Sasha_2019-04-02T02:02:04.118600 | 1,554,170,524.1186 | 16,468 |
pythondev | help | I don't know why you never sleep, but i'm not complaining about it | 2019-04-02T02:02:16.119000 | Demetrice | pythondev_help_Demetrice_2019-04-02T02:02:16.119000 | 1,554,170,536.119 | 16,469 |
pythondev | help | Heh, I do, but I'm a couple of time-zones westward, so it's not as late here. | 2019-04-02T02:02:56.119600 | Sasha | pythondev_help_Sasha_2019-04-02T02:02:56.119600 | 1,554,170,576.1196 | 16,470 |
pythondev | help | You know i think i'm going to try to write it. I'm curious | 2019-04-02T02:30:14.120200 | Demetrice | pythondev_help_Demetrice_2019-04-02T02:30:14.120200 | 1,554,172,214.1202 | 16,471 |
pythondev | help | At least the simple version anyway | 2019-04-02T02:30:17.120400 | Demetrice | pythondev_help_Demetrice_2019-04-02T02:30:17.120400 | 1,554,172,217.1204 | 16,472 |
pythondev | help | So how does this look so far | 2019-04-02T03:08:07.120800 | Demetrice | pythondev_help_Demetrice_2019-04-02T03:08:07.120800 | 1,554,174,487.1208 | 16,473 |
pythondev | help | None | 2019-04-02T03:08:15.121000 | Demetrice | pythondev_help_Demetrice_2019-04-02T03:08:15.121000 | 1,554,174,495.121 | 16,474 |
pythondev | help | <@Sasha> I'm not sure if you're still around. But i think i just need help on the last step | 2019-04-02T03:22:07.122300 | Demetrice | pythondev_help_Demetrice_2019-04-02T03:22:07.122300 | 1,554,175,327.1223 | 16,475 |
pythondev | help | Cool, I like the remove-and-append, very elegant. For the last step you just need to print them out in pairs. One easy way to do that would be to use `range()` with a step size of 2. | 2019-04-02T03:30:09.123400 | Sasha | pythondev_help_Sasha_2019-04-02T03:30:09.123400 | 1,554,175,809.1234 | 16,476 |
pythondev | help | Trying to figure out how to print it in pairs has me stumped | 2019-04-02T03:31:48.123800 | Demetrice | pythondev_help_Demetrice_2019-04-02T03:31:48.123800 | 1,554,175,908.1238 | 16,477 |
pythondev | help | Wait | 2019-04-02T03:31:57.124000 | Demetrice | pythondev_help_Demetrice_2019-04-02T03:31:57.124000 | 1,554,175,917.124 | 16,478 |
pythondev | help | It's a for statement and i'm leveraging the range function taking 3 parameters. But i can't put it all together in my head | 2019-04-02T03:32:59.125100 | Demetrice | pythondev_help_Demetrice_2019-04-02T03:32:59.125100 | 1,554,175,979.1251 | 16,479 |
pythondev | help | I'll give you a hint. You want to print out Teams[0]-Teams[1], then Teams[2]-Teams[3], etc. So if the range is giving you 0, 2, 4, etc... | 2019-04-02T03:34:27.125900 | Sasha | pythondev_help_Sasha_2019-04-02T03:34:27.125900 | 1,554,176,067.1259 | 16,480 |
pythondev | help | <@Demetrice> this should help you out, in a loop mention the start and end bound and you should have multiple lists that can be `join()`ed with a `-`
<https://stackoverflow.com/questions/6632188/explicitly-select-items-from-a-python-list-or-tuple> | 2019-04-02T03:35:09.126900 | Maegan | pythondev_help_Maegan_2019-04-02T03:35:09.126900 | 1,554,176,109.1269 | 16,481 |
pythondev | help | I tried This. Which was wrong. I'm sure this is simple but it's 2:30 am. Just give me a sec | 2019-04-02T03:35:35.127100 | Demetrice | pythondev_help_Demetrice_2019-04-02T03:35:35.127100 | 1,554,176,135.1271 | 16,482 |
pythondev | help | seems it is your homework? | 2019-04-02T03:35:53.127500 | Maegan | pythondev_help_Maegan_2019-04-02T03:35:53.127500 | 1,554,176,153.1275 | 16,483 |
pythondev | help | No it's not homework. I was initially just doing research for a friend. But now i just want to complete it for pride | 2019-04-02T03:36:25.128100 | Demetrice | pythondev_help_Demetrice_2019-04-02T03:36:25.128100 | 1,554,176,185.1281 | 16,484 |
pythondev | help | My brain hurts. This shouldn't be so difficult | 2019-04-02T03:47:17.129200 | Demetrice | pythondev_help_Demetrice_2019-04-02T03:47:17.129200 | 1,554,176,837.1292 | 16,485 |
pythondev | help | Given that `l = [%your_list_from_#random_channel%]` this would print elements in pairs:
```
for elem in range(1, len(l), 2):
print(f'{elem}-{l[l.index(elem) + 1]}')
```
Note that you need to sort the list first, otherwise you'll have `7-9` and then `9-10` | 2019-04-02T03:49:31.130500 | Russ | pythondev_help_Russ_2019-04-02T03:49:31.130500 | 1,554,176,971.1305 | 16,486 |
pythondev | help | But I feel that's some kind of hack and it will break easily... | 2019-04-02T03:52:14.131000 | Russ | pythondev_help_Russ_2019-04-02T03:52:14.131000 | 1,554,177,134.131 | 16,487 |
pythondev | help | Yeah, there's some back-story to the list indicating why you don't want to sort it. | 2019-04-02T03:52:52.131400 | Sasha | pythondev_help_Sasha_2019-04-02T03:52:52.131400 | 1,554,177,172.1314 | 16,488 |
pythondev | help | I don't know if i'm missing something obvious or if this is legitimately hard. But it i just applied and if statement and used the range properly this would be done | 2019-04-02T03:53:43.132200 | Demetrice | pythondev_help_Demetrice_2019-04-02T03:53:43.132200 | 1,554,177,223.1322 | 16,489 |
pythondev | help | Here's another hint... if you wanted to print out "10-11, 20-21, 30-31" and I gave you 10, 20, 30 from the range() function, how would you attack that? | 2019-04-02T03:55:11.133800 | Sasha | pythondev_help_Sasha_2019-04-02T03:55:11.133800 | 1,554,177,311.1338 | 16,490 |
pythondev | help | How about this?
```
for idx, elem in enumerate(l):
if idx % 2 == 0:
print(f'{elem}-{l[idx+1]}')
``` | 2019-04-02T03:56:50.135000 | Russ | pythondev_help_Russ_2019-04-02T03:56:50.135000 | 1,554,177,410.135 | 16,491 |
pythondev | help | That would work, <@Russ> | 2019-04-02T04:00:28.135400 | Sasha | pythondev_help_Sasha_2019-04-02T04:00:28.135400 | 1,554,177,628.1354 | 16,492 |
pythondev | help | for i in range (1,NumTeams,2):
print (i, i+1) | 2019-04-02T04:04:06.135600 | Demetrice | pythondev_help_Demetrice_2019-04-02T04:04:06.135600 | 1,554,177,846.1356 | 16,493 |
pythondev | help | I think i'm getting further away from a right answer | 2019-04-02T04:04:17.135900 | Demetrice | pythondev_help_Demetrice_2019-04-02T04:04:17.135900 | 1,554,177,857.1359 | 16,494 |
pythondev | help | Nope, you're super close. Now how do you get from `i` to the `i`th team in your list? | 2019-04-02T04:05:40.136500 | Sasha | pythondev_help_Sasha_2019-04-02T04:05:40.136500 | 1,554,177,940.1365 | 16,495 |
pythondev | help | I tried replacing the , with : and - neither worked | 2019-04-02T04:11:31.137000 | Demetrice | pythondev_help_Demetrice_2019-04-02T04:11:31.137000 | 1,554,178,291.137 | 16,496 |
pythondev | help | I should probably just sleep on it | 2019-04-02T04:11:36.137200 | Demetrice | pythondev_help_Demetrice_2019-04-02T04:11:36.137200 | 1,554,178,296.1372 | 16,497 |
pythondev | help | Probably wise. I expect it'll just make complete sense with a fresh look tomorrow. | 2019-04-02T04:12:49.137700 | Sasha | pythondev_help_Sasha_2019-04-02T04:12:49.137700 | 1,554,178,369.1377 | 16,498 |
pythondev | help | I am not sure if this belongs here, if somebody wants to get started with hacking/reverse-engineering in python what book/reading would you would you suggest? I heard about black hat (<https://www.amazon.com/Black-Hat-Python-Programming-Pentesters-ebook/dp/B00QL616DW>) or gray hat python (<https://www.amazon.it/Gray-Hat-Python-Programming-Engineers/dp/1593271921>), or if you have any _must read_ suggestions! I am reasonably proficient in python and I have a lot of time at hand so shoot! | 2019-04-02T05:26:22.139700 | Berenice | pythondev_help_Berenice_2019-04-02T05:26:22.139700 | 1,554,182,782.1397 | 16,499 |
pythondev | help | May want to try <#C6VNXKWBG|security> as well | 2019-04-02T05:28:17.140600 | Karoline | pythondev_help_Karoline_2019-04-02T05:28:17.140600 | 1,554,182,897.1406 | 16,500 |
pythondev | help | Thanks, i did not know about the channel. | 2019-04-02T05:30:33.140700 | Berenice | pythondev_help_Berenice_2019-04-02T05:30:33.140700 | 1,554,183,033.1407 | 16,501 |
pythondev | help | which is best way to execute two bash files that are runing on same time and access same database? | 2019-04-02T05:33:30.141800 | Lourie | pythondev_help_Lourie_2019-04-02T05:33:30.141800 | 1,554,183,210.1418 | 16,502 |
pythondev | help | today i only get "Deadlock found when trying to get lock; try restarting transaction" and this "Lock wait timeout exceeded; try restarting transaction" | 2019-04-02T05:33:49.142200 | Lourie | pythondev_help_Lourie_2019-04-02T05:33:49.142200 | 1,554,183,229.1422 | 16,503 |
pythondev | help | errors :confused: | 2019-04-02T05:33:52.142400 | Lourie | pythondev_help_Lourie_2019-04-02T05:33:52.142400 | 1,554,183,232.1424 | 16,504 |
pythondev | help | Can someone help me to understand what this function does? I can’t understand how this creates a list of numbers.
I don’t unserstand even how the “if” works in this case | 2019-04-02T05:48:50.142800 | Antoine | pythondev_help_Antoine_2019-04-02T05:48:50.142800 | 1,554,184,130.1428 | 16,505 |
pythondev | help | `ForeignKey(unique=True) is usually better served by a OneToOneField.` what's the difference? why is it complaining? | 2019-04-02T06:13:17.143800 | Florencio | pythondev_help_Florencio_2019-04-02T06:13:17.143800 | 1,554,185,597.1438 | 16,506 |
pythondev | help | hello, anyone may help me with a problem in installing pymesh | 2019-04-02T07:10:21.145500 | Tanja | pythondev_help_Tanja_2019-04-02T07:10:21.145500 | 1,554,189,021.1455 | 16,507 |
pythondev | help | <@Antoine> This part -- `([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0))` -- is called a generator expression. It creates a generator that will yield (in this case) a list object containing discovered factors of the value you pass to the function (stored in `n`). The specific part you mention -- `if n % i == 0` is performing a modulo operation on the number you passed in and the integer currently being tested. Modulo tests whether the right argument divides into the left argument evenly or not. | 2019-04-02T07:17:37.150100 | Chuck | pythondev_help_Chuck_2019-04-02T07:17:37.150100 | 1,554,189,457.1501 | 16,508 |
pythondev | help | <@Florencio> FYI, lots of your questions would be more relevant in <#C0LMFRMB5|django> | 2019-04-02T07:18:23.150500 | Hiroko | pythondev_help_Hiroko_2019-04-02T07:18:23.150500 | 1,554,189,503.1505 | 16,509 |
pythondev | help | I and others here can recognize what you’re asking because we know it. but I imaginemany others are having WTH moments trying to figure what you’re asking | 2019-04-02T07:18:57.151300 | Hiroko | pythondev_help_Hiroko_2019-04-02T07:18:57.151300 | 1,554,189,537.1513 | 16,510 |
pythondev | help | especially without any kind of context | 2019-04-02T07:19:16.151700 | Hiroko | pythondev_help_Hiroko_2019-04-02T07:19:16.151700 | 1,554,189,556.1517 | 16,511 |
pythondev | help | would be a very different story if you prefaced it with “in django, ….” | 2019-04-02T07:19:44.152200 | Hiroko | pythondev_help_Hiroko_2019-04-02T07:19:44.152200 | 1,554,189,584.1522 | 16,512 |
pythondev | help | we’re not mindreaders, unfortunately | 2019-04-02T07:20:23.153000 | Hiroko | pythondev_help_Hiroko_2019-04-02T07:20:23.153000 | 1,554,189,623.153 | 16,513 |
pythondev | help | Can anybody help me with running a celery task manually from the command line? | 2019-04-02T07:30:42.153700 | Valeri | pythondev_help_Valeri_2019-04-02T07:30:42.153700 | 1,554,190,242.1537 | 16,514 |
pythondev | help | I've looked it up on the internet. Still clueless :confused: | 2019-04-02T07:31:07.154200 | Valeri | pythondev_help_Valeri_2019-04-02T07:31:07.154200 | 1,554,190,267.1542 | 16,515 |
pythondev | help | with django? | 2019-04-02T07:32:22.154400 | Hiroko | pythondev_help_Hiroko_2019-04-02T07:32:22.154400 | 1,554,190,342.1544 | 16,516 |
pythondev | help | you can do it with a command | 2019-04-02T07:32:28.154700 | Hiroko | pythondev_help_Hiroko_2019-04-02T07:32:28.154700 | 1,554,190,348.1547 | 16,517 |
pythondev | help | but otherwise, why not replicate how your task executes? | 2019-04-02T07:32:44.155400 | Hiroko | pythondev_help_Hiroko_2019-04-02T07:32:44.155400 | 1,554,190,364.1554 | 16,518 |
pythondev | help | eg ```from module.tasks import Task
task.apply_async(...)``` | 2019-04-02T07:33:02.156100 | Hiroko | pythondev_help_Hiroko_2019-04-02T07:33:02.156100 | 1,554,190,382.1561 | 16,519 |
pythondev | help | I don't have a module.tasks file | 2019-04-02T07:33:21.156500 | Valeri | pythondev_help_Valeri_2019-04-02T07:33:21.156500 | 1,554,190,401.1565 | 16,520 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.