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 | ahhh, thank you <@Carlo> | 2019-04-01T15:49:52.017400 | Virgie | pythondev_help_Virgie_2019-04-01T15:49:52.017400 | 1,554,133,792.0174 | 16,321 |
pythondev | help | I have some json-formatted data within a non-json file (there are other ascii content within). I’m trying to parse out the json content with python’s regular expressions.
essentially, we have nested data, and I’m trying to simply matches braces over multiple lines. | 2019-04-01T15:51:18.018900 | Virgie | pythondev_help_Virgie_2019-04-01T15:51:18.018900 | 1,554,133,878.0189 | 16,322 |
pythondev | help | for instance: | 2019-04-01T15:51:24.019100 | Virgie | pythondev_help_Virgie_2019-04-01T15:51:24.019100 | 1,554,133,884.0191 | 16,323 |
pythondev | help | `{
‘data’: [
‘example’,
‘example’
]
}` | 2019-04-01T15:52:25.020100 | Virgie | pythondev_help_Virgie_2019-04-01T15:52:25.020100 | 1,554,133,945.0201 | 16,324 |
pythondev | help | why do you have a mixed-format file? | 2019-04-01T15:52:55.020900 | Hiroko | pythondev_help_Hiroko_2019-04-01T15:52:55.020900 | 1,554,133,975.0209 | 16,325 |
pythondev | help | it’s a malware config file | 2019-04-01T15:53:05.021300 | Virgie | pythondev_help_Virgie_2019-04-01T15:53:05.021300 | 1,554,133,985.0213 | 16,326 |
pythondev | help | I’ve used the `re.S` flag to match the newline character, but it still doesn’t seem to work | 2019-04-01T15:53:59.022200 | Virgie | pythondev_help_Virgie_2019-04-01T15:53:59.022200 | 1,554,134,039.0222 | 16,327 |
pythondev | help | <@Sasha> no, and i did get it figured out. by your response, it confirmed my resolution. because i have no __init__, im having to declare (at least for the moment) my class. | 2019-04-01T15:56:08.024000 | Nenita | pythondev_help_Nenita_2019-04-01T15:56:08.024000 | 1,554,134,168.024 | 16,328 |
pythondev | help | HELLO!>?!?>!?! | 2019-04-01T15:56:26.024500 | Claudine | pythondev_help_Claudine_2019-04-01T15:56:26.024500 | 1,554,134,186.0245 | 16,329 |
pythondev | help | there are only two braces in the file, but `re.search('\{.*\}', file, re.S).group(0)` doesn’t seem to work. | 2019-04-01T15:56:30.024700 | Virgie | pythondev_help_Virgie_2019-04-01T15:56:30.024700 | 1,554,134,190.0247 | 16,330 |
pythondev | help | <@Claudine> :wave: | 2019-04-01T15:56:53.025100 | Nenita | pythondev_help_Nenita_2019-04-01T15:56:53.025100 | 1,554,134,213.0251 | 16,331 |
pythondev | help | does `re.MULTILINE` do anything for you instead of `re.S`? | 2019-04-01T15:57:27.025600 | Claudine | pythondev_help_Claudine_2019-04-01T15:57:27.025600 | 1,554,134,247.0256 | 16,332 |
pythondev | help | unfortunately not. I tried that, and both ( `re.M | re.S` ), and neither worked | 2019-04-01T15:58:06.026200 | Virgie | pythondev_help_Virgie_2019-04-01T15:58:06.026200 | 1,554,134,286.0262 | 16,333 |
pythondev | help | `\{.*|\n\}` that do anything for ya? | 2019-04-01T15:58:55.026400 | Claudine | pythondev_help_Claudine_2019-04-01T15:58:55.026400 | 1,554,134,335.0264 | 16,334 |
pythondev | help | negative =/ | 2019-04-01T16:01:03.026600 | Virgie | pythondev_help_Virgie_2019-04-01T16:01:03.026600 | 1,554,134,463.0266 | 16,335 |
pythondev | help | Do you need a raw string for the backslashes? | 2019-04-01T16:02:12.027000 | Sasha | pythondev_help_Sasha_2019-04-01T16:02:12.027000 | 1,554,134,532.027 | 16,336 |
pythondev | help | how about this bad larry? `{[^}]*` | 2019-04-01T16:03:25.027300 | Claudine | pythondev_help_Claudine_2019-04-01T16:03:25.027300 | 1,554,134,605.0273 | 16,337 |
pythondev | help | that should match an opening brace, and then everything else that is not a closing brace | 2019-04-01T16:03:56.027700 | Claudine | pythondev_help_Claudine_2019-04-01T16:03:56.027700 | 1,554,134,636.0277 | 16,338 |
pythondev | help | if there is a stray closing brace in your file it will jack up the regex | 2019-04-01T16:04:06.028000 | Claudine | pythondev_help_Claudine_2019-04-01T16:04:06.028000 | 1,554,134,646.028 | 16,339 |
pythondev | help | you can pop an extra `}` on the end if you want to capture the braces | 2019-04-01T16:04:57.028400 | Claudine | pythondev_help_Claudine_2019-04-01T16:04:57.028400 | 1,554,134,697.0284 | 16,340 |
pythondev | help | *hungrily awaits taco* | 2019-04-01T16:05:46.028700 | Claudine | pythondev_help_Claudine_2019-04-01T16:05:46.028700 | 1,554,134,746.0287 | 16,341 |
pythondev | help | here you are, sir | 2019-04-01T16:06:14.029000 | Virgie | pythondev_help_Virgie_2019-04-01T16:06:14.029000 | 1,554,134,774.029 | 16,342 |
pythondev | help | that worked! :raised_hands: | 2019-04-01T16:06:44.029600 | Virgie | pythondev_help_Virgie_2019-04-01T16:06:44.029600 | 1,554,134,804.0296 | 16,343 |
pythondev | help | dope | 2019-04-01T16:06:47.029800 | Claudine | pythondev_help_Claudine_2019-04-01T16:06:47.029800 | 1,554,134,807.0298 | 16,344 |
pythondev | help | actually if you wanna type `@kraete :taco:` for me that'd be squanchy | 2019-04-01T16:07:05.030400 | Claudine | pythondev_help_Claudine_2019-04-01T16:07:05.030400 | 1,554,134,825.0304 | 16,345 |
pythondev | help | `squanchy` | 2019-04-01T16:07:20.031100 | Hiroko | pythondev_help_Hiroko_2019-04-01T16:07:20.031100 | 1,554,134,840.0311 | 16,346 |
pythondev | help | it'll give me a taco credit, there's a taco bot | 2019-04-01T16:07:27.031500 | Claudine | pythondev_help_Claudine_2019-04-01T16:07:27.031500 | 1,554,134,847.0315 | 16,347 |
pythondev | help | `re.search('{[^}]*', file, re.M).group(0)` was the query, for anyone else wondering | 2019-04-01T16:07:37.031800 | Virgie | pythondev_help_Virgie_2019-04-01T16:07:37.031800 | 1,554,134,857.0318 | 16,348 |
pythondev | help | <@Claudine> :taco: | 2019-04-01T16:07:59.032200 | Virgie | pythondev_help_Virgie_2019-04-01T16:07:59.032200 | 1,554,134,879.0322 | 16,349 |
pythondev | help | perfect thanks | 2019-04-01T16:08:10.032600 | Claudine | pythondev_help_Claudine_2019-04-01T16:08:10.032600 | 1,554,134,890.0326 | 16,350 |
pythondev | help | I’ll squanch a taco at yu any time. much appreciated! | 2019-04-01T16:08:18.032900 | Virgie | pythondev_help_Virgie_2019-04-01T16:08:18.032900 | 1,554,134,898.0329 | 16,351 |
pythondev | help | i'll squanch your regexes anytime, you're quite welcome | 2019-04-01T16:08:32.033200 | Claudine | pythondev_help_Claudine_2019-04-01T16:08:32.033200 | 1,554,134,912.0332 | 16,352 |
pythondev | help | actually, if you don’t quite mind helping me understand that regex you gave me… | 2019-04-01T16:09:02.033600 | Virgie | pythondev_help_Virgie_2019-04-01T16:09:02.033600 | 1,554,134,942.0336 | 16,353 |
pythondev | help | sure | 2019-04-01T16:09:36.033800 | Claudine | pythondev_help_Claudine_2019-04-01T16:09:36.033800 | 1,554,134,976.0338 | 16,354 |
pythondev | help | `{[^}]*`
the first character is `{`, so that will match your opening curly brace
this is followed by a character group `[]`, but those `[` `]` have things inside them
the things inside are `^}`, inside a character group `^` is a negation and `}` is the character being negating, so this character group matches any character that is not a `}` (including newlines)
and then we have `*` at the end, which means match as many of the previous negation as possible | 2019-04-01T16:11:32.036100 | Claudine | pythondev_help_Claudine_2019-04-01T16:11:32.036100 | 1,554,135,092.0361 | 16,355 |
pythondev | help | then eventually we hit your closing `}` which terminations the previous matchy bit there | 2019-04-01T16:11:52.036600 | Claudine | pythondev_help_Claudine_2019-04-01T16:11:52.036600 | 1,554,135,112.0366 | 16,356 |
pythondev | help | so like `[a]` will match one lower case `a` [^a]` will match anything that isn't a lowercase `a` | 2019-04-01T16:12:35.037500 | Claudine | pythondev_help_Claudine_2019-04-01T16:12:35.037500 | 1,554,135,155.0375 | 16,357 |
pythondev | help | ahhh, okay. dsylexia makes regex a headache to read correctly :facepalm: | 2019-04-01T16:12:43.037900 | Virgie | pythondev_help_Virgie_2019-04-01T16:12:43.037900 | 1,554,135,163.0379 | 16,358 |
pythondev | help | if you wanted to match anything that is not a digit you could do `[^0-9]` | 2019-04-01T16:12:52.038200 | Claudine | pythondev_help_Claudine_2019-04-01T16:12:52.038200 | 1,554,135,172.0382 | 16,359 |
pythondev | help | haha yea i could see that making it much harder than it already is | 2019-04-01T16:13:13.038900 | Claudine | pythondev_help_Claudine_2019-04-01T16:13:13.038900 | 1,554,135,193.0389 | 16,360 |
pythondev | help | I was reading the braces and brackets as their actual regex interpretations for grouping, instead of their literals | 2019-04-01T16:13:16.039100 | Virgie | pythondev_help_Virgie_2019-04-01T16:13:16.039100 | 1,554,135,196.0391 | 16,361 |
pythondev | help | ahh yea that can get dicey | 2019-04-01T16:13:38.039400 | Claudine | pythondev_help_Claudine_2019-04-01T16:13:38.039400 | 1,554,135,218.0394 | 16,362 |
pythondev | help | oh well. that’s cleared up, so another is in order | 2019-04-01T16:14:03.039900 | Virgie | pythondev_help_Virgie_2019-04-01T16:14:03.039900 | 1,554,135,243.0399 | 16,363 |
pythondev | help | <@Claudine> :taco: | 2019-04-01T16:14:12.040200 | Virgie | pythondev_help_Virgie_2019-04-01T16:14:12.040200 | 1,554,135,252.0402 | 16,364 |
pythondev | help | thanks again! very clever regex :wink: | 2019-04-01T16:15:42.040600 | Virgie | pythondev_help_Virgie_2019-04-01T16:15:42.040600 | 1,554,135,342.0406 | 16,365 |
pythondev | help | no problem! the only thing i'd be worried about is if the contents of your file happens to have another `}` somewhere in it because it'd cut the match of there | 2019-04-01T16:16:34.041400 | Claudine | pythondev_help_Claudine_2019-04-01T16:16:34.041400 | 1,554,135,394.0414 | 16,366 |
pythondev | help | it’s unlikely, but certainly possible. it’ll be noticeable if it does, and I’ll address it then. | 2019-04-01T16:17:45.042000 | Virgie | pythondev_help_Virgie_2019-04-01T16:17:45.042000 | 1,554,135,465.042 | 16,367 |
pythondev | help | Hey all, I'm having issues with handling csv files. the problem is that the delimiter and the lineterminator uses the same character(';'). I'm using the lineterminator argument from pandas.to_csv to append the rows with a ';'. This is done so that the column count of two files are equal(one was missing ; at the end and therefore didn't count as column) | 2019-04-01T17:19:12.045300 | Kathline | pythondev_help_Kathline_2019-04-01T17:19:12.045300 | 1,554,139,152.0453 | 16,368 |
pythondev | help | Do you know ahead of time the number of columns? | 2019-04-01T17:20:07.046700 | Bethany | pythondev_help_Bethany_2019-04-01T17:20:07.046700 | 1,554,139,207.0467 | 16,369 |
pythondev | help | yes | 2019-04-01T17:20:12.047000 | Kathline | pythondev_help_Kathline_2019-04-01T17:20:12.047000 | 1,554,139,212.047 | 16,370 |
pythondev | help | You could split on `;` and reshape the resulting list since you know what the shape should be | 2019-04-01T17:21:37.048200 | Bethany | pythondev_help_Bethany_2019-04-01T17:21:37.048200 | 1,554,139,297.0482 | 16,371 |
pythondev | help | But there's no line ending character `\n`? | 2019-04-01T17:22:17.049100 | Bethany | pythondev_help_Bethany_2019-04-01T17:22:17.049100 | 1,554,139,337.0491 | 16,372 |
pythondev | help | alright, thanks I will look into that. there isn't a line ending character as it's a excel file converted into a csv using pandas(it looked easier to use and flexible) | 2019-04-01T17:24:44.051500 | Kathline | pythondev_help_Kathline_2019-04-01T17:24:44.051500 | 1,554,139,484.0515 | 16,373 |
pythondev | help | In the original `to_csv()`, can you use `";\n"` as the line terminator? | 2019-04-01T17:25:31.052400 | Sasha | pythondev_help_Sasha_2019-04-01T17:25:31.052400 | 1,554,139,531.0524 | 16,374 |
pythondev | help | <@Sasha>, <@Bethany>. ':\n' worked, didn't know you could use regex as line terminator. Thank you :smile: | 2019-04-01T17:29:45.053700 | Kathline | pythondev_help_Kathline_2019-04-01T17:29:45.053700 | 1,554,139,785.0537 | 16,375 |
pythondev | help | It's not a regex, just a multi-character string. | 2019-04-01T17:30:11.054000 | Sasha | pythondev_help_Sasha_2019-04-01T17:30:11.054000 | 1,554,139,811.054 | 16,376 |
pythondev | help | HELLO!?!?!? | 2019-04-01T17:32:10.054400 | Claudine | pythondev_help_Claudine_2019-04-01T17:32:10.054400 | 1,554,139,930.0544 | 16,377 |
pythondev | help | Hello | 2019-04-01T17:32:18.054800 | Genesis | pythondev_help_Genesis_2019-04-01T17:32:18.054800 | 1,554,139,938.0548 | 16,378 |
pythondev | help | False alarm, sorry <@Claudine> | 2019-04-01T17:32:42.055400 | Sasha | pythondev_help_Sasha_2019-04-01T17:32:42.055400 | 1,554,139,962.0554 | 16,379 |
pythondev | help | Haha no worries | 2019-04-01T17:41:37.055900 | Claudine | pythondev_help_Claudine_2019-04-01T17:41:37.055900 | 1,554,140,497.0559 | 16,380 |
pythondev | help | :joy: The amount I laughed at that says a lot about me | 2019-04-01T20:09:20.058300 | Clemmie | pythondev_help_Clemmie_2019-04-01T20:09:20.058300 | 1,554,149,360.0583 | 16,381 |
pythondev | help | note - excel new lines are either `\r\n` or `\n\r` i cant remember which order - but those 2 together make a hard csv new line row
in weird cases i have also seen `\m` which is damn near invisible unless you view it on terminal lol and has been known to throw wrenches on occasion :face_with_rolling_eyes: | 2019-04-01T20:10:50.058800 | Sparkle | pythondev_help_Sparkle_2019-04-01T20:10:50.058800 | 1,554,149,450.0588 | 16,382 |
pythondev | help | Hello. I have a list that contains data like this:
```
[{'broker': 0, 'leader': True, 'in_sync': True}, {'broker': 1, 'leader': False, 'in_sync': True}]
[{'broker': 1, 'leader': True, 'in_sync': True}, {'broker': 2, 'leader': False, 'in_sync': True}]
[{'broker': 2, 'leader': True, 'in_sync': True}, {'broker': 0, 'leader': False, 'in_sync': True}]
```
That data above is generated by this: `broker = [ x[i]['broker'] for x in lc_replicas ]`
My output code is like so:
```
lc_partitions = [ p['partition'] for p in output['partitions'] ]
lc_leader = [ l['leader'] for l in output['partitions'] ]
lc_replicas = [ r['replicas'] for r in output['partitions'] ]
for i in range(slice):
print(i)
broker = [ x[i]['broker'] for x in lc_replicas ]
leader = [ x[i]['leader'] for x in lc_replicas ]
in_sync = [ x[i]['in_sync'] for x in lc_replicas ]
for lc_p,lc_l,b,l,i in zip(lc_partitions, lc_leader, broker, leader, in_sync):
print('Partitions: Partition - {0} Leader - {1} Replicas: Broker - {2} Leader - {3} In_Sync - {4}'.format(lc_p, lc_l, b, l, i))
```
The issue is that it prints the formatted data for each loop, when I only want to print part of the output once, and concatenate/zip/? the replica data (which requires the looping, at least how I'm doing it currently) to each Partitions line. So it currently does this:
```
0 #loop count
Partitions: Partition - 0 Leader - 0 Replicas: Broker - 0 Leader - True In_Sync - True
Partitions: Partition - 1 Leader - 1 Replicas: Broker - 1 Leader - True In_Sync - True
Partitions: Partition - 2 Leader - 2 Replicas: Broker - 2 Leader - True In_Sync - True
```
```
1 #loop
Partitions: Partition - 0 Leader - 0 Replicas: Broker - 1 Leader - False In_Sync - True
Partitions: Partition - 1 Leader - 1 Replicas: Broker - 2 Leader - False In_Sync - True
Partitions: Partition - 2 Leader - 2 Replicas: Broker - 0 Leader - False In_Sync - True
```
I want the lines to look like this:
`Partitions: Partition - 0 Leader - 0 Replicas: Broker - 0 Leader - True In_Sync - True, Broker - 1 Leader - False In_Sync - True`
`Partitions: Partition - 1 Leader - 1 Replicas: Broker - 1 Leader - True In_Sync - True, Broker - 2 Leader - False In_Sync - True`
`Partitions: Partition - 2 Leader - 2 Replicas: Broker - 2 Leader - True In_Sync - True, Broker - 0 Leader - False In_Sync - True`
Hopefully this makes sense. | 2019-04-01T21:28:25.059500 | Stacy | pythondev_help_Stacy_2019-04-01T21:28:25.059500 | 1,554,154,105.0595 | 16,383 |
pythondev | help | It's not completely clear what you want. What data should be associated with partition 0? From the example, it looks like you just want the two broker entries in the first entry of the replicas list. So I'm not sure why you're trying to zip across records. | 2019-04-02T00:38:05.061400 | Sasha | pythondev_help_Sasha_2019-04-02T00:38:05.061400 | 1,554,165,485.0614 | 16,384 |
pythondev | help | <@Sasha> so the lines that i want it to look like combine sections of both loop 0 and loop1 because `lc_replicas` contains two dictionaries within one list, so I have to loop through those keys with these:
```
broker = [ x[i]['broker'] for x in lc_replicas ]
leader = [ x[i]['leader'] for x in lc_replicas ]
in_sync = [ x[i]['in_sync'] for x in lc_replicas ]
```
I'm doing this because I believe these show the results of partitions that have 2 replicas - it could be 1 to 3 so I'm trying to take that into account, in which case the line i want it to look like could potentially be `Partitions: Partition - 0 Leader - 0 Replicas: Broker - 0 Leader - True In_Sync - True, Broker - 1 Leader - False In_Sync - True, ****Broker - 2, Leader - False, In_Sync - True****` where the third loop adds the content contained within asterisks. Does that help? Without the loops the output would simply be `Partitions: Partition - 0 Leader - 0` which requires no loops, just a matter of zipping the results together so they match up. | 2019-04-02T00:47:10.065800 | Stacy | pythondev_help_Stacy_2019-04-02T00:47:10.065800 | 1,554,166,030.0658 | 16,385 |
pythondev | help | I basically want to concat the content from the loops of the dictionaries together so they're contained on the same line when I zip everything together. | 2019-04-02T00:48:13.066400 | Stacy | pythondev_help_Stacy_2019-04-02T00:48:13.066400 | 1,554,166,093.0664 | 16,386 |
pythondev | help | From your original list: | 2019-04-02T00:49:06.066800 | Sasha | pythondev_help_Sasha_2019-04-02T00:49:06.066800 | 1,554,166,146.0668 | 16,387 |
pythondev | help | i'm not sure if leveraging itertools / chain would help in this case. haven't used it before. | 2019-04-02T00:49:18.067300 | Stacy | pythondev_help_Stacy_2019-04-02T00:49:18.067300 | 1,554,166,158.0673 | 16,388 |
pythondev | help | so there's a total of 47 partitions total (contained within `lc_partitions = [ p['partition'] for p in output['partitions'] ]` - i only need to loop those once. the way the current code works is it adds the replicas details to the partitions in two separate loops because i'm looping broker/leader/in_sync list comprehensions twice in this example....it could potentially be 1-3. so in the snippets where it shows `#loop 0`, it goes from 0 to 47, with the first slice/element of dictionaries in the list :
```
broker = [ x[i]['broker'] for x in lc_replicas ]
leader = [ x[i]['leader'] for x in lc_replicas ]
in_sync = [ x[i]['in_sync'] for x in lc_replicas ]
```
loop 1 then goes through partitions 0-47 again, appending the second element of the list. i want both `x[0]['broker'],x[0]['leader'],x[0]['in_sync'] and x[1]['broker'],x[1]['leader'],x[1]['in_sync']` printed on the same line. | 2019-04-02T00:56:45.072700 | Stacy | pythondev_help_Stacy_2019-04-02T00:56:45.072700 | 1,554,166,605.0727 | 16,389 |
pythondev | help | Let me sketch out what I think you want, and you correct me... Give me a sec. | 2019-04-02T00:57:48.073500 | Sasha | pythondev_help_Sasha_2019-04-02T00:57:48.073500 | 1,554,166,668.0735 | 16,390 |
pythondev | help | i'm probably complicating by just doing snippets vs the whole thing, i can try to provide more if that would help | 2019-04-02T00:59:12.074700 | Stacy | pythondev_help_Stacy_2019-04-02T00:59:12.074700 | 1,554,166,752.0747 | 16,391 |
pythondev | help | I think you just want a nested loop like this, if I understand which data you want where. | 2019-04-02T01:01:44.074800 | Sasha | pythondev_help_Sasha_2019-04-02T01:01:44.074800 | 1,554,166,904.0748 | 16,392 |
pythondev | help | Doesn't do the commas correctly, but meh, you get the idea. | 2019-04-02T01:03:12.075600 | Sasha | pythondev_help_Sasha_2019-04-02T01:03:12.075600 | 1,554,166,992.0756 | 16,393 |
pythondev | help | Yes!!!!! | 2019-04-02T01:07:03.075900 | Stacy | pythondev_help_Stacy_2019-04-02T01:07:03.075900 | 1,554,167,223.0759 | 16,394 |
pythondev | help | Ok, so this strips out the need of me needing to my slice logic to take into account how many dictionaries there might be in the replicas because well....it's already provided. That's apparent now | 2019-04-02T01:08:39.076700 | Stacy | pythondev_help_Stacy_2019-04-02T01:08:39.076700 | 1,554,167,319.0767 | 16,395 |
pythondev | help | i knew at some point i'd have to end with a space in attempt to concat the two lines together also. i had this commented out from previous troubleshooting `#print(lc_p, lc_l, l, b, i, end=' ')` | 2019-04-02T01:09:49.077500 | Stacy | pythondev_help_Stacy_2019-04-02T01:09:49.077500 | 1,554,167,389.0775 | 16,396 |
pythondev | help | my confusion was how to iterate those dictionaries within the replicas list. | 2019-04-02T01:10:28.077800 | Stacy | pythondev_help_Stacy_2019-04-02T01:10:28.077800 | 1,554,167,428.0778 | 16,397 |
pythondev | help | this is great. thank you <@Sasha> at some point i'm going to have to buy you beers instead of tacos (if you're in to that.) :slightly_smiling_face: | 2019-04-02T01:11:05.078600 | Stacy | pythondev_help_Stacy_2019-04-02T01:11:05.078600 | 1,554,167,465.0786 | 16,398 |
pythondev | help | Heh, no problem. Happy to help, and glad it wasn't as complicated as it seemed. | 2019-04-02T01:12:04.079300 | Sasha | pythondev_help_Sasha_2019-04-02T01:12:04.079300 | 1,554,167,524.0793 | 16,399 |
pythondev | help | still getting a hang of python data structures. i always seem to over complicate it and have to strip things down.. need to quit making things so hard. | 2019-04-02T01:13:09.080000 | Stacy | pythondev_help_Stacy_2019-04-02T01:13:09.080000 | 1,554,167,589.08 | 16,400 |
pythondev | help | can't wait till rhel8 when i can start using f-strings all the time. using .format to be compatible on my servers for now. | 2019-04-02T01:16:07.080700 | Stacy | pythondev_help_Stacy_2019-04-02T01:16:07.080700 | 1,554,167,767.0807 | 16,401 |
pythondev | help | Oh hey <@Sasha> I'm trying to understand a problem conceptually, could we talk through it? | 2019-04-02T01:18:33.081300 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:18:33.081300 | 1,554,167,913.0813 | 16,402 |
pythondev | help | Sure, go for it. | 2019-04-02T01:19:17.081600 | Sasha | pythondev_help_Sasha_2019-04-02T01:19:17.081600 | 1,554,167,957.0816 | 16,403 |
pythondev | help | So i'm trying to help a friend with a coding challenge. and i realized that i can't quite conceptualize it myself | 2019-04-02T01:20:26.082100 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:20:26.082100 | 1,554,168,026.0821 | 16,404 |
pythondev | help | None | 2019-04-02T01:21:03.082300 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:21:03.082300 | 1,554,168,063.0823 | 16,405 |
pythondev | help | So i first i thought it would just be a series of if statements and that would be simple enough. But then i realized it will probably incorporate some concepts i'm not familiar with | 2019-04-02T01:22:12.083500 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:22:12.083500 | 1,554,168,132.0835 | 16,406 |
pythondev | help | I mean i don't actually have to write it. Just conceptualizing it successfully is the goal. | 2019-04-02T01:23:36.084100 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:23:36.084100 | 1,554,168,216.0841 | 16,407 |
pythondev | help | If it's too long to read i can do a tl;dr | 2019-04-02T01:23:44.084400 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:23:44.084400 | 1,554,168,224.0844 | 16,408 |
pythondev | help | I understand the problem, but it's not immediately obvious how to solve it. My first point of slight confusion is even to figure out what the brackets look like for tournaments that don't have a power-of-two number of teams, since some teams will have to skip a round, and maybe we want our favored team to do that. | 2019-04-02T01:26:43.086800 | Sasha | pythondev_help_Sasha_2019-04-02T01:26:43.086800 | 1,554,168,403.0868 | 16,409 |
pythondev | help | I thought the implication was that there's any number of teams | 2019-04-02T01:27:59.088300 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:27:59.088300 | 1,554,168,479.0883 | 16,410 |
pythondev | help | but i don't think odd numbers are allowed. I think it has to be a logical bracket | 2019-04-02T01:28:11.088800 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:28:11.088800 | 1,554,168,491.0888 | 16,411 |
pythondev | help | For our team to advance to a slot in the bracket, it will have to be the highest-ranked team in that subtree, but the exact ordering of other teams doesn't matter within that tree. | 2019-04-02T01:28:15.089000 | Sasha | pythondev_help_Sasha_2019-04-02T01:28:15.089000 | 1,554,168,495.089 | 16,412 |
pythondev | help | I mean that's an assumption, but i don't know how that wouldn't be the case | 2019-04-02T01:28:22.089300 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:28:22.089300 | 1,554,168,502.0893 | 16,413 |
pythondev | help | Ohh you're right | 2019-04-02T01:28:33.089600 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:28:33.089600 | 1,554,168,513.0896 | 16,414 |
pythondev | help | You know i've been trying to make the bracket from the bottom up | 2019-04-02T01:28:46.090000 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:28:46.090000 | 1,554,168,526.09 | 16,415 |
pythondev | help | But i think just > statements might work? | 2019-04-02T01:29:01.090600 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:29:01.090600 | 1,554,168,541.0906 | 16,416 |
pythondev | help | I'm not sure | 2019-04-02T01:29:08.090800 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:29:08.090800 | 1,554,168,548.0908 | 16,417 |
pythondev | help | No it's not that easy. Hmm | 2019-04-02T01:29:13.091000 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:29:13.091000 | 1,554,168,553.091 | 16,418 |
pythondev | help | Waaaait... in the pasted text, it says "2N" teams. Is that actually "2^N" with an exponent? | 2019-04-02T01:32:56.093800 | Sasha | pythondev_help_Sasha_2019-04-02T01:32:56.093800 | 1,554,168,776.0938 | 16,419 |
pythondev | help | So i was thinking and i'm not sure if this makes sense but i was thinking we'd want to try to sort it top to bottom x number of times | 2019-04-02T01:33:08.094000 | Demetrice | pythondev_help_Demetrice_2019-04-02T01:33:08.094000 | 1,554,168,788.094 | 16,420 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.