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 | So I honestly don't know what a good initial value for `f2_param` is, I was just putting a placeholder there that you could replace as-necessary. | 2019-02-13T12:34:04.485300 | Carmen | pythondev_help_Carmen_2019-02-13T12:34:04.485300 | 1,550,061,244.4853 | 8,321 |
pythondev | help | Hello all, any book recommendation for programming design principles? | 2019-02-13T12:35:53.486700 | Margo | pythondev_help_Margo_2019-02-13T12:35:53.486700 | 1,550,061,353.4867 | 8,322 |
pythondev | help | Like design patterns? | 2019-02-13T12:36:20.487100 | Claudine | pythondev_help_Claudine_2019-02-13T12:36:20.487100 | 1,550,061,380.4871 | 8,323 |
pythondev | help | <https://github.com/kamranahmedse/design-patterns-for-humans> | 2019-02-13T12:36:21.487300 | Claudine | pythondev_help_Claudine_2019-02-13T12:36:21.487300 | 1,550,061,381.4873 | 8,324 |
pythondev | help | or if you want something more python specific | 2019-02-13T12:36:42.487700 | Claudine | pythondev_help_Claudine_2019-02-13T12:36:42.487700 | 1,550,061,402.4877 | 8,325 |
pythondev | help | <https://python-patterns.guide/> | 2019-02-13T12:36:43.487900 | Claudine | pythondev_help_Claudine_2019-02-13T12:36:43.487900 | 1,550,061,403.4879 | 8,326 |
pythondev | help | As for how I was providing the parameters to `f1_image`, I was basing it off of the documentation of the function. It appears to take your `f2` function as the first parameter and the image as the second parameter. The `new_f2` function is my way of converting the 2-parameter function into a 1-parameter function, whic... | 2019-02-13T12:38:21.488000 | Carmen | pythondev_help_Carmen_2019-02-13T12:38:21.488000 | 1,550,061,501.488 | 8,327 |
pythondev | help | I see the problem now: new_f2 returns a tuple ( the image and the new parameter). However, fl_image needs to access only the image (first element of the tuple) | 2019-02-13T12:45:38.488400 | Angele | pythondev_help_Angele_2019-02-13T12:45:38.488400 | 1,550,061,938.4884 | 8,328 |
pythondev | help | So, the question is; How can f1-image access the first element of the tuple returned by new_f2? | 2019-02-13T12:46:38.488600 | Angele | pythondev_help_Angele_2019-02-13T12:46:38.488600 | 1,550,061,998.4886 | 8,329 |
pythondev | help | Like so:
```
(other_output, f2_param) = fl_image(new_f2[0], frame)
``` | 2019-02-13T12:47:11.489100 | Angele | pythondev_help_Angele_2019-02-13T12:47:11.489100 | 1,550,062,031.4891 | 8,330 |
pythondev | help | ? | 2019-02-13T12:47:48.489400 | Angele | pythondev_help_Angele_2019-02-13T12:47:48.489400 | 1,550,062,068.4894 | 8,331 |
pythondev | help | I noticed some blank data cells when running my for loop. The data is the same in both so it should be able to see 100% of the values. I cant figure out how to search the entire data_2['final_desc_2'] but search the row['sequence_2'] text one by one | 2019-02-13T12:48:08.489700 | Nola | pythondev_help_Nola_2019-02-13T12:48:08.489700 | 1,550,062,088.4897 | 8,332 |
pythondev | help | Put in another way: Is there a way to access the return value of a lambda function during invocation? | 2019-02-13T12:52:29.493600 | Angele | pythondev_help_Angele_2019-02-13T12:52:29.493600 | 1,550,062,349.4936 | 8,333 |
pythondev | help | Can some help me either find a vocab word that describes what I’m looking for *or* write a function to do it? _I don’t believe what I’m looking for are `permutations`, `combinations` or `cartisean products`_
I have two lists
`foo = [1, 2, 3]`
`bar = [a, b]`
I want to take those two lists and create a list of lists of... | 2019-02-13T12:53:22.495500 | Cammie | pythondev_help_Cammie_2019-02-13T12:53:22.495500 | 1,550,062,402.4955 | 8,334 |
pythondev | help | Maybe I'm doing more work then I need. ANyone know of a way to search a column for all elements of a list? I'm thinking if i turn my 'sequence' column into a list maybe this will be easier | 2019-02-13T12:57:18.496200 | Nola | pythondev_help_Nola_2019-02-13T12:57:18.496200 | 1,550,062,638.4962 | 8,335 |
pythondev | help | Your question is not clear, i would break it down into generic problems and we can help you out | 2019-02-13T13:05:13.496800 | Jonas | pythondev_help_Jonas_2019-02-13T13:05:13.496800 | 1,550,063,113.4968 | 8,336 |
pythondev | help | You have a list, you want to check if all elements of another list are present in the first list? | 2019-02-13T13:05:39.497000 | Jonas | pythondev_help_Jonas_2019-02-13T13:05:39.497000 | 1,550,063,139.497 | 8,337 |
pythondev | help | itertools.product | 2019-02-13T13:05:53.497200 | Bethany | pythondev_help_Bethany_2019-02-13T13:05:53.497200 | 1,550,063,153.4972 | 8,338 |
pythondev | help | Not sure if you saw, but I wrote
> I don’t believe what I’m looking for are `permutations`, `combinations` or `cartisean products` | 2019-02-13T13:06:30.497400 | Cammie | pythondev_help_Cammie_2019-02-13T13:06:30.497400 | 1,550,063,190.4974 | 8,339 |
pythondev | help | Its important to note, I need the iterations grouped, which `itertools.product` does *not* do | 2019-02-13T13:06:42.497600 | Cammie | pythondev_help_Cammie_2019-02-13T13:06:42.497600 | 1,550,063,202.4976 | 8,340 |
pythondev | help | oh misread thought you thought it was one of those | 2019-02-13T13:07:05.497800 | Bethany | pythondev_help_Bethany_2019-02-13T13:07:05.497800 | 1,550,063,225.4978 | 8,341 |
pythondev | help | No worries. I updated the expected output to be more clear | 2019-02-13T13:07:15.498100 | Cammie | pythondev_help_Cammie_2019-02-13T13:07:15.498100 | 1,550,063,235.4981 | 8,342 |
pythondev | help | If you have any more thoughts, please let me know, as I’m stumped | 2019-02-13T13:07:24.498300 | Cammie | pythondev_help_Cammie_2019-02-13T13:07:24.498300 | 1,550,063,244.4983 | 8,343 |
pythondev | help | ok i think i understand what you're trying to do, thinking | 2019-02-13T13:08:19.498500 | Bethany | pythondev_help_Bethany_2019-02-13T13:08:19.498500 | 1,550,063,299.4985 | 8,344 |
pythondev | help | can you not accomplish by `zip(bar, combs(foo, len(bar)` | 2019-02-13T13:09:01.498700 | Bethany | pythondev_help_Bethany_2019-02-13T13:09:01.498700 | 1,550,063,341.4987 | 8,345 |
pythondev | help | or rather, permutations of foo | 2019-02-13T13:09:57.498900 | Bethany | pythondev_help_Bethany_2019-02-13T13:09:57.498900 | 1,550,063,397.4989 | 8,346 |
pythondev | help | that last sentence lost me | 2019-02-13T13:11:43.499200 | Cammie | pythondev_help_Cammie_2019-02-13T13:11:43.499200 | 1,550,063,503.4992 | 8,347 |
pythondev | help | one sec lemme try some things in code | 2019-02-13T13:11:53.499400 | Bethany | pythondev_help_Bethany_2019-02-13T13:11:53.499400 | 1,550,063,513.4994 | 8,348 |
pythondev | help | i followed the code snippet, can you reiterate yor last sentence for me | 2019-02-13T13:11:54.499600 | Cammie | pythondev_help_Cammie_2019-02-13T13:11:54.499600 | 1,550,063,514.4996 | 8,349 |
pythondev | help | kk thank you | 2019-02-13T13:11:57.499800 | Cammie | pythondev_help_Cammie_2019-02-13T13:11:57.499800 | 1,550,063,517.4998 | 8,350 |
pythondev | help | Did another one out:
```
foo = [1, 2]
bar = [a, b, c]
```
```
[
[(1, a), (2, b)],
[(1, a), (2, c)],
[(1, b), (2, a)],
[(1, b), (2, c)],
[(1, c), (2, a)],
[(1, c), (2, b)],
]
``` | 2019-02-13T13:15:07.500000 | Cammie | pythondev_help_Cammie_2019-02-13T13:15:07.500000 | 1,550,063,707.5 | 8,351 |
pythondev | help | Writing that out reminded me of doing EE homework and truth tables… | 2019-02-13T13:15:27.500200 | Cammie | pythondev_help_Cammie_2019-02-13T13:15:27.500200 | 1,550,063,727.5002 | 8,352 |
pythondev | help | i think the number of output is
`len(foo) ^ len(bar)` | 2019-02-13T13:15:55.500400 | Cammie | pythondev_help_Cammie_2019-02-13T13:15:55.500400 | 1,550,063,755.5004 | 8,353 |
pythondev | help | I’ve rewritten my problem in english
you have a list of children with names
`foo = ["mike", "grehg"]`
and you have some cookies with weight
`bar = [1, 2]`
> What are all the different ways you can dish out the cookies, if a child can only receive at most 1 cookie? | 2019-02-13T13:27:15.501000 | Cammie | pythondev_help_Cammie_2019-02-13T13:27:15.501000 | 1,550,064,435.501 | 8,354 |
pythondev | help | n_children choose n_cookies | 2019-02-13T13:30:09.501300 | Bethany | pythondev_help_Bethany_2019-02-13T13:30:09.501300 | 1,550,064,609.5013 | 8,355 |
pythondev | help | thats the statistical term | 2019-02-13T13:30:16.501500 | Bethany | pythondev_help_Bethany_2019-02-13T13:30:16.501500 | 1,550,064,616.5015 | 8,356 |
pythondev | help | well the number of them | 2019-02-13T13:30:24.501700 | Bethany | pythondev_help_Bethany_2019-02-13T13:30:24.501700 | 1,550,064,624.5017 | 8,357 |
pythondev | help | love it | 2019-02-13T13:30:55.501900 | Cammie | pythondev_help_Cammie_2019-02-13T13:30:55.501900 | 1,550,064,655.5019 | 8,358 |
pythondev | help | thats just combination though | 2019-02-13T13:31:35.502100 | Bethany | pythondev_help_Bethany_2019-02-13T13:31:35.502100 | 1,550,064,695.5021 | 8,359 |
pythondev | help | <https://en.wikipedia.org/wiki/Combination> | 2019-02-13T13:31:35.502300 | Bethany | pythondev_help_Bethany_2019-02-13T13:31:35.502300 | 1,550,064,695.5023 | 8,360 |
pythondev | help | I’m with you. | 2019-02-13T13:31:45.502600 | Cammie | pythondev_help_Cammie_2019-02-13T13:31:45.502600 | 1,550,064,705.5026 | 8,361 |
pythondev | help | Every solution that codes a combination, does so in one big list. | 2019-02-13T13:31:54.502800 | Cammie | pythondev_help_Cammie_2019-02-13T13:31:54.502800 | 1,550,064,714.5028 | 8,362 |
pythondev | help | Actually hold up. I dont’ think this is correct. | 2019-02-13T13:32:06.503000 | Cammie | pythondev_help_Cammie_2019-02-13T13:32:06.503000 | 1,550,064,726.503 | 8,363 |
pythondev | help | Because a child can have up to one cookie | 2019-02-13T13:32:18.503200 | Cammie | pythondev_help_Cammie_2019-02-13T13:32:18.503200 | 1,550,064,738.5032 | 8,364 |
pythondev | help | yeah I dont think your metaphor captures the problem | 2019-02-13T13:32:18.503400 | Bethany | pythondev_help_Bethany_2019-02-13T13:32:18.503400 | 1,550,064,738.5034 | 8,365 |
pythondev | help | so they may have none | 2019-02-13T13:32:20.503600 | Cammie | pythondev_help_Cammie_2019-02-13T13:32:20.503600 | 1,550,064,740.5036 | 8,366 |
pythondev | help | yes so each children has 2 states | 2019-02-13T13:32:29.503800 | Bethany | pythondev_help_Bethany_2019-02-13T13:32:29.503800 | 1,550,064,749.5038 | 8,367 |
pythondev | help | To be honest, the metaphor IS the problem | 2019-02-13T13:32:30.504000 | Cammie | pythondev_help_Cammie_2019-02-13T13:32:30.504000 | 1,550,064,750.504 | 8,368 |
pythondev | help | and what I posted was my attempt to make it easier to understand | 2019-02-13T13:32:48.504200 | Cammie | pythondev_help_Cammie_2019-02-13T13:32:48.504200 | 1,550,064,768.5042 | 8,369 |
pythondev | help | are you doing something with microstates and entropy | 2019-02-13T13:33:00.504400 | Bethany | pythondev_help_Bethany_2019-02-13T13:33:00.504400 | 1,550,064,780.5044 | 8,370 |
pythondev | help | or literally cookies | 2019-02-13T13:33:15.504600 | Bethany | pythondev_help_Bethany_2019-02-13T13:33:15.504600 | 1,550,064,795.5046 | 8,371 |
pythondev | help | uh literally cookies and children | 2019-02-13T13:33:24.504800 | Cammie | pythondev_help_Cammie_2019-02-13T13:33:24.504800 | 1,550,064,804.5048 | 8,372 |
pythondev | help | yes so the problem is : I have N children and M cookies. List all possible ways I can give out the cookies | 2019-02-13T13:34:05.505100 | Bethany | pythondev_help_Bethany_2019-02-13T13:34:05.505100 | 1,550,064,845.5051 | 8,373 |
pythondev | help | Correct. | 2019-02-13T13:34:10.505300 | Cammie | pythondev_help_Cammie_2019-02-13T13:34:10.505300 | 1,550,064,850.5053 | 8,374 |
pythondev | help | Where N can be <, =, > M | 2019-02-13T13:34:29.505500 | Cammie | pythondev_help_Cammie_2019-02-13T13:34:29.505500 | 1,550,064,869.5055 | 8,375 |
pythondev | help | if max you can give is 1 though if M > N there's only one way: everybody gets one | 2019-02-13T13:34:53.505800 | Bethany | pythondev_help_Bethany_2019-02-13T13:34:53.505800 | 1,550,064,893.5058 | 8,376 |
pythondev | help | Yup | 2019-02-13T13:35:08.506000 | Cammie | pythondev_help_Cammie_2019-02-13T13:35:08.506000 | 1,550,064,908.506 | 8,377 |
pythondev | help | The cookies can have different weights. | 2019-02-13T13:35:12.506200 | Cammie | pythondev_help_Cammie_2019-02-13T13:35:12.506200 | 1,550,064,912.5062 | 8,378 |
pythondev | help | So it still matters. | 2019-02-13T13:35:18.506400 | Cammie | pythondev_help_Cammie_2019-02-13T13:35:18.506400 | 1,550,064,918.5064 | 8,379 |
pythondev | help | i’m trying to only talk about specifically what I think is important and I think that’s biting me in the ass when we discuss this | 2019-02-13T13:35:34.506700 | Cammie | pythondev_help_Cammie_2019-02-13T13:35:34.506700 | 1,550,064,934.5067 | 8,380 |
pythondev | help | usually that's the case. | 2019-02-13T13:35:53.506900 | Bethany | pythondev_help_Bethany_2019-02-13T13:35:53.506900 | 1,550,064,953.5069 | 8,381 |
pythondev | help | basically a list of strings, denoting children | 2019-02-13T13:36:13.507200 | Cammie | pythondev_help_Cammie_2019-02-13T13:36:13.507200 | 1,550,064,973.5072 | 8,382 |
pythondev | help | list of ints, denoting cookie weights | 2019-02-13T13:36:17.507400 | Cammie | pythondev_help_Cammie_2019-02-13T13:36:17.507400 | 1,550,064,977.5074 | 8,383 |
pythondev | help | What are all the ways to give out the cookies, where each child can have at most one cookie | 2019-02-13T13:36:29.507600 | Cammie | pythondev_help_Cammie_2019-02-13T13:36:29.507600 | 1,550,064,989.5076 | 8,384 |
pythondev | help | That’s the whole problem | 2019-02-13T13:36:35.507900 | Cammie | pythondev_help_Cammie_2019-02-13T13:36:35.507900 | 1,550,064,995.5079 | 8,385 |
pythondev | help | I can code this up in a disgusting way, but I was looking for a vocab word or elegant pythonic way | 2019-02-13T13:36:48.508100 | Cammie | pythondev_help_Cammie_2019-02-13T13:36:48.508100 | 1,550,065,008.5081 | 8,386 |
pythondev | help | Does that all make sense? | 2019-02-13T13:36:56.508300 | Cammie | pythondev_help_Cammie_2019-02-13T13:36:56.508300 | 1,550,065,016.5083 | 8,387 |
pythondev | help | and there's duplicates weights right? | 2019-02-13T13:36:59.508500 | Bethany | pythondev_help_Bethany_2019-02-13T13:36:59.508500 | 1,550,065,019.5085 | 8,388 |
pythondev | help | there can be | 2019-02-13T13:37:03.508700 | Cammie | pythondev_help_Cammie_2019-02-13T13:37:03.508700 | 1,550,065,023.5087 | 8,389 |
pythondev | help | they’re not unique by default | 2019-02-13T13:37:10.508900 | Cammie | pythondev_help_Cammie_2019-02-13T13:37:10.508900 | 1,550,065,030.5089 | 8,390 |
pythondev | help | like [1, 1, 2, 3, 4, 5, 5, 5, 5 ... ] | 2019-02-13T13:37:12.509100 | Bethany | pythondev_help_Bethany_2019-02-13T13:37:12.509100 | 1,550,065,032.5091 | 8,391 |
pythondev | help | sure | 2019-02-13T13:37:14.509300 | Cammie | pythondev_help_Cammie_2019-02-13T13:37:14.509300 | 1,550,065,034.5093 | 8,392 |
pythondev | help | that’s valid | 2019-02-13T13:37:15.509500 | Cammie | pythondev_help_Cammie_2019-02-13T13:37:15.509500 | 1,550,065,035.5095 | 8,393 |
pythondev | help | so is
[1, 2, 3] | 2019-02-13T13:37:22.509800 | Cammie | pythondev_help_Cammie_2019-02-13T13:37:22.509800 | 1,550,065,042.5098 | 8,394 |
pythondev | help | this is a bit more interesting | 2019-02-13T13:37:47.510000 | Bethany | pythondev_help_Bethany_2019-02-13T13:37:47.510000 | 1,550,065,067.51 | 8,395 |
pythondev | help | hahaha :heart: | 2019-02-13T13:37:55.510200 | Cammie | pythondev_help_Cammie_2019-02-13T13:37:55.510200 | 1,550,065,075.5102 | 8,396 |
pythondev | help | Thank you for bearing with me | 2019-02-13T13:37:59.510400 | Cammie | pythondev_help_Cammie_2019-02-13T13:37:59.510400 | 1,550,065,079.5104 | 8,397 |
pythondev | help | i’ve loved this discussion | 2019-02-13T13:38:02.510600 | Cammie | pythondev_help_Cammie_2019-02-13T13:38:02.510600 | 1,550,065,082.5106 | 8,398 |
pythondev | help | so really what you're dealing with is n_children. You need to put them into groups (cookie weight). The # of children you can put in each group is the # of cookies with that same weight | 2019-02-13T13:39:12.510800 | Bethany | pythondev_help_Bethany_2019-02-13T13:39:12.510800 | 1,550,065,152.5108 | 8,399 |
pythondev | help | within the group it's indistignuishable who gets each cookie | 2019-02-13T13:39:28.511000 | Bethany | pythondev_help_Bethany_2019-02-13T13:39:28.511000 | 1,550,065,168.511 | 8,400 |
pythondev | help | If possible, can you reword it. If I understand correctly than no, that is not correct at all. | 2019-02-13T13:42:08.511200 | Cammie | pythondev_help_Cammie_2019-02-13T13:42:08.511200 | 1,550,065,328.5112 | 8,401 |
pythondev | help | But I’m fearful I didn’t understand | 2019-02-13T13:42:13.511400 | Cammie | pythondev_help_Cammie_2019-02-13T13:42:13.511400 | 1,550,065,333.5114 | 8,402 |
pythondev | help | do you need the number of ways to do this or to enumerate the possibilites? | 2019-02-13T13:44:04.511600 | Bethany | pythondev_help_Bethany_2019-02-13T13:44:04.511600 | 1,550,065,444.5116 | 8,403 |
pythondev | help | internet went down | 2019-02-13T13:44:04.511800 | Bethany | pythondev_help_Bethany_2019-02-13T13:44:04.511800 | 1,550,065,444.5118 | 8,404 |
pythondev | help | gotta go back to work | 2019-02-13T13:50:26.512000 | Bethany | pythondev_help_Bethany_2019-02-13T13:50:26.512000 | 1,550,065,826.512 | 8,405 |
pythondev | help | you might need some clever programming for this | 2019-02-13T13:50:34.512200 | Bethany | pythondev_help_Bethany_2019-02-13T13:50:34.512200 | 1,550,065,834.5122 | 8,406 |
pythondev | help | I need to actually enumerate | 2019-02-13T13:53:37.512400 | Cammie | pythondev_help_Cammie_2019-02-13T13:53:37.512400 | 1,550,066,017.5124 | 8,407 |
pythondev | help | No worries mate, thanks for everything regarldess | 2019-02-13T13:53:48.512600 | Cammie | pythondev_help_Cammie_2019-02-13T13:53:48.512600 | 1,550,066,028.5126 | 8,408 |
pythondev | help | <@Bethany> :taco: | 2019-02-13T13:53:52.512800 | Cammie | pythondev_help_Cammie_2019-02-13T13:53:52.512800 | 1,550,066,032.5128 | 8,409 |
pythondev | help | Possibly by modifying a shared state variable within the lambda (though at that point it's probably worth it to define a second-order function for clarity sake). I don't know the best way to do that, however. | 2019-02-13T14:51:24.513200 | Carmen | pythondev_help_Carmen_2019-02-13T14:51:24.513200 | 1,550,069,484.5132 | 8,410 |
pythondev | help | How is pytest for integration testing | 2019-02-13T15:24:14.514000 | Candra | pythondev_help_Candra_2019-02-13T15:24:14.514000 | 1,550,071,454.514 | 8,411 |
pythondev | help | good | 2019-02-13T15:24:23.514400 | Tarsha | pythondev_help_Tarsha_2019-02-13T15:24:23.514400 | 1,550,071,463.5144 | 8,412 |
pythondev | help | Currently stuck on nose + unittest but I'm swapping out nose for pytest and keeping the basic unittest foundation for now | 2019-02-13T15:24:45.514900 | Candra | pythondev_help_Candra_2019-02-13T15:24:45.514900 | 1,550,071,485.5149 | 8,413 |
pythondev | help | But eventually the unit tests need to be tied together to pass input along and it seems like fixtures and context builders will help | 2019-02-13T15:28:05.515700 | Candra | pythondev_help_Candra_2019-02-13T15:28:05.515700 | 1,550,071,685.5157 | 8,414 |
pythondev | help | yeah the fixtures are pretty good | 2019-02-13T15:33:00.515900 | Tarsha | pythondev_help_Tarsha_2019-02-13T15:33:00.515900 | 1,550,071,980.5159 | 8,415 |
pythondev | help | they can do stuff per test, per session, per module or per class | 2019-02-13T15:33:17.516300 | Tarsha | pythondev_help_Tarsha_2019-02-13T15:33:17.516300 | 1,550,071,997.5163 | 8,416 |
pythondev | help | pytest is definitely worth investing some time into | 2019-02-13T15:33:27.516900 | Tarsha | pythondev_help_Tarsha_2019-02-13T15:33:27.516900 | 1,550,072,007.5169 | 8,417 |
pythondev | help | Having been working with these unittests, the output diff and code snippet is insanely useful | 2019-02-13T15:37:21.517900 | Candra | pythondev_help_Candra_2019-02-13T15:37:21.517900 | 1,550,072,241.5179 | 8,418 |
pythondev | help | from pytest that is | 2019-02-13T15:37:28.518100 | Candra | pythondev_help_Candra_2019-02-13T15:37:28.518100 | 1,550,072,248.5181 | 8,419 |
pythondev | help | `parametrize` is the biggest killer for me | 2019-02-13T15:37:53.518500 | Jonas | pythondev_help_Jonas_2019-02-13T15:37:53.518500 | 1,550,072,273.5185 | 8,420 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.