Also called german strings. This is a great data structure that explains how handling strings can be diverse.

an arena is a way to store your data somewhere without directly going through the system allocator. If you have a lot of small objects which you don’t mind to deallocate together instead of individually, this can be a lot faster. You could use a Vec for this. However, if you store data in a vec its address might change all the time.

A great thing would be an implementation in #rust as a small #project #idea

See the page 38-45 computer science PDF of Andy Pavlo: https://15721.courses.cs.cmu.edu/spring2024/slides/05-execution2.pdf

About ULIDs, UUIDv4 & UUIDv7. The dynamic examples are great!

How to remove XML comments in Javascript?

How regex can solve the issue but why they can be slow. There is a category for this weakness: CWE-1333 "Inefficient Regular Expression Complexity".

Other workarounds are also proposed, such as using efficient engines with backtracking.

A fast hashmap algorithm if the one of the standard library is not enough.

IDK if the collision rate is higher than the std library though. Hashbrown uses AHash as algorithm for hashing. --> it does not provide cryptographic secure hashes though.

Another use case is when std is not available (because the randomness is not available in the environment / OS).

Non empty data structures :D

There is no clear resources on how to read from SSDs. As long as the read access amount can be reduced, then it is all good.

How to ramp up quickly?

The first step is to find someone on the team and ask for 30 minutes with them. In that meeting you have a simple agenda:

• For the first 25 minutes: ask them to tell you everything they think you should know. Take copious notes. Only stop them to ask about things you don’t understand. Always stop them to ask about things you don’t understand.
• For the next 3 minutes: ask about the biggest challenges the team has right now.
• In the final 2 minutes: ask who else you should talk to. Write down every name they give you.

Repeat the above process for every name you're given. Don’t stop until there are no new names.

The seventh version supports timestamps in them. What a cool thing, because they are now sortable, and searchable. Time slices will be easy :)

A great guide on the modulo operator :)

Une application de la classification de texte en 15 lignes de python. C'est impressionnant, et l'algorithme peut concurrencer les IA sur ce domaine. Cela n'est cependant par révolutionnaire.

A sort algorithm found by an AI is integrated to the LLVM standard C++

A blog post vulgarising the thing https://www.deepmind.com/blog/alphadev-discovers-faster-sorting-algorithms.

We can read here that less instructions are needed at assembly level.

Published!

A curated list of algorithms sorted in two categories: Beginner and Advanced

JavaScript Repository of TheAlgorithms, which implements various algorithms and data structures in JavaScript.

For education only

In general, the larger the primes you use, the better the illusion of randomness. With smaller primes, you will get more variation, but less appearance of randomness.

The first way is to set each trait on :nth-child(pn + b) where p is a prime which increases with each value and b is constant for each trait.

The second way (which is more on par with the original Cicada principle) is to set each trait on :nth-child(pn + b) where p is constant per trait, and b increases with each value. This creates a better overall impression of randomness (especially if you order the values in a pseudo-random way too) without “holes”, but is more tedious, as you need as many values as the prime you’re using.

A collection of algorithms. They are available in many languages.

Here a list about datastructures: https://the-algorithms.com/fr/category/datastructures