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 | Refactoring your code so the business logic is separated from the I/O calls (so you can stop mocking around) is a third choice :wink: | 2018-01-20T09:13:46.000458 | Aleida | pythondev_help_Aleida_2018-01-20T09:13:46.000458 | 1,516,439,626.000458 | 30,124 |
pythondev | help | It doesn't work that way on my repository, It's supposed to be a library to simplify usage of our school's API | 2018-01-20T09:15:55.000558 | Gwyn | pythondev_help_Gwyn_2018-01-20T09:15:55.000558 | 1,516,439,755.000558 | 30,125 |
pythondev | help | so far so good, I just want good `code coverage` | 2018-01-20T09:16:28.001147 | Gwyn | pythondev_help_Gwyn_2018-01-20T09:16:28.001147 | 1,516,439,788.001147 | 30,126 |
pythondev | help | <@Gwyn> what for? | 2018-01-20T09:17:16.000816 | Aleida | pythondev_help_Aleida_2018-01-20T09:17:16.000816 | 1,516,439,836.000816 | 30,127 |
pythondev | help | Wellm I'm trying to get used to having a clean, professional looking repository | 2018-01-20T09:17:40.000351 | Gwyn | pythondev_help_Gwyn_2018-01-20T09:17:40.000351 | 1,516,439,860.000351 | 30,128 |
pythondev | help | Documentation, tests all that good stuff | 2018-01-20T09:17:50.001015 | Gwyn | pythondev_help_Gwyn_2018-01-20T09:17:50.001015 | 1,516,439,870.001015 | 30,129 |
pythondev | help | and I love it :stuck_out_tongue: | 2018-01-20T09:17:56.001003 | Gwyn | pythondev_help_Gwyn_2018-01-20T09:17:56.001003 | 1,516,439,876.001003 | 30,130 |
pythondev | help | I'm going to give you an example to think about: the following snippet
```
def add(x, y):
return x + y
```
is 100% covered by this "test":
```
def test_add():
add(1, 2)
``` | 2018-01-20T09:18:50.000132 | Aleida | pythondev_help_Aleida_2018-01-20T09:18:50.000132 | 1,516,439,930.000132 | 30,131 |
pythondev | help | Yeah I know | 2018-01-20T09:19:11.000108 | Gwyn | pythondev_help_Gwyn_2018-01-20T09:19:11.000108 | 1,516,439,951.000108 | 30,132 |
pythondev | help | Obviously I am not going to do only the minimum | 2018-01-20T09:19:24.000022 | Gwyn | pythondev_help_Gwyn_2018-01-20T09:19:24.000022 | 1,516,439,964.000022 | 30,133 |
pythondev | help | but API tests are quite more annoying because of mocks :confused: | 2018-01-20T09:19:39.001120 | Gwyn | pythondev_help_Gwyn_2018-01-20T09:19:39.001120 | 1,516,439,979.00112 | 30,134 |
pythondev | help | When you are mocking, you almost certainly do that in order to test your logic. As I said, you can always refactor your logic into pure functions that does not require you to mock anything | 2018-01-20T09:20:52.000164 | Aleida | pythondev_help_Aleida_2018-01-20T09:20:52.000164 | 1,516,440,052.000164 | 30,135 |
pythondev | help | I would love to do this, but I don't see how I could | 2018-01-20T09:21:28.000595 | Gwyn | pythondev_help_Gwyn_2018-01-20T09:21:28.000595 | 1,516,440,088.000595 | 30,136 |
pythondev | help | <http://github.com/seluj78/intrapy|github.com/seluj78/intrapy> | 2018-01-20T09:21:42.000498 | Gwyn | pythondev_help_Gwyn_2018-01-20T09:21:42.000498 | 1,516,440,102.000498 | 30,137 |
pythondev | help | look at how the code works | 2018-01-20T09:21:47.000165 | Gwyn | pythondev_help_Gwyn_2018-01-20T09:21:47.000165 | 1,516,440,107.000165 | 30,138 |
pythondev | help | or the wiki | 2018-01-20T09:21:49.000615 | Gwyn | pythondev_help_Gwyn_2018-01-20T09:21:49.000615 | 1,516,440,109.000615 | 30,139 |
pythondev | help | I have no Idea about how you would go about this | 2018-01-20T09:22:03.000083 | Gwyn | pythondev_help_Gwyn_2018-01-20T09:22:03.000083 | 1,516,440,123.000083 | 30,140 |
pythondev | help | And I first thought that you were saying this as a joke `Refactoring your code so the business logic is separated from the I/O calls (so you can stop mocking around) is a third choice :wink:` :stuck_out_tongue: | 2018-01-20T09:22:36.000104 | Gwyn | pythondev_help_Gwyn_2018-01-20T09:22:36.000104 | 1,516,440,156.000104 | 30,141 |
pythondev | help | One easy way to do that is to create a `request` method that handle the I/O and return the content | 2018-01-20T09:24:59.000879 | Micki | pythondev_help_Micki_2018-01-20T09:24:59.000879 | 1,516,440,299.000879 | 30,142 |
pythondev | help | you can then easily mock this request to return whatever you want during your tests | 2018-01-20T09:25:15.000723 | Micki | pythondev_help_Micki_2018-01-20T09:25:15.000723 | 1,516,440,315.000723 | 30,143 |
pythondev | help | that's what i did | 2018-01-20T09:25:15.001099 | Gwyn | pythondev_help_Gwyn_2018-01-20T09:25:15.001099 | 1,516,440,315.001099 | 30,144 |
pythondev | help | well kinda | 2018-01-20T09:25:28.000546 | Gwyn | pythondev_help_Gwyn_2018-01-20T09:25:28.000546 | 1,516,440,328.000546 | 30,145 |
pythondev | help | <https://github.com/Seluj78/IntraPy/blob/master/IntraPy/IntraPy.py#L113> | 2018-01-20T09:25:43.000014 | Gwyn | pythondev_help_Gwyn_2018-01-20T09:25:43.000014 | 1,516,440,343.000014 | 30,146 |
pythondev | help | Alright, so let's see your tests.
Due to mocking, the following test <https://github.com/Seluj78/IntraPy/blob/tests/tests/test_IntraPy.py#L23-L31> does not actually test anything remotely useful:
* if the url is changed, the test will pass
* if the response format is changed, the test will pass
* if authorization metho... | 2018-01-20T09:31:38.001112 | Aleida | pythondev_help_Aleida_2018-01-20T09:31:38.001112 | 1,516,440,698.001112 | 30,147 |
pythondev | help | I see :thinking_face: The thing is, I'm not trying to test the API itelf, because the school dev team (10 people) are really good at it and there wasn't any problem and I don't think they'll change anything any time soon
What I want to test are the handlers, the option handling for example, or the way I format data if... | 2018-01-20T09:34:24.000772 | Gwyn | pythondev_help_Gwyn_2018-01-20T09:34:24.000772 | 1,516,440,864.000772 | 30,148 |
pythondev | help | Sounds like you need integration tests (or end-to-end tests), not unit tests. Right now your library is pretty much just a proxy for the api
If so, then test the fact it _acts_ like a real proxy | 2018-01-20T09:36:25.001180 | Aleida | pythondev_help_Aleida_2018-01-20T09:36:25.001180 | 1,516,440,985.00118 | 30,149 |
pythondev | help | oooh | 2018-01-20T09:36:55.000154 | Gwyn | pythondev_help_Gwyn_2018-01-20T09:36:55.000154 | 1,516,441,015.000154 | 30,150 |
pythondev | help | The only place I see in your codebase which can be unit tested is this module <https://github.com/Seluj78/IntraPy/blob/tests/IntraPy/args.py> | 2018-01-20T09:37:01.000423 | Aleida | pythondev_help_Aleida_2018-01-20T09:37:01.000423 | 1,516,441,021.000423 | 30,151 |
pythondev | help | Yep that's what I thought too
> What I want to test are the handlers, the option handling for example, or the way I format data if i need to (I am not doing it yet) etc | 2018-01-20T09:37:32.000696 | Gwyn | pythondev_help_Gwyn_2018-01-20T09:37:32.000696 | 1,516,441,052.000696 | 30,152 |
pythondev | help | Especially this part of the code because we have much more to be added in this part of the codebase (arg handling), because we didn't plan on other endpoints, only one which had a few options you could pass, and like the next one on the list had 200 more so yeah, there's some work | 2018-01-20T09:38:48.000862 | Gwyn | pythondev_help_Gwyn_2018-01-20T09:38:48.000862 | 1,516,441,128.000862 | 30,153 |
pythondev | help | I was trying multiprocessing in python. Using `concurrent.futures`. Strange thing is i dont find multiple processes in my `ps -ef|grep python` output. Does that mean my multiprocessing is not really multi now? | 2018-01-20T23:42:02.000081 | Eliseo | pythondev_help_Eliseo_2018-01-20T23:42:02.000081 | 1,516,491,722.000081 | 30,154 |
pythondev | help | Are you sure you're using `ProcessPoolExecutor` and not the `ThreadPoolExecutor`? | 2018-01-20T23:45:50.000391 | Sadye | pythondev_help_Sadye_2018-01-20T23:45:50.000391 | 1,516,491,950.000391 | 30,155 |
pythondev | help | my bad i am seeing it now..thanks <@Sadye> | 2018-01-20T23:48:51.000185 | Eliseo | pythondev_help_Eliseo_2018-01-20T23:48:51.000185 | 1,516,492,131.000185 | 30,156 |
pythondev | help | I'm having an issue, I don't know if this is because Jupyter notebook is slow, I'm trying to run these expressions
```
list_comp = [math.factorial(num) for num in range(10**5)]
gen_expr = (math.factorial(num) for num in range(10**5))
```
but its taking forever to run, this was unlike when I was running it in Spyder as ... | 2018-01-21T02:20:29.000392 | Charlene | pythondev_help_Charlene_2018-01-21T02:20:29.000392 | 1,516,501,229.000392 | 30,157 |
pythondev | help | <@Charlene> what happens when you run it in the regular ipython shell? | 2018-01-21T08:35:39.000553 | Floy | pythondev_help_Floy_2018-01-21T08:35:39.000553 | 1,516,523,739.000553 | 30,158 |
pythondev | help | But... Why do you need it anyway? I'm not surprised at all that it takes forever to run. Factorial of 10**5 it's a lot. And list of all factorials before that will take a lot to calculate as well. | 2018-01-21T08:41:35.000706 | Sadye | pythondev_help_Sadye_2018-01-21T08:41:35.000706 | 1,516,524,095.000706 | 30,159 |
pythondev | help | <@Floy> I was using the ipython console on Spyder to run a file and as my playground for learning, I've been trying out a lot of things all day, then Spyder crashed, and I lost all my work for the whole day (as I haven't been saving), which was very annoying, so I decided to use jupyter notebook | 2018-01-21T08:45:11.000605 | Charlene | pythondev_help_Charlene_2018-01-21T08:45:11.000605 | 1,516,524,311.000605 | 30,160 |
pythondev | help | it will also consume a lot of RAM :thinking_face: | 2018-01-21T08:45:15.000693 | Sadye | pythondev_help_Sadye_2018-01-21T08:45:15.000693 | 1,516,524,315.000693 | 30,161 |
pythondev | help | Well, may be not that much as slack :sweat_smile: | 2018-01-21T08:45:33.000573 | Sadye | pythondev_help_Sadye_2018-01-21T08:45:33.000573 | 1,516,524,333.000573 | 30,162 |
pythondev | help | ```
In [9]: for i in range(1, 6):
...: print(f'factorializing 10^{i}')
...: %time t = [factorial(num) for num in range(10**i)]
...:
factorializing 10^1
CPU times: user 110 µs, sys: 30 µs, total: 140 µs
Wall time: 143 µs
factorializing 10^2
CPU times: user 82 µs, sys: 1 µs, total: 83 µs
Wall time: 84.9 ... | 2018-01-21T08:46:05.000214 | Floy | pythondev_help_Floy_2018-01-21T08:46:05.000214 | 1,516,524,365.000214 | 30,163 |
pythondev | help | on a 2013 MBP with with 16GB RAM | 2018-01-21T08:46:38.000605 | Floy | pythondev_help_Floy_2018-01-21T08:46:38.000605 | 1,516,524,398.000605 | 30,164 |
pythondev | help | and the last execution hasn’t finished yet | 2018-01-21T08:46:49.000190 | Floy | pythondev_help_Floy_2018-01-21T08:46:49.000190 | 1,516,524,409.00019 | 30,165 |
pythondev | help | still going …. | 2018-01-21T08:46:54.000414 | Floy | pythondev_help_Floy_2018-01-21T08:46:54.000414 | 1,516,524,414.000414 | 30,166 |
pythondev | help | how fast was this code executing in spyder? | 2018-01-21T08:47:22.000309 | Floy | pythondev_help_Floy_2018-01-21T08:47:22.000309 | 1,516,524,442.000309 | 30,167 |
pythondev | help | It was almost instantaneous | 2018-01-21T08:47:40.000981 | Charlene | pythondev_help_Charlene_2018-01-21T08:47:40.000981 | 1,516,524,460.000981 | 30,168 |
pythondev | help | Actually I did 10**10 on spyder | 2018-01-21T08:47:59.000292 | Charlene | pythondev_help_Charlene_2018-01-21T08:47:59.000292 | 1,516,524,479.000292 | 30,169 |
pythondev | help | and it was pretty fast | 2018-01-21T08:48:06.000235 | Charlene | pythondev_help_Charlene_2018-01-21T08:48:06.000235 | 1,516,524,486.000235 | 30,170 |
pythondev | help | ¯\_(ツ)_/¯ | 2018-01-21T08:48:09.000658 | Charlene | pythondev_help_Charlene_2018-01-21T08:48:09.000658 | 1,516,524,489.000658 | 30,171 |
pythondev | help | Maybe spider does some hardcoded precalculated hacks for this? Can you run it in spyder again and tell us how fast the list comprehension worked? | 2018-01-21T08:49:10.000400 | Sadye | pythondev_help_Sadye_2018-01-21T08:49:10.000400 | 1,516,524,550.0004 | 30,172 |
pythondev | help | I just wanted to compare the memory between a list comprehension and generator expression | 2018-01-21T08:49:13.000346 | Charlene | pythondev_help_Charlene_2018-01-21T08:49:13.000346 | 1,516,524,553.000346 | 30,173 |
pythondev | help | okay | 2018-01-21T08:49:34.000252 | Charlene | pythondev_help_Charlene_2018-01-21T08:49:34.000252 | 1,516,524,574.000252 | 30,174 |
pythondev | help | maybe that's why spyder crashed? :joy: | 2018-01-21T08:49:57.000297 | Sadye | pythondev_help_Sadye_2018-01-21T08:49:57.000297 | 1,516,524,597.000297 | 30,175 |
pythondev | help | Spyder crashes a lot unnecessarily, and sadly doesn't autosave | 2018-01-21T08:50:48.000539 | Charlene | pythondev_help_Charlene_2018-01-21T08:50:48.000539 | 1,516,524,648.000539 | 30,176 |
pythondev | help | FWIW, that last execution hasn’t finished | 2018-01-21T08:51:45.000463 | Floy | pythondev_help_Floy_2018-01-21T08:51:45.000463 | 1,516,524,705.000463 | 30,177 |
pythondev | help | Hmmm, I was taking the example from a book I was reading. | 2018-01-21T08:53:40.000279 | Charlene | pythondev_help_Charlene_2018-01-21T08:53:40.000279 | 1,516,524,820.000279 | 30,178 |
pythondev | help | which one? | 2018-01-21T08:54:28.000571 | Floy | pythondev_help_Floy_2018-01-21T08:54:28.000571 | 1,516,524,868.000571 | 30,179 |
pythondev | help | It was an example used to show the memory efficiency between list comprehension and generator expression | 2018-01-21T08:54:51.000538 | Charlene | pythondev_help_Charlene_2018-01-21T08:54:51.000538 | 1,516,524,891.000538 | 30,180 |
pythondev | help | and that ipython shell was running in my data analysis anaconda environment | 2018-01-21T08:55:06.000437 | Floy | pythondev_help_Floy_2018-01-21T08:55:06.000437 | 1,516,524,906.000437 | 30,181 |
pythondev | help | *Python for the busy Java developer* | 2018-01-21T08:55:20.000055 | Charlene | pythondev_help_Charlene_2018-01-21T08:55:20.000055 | 1,516,524,920.000055 | 30,182 |
pythondev | help | ok | 2018-01-21T08:55:36.000412 | Floy | pythondev_help_Floy_2018-01-21T08:55:36.000412 | 1,516,524,936.000412 | 30,183 |
pythondev | help | FWIW, those two look exactly identical. one just puts out a list and the other does a tuple | 2018-01-21T08:55:51.000699 | Floy | pythondev_help_Floy_2018-01-21T08:55:51.000699 | 1,516,524,951.000699 | 30,184 |
pythondev | help | Sorry, whats *FWIW* :simple_smile: | 2018-01-21T08:56:37.000670 | Charlene | pythondev_help_Charlene_2018-01-21T08:56:37.000670 | 1,516,524,997.00067 | 30,185 |
pythondev | help | not really, second one creates generator | 2018-01-21T08:57:02.000115 | Sadye | pythondev_help_Sadye_2018-01-21T08:57:02.000115 | 1,516,525,022.000115 | 30,186 |
pythondev | help | tuple would be
```
tuple = tuple(math.factorial(num) for num in range(10**5))
``` | 2018-01-21T08:57:40.000755 | Sadye | pythondev_help_Sadye_2018-01-21T08:57:40.000755 | 1,516,525,060.000755 | 30,187 |
pythondev | help | if the generator one work and not the list comprehension it kind of prove the point :smile: | 2018-01-21T08:57:42.000154 | Micki | pythondev_help_Micki_2018-01-21T08:57:42.000154 | 1,516,525,062.000154 | 30,188 |
pythondev | help | ```
<class 'list'> [1, 1, 2, 6, 24, 120, 720, ...
<class 'generator'> <generator object <genexpr> at 0x7fbda9718e60>
9024
88
```
Generator memory size always 88, compared to 9024 for list comprehension, for 10**3 | 2018-01-21T08:58:52.000786 | Charlene | pythondev_help_Charlene_2018-01-21T08:58:52.000786 | 1,516,525,132.000786 | 30,189 |
pythondev | help | lol :slightly_smiling_face: | 2018-01-21T08:59:29.000268 | Sadye | pythondev_help_Sadye_2018-01-21T08:59:29.000268 | 1,516,525,169.000268 | 30,190 |
pythondev | help | Then, if I was the book author, I would put generator example first | 2018-01-21T08:59:53.000163 | Sadye | pythondev_help_Sadye_2018-01-21T08:59:53.000163 | 1,516,525,193.000163 | 30,191 |
pythondev | help | Generally, is there're any ~hack~ way to speed up Jupyter? | 2018-01-21T09:02:56.000176 | Charlene | pythondev_help_Charlene_2018-01-21T09:02:56.000176 | 1,516,525,376.000176 | 30,192 |
pythondev | help | In order to solve the problem, you need to state them problem first | 2018-01-21T09:05:11.001090 | Aleida | pythondev_help_Aleida_2018-01-21T09:05:11.001090 | 1,516,525,511.00109 | 30,193 |
pythondev | help | yeah and not put an enormous example without a warning :smile: | 2018-01-21T09:05:15.000229 | Micki | pythondev_help_Micki_2018-01-21T09:05:15.000229 | 1,516,525,515.000229 | 30,194 |
pythondev | help | button_frame = Tk.Frame(root)
button_frame.pack(padx=0, pady=0)
button_frame.place(relx=0.5, rely=0.5, anchor=Tk.CENTER)
release_button = Tk.Button(button_frame, text=‘Release’, command=release)
release_button.pack(side=Tk.TOP)
refresh_button = Tk.Button(button_frame, text=‘Refresh’, command=lambda: regenerate_rectan... | 2018-01-21T13:30:39.000140 | Rea | pythondev_help_Rea_2018-01-21T13:30:39.000140 | 1,516,541,439.00014 | 30,195 |
pythondev | help | hey, does anyone know if there’s a good way to generate geographic equivalency tables using Python from geoJSON files? | 2018-01-21T15:06:12.000449 | Tisa | pythondev_help_Tisa_2018-01-21T15:06:12.000449 | 1,516,547,172.000449 | 30,196 |
pythondev | help | I have a bunch of geoJSON files for city neighborhoods, wards, precincts and want to find which of them intersect, and use that to generate an equivalency table | 2018-01-21T15:07:03.000773 | Tisa | pythondev_help_Tisa_2018-01-21T15:07:03.000773 | 1,516,547,223.000773 | 30,197 |
pythondev | help | E.g. Ward A intersects with precincts a, b, c, d, and neighborhoods x, y, z | 2018-01-21T15:07:23.000566 | Tisa | pythondev_help_Tisa_2018-01-21T15:07:23.000566 | 1,516,547,243.000566 | 30,198 |
pythondev | help | well, postgis for posgres can do that | 2018-01-21T15:20:05.000249 | Floy | pythondev_help_Floy_2018-01-21T15:20:05.000249 | 1,516,548,005.000249 | 30,199 |
pythondev | help | but you can look at the GEOS library if all you want to do is keep it in memory with polygos | 2018-01-21T15:20:24.000614 | Floy | pythondev_help_Floy_2018-01-21T15:20:24.000614 | 1,516,548,024.000614 | 30,200 |
pythondev | help | I’m using Shapely, which uses GEOS as its back-end. | 2018-01-21T15:20:39.000278 | Tisa | pythondev_help_Tisa_2018-01-21T15:20:39.000278 | 1,516,548,039.000278 | 30,201 |
pythondev | help | I just need to figure out how to do this efficiently - it’s ultimately an algorithmic problem. | 2018-01-21T15:20:56.000554 | Tisa | pythondev_help_Tisa_2018-01-21T15:20:56.000554 | 1,516,548,056.000554 | 30,202 |
pythondev | help | yeah | 2018-01-21T15:21:06.001034 | Floy | pythondev_help_Floy_2018-01-21T15:21:06.001034 | 1,516,548,066.001034 | 30,203 |
pythondev | help | and I think postgis already has those functions | 2018-01-21T15:21:16.000025 | Floy | pythondev_help_Floy_2018-01-21T15:21:16.000025 | 1,516,548,076.000025 | 30,204 |
pythondev | help | since you just need to run an intersection query | 2018-01-21T15:21:25.000052 | Floy | pythondev_help_Floy_2018-01-21T15:21:25.000052 | 1,516,548,085.000052 | 30,205 |
pythondev | help | Hmm. Is there a head-first tutorial for this I can try? | 2018-01-21T15:21:47.000525 | Tisa | pythondev_help_Tisa_2018-01-21T15:21:47.000525 | 1,516,548,107.000525 | 30,206 |
pythondev | help | I don’t know much about DBs, so I don’t know where to start. | 2018-01-21T15:22:03.000559 | Tisa | pythondev_help_Tisa_2018-01-21T15:22:03.000559 | 1,516,548,123.000559 | 30,207 |
pythondev | help | ouch, ok. that’s a complicating factor | 2018-01-21T15:22:18.000817 | Floy | pythondev_help_Floy_2018-01-21T15:22:18.000817 | 1,516,548,138.000817 | 30,208 |
pythondev | help | so.. how many polygons are we talking about here? | 2018-01-21T15:22:29.000822 | Floy | pythondev_help_Floy_2018-01-21T15:22:29.000822 | 1,516,548,149.000822 | 30,209 |
pythondev | help | order of thousands | 2018-01-21T15:22:34.001083 | Tisa | pythondev_help_Tisa_2018-01-21T15:22:34.001083 | 1,516,548,154.001083 | 30,210 |
pythondev | help | <https://data.cityofchicago.org/Facilities-Geographic-Boundaries/Precincts-current-/uvpq-qeeq> this is the precinct dataset we’re talking | 2018-01-21T15:22:58.001223 | Tisa | pythondev_help_Tisa_2018-01-21T15:22:58.001223 | 1,516,548,178.001223 | 30,211 |
pythondev | help | ah yea, then you definitely want a spatial database | 2018-01-21T15:23:04.000154 | Floy | pythondev_help_Floy_2018-01-21T15:23:04.000154 | 1,516,548,184.000154 | 30,212 |
pythondev | help | this is gonna end up in the backend for a web app | 2018-01-21T15:24:05.000100 | Tisa | pythondev_help_Tisa_2018-01-21T15:24:05.000100 | 1,516,548,245.0001 | 30,213 |
pythondev | help | we were considering using a MariaDB database | 2018-01-21T15:24:17.000169 | Tisa | pythondev_help_Tisa_2018-01-21T15:24:17.000169 | 1,516,548,257.000169 | 30,214 |
pythondev | help | No | 2018-01-21T15:24:21.000366 | Floy | pythondev_help_Floy_2018-01-21T15:24:21.000366 | 1,516,548,261.000366 | 30,215 |
pythondev | help | Postgres | 2018-01-21T15:24:25.000850 | Floy | pythondev_help_Floy_2018-01-21T15:24:25.000850 | 1,516,548,265.00085 | 30,216 |
pythondev | help | Postgis is the gold standard | 2018-01-21T15:24:35.000328 | Floy | pythondev_help_Floy_2018-01-21T15:24:35.000328 | 1,516,548,275.000328 | 30,217 |
pythondev | help | good to know, that will impact our decision for sure | 2018-01-21T15:24:44.000509 | Tisa | pythondev_help_Tisa_2018-01-21T15:24:44.000509 | 1,516,548,284.000509 | 30,218 |
pythondev | help | Mariadb and mysql are distant second | 2018-01-21T15:24:56.000725 | Floy | pythondev_help_Floy_2018-01-21T15:24:56.000725 | 1,516,548,296.000725 | 30,219 |
pythondev | help | In terms of spatial ability | 2018-01-21T15:25:17.000733 | Floy | pythondev_help_Floy_2018-01-21T15:25:17.000733 | 1,516,548,317.000733 | 30,220 |
pythondev | help | did not know that, this is very useful info that just saved our asses majorly | 2018-01-21T15:25:32.001190 | Tisa | pythondev_help_Tisa_2018-01-21T15:25:32.001190 | 1,516,548,332.00119 | 30,221 |
pythondev | help | What's the web app going to be written using on the server side? | 2018-01-21T15:26:10.000269 | Floy | pythondev_help_Floy_2018-01-21T15:26:10.000269 | 1,516,548,370.000269 | 30,222 |
pythondev | help | Django or flask? | 2018-01-21T15:26:20.000145 | Floy | pythondev_help_Floy_2018-01-21T15:26:20.000145 | 1,516,548,380.000145 | 30,223 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.