I would usually do
user_input = None
while user_input != 'exit':
user_input = input()
...
#voice-chat-text-0
rugged root
Actually just realized I do the while True way more often
somber heath
@raw panther👋
rugged root
For the ones that are always trying to be overly accommodating: SIMP cards
whole bear
FFS, my internet is just ...
rugged root
Craptacular?
willow light
in my experience, the best use for walrus so far has been
NYC = ZoneInfo("America/New_York")
print(dt:=datetime.now(tz=NYC), dt.tzinfo)
for debugging
Although I only did it that way to force the rest of my team to update Python (the jenkins servers are still running 3.7)
stuck furnace
👋
somber heath
Although I only did it that way to force the rest of my team to update Python (t...
Ha!
willow light
Because I conveniently "forgot" to include documentation explaining ZoneInfo and := to the rest of the team.
I like ZoneInfo, no more pip install pytz
stuck furnace
@blazing beacon This looks pretty good: https://www.imdb.com/title/tt3532216/
Currently on netflix uk
Lowercase SQL 
You can actually write it without getting RSI
blazing beacon
Oh yeah, i already know that one xD
stuck furnace
New rule 🎉
somber heath
I noticed.
willow light
New rule 🎉
oh man #python-discussion is going to !rule 10 every other message
willow light
Curves for no apparent reason
"Let's cut down the trees along the river, what's the worst that could happen."
Jeeps in their natural habitat.
somber smelt
I forgot I still had this
matlab?
somber smelt
textbook had matlab exercises
first time accualy seeing someone use it
willow light
u being "east-west component of the wind velocity"
v being "north-south component of the wind velocity"
willow light
????
somber heath
There's also a limit to how much D your body can uptake.
Like how they say when you take pills and you're not deficient, you're basically just making your urine more expensive.
Though it does say on my bottle that something in the range of 4000IU might be the extreme upper daily limit
willow light
Eh, who even needs matching socks anyway?
rugged root
!stream 95175136319115264
wise cargoBOT
✅ @whole bear can now stream until <t:1679415708:f>.
lucid blade
@pure elk welcome dude 🙂
pure elk
heya @lucid blade
how's it goin?
rugged root
Yo crab
pure elk
heya Hemlock!
rugged root
How goes it
unborn storm
Eh, who even needs matching socks anyway?
these are matching, not in colors, but in the general theme...
but it is pretty indeed.
unborn storm
I forgot I still had this
Matlab is... sad.
There is a better replacement for every aspect of it, and i guess that the only advantage of it is that, because it is widely used, it has integration with physical sensors and actuators, but a good python library for that would probably be much better.
gentle flint
ascii art on a typewriter
leaden plinth
Hello, I joined long time ago actually I don't remember when but I was not active on the server
stray swan
is anybody good with blender python scripting?
i have a working script that ties emptys to vertecies now i just need the empties to apply "Follow Constraints" to bones in a loop.
thats it.
man the world just hates me 😭
pure elk
How goes it
could be better, could be worse. how are you?
sry for the late reply
xp = best windows besides 95
rugged root
Good enough. Had far too much coffee
@mild quartz The best part? You get to go to sleep with that thought/ mental image
stuck furnace
sharp urchin
anyone here uses a UPS by any chance?
ohh nicee
so may i ask a question
is 1000VA enough for a gaming pc to run for like 5-10 mins?
rugged root
VA doesn't dictate amount of time
sharp urchin
i do know that
but it does tells the capacity
for which i am asking
on web some says it can run for like 15 mins
some says only 1-2 mins
i need it for only 5mins....will 1000va be fine?
lmao nahh..
gentle flint
VA doesn't dictate amount of time
for a ups?
sharp urchin
thts why i mentioned a gaming pc
gentle flint
gaming pcs wildly differ in specs and power consumption
sharp urchin
at least a 3mins backup is what i expect
sharp urchin
at least a 3mins backup is what i expect
this..
knotty dome
def power(x, y=2):
r = 1
for i in range(y):
r = r * x
return r
print(power(3), power(3, 3))
gentle flint
calculate how much power your pc uses and do the maths
sharp urchin
calculate how much power your pc uses and do the maths
bad at it ...plus dont know ..:\
nvmm i will figure it out tyy
sharp urchin
ty
gentle flint
np
gentle flint
knotty dome
thanks
sharp urchin
yeh
knotty dome
knotty dome
sharp urchin
yes
knotty dome
okay
rugged root
!e
ham = [4, 5, 8]
pork = [4, 5, 8]
print(ham == pork)
print(ham is pork)
@rugged root :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | True
002 | False
you can do ==
to check if they are equal
is also means that they are pointing to the same memory
they will be pointing to the same memory allocated
gentle flint
different positions of the . in the O
knotty dome
knotty dome
somber heath
proven raft
bro i lost my acc so rip speaking again
its a rip bozo tbh
what zombie romance movie?
ah
god knows
theres the one with big simon pegg in right
shawn of the dead was it idk
shivers down your spine
thin nest
somber heath
!scope
wise cargoBOT
wise cargoBOT
somber heath
!e py a, b = (1, 2) print(a) print(b)Variable unpacking.
wise cargoBOT
@somber heath :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | 1
002 | 2
!e py for ab in zip('abc', '123'): print(ab)
wise cargoBOT
@somber heath :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | ('a', '1')
002 | ('b', '2')
003 | ('c', '3')
!e py letters = 'abc' numbers = '123' for a, b in zip(letters, numbers): #With variable unpacking. print(a,b)
wise cargoBOT
@somber heath :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | a 1
002 | b 2
003 | c 3
a and b as separate variables
!e py letters = 'abc' numbers = '123' for i in range(len(letters)): print(letters[i], numbers[i])Using zip is usually preferable to range/len and index subscription.
wise cargoBOT
@somber heath :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | a 1
002 | b 2
003 | c 3
proper grove
somber heath
https://cdn.mage.space/generate/d86360c0985a47e4a766b1103d36e616.png Capuchin monkey drinking a cappuccino.
proper grove
knotty dome
abstract pike
@lunar haven How did you make the UML diagram figure (curious)? Its a .md file
thats cool
Yeah super convenient
winter plover
Files > binary > binary into groups of 3 8bit numbers (r,g,b) aka 1 pixel > fit as many pixels into a frame > multiple frames into video > upload video to YouTube > infinite storage
lavish rover
from sympy.solvers import solve
from sympy import Symbol
x = Symbol('x')
solve([x >= 0.5, x <= 3, x**2 - 1], x)
proven raft
sui
wise cargoBOT
glass compass
why isnt running
verbal zenith
That error is the definition of plain text is it not?
verbal zenith
!voice
wise cargoBOT
river spade
yoooooooooooo
verbal zenith
!voice
wise cargoBOT
:incoming_envelope: :ok_hand: applied timeout to @whole bear until <t:1679447381:f> (10 minutes) (reason: duplicates rule: sent 4 duplicated messages in 10s).
The <@&831776746206265384> have been alerted for review.
ivory stump
!unmute 1086371029561131078
wise cargoBOT
:incoming_envelope: :ok_hand: pardoned infraction timeout for @whole bear.
ivory stump
Please don't spam to try and reach the message threshold
ivory stump
As mentioned in #voice-verification,
Spamming to meet any criteria will get you temporarily or permanently banned from voice, and potentially the community.
whole bear
!voiceverify
verbal zenith
!e
iterable = (1,2,3,4,5)
for elem in iterable:
print(elem)
@knotty dome
!e
iterable = [23, 34, 54324 ,123, 34]
highest = iterable[0]
for elem in iterable:
if elem > highest:
highest = elem
print(highest)
@verbal zenith :white_check_mark: Your 3.11 eval job has completed with return code 0.
54324
iterable = [23, 34, 54324 ,123, 34]
highest = iterable[0]
for elem in iterable:
if elem > highest:
highest = elem
print(highest)
sterile lichen
!e ```py
iterable = [23, 34, 54324 ,123, 34]
highest = iterable[0]
for elem in iterable:
if elem > highest:
highest = elem
else:
print(elem)
#print(highest)
@sterile lichen :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | 23
002 | 123
003 | 34
!e ```py
iterable = [23, 34, 54324 ,123, 34]
highest = iterable[0]
s_highest = None
for elem in iterable:
if elem > highest:
s_highest = int(highest.copy())
highest = int(elem.copy())
print(highest, s_highest)
@sterile lichen :x: Your 3.11 eval job has completed with return code 1.
001 | File "/home/main.py", line 8
002 | return highest, s_highest
003 | ^^^^^^^^^^^^^^^^^^^^^^^^^
004 | SyntaxError: 'return' outside function
iterable = [23, 34, 54324 ,123, 34]
highest = iterable[0]
s_highest = None
for elem in iterable:
if elem > highest:
s_highest = int(highest.copy())
highest = int(elem.copy())
print(highest, s_highest)
!e iterable = [23, 34, 54324 ,123, 34] highest = iterable[0] s_highest = None for elem in iterable: if elem > highest: s_highest = int(highest.copy()) highest = int(elem.copy()) print(highest, s_highest)
wise cargoBOT
@sterile lichen :x: Your 3.11 eval job has completed with return code 1.
001 | Traceback (most recent call last):
002 | File "/home/main.py", line 6, in <module>
003 | s_highest = int(highest.copy())
004 | ^^^^^^^^^^^^
005 | AttributeError: 'int' object has no attribute 'copy'
!e iterable = [23, 34, 54324 ,123, 34] highest = iterable[0] s_highest = None for elem in iterable: if elem > highest: print(highest, s_highest) s_highest = int(highest) highest = int(elem) print(highest, s_highest)
wise cargoBOT
@sterile lichen :white_check_mark: Your 3.11 eval job has completed with return code 0.
54324 34
iterable = [23, 34, 54324 ,123, 34]
highest = iterable[0]
for elem in iterable:
if elem > highest:
second_highest = highest
highest = elem
if elem > second_highest:
second_highest = elem
print(highest)
!e
iterable = [23, 34, 54324 ,123, 34]
highest = iterable[0]
second_highest = highest
for elem in iterable:
if elem > highest:
second_highest = highest
highest = elem
elif elem > second_highest:
second_highest = elem
print(second_highest)
@verbal zenith :white_check_mark: Your 3.11 eval job has completed with return code 0.
123
iterable = [23, 34, 54324 ,123, 34]
highest = iterable[0]
s_highest = None
for elem in iterable:
if elem > highest:
print(highest, s_highest)
s_highest = int(highest)
highest = int(elem)
print(highest, s_highest)```
sterile lichen
!e iterable = [23, 34, 54324 ,123, 34] highest = iterable[0] s_highest = None for elem in iterable: if elem > highest: print(highest, s_highest) s_highest = int(highest) highest = int(elem) print(highest, s_highest)
wise cargoBOT
@sterile lichen :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | 23 None
002 | 34 23
003 | 54324 34
!e
nums = [1, 2, 56, 34, 67, 23, 67]
nums.sort(reverse=True)
print("The second highest number is: ", nums[1])
@verbal zenith :white_check_mark: Your 3.11 eval job has completed with return code 0.
The second highest number is: 67
@sterile lichen :x: Your 3.11 eval job has completed with return code 1.
001 | Traceback (most recent call last):
002 | File "/home/main.py", line 8, in <module>
003 | elif elem > s_highest:
004 | ^^^^^^^^^^^^^^^^
005 | TypeError: '>' not supported between instances of 'int' and 'NoneType'
!e iterable = [23, 34, 54324 ,123, 34] highest = iterable[0] s_highest = None for elem in iterable: if elem > highest : s_highest = highest highest = int(elem) elif elem > s_highest and s_highest: s_highest = int(elem) print(highest, s_highest)
wise cargoBOT
@sterile lichen :x: Your 3.11 eval job has completed with return code 1.
001 | Traceback (most recent call last):
002 | File "/home/main.py", line 8, in <module>
003 | elif elem > s_highest and s_highest:
004 | ^^^^^^^^^^^^^^^^
005 | TypeError: '>' not supported between instances of 'int' and 'NoneType'
@verbal zenith :white_check_mark: Your 3.11 eval job has completed with return code 0.
The second highest number is: 2
!e iterable = [23, 34, 54324 ,123, 34] highest = iterable[0] s_highest = None for elem in iterable: if elem > highest : s_highest = highest highest = int(elem) elif s_highest and elem > s_highest: s_highest = int(elem) print(highest, s_highest)
wise cargoBOT
@sterile lichen :white_check_mark: Your 3.11 eval job has completed with return code 0.
54324 123
!e
nums = [1, 2, 56, 34, 67, 23, 67]
nums.sort(reverse=True)
print("The second highest number is: ", nums[1])
@verbal zenith :white_check_mark: Your 3.11 eval job has completed with return code 0.
The second highest number is: 67
thin breach
!e
# x^2 + y^2 = 10
# y^2 = 10 - x^2
# y = +-sqrt(10-x^2)
x = range(-10, 10)
y = []
yi = []
for i in x:
y.append((10-i**2)**0.5)
yi.append(((10-i**2)**0.5)*-1)
ymax = max(y)
ylow = max(yi)
for row in range(int(ymax), int(ylow)):
temp = ""
for col in x:
if y[col] == row:
temp += "@"
elif yi[col] == row:
temp += "@"
else:
temp += "#"
print(temp)
!e
# x^2 + y^2 = 10
# y^2 = 10 - x^2
# y = +-sqrt(10-x^2)
x = range(-10, 10)
y = []
yi = []
for i in x:
y.append((10-i**2)**0.5)
yi.append(((10-i**2)**0.5)*-1)
ymax = max(y)
ylow = max(yi)
for row in range(int(ymax), int(ylow)):
temp = ""
for col in x:
if y[col] == row:
temp += "@"
elif yi[col] == row:
temp += "@"
else:
temp += "#"
print(temp)
!e
# x^2 + y^2 = 10
# y^2 = 10 - x^2
# y = +-sqrt(10-x^2)
x = range(-10, 10)
y = []
yi = []
for i in x:
y.append((10-i**2)**0.5)
yi.append(((10-i**2)**0.5)*-1)
ymax = max(y)
ylow = max(yi)
for row in range(int(ymax), int(ylow)):
temp = ""
for col in x:
if y[col] == row:
temp += "@"
elif yi[col] == row:
temp += "@"
else:
temp += "#"
print(temp)
@verbal zenith :x: Your 3.11 eval job has completed with return code 1.
001 | Traceback (most recent call last):
002 | File "/home/main.py", line 12, in <module>
003 | ymax = max(y)
004 | ^^^^^^
005 | TypeError: '>' not supported between instances of 'complex' and 'complex'
if isinstance(i, complex)
thin breach
!e
# x^2 + y^2 = 10
# y^2 = 10 - x^2
# y = +-sqrt(10-x^2)
x = range(-10, 10)
y = []
yi = []
for i in x:
y.append((10-i**2)**0.5)
for i in len(y):
if isinstance(y[i], complex):
y[i] = -11
yi.append[i]
ymax = max(y)
ylow = max(yi)
for row in range(int(ymax), int(ylow)):
temp = ""
for col in x:
if y[col] == row:
temp += "@"
elif yi[col] == row:
temp += "@"
else:
temp += "#"
print(temp)
for i, _ in enumerate(y):
thin breach
!e
# x^2 + y^2 = 10
# y^2 = 10 - x^2
# y = +-sqrt(10-x^2)
x = range(-10, 10)
y = []
yi = []
for i in x:
y.append((10-i**2)**0.5)
for i in range(len(y)):
if isinstance(y[i], complex):
y[i] = -11
yi.append(y[i])
ymax = max(y)
ylow = max(yi)
for row in range(int(ymax), int(ylow)):
temp = ""
for col in x:
if y[col] == row:
temp += "@"
elif yi[col] == row:
temp += "@"
else:
temp += "#"
print(temp)
print(x)
print(y)
!e
x = range(-10, 10)
y = []
yi = []
for i in x:
y.append((10-i**2)**0.5)
for i in y:
print(type(abs(i)))
!e
# x^2 + y^2 = 10
# y^2 = 10 - x^2
# y = +-sqrt(10-x^2)
x = range(-10, 10)
y = []
yi = []
for i in x:
y.append((10-i**2)**0.5)
for i in range(len(y)):
if isinstance(y[i], complex):
y[i] = -11
yi.append(y[i])
ymax = max(y)
ylow = max(yi)
for row in range(int(ymax), int(ylow)):
temp = ""
for col in x:
if y[col] == row:
temp += "@"
elif yi[col] == row:
temp += "@"
else:
temp += "#"
print(temp)
print(x)
print(y)
@thin breach :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | range(-10, 10)
002 | [-11, -11, -11, -11, -11, -11, -11, 1.0, 2.449489742783178, 3.0, 3.1622776601683795, 3.0, 2.449489742783178, 1.0, -11, -11, -11, -11, -11, -11]
!e
# x^2 + y^2 = 10
# y^2 = 10 - x^2
# y = +-sqrt(10-x^2)
x = range(-10, 10)
y = []
yi = []
for i in x:
y.append((10-i**2)**0.5)
for i in range(len(y)):
if isinstance(y[i], complex):
# does not graph
y[i] = -1000
yi.append(y[i])
ymax = max(y)
ylow = max(yi)
for row in range(int(ymax), int(ylow)):
temp = ""
for col in x:
if y[col] == row:
temp += "@"
elif yi[col] == row:
temp += "@"
else:
temp += "#"
print(temp)
print(x)
print(y)
!e
# x^2 + y^2 = 10
# y^2 = 10 - x^2
# y = +-sqrt(10-x^2)
x = range(-10, 10)
y = []
yi = []
for i in x:
y.append((10-i**2)**0.5)
for i in range(len(y)):
if isinstance(y[i], complex):
# does not graph
y[i] = -1000
yi.append(y[i])
ymax = max(y)
ylow = max(yi)
for row in range(int(ymax), int(ylow)):
temp = ""
for col in x:
if y[col] == row:
temp += "@"
elif yi[col] == row:
temp += "@"
else:
temp += "#"
print(temp)
print(x)
print(y)
@thin breach :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | range(-10, 10)
002 | [-1000, -1000, -1000, -1000, -1000, -1000, -1000, 1.0, 2.449489742783178, 3.0, 3.1622776601683795, 3.0, 2.449489742783178, 1.0, -1000, -1000, -1000, -1000, -1000, -1000]
[int(i) for i in list]
sterile lichen
float // 1 = clos
thin breach
!e
# x^2 + y^2 = 10
# y^2 = 10 - x^2
# y = +-sqrt(10-x^2)
x = range(-10, 10)
y = []
yi = []
for i in x:
y.append((10-i**2)**0.5)
for i in range(len(y)):
if isinstance(y[i], complex):
# does not graph
y[i] = -1000
yi.append(y[i])
ymax = max(y)
ylow = max(yi)
y = [int(i) for i in y]
yi = [int(i) for i in yi]
for row in range(int(ymax), int(ylow)):
temp = ""
for col in x:
if y[col] == row:
temp += "@"
elif yi[col] == row:
temp += "@"
else:
temp += "#"
print(temp)
#print(x)
#print(y)
!e
# x^2 + y^2 = 10
# y^2 = 10 - x^2
# y = +-sqrt(10-x^2)
x = range(-10, 10)
y = []
yi = []
for i in x:
y.append((10-i**2)**0.5)
for i in range(len(y)):
if isinstance(y[i], complex):
# does not graph
y[i] = -1000
yi.append(y[i])
ymax = max(y)
ylow = max(yi)
y = [int(i) for i in y]
yi = [int(i) for i in yi]
for row in range(int(ymax), int(ylow)):
temp = ""
for col in x:
if y[col] == row:
temp += "@"
elif yi[col] == row:
temp += "@"
else:
temp += "#"
print(temp)
print(y)
print(yi)
y = [int(i) for i in y if i>0]
yi = [int(i) for i in yi if i>0]
pallid hazel
my server drive died.. lost a months worth of work... 😦
sterile lichen
!e ```x = range(-10, 10)
y = []
yi = []
for i in x:
value = abs(10-i2)
if value >= 0:
y.append(value0.5)
yi.append((value**0.5)*-1)
else:
y.append(0)
yi.append(0)
#print(yi)
#print(y)
ymax = max(y) // 1
ylow = abs(max(yi) // 1)
temp = ""
ylow, ymax = min(ylow, ymax), max(ylow, ymax)
for row in range(int(ylow), int(ymax)):
temp = ""
for col in x:
c1 = abs(y[col] // 1)
c2 = abs(yi[col] // 1)
if c1 == row:
temp += "@"
elif c2 == row:
temp += "@"
else:
temp += "#"
print(temp)
@sterile lichen :white_check_mark: Your 3.11 eval job has completed with return code 0.
########@@#@@#######
!e
wise cargoBOT
thin breach
!e
# x^2 + y^2 = 10
# y^2 = 10 - x^2
# y = +-sqrt(10-x^2)
x = range(-10, 10)
y = []
yi = []
for i in x:
y.append((10-i**2)**0.5)
for i in range(len(y)):
if isinstance(y[i], complex):
# does not graph
y[i] = -1000
yi.append(y[i])
y = [int(i) for i in y]
yi = [int(i) for i in yi]
ymax = max(y)
ylow = max(yi)
for row in range(int(ymax), int(ylow)):
temp = ""
for col in x:
if y[col] == row:
temp += "@"
elif yi[col] == row:
temp += "@"
else:
temp += "#"
print(temp)
#print(y)
#print(yi)
!e ```x = range(-10, 10)
y = []
yi = []
for i in x:
value = abs(10-i2)
if value >= 0:
y.append(value0.5)
yi.append((value**0.5)*-1)
else:
y.append(0)
yi.append(0)
#print(yi)
#print(y)
ymax = max(y) // 1
ylow = abs(max(yi) // 1)
temp = ""
ylow, ymax = min(ylow, ymax), max(ylow, ymax)
for row in range(int(ylow), int(ymax)):
temp = ""
for col in x:
c1 = abs(y[col] // 1)
c2 = abs(yi[col] // 1)
if c1 == row:
temp += "@"
elif c2 == row:
temp += "@"
else:
temp += "#"
print(temp)
@sterile lichen :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | #
002 | ##
003 | ###
004 | ###@
005 | ###@#
006 | ###@##
007 | ###@###
008 | ###@####
009 | ###@#####
010 | ###@######
011 | ###@#######
... (truncated - too many lines)
Full output: https://paste.pythondiscord.com/bemugumitu.txt?noredirect
thin breach
!e
x = range(-10, 10)
y = []
yi = []
for i in x:
y.append((10-i**2)**0.5)
for i in range(len(y)):
if isinstance(y[i], complex):
# does not graph
y[i] = -1000
yi.append(y[i])
y = [int(i) for i in y]
yi = [int(i) for i in yi]
ymax = max(y)
ylow = max(yi)
print(range(int(ymax)))
for row in range(int(ymax), int(ylow)):
print("test")
temp = ""
for col in x:
if y[col] == row:
temp += "@"
elif yi[col] == row:
temp += "@"
else:
temp += "#"
print(temp)
#print(y)
#print(yi)
@thin breach :white_check_mark: Your 3.11 eval job has completed with return code 0.
range(0, 3)
!e ```x = range(-10, 10)
y = []
yi = []
for i in x:
value = abs(10-i2)
if value >= 0:
y.append(value0.5)
yi.append((value**0.5)*-1)
else:
y.append(0)
yi.append(0)
#print(yi)
#print(y)
ymax = max(y) // 1
ylow = max(yi) // 1
temp = ""
ylow, ymax = min(ylow, ymax), max(ylow, ymax)
for row in range(int(ylow), int(ymax)):
temp = ""
for col in x:
c1 = abs(y[col] // 1)
c2 = abs(yi[col] // 1)
if c1 == row:
temp += "@"
elif c2 == row:
temp += "@"
else:
temp += "#"
print(temp)
@sterile lichen :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | #
002 | ##
003 | ###
004 | ####
005 | #####
006 | ######
007 | #######
008 | ########
009 | #########
010 | ##########
011 | ###########
... (truncated - too many lines)
Full output: https://paste.pythondiscord.com/qodudubagi.txt?noredirect
verbal zenith
!e
x = range(-10, 10)
y = []
yi = []
for i in x:
y.append((10-i**2)**0.5)
for i in range(len(y)):
if isinstance(y[i], complex):
# does not graph
y[i] = -1000
yi.append(y[i])
y = [int(i) for i in y]
yi = [int(i) for i in yi]
ymax = max(y)
ylow = max(yi)
print(range(int(ymax), int(ylow)))
for row in range(int(ymax), int(ylow)):
print("test")
temp = ""
for col in x:
if y[col] == row:
temp += "@"
elif yi[col] == row:
temp += "@"
else:
temp += "#"
print(temp)
#print(y)
#print(yi)
@verbal zenith :white_check_mark: Your 3.11 eval job has completed with return code 0.
range(3, 3)
!e
x = range(-10, 10)
y = []
yi = []
for i in x:
y.append((10-i**2)**0.5)
for i in range(len(y)):
if isinstance(y[i], complex):
# does not graph
y[i] = -1000
yi.append(y[i])
y = [int(i) for i in y]
yi = [int(i) for i in yi]
ymax = max(y)
ylow = min(yi)
print(range(ymax, ylow))
for row in range(ymax, ylow):
print("test")
temp = ""
for col in x:
if y[col] == row:
temp += "@"
elif yi[col] == row:
temp += "@"
else:
temp += "#"
print(temp)
#print(y)
#print(yi)
y = [int(i) for i in y if i>0]
yi = [int(i) for i in yi if i>0]
!e
x = range(-10, 10)
y = []
yi = []
for i in x:
y.append((10-i**2)**0.5)
for i in range(len(y)):
if isinstance(y[i], complex):
# does not graph
y[i] = -1000
yi.append(y[i])
y = [int(i) for i in y]
yi = [int(i) for i in yi]
ymax = max(y)
ylow = -1*ymax
print(range(ymax, ylow))
for row in range(ymax, ylow):
print("test")
temp = ""
for col in x:
if y[col] == row:
temp += "@"
elif yi[col] == row:
temp += "@"
else:
temp += "#"
print(temp)
#print(y)
#print(yi)
!e
wise cargoBOT
thin breach
!e
x = range(-10, 10)
y = []
yi = []
for i in x:
y.append((10-i**2)**0.5)
for i in range(len(y)):
if isinstance(y[i], complex):
# does not graph
y[i] = -1000
yi.append(y[i])
y = [int(i) for i in y]
yi = [int(i) for i in yi]
ymax = max(y)
ylow = -1*ymax
print(range(ymax, ylow))
for row in range(ymax, ylow):
print("test")
temp = ""
for col in x:
if y[col] == row:
temp += "@"
elif yi[col] == row:
temp += "@"
else:
temp += "#"
print(temp)
#print(y)
#print(yi)
@thin breach :white_check_mark: Your 3.11 eval job has completed with return code 0.
range(3, -3)
@verbal zenith :white_check_mark: Your 3.11 eval job has completed with return code 0.
range(3, 1)
@verbal zenith :x: Your 3.11 eval job has completed with return code 1.
001 | test
002 | Traceback (most recent call last):
003 | File "/home/main.py", line 21, in <module>
004 | if y[col] == row:
005 | ~^^^^^
006 | IndexError: list index out of range
@verbal zenith :x: Your 3.11 eval job has completed with return code 1.
001 | test
002 | Traceback (most recent call last):
003 | File "/home/main.py", line 21, in <module>
004 | if y[col] == row:
005 | ~^^^^^
006 | IndexError: list index out of range
!e
wise cargoBOT
thin breach
!e
x = range(-10, 10)
y = []
yi = []
for i in x:
y.append((10-i**2)**0.5)
for i in range(len(y)):
if isinstance(y[i], complex):
# does not graph
y[i] = -1000
yi.append(y[i])
y = [int(i) for i in y]
yi = [int(i) for i in yi]
ymax = max(y)
ylow = -1*ymax
print(range(ymax, ylow))
for row in range(ymax, ylow, -1):
temp = ""
for col in x:
if y[col] == row:
temp += "@"
elif yi[col] == row:
temp += "@"
else:
temp += "#"
print(temp)
#print(y)
#print(yi)
@thin breach :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | range(3, -3)
002 | @@#################@
003 | ##@###############@#
004 | ###@#############@##
005 | ####################
006 | ####################
007 | ####################
!eprint('\n'.join([''.join([('♥'[(x - y) % len('♥')] if ((x*0.05)**2 + (y*0.1)**2 - 1)**3 - (x*0.05)**2 * (y*0.1)**3 <= 0 else ' ') for x in range(-30, 30)]) for y in range(15, -15, -1)]))
wise cargoBOT
@sterile lichen :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 |
002 |
003 |
004 | ♥♥♥♥♥♥♥♥♥ ♥♥♥♥♥♥♥♥♥
005 | ♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥ ♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥
006 | ♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥
007 | ♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥
008 | ♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥
009 | ♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥
010 | ♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥
011 | ♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥
... (truncated - too many lines)
Full output: https://paste.pythondiscord.com/lutecuguju.txt?noredirect
pallid hazel
there is a bot channel
verbal zenith
we're coding together?
sterile lichen
!eprint('\n'.join([''.join([('.' if ((x - 25) ** 2 + (y - 10) ** 2 - 100) ** 2 - ((x - 25) ** 2) * ((y - 10) ** 2) <= 0 else ' ') for x in range(50)]) for y in range(20)]))
!eprint('\n'.join([''.join([('.' if ((x - 25) ** 2 + (y - 10) ** 2 - 100) ** 2 - ((x - 25) ** 2) * ((y - 10) ** 2) <= 0 else ' ') for x in range(50)]) for y in range(20)]))
wise cargoBOT
@sterile lichen :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | .....................
002 | ......... .........
003 | ........ ........
004 | ....... .......
005 | ...... ......
006 | ..... .....
007 | .... ....
008 | ... ...
009 | .. ..
010 | . .
011 | . .
... (truncated - too many lines)
Full output: https://paste.pythondiscord.com/piwadikeqe.txt?noredirect
sterile lichen
!eimport turtle turtle.penup() turtle.goto(0,-100) turtle.pendown() turtle.circle(100) turtle.penup() turtle.goto(-40,30) turtle.pendown() turtle.circle(20) turtle.penup() turtle.goto(40,30) turtle.pendown() turtle.circle(20) turtle.penup() turtle.goto(-60,-20) turtle.pendown() turtle.right(90) turtle.circle(60,180) turtle.done()
wise cargoBOT
@sterile lichen :x: Your 3.11 eval job has completed with return code 1.
001 | Traceback (most recent call last):
002 | File "/home/main.py", line 1, in <module>
003 | import turtle
004 | File "/usr/local/lib/python3.11/turtle.py", line 107, in <module>
005 | import tkinter as TK
006 | File "/usr/local/lib/python3.11/tkinter/__init__.py", line 38, in <module>
007 | import _tkinter # If this fails your Python may not be configured for Tk
008 | ^^^^^^^^^^^^^^^
009 | ImportError: libtk8.6.so: cannot open shared object file: No such file or directory
wise cargoBOT
@sterile lichen :white_check_mark: Your 3.11 eval job has completed with return code 0.
😀
wise cargoBOT
@verbal zenith :x: Your 3.11 eval job has completed with return code 1.
001 | File "/home/main.py", line 1
002 | 😀 = 10
003 | ^
004 | SyntaxError: invalid character '😀' (U+1F600)
!e
x = range(-10, 10)
y = []
yi = []
for i in x:
y.append((10-i**2)**0.5)
for i in range(len(y)):
if isinstance(y[i], complex):
# does not graph
y[i] = -1000
yi.append(y[i])
y = [int(i) for i in y]
yi = [int(-1*i) for i in yi]
ymax = max(y)
ylow = -1*ymax
print(range(ymax, ylow))
for row in range(ymax, ylow, -1):
temp = ""
for col in x:
print(col)
if y[col] == row:
temp += "\U0001F600"
elif yi[col] == row:
temp += "\U0001F600"
else:
temp += "#"
print(temp)
print(y)
print(yi)
!eprint('\n'.join([''.join([('\U0001F600'[(x - y) % len('\U0001F600')] if ((x*0.05)**2 + (y*0.1)**2 - 1)**3 - (x*0.05)**2 * (y*0.1)**3 <= 0 else ' ') for x in range(-30, 30)]) for y in range(15, -15, -1)]))
wise cargoBOT
@sterile lichen :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 |
002 |
003 |
004 | 😀😀😀😀😀😀😀😀😀 😀😀😀😀😀😀😀😀😀
005 | 😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀 😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀
006 | 😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀
007 | 😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀
008 | 😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀
009 | 😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀
010 | 😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀
011 | 😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀
... (truncated - too many lines)
Full output: https://paste.pythondiscord.com/donokudota.txt?noredirect
thin breach
!e
x = range(-10, 10)
y = []
yi = []
for i in x:
y.append((10-i**2)**0.5)
for i in range(len(y)):
if isinstance(y[i], complex):
# does not graph
y[i] = -1000
yi.append(y[i])
y = [int(i) for i in y]
yi = [int(-1*i) for i in yi]
ymax = max(y)
ylow = -1*ymax
print(range(ymax, ylow))
for row in range(ymax, ylow, -1):
temp = ""
for col in x:
print(col)
if y[col] == row:
temp += "\U0001F600"
elif yi[col] == row:
temp += "\U0001F600"
else:
temp += "#"
print(temp)
print(y)
print(yi)
@thin breach :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | range(3, -3)
002 | -10
003 | -9
004 | -8
005 | -7
006 | -6
007 | -5
008 | -4
009 | -3
010 | -2
011 | -1
... (truncated - too many lines)
Full output: https://paste.pythondiscord.com/ukajixawov.txt?noredirect
thin breach
!e
x = range(-10, 11)
y = []
yi = []
for i in x:
y.append((10-i**2)**0.5)
for i in range(len(y)):
if isinstance(y[i], complex):
# does not graph
y[i] = -1000
yi.append(y[i])
y = [int(i) for i in y]
yi = [int(-1*i) for i in yi]
ymax = max(y)
ylow = -1*ymax
print(range(ymax, ylow))
for row in range(ymax, ylow, -1):
temp = ""
for col in x:
if y[col] == row:
temp += "\U0001F600"
elif yi[col] == row:
temp += "\U0001F600"
else:
temp += "#"
print(temp)
print(y)
print(yi)
@thin breach :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | range(3, -3)
002 | 😀##################😀😀
003 | #😀################😀##
004 | ##😀##############😀###
005 | #####################
006 | ##😀##############😀###
007 | #😀################😀##
008 | [-1000, -1000, -1000, -1000, -1000, -1000, -1000, 1, 2, 3, 3, 3, 2, 1, -1000, -1000, -1000, -1000, -1000, -1000, -1000]
009 | [1000, 1000, 1000, 1000, 1000, 1000, 1000, -1, -2, -3, -3, -3, -2, -1, 1000, 1000, 1000, 1000, 1000, 1000, 1000]
!eprint('\n'.join([''.join([('\U0001F600'[(x - y) % len('♥')] if ((x*0.05)**2 + (y*0.1)**2 - 1)**3 - (x*0.05)**2 * (y*0.1)**3 <= 0 else ' ') for x in range(-30, 30)]) for y in range(15, -15, -1)]))
!eprint('\n'.join([''.join([('\U0001F600'[(x - y) % len(3)] if ((x*0.05)**2 + (y*0.1)**2 - 1)**3 - (x*0.05)**2 * (y*0.1)**3 <= 0 else ' ') for x in range(-30, 30)]) for y in range(15, -15, -1)]))
!eprint('\n'.join([''.join([('\U0001F600'[(x - y) % 3] if ((x*0.05)**2 + (y*0.1)**2 - 1)**3 - (x*0.05)**2 * (y*0.1)**3 <= 0 else ' ') for x in range(-30, 30)]) for y in range(15, -15, -1)]))
!e print('\n'.join([''.join(['$ ' if (x-50)**2+(y-10)**2 <= 100 else ' ' for x in range(100)]) for y in range(20)]))
wise cargoBOT
@sterile lichen :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | $
002 | $ $ $ $ $ $ $ $ $
003 | $ $ $ $ $ $ $ $ $ $ $ $ $
004 | $ $ $ $ $ $ $ $ $ $ $ $ $ $ $
005 | $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $
... (truncated - too long, too many lines)
Full output: https://paste.pythondiscord.com/axibutujen.txt?noredirect
sterile lichen
!eprint('\n'.join([''.join(['\U0001F600' if (x-50)2+(y-10)2 <= 100 else ' ' for x in range(100)]) for y in range(20)]))
wise cargoBOT
@sterile lichen :x: Your 3.11 eval job has completed with return code 1.
001 | File "/home/main.py", line 1
002 | print('\n'.join([''.join(['\U0001F600' if (x-50)2+(y-10)2 <= 100 else ' ' for x in range(100)]) for y in range(20)]))
003 | ^^^^^^^^^^^^^^^^^^^^^
004 | SyntaxError: expected 'else' after 'if' expression
!e print('\n'.join([''.join(['\U0001F600' if (x-50)**2+(y-10)**2 <= 100 else ' ' for x in range(100)]) for y in range(20)]))
wise cargoBOT
@sterile lichen :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | 😀
002 | 😀😀😀😀😀😀😀😀😀
003 | 😀😀😀😀😀😀😀😀😀😀😀😀😀
004 | 😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀
005 | 😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀
006 |
... (truncated - too long, too many lines)
Full output: https://paste.pythondiscord.com/fonebonefo.txt?noredirect
sterile lichen
!e ```py
print('\n'.join([''.join(['\u2665 ' if ((x-50)*0.04)**2+((y-8)*0.1)**2-1 <= 0 else ' ' for x in range(100)]) for y in range(20)]))
print('\n'.join([''.join(['\u2605 ' if abs(x-50) <= y or abs(y-10) <= x-50 else ' ' for x in range(100)]) for y in range(20)]))
print('\n'.join([''.join(['\u25C6 ' if abs(x-50)+abs(y-10) <= 10 else ' ' for x in range(100)]) for y in range(20)]))
print('\n'.join([''.join(['\u25B2 ' if (x >= 50-y and x <= 50+y and y <= 10) else ' ' for x in range(100)]) for y in range(20)]))
print('\n'.join([''.join(['\U0001F60A ' if (x-50)**2+(y-10)**2 <= 100 and abs((y-10)/(x-50)) <= 1 else ' ' for x in range(100)]) for y in range(20)]))
print('\n'.join([''.join(['\U0001F60A ' if (x-50)**2+(y-8)**2 <= 64 and (x-50)**2+(y-12)**2 <= 64 and abs((y-10)/(x-50)) <= 1.5 else ' ' for x in range(100)]) for y in range(20)]))
print('\n'.join([''.join(['\u2715 ' if abs(x-50) <= 5 or abs(y-10) <= 5 else ' ' for x in range(100)]) for y in range(20)]))
print('\n'.join([''.join(['\u2716 ' if abs(x-50) == abs(y-10) else ' ' for x in range(100)]) for y in range(20)]))
print('\n'.join([''.join(['\u2713 ' if (x >= 50-y and x <= 50 and y >= 10) or (x >= 50 and x <= 50+y and y <= 10) else ' ' for x in range(100)]) for y in range(20)]))
print('\n'.join([''.join(['\u27A4 ' if (x >= 50-y and x <= 50 and y >= 10) or (x >= 50 and x <= 50+y and y <= 10) or (x >= 40 and x <= 60 and y == 10) else ' ' for x in range(100)]) for y in range(20)]))
!e ```py
print('\n'.join([''.join(['\u2665 ' if ((x-50)*0.04)**2+((y-8)*0.1)**2-1 <= 0 else ' ' for x in range(100)]) for y in range(20)]))
print('\n'.join([''.join(['\u2605 ' if abs(x-50) <= y or abs(y-10) <= x-50 else ' ' for x in range(100)]) for y in range(20)]))
print('\n'.join([''.join(['\u25C6 ' if abs(x-50)+abs(y-10) <= 10 else ' ' for x in range(100)]) for y in range(20)]))
@sterile lichen :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥
002 | ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥
003 | ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥
004 | ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥
005 | ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥
... (truncated - too long, too many lines)
Full output: too long to upload
sterile lichen
!e ```py
print('\n'.join([''.join(['\u2665 ' if ((x-50)*0.04)**2+((y-8)*0.1)**2-1 <= 0 else ' ' for x in range(100)]) for y in range(20)]))
@sterile lichen :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥
002 | ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥
003 | ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥
004 | ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥
005 | ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥
... (truncated - too long, too many lines)
Full output: https://paste.pythondiscord.com/omivelojam.txt?noredirect
verbal zenith
!e
print("hello")
print("world")
@verbal zenith :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | hello
002 | world
!e
print("Hello")
print("World")
wise cargoBOT
@verbal zenith :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | Hello
002 | World
!e print('\n'.join([''.join(['\u2665 ' if ((x-50)*0.04)**2+((y-8)*0.1)**2-1 <= 0 else ' ' for x in range(100)]) for y in range(20)]))
print('\n'.join([''.join(['\u2605 ' if abs(x-50) <= y or abs(y-10) <= x-50 else ' ' for x in range(100)]) for y in range(20)]))
print('\n'.join([''.join(['\u25C6 ' if abs(x-50)+abs(y-10) <= 10 else ' ' for x in range(100)]) for y in range(20)]))
print('\n'.join([''.join(['\u25B2 ' if (x >= 50-y and x <= 50+y and y <= 10) else ' ' for x in range(100)]) for y in range(20)]))
print('\n'.join([''.join(['\U0001F60A ' if (x-50)**2+(y-10)**2 <= 100 and abs((y-10)/(x-50)) <= 1 else ' ' for x in range(100)]) for y in range(20)]))
print('\n'.join([''.join(['\U0001F60A ' if (x-50)**2+(y-8)**2 <= 64 and (x-50)**2+(y-12)**2 <= 64 and abs((y-10)/(x-50)) <= 1.5 else ' ' for x in range(100)]) for y in range(20)]))
wise cargoBOT
@sterile lichen :x: Your 3.11 eval job has completed with return code 1.
001 | ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥
002 | ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥
003 | ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥
004 | ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥
005 | ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥
... (truncated - too long, too many lines)
Full output: too long to upload
thin breach
!e
x = range(-10, 11)
y = []
yi = []
for i in x:
y.append((10-i**2)**0.5)
for i in range(len(y)):
if isinstance(y[i], complex):
# does not graph
y[i] = -1000
yi.append(y[i])
y = [int(i) for i in y]
yi = [int(-1*i) for i in yi]
ymax = max(y)
ylow = -1*ymax
for row in range(ymax+1, ylow-1, -1):
temp = ""
for col in range(0, len(x)):
if y[col] == row:
temp += "\U0001F600"
elif yi[col] == row:
temp += "\U0001F600"
else:
temp += "#"
print(temp)
@thin breach :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | #####################
002 | #########😀😀😀#########
003 | ########😀###😀########
004 | #######😀#####😀#######
005 | #####################
006 | #######😀#####😀#######
007 | ########😀###😀########
008 | #########😀😀😀#########
!e print('\n'.join([''.join(['\U0001F600' if (x-50)2+(y-10)2 <= 100 else ' ' for x in range(100)]) for y in range(20)]))
wise cargoBOT
@sterile lichen :x: Your 3.11 eval job has completed with return code 1.
001 | File "/home/main.py", line 1
002 | print('\n'.join([''.join(['\U0001F600' if (x-50)2+(y-10)2 <= 100 else ' ' for x in range(100)]) for y in range(20)]))
003 | ^^^^^^^^^^^^^^^^^^^^^
004 | SyntaxError: expected 'else' after 'if' expression
!e
x = range(-10, 11)
y = []
yi = []
for i in x:
y.append((10-i**2)**0.5)
for i in range(len(y)):
if isinstance(y[i], complex):
# does not graph
y[i] = -1000
yi.append(y[i])
y = [int(i) for i in y]
yi = [int(-1*i) for i in yi]
ymax = max(y)
ylow = -1*ymax
for row in range(ymax, ylow-1, -1):
temp = ""
for col in range(0, len(x)):
if y[col] == row:
temp += "@"
elif yi[col] == row:
temp += "@"
else:
temp += "#"
print(temp)
@thin breach :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | #########@@@#########
002 | ########@###@########
003 | #######@#####@#######
004 | #####################
005 | #######@#####@#######
006 | ########@###@########
007 | #########@@@#########
!e
x = range(-10, 11)
y = []
yi = []
for i in x:
y.append((10-i**2)**0.5)
for i in range(len(y)):
if isinstance(y[i], complex):
# does not graph
y[i] = -1000
yi.append(y[i])
y = [int(i) for i in y]
yi = [int(-1*i) for i in yi]
ymax = max(y)
ylow = -1*ymax
for row in range(ymax, ylow-1, -1):
temp = ""
for col in range(0, len(x)):
if y[col] == row:
temp += "@"
elif yi[col] == row:
temp += "@"
else:
temp += "#"
print(temp)
@thin breach :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | #########@@@#########
002 | ########@###@########
003 | #######@#####@#######
004 | #####################
005 | #######@#####@#######
006 | ########@###@########
007 | #########@@@#########
!e
radius = 15
x = range(-1*radius, radius+1)
y = []
yi = []
for i in x:
y.append((radius-i**2)**0.5)
for i in range(len(y)):
if isinstance(y[i], complex):
# does not graph
y[i] = -1000
yi.append(y[i])
y = [int(i) for i in y]
yi = [int(-1*i) for i in yi]
ymax = max(y)
ylow = -1*ymax
for row in range(ymax, ylow-1, -1):
temp = ""
for col in range(0, len(x)):
if y[col] == row:
temp += "@"
elif yi[col] == row:
temp += "@"
else:
temp += "#"
print(temp)
!e print('\n'.join([''.join([('\U0001F600' if ((x - 25) ** 2 + (y - 10) ** 2 - 100) ** 2 - ((x - 25) ** 2) * ((y - 10) ** 2) <= 0 else '❤️') for x in range(50)]) for y in range(20)]))
wise cargoBOT
@sterile lichen :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | ❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️
002 | ❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️😀😀😀😀😀😀😀😀😀❤️❤️❤️😀😀😀😀😀😀😀😀😀❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️
003 | ❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️😀😀😀😀😀😀😀😀❤️❤️❤️❤️❤️❤️❤️😀😀😀😀😀😀😀😀❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️
004 | ❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️😀😀😀😀😀😀😀❤️❤️❤️❤️❤️❤️❤️❤️❤️😀😀😀😀😀😀😀❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️
005 | ❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️😀😀😀😀😀😀❤️❤️❤️❤️❤❤❤❤❤❤❤😀😀😀😀😀😀❤❤❤❤❤❤❤❤❤❤❤❤❤
006 | ❤❤❤❤❤❤❤❤❤❤❤❤❤❤😀😀😀😀😀❤❤❤❤❤❤❤❤❤❤❤❤❤😀😀😀😀😀❤❤❤❤❤❤❤❤❤❤❤❤❤
007 | ❤❤❤❤❤❤❤❤❤❤❤❤❤❤😀😀😀😀❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤😀😀😀😀❤❤❤❤❤❤❤❤❤❤❤❤❤
008 | ❤❤❤❤❤❤❤❤❤❤❤❤❤❤😀😀😀❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤😀😀😀❤❤❤❤❤❤❤❤❤❤❤❤❤
009 | ❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤😀😀❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤😀😀❤❤❤❤❤❤❤❤❤❤❤❤❤❤
010 | ❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤😀❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤😀❤❤❤❤❤❤❤❤❤❤❤❤❤❤
011 | ❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤😀❤❤
... (truncated - too long, too many lines)
Full output: https://paste.pythondiscord.com/obeleriwir.txt?noredirect
thin breach
!e
import math
def draw_circle(radius):
for y in range(-radius, radius+1):
row = ''
for x in range(-radius, radius+1):
dist = math.sqrt(x**2 + y**2)
if dist <= radius + 0.5:
row += '*'
else:
row += ' '
print(row)
draw_circle(5)
@thin breach :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | *****
002 | *******
003 | *********
004 | ***********
005 | ***********
006 | ***********
007 | ***********
008 | ***********
009 | *********
010 | *******
011 | *****
... (truncated - too many lines)
Full output: https://paste.pythondiscord.com/exipozudaj.txt?noredirect
thin breach
chatgpt sucks, not mathematically good
!e
import math
radius = 10
for y in range(-radius, radius+1):
row = ''
for x in range(-radius, radius+1):
if x**2 + y**2 <= radius**2:
row += '*'
else:
row += ' '
print(row)
@thin breach :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | *
002 | *********
003 | *************
004 | ***************
005 | *****************
006 | *****************
007 | *******************
008 | *******************
009 | *******************
010 | *******************
011 | *********************
... (truncated - too many lines)
Full output: https://paste.pythondiscord.com/haceqiheya.txt?noredirect
thin breach
radius = 15
x = range(-1*radius, radius+1)
y = []
yi = []
for i in x:
y.append((radius-i**2)**0.5)
for i in range(len(y)):
if isinstance(y[i], complex):
# does not graph
y[i] = -1000
yi.append(y[i])
y = [int(i) for i in y]
yi = [int(-1i) for i in yi]
ymax = max(y)
ylow = -1ymax
for row in range(ymax, ylow-1, -1):
temp = ""
for col in range(0, len(x)):
if y[col] == row:
temp += "@"
elif yi[col] == row:
temp += "@"
else:
temp += "#"
print(temp)
!e
radius = 10
x = range(-1*radius, radius+1)
y = []
yi = []
for i in x:
y.append((radius-i**2)**0.5)
for i in range(len(y)):
if isinstance(y[i], complex):
# does not graph
y[i] = -1000
yi.append(y[i])
y = [int(i) for i in y]
yi = [int(-1*i) for i in yi]
ymax = max(y)
ylow = -1*ymax
for row in range(ymax, ylow-1, -1):
temp = ""
for col in range(0, len(x)):
if y[col] == row:
temp += "*"
elif yi[col] == row:
temp += "*"
else:
temp += " "
print(temp)
@thin breach :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | ***
002 | * *
003 | * *
004 |
005 | * *
006 | * *
007 | ***
!e
import math
radius = 10
x = range(-radius, radius+1)
y = [math.sqrt(radius**2 - xi**2) for xi in x]
for yi in range(-radius, radius+1):
row = ''
for xi in range(-radius, radius+1):
if (xi in x) and (abs(yi) <= abs(y[x.index(xi)])):
row += '*'
else:
row += ' '
print(row)
!e
import math
radius = 10
x = range(-radius, radius+1)
y = [math.sqrt(radius**2 - xi**2) for xi in x]
for yi in range(-radius, radius+1):
row = ''
for xi in range(-radius, radius+1):
if (xi in x) and (abs(yi) <= abs(y[x.index(xi)])):
row += '*'
else:
row += ' '
print(row)
@thin breach :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | *
002 | *********
003 | *************
004 | ***************
005 | *****************
006 | *****************
007 | *******************
008 | *******************
009 | *******************
010 | *******************
011 | *********************
... (truncated - too many lines)
Full output: https://paste.pythondiscord.com/hocanuqoge.txt?noredirect
thin breach
!e
import math
# Define the equation to graph
def equation(x, y):
return 2*x
# Set the grid size and resolution
x_min, x_max = -20, 20
y_min, y_max = -20, 20
resolution = 0.5
# Loop over the grid of points and evaluate the equation
for y in reversed(range(y_min, y_max+1)):
row = ''
for x in range(x_min, x_max+1):
result = equation(x, y)
if abs(result) < resolution:
row += '*'
else:
row += ' '
print(row)
@thin breach :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 |
002 |
003 |
004 |
005 |
006 |
007 |
008 |
009 |
010 |
011 |
... (truncated - too many lines)
Full output: https://paste.pythondiscord.com/evategehut.txt?noredirect
vocal basin
#bot-commands
thin breach
!e
import math
Define the equation to graph
def equation(x, y):
return 2*x
Set the grid size and resolution
x_min, x_max = -20, 20
y_min, y_max = -20, 20
resolution = 0.5
Loop over the grid of points and evaluate the equation
for y in reversed(range(y_min, y_max+1)):
row = ''
for x in range(x_min, x_max+1):
result = equation(x, y)
if abs(result) < resolution:
row += '*'
else:
row += ' '
print(row)
wise cargoBOT
@thin breach :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | *
002 | *
003 | *
004 | *
005 | *
006 | *
007 | *
008 | *
009 | *
010 | *
011 | *
... (truncated - too many lines)
Full output: https://paste.pythondiscord.com/guqizazuwu.txt?noredirect
thin breach
k
sour willow
thanks
somber heath
@viscid hearth 👋
somber heath
@humble zephyr We could hear you, though you were a little faint, as if you were further away from your microphone than was optimal.
somber heath
@zinc garden👋
rugged root
@small hornet If you were wondering why you can't talk, check out the #voice-verification channel
vocal basin
timing moment again
vocal basin
how does it work? linux namespaces, hopes and prayers
rugged root
!source
wise cargoBOT
vocal basin
layered fs
vocal basin
how does it work? linux namespaces, hopes and prayers
for a more cursed experience I recommend running Docker images as Solaris Zones images
rugged root
For the truly self loathing
vocal basin
for a more cursed experience I recommend running Docker images as Solaris Zones ...
I'm trying to find the article which says "this worked on ..." and some date in 2017
"The YAML File"
docker-compose.yml I have
seems a little bit large
(that's 18 containers)
rugged root
name: server_name_here
categories:
- category_name
- another_category_name:
- channel_name: channel_type
roles:
- role_name
webhooks:
- webhook_channel_name
you can't transfer ownership to a bot
yes
"why would you create a server with a bot"
create a server with a bot, invite people, delete a bot
now you have an anarchy server
vocal basin
"why would you create a server with a bot"
create a server with a bot, invite pe...
(there are !rule 5 reasons why you wouldn't do that)
I don't remember, but I think it doesn't transfer ownership
I'm only as good at tetris as my double-clicking keyboard allows me to be
the only game I'm competitively good at is still minesweeper
vocal basin
I'm only as good at tetris as my double-clicking keyboard allows me to be
seems like the keyboard holds some key down/up events then next presses make them go through
probably not an issue with sensors
proven raft
yoyo mr hemlock
i may of forgotton my account details kekW, tbf once ive sent some msgs i should be fine
xDD
how are we all doing?
xD
rugged root
Decent enough
vocal basin
proven raft
its pretty epic tbf
but it is less powerful
ive had a nokia last year
for a whole year
it wasnt bad
you find yourself using ipods or radio a lot
rugged root
True
proven raft
makes sense
rugged root
Done
serene tulip
hello
proven raft
hi
rugged root
hello
How's it going? Oh, and if you're wondering why you can't talk, check out the #voice-verification channel. That'll tell you what you need to know about the voice gate
serene tulip
How's it going? Oh, and if you're wondering why you can't talk, check out the <...
oh thanks
somber heath
Now, the trend of 'unremovable' batteries.
vocal basin
"make sure to use Scala to have all of your XML inlined in code"
rugged root
@whole bear If you're wondering why you can't talk, check out the #voice-verification channel. That'll tell you what you need to know about the voice gate
vocal basin
"make sure to use Scala to have all of your XML inlined in code"
last time I looked up how Scala handled inline XML, the first result was "this is why removed inline XML" or something similar
willow light
!e
from __future__ import braces
@willow light :x: Your 3.11 eval job has completed with return code 1.
001 | File "/home/main.py", line 1
002 | from __future__ import braces
003 | ^
004 | SyntaxError: not a chance
willow light
I like to joke that the Python best-practices for using XML is "Don't"
willow light
could be worse
vocal basin
<@239917638656983040> :x: Your 3.11 eval job has completed with return code 1.
...
if (1 == 2): {
pass # IndentationError: expected an indented block after 'if' statement
}
for (i = 0; i <7; i++) {
}
willow light
could be worse, could be coq
plus_comm =
fun n m : nat =>
nat_ind (fun n0 : nat => n0 + m = m + n0)
(plus_n_0 m)
(fun (y : nat) (H : y + m = m + y) =>
eq_ind (S (m + y))
(fun n0 : nat => S (y + m) = n0)
(f_equal S H)
(m + S y)
(plus_n_Sm m y)) n
: forall n m : nat, n + m = m + n
vocal basin
Haskell has things more higher-level than just lambda calculus
closer to category theory
putStrLn doesn't print anything
it's a description of what to do
proven raft
vocal basin
main describes what your program will do
willow light
The XArray logo is a great way to demonstrate the data structure most-often used in meteorology lol
vocal basin
value of main is " print 'Hello, everybody' and print 'something else' " in some sense
willow light
import xarray as xr
import numpy as pd
from matplotlib import pyplot as tf
import tensorflow as plt
import pandas as np
data = xr.DataArray(np.random.randn(2, 3), dims=("x", "y"), coords={"x": [10, 20]})
data
like Coroutines in python
rugged root
!code
wise cargoBOT
proven raft
<<<
vocal basin
@proven raft you can't have side-effects that's why you need do to combine descriptions of side-effects
proven raft
'
rugged root
!charinfo ¬
wise cargoBOT
rugged root
!charinfo ¦
wise cargoBOT
proven raft
!charinfo ¦
wise cargoBOT
proven raft
|
vocal basin
<@1087096079645954259> you can't have side-effects that's why you need `do` to c...
async def do_two_things():
await do_first_thing()
await do_second_thing()
main = do_two_things() # does not yet do anything
!e
¦ = 5
@vocal basin :x: Your 3.11 eval job has completed with return code 1.
001 | File "/home/main.py", line 1
002 | ¦ = 5
003 | ^
004 | SyntaxError: invalid character '¦' (U+00A6)
... maybe you can define it as an operator in Haskell
willow light
[X+Y || X <- [1,2], Y <- [2,3]]
!charinfo ∴
wise cargoBOT
rugged root
!stream 239917638656983040
wise cargoBOT
✅ @willow light can now stream until <t:1679499394:f>.
vocal basin
my recorded voice > my voice I hear
rugged root
my recorded voice > my voice I hear
I'm the exact opposite
vocal basin
my recorded voice > my voice I hear
and same for photo>mirror;
the default setting of having the cam mirrored confuses me too much;
iirc, Discord doesn't allow to turn off mirroring
(mirroring for preview)
pallid hazel
@rugged root huge scare.. took about 18hrs to resolve..
system disk in server decided to die while a backup was running on my dev disk to backup disk and crashed them all
pallid hazel
well...
easy, system disk was raid1, but dev disk was running live vmware at the time and crashed the vms running linux, and backup disk also raid1.. so the real issue was the vmdisks inside the dev disk..
dev disk is raid0 😦
rugged root
raid1 across how many disks
pallid hazel
so longstory short, got the raid0 rebuilt with errors and lots of vm trick sideloading to get the linux disks fixed enough to mount and pulled the files off.
the vms themselves maybe salvageable.. but eh, i gotta replace the dev disk anyways
raid1 only 1x1.. im poor
willow light
pallid hazel
problem really is the amount of errors on the dev disk, i doubt it would stay stable ling enough to pull a few hundred gigs of vms off it
rugged root
How large is the disk?
proven raft
pallid hazel
so was 18hrs of obsecure digging thru stuff as the grubs were totally gone.
every drive is 1tb
pallid hazel
jump on the antlers go for a ride
willow light
pallid hazel
ok back to repairing stuff..
willow light
"Wear your seatbelt."
They have to specify that because seatbelts aren't mandatory in NH
One of these States is not like the others.
vocal basin
about that seat belt logic ("most injured wear seat belts")
https://en.wikipedia.org/wiki/Bayes'_theorem
that article still has this as a diagram
willow light
rugged root
somber heath
Turn your head and cough.
vocal basin
worcester = "wistah"
Windows Worcester
willow light
vocal basin
sync is pain
@gentle flint there are startup hooks
or something of that nature
why is on_ready bad, again?
being called twice?
vocal basin
and sync is rate limited
I never ran into full rate-limiting
but there is a thing that looks like rate-limiting
sync requires clients to restart discord
to take full action
gentle flint
vocal basin
sync requires clients to restart discord
(clients as in typical users)
vocal basin
and sync is rate limited
how did you come to that conclusion? is this written in docs? or does it show 429-type errors?
(just making sure it's actually rate-limiting)
maybe:
somehow check in on_ready if /reload was synced
if no, then sync it
bootstrapping in some sense
vocal basin
maybe:
somehow check in `on_ready` if /reload was synced
if no, then sync it
if you use on_ready, don't forget to set a flag as to not repeat the .sync
discord.py should be able to handle 429s on its own, iirc
global
not in a guild
you can change nicknames in a guild very often
username has strict limits
vocal basin
discord.py should be able to handle 429s on its own, iirc
or you can make the bot rate-limit itself
store the last timestamp you attempted to sync at
(maybe)
vocal basin
store the last timestamp you attempted to sync at
... in case you for some reason managed to start the bot thousands of times in a couple of minutes
sync is slow, yes
on_ready spawns a separate task, so it shouldn't slow down the rest of the bot
it can run multiple times
re-connection
rugged root
vocal basin
for running exactly once on startup (maybe before startup? I don't remember), there are startup hooks
guilds intent is not per-account, it's per-runtime
(per-account: presence, members, message content)
gentle flint
vocal basin
you can startup a task
!d asyncio.create_task
wise cargoBOT
vocal basin
don't forget to save the task somewhere
or else it can get GCd
I don't remember ever having GC issues with tasks
(lucky me)
vocal basin
I don't remember ever having GC issues with tasks
in 5 years
because await will dead lock
for organising startup/teardown logic there are also Cogs
@hybrid_command works also inside Cogs
(taking "methods" instead of functions)
what/who is Craig
vocal basin
@gentle flint
import discord.ext.commands
it doesn't import it with discord by default
(because those are extensions)
I've mostly seen it as:
from discord.ext import commands
thing from by discord bio just happened
vocal basin
thing from by discord bio just happened
logitech 👍
create_task should be inside async context
(because it needs a loop)
somber heath
vocal basin
or that, yes
client.loop may error
... because not in async context
and loop may be not set yet
property
2018
somber heath
@steel berry 👋
somber heath
@shy bison 👋
vocal basin
I usually do
async def main():
async with some_context:
await client.login(token)
# setup things
await client.connect()
and all the post-connect in on_ready
somber heath
@wide lark 👋
rugged root
i bought this nft
I'm sorry to hear that.
shy bison
😂
vocal basin
I usually do
```py
async def main():
async with some_context:
await ...
I think doing things that require a ready bot in on_ready is somewhat logical
accountant in denial acceptance
gentle flint
wise cargoBOT
discord/ext/commands/cog.py line 677
async def _inject(self, bot: BotBase, override: bool, guild: Optional[Snowflake], guilds: Sequence[Snowflake]) -> Self:```(three stages skipped)
vocal basin
I think doing things that require a ready bot in `on_ready` is somewhat logical
lock+flag
or just a flag
vocal basin
(three stages skipped)
(accountant in anger, accountant in depression, accountant in bargaining)
thanks google for confusion
somber heath
@cobalt hawk 👋
ancient lily
hello
cobalt hawk
<@408171834996031490> 👋
Hey!
golden sonnet
corey shafer has a video but it's 7 years old
i don't know if i should go for it
ancient lily
thats so random @rugged root
somber heath
@spice garnet 👋
spice garnet
Hey @somber heath
vocal basin
also you're supposed to solve the same problem more than once
(refactoring, different techniques, different languages)
ancient lily
that sounds fun
vocal basin
I was doing codewars for some time (I stopped around 4 months ago)
wanton sonnet
helo
vocal basin
also: brushing hair in the dark sometimes produces light
somber heath
@zenith tulip 👋
amber raptor
!e python a = 'refs/heads/feature/JIRA-123' print(a.lstrip('refs/heads'))
zenith tulip
I joined vc on accident sorry
amber raptor
!e python a = 'refs/heads/feature/JIRA-123' print(a.lstrip('refs/heads'))
wise cargoBOT
@amber raptor :white_check_mark: Your 3.11 eval job has completed with return code 0.
ture/JIRA-123
I can't spell
!e
a = 'refs/heads/feature/JIRA-123'
print(a.lstrip('/adefhrs'))
print(a.removeprefix('refs/heads'))
@vocal basin :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | ture/JIRA-123
002 | /feature/JIRA-123
@dusty drift 👋
vocal basin
!e
print(hash(2))
print(hash(1))
print(hash(0))
print(hash(-1)) # weird
print(hash(-2))
@vocal basin :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | 2
002 | 1
003 | 0
004 | -2
005 | -2
I should a very obscure code golf problem out of it
ancient lily
alright i got to sleep now good night everyone
dusk raven
Grundstücksverkehrsgenehmigungszuständigkeitsübertragungs
Energiepreispauschalengesetz
somber heath
@dusk raven If you're holding your breath waiting for the U.S. to do things fairly and sensibly, you will die.
Or at least pass out or something.
dusk raven
Or at least pass out or something.
and after that i can have hope again
rugged root
Just looking at the Missouri Department of Revenue:
Missouri's fuel tax rate is 17 cents a gallon through September 30, 2021 for all motor fuel, including gasoline, diesel, kerosene, gasohol, ethanol blended with gasoline, biodiesel (B100) blended with clear diesel fuel, etc. The tax does not apply to fuel dyed in accordance with the IRS guidelines such as dyed diesel or dyed kerosene.
The tax rate increases to 19.5 cents a gallon on October 1, 2021; 22 cents a gallon on July 1, 2022; 24.5 cents a gallon on July 1, 2023; 27 cents per gallon on July 1, 2024; and 29.5 cents a gallon on July 1, 2025.
Missouri also collects two fees on all sales of fuel. The fees collected are the agriculture inspection fee in the amount of 3.5 cents per 50 gallons ($0.0007 per gallon) and the transport load fee in the amount of $32.00 per 8,000 gallons ($0.004 per gallon). Prior to January 1, 2023, the transport fee is in the amount of $28.00 per 8,000 gallons ($.0035 per gallon).
So the information is there
Same things can be looked up for sales tax, even divvied up for the various kinds as some kinds of items get taxed differently
So we DO know, it's just grunt work for us to do so, which is stupid
dusk raven
Hope? That's *adorable*.
I know but the more people know the better
amber raptor
More guns then America per capica, doubt
primal shadow
dusk raven
primal shadow
dusk raven
stuck furnace
In Scotland you can't buy alcohol after 10pm ;-;
primal shadow
depends on state law here
and county law
and even local ordinances...
She got a pardon to get out of the "crime"...
was facing 3 years in prison
primal shadow
stuck furnace
How fast was that elevator? 👀
rugged root
How fast was that elevator? 👀
Like a floor every.... I want to say .9 seconds
chilly vector
wow...
mortal burrow
class my_dict(dict):
def __init__(self, stuff):
self.update(stuff)
def get_my_dict(self):
return self
my_stuff = my_dict({'water': 'melon'})
print(my_stuff.get_my_dict())
@lunar haven
thin breach
!e
# graphs a graph on a given domain
import math
domain = [-11,25]
def y_eq(x):
return 2*math.sin(x)-0.5
# code (don't touch)
x_range = range(domain[0],domain[1]+1)
y = []
for x in x_range:
y.append(y_eq(x))
# round up
for i in range(0, len(y)):
y[i] = -round(-y[i]-0.5)
#test for imaginary
for i in range(len(y)):
if isinstance(y[i], complex):
y[i] = -1000
graph_height = range(int(max(y)), int(min(y)-1), -1)
for row in graph_height:
line = ""
for col in range(0, len(x_range)):
if y[col] == row:
line += "*"
elif col+domain[0] == 0:
line += "|"
elif row == 0:
line+= "-"
else:
line += " "
print(line)
@thin breach :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | * ** |** * * **
002 | * * | * * * *
003 | --------*--*--*---------------*--*--*
004 | * * | * * * *
005 | * **| ** * ** **
why would someone use matplotlib?
golden iron
!e
wise cargoBOT
somber heath
@devout bloom 👋
devout bloom
<@533226806686384128> 👋
hello
I was just checing If I am eligible to speak yet or not
wise cargoBOT
somber heath
It's a manual process, not automatic.
devout bloom
True
scenic quiver
Hi learners!
dim wing
Hello
somber heath
!voice
wise cargoBOT
somber heath
@distant escarp 👋
distant escarp
Olá
woeful salmon
that happens to me too every once in a while
vocal basin
had to restart
(usually switching channels a couple of times is enough)
or just waiting 1~10 seconds
slow venture
hey guys!
just wanted to come chill with you guys
I just cant talk
:((
what you guys been up to?
still no permission
ahhh
ancient lily
hello
slow venture
Hi yu!
vocal basin
what you guys been up to?
doing hair
(it's messed up and I still have hopes it can be fixed)
slow venture
GOOD LUCK!
vocal basin
>Etymology 5
I was just saying it's rare a word has "Etymology 5"
minesweeper.online being weird
for some reason it doesn't actually reload when the button is clicked
it redirects to home page instead
somber heath
@fervent star 👋
vocal basin
playing it online because competitive, yes
I have a little over 10 thousand wins recorded
fervent star
<@811258290465144842> 👋
hello
vocal basin
I have a little over 10 thousand wins recorded
... most of them being beginner level
somber heath
@whole bear 👋
whole bear
obsidian dragon
meow
somber heath
@cyan pivot👋
ancient lily
<@456226577798135808> 👋
is this a bot @somber heath or you just type it
obsidian dragon
.topic
viscid lagoonBOT
warped raft
@vocal basin down for some clash or code or still busy
vocal basin
still busy
warped raft
no problem keep going
just let me know when you're free
rugged root
!stream 163839418623459330
wise cargoBOT
✅ @obsidian dragon can now stream until <t:1679578984:f>.
warped raft
how much time would it take to print this piece @obsidian dragon
somber heath
Thus spoke she.
She shrugged.
You should print spoons. Nobody will suspect a thing.
"This is a lethal weapon?"
"You'd be surprised."
@prisma gust👋
prisma gust
heyy mate
rugged root
How's it going
rugged root
how much time would it take to print this piece <@163839418623459330>
About 1 and a half to 2 days
vocal basin
I just bought 1TB SSD
it definitely wasn't a rush decision
it's Samsung
colour correction is very apparent
someone suggested buying Crucial "because it's cheaper"
it wasn't cheaper
do optical character guessing
rugged root
vocal basin
new word learned: annuity
molten pewter
The greatest 2023 middle school band performance in Stonington. @quasi condor https://www.youtube.com/watch?v=OS2DWN--oLs
vocal basin
do optical character guessing
(realistic version of OCR)
obsidian dragon
Distributions From Pensions, Annuities Retireme
Profit Sharing Plans, A urance Contracts, te
Copy B Report this Income on y
dere
box 4, attach
This information is being furnished to the IRS.
vocal basin
it was able to read "Annuities"
rugged root
Back in a bit
vocal basin
I should learn to put \\. not just . at the start
!e
```py
```
somber heath
English and Chinese. Not helpful.
It's like saying "Speak American"
@swift bear👋
frosty star
I got a new cat
frosty star
I got another one also. Will arrive on Saturday.
On my way to crazy cat ladydom
Would love to stick around for the discussion guys but im soo sleepy 🥲
Gnite
lucid blade
peace
somber heath
@sick condor👋
sick condor
Yeap! @somber heath
rugged root
!charinfo [╓╘..]
wise cargoBOT
golden sonnet
hi
you guys up to find my bug?
it's a regex thing i think
def convert(s):
simp = r"([0-1]?[0-9]) (AM|PM) to ([0-1]?[0-9]) (AM|PM)"
comp = r"([0-1]?[0-9]):([0-5][0-9]) (AM|PM) to ([0-1]?[0-9]):([0-5][0-9]) (AM|PM)"
if re.search(simp, s):
f_hour, f_time, l_hour, l_time = simp_val(simp, s)
if f_time == "AM" and f_hour == 12:
f_hour = 0
elif f_time == "PM" and f_hour != 12:
f_hour += 12
if l_time == "AM" and l_hour == 12:
l_hour = 0
elif l_time == "PM" and l_hour != 12:
l_hour += 12
return f"{f_hour:02}:00 to {l_hour:02}:00"
elif re.search(comp, s):
f_hour, f_min, f_time, l_hour, l_min, l_time = comp_val(comp, s)
if f_time == "AM" and f_hour == 12:
f_hour = 0
elif f_time == "PM" and f_hour != 12:
f_hour += 12
if l_time == "AM" and l_hour == 12:
l_hour = 0
elif l_time == "PM" and l_hour != 12:
l_hour += 12
return f"{f_hour:02}:{f_min:02} to {l_hour:02}:{l_min:02}"
else:
raise ValueError
!d re.compile
wise cargoBOT
golden sonnet
it should take 9:00 AM to 5:00 PM and return 09:00 to 17:00
or take 9 AM to 5 PM and return 09:00 to 17:00
i take the time and then format it
vocal basin
!e
import re
comp = re.compile(r"([0-1]?[0-9]):([0-5][0-9]) (AM|PM) to ([0-1]?[0-9]):([0-5][0-9]) (AM|PM)")
s = r"9:00 AM to 5:00 PM"
print(re.match(comp, s).groups())
@vocal basin :white_check_mark: Your 3.11 eval job has completed with return code 0.
('9', '00', 'AM', '5', '00', 'PM')
i used that in it giving my green light
rugged root
golden sonnet
but when i run it and give 9:00 AM to 7 PM
it should raise valueerror
it's for a cs50 test
they are giving the input
no it's a problem set
no
golden sonnet
but when i run it and give `9:00 AM to 7 PM`
it should raise valueerror
but it's not raising anything
rugged root
r"([0-1]?[0-9]):?([0-5]?[0-9]?) (AM|PM)"
!e
import re
comp = re.compile(r"([0-1]?[0-9]):?([0-5]?[0-9]?) (AM|PM)")
first_case = r"9:00 AM to 5:00 PM"
second_case = r"9:00 AM to 7 PM"
print(comp.findall(first_case))
print(comp.findall(second_case))
@rugged root :white_check_mark: Your 3.11 eval job has completed with return code 0.
001 | [('9', '00', 'AM'), ('5', '00', 'PM')]
002 | [('9', '00', 'AM'), ('7', '', 'PM')]
@golden sonnet Does that help at all?
golden sonnet
i'm thinking if i can match that with the other parts
sooo
when i input 9:00 Am to 7 PM
i get 00:00 to 19:00
i mean not only i don't get valuerror
9 turns into 0
mm i don't follow
Oo that's typo
or you prefer text?
golden sonnet
import re
def main():
print(convert(input("Hours: ")))
def convert(s):
simp = r"([0-1]?[0-9]) (AM|PM) to ([0-1]?[0-9]) (AM|PM)"
comp = r"([0-1]?[0-9]):([0-5][0-9]) (AM|PM) to ([0-1]?[0-9]):([0-5][0-9]) (AM|PM)"
if re.search(simp, s):
f_hour, f_time, l_hour, l_time = simp_val(simp, s)
if f_time == "AM" and f_hour == 12:
f_hour = 0
elif f_time == "PM" and f_hour != 12:
f_hour += 12
if l_time == "AM" and l_hour == 12:
l_hour = 0
elif l_time == "PM" and l_hour != 12:
l_hour += 12
return f"{f_hour:02}:00 to {l_hour:02}:00"
elif re.search(comp, s):
f_hour, f_min, f_time, l_hour, l_min, l_time = comp_val(comp, s)
if f_time == "AM" and f_hour == 12:
f_hour = 0
elif f_time == "PM" and f_hour != 12:
f_hour += 12
if l_time == "AM" and l_hour == 12:
l_hour = 0
elif l_time == "PM" and l_hour != 12:
l_hour += 12
return f"{f_hour:02}:{f_min:02} to {l_hour:02}:{l_min:02}"
else:
raise ValueError
def simp_val(simp, s):
simp_group = re.search(simp, s)
f_hour = simp_group.group(1)
f_time = simp_group.group(2)
l_hour = simp_group.group(3)
l_time = simp_group.group(4)
f_hour = int(f_hour); l_hour = int(l_hour)
if f_hour > 12 or l_hour > 12:
raise ValueError
return f_hour, f_time, l_hour, l_time
def comp_val(comp, s):
comp_group = re.search(comp, s)
f_hour = comp_group.group(1)
f_min = comp_group.group(2)
f_time = comp_group.group(3)
l_hour = comp_group.group(4)
l_min = comp_group.group(5)
l_time = comp_group.group(6)
f_hour = int(f_hour); f_min = int(f_min)
l_hour = int(l_hour); l_min = int(l_min)
if f_hour > 12 or l_hour > 12:
raise ValueError
return f_hour, f_min, f_time, l_hour, l_min, l_time
if __name__ == "__main__":
main()
https://cs50.harvard.edu/python/2022/psets/7/working/
the problem
if you want to check
so it should get input in one of the two formats
Oo i got it i think
soooo
who's in the mood for unit test?
i have my tests written but cs50 wants more
and i don't know what they want :/
i have written anything that comes to mind
!paste
wise cargoBOT
bleak lava
<@966707231242477608> 👋
sorry dude I can listen to you guys I broke my microphone today!
are you, guys regularly hanging out here @somber heath
vernal bridge
golden sonnet
hii
rugged root
are you, guys regularly hanging out here <@317279909112446976>
I don't know how to leave
golden sonnet
bleak lava
@somber heath then I can ask for help with programming from you guys!
golden sonnet
anyone in the mood to look at my unit test?
i like unit test
but cs50 tends to be a b.. about it
vocal basin
*I just bought 1TB SSD*
it definitely wasn't a rush decision
SSD acquired
golden sonnet
do you have 512gb ssd to spare?
vocal basin
SSD acquired
(idk yet how to add it to LVM but it shouldn't be hard)
gentle flint
I don't know how to leave
might I suggest the disconnect button
golden sonnet
you got any game syggestion?
am bored
vocal basin
if you had played minesweeper as much as i have..
how much if measured in hours?
golden sonnet
i didn't count really
but i know i wasn't one to study
i have
but my grandpa is the big fan of that
vocal basin
I have a little over 400 hours recorded
golden sonnet
i loved total war rome :/
golden sonnet
it's been month since i playes any video games
vocal basin
SSD acquired
I'm very bad at existing outside the house
I got out of the train at the wrong stop, thought I exited one too early, now I'm going in the wrong direction even more
golden sonnet
i fixed my unit test problem
hours of pain
because of this
if __name__ == "__main__":
i mean if they want something from me they should say it
limpid umbra
howdy
golden sonnet
hi
you know as much as regex looks scary at start it's actually not bad
it's not that hard to learn
limpid umbra
when i write code - i never use CLASS , but i have seen it used here and there , pygame uses them , some programmers avoid them - is there a actual advantage using them?
golden sonnet
you use class when you want an object that can have methodes
limpid umbra
ya
golden sonnet
like a str
limpid umbra
when i use , pyserial , classes inside
gentle flint
limpid umbra
orange cat - looking relaxed
gentle flint
vocal basin
btw, blocking code can trigger reconnect
rugged root
It blocks the heartbeat I'm guessing?
vocal basin
something of that nature, yes, seems like
from my experience, same can also happen with high CPU load
(probably because of blocking too but in a different form)
golden sonnet
so i have a project idea that i don't know if i can pull it off
it goes like this:
a program to manage screen time
it gets an input (defaulted on 4 hours)
then it countsdown untill it reaches 0
then it'll shutdown the pc
timer resets every 24 hours
and if you have to use the pc again
you turn it on and it gives you 5 minutes
you can disable the program in this 5 minutes
otherwise it shuts down again
limpid umbra
you can transfer W10 liscence to other machine but can also run with no liscence
limpid umbra
no liscence prevents changing background screen but - just use irfanview pic viewer , it will allow it to change Back screen
i always remove the shortcut arrows on my screen icons - i dont want to be reminded im using windoze
worn wind
🤓 ☝️ exactly
rugged root
@somber heath You are to me ❤️
There's someone back here hanging up blinds so I'm radio silent
golden sonnet
what's your take on bard?
limpid umbra
jframe -- mmm ok thats new
rugged root
Not wrong
terse needle
limpid umbra
its not a elastic ball - it needs to squish
is this actually valid ?
what about C++
lots of MCU chips are only C / C++ im kinda avoiding it all
velvet trench
based fortran
rugged root
Hmm, not sure... #algos-and-data-structs would know better than I can answer
Back later, sorry
austere onyx
I know there's a way to compile python to run much faster than it is, I think it's called numba
molten pewter
tshark -r infile -T fields -e data | tr -d '\n' > tempfile
Predictive analytics for cyber attacks: Build a machine learning model that uses big data to predict cyber attacks before they occur. You could analyze patterns in network traffic, login attempts, or other indicators to identify suspicious activity and generate alerts.
Anomaly detection in network traffic: Develop an algorithm to detect anomalous network traffic that could be a sign of a cyber attack. You could use big data techniques to analyze large amounts of traffic and identify unusual patterns or behaviors.
Cyber threat intelligence analysis: Collect and analyze a large dataset of cyber threat intelligence feeds to identify patterns and trends in cyber attacks. This could involve using natural language processing and machine learning to extract insights from unstructured data sources.
Malware detection using machine learning: Build a machine learning model that can detect malware by analyzing large volumes of data on file characteristics, network traffic, and behavior. You could use techniques such as clustering and classification to identify malicious files and generate alerts.
Cyber security risk assessment: Develop a framework for assessing cyber security risks using big data techniques. You could use data from a variety of sources, including vulnerability scans, network logs, and incident reports, to identify potential risks and prioritize remediation efforts.
Intrusion detection and prevention: Build an intrusion detection and prevention system that uses big data to analyze network traffic and identify potential threats. You could use machine learning algorithms to learn from past incidents and improve the accuracy of the system over time.
Behavioral analytics for insider threats: Use big data techniques to analyze user behavior and identify potential insider threats. You could use machine learning to detect anomalies in user activity, identify high-risk users, and generate alerts when suspicious activity is detected.
gentle flint
https://twitter.com/HD_Kirin/status/1638361179025477633
sadly it's already been removed
https://www.gamespot.com/articles/steam-visual-novel-claiming-to-prep-your-tax-return-has-been-removed/1100-6512593/
molten pewter
No wonder I was having trouble finding it
Apparently it drops April 4th....
seems to be cutting it close
"Do Your Federal Taxes While Romancing Your Waifu!"
"It’s always been a dream of mine to meet that special someone…and file their tax return"
"if you file your taxes in the game, you file your taxes in real life."
gentle flint
ye
molten pewter
somber heath
No wonder I was having trouble finding it
😬
somber heath
atomic sky
https://youtu.be/or7njUlYTLI
Wood screws
atomic sky
Torvalds was right.
🤣 then there's "AMD has no drivers" don't know if that's still a thing
I used to just use Intel gpus for linux
Still using my 980ti bought when it came out , chillin.
somber heath
@slender pollen👋
slender pollen
@somber heath Hai2
ivory flower
HI, which channel should I go ask my question about data modeling invoice and sale order in an e-commence system? is it #databases or #software-architecture or #web-development ?
somber heath
HI, which channel should I go ask my question about data modeling invoice and ...
I'd add #data-science-and-ml and #algos-and-data-structs to your list of considerations, but to answer, I don't know.
vocal basin
I don't remember being in any way "stuck" when learning python
some specific problems might be hard to solve, but the general learning process never posed a "I can't progress" situation
first time learning immutable trees was hard because I had no idea how to look it up
(... so I just came up with my own solution)
vocal basin
I don't remember being in any way "stuck" when learning python
some specific pro...
.. tbf, for the first 4 years I was taught python by one of the best teachers in the country
vocal basin
first time learning immutable trees was hard because I had no idea how to look i...
ig, this can be classified as "vocabulary" issue too
I never successfully programmed a single proper game
although I have plans of making my own cooperative version of minesweeper
(for more than 2 players)
vocal basin
although I have plans of making my own cooperative version of minesweeper
(for m...
probably Rust for back-end and Python for the web API
with ZeroMQ between them
somber heath
@merry forge👋
merry forge
<@831526539190599680>👋
Dude wassup? @somber heath
vocal basin
first cell is always empty
but there are situations
like
you can click the corner and it's 3
field fully generates on the first click
... which can be right click
so there are ways to lose on first opened cell
"no guessing" mode
https://minesweeper.online/new-game/ng
seems like they just pre-generate fields and "brute force" (to some extent) them with an algorithm
it doesn't build the field out of small solvable pieces
it sometimes generates 20~30 mine sequences just because they can be solved by an algorithm
vocal basin
"no guessing" mode
https://minesweeper.online/new-game/ng
at first I played this mostly
but then switched to standard mode
(because the standard mode is regarded there as "more competitive" in some sense)
somber heath
@rustic comet 👋
somber heath
@bleak orbit👋
bleak orbit
👋@somber heath
bleak orbit
Does anyone suggest the best site to study Machine Learning?
obsidian dragon
python use excel?
bleak orbit
no python use csv file it is just look like excal
obsidian dragon
can python use excel
somber heath
Depending on the format it saves the data in, you may need an external library.
Python has the csv module for assisting in the parsing of csv formatted data, but you can parse that without it.
As for Excel's native format, xls, et al, there are pip-downloadable modules that handle them.