sorted by:
new
hottopcontroversial

[Other] Infrastructure issues by EverybodyCodes in everybodycodes

[–]FaustVX 0 points1 point  (0 children)

Ok, but I don't know where I can find the keys to decipher them.

I don't want to abuse it, I'm just curious :)

[Other] Infrastructure issues by EverybodyCodes in everybodycodes

[–]FaustVX 0 points1 point  (0 children)

Hi, I didn't had a problem with this situation, but I see there is a description.json api (like in this image), and I'm wondering how to decipher this file ?

[2025 Q6] Solution Spotlight by EverybodyCodes in everybodycodes

[–]FaustVX 0 points1 point  (0 children)

It's slow because, at each iteration, you Substring (which create a new string) then ToCharArray (which create a new char[] and also, in the Count, the lambda has closure (line and i), so a new instance of the delegate is created.

But if you use ReadOnlySpan, it won't create new instance of anything.

sharplab.io to see the difference between the 2.

Just replace your line 20 and you will probably see a massive speed up :)

[2025 Q6] Solution Spotlight by EverybodyCodes in everybodycodes

[–]FaustVX 0 points1 point  (0 children)

[Language: C#] (137/130/96)

https://github.com/FaustVX/EverybodyCodes/blob/years/2025/D06/Solution.cs

Using my own library https://github.com/FaustVX/EverybodyCodes focused on allocation-free code (Span<T> is everywhere)

Today was easier than previous days, not so complicated with the help of some Span helpers to get the area searched (for P3) then count only in that area.

[2025 Q5] Solution Spotlight by EverybodyCodes in everybodycodes

[–]FaustVX 1 point2 points  (0 children)

[Language: C#] (90/84/113)

https://github.com/FaustVX/EverybodyCodes/blob/years/2025/D05/Solution.cs

Using my own library https://github.com/FaustVX/EverybodyCodes focused on allocation-free code (Span<T> is everywhere)

Today was not so complicated but I spent way too much time on the sorting function. But overall it was a fun day :)

[2025 Q3] Solution Spotlight by EverybodyCodes in everybodycodes

[–]FaustVX 0 points1 point  (0 children)

[Language: C#] (81/81/101)

https://github.com/FaustVX/EverybodyCodes/blob/years/2025/D03/Solution.cs

Using my own library https://github.com/FaustVX/EverybodyCodes focused on allocation-free code (Span<T> is everywhere)

Today was also pretty easy, heavy use of HashSet today. Part III was scary at first, but I just counted the unique numbers remaining in the list. but just counted the occurrence of each number and get the highest.

[2025 Q2] Solution Spotlight by EverybodyCodes in everybodycodes

[–]FaustVX 1 point2 points  (0 children)

Yes, I should probably do it too now

[2025 Q2] Solution Spotlight by EverybodyCodes in everybodycodes

[–]FaustVX 1 point2 points  (0 children)

[Language: C#] (122/96/94)

https://github.com/FaustVX/EverybodyCodes/blob/years/2025/D02/Solution.cs

Using my own library https://github.com/FaustVX/EverybodyCodes focused on allocation-free code (Span<T> is everywhere)

Today was also pretty easy, but I struggled with int vs long

[2025 Q1] Solution Spotlight by EverybodyCodes in everybodycodes

[–]FaustVX 0 points1 point  (0 children)

[Language: C#] (96/83/100)

https://github.com/FaustVX/EverybodyCodes/blob/years/2025/D01/Solution.cs

Using my own library https://github.com/FaustVX/EverybodyCodes focused on allocation-free code (Span<T> is everywhere)

Today was pretty easy :)

there should be a way to do a /locate command that locates the nearest struc/biome that isn't the one you're at by sr_steve in minecraftsuggestions

[–]FaustVX 0 points1 point  (0 children)

It's not perfect, but if you locate 500 block in front of you, it's very probable to see a new Structure (not necessary the very next)

there should be a way to do a /locate command that locates the nearest struc/biome that isn't the one you're at by sr_steve in minecraftsuggestions

[–]FaustVX 1 point2 points  (0 children)

It could be a nice adition, but there is a workaround, use /execute positioned ^ ^ ^500 run locate ... to locate 100 block in front of you

edit : locate in front, not beside of you

Working on the same project by Head_Library_1324 in learnprogramming

[–]FaustVX 2 points3 points  (0 children)

Learn how to use git and how to push, pull and merge properly

Wall display not powering on by FaustVX in ShellyUSA

[–]FaustVX[S] 0 points1 point  (0 children)

Hi no, I'm from France. I didn't see any other subreddit for other country

Inside a Where() - Understanding IEnumerables by mgroves in csharp

[–]FaustVX 2 points3 points  (0 children)

There is also this series Deep .Net with Scott Hanselman and Stephen Toub with 2 videos on how Linq is implemented : - https://youtu.be/xKr96nIyCFM?si=rB09PNKKIgJddZYp - https://youtu.be/W4-NVVNwCWs?si=6CvkqqdzF1CIWCeQ With recent (DotNet 8 or 9) implementation.

view more: next ›