#ot1-perplexing-regexing

1 messages ยท Page 608 of 1

wraith hound
#

It's nice, but it doesn't always work

uneven pine
#

yeah I've been using pipx

#

solved 90% of my poetry issues

latent scaffold
#

I've... never had these kinds of problems

opal atlas
#

There is more problems than solutions

rough sapphire
#

is anyone here proficcient in matlab

solid elbow
#

@fickle dirge did you figure out how to convert from decimal to binary and back?

fickle dirge
#

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

solid elbow
#

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.

fickle dirge
#

but know how do i get the leeter

#

how i do the remandir way?

#

decimal system to another base

#

@solid elbow

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.

fickle dirge
#

can u give me a example and i can try it

solid elbow
#

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.

fickle dirge
#

ok so if it is not divisible binary is 1 if it is then its 0?

solid elbow
#

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.

fickle dirge
#

ok

#

can u give me 3 qeustions I can try

#

dont tell me the anwser tho

#

@solid elbow

solid elbow
#

sure - try 5, 17, and 26

fickle dirge
#

ok

solid elbow
fickle dirge
solid elbow
#

hm - no, on all 3 ๐Ÿ˜…

fickle dirge
#

oh ok

opal atlas
#

Everyone knows about the programming language?

solid elbow
#

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.

distant hazel
#

"you're left with 0, so you're done" sounds like life

solid elbow
#

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.

fickle dirge
#

wait

#

so

solid elbow
#

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.

fickle dirge
#

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?

solid elbow
#

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.

fickle dirge
#

yeah so it would be smt like this

solid elbow
#

it's:

while n > 0:
    print(n % b)
    n = n // b
fickle dirge
#

not trying to code it

solid elbow
#

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 ๐Ÿ™‚

fickle dirge
#

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?

solid elbow
#

25

fickle dirge
#

can I use a calculator for this?

solid elbow
#

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

fickle dirge
#

ok

#

@solid elbow

#

so i got 10010

#

i missed 1

#

this is what i am doing

solid elbow
#

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.

solid elbow
# fickle dirge

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.

solid elbow
#

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))

royal lakeBOT
#

@solid elbow :white_check_mark: Your eval job has completed with return code 0.

0b11001
fickle dirge
#

so isnt the this part

#

oh

#

wait

fickle dirge
#

so isnt 0

#

@solid elbow

distant hazel
#

where are you seeing 0.5?

solid elbow
#

25 % 2 is 1

#

!e print(25 % 2)

royal lakeBOT
#

@solid elbow :white_check_mark: Your eval job has completed with return code 0.

1
solid elbow
#

% computes the remainder after division - 25 divided by 2 is 12 remainder 1, so 25 % 2 is 1.

fickle dirge
#

i am using a calulator to do that

acoustic moss
#

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

fickle dirge
#

so if its odd then its 1

#

and if its even its 0

solid elbow
#

right.

acoustic moss
#

yeah

fickle dirge
#

oh ok

solid elbow
#

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.

fickle dirge
#

ok

#

i am try 46

#

is it 010010

#

oh wait

#

mb

solid elbow
#

no ๐Ÿ˜…

fickle dirge
#

one sec

#

is it 011101

#

?

solid elbow
#

also no.

#

46 is an even number, so the final digit must be 0

#

!e print(bin(46))

royal lakeBOT
#

@solid elbow :white_check_mark: Your eval job has completed with return code 0.

0b101110
solid elbow
#

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)

fickle dirge
#

oh

#

yeah ok

#

101110

#

got it

#

i am try 50

#

is it 110011

#

e! print(bin(50))

solid elbow
#

!e print(bin(50))

royal lakeBOT
#

@solid elbow :white_check_mark: Your eval job has completed with return code 0.

0b110010
solid elbow
#

you had the last digit wrong

#

50 is divisible by 2, so the last digit should be 0, not 1

fickle dirge
#

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?

solid elbow
#

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.

acoustic moss
#

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
fickle dirge
#

how do I know what the decimal value is

acoustic moss
#

for individual digits?

#

0-9 remain 0-9 and A-F are 10-15

fickle dirge
#

after 15 they the same?

solid elbow
#

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)

solid elbow
solid elbow
#

"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 ๐Ÿ™‚

solid elbow
#

there's actually a shortcut you can take for converting from hex to binary, too

fickle dirge
solid elbow
#

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))

royal lakeBOT
#

@solid elbow :white_check_mark: Your eval job has completed with return code 0.

0b1010000111001101
rough sapphire
#

Converting from hex to bin or octa to bin is easy. Small hacks.

solid elbow
#

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.

acoustic moss
fickle dirge
solid elbow
#

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

fickle dirge
#

so I cant use the shortcut?

solid elbow
#

ooh, I made a mistake somewhere there ๐Ÿ˜„

acoustic moss
#

its aefc

solid elbow
#

ah

fickle dirge
#

ok

acoustic moss
solid elbow
#

!e ```py
print((10 * 163) + (13 * 162) + (15 * 161) + (12 * 160))
print(0xadfc)

royal lakeBOT
#

@solid elbow :white_check_mark: Your eval job has completed with return code 0.

001 | 44540
002 | 44540
fickle dirge
#

so what tpye of conversion is it tho hex to dex or bin to hex?

solid elbow
#

fixed ๐Ÿ™‚

#

this conversion was hexadecimal to decimal.

fickle dirge
#

ok

#

so how would i do hexadecimal to binary?

acoustic moss
solid elbow
#
hex    A    D    F    C
dec   10   13   15   12
bin 1010 1101 1111 1100
#

!e print(bin(0xADFC))

royal lakeBOT
#

@solid elbow :white_check_mark: Your eval job has completed with return code 0.

0b1010110111111100
fickle dirge
#

ok

solid elbow
#

the bin can just be read left to right on that.

fickle dirge
#

is that all the conversions or is there more?

solid elbow
#

uh, there's octal, which we mentioned above - it's a base 8 number system

#

the digits are 0 through 7.

fickle dirge
#

thats fine

#

only things we dex , hex , bin

#

with*

solid elbow
#

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
fickle dirge
#

which we cover so far

solid elbow
#

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.

fickle dirge
#

nope

#

dont think so

#

waht have i done so far?

solid elbow
#

I'm not sure what you mean

fickle dirge
#

which tpye of converstions have we worked on so far

#

type*

solid elbow
#

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)

fickle dirge
#

oh ok

solid elbow
#

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

fickle dirge
#

so if a have a decimal and want to do it in hex i would use the first method we did?

solid elbow
#

yep.

fickle dirge
#

ok

rough sapphire
#

^same way for octa just 3 numbers instead.

fickle dirge
rough sapphire
#

That is long way. And for deci.

rough sapphire
fickle dirge
#

pls

rough sapphire
#
A => 10, ...
A 1 C 5

A     1    C    5
1010  0001 1100 0101
8421  8421 8421 8421(this line just for reference)
fickle dirge
#

ok

fickle dirge
solid elbow
#

a = 10 in decimal, which is 1010 in binary.

fickle dirge
#

yeah

solid elbow
#

you're converting each hexadecimal digit to binary in isolation, and concatenating the results together.

rough sapphire
#

uhm, basic binary.

abcd => a*2^3 + b*2^2 + c*2^1 + d*2^0
fickle dirge
#

i see were 1010 is coming from but dont know about 0001

#

are u doing the first method thing any # with base?

solid elbow
#

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

fickle dirge
#

oh so the remainder is hex to bin

solid elbow
#

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

fickle dirge
#

ok so that means i can do it using the shortcut or the division/remainder way

solid elbow
#

yes

fickle dirge
#

ok

solid elbow
#

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

fickle dirge
#

hex to deci?

solid elbow
#

hex to decimal.

fickle dirge
#

yeah ok so its the same as the division/remainder way ?

rough sapphire
#

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)
fickle dirge
#

ok

#

i see now

rough sapphire
#

you can try both on long digits like A5 or something.

fickle dirge
#

can i use a calculator for this?

rough sapphire
#

sure why not.

#

I'll try to do it on paper and send it.

fickle dirge
#

ok

#

thanks

#

for the shortcut the only thing i dont get is how u get this 1010 0001 1100 0101

fickle dirge
rough sapphire
#

you mean 5, 2, 1?

fickle dirge
#

yeah

rough sapphire
#

oh i mean thast how we convert deci to bin

fickle dirge
#

then wahts hex to bin

rough sapphire
#

Here first is long way. 2nd is short way.

fickle dirge
#

ok thanks

#

TYSM FOR YOUR HELP EVERONE

#

its late here i am go to sleep

#

AGAIN

rough sapphire
#

no issues:D

opal atlas
#

Everything it's about this server

next locust
#

What can a person do with my ip?

#

Other than know my address

solid elbow
#

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.

latent scaffold
#

the only address they'd know is your IP address lol

solid elbow
latent scaffold
#

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

solid elbow
next locust
#

Basically know my somewhat location

latent scaffold
#

for me, it's a whole town away

next locust
#

But could they hack my pc or smth?

latent scaffold
#

if you have ports open, some bad things could happen if they're found

#

but in general, you're usually completely fine

solid elbow
#

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

opal atlas
#

how to ban myself from this server like for everything I do is too fixated

tardy rain
#

Right click server icon
"Leave server"

#

bye felicia

tribal aurora
mild abyss
tribal aurora
#

this is not a cat.

mild abyss
#

what is it

#

๐Ÿณ๐Ÿณ๐Ÿณ

latent scaffold
#

I hate that cat, negl

tribal aurora
#

we haven't named it actually.

mild abyss
#

hmm

shut ermine
#

or my sleep demon

opal atlas
tardy rain
#

youre a troll

shut ermine
#

mmm 4am anxiety this is fun

latent scaffold
#

annoying relatable except it's 3 AM here

harsh tundra
opal atlas
#

as a matter of fact not doing[=

shut ermine
#

yee im about to fight the law wish me luck ๐Ÿคž

opal atlas
#

what law?

rough sapphire
#

can anyone help me my image is not coming

graceful basin
#

@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

rough sapphire
#

ok

#

thank you!

runic wigeon
rough sapphire
#

It does!
thank you so much!

runic wigeon
#

๐Ÿ˜„

rough sapphire
#

I am AFK

clear rapids
#

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...

โ–ถ Play video
harsh tundra
clear rapids
#

??

#

not getting

mellow spire
clear rapids
#

ok

#

sorry

#

i apologize

#

um kid

#

btw that meme was gud

harsh tundra
tribal aurora
#

what if they're actually kids :D

clear rapids
#

understood?

clear rapids
#

i am a 13 year old who has interest in python so i am here i am not saying others kid

harsh tundra
mellow spire
#

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

twin charm
#

is there a way to bypass this?

#

I'm trying to run an exe

graceful basin
#

more info should have the button

acoustic moss
#

more info and run anyway

twin charm
#

I excluded this folder on windows defender, but it's still stopping me from running it

#

oh ok

#

thx, it works

twin charm
acoustic moss
#

tyty

mild abyss
twin charm
#

it has recommended this to me on several occasions, but I've never watched it xD

young shoal
#

it's a classic

ancient minnow
#

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

mild abyss
#

goodluck learning git commands in the commandline

scarlet wind
ancient minnow
#

ya i figured it out

#

but now i have some other conundrum

scarlet wind
#

but yes editing the file directly is the easiest

ancient minnow
#

['.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

opal atlas
#

I had to grow a moustache to code like a pro

brazen ingot
#

sigma rule โœ…

last mantle
#

any good python cheatsheet?

#

which explains topics like decorators and lambdas too

tardy rain
#

the best cheatsheet is actually trying it out yourself

last mantle
tardy rain
#

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

last mantle
#

...

tardy rain
#

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

distant hazel
#

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

uneven pine
#

People who use document databases

spare horizon
#

who is familiar with vs code remote dev?

last mantle
#

too many langs mess up the brain

tardy rain
#

i suggest writing some decos on your own however, just reading wont get you anywhere

last mantle
#

yup

rough sapphire
#

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?

inland wolf
last mantle
solemn leaf
#

y = x

#

done

opal atlas
uneven pine
#

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

spare horizon
#

Criticizing people's posts isn't the right answer either!

dapper dew
#

I mean, it seems like they were suggesting a way to effectively get an answer

young shoal
#

you can't get better without criticism

spare horizon
#

I don't read it as a suggestion dude

uneven pine
#

Well I apologize that's not my intent to be rude, just trying to help you get an answer.

#

@spare horizon ^

round rose
#

@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

frail badge
#

hmm?

#

oh wait

#

okay

#

but then wont VSC be the same thing if u just get the right extensions

round rose
#

Getting the right extensions is the big difference, yeah

#

VSC ships as a relatively lightweight text editor on steroids

frail badge
#

right

round rose
#

which you then customize into whatever you want with plugins

frail badge
#

then why do so many ppl use PC

#

its super resource intensive

round rose
#

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

frail badge
#

hmm

round rose
#

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

frail badge
#

ig so

#

well thanks for the help

round rose
#

you're welcome, #editors-ides is a good place for similar discussions or more info on this topic

frail badge
#

alright

uneven pine
#

R7 5800x @ 4.6ghz all core, 32GB DDR4-3600, and an RTX 3070 ti

#

so hardware bottlenecks are definitely not the issue lol

rough sapphire
#

hi

uneven pine
#

hello

rough sapphire
#

admin

vapid nymph
#

lmfao i need to find a medium

soft violet
#

I hear the happy ones are the best.

spare horizon
solid pollen
inland wolf
#

medium is open source !?

round rose
#

The startup time was the only noticeable difference for me, and even that stopped being a factor once I switched to an ssd

acoustic fern
#

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

round rose
#

pretty much

solid pollen
inland wolf
#

shit i read it wrong

mild abyss
digital oracle
#

medium's content isn't that bad but the platform sux

odd sluice
#

paywall after like 1 article / week

#

scam

tardy rain
#

Medium has turned into quora

odd sluice
#

quora but cooler (in looks)

mild abyss
last mantle
#

i believe that flutter and MAUI are the future of GUI's honestly

buoyant gust
mild abyss
#

@dapper dew i did it :D

dapper dew
#

oh damn

mild abyss
#

wow that was easy with sbctl

#

lol

dapper dew
#

That was arch though?

mild abyss
#

void linux

dapper dew
#

Gotcha

mild abyss
#

u can use sbctl :D

#

in arch

dapper dew
#

I have win10 with ubuntu WSL

mild abyss
#

ah i see. so u no dual boot?

dapper dew
#

Nope

mild abyss
#

oh well. thats also fine

dapper dew
#

Yeah...still not sure how I'm going to go about enabling secure boot lol

vapid nymph
mild abyss
#

now i change it to read and write in fstab

#

and did it again

#

that fixed it

#

:D

solid pollen
dapper dew
#

Yeah I think I'll give it a shot

mild abyss
#

goodluck!

dapper dew
#

I'm gonna need it

mild abyss
#

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

#

ยฏ_(ใƒ„)_/ยฏ

shut ermine
#

yoooo cheese with porridge is epic

#

why can you just add cheese to everything

mild abyss
#

yo truth

shut ermine
#

idk u can also add tequila to most things

#

flavor life hacks, i like putting tequila on my salad

broken dew
#

Chilli oil goes with anything

shut ermine
#

maybe

broken dew
#

It does

shut ermine
#

im not putting that on cake

broken dew
#

Do it.

shut ermine
#

no

mild abyss
acoustic moss
#

dont knock it till you try it

broken dew
mild abyss
#

i will eat apple. join me @acoustic moss

#

lets eat apple and merge

acoustic moss
#

but i dont like apples-

broken dew
#

...

#

...

mild abyss
#

damn hsp talking real

inland wolf
#

sheesh

#

no chill

mild abyss
#

that reminded me on my first grade when my crush rejected me

#

that hoort

inland wolf
#

That's life - Frank Sinatra

edgy crest
acoustic moss
#

as soon as there;s a group of them though,,,

mild abyss
#

i envy hsp now

shut ermine
odd sluice
#

i dont like apple

#

it's too cold and sharp for me when i bite

#

it makes me shiver

latent scaffold
#

hate Apple

solid pollen
#

Poor @broken dew

broken dew
latent scaffold
#

oops

#

I said Apple

#

you're apple

broken dew
latent scaffold
#

thought maybe that can also be seen as offensive

#

you don't even deserve your own proper noun

solid pollen
#

I still do love your pfp btw apple

broken dew
#

Thanks ๐Ÿ™‚

shut ermine
latent scaffold
#

as you should

shut ermine
#

ok im becoming yo sleep demon have fun

#

itd be funny to dream of my pfp lmao

odd sluice
#

hi

vapid nymph
# solid pollen thank you thank you

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

solid pollen
#

Lmfao it took me a minute to remember

vapid nymph
#

I mean, it was a reply chain

nimble bluff
#

anyone good with satire

inland wolf
#

nop

#

related:

stark prawn
distant hazel
#

omg

#

gradient buns

little yacht
uneven pine
#

How to you even manage to get them to sit still long enough for that

solid pollen
#

@honest star but you do have carpets in cars!

#

I like the idea of JS just being a carpet I can step on though

mild abyss
hard yacht
#

Sug

gritty zinc
#

wait, a minute, holy shit - Rust 2021 is out??!?

wraith hound
#

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

royal lakeBOT
#
Aye aye, cap'n!

Your reminder will arrive on <t:1634953653:F>!

gritty zinc
#

finally, no more IntoIterator::into_iter(array)

mild abyss
wraith hound
#

Same, I need to update the "edition" flag in my projects though

#

Ooh, 1.58.0-nightly is out too

floral apex
inland wolf
#

damn

mild abyss
#

damn (2)

mellow spire
#

damn (3)

clear plume
#

damn (4)

floral apex
#

damn (5)

digital oracle
#

guys where's 0

young gate
#

why is this channel called some guy named john

inland wolf
#

lol

mellow spire
#

john was the original owner of this server IIRC

mild abyss
#

yes how did u remember haha

#

this otn is an easter egg tbh

old zenith
#

i need help

#

help

#

me

#

please

#

@mortal ferry

#

@remote socket

#

@shell raptor

#

hell

#

o

#

wtf

odd sluice
#

bruh

#

why did you ping

#

ask ur question directly

old zenith
#

@odd sluice i dint ping u though

#

lol

mild abyss
rough sapphire
#

@rough sapphire This ping does not matter because the ping is currently representing myself.

#

Lol

tardy rain
#

Stop with this annoying behavior

#

Sometimes i wonder whats wrong with the world and then i open discord

harsh tundra
#

Ssene?

rough sapphire
odd sluice
#

wat

broken dew
#

Is it a bad thing that in the two months Iโ€™ve been here Iโ€™ve sent over 10K messages?

#

Or is that normal

still sky
#

normal

runic wigeon
#

below par

#

didn't expect this from you

mild abyss
#

an apple a day keeps the doctor away

dapper dew
broken dew
#

Oh yeah thatโ€™s a good way to look at it. Iโ€™d estimate >95% of my messages were sent in help channels

odd sluice
#

wow

#

i should probably help out in help channels mor

dapper dew
#

I mean if you want to help you can. Its not a mandatory thing

odd sluice
#

i mean i do want to help, majority of my help is in pygen though

dapper dew
#

Yeah that is a special kind of help with how quick everything is lol

odd sluice
#

๐Ÿ‘€

#

132k

#

is a lot

mild abyss
#

hmm i stopped coming here last October 2020 to June 2021. i did visit a few times hmm

violet roost
mild abyss
#

because julia happened

violet roost
#

25k results

#

cuz I mostly vc

#

รฒ-รณ

broken dew
acoustic moss
#

lmao

mild abyss
#

so thats how it works huh..

gritty zinc
#

moderator abooz, pls demot

#

so rude with people

mild abyss
#

imma do that once i am 30, assuming there are still old messages i have

acoustic moss
# solid pollen pfff you fiiiiiine

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
acoustic moss
#

im ahead of apple too!

broken dew
#

Ah I'm just behind

#
>>> 10899 / (datetime.now() - datetime(day=21, month=8, year=2021)).days
175.79032258064515
acoustic moss
#

\๐Ÿ˜Ž

solid pollen
acoustic moss
#

like, in 2020 or from 22/10/20 to 22/10/21

solid pollen
#

from like July 2020

acoustic moss
#

hm ok

#

ah you have to tell me your message count

#

i dont have access to all channels you do

solid pollen
#

right

mild abyss
#

hmm i joined this server july 27, in the morning

solid pollen
#

@acoustic moss 103k since 2020-07-01

mild abyss
#

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

acoustic moss
solid pollen
#

lol

acoustic moss
#

215.48 ๐Ÿ›

mild abyss
#

i joined discord 2 years ago but only used it a year and a quarter

latent scaffold
#

I have 73k messages here

mild abyss
#

i have 40k messages

latent scaffold
#

but that's not including chat in channels which have been archived/deleted

latent scaffold
#

I mean like the pixels event channels and code jam ones

solid pollen
#

you can ask discord for your data and see your messages in archived channels

latent scaffold
#

oh my

#

Do I really wanna put it in the effort, though

acoustic moss
#

you don't

solid pollen
#

When I had a look through my data I saw the lead chat and I was like "oh, cool" and moved on lol

mild abyss
#

i dont even join code jam

latent scaffold
#

I only really talked in the code jam during the qualifier

#

that's like the only part where I had fun

mild abyss
#

you got pranked in a nutshell kind of vibe

rough sapphire
#

Hello

solid pollen
#

Hahaha

#

That's genius

rough sapphire
#

ok so i just got windows 11 today and microsoft teams and whatsapp keep crashing

#

anyone facing the same issue?

solid pollen
#

Nah, you can find the context

harsh tundra
inland wolf
#

what an amazing sticker

scarlet wind
#

john who

digital oracle
#

how dare you eject golang

scarlet wind
#

I was born to dare

odd sluice
#

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

odd sluice
#

idk im bored

scarlet wind
#

did u mean bare?

inland wolf
#

cant rhyme to that i tried

odd sluice
#

no

#

bear is used in that context

scarlet wind
#

hmm

mellow spire
#

my first message, i dunno when i did this lol

violet roost
digital oracle
rough sapphire
tulip rampart
#

!remind 10000d hi

royal lakeBOT
#
Noooooo!!

Sorry, you can't do that here!

tulip rampart
#

ah

eternal wing
#

!otn a fisher ate a lot of meatballs

royal lakeBOT
#

:ok_hand: Added fisher-ate-a-lot-of-meatballs to the names list.

young shoal
#

๐Ÿฅฉ โšพ

mild abyss
eternal wing
#

I'm so full. Ouch

latent scaffold
#

It's been years since I've had a meatball ๐Ÿค”

silver birch
#

meatballs are too good youre missing out

mild abyss
#

imma force u to buy

#

meat

#

balls

#

:(

latent scaffold
mild abyss
#

ew

silver birch
#

get some at a restaurant or smth

#

also your chinchilla isnt looking too good

latent scaffold
#

my what

silver birch
#

your chinchilla in your pfp

rough sapphire
#

its not a rick roll I promise lol pls

royal lakeBOT
floral apex
#

Guess I need to update Alpine

hybrid pivot
remote citrus
#

what are the benefits of being a self-taught programmer?

odd sluice
#

idk

remote citrus
#

-_-

mild abyss
#

thats the benefit

#

๐Ÿ˜‹

#

but seriously thats it

#

thats also its flaw

remote citrus
#

xD

silver birch
#

you get to manage yourself which is good for some bad for others

rugged jewel
#

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

tribal aurora
#

yo how do we use !codewars command?

#

wait

#

.challenge

median domeBOT
#

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

Difficulty

5 kyu

tribal aurora
#

nice

solemn leaf
#

are you booting live

#

like without installing mint

digital oracle
remote citrus
#

Lmao

floral apex
#

Spooky

digital oracle
#

๐Ÿ‘€ kinda looks like the golden elevator thing in marvels Loki series

floral apex
#

This is a threat

odd sluice
#

wat is dat

inland wolf
#

lol

#

all i can say is

#

sardines

shut ermine
#

ignore my teeth guards

odd sluice
#

what are teeth guards

shut ermine
#

just got braces removed so i wear those so they dont crook again

inland wolf
#

damn nice

shut ermine
#

sardines r epic

#

big healthy fat content and little else

inland wolf
#

its hard to make it taste good

shut ermine
#

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

inland wolf
#

u and i have completely different kinds of sardines ig

shut ermine
#

im built different thats why i also like dried crickets

odd sluice
#

i mean

#

ok

shut ermine
# odd sluice raw?

do they sell canned sardines raw? p sure part of canning process cooks them

rough sapphire
#

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

shut ermine
low chasm
#

@rough sapphire

#

hey

#

lets continue here

#

what source do you have?

#

rust isn't much slower then c/cpp

random yew
#

tru tru mr minecraft

low chasm
#

Code written in Rust/C/CPP is typically faster than hand written assembly in any case

#

Since the compiler optimizes it for you

random yew
#

isnt rust also written in C

low chasm
#

no

eager cliff
#

nope

low chasm
#

rust is written in rust

#

bootstrapping amirite

eager cliff
#

source @rough sapphire

low chasm
#

ok, fairly sure they're trolling

eager cliff
#

they probably are.

low chasm
#

lmao

#

they've been here for a bit though, so its sort of weird

random yew
#

so whats up with rs

eager cliff
random yew
#

I heard like you dont lose mem or smth

eager cliff
#

you are scared of C Code

#

ooooooooooooooooooooooooooooooooooooo

random yew
#

shell script

#

yes

#

a chad

eager cliff
#

the output of a C program.

wraith hound
acoustic moss
#

imagine using C

#

or rust

low chasm
eager cliff
#
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;
}
#

๐Ÿคช

random yew
#

stop please

eager cliff
low chasm
random yew
#

XML is the way to go guys!!!

low chasm
#

I wish for something to execute and it just does

#

my brain is turing complete btw

eager cliff
#

i am making a daemon in C.

low chasm
#

cool

#

imagine having nulls

eager cliff
#

Yeah Imagine

random yew
#

fuck you doin, get back to work

eager cliff
#

Imagine Actually Having A Fucking Sentinel Value

low chasm
#

I am writing a parser

#

in rust ofc

#

no for my language

#

and then I'll port that over to meow

random yew
#

Im writing a snake AI

low chasm
#

since its the same type of parser for both

#

a few minor changes here and there and it'll work for meow just fine

random yew
#

13 hours in researching ๐Ÿ˜ญ

eager cliff
#

what is meow?

random yew
#

^^

eager cliff
#

oh

#

that cat thing.

gritty zinc
#

I'm still going through Crafting interpreters

low chasm
#

I could binge read craftinginterpreters

gritty zinc
#

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 on char line[1024]

low chasm
#

lmao

eager cliff
#

๐Ÿฅด

low chasm
#

๐Ÿฅด

#

i remember everyone always using this

random yew
#

Welp Ima go code

#

prolly break a few more keyboards

eager cliff
#

why not just have a buffer.

#

snprintf

random yew
#

yea that

gritty zinc
#

is this how files are always read?

graceful basin
#

yes

gritty zinc
#

hmm, interesting

eager cliff
#

wow

#

Rust really throwing shade.

gritty zinc
#

this isn't a rust book

#

sadly

#

All C. Well, half C. The other half is Java.

wraith hound
#

Is that crafting interpreters?

gritty zinc
#

yes

tardy rain
#

You can tell by the language

gritty zinc
#

I'm not sure, I think there might be other books in English. ||\s||

eager cliff
#

Aight Boys

#

Everything Is Functional.

#

i have gone through hell and back trying to perform synchronization.

gritty zinc
#
    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

wraith hound
#

what. the. fuck.

#

Is this a lexer

#

I wrote one recently

#

Twas fun

frail badge
#

i wanna cry

#

whats a lexer

wraith hound
#

It isolates a programming languages code into a series of tokens

#

It's the first stage of compilation/interpretation

frail badge
#

err- right

#

oh ok

wraith hound
#

I'll give you an example, one sec

rough sapphire
#

help m e

graceful basin
#

what helped me make nicely implement lexers, even in C, was learning finite automata

rough sapphire
#

I need a site can anyone help me?

frail badge
#

you want a domain?

rough sapphire
#

yes

frail badge
rough sapphire
#

free ?

frail badge
#

or if u want a free one consider smth like github sites

rough sapphire
#

ty โค๏ธ

frail badge
#

np

round rose
frail badge
#

i think u can also get free domains from github student developer pack

rough sapphire
#

I can't open the site

frail badge
#

that looks esoteric af

frail badge
round rose
#

I mean it's generally fine

rough sapphire
#

at school

frail badge
#

u can get a .tech domain i think

round rose
#

The painful part is if cond: { lots of code } else break

frail badge
#

https://pages.github.com/ is github sites

rough sapphire
#

me

round rose
#

if not cond: break would reduce nesting and make it look slightly less monstrous

frail badge
rough sapphire
#

?

wraith hound
rough sapphire
#

can you add me as a friend

wraith hound
frail badge
#

i only have people i know irl as friends

rough sapphire
#

noo wait pls

#

5 min

frail badge
#

bruh just ask here
there are more qualified people here

rough sapphire
#

can you help me to open a site

frail badge
frail badge
rough sapphire
#

ohh

#

it will be on instagram but not github

frail badge
#

oh idk anything about insta

rough sapphire
#

i need instagram copyright site can you help me

shell raptor
#

test

#

test2

wraith hound
#

that's really really weird

frail badge
#

omg it went up by one!!!

#

bot!!1

rough sapphire
#

<@&831776746206265384>

frail badge
#

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

rough sapphire
#

yes

#

ty

gritty zinc
#
        return Some(Ok(Token::new(
            TokenType::String,
            &self.code[start..self.current],
            self.line,
        )));

three levels of nesting ๐Ÿฅด

round rose
#

๐Ÿ…ฑ๏ธoy

frail badge
#

urk

gritty zinc
#

there's a big difference, you see, between not having a token to parse, and having a bad one

#

hence, Option<Result<Token, TokenErr>>

round rose
#

Fair enough

shell raptor
#

@gritty zinc what about a new enum?

#

like ```rs
enum MaybeErr<T, E> {
Present(T);
Missing();
Bad(E);
}

gritty zinc
#

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!

round rose
#

unthinkable

#

heresy

gritty zinc
#

More mildly cursed Rust:

if self.peek() == Some('.') && self.peek_next().map(|x| x.is_digit(10)) == Some(true) {
round rose
#

ok wow

eager cliff
#

me and the boys calling an enum

gritty zinc
# eager cliff what the hell does ``some`` do.

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.

eager cliff
#

how much would you pay me to use Rust.

#

๐Ÿฅด

gritty zinc
#

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:

  1. if self.peek() is None or a Some that's not a '.', the if doesn't run
  2. if self.peek_next() is None or a Some with a character that's not a decimal digit, the if doesn't run
gritty zinc
round rose
#

Oh, nice

gritty zinc
#

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 ๐Ÿฅด

eager cliff
#

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.

gritty zinc
#

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.

gritty zinc
#

yeah, something like that

dire siren
#

if i put all my games in onedrive, does this mean that i can use less storage in my hard disk

odd sluice
#

u still need to download the games to ur local hard disk to play

#

...so no

floral apex
odd sluice
#

wat dis

dire siren
#

i can open text files in onedrive without internet connection

odd sluice
dire siren
#

ok

odd sluice
#

otherwise tht aint possible

frail badge
#

forknife ๐Ÿค”

mild abyss
#

cut yourself in half and choose america and asia

dire siren
#

well then i'ma choose europe

#

it's between america and asia i suppose

mild abyss
#

sad

dire siren
mild abyss
#

that would cause a lot of server problems

#

imo

#

too much looad

dire siren
#

o

solemn leaf
#

asiaaa

mild abyss
#

damn learning rust and julia made me learn things that these two can be easily translated together with each other

leaden bridge
#

guys, should I use nginx as a service in my docker compose file for development/ ci environments?

rough sapphire
#

@leaden bridge Probably not for most things? Unless you have a very fun use case for distributed testing that I'm not thinking of.

prime horizon
#

linux jis best

#

linux is best

royal lakeBOT
#

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:

https://paste.pythondiscord.com

leaden bridge
last mantle
#

lo

odd sluice
solid pollen
rough sapphire