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 you could imagine adding a new vertex would be closer to allocate(v) and append(v), where the append is amortized constant | 2019-03-15T15:23:22.780000 | Bethany | pythondev_help_Bethany_2019-03-15T15:23:22.780000 | 1,552,663,402.78 | 13,721 |
pythondev | help | then | 2019-03-15T15:23:25.780100 | Lynelle | pythondev_help_Lynelle_2019-03-15T15:23:25.780100 | 1,552,663,405.7801 | 13,722 |
pythondev | help | `list.append([0,0,0,1,0])` | 2019-03-15T15:23:48.780400 | Lynelle | pythondev_help_Lynelle_2019-03-15T15:23:48.780400 | 1,552,663,428.7804 | 13,723 |
pythondev | help | where did you get list? | 2019-03-15T15:25:26.781500 | Clemmie | pythondev_help_Clemmie_2019-03-15T15:25:26.781500 | 1,552,663,526.7815 | 13,724 |
pythondev | help | it's just the entire list | 2019-03-15T15:25:47.781700 | Lynelle | pythondev_help_Lynelle_2019-03-15T15:25:47.781700 | 1,552,663,547.7817 | 13,725 |
pythondev | help | first step is adding a 0 or 1 to the end of each row | 2019-03-15T15:26:06.782200 | Lynelle | pythondev_help_Lynelle_2019-03-15T15:26:06.782200 | 1,552,663,566.7822 | 13,726 |
pythondev | help | second step is appending a list - basically the last row of the 2d array | 2019-03-15T15:26:22.782500 | Lynelle | pythondev_help_Lynelle_2019-03-15T15:26:22.782500 | 1,552,663,582.7825 | 13,727 |
pythondev | help | Did you see this discussion on Stack Exchange - <https://softwareengineering.stackexchange.com/questions/297730/why-adding-a-vertex-in-a-graph-represented-using-an-adjacency-matrix-takes-ov> | 2019-03-15T15:26:44.782700 | Clemmie | pythondev_help_Clemmie_2019-03-15T15:26:44.782700 | 1,552,663,604.7827 | 13,728 |
pythondev | help | yep | 2019-03-15T15:27:07.783100 | Lynelle | pythondev_help_Lynelle_2019-03-15T15:27:07.783100 | 1,552,663,627.7831 | 13,729 |
pythondev | help | there's another SO thread that says it's implementation dependent | 2019-03-15T15:27:18.783300 | Lynelle | pythondev_help_Lynelle_2019-03-15T15:27:18.783300 | 1,552,663,638.7833 | 13,730 |
pythondev | help | in a 2d array list of lists in python, we don't have to re-allocate the entire thing | 2019-03-15T15:27:45.783500 | Lynelle | pythondev_help_Lynelle_2019-03-15T15:27:45.783500 | 1,552,663,665.7835 | 13,731 |
pythondev | help | Right - that looks like the canonical algorithm is v^2, but fairly simple to do better | 2019-03-15T15:27:48.783700 | Clemmie | pythondev_help_Clemmie_2019-03-15T15:27:48.783700 | 1,552,663,668.7837 | 13,732 |
pythondev | help | yeah depending on growth schemes and memory allocators its different | 2019-03-15T15:27:50.784000 | Bethany | pythondev_help_Bethany_2019-03-15T15:27:50.784000 | 1,552,663,670.784 | 13,733 |
pythondev | help | thanks guys! | 2019-03-15T15:28:14.784400 | Lynelle | pythondev_help_Lynelle_2019-03-15T15:28:14.784400 | 1,552,663,694.7844 | 13,734 |
pythondev | help | are your edges directed? | 2019-03-15T15:28:21.784600 | Bethany | pythondev_help_Bethany_2019-03-15T15:28:21.784600 | 1,552,663,701.7846 | 13,735 |
pythondev | help | in that green picture i posted - I guess they would be - 0 points to 1, and 1 points to 0 | 2019-03-15T15:28:54.784800 | Lynelle | pythondev_help_Lynelle_2019-03-15T15:28:54.784800 | 1,552,663,734.7848 | 13,736 |
pythondev | help | So it's symmetric matrix if that's always the case | 2019-03-15T15:30:11.785000 | Bethany | pythondev_help_Bethany_2019-03-15T15:30:11.785000 | 1,552,663,811.785 | 13,737 |
pythondev | help | Or undirected | 2019-03-15T15:30:21.785200 | Bethany | pythondev_help_Bethany_2019-03-15T15:30:21.785200 | 1,552,663,821.7852 | 13,738 |
pythondev | help | I could see using a dict of 1d arrays | 2019-03-15T15:32:58.785400 | Lynelle | pythondev_help_Lynelle_2019-03-15T15:32:58.785400 | 1,552,663,978.7854 | 13,739 |
pythondev | help | kind of like an adjacency list | 2019-03-15T15:33:04.785600 | Lynelle | pythondev_help_Lynelle_2019-03-15T15:33:04.785600 | 1,552,663,984.7856 | 13,740 |
pythondev | help | Also, if you know how many nodes exist ahead of time, or even a guess you can always pre-allocate | 2019-03-15T15:37:22.785800 | Bethany | pythondev_help_Bethany_2019-03-15T15:37:22.785800 | 1,552,664,242.7858 | 13,741 |
pythondev | help | Hi All! | 2019-03-15T15:41:44.786200 | Freeda | pythondev_help_Freeda_2019-03-15T15:41:44.786200 | 1,552,664,504.7862 | 13,742 |
pythondev | help | quick question, anybody ever work with the NHL API? | 2019-03-15T15:41:58.786500 | Freeda | pythondev_help_Freeda_2019-03-15T15:41:58.786500 | 1,552,664,518.7865 | 13,743 |
pythondev | help | I've never faced off with it | 2019-03-15T15:49:34.787200 | Joette | pythondev_help_Joette_2019-03-15T15:49:34.787200 | 1,552,664,974.7872 | 13,744 |
pythondev | help | None | 2019-03-15T15:51:14.787400 | Leana | pythondev_help_Leana_2019-03-15T15:51:14.787400 | 1,552,665,074.7874 | 13,745 |
pythondev | help | :slightly_smiling_face: | 2019-03-15T15:51:18.787600 | Clemmie | pythondev_help_Clemmie_2019-03-15T15:51:18.787600 | 1,552,665,078.7876 | 13,746 |
pythondev | help | `Hashable` is not a *type*, it’s more of a *trait* | 2019-03-15T15:52:55.788400 | Jonas | pythondev_help_Jonas_2019-03-15T15:52:55.788400 | 1,552,665,175.7884 | 13,747 |
pythondev | help | I'm here to give helpful answers and make dad jokes and I'm all out of helpful answers | 2019-03-15T15:52:56.788600 | Joette | pythondev_help_Joette_2019-03-15T15:52:56.788600 | 1,552,665,176.7886 | 13,748 |
pythondev | help | it’s not a *thing* | 2019-03-15T15:53:02.788700 | Jonas | pythondev_help_Jonas_2019-03-15T15:53:02.788700 | 1,552,665,182.7887 | 13,749 |
pythondev | help | Got any gum? | 2019-03-15T15:53:11.789000 | Clemmie | pythondev_help_Clemmie_2019-03-15T15:53:11.789000 | 1,552,665,191.789 | 13,750 |
pythondev | help | anything that *has* a `__hash__` method *is a Hashable* | 2019-03-15T15:53:14.789100 | Jonas | pythondev_help_Jonas_2019-03-15T15:53:14.789100 | 1,552,665,194.7891 | 13,751 |
pythondev | help | `isinstance("hello world", Hashable) == True` | 2019-03-15T15:53:31.789300 | Jonas | pythondev_help_Jonas_2019-03-15T15:53:31.789300 | 1,552,665,211.7893 | 13,752 |
pythondev | help | Yes, I understand. If I have some object that is Hashable, I want to override its `__hash__` method. | 2019-03-15T15:54:03.789600 | Cammie | pythondev_help_Cammie_2019-03-15T15:54:03.789600 | 1,552,665,243.7896 | 13,753 |
pythondev | help | I have been unable to do this | 2019-03-15T15:54:09.789800 | Cammie | pythondev_help_Cammie_2019-03-15T15:54:09.789800 | 1,552,665,249.7898 | 13,754 |
pythondev | help | _this is for educational, illustrative purposes. I’ve effectively trying to monkey patch here_ | 2019-03-15T15:54:21.790000 | Cammie | pythondev_help_Cammie_2019-03-15T15:54:21.790000 | 1,552,665,261.79 | 13,755 |
pythondev | help | ```class YourCustomObject(TheObjectYouWantToOverride):
def __hash__(self):
...``` | 2019-03-15T15:54:38.790200 | Jonas | pythondev_help_Jonas_2019-03-15T15:54:38.790200 | 1,552,665,278.7902 | 13,756 |
pythondev | help | should do the thing | 2019-03-15T15:54:42.790400 | Jonas | pythondev_help_Jonas_2019-03-15T15:54:42.790400 | 1,552,665,282.7904 | 13,757 |
pythondev | help | you can’t override a __hash__ method of an existing type | 2019-03-15T15:54:57.790600 | Jonas | pythondev_help_Jonas_2019-03-15T15:54:57.790600 | 1,552,665,297.7906 | 13,758 |
pythondev | help | for example, you can’t modify the `__hash__` of a tuple or a string | 2019-03-15T15:55:09.790800 | Jonas | pythondev_help_Jonas_2019-03-15T15:55:09.790800 | 1,552,665,309.7908 | 13,759 |
pythondev | help | you _can_ with monkey patching only for pure-python objects (i.e not builtins), but it’s hard because it’s not something you really need or want to do | 2019-03-15T15:55:35.791000 | Jonas | pythondev_help_Jonas_2019-03-15T15:55:35.791000 | 1,552,665,335.791 | 13,760 |
pythondev | help | Okay. Makes sense. I’ll try that extension method you’ve shown. Thank you | 2019-03-15T15:56:03.791300 | Cammie | pythondev_help_Cammie_2019-03-15T15:56:03.791300 | 1,552,665,363.7913 | 13,761 |
pythondev | help | Great idea! <@Jonas> :taco: | 2019-03-15T15:56:09.791500 | Cammie | pythondev_help_Cammie_2019-03-15T15:56:09.791500 | 1,552,665,369.7915 | 13,762 |
pythondev | help | none of that either ¯\_(ツ)_/¯ | 2019-03-15T15:57:51.791900 | Joette | pythondev_help_Joette_2019-03-15T15:57:51.791900 | 1,552,665,471.7919 | 13,763 |
pythondev | help | Assuming pandas uses the Re module. Is there a way for .str.match to use the regex module instead? | 2019-03-15T17:21:31.794300 | Janay | pythondev_help_Janay_2019-03-15T17:21:31.794300 | 1,552,670,491.7943 | 13,764 |
pythondev | help | .apply probably | 2019-03-15T17:56:09.795200 | Bethany | pythondev_help_Bethany_2019-03-15T17:56:09.795200 | 1,552,672,569.7952 | 13,765 |
pythondev | help | hi everyone, I have a bit of a frustrating situation. I’m using python3.7, and simply trying to read hexidecimal string, perform an XOR on each byte, and get the resulting character that produces:
```a = '4f0a'
for i in range(0,4,2):
chr(ord(binascii.unhexlify(a[i:2])) ^ 0x2a)``` | 2019-03-15T18:54:14.798400 | Virgie | pythondev_help_Virgie_2019-03-15T18:54:14.798400 | 1,552,676,054.7984 | 13,766 |
pythondev | help | but no matter what I try, the ‘0a’ portion is interpreted as a newline, and python throws an error | 2019-03-15T18:54:42.799100 | Virgie | pythondev_help_Virgie_2019-03-15T18:54:42.799100 | 1,552,676,082.7991 | 13,767 |
pythondev | help | I’ve tried parsing in different ways, I’ve tried converting the values into something else, such as using int, but I always end up with an error due to the ‘0a’ value being interpreted as a newline | 2019-03-15T18:57:36.800300 | Virgie | pythondev_help_Virgie_2019-03-15T18:57:36.800300 | 1,552,676,256.8003 | 13,768 |
pythondev | help | It is a newline, though. What is the error? | 2019-03-15T18:57:58.801000 | Sasha | pythondev_help_Sasha_2019-03-15T18:57:58.801000 | 1,552,676,278.801 | 13,769 |
pythondev | help | so, for the command I have inside the loop, it throws `TypeError: ord() expected a character, but string of length 0 found` | 2019-03-15T18:58:43.801800 | Virgie | pythondev_help_Virgie_2019-03-15T18:58:43.801800 | 1,552,676,323.8018 | 13,770 |
pythondev | help | Oh, I see. You want `a[i:i+2]`. | 2019-03-15T18:59:08.802500 | Sasha | pythondev_help_Sasha_2019-03-15T18:59:08.802500 | 1,552,676,348.8025 | 13,771 |
pythondev | help | if I use something int(), it throws `ValueError: invalid literal for int() with base 16: ''` | 2019-03-15T18:59:16.802800 | Virgie | pythondev_help_Virgie_2019-03-15T18:59:16.802800 | 1,552,676,356.8028 | 13,772 |
pythondev | help | ………………….. | 2019-03-15T18:59:26.803000 | Virgie | pythondev_help_Virgie_2019-03-15T18:59:26.803000 | 1,552,676,366.803 | 13,773 |
pythondev | help | sigh | 2019-03-15T19:00:07.803200 | Virgie | pythondev_help_Virgie_2019-03-15T19:00:07.803200 | 1,552,676,407.8032 | 13,774 |
pythondev | help | yes | 2019-03-15T19:00:29.803600 | Virgie | pythondev_help_Virgie_2019-03-15T19:00:29.803600 | 1,552,676,429.8036 | 13,775 |
pythondev | help | haha | 2019-03-15T19:00:30.803800 | Virgie | pythondev_help_Virgie_2019-03-15T19:00:30.803800 | 1,552,676,430.8038 | 13,776 |
pythondev | help | THANK YOU :slightly_smiling_face: | 2019-03-15T19:00:35.804000 | Virgie | pythondev_help_Virgie_2019-03-15T19:00:35.804000 | 1,552,676,435.804 | 13,777 |
pythondev | help | No prob. Just needed another set of eyes. | 2019-03-15T19:00:44.804300 | Sasha | pythondev_help_Sasha_2019-03-15T19:00:44.804300 | 1,552,676,444.8043 | 13,778 |
pythondev | help | seriously, I really appreciate the help! can’t believe I missed that :facepalm: | 2019-03-15T19:01:48.805100 | Virgie | pythondev_help_Virgie_2019-03-15T19:01:48.805100 | 1,552,676,508.8051 | 13,779 |
pythondev | help | anyone communicate over bitbus with python? | 2019-03-15T20:09:17.805500 | Priscilla | pythondev_help_Priscilla_2019-03-15T20:09:17.805500 | 1,552,680,557.8055 | 13,780 |
pythondev | help | that was my first thought as well, but was hoping for something like df[col].str.match(expression, engine = regex) | 2019-03-15T20:43:02.805600 | Janay | pythondev_help_Janay_2019-03-15T20:43:02.805600 | 1,552,682,582.8056 | 13,781 |
pythondev | help | Not that specifically, but I have used other embedded wire protocols. | 2019-03-15T20:46:23.806400 | Sasha | pythondev_help_Sasha_2019-03-15T20:46:23.806400 | 1,552,682,783.8064 | 13,782 |
pythondev | help | could you point me to some resources? | 2019-03-15T20:59:04.806700 | Priscilla | pythondev_help_Priscilla_2019-03-15T20:59:04.806700 | 1,552,683,544.8067 | 13,783 |
pythondev | help | anything helps :slightly_smiling_face: | 2019-03-15T20:59:15.807000 | Priscilla | pythondev_help_Priscilla_2019-03-15T20:59:15.807000 | 1,552,683,555.807 | 13,784 |
pythondev | help | Heh, I'd just be Googling things for you. Do you know what hardware you have to interface to? The Python interface would likely be to that thing rather than raw bus logic. | 2019-03-15T21:04:13.808300 | Sasha | pythondev_help_Sasha_2019-03-15T21:04:13.808300 | 1,552,683,853.8083 | 13,785 |
pythondev | help | rs232 to bitbus, the rest of the hardware is designed and built by the company i work for | 2019-03-15T21:32:08.809100 | Priscilla | pythondev_help_Priscilla_2019-03-15T21:32:08.809100 | 1,552,685,528.8091 | 13,786 |
pythondev | help | that is not helpful, i apologize lol | 2019-03-15T21:34:22.810800 | Priscilla | pythondev_help_Priscilla_2019-03-15T21:34:22.810800 | 1,552,685,662.8108 | 13,787 |
pythondev | help | you know what, i dont think i have all the information i need to build this.. Thanks for all your help EdKeyes! :smile: | 2019-03-15T21:35:52.812000 | Priscilla | pythondev_help_Priscilla_2019-03-15T21:35:52.812000 | 1,552,685,752.812 | 13,788 |
pythondev | help | Nope just dug around the source code. You could possibly mock a function in the library but you're better off with apply probably | 2019-03-15T22:55:08.813000 | Bethany | pythondev_help_Bethany_2019-03-15T22:55:08.813000 | 1,552,690,508.813 | 13,789 |
pythondev | help | I am trying to implement this <https://github.com/davidsandberg/facenet/wiki/Validate-on-lfw> ( A thread) | 2019-03-16T06:31:03.816900 | Jewel | pythondev_help_Jewel_2019-03-16T06:31:03.816900 | 1,552,717,863.8169 | 13,790 |
pythondev | help | I need to know that in the below code , what is ~/datasets/lfw/lfw_mtcnnpy_160 \ line doing???
for N in {1..4}; do \
python src/align/align_dataset_mtcnn.py \
~/datasets/lfw/raw \
~/datasets/lfw/lfw_mtcnnpy_160 \
--image_size 160 \
--margin 32 \
--random_order \
--gpu_memory_fraction 0.25 \
& done | 2019-03-16T06:34:39.817300 | Jewel | pythondev_help_Jewel_2019-03-16T06:34:39.817300 | 1,552,718,079.8173 | 13,791 |
pythondev | help | ```for N in range(1,4):
!python src\\align\\align_dataset_mtcnn.pyC:\\Users\\SnehaR\\Desktop\\miniproject\\datasets\\lfw
C:\\Users\\SnehaR\\Desktop\\miniproject\\datasets\\lfw\\lfw_mtcnnpy_160
--image_size 160
--margin 32
--random order```
This is how I am running this in python | 2019-03-16T06:38:05.817600 | Jewel | pythondev_help_Jewel_2019-03-16T06:38:05.817600 | 1,552,718,285.8176 | 13,792 |
pythondev | help | Does anyone have any thoughts where I would start if I want to compare two near identical images for things like differences in specific colors? Use case is: in Australia our weather bureau publishes near-real-time weather radar images that represent storm activity as pixels overlaid on a map. Severe storm cells are re... | 2019-03-16T08:42:21.824000 | Chuck | pythondev_help_Chuck_2019-03-16T08:42:21.824000 | 1,552,725,741.824 | 13,793 |
pythondev | help | I believe Pillow is the image processing library for Python. I’ve used it for steganography in the past, for such things like you’re describing. <https://pillow.readthedocs.io/en/stable/> | 2019-03-16T08:44:32.825000 | Virgie | pythondev_help_Virgie_2019-03-16T08:44:32.825000 | 1,552,725,872.825 | 13,794 |
pythondev | help | not sure if it’ll meet your needs, but it’s a start | 2019-03-16T08:45:09.825400 | Virgie | pythondev_help_Virgie_2019-03-16T08:45:09.825400 | 1,552,725,909.8254 | 13,795 |
pythondev | help | Thanks <@Virgie>, I'll look into it | 2019-03-16T09:09:02.826100 | Chuck | pythondev_help_Chuck_2019-03-16T09:09:02.826100 | 1,552,727,342.8261 | 13,796 |
pythondev | help | <@Chuck> you don’t need to bring in Pillow for this, since you can use numpy/scipy | 2019-03-16T09:36:54.827800 | Hiroko | pythondev_help_Hiroko_2019-03-16T09:36:54.827800 | 1,552,729,014.8278 | 13,797 |
pythondev | help | <http://scipy-lectures.org/advanced/image_processing/> | 2019-03-16T09:36:54.828000 | Hiroko | pythondev_help_Hiroko_2019-03-16T09:36:54.828000 | 1,552,729,014.828 | 13,798 |
pythondev | help | an alternative option | 2019-03-16T09:36:59.828200 | Hiroko | pythondev_help_Hiroko_2019-03-16T09:36:59.828200 | 1,552,729,019.8282 | 13,799 |
pythondev | help | Can anyone let me know how to move the value of `i` to next row continously
```import xlwings as xw
import time
def test():
wb = xw.Book('temp.xlsx')
sht = wb.sheets['Sheet1']
sht.range('A1').value = 'Foo 1 new'
i=1
while i>0:
sht.range('A2').value = i
i=i+1
test()
``` | 2019-03-16T09:38:24.829200 | Chad | pythondev_help_Chad_2019-03-16T09:38:24.829200 | 1,552,729,104.8292 | 13,800 |
pythondev | help | ```while True:
sht.range(f'A{i}').value = i
i += 1
``` | 2019-03-16T09:50:10.830700 | Hiroko | pythondev_help_Hiroko_2019-03-16T09:50:10.830700 | 1,552,729,810.8307 | 13,801 |
pythondev | help | assuming you’re using python 3.6 | 2019-03-16T09:53:59.831300 | Hiroko | pythondev_help_Hiroko_2019-03-16T09:53:59.831300 | 1,552,730,039.8313 | 13,802 |
pythondev | help | <@Hiroko> Thank You buddy it worked
but want to know what is `(f'A{i}')` for? | 2019-03-16T09:54:28.831700 | Chad | pythondev_help_Chad_2019-03-16T09:54:28.831700 | 1,552,730,068.8317 | 13,803 |
pythondev | help | yes I am using 3.6 | 2019-03-16T09:54:44.832000 | Chad | pythondev_help_Chad_2019-03-16T09:54:44.832000 | 1,552,730,084.832 | 13,804 |
pythondev | help | <https://realpython.com/python-f-strings/> | 2019-03-16T09:57:15.832600 | Hiroko | pythondev_help_Hiroko_2019-03-16T09:57:15.832600 | 1,552,730,235.8326 | 13,805 |
pythondev | help | you’re dynamically building the string for the row based on the current index value of the loop | 2019-03-16T09:57:44.833200 | Hiroko | pythondev_help_Hiroko_2019-03-16T09:57:44.833200 | 1,552,730,264.8332 | 13,806 |
pythondev | help | <@Hiroko> Great Jason I now understand the concept
Thank You for the help Buddy:smile: | 2019-03-16T09:59:56.834200 | Chad | pythondev_help_Chad_2019-03-16T09:59:56.834200 | 1,552,730,396.8342 | 13,807 |
pythondev | help | :thumbsup: | 2019-03-16T10:16:18.835200 | Hiroko | pythondev_help_Hiroko_2019-03-16T10:16:18.835200 | 1,552,731,378.8352 | 13,808 |
pythondev | help | So, it seems I can't install any libraries with pip. Keep getting the error `No matching distribution found for [pacakge]`, anyone know how to fix this? (I'm also currently googling, but I think I tried previously and couldn't fix it) | 2019-03-16T11:03:28.837600 | Ursula | pythondev_help_Ursula_2019-03-16T11:03:28.837600 | 1,552,734,208.8376 | 13,809 |
pythondev | help | So, I fixed the issue with the answer in the link, I must have did a bad job googling before if I fixed it so quick :sweat_smile:
<https://stackoverflow.com/questions/49748063/pip-install-fails-for-every-package-could-not-find-a-version-that-satisfies> | 2019-03-16T11:06:23.838700 | Ursula | pythondev_help_Ursula_2019-03-16T11:06:23.838700 | 1,552,734,383.8387 | 13,810 |
pythondev | help | hi willa75
could you share the screenshot of your screen for better understanding of error? | 2019-03-16T11:17:55.839800 | Rhona | pythondev_help_Rhona_2019-03-16T11:17:55.839800 | 1,552,735,075.8398 | 13,811 |
pythondev | help | <@Rhona> hey, I ended up fixing the error by reinstalling pip, thanks for trying to help me though | 2019-03-16T11:58:32.840000 | Ursula | pythondev_help_Ursula_2019-03-16T11:58:32.840000 | 1,552,737,512.84 | 13,812 |
pythondev | help | <@Joanne> no problem | 2019-03-16T12:00:50.840200 | Rhona | pythondev_help_Rhona_2019-03-16T12:00:50.840200 | 1,552,737,650.8402 | 13,813 |
pythondev | help | <@Melynda> Yeah. the key is fine. Actually, I got the issue sorted! Thanks for your inputs! :gavel_parrot::ubuntu: | 2019-03-16T12:14:20.840400 | Elmo | pythondev_help_Elmo_2019-03-16T12:14:20.840400 | 1,552,738,460.8404 | 13,814 |
pythondev | help | i want to install my pip packages into specific directory, so i can copy them during multi stage docker build | 2019-03-16T19:30:43.842400 | Mckinley | pythondev_help_Mckinley_2019-03-16T19:30:43.842400 | 1,552,764,643.8424 | 13,815 |
pythondev | help | i found this post <https://blog.realkinetic.com/building-minimal-docker-containers-for-python-applications-37d0272c52f3> | 2019-03-16T19:31:07.842700 | Mckinley | pythondev_help_Mckinley_2019-03-16T19:31:07.842700 | 1,552,764,667.8427 | 13,816 |
pythondev | help | but i have one problematic dependency `django-push-notifications==1.6.0` | 2019-03-16T19:31:34.843400 | Mckinley | pythondev_help_Mckinley_2019-03-16T19:31:34.843400 | 1,552,764,694.8434 | 13,817 |
pythondev | help | it can not be installed with `--install-option="--prefix=/install"` | 2019-03-16T19:32:10.843900 | Mckinley | pythondev_help_Mckinley_2019-03-16T19:32:10.843900 | 1,552,764,730.8439 | 13,818 |
pythondev | help | i'm getting ` UserWarning: Disabling all use of wheels due to the use of --build-options / --global-options / --install-options.` warning from pip and the newest version pip can found for that package is `1.4.1` | 2019-03-16T19:32:45.844500 | Mckinley | pythondev_help_Mckinley_2019-03-16T19:32:45.844500 | 1,552,764,765.8445 | 13,819 |
pythondev | help | i downgraded it tested again, but this time i'm getting `ModuleNotFoundError: No module named 'setuptools'` error during build | 2019-03-16T19:33:21.845100 | Mckinley | pythondev_help_Mckinley_2019-03-16T19:33:21.845100 | 1,552,764,801.8451 | 13,820 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.