#ot1-perplexing-regexing
1 messages ยท Page 608 of 1
I've... never had these kinds of problems
There is more problems than solutions
is anyone here proficcient in matlab
@fickle dirge did you figure out how to convert from decimal to binary and back?
i know how to do this A binary system uses base 2 and has digits 0 ๏ 2. Each position from the right represents how many of 2n. For example,
11011 =1 * 24 + 1 * 23+ 0* 22 + 1* 21+ 1* 20
Right. A decimal number has a ones places, a tens place, a hundreds place, a thousands place, and so on.
1010 in decimal is zero ones plus one tens plus zero hundreds plus one thousands.
A binary number has a ones place, a twos place, a fours place, an eights place, and so on.
1010 in binary is zero ones plus one twos plus zero fours plus one eights.
but know how do i get the leeter
how i do the remandir way?
decimal system to another base
@solid elbow
if you've got a decimal number and want to convert to binary:
if it's divisible by 2, write a "0" down, otherwise write a "1" down.
then divide the number by 2 (throwing away the remainder).
repeat until you reach 0.
The binary is the numbers you just wrote down, in reverse.
can u give me a example and i can try it
let's take 11: it's not divisible by 2, so the rightmost binary digit is 1.
divide it by 2 (throwing away the remainder) and you're left with 5. It's not divisible by 2, so the second rightmost binary digit is 1.
divide it by 2 (throwing away the remainder) and you're left with 2. It's divisible by 2, so the third rightmost binary digit is 0.
divide it by 2 (throwing away the remainder) and you're left with 1. It's not divisible by 2, so the fourth rightmost binary digit is 1.
divide it by 2 (throwing away the remainder) and you've reached 0, so you're done.
The binary representation is 1011.
ok so if it is not divisible binary is 1 if it is then its 0?
right. Because if it's not divisible by 2, then its value is 2**n + 1, and if it is divisible by 2, then its value is 2**n + 0
that 1 or 0 is the last binary digit.
ok
can u give me 3 qeustions I can try
dont tell me the anwser tho
@solid elbow
sure - try 5, 17, and 26
ok
another way to look at this is that, at every step, you look at the number mod the base you're working in (so, N % 2 for binary), you write down that modulus (aka the remainder) as your least significant digit, and then you divide by the base. Repeat until you hit 0.
01, 1001, 0101
hm - no, on all 3 ๐
oh ok
Everyone knows about the programming language?
5 is 101
5 % 2 is 1, so the rightmost binary digit is 1
divide 5 by 2 and throw away the remainder and you're left with 2
2 % 2 is 0, so the second rightmost binary digit is 0
divide 2 by 2 and throw away the remainder and you're left with 1
1 % 2 is 1, so the third rightmost binary digit is 1
divide 1 by 2 and throw away the remainder and you're left with 0, so you're done.
"you're left with 0, so you're done" sounds like life
17 is 10001
17 % 2 is 1, so the rightmost binary digit is 1
divide 17 by 2 and throw away the remainder and you're left with 8
8 % 2 is 0, so the second rightmost binary digit is 0
divide 8 by 2 and throw away the remainder and you're left with 4
4 % 2 is 0, so the third rightmost binary digit is 0
divide 4 by 2 and throw away the remainder and you're left with 2
2 % 2 is 0, so the fourth rightmost binary digit is 0
divide 2 by 2 and throw away the remainder and you're left with 1
1 % 2 is 1, so the fifth rightmost binary digit is 1
divide 1 by 2 and throw away the remainder and you're left with 0, so you're done.
26 is 11010
26 % 2 is 0, so the rightmost binary digit is 0
divide 26 by 2 and throw away the remainder and you're left with 13
13 % 2 is 1, so the second rightmost binary digit is 1
divide 13 by 2 and throw away the remainder and you're left with 6
6 % 2 is 0, so the third rightmost binary digit is 0
divide 6 by 2 and throw away the remainder and you're left with 3
3 % 2 is 1, so the fourth rightmost binary digit is 1
divide 3 by 2 and throw away the remainder and you're left with 1
1 % 2 is 1, so the fifth rightmost binary digit is 1
divide 1 by 2 and throw away the remainder and you're left with 0, so you're done.
first I get the number and then % it by the base and then if its a 0 or 1 then thats the first binary digit. Then after i divide the number by the base and then what ever that is I percent it with the base agian untill the divition part is 0
i am i right?
you take the number and % it by the base. You write that digit down, then divide by the base (throwing away the remainder) and repeat. You stop when you reach 0 (because continuing past that point would give you infinite zeroes)
the result is your digits in the new base, from least significant to most significant - or in other words, from right to left.
yeah so it would be smt like this
it's:
while n > 0:
print(n % b)
n = n // b
not trying to code it
and the results are printed from the least significant digit to the most, so you need to read them from bottom to top.
well, you wrote pseudocode ๐
i like how its formated there thats why i am usign that
n / b = remainder gone ```
over agian untill its 0
ok
so give me an example i am see if my thing is right?
25
can I use a calculator for this?
you shouldn't really need one - just a bit of scratch paper. You saw me working out the 3 examples above in a few lines, with full explanation
25%2 is 1, so your rightmost digit should be 1.
12%2 is 0, so your second rightmost digit should be 0.
6%2 is 0, so your third rightmost digit should be 0.
3%2 is 1, so your fourth rightmost digit should be 1.
1%2 is 1, so your fifth rightmost digit should be 1.
That results in 11001, read from left to right.
You listed out the steps right, but the answer you came up with was wrong - I'm not seeing how you got the 10010 that you got.
your steps should be:
25 % 2 = 1 25 / 2 = 12
12 % 2 = 0 12 / 2 = 6
6 % 2 = 0 6 / 2 = 3
3 % 2 = 1 3 / 2 = 1
1 % 2 = 1 1 / 2 = 0
and your bits are the results of the %, with the bottom one being the leftmost bit and the top one being rightmost - so, 11001
!e print(bin(25))
@solid elbow :white_check_mark: Your eval job has completed with return code 0.
0b11001
yeah
so isnt the this part
oh
wait
how 25 % 2 is 0.5
so isnt 0
@solid elbow
where are you seeing 0.5?
@solid elbow :white_check_mark: Your eval job has completed with return code 0.
1
% computes the remainder after division - 25 divided by 2 is 12 remainder 1, so 25 % 2 is 1.
the % there doesnt do what % means in most programming contexts
you dont really need a calculator to tell if a number is odd or even
right.
yeah
oh ok
that calculator was computing 25% of 2 - which is 1/4 of 2, which is 0.5
which is different from what 25%2 is.
no ๐
@solid elbow :white_check_mark: Your eval job has completed with return code 0.
0b101110
ah, you have it flipped
you wrote the digits from left to right (or top to bottom), instead of from right to left (or bottom to top)
!e print(bin(50))
@solid elbow :white_check_mark: Your eval job has completed with return code 0.
0b110010
you had the last digit wrong
50 is divisible by 2, so the last digit should be 0, not 1
oh ok
yeah
so I know how to do decimal system to another base
but know
how do I convert things like ABCD hex to binary, FFFF to decimal
also find What is 1010 in hex
just random numbers
but how do i solve things like this?
the system I just taught you works for converting decimal to any other base - you'd use n % 16 and n / 16 at each step instead of n % 2 and n / 2 if you were converting decimal to hex, for instance.
if you want to convert the hex A1CD to decimal for example, number the digits from the end like:
A 1 C D
3 2 1 0
then write each digit as its decimal value
10 1 12 13
3 2 1 0
then the decimal form is the sum of digit * base^index, so
13*16^0 + 12*16^1 + 1*16^2 + 10*16^3
= 41421
how do I know what the decimal value is
after 15 they the same?
A decimal number has a ones places (10**0), a tens place (10**1), a hundreds place (10**2), a thousands place (10**3), and so on.
1010 in decimal is zero ones plus one tens plus zero hundreds plus one thousands.
A binary number has a ones place (2**0), a twos place (2**1), a fours place (2**2), an eights place (2**3), and so on.
1010 in binary is zero ones plus one twos plus zero fours plus one eights.
A hex number has a 1s place (16**0), a 16s place (16**1), a 256s place (16**2), and a 4096s place (16**3).
1010 in hex is (0 * 1) + (1 * 16) + (0 * 256) + (1 * 4096)
hex is a base 16 number system. There are only 16 digits in it - the first 10 are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, and the next 6 are a, b, c, d, e, f
oh ok
"hex" is short for "hexadecimal", and the "hex" part of that is the greek word for 6. and the "decimal" part is latin for 10 ๐
Ok i get this
๐
there's actually a shortcut you can take for converting from hex to binary, too
what does this work for converting waht to what
Yeah. 4 4...
because the number of symbols in hex (16) is a power of the number of digits in binary (2) - namely, 2**4 == 16 - every 1 hex digit corresponds to exactly 4 binary digits. So you can take a shortcut when converting hex directly to binary: you can just convert every hex digit to binary, from left to right.
hex A 1 C D
dec 10 1 12 13
bin 1010 0001 1100 1101
!e print(bin(0xA1CD))
@solid elbow :white_check_mark: Your eval job has completed with return code 0.
0b1010000111001101
Converting from hex to bin or octa to bin is easy. Small hacks.
yep. You can do that shortcut when converting hexadecimal to binary or octal to binary, but you can't use it for converting hexadecimal to decimal, or decimal to binary.
it only works when the number of symbols in one base is the number of symbols in the other raised to some power.
any base to decimal
so if theirs a question to solve adfc to dex waht type of convertion is it called and i can use the trick or the other thing above #ot1-perplexing-regexing message
you have to use hsp's version for that. You figure out the decimal value of each of the digits:
a=10 d=13 f=15 c=12
and then you consider the place that they're each in, and add them together
so I cant use the shortcut?
ooh, I made a mistake somewhere there ๐
its aefc
ah
ok
shortcut only works for binary to/from oct or hex
!e ```py
print((10 * 163) + (13 * 162) + (15 * 161) + (12 * 160))
print(0xadfc)
@solid elbow :white_check_mark: Your eval job has completed with return code 0.
001 | 44540
002 | 44540
so what tpye of conversion is it tho hex to dex or bin to hex?
the long way would be hex -> decimal and then decimal -> binary
the short way is #ot1-perplexing-regexing message
@solid elbow :white_check_mark: Your eval job has completed with return code 0.
0b1010110111111100
ok
the bin can just be read left to right on that.
is that all the conversions or is there more?
ok
uh, there's octal, which we mentioned above - it's a base 8 number system
the digits are 0 through 7.
if you only care about those 3, then there are 6 possible conversions:
dec -> hex
dec -> bin
hex -> dec
hex -> bin
bin -> hex
bin -> dec
which we cover so far
of those, there's a shortcut that works for hex -> bin and bin -> hex, and you have to do all the others the hard way.
I'm not sure what you mean
you should be able to do all of those. The dec -> bin and dec -> hex can be done through iterated modulus and division, like we did at first - the only difference between those is whether you mod and divide by 2 or 16, and how you write the digits down (for dec to hex, when you do the n % 16 if you get a number < 10 you just write it down directly, but if you get 10 you write A, 11 you write B, etc)
oh ok
for hex to bin you can use the shortcut of converting 1 hex digit to 4 binary digits and then concatenating them together.
for bin to hex you can use the same shortcut, by padding the binary number with 0s on the left until the number of digits is a multiple of 4, and then converting each set of 4 binary digits to 1 hex digit and then concatenating them together
so if a have a decimal and want to do it in hex i would use the first method we did?
yep.
ok
^same way for octa just 3 numbers instead.
if its hex to bin i either use the shortcut or this way #ot1-perplexing-regexing message ?
That is long way. And for deci.
That's the simple way for hex to bin. Can give example if you need.
A => 10, ...
A 1 C 5
A 1 C 5
1010 0001 1100 0101
8421 8421 8421 8421(this line just for reference)
yeah hex to deci
ok
how do u get the # 1010, 0001 and on
a = 10 in decimal, which is 1010 in binary.
yeah
you're converting each hexadecimal digit to binary in isolation, and concatenating the results together.
uhm, basic binary.
abcd => a*2^3 + b*2^2 + c*2^1 + d*2^0
i see were 1010 is coming from but dont know about 0001
are u doing the first method thing any # with base?
1 hex == 1 dec == 0001 as 4 binary digits
you're always converting 1 hex digit to 4 binary digits with the shortcut
and if you need to do the iterated division approach for converting 1 dec to binary, it's 1 % 2 == 1, so the rightmost digit is 1, and then 1 / 2 = 0, so all remaining digits to the left are 0
oh so the remainder is hex to bin
the shortcut is that you can do one digit at a time - one hex digit converts to exactly 4 binary digits, and vice versa.
but for converting each digit, you're still doing the division/remainder stuff
ok so that means i can do it using the shortcut or the division/remainder way
yes
ok
either way you're doing the division/remainder way, but the shortcut means that you can do that for one digit at a time, instead of converting the entire hex number to dec, and then doing the division/remainder way on the big dec number
hex to decimal.
yeah ok so its the same as the division/remainder way ?
may be i can just put two messages together to make it on same page.
HEX to DECI
if you want to convert the hex A1CD to decimal for example, number the digits from the end like:
A 1 C D
3 2 1 0
then write each digit as its decimal value
10 1 12 13
3 2 1 0
then the decimal form is the sum of digit * base^index, so
13*16^0 + 12*16^1 + 1*16^2 + 10*16^3
= 41421
HEX to BINARY
A => 10, ...
A 1 C 5
A 1 C 5
1010 0001 1100 0101
8421 8421 8421 8421(this line just for reference)
kind of, you can get the same one by divison reminder too, but it will be a very long process.
example:
for B:
/2 %1
B(11) 5 1
5 2 1
2 1 0
1 0 1
Ans: 1011
now if number is 2 or 3 digits long, it will be a long long division, which will be same as this shortcut method.
you can try both on long digits like A5 or something.
can i use a calculator for this?
ok
thanks
for the shortcut the only thing i dont get is how u get this 1010 0001 1100 0101
by this.
see how i got B.
under b did u just write that down agian with out the 0 or is that smt else that is part of the thing?
you mean 5, 2, 1?
yeah
oh i mean thast how we convert deci to bin
then wahts hex to bin
no issues:D
Everything it's about this server
They can't even know your address, really. The IP tells them who your ISP is, and maybe what town or city you're in - but maybe not, that depends entirely on how the ISP manages its IP allocations. It usually finds something "close enough" to where you live, but that might be a metro area where millions of people live
Other than that, your IP address uniquely identifies your router. They can send traffic to your router to keep it busy or try to attack it.
the only address they'd know is your IP address lol
https://www.iplocation.net/ shows how well your IP can be matched to a location.
but that doesn't mean it wouldn't become a heck of a lot easier to find out where you do live more precisely, though
Find out your geolocation from your IP address now. We will automatically detect your IP address and display it's geolocation including country, state & city.
Basically know my somewhat location
for me, it's a whole town away
But could they hack my pc or smth?
if you have ports open, some bad things could happen if they're found
but in general, you're usually completely fine
It's not impossible, but it's pretty unlikely.
Your router has security features that should keep you safe. Even if those fail, at worst they'd be able to take over your router, not your computer.
Though once they had control of your router, they could use that to try to attack your computer.
It's theoretically possible, if your router and your computer both have some security vulnerability that the attacker can find and exploit. But it's very, very unlikely
how to ban myself from this server like for everything I do is too fixated
just leave lol
@latent scaffold this is the cat u hate
this is not a cat.
I hate that cat, negl
we haven't named it actually.
hmm
why dude what I did to hurt you
youre a troll
mmm 4am anxiety this is fun
annoying relatable except it's 3 AM here
You literally asked how to ban yourself from this server...
as a matter of fact not doing[=
yee im about to fight the law wish me luck ๐ค
what law?
can anyone help me my image is not coming
@rough sapphirehello, please don't crosspost your message into all 3 offtopic channels, just one is fine, ideally one which doesn't have an ongoing conversation.
On the note of the image not showing up. Did you save the file, Did you do a full reload of the webpage without cache, are you sure whatever you are using to view the site has the most up to date version of it
I guess images/showcase.jpg should work.
It does!
thank you so much!
๐
I am AFK
shorts#meme #shorts #funnyvideo #funnyclips #dankmemes #dank
ORIGINAL VIDEO: https://www.youtube.com/watch?v=0koZEPB-pg0&t=13s
๐ฅฐThank you for supporting my small channel! I will keep uploading to make you'll smile!๐ฅฐ
NO COPYRIGHT INFRINGEMENT... ALL RIGHTS & CREDITS BELONG TO THE RIGHTFUL OWNER.
โ ๏ธ Copyright Disclaimer, Under Section 107 of the...
This is not a meme dump, this is offtopic channel which has its rules. You cross-posted this spammy link (with copyright bullshit in description) in all 3 channels...
basically, don't cross post in all channels and this is not a meme dump
Don't call other people kids
what if they're actually kids :D
lol
i am a 13 year old who has interest in python so i am here i am not saying others kid
You said "I apologise / um kid", which sounded like "I apologise, uhm, kid.
the way you said it, you were calling me/someone a kid
that meme maybe be good but you were "spamming" it across 3 channels which is not good and against the rules. And memes are only appropiate when they are in the context with what is going on in the channel or something
but yeah its okay now
more info should have the button
more info and run anyway
I excluded this folder on windows defender, but it's still stopping me from running it
oh ok
thx, it works
your game is dope man, very impressive
tyty
https://youtu.be/zyC-F_7QXtk youtube recommended me this gold again
Hereโs a #shorts clip of the no full auto in building meme from our original video Wat 3. #airsoft #meme
it has recommended this to me on several occasions, but I've never watched it xD
it's a classic
could anyone help me with github please
I feel like I have fucked something up real bad
and cant get it to work anymore
so basically, Im getting this message
and i cant commit or do anything
I dont really know what to do anymore
not hard
but yes editing the file directly is the easiest
['.git', '.circleci', '.gitignore', 'Dockerfile', 'input', 'old_scrape.py', 'requirements.txt', 'run.sh', 'run_and_upload.sh', 'scrape.py', 'src', 'kUBh8MCyw1hpoj.csv']
^This is os.listdir()
cat: kUBh8MCyw1hpojv.csv: No such file or directory
^This command is one line underneath it
how is it possible that it cannot find the file
when os.listdir() confirmed that it was inside the directory
I had to grow a moustache to code like a pro
sigma rule โ
the best cheatsheet is actually trying it out yourself
umm and how can i try it out if i have forgotten some concepts
keep practicing the point is not to remember specific recipes but to understand how decorators work, how they wrap functions, how they take args, etc so you can create your own without having to follow a list
...
its not a hard concept my guy, look them up initially, practice, you wont have to remember how to write a decorator eventually
cheatsheets are a crutch
but in the beginning when you're gonna have to look it up anyway, why not have a cheat sheet? handy for when brain doesn't work on mondays
like, who doesn't have a sql join cheat sheet at work
People who use document databases
who is familiar with vs code remote dev?
ik decorators lol, i just want a quick revision
too many langs mess up the brain
yup
i know its a dumb question forgive me im new, but, can i get the same results of using tails running a linux OS on a vm then uninstalling the vm?
learn X in y seconds
๐
Enjoy your new Volvo
You should ask your actual question rather than a gateway question
That way if someone who knows the answer sees it, they can answer
Rather than having to waste time playing tag before the question is even posted
Did I really look like playing tag?
Criticizing people's posts isn't the right answer either!
I mean, it seems like they were suggesting a way to effectively get an answer
you can't get better without criticism
I don't read it as a suggestion dude
Well I apologize that's not my intent to be rude, just trying to help you get an answer.
@spare horizon ^
@frail badgeThe biggest difference is that PyCharm has a more "Batteries included" design philosophy
PC is a fully-fledged IDE straight out of the box packed with features
hmm?
oh wait
okay
but then wont VSC be the same thing if u just get the right extensions
Getting the right extensions is the big difference, yeah
VSC ships as a relatively lightweight text editor on steroids
right
which you then customize into whatever you want with plugins
IIRC the performance difference between PC and VSC with the extensions needed to make it functionally equivalent is fairly negligible, unless you're in a position where you need to save resources as much as possible
People might use PyCharm because they like the way JB implemented certain features more than the equivalent plugins, or because they just want to get a full IDE without any additional configuration, etc etc etc
hmm
It comes to subtleties and personal preference more than anything, because, at the end of the day, it all just boils down to editing text
you're welcome, #editors-ides is a good place for similar discussions or more info on this topic
alright
definitely not, pycharm uses 2x+ the amount of RAM on my system, and is far slower
R7 5800x @ 4.6ghz all core, 32GB DDR4-3600, and an RTX 3070 ti
so hardware bottlenecks are definitely not the issue lol
hi
hello
admin
lmfao i need to find a medium
I hear the happy ones are the best.
no problem, I might get nervous quickly
medium is open source !?
I've never encountered any issues with it running on i5-7600 and 8GB DDR4, /shrug
The startup time was the only noticeable difference for me, and even that stopped being a factor once I switched to an ssd
I would say on a good system, PyCharm should run fine
If you have a potato system then you're going to have a bad time
pretty much
No, it just says it is open to everyone
shit i read it wrong
paywall xxx
medium's content isn't that bad but the platform sux
Medium has turned into quora
quora but cooler (in looks)
@west zephyr https://github.com/raquo/Laminar since u code scala, u might wanna look at this
i believe that flutter and MAUI are the future of GUI's honestly
#axolotl #minecraft #xpfarm
send this to your friends and rick roll them good luck :)
@dapper dew i did it :D
oh damn
That was arch though?
void linux
Gotcha
I have win10 with ubuntu WSL
ah i see. so u no dual boot?
Nope
oh well. thats also fine
Yeah...still not sure how I'm going to go about enabling secure boot lol
I really
That's not
No
I meant something else
But I applaud your joke
use sbctl :D. it was actually because my efivarfs is read only
now i change it to read and write in fstab
and did it again
that fixed it
:D
thank you thank you
Yeah I think I'll give it a shot
goodluck!
I'm gonna need it
sbctl is made by the lead arch devs
now i dont have to worry about games such as Valorant and Apex which requires secure boot
but i dont play them so
ยฏ_(ใ)_/ยฏ
yo truth
idk u can also add tequila to most things
flavor life hacks, i like putting tequila on my salad
Chilli oil goes with anything
maybe
It does
im not putting that on cake
Do it.
no
add apple to everything
dont knock it till you try it
Yes ๐
but i dont like apples-
damn hsp talking real
That's life - Frank Sinatra
its like the only sweet thing in my house so i ate around 3, i dont think my somtach likes but ๐
dw i like a singular apple
as soon as there;s a group of them though,,,
haha cant get rejected by crush if u dont feel attraction get rekt allosexuals
hate Apple
Poor @broken dew
rude
๐
thought maybe that can also be seen as offensive
you don't even deserve your own proper noun
I still do love your pfp btw apple
Thanks ๐
i feel called out 
as you should
hi
The og message was about prs, but I never said that so I'll say it now.
I need to find a medium, I either make monolithic prs or super small ones that build on others
Lmfao it took me a minute to remember
I mean, it was a reply chain
anyone good with satire
nop
related:
A professor (Matthew Perry) and his class welcome a new student (Ana Gasteyer) to Sarcasm 101. [Season 23, 1998]
#SNL
Subscribe to SNL:ย https://goo.gl/tUsXwM
Stream Current Full Episodes:ย http://www.nbc.com/saturday-night-live
Watch Past SNL Seasons:ย
Google Play -ย http://bit.ly/SNLGooglePlayย
iTunes -ย http://bit.ly/SNLiTunes
Follow SNL Soci...
yeah genetics ๐
How to you even manage to get them to sit still long enough for that
@honest star but you do have carpets in cars!
I like the idea of JS just being a carpet I can step on though
i smell poop from far away
Sug
wait, a minute, holy shit - Rust 2021 is out??!?
what?!
Wait what
I know 1.56.0 is out
Oh yeah
The Rust team is happy to announce a new version of Rust, 1.56.0. This stabilizes the 2021 edition as well. Rust is a programming language empowering everyone to build reliable and efficient software.
pog pog pog
!remind 24h update everything
Your reminder will arrive on <t:1634953653:F>!
finally, no more IntoIterator::into_iter(array)
NOICE
i just updated teehee
Same, I need to update the "edition" flag in my projects though
Ooh, 1.58.0-nightly is out too
damn
damn (2)
damn (3)
damn (4)
damn (5)
guys where's 0
why is this channel called some guy named john
lol
john was the original owner of this server IIRC
i need help
help
me
please
@mortal ferry
@remote socket
@shell raptor
hell
o
wtf
?? why u ping them? #โ๏ฝhow-to-get-help ??
@rough sapphire This ping does not matter because the ping is currently representing myself.
Lol
Stop with this annoying behavior
Sometimes i wonder whats wrong with the world and then i open discord
Ssene?
Ccray?
wat
Is it a bad thing that in the two months Iโve been here Iโve sent over 10K messages?
Or is that normal
normal
actually, that means everyone likes you
an apple a day keeps the doctor away
That's a pretty good stat, means you worked for that yellow name 
Oh yeah thatโs a good way to look at it. Iโd estimate >95% of my messages were sent in help channels
I mean if you want to help you can. Its not a mandatory thing
i mean i do want to help, majority of my help is in pygen though
Yeah that is a special kind of help with how quick everything is lol
pfff you fiiiiiine
hmm i stopped coming here last October 2020 to June 2021. i did visit a few times hmm
because julia happened
I love how you've gone back and edited all your old help sessions with snarky comments
LOL
lmao
so thats how it works huh..
imma do that once i am 30, assuming there are still old messages i have
ha I have more messages-per-day
In [12]: 57965 / (datetime.now() - datetime(day=16, month=12, year=2020)).days
Out[12]: 186.98387096774192
In [14]: 132353 / (datetime.now() - datetime(day=4, month=12, year=2018)).days
Out[14]: 125.69135802469135
Ah I'm just behind
>>> 10899 / (datetime.now() - datetime(day=21, month=8, year=2021)).days
175.79032258064515
lol, my help was sooo bad
\๐
do it in the last year instead
like, in 2020 or from 22/10/20 to 22/10/21
from like July 2020
hm ok
ah you have to tell me your message count
i dont have access to all channels you do
right
hmm i joined this server july 27, in the morning
@acoustic moss 103k since 2020-07-01
i was about to join this server july 26 but i was thinking, do i really have to? and then i just did it at 7AM
wtf
lol
215.48 ๐
i joined discord 2 years ago but only used it a year and a quarter
I have 73k messages here
i have 40k messages
but that's not including chat in channels which have been archived/deleted
im not in those channels
I mean like the pixels event channels and code jam ones
you can ask discord for your data and see your messages in archived channels
you don't
When I had a look through my data I saw the lead chat and I was like "oh, cool" and moved on lol
didnt bother to talk there. probably only 3 instances
i dont even join code jam
I only really talked in the code jam during the qualifier
that's like the only part where I had fun
https://www.vpnranks.com/blog/cybercrime-gang-forms-a-fake-company-to-recruit-security-experts-for-cyberattacks/ this article is ameezing
A cybercrime gang, FIN7, sets up a fake company earlier this year to hire security experts and researchers to aid in ransomware attacks.
you got pranked in a nutshell kind of vibe
Hello
ok so i just got windows 11 today and microsoft teams and whatsapp keep crashing
anyone facing the same issue?
also is the #ot0-psvmโs-eternal-disapproval is a mod reference?
Nah, you can find the context
ร = ss
ฤ = nasal vowel, kinda en
ร = e, just with accent
lmfao
john who
how dare you eject golang
I was born to dare
and dare you shall
the attitude you bear
you'll go to the devil's lair
and beat him up
idk why i said that lmao
idk im bored
did u mean bare?
cant rhyme to that i tried
hmm
my first message, i dunno when i did this lol
thanks lol
mine aint that bad, but kinda ironic first msg in a python server is in OT lol
Anyone have the song four twenty by Thomas Jefferson aeroplane https://youtu.be/RZHv5oeuHSw
This is the only copy of it I can find
Check out these Cool Mother Fuckers
!remind 10000d hi
Sorry, you can't do that here!
ah
!otn a fisher ate a lot of meatballs
:ok_hand: Added fisher-ate-a-lot-of-meatballs to the names list.
๐ฅฉ โพ
sounds like a me thing to do
I'm so full. Ouch
It's been years since I've had a meatball ๐ค
meatballs are too good youre missing out
eat one
imma force u to buy
meat
balls
:(
ugh but frozen meatballs kinda disgusting
my what
Get rickrolled.
Lol
your chinchilla in your pfp
its not a rick roll I promise lol pls
Here's your reminder: update everything
[Jump back to when you created the reminder](#ot1-perplexing-regexing message)
Guess I need to update Alpine
#ot0-psvmโs-eternal-disapproval brad is a chad
what are the benefits of being a self-taught programmer?
idk
-_-
being self taught
thats the benefit
๐
but seriously thats it
thats also its flaw
xD
you get to manage yourself which is good for some bad for others
Hello guys i want a help regarding dual boot windows 10 + linux mint
So i inserted my pen drive now and realtime
So which should i select now option
The prime numbers are not regularly spaced. For example from 2 to 3 the gap is 1.
From 3 to 5 the gap is 2. From 7 to 11 it is 4.
Between 2 and 50 we have the following pairs of 2-gaps primes:
3-5, 5-7, 11-13, 17-19, 29-31, 41-43
A prime gap of length n is a run of n-1 consecutive composite numbers between two successive primes (see: http://mathworld.wolfram.com/PrimeGaps.html).
We will write a function gap with parameters:
-
g(integer >= 2) which indicates the gap we are looking for -
m(integer > 2) which gives the start of the search (m inclusive) -
n(integer >= m) which gives the end of the search (n inclusive)n won't go beyond 1100000.
In the example above gap(2, 3, 50) will return [3, 5] or (3, 5) or {3, 5} which is the first pair between 3 and 50 with a 2-gap.
... continue reading
5 kyu
nice
the fact that you have no one but yourself to blame if you realize you got a concept all wrong
Lmao
Spooky
๐ kinda looks like the golden elevator thing in marvels Loki series
This is a threat
wat is dat
what are teeth guards
just got braces removed so i wear those so they dont crook again
damn nice
its hard to make it taste good
i like them out of the can
my taste buds are like a cheat ig since i like those flavors that most ppl dislike but are healthy and i dont really crave sugar

i get funny looks when i dont add sugar to coffee lol
beuh
u and i have completely different kinds of sardines ig
im built different thats why i also like dried crickets
do they sell canned sardines raw? p sure part of canning process cooks them
I mean, I find sardines disgusting but canned mackerel is really tasty and that one should have more omega 3 and more potassium
but either way, it's great that you enjoy eating healthy
were those sardines in tomato sauce tho?
because i've only seen those in oil
i've never seen sardines in tomato sauce
yes tomato sauce cuz the only oil ones are that garbo soy oil feelsbatman
@rough sapphire
hey
lets continue here
what source do you have?
rust isn't much slower then c/cpp
tru tru mr minecraft
Code written in Rust/C/CPP is typically faster than hand written assembly in any case
Since the compiler optimizes it for you
isnt rust also written in C
no
nope
ok, fairly sure they're trolling
they probably are.
so whats up with rs
oooooooooooooooooooooooooooooooo
I heard like you dont lose mem or smth
the output of a C program.
Rust is memory safe, yes (unless you use unsafe)
wheoah
void* dispatch_clients(void* state_ptr) {
struct CordiusServer* server = (struct CordiusServer*) state_ptr;
struct Logger* dispatch_logger = logger_init("DISPATCH", "$NAME > ", 1, 0);
sem_t* lock = sem_open(CORDIUS_REGISTRATION_SEMAPHORE, O_CREAT, 0777, 1);
logger_register_file(dispatch_logger, stdout);
logger_info(dispatch_logger, "%s", "dispatch_clients thread spawned");
while(server->running == 1) {
int index;
int events = 0;
events = poll(server->descriptors->contents,
marray_length(server->descriptors),
DISPATCH_POLL_TIMEOUT);
if(events <= 0) {
continue;
}
logger_info(dispatch_logger, "%s", "Detected events.\n");
/* We cannot do any iteration until the server is done handling requests.
* This is because a new client can be added or removed during this phase,
* and so it could result in segfaults. */
logger_info(dispatch_logger, "%s", "Polling file descriptors.\n");
for(index = 0; index < marray_length(server->descriptors); index++) {
char client_input[2048];
struct pollfd descriptor = server->descriptors->contents[index];
/* We are only interested in reading input from the pipe */
if((descriptor.revents & POLLRDNORM) == 0) {
continue;
}
read(descriptor.fd, client_input, 2048);
printf("%s\n", client_input);
close(descriptor.fd);
descriptor.fd = dispatch_reconnect_fd(server,
dispatch_logger,
server->clients->contents[index].pid);
}
sem_post(lock);
}
sem_close(lock);
sem_unlink(CORDIUS_REGISTRATION_SEMAPHORE);
return NULL;
}
๐คช
stop please
imagine using neither
I just program in my mind
XML is the way to go guys!!!
what does thsi ddo
i am making a daemon in C.
Yeah Imagine
Imagine Actually Having A Fucking Sentinel Value
I am writing a parser
in rust ofc
no for my language
and then I'll port that over to meow
Im writing a snake AI
since its the same type of parser for both
a few minor changes here and there and it'll work for meow just fine
13 hours in researching ๐ญ
what is meow?
^^
I'm still going through Crafting interpreters
its a programming language
I could binge read craftinginterpreters
A quality REPL handles input that spans multiple lines gracefully and doesnโt have a hardcoded line length limit. This REPL here is a little more, ahem, austere, but itโs fine for our purposes.
imaging having strings and not having to rely onchar line[1024]
lmao
i am Sensing Some Agression Here
๐ฅด
yea that
is this how files are always read?
yes
hmm, interesting
Is that crafting interpreters?
yes
You can tell by the language
I'm not sure, I think there might be other books in English. ||\s||
Aight Boys
Everything Is Functional.
i have gone through hell and back trying to perform synchronization.
fn skip_whitescape(&mut self) {
loop {
if let Some(x) = self.peek() {
match x {
' ' | '\r' | '\t' => self.current += 1,
'\n' => {
self.line += 1;
self.current += 1;
}
'/' => {
if Some('/') == self.peek_next() {
// After a //, a comment goes on until the end of the line
'comment: loop {
match self.peek() {
None => break 'comment,
Some(x) => {
if let '\n' = x {
break 'comment;
} else {
self.current += 1
}
}
}
}
} else {
break;
}
}
_ => break,
}
} else {
break;
}
}
}
am I using Rust right
It isolates a programming languages code into a series of tokens
It's the first stage of compilation/interpretation
I'll give you an example, one sec
help m e
what helped me make nicely implement lexers, even in C, was learning finite automata
I need a site can anyone help me?
you want a domain?
yes
Find your place online with a domain from Google, powered by Google reliability, security and performance.
free ?
or if u want a free one consider smth like github sites
ty โค๏ธ
np
Can you reduce nesting by inverting if conditions?
i think u can also get free domains from github student developer pack
I can't open the site
i think confused reptile was trying to make our eyes bleed
that looks esoteric af
can you help me
r u in school/college or are you an adult
I mean it's generally fine
at school
u can get a .tech domain i think
The painful part is if cond: { lots of code } else break
https://pages.github.com/ is github sites
Websites for you and your projects, hosted directly from your GitHub repository. Just edit, push, and your changes are live.

if not cond: break would reduce nesting and make it look slightly less monstrous
wot
?
@frail badge
can you add me as a friend
...is this having bots reacting to it
just ask here
i only have people i know irl as friends
bruh just ask here
there are more qualified people here
can you help me to open a site
https://www.youtube.com/results?search_query=github+sites for github sites
wdym
oh idk anything about insta
i need instagram copyright site can you help me
that's really really weird
<@&831776746206265384>
wot
idt thats a mod-ping thing but ok
they just wanted to get a site and r crossposting it
idk if its illegal or smth idk anything about instagram
return Some(Ok(Token::new(
TokenType::String,
&self.code[start..self.current],
self.line,
)));
three levels of nesting ๐ฅด
๐ ฑ๏ธoy
urk
there's a big difference, you see, between not having a token to parse, and having a bad one
hence, Option<Result<Token, TokenErr>>
Fair enough
@gritty zinc what about a new enum?
like ```rs
enum MaybeErr<T, E> {
Present(T);
Missing();
Bad(E);
}
hmm
actually, no
since I want to have Iterator<Result<Token,TokenErr>>
so my iterator's next must return that Option<Result<Token, TokenErr>> anyway
Implementing that in C would require a lot of work. Weโd need some sort of union and type tag to tell whether the token contains a string or double value. If itโs a string, weโd need to manage the memory for the stringโs character array somehow.
haha, imagine that - a discriminated union with type tags, which can own memory!
More mildly cursed Rust:
if self.peek() == Some('.') && self.peek_next().map(|x| x.is_digit(10)) == Some(true) {
ok wow
what the hell does some do.
me and the boys calling an enum
Rust has very nice union support (rust calls them enums) - proper discriminated unions, where different variants can be differently-sized, etc.
One of the builtin enums is Option<T>. It's defined like this:
enum Option<T>{
Some(T),
None
}
this means an Option<T> is either a Some variant with a T inside, or a None.
Here, elf.peek_next() returns an Option<char>. I use map on it, which turns it into a Option<bool> by applying the function if it's a Some (or just doing nothing if it's a None). Then I compare it to Some(true).
So what this does is:
- if
self.peek()is None or a Some that's not a'.', the if doesn't run - if
self.peek_next()is None or a Some with a character that's not a decimal digit, the if doesn't run
After I fixed errors in my code, clippy told me I can make it a while let loop, actually!
Oh, nice
so one less level of nesting, at least
another nice Rust feature is this:
const fn is_valid_identifier_start(x: char) -> bool {
matches!(x, 'a'..='z' | 'A'..='Z' | '_')
}
const fn is_valid_identifier_body(x: char) -> bool {
matches!(x, 'a'..='z' | 'A'..='Z' | '_' | '0'..='9')
}
compile-time evaluable functions ๐ฅด
god i wish C had those.

actually i think i would only use that for small checks..
there is nothing stopping me from maybe making my own system.
like compile-time asserts with a Bash script or something lol.
that would be vaguely entertaining.
I am currently writing a Python program to generate some Rust code for me ๐ฅด
efficiencccy
I'm done.
Behold:
464 lines of python-generated match statements
Eat that, Lex!
@low chasm You may not like it, but this is what peak Rust performance looks like.
for the leaf segments it's a good idea, yeah
e.g. if it starts with w, I only need to check if it's while
I'll make that optimization later. If I decide to use this horrifying mess, I mean.
Lmao
Version two!
https://hastebin.com/akoduraruy.kotlin
Only 129 lines now.
https://hastebin.com/etasazutex.rust
and 3, fixing the makeKeywords of 2
yeah, something like that
if i put all my games in onedrive, does this mean that i can use less storage in my hard disk
wat dis
why tho
i can open text files in onedrive without internet connection
because its in ur local disk
ok
otherwise tht aint possible
forknife ๐ค
cut yourself in half and choose america and asia
ez make two accounts
well then i'ma choose europe
it's between america and asia i suppose
u can only play with people who are in that server
sad
sad, can't they do some switch server data stuff
o
asiaaa
damn learning rust and julia made me learn things that these two can be easily translated together with each other
guys, should I use nginx as a service in my docker compose file for development/ ci environments?
@leaden bridge Probably not for most things? Unless you have a very fun use case for distributed testing that I'm not thinking of.
Hey @leaden bridge!
Uh-oh! It looks like your message got zapped by our spam filter. We currently don't allow .txt attachments, so here are some tips to help you travel safely:
โข If you attempted to send a message longer than 2000 characters, try shortening your message to fit within the character limit or use a pasting service (see below)
โข If you tried to show someone your code, you can use codeblocks
(run !code-blocks in #bot-commands for more information) or use a pasting service like:
lo
lmfao
I use manjaro btw
@latent scaffold may guide you through heavens.
