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 | You shouldn't exchange `repr`s of python objects and try to deserialize them; you should serialize objects in a sane manner (for example, using `json.dumps`) and exchange that instead | 2017-09-13T02:28:13.000211 | Collette | pythondev_help_Collette_2017-09-13T02:28:13.000211 | 1,505,269,693.000211 | 93,503 |
pythondev | help | I need to get the dict from jinja2 Template | 2017-09-13T02:32:36.000092 | Eustolia | pythondev_help_Eustolia_2017-09-13T02:32:36.000092 | 1,505,269,956.000092 | 93,504 |
pythondev | help | string -> json -> dict | 2017-09-13T02:32:52.000042 | Bruno | pythondev_help_Bruno_2017-09-13T02:32:52.000042 | 1,505,269,972.000042 | 93,505 |
pythondev | help | how this string convert to json? | 2017-09-13T02:34:22.000083 | Eustolia | pythondev_help_Eustolia_2017-09-13T02:34:22.000083 | 1,505,270,062.000083 | 93,506 |
pythondev | help | i am did it | 2017-09-13T02:38:21.000033 | Eustolia | pythondev_help_Eustolia_2017-09-13T02:38:21.000033 | 1,505,270,301.000033 | 93,507 |
pythondev | help | ```
>>> import json
>>> foo = '{"1018.2": [0, 0], "1009.2": [1, 1]}'
>>> type(foo)
<class 'str'>
>>> data = json.loads(foo)
>>> data
{'1018.2': [0, 0], '1009.2': [1, 1]}
>>> type(data)
<class 'dict'>
``` | 2017-09-13T02:38:23.000072 | Bruno | pythondev_help_Bruno_2017-09-13T02:38:23.000072 | 1,505,270,303.000072 | 93,508 |
pythondev | help | <@Eustolia> ^^ proper way | 2017-09-13T02:38:35.000111 | Bruno | pythondev_help_Bruno_2017-09-13T02:38:35.000111 | 1,505,270,315.000111 | 93,509 |
pythondev | help | im get code from this answer <https://stackoverflow.com/a/18178379/6108054> | 2017-09-13T02:38:54.000092 | Eustolia | pythondev_help_Eustolia_2017-09-13T02:38:54.000092 | 1,505,270,334.000092 | 93,510 |
pythondev | help | dont use eval | 2017-09-13T02:39:08.000088 | Bruno | pythondev_help_Bruno_2017-09-13T02:39:08.000088 | 1,505,270,348.000088 | 93,511 |
pythondev | help | if its a well formatted json, use `json.loads()` | 2017-09-13T02:39:27.000079 | Bruno | pythondev_help_Bruno_2017-09-13T02:39:27.000079 | 1,505,270,367.000079 | 93,512 |
pythondev | help | <@Collette> actually it could be argued that it's one of the goal of `__repr__`. <https://docs.python.org/3/reference/datamodel.html#object.__repr__> | 2017-09-13T02:39:28.000116 | Ciera | pythondev_help_Ciera_2017-09-13T02:39:28.000116 | 1,505,270,368.000116 | 93,513 |
pythondev | help | > Called by the repr() built-in function to compute the “official” string representation of an object. If at all possible, this should look like a valid Python expression that could be used to recreate an object with the same value (given an appropriate environment). If this is not possible, a string of the form <...some useful description...> should be returned. | 2017-09-13T02:39:39.000087 | Ciera | pythondev_help_Ciera_2017-09-13T02:39:39.000087 | 1,505,270,379.000087 | 93,514 |
pythondev | help | <@Eustolia> ok wait. i see | 2017-09-13T02:40:05.000157 | Bruno | pythondev_help_Bruno_2017-09-13T02:40:05.000157 | 1,505,270,405.000157 | 93,515 |
pythondev | help | <@Ciera> I've digged cpython hg repo in order to find the fact that this documentation section was added _before_ introducing `pickle` module... but I failed. Apparently `pickle` has been added in cpython v1.2, and there were no such section in the docs at the time. | 2017-09-13T03:39:22.000227 | Collette | pythondev_help_Collette_2017-09-13T03:39:22.000227 | 1,505,273,962.000227 | 93,516 |
pythondev | help | I think this is a bug in the docs - nobody should ever try to recreate an object using its `repr` | 2017-09-13T03:40:15.000023 | Collette | pythondev_help_Collette_2017-09-13T03:40:15.000023 | 1,505,274,015.000023 | 93,517 |
pythondev | help | <@Collette> :taco: for the research | 2017-09-13T03:40:35.000087 | Ciera | pythondev_help_Ciera_2017-09-13T03:40:35.000087 | 1,505,274,035.000087 | 93,518 |
pythondev | help | Yeah I wouldn't do it either. I was also quite surprise when I saw that in the doc | 2017-09-13T03:40:56.000118 | Ciera | pythondev_help_Ciera_2017-09-13T03:40:56.000118 | 1,505,274,056.000118 | 93,519 |
pythondev | help | which part of that doesn’t seem to be working? | 2017-09-13T03:47:27.000129 | Junita | pythondev_help_Junita_2017-09-13T03:47:27.000129 | 1,505,274,447.000129 | 93,520 |
pythondev | help | oh. oops. slack fail. that was in response to something that was apparently said forever ago. weird | 2017-09-13T03:47:50.000186 | Junita | pythondev_help_Junita_2017-09-13T03:47:50.000186 | 1,505,274,470.000186 | 93,521 |
pythondev | help | <@Ciera> that section was added between v1.3 and v1.5.2 - I can't be more specific because for some reason v1.3 < cpython < v1.5.2 has reference documentation in ms doc format instead of LaTeX :smile: | 2017-09-13T03:50:14.000191 | Collette | pythondev_help_Collette_2017-09-13T03:50:14.000191 | 1,505,274,614.000191 | 93,522 |
pythondev | help | must find who did that :smile: | 2017-09-13T03:51:12.000031 | Ciera | pythondev_help_Ciera_2017-09-13T03:51:12.000031 | 1,505,274,672.000031 | 93,523 |
pythondev | help | Can anyone help me optimize a function I have written? It really slows down when processing large 'length' values. (function in thread) | 2017-09-13T05:25:54.000036 | Gillian | pythondev_help_Gillian_2017-09-13T05:25:54.000036 | 1,505,280,354.000036 | 93,524 |
pythondev | help | ```
def answer(start, length):
#Ex start=0,length=3, iterable_line == [0,1,2]
iterable_line = map(lambda x: x+start, list(range(length)))
final_checksum = []
while len(iterable_line) > 0:
#performs XOR on each item in iterable_line, yielding a single value
checksum = reduce(lambda x,y: (int(bin(x),2)^int(bin(y),2)), iterable_line)
#that value is appended to final_checksum
final_checksum.append(checksum)
#then remove the last element from iterable line
iterable_line = iterable_line[:-1]
#add value of length to each element in iterable_line
iterable_line = map(lambda x: x+length, iterable_line)
#returns the XOR of captured values from all 'lines', a single int.
return reduce(lambda x,y: (int(bin(x),2)^int(bin(y),2)), final_checksum)
#To clarify, I am looking to capture the values to the left of the forward slash:
#ex: start = 0, length = 4
# 0 1 2 3 /
# 4 5 6 / 7
# 8 9 / 10 11
# 12 / 13 14 15
# /
``` | 2017-09-13T05:26:17.000425 | Gillian | pythondev_help_Gillian_2017-09-13T05:26:17.000425 | 1,505,280,377.000425 | 93,525 |
pythondev | help | I'm not entirely sure I understand what you are trying to do | 2017-09-13T05:29:12.000087 | Ciera | pythondev_help_Ciera_2017-09-13T05:29:12.000087 | 1,505,280,552.000087 | 93,526 |
pythondev | help | but it all looks unpythonic to me | 2017-09-13T05:29:22.000338 | Ciera | pythondev_help_Ciera_2017-09-13T05:29:22.000338 | 1,505,280,562.000338 | 93,527 |
pythondev | help | so there should be a way to optimize that :slightly_smiling_face: | 2017-09-13T05:29:34.000144 | Ciera | pythondev_help_Ciera_2017-09-13T05:29:34.000144 | 1,505,280,574.000144 | 93,528 |
pythondev | help | Ok, I can try to explain what I'm aiming for | 2017-09-13T05:29:47.000249 | Gillian | pythondev_help_Gillian_2017-09-13T05:29:47.000249 | 1,505,280,587.000249 | 93,529 |
pythondev | help | Hey guys. I've been working with Django and I want to learn more pure Python. Any simple projects in mind? | 2017-09-13T05:29:53.000160 | Felicita | pythondev_help_Felicita_2017-09-13T05:29:53.000160 | 1,505,280,593.00016 | 93,530 |
pythondev | help | the function returns a checksum of all captured numbers, using XOR | 2017-09-13T05:30:26.000241 | Gillian | pythondev_help_Gillian_2017-09-13T05:30:26.000241 | 1,505,280,626.000241 | 93,531 |
pythondev | help | the best is to find something useful for you. Maybe some thing you do everyday that you can automate ? | 2017-09-13T05:30:35.000160 | Ciera | pythondev_help_Ciera_2017-09-13T05:30:35.000160 | 1,505,280,635.00016 | 93,532 |
pythondev | help | I'm looking for a more efficient way to capture the values I want.
Currently generating a list, then trimming the list down one element at a time, really slows it down at larger values | 2017-09-13T05:31:56.000403 | Gillian | pythondev_help_Gillian_2017-09-13T05:31:56.000403 | 1,505,280,716.000403 | 93,533 |
pythondev | help | Yea that was what I was thinking but I don't know the limitations of what Python can do. For example one project idea I had in mind was creating an auto deploy system for my job but I'm not sure if Python is able to move files through ftp | 2017-09-13T05:32:02.000137 | Felicita | pythondev_help_Felicita_2017-09-13T05:32:02.000137 | 1,505,280,722.000137 | 93,534 |
pythondev | help | all captured number being 0, 1,2,3,4,5,6,8,9,12 ? | 2017-09-13T05:32:19.000215 | Ciera | pythondev_help_Ciera_2017-09-13T05:32:19.000215 | 1,505,280,739.000215 | 93,535 |
pythondev | help | yes, all elements from the first line, then 1 element less, per line | 2017-09-13T05:32:44.000321 | Gillian | pythondev_help_Gillian_2017-09-13T05:32:44.000321 | 1,505,280,764.000321 | 93,536 |
pythondev | help | > I don't know the limitations of what Python can do
Python can do everything :wink: | 2017-09-13T05:32:48.000146 | Ciera | pythondev_help_Ciera_2017-09-13T05:32:48.000146 | 1,505,280,768.000146 | 93,537 |
pythondev | help | As so I hear. Do you personally know how to go about that? I just need help with that part and I think I'll be good | 2017-09-13T05:34:02.000192 | Felicita | pythondev_help_Felicita_2017-09-13T05:34:02.000192 | 1,505,280,842.000192 | 93,538 |
pythondev | help | There’s a module for FTP: <https://docs.python.org/3/library/ftplib.html> | 2017-09-13T05:34:43.000270 | Junita | pythondev_help_Junita_2017-09-13T05:34:43.000270 | 1,505,280,883.00027 | 93,539 |
pythondev | help | tools like fabric are useful though for automating tasks like that | 2017-09-13T05:34:53.000188 | Junita | pythondev_help_Junita_2017-09-13T05:34:53.000188 | 1,505,280,893.000188 | 93,540 |
pythondev | help | I added the visual example because it seems to form a pattern, I'm looking to ignore: multiples of length < ignore < multiples of length -1 , but I can't figure out how to write a function for that | 2017-09-13T05:35:55.000111 | Gillian | pythondev_help_Gillian_2017-09-13T05:35:55.000111 | 1,505,280,955.000111 | 93,541 |
pythondev | help | Ah nice I think this is what I was looking for. Going to read more on this. Thanks man! | 2017-09-13T05:36:40.000328 | Felicita | pythondev_help_Felicita_2017-09-13T05:36:40.000328 | 1,505,281,000.000328 | 93,542 |
pythondev | help | other lengths follow the same pattern as well | 2017-09-13T05:36:43.000234 | Gillian | pythondev_help_Gillian_2017-09-13T05:36:43.000234 | 1,505,281,003.000234 | 93,543 |
pythondev | help | `range(start, stop)` could be useful for that | 2017-09-13T05:36:54.000190 | Ciera | pythondev_help_Ciera_2017-09-13T05:36:54.000190 | 1,505,281,014.00019 | 93,544 |
pythondev | help | start being the start of the line and stop (start + length - x) | 2017-09-13T05:37:24.000105 | Ciera | pythondev_help_Ciera_2017-09-13T05:37:24.000105 | 1,505,281,044.000105 | 93,545 |
pythondev | help | incrementing x by one for each line | 2017-09-13T05:37:36.000319 | Ciera | pythondev_help_Ciera_2017-09-13T05:37:36.000319 | 1,505,281,056.000319 | 93,546 |
pythondev | help | np. | 2017-09-13T05:37:38.000026 | Junita | pythondev_help_Junita_2017-09-13T05:37:38.000026 | 1,505,281,058.000026 | 93,547 |
pythondev | help | do you think that will be more efficient than list manipulation? I think it will, but I'm still learning | 2017-09-13T05:38:17.000093 | Gillian | pythondev_help_Gillian_2017-09-13T05:38:17.000093 | 1,505,281,097.000093 | 93,548 |
pythondev | help | ```
length = 4
start = 0
minus = 0
for _ in range(length):
for x in range(start, start + length - minus):
print(x)
minus += 1
start = x + minus
``` | 2017-09-13T05:45:11.000189 | Ciera | pythondev_help_Ciera_2017-09-13T05:45:11.000189 | 1,505,281,511.000189 | 93,549 |
pythondev | help | something like this will get you a list of the captured number | 2017-09-13T05:45:49.000093 | Ciera | pythondev_help_Ciera_2017-09-13T05:45:49.000093 | 1,505,281,549.000093 | 93,550 |
pythondev | help | nice, can you tell me why you used the underscore in `for _ in` ? that's the second time I've seen that | 2017-09-13T05:46:36.000216 | Gillian | pythondev_help_Gillian_2017-09-13T05:46:36.000216 | 1,505,281,596.000216 | 93,551 |
pythondev | help | in fact it can even be ```
length = 4
start = 0
for minus in range(length):
for x in range(start, start + length - minus):
print(x)
minus += 1
start = x + minus
``` | 2017-09-13T05:47:21.000098 | Ciera | pythondev_help_Ciera_2017-09-13T05:47:21.000098 | 1,505,281,641.000098 | 93,552 |
pythondev | help | `_` is a convention when you don't need to use the value | 2017-09-13T05:47:43.000243 | Ciera | pythondev_help_Ciera_2017-09-13T05:47:43.000243 | 1,505,281,663.000243 | 93,553 |
pythondev | help | I see, so I'm just iterating over the values | 2017-09-13T05:47:58.000182 | Gillian | pythondev_help_Gillian_2017-09-13T05:47:58.000182 | 1,505,281,678.000182 | 93,554 |
pythondev | help | Thanks for the help by the way, I really appreciate it | 2017-09-13T05:48:16.000321 | Gillian | pythondev_help_Gillian_2017-09-13T05:48:16.000321 | 1,505,281,696.000321 | 93,555 |
pythondev | help | no problem. Do you understand how the code works ? | 2017-09-13T05:48:42.000018 | Ciera | pythondev_help_Ciera_2017-09-13T05:48:42.000018 | 1,505,281,722.000018 | 93,556 |
pythondev | help | the first one I understand for sure, the second one is similar but I'll need a second look | 2017-09-13T05:49:02.000259 | Gillian | pythondev_help_Gillian_2017-09-13T05:49:02.000259 | 1,505,281,742.000259 | 93,557 |
pythondev | help | don't hesitate to put some more print in there to exactly see how everything interact | 2017-09-13T05:49:04.000388 | Ciera | pythondev_help_Ciera_2017-09-13T05:49:04.000388 | 1,505,281,744.000388 | 93,558 |
pythondev | help | yeah I'm going to test the code here in a moment | 2017-09-13T05:49:23.000290 | Gillian | pythondev_help_Gillian_2017-09-13T05:49:23.000290 | 1,505,281,763.00029 | 93,559 |
pythondev | help | but it makes sense | 2017-09-13T05:49:30.000020 | Gillian | pythondev_help_Gillian_2017-09-13T05:49:30.000020 | 1,505,281,770.00002 | 93,560 |
pythondev | help | and Python come with a lot of good tools in it and it's always better to use those than create lambda and stuff :slightly_smiling_face: | 2017-09-13T05:49:46.000224 | Ciera | pythondev_help_Ciera_2017-09-13T05:49:46.000224 | 1,505,281,786.000224 | 93,561 |
pythondev | help | this is actually the third or so iteration of the function I've made | 2017-09-13T05:50:07.000138 | Gillian | pythondev_help_Gillian_2017-09-13T05:50:07.000138 | 1,505,281,807.000138 | 93,562 |
pythondev | help | It's for a puzzle, but my submissions keep timing out | 2017-09-13T05:50:24.000072 | Gillian | pythondev_help_Gillian_2017-09-13T05:50:24.000072 | 1,505,281,824.000072 | 93,563 |
pythondev | help | it's by coding that you learn :wink: | 2017-09-13T05:50:27.000252 | Ciera | pythondev_help_Ciera_2017-09-13T05:50:27.000252 | 1,505,281,827.000252 | 93,564 |
pythondev | help | yeah, I love it | 2017-09-13T05:50:33.000022 | Gillian | pythondev_help_Gillian_2017-09-13T05:50:33.000022 | 1,505,281,833.000022 | 93,565 |
pythondev | help | so I'm trying to optimize it a bit more | 2017-09-13T05:50:50.000244 | Gillian | pythondev_help_Gillian_2017-09-13T05:50:50.000244 | 1,505,281,850.000244 | 93,566 |
pythondev | help | <@Felicita> I'd suggest ansible | 2017-09-13T05:55:01.000413 | Collette | pythondev_help_Collette_2017-09-13T05:55:01.000413 | 1,505,282,101.000413 | 93,567 |
pythondev | help | Hey lads, need abit help with this code. The code was originally writte for Pillow library and ImageGrab.grab, since the output had very bad fps i'm trying to rewrite it with mss library instead. | 2017-09-13T06:48:11.000015 | Shirl | pythondev_help_Shirl_2017-09-13T06:48:11.000015 | 1,505,285,291.000015 | 93,568 |
pythondev | help | (not only lads here) | 2017-09-13T06:48:32.000023 | Gabriele | pythondev_help_Gabriele_2017-09-13T06:48:32.000023 | 1,505,285,312.000023 | 93,569 |
pythondev | help | <@Gabriele> my apologies :slightly_smiling_face: | 2017-09-13T06:49:19.000195 | Shirl | pythondev_help_Shirl_2017-09-13T06:49:19.000195 | 1,505,285,359.000195 | 93,570 |
pythondev | help | the error i'm getting is
```
Warning (from warnings module):
File "C:\Users\maksim.FIRECOM\Desktop\opencv\grab_screen.py", line 41
x1 = (min_y-b) / m
RuntimeWarning: divide by zero encountered in double_scalars
Warning (from warnings module):
File "C:\Users\maksim.FIRECOM\Desktop\opencv\grab_screen.py", line 42
x2 = (max_y-b) / m
RuntimeWarning: divide by zero encountered in double_scalars
cannot convert float infinity to integer
'NoneType' object is not iterable
Traceback (most recent call last):
File "C:\Users\maksim.FIRECOM\Desktop\opencv\grab_screen.py", line 154, in <module>
cv2.imshow('OpenCV/Numpy grayscale', cv2.cvtColor(new_img, cv2.COLOR_BGRA2GRAY))
TypeError: src is not a numerical tuple
``` | 2017-09-13T06:51:25.000197 | Shirl | pythondev_help_Shirl_2017-09-13T06:51:25.000197 | 1,505,285,485.000197 | 93,571 |
pythondev | help | Original code : <https://github.com/Sentdex/pygta5/blob/master/Tutorial%20Codes/Part%201-7/part-7-self-driving-example.py>
MSS Implementation code:
<https://python-mss.readthedocs.io/en/latest/examples.html#opencv-numpy> | 2017-09-13T06:53:53.000019 | Shirl | pythondev_help_Shirl_2017-09-13T06:53:53.000019 | 1,505,285,633.000019 | 93,572 |
pythondev | help | Well, you'll want to start by fixing the first bit. Division by zero is never going to end well. Maybe the data you're pushing in to the `lstsq` function is invalid. | 2017-09-13T06:56:21.000147 | Gabriele | pythondev_help_Gabriele_2017-09-13T06:56:21.000147 | 1,505,285,781.000147 | 93,573 |
pythondev | help | Hmm I came up with this, but the interpreter is still telling me I've exceeded the time limit ```from itertools import imap
def answer(start, length):
def gen_raw(length):
range_start = 0
for minus in range(length):
for cap_this in range(range_start, range_start + length - minus):
yield cap_this
minus += 1
range_start = cap_this + minus
return reduce((lambda x,y: (int(bin(x),2)^int(bin(y),2))), (imap(lambda x: x+start, gen_raw(length)))) ``` | 2017-09-13T07:27:59.000138 | Gillian | pythondev_help_Gillian_2017-09-13T07:27:59.000138 | 1,505,287,679.000138 | 93,574 |
pythondev | help | the only reason I can think of is because of the nested 'for' loops | 2017-09-13T07:29:01.000063 | Gillian | pythondev_help_Gillian_2017-09-13T07:29:01.000063 | 1,505,287,741.000063 | 93,575 |
pythondev | help | I'm not exaclty sure hwat this does `reduce((lambda x,y: (int(bin(x),2)^int(bin(y),2))), (imap(lambda x: x+start, gen_raw(length)))) ` | 2017-09-13T07:32:29.000126 | Ciera | pythondev_help_Ciera_2017-09-13T07:32:29.000126 | 1,505,287,949.000126 | 93,576 |
pythondev | help | maybe there is a better solution for that part | 2017-09-13T07:32:40.000070 | Ciera | pythondev_help_Ciera_2017-09-13T07:32:40.000070 | 1,505,287,960.00007 | 93,577 |
pythondev | help | reduce takes a function and an iterable and performs the function on the iterables until only one remains | 2017-09-13T07:35:38.000185 | Gillian | pythondev_help_Gillian_2017-09-13T07:35:38.000185 | 1,505,288,138.000185 | 93,578 |
pythondev | help | int(bin(x),2)^int(bin(y),2) is performing XOR on the binary representations of x and y | 2017-09-13T07:36:25.000284 | Gillian | pythondev_help_Gillian_2017-09-13T07:36:25.000284 | 1,505,288,185.000284 | 93,579 |
pythondev | help | and the iterable is the second part, in two parts | 2017-09-13T07:36:48.000207 | Gillian | pythondev_help_Gillian_2017-09-13T07:36:48.000207 | 1,505,288,208.000207 | 93,580 |
pythondev | help | imap(lambda x: x+start is adding the value 'start' to each element of gen_raw(length) | 2017-09-13T07:37:22.000216 | Gillian | pythondev_help_Gillian_2017-09-13T07:37:22.000216 | 1,505,288,242.000216 | 93,581 |
pythondev | help | gen_raw(length) performs the function you helped me with earlier | 2017-09-13T07:37:33.000119 | Gillian | pythondev_help_Gillian_2017-09-13T07:37:33.000119 | 1,505,288,253.000119 | 93,582 |
pythondev | help | I'm not sure you need to do something like that | 2017-09-13T07:37:55.000101 | Ciera | pythondev_help_Ciera_2017-09-13T07:37:55.000101 | 1,505,288,275.000101 | 93,583 |
pythondev | help | perhaps I'm overthinking it | 2017-09-13T07:38:16.000045 | Gillian | pythondev_help_Gillian_2017-09-13T07:38:16.000045 | 1,505,288,296.000045 | 93,584 |
pythondev | help | you shouldn't really need to define a function either | 2017-09-13T07:38:16.000144 | Ciera | pythondev_help_Ciera_2017-09-13T07:38:16.000144 | 1,505,288,296.000144 | 93,585 |
pythondev | help | maybe I focused too much on cramming a bunch of stuff on that one line | 2017-09-13T07:38:48.000056 | Gillian | pythondev_help_Gillian_2017-09-13T07:38:48.000056 | 1,505,288,328.000056 | 93,586 |
pythondev | help | can you explain what are x and y ? | 2017-09-13T07:38:58.000134 | Ciera | pythondev_help_Ciera_2017-09-13T07:38:58.000134 | 1,505,288,338.000134 | 93,587 |
pythondev | help | x,y: is taking the first two different values generated from the iterator | 2017-09-13T07:39:42.000054 | Gillian | pythondev_help_Gillian_2017-09-13T07:39:42.000054 | 1,505,288,382.000054 | 93,588 |
pythondev | help | which it then turns into one value | 2017-09-13T07:39:51.000113 | Gillian | pythondev_help_Gillian_2017-09-13T07:39:51.000113 | 1,505,288,391.000113 | 93,589 |
pythondev | help | then when another is generated, it reduces that, compared with the previous value | 2017-09-13T07:40:23.000146 | Gillian | pythondev_help_Gillian_2017-09-13T07:40:23.000146 | 1,505,288,423.000146 | 93,590 |
pythondev | help | ok got it | 2017-09-13T07:40:24.000250 | Ciera | pythondev_help_Ciera_2017-09-13T07:40:24.000250 | 1,505,288,424.00025 | 93,591 |
pythondev | help | are you sure this is the way to calculate it ? | 2017-09-13T07:40:46.000322 | Ciera | pythondev_help_Ciera_2017-09-13T07:40:46.000322 | 1,505,288,446.000322 | 93,592 |
pythondev | help | to be honest there might be easier ways | 2017-09-13T07:40:56.000135 | Gillian | pythondev_help_Gillian_2017-09-13T07:40:56.000135 | 1,505,288,456.000135 | 93,593 |
pythondev | help | I didn't even know about XOR binary before this problem, like I understand the concept, but this method is what I came up with by putting a couple stackoverflow answers together | 2017-09-13T07:41:33.000149 | Gillian | pythondev_help_Gillian_2017-09-13T07:41:33.000149 | 1,505,288,493.000149 | 93,594 |
pythondev | help | so it's possible the delay is taking place there | 2017-09-13T07:42:00.000224 | Gillian | pythondev_help_Gillian_2017-09-13T07:42:00.000224 | 1,505,288,520.000224 | 93,595 |
pythondev | help | I'm not at all familiar with this stuff so idk | 2017-09-13T07:42:27.000122 | Ciera | pythondev_help_Ciera_2017-09-13T07:42:27.000122 | 1,505,288,547.000122 | 93,596 |
pythondev | help | but I couldn't find an easier way to do xor on two ints than by doing that | 2017-09-13T07:42:27.000131 | Gillian | pythondev_help_Gillian_2017-09-13T07:42:27.000131 | 1,505,288,547.000131 | 93,597 |
pythondev | help | sure, no worries | 2017-09-13T07:42:32.000078 | Gillian | pythondev_help_Gillian_2017-09-13T07:42:32.000078 | 1,505,288,552.000078 | 93,598 |
pythondev | help | it's a weird problem, I have 24 hours left to solve it | 2017-09-13T07:42:54.000259 | Gillian | pythondev_help_Gillian_2017-09-13T07:42:54.000259 | 1,505,288,574.000259 | 93,599 |
pythondev | help | maybe repost it in <#C07EFMZ1N|help> :slightly_smiling_face: | 2017-09-13T07:42:59.000079 | Ciera | pythondev_help_Ciera_2017-09-13T07:42:59.000079 | 1,505,288,579.000079 | 93,600 |
pythondev | help | might try reddit, then come back here later, thanks again for looking | 2017-09-13T07:43:24.000061 | Gillian | pythondev_help_Gillian_2017-09-13T07:43:24.000061 | 1,505,288,604.000061 | 93,601 |
pythondev | help | no problem | 2017-09-13T07:43:44.000201 | Ciera | pythondev_help_Ciera_2017-09-13T07:43:44.000201 | 1,505,288,624.000201 | 93,602 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.