Video

what is they keyboard you used at 0:19?

This is what Fast and furious movies should have been about

You look like 🤡

llm’s to dynamically generate optimized hashtable implementations at runtime? Vc investors pls

This was a thorough and helpful insight. Thank you

One thing I didn't see mentioned that might have lead to further optimization would have been compiler flags. By going through your different approaches with differing optimization flags like O3 or Ofast maybe you would have discovered more interesting performance variations to explore or found something like ptest you didn't know about.

DOS attacks against hash tables exist. You threw away the built in protection for that and made your code significantly worse for general use cases as opposed to specific data sets.

When you open a video with "my C++ is insane" in the thumbnail and first thing you see is something that you thought was your code... 😄 I made a very similar UTF-8 helper

Nah... for example, Python is without doubt the best language for ML.

What an incredibly useful video. I've been hesitant to go down this road. You video is exactly what I needed to make up my mind. Thanks so much for taking the time to make it.

I don't trust this guy. He works for Hooli!

Wow, brilliant vid!

As a Vim user, thank you for this review.

Tip #11 Run your performance comparison tests on different data sets of different sizes. 😉

13:20 omg lol wtf. 24:00 uh? Wait are you editing the microcode directly ?

14:38 if "size" is an unsigned number you could do: if ((size - 2) > 9)

Have any updates helped with your initial complaints?

0:04 les go..🎉

21:30 By instructions you mean clock cycles?

How is react meant to fix the original problem (the DOM)?

Nah. React is really nice.

0:10: You *_GET IT WRONG_* already in the first 10 seconds! Hash table is an implementation method, dictionary is any data structure where you can look up items based on something else than an integer index. A dictionary or as it is often called: an associative array, is not a hash table. It could be implemented by a hash table, but it could as well be implemented by a balanced tree, a heap (in sorting meaning) or a B-tree.

Great video I come back to from time to time, love the deep dive into hash tables, very inspiring

why do the cube and crab have such defined asses (edit just fixing typo)

Why not enums?

why was binary search slower than linear?

GitHub frontend is written in Ruby, not JavaScript

omg that ending. Thanks for saving me +100 usd and 3 months of stress. It's kind of ridiculous, I am a programmer too, and I have the feeling that such kind of keyboards attrakt mostly programmers. Why would they not think about symbols!!! needing to use 3 fingers for a single symbol character is insane.

Objects and associative arrays make more sense than just "hash table", hash table tells me nothing.

BRO DID NOT DRAW THE THUMB NAIL

In your hash function you have: t+hash&0x1ff0 Try avoid using the plus sign, trim the “t” and use another & or | instead of + … the reason for this is that + has to deal with carry (doing & and | ) if you deal with the carry you are saving computing

Meanwhile I'm over here crying about billion dollar companies. Not being able to make a snappy GUI on today's hardware. When 1MHz computers with 64k ram. Were faster than me in the 80s XD

Wow this is such a gem of a video.

instructions != cycles

I really appreciate error bars on your tests results. It is really uncommon sadly.

I would have assumed that perfect hash would have been something like load the input string as one or two 64 bit numbers, xor each input with random-like static value, rotate one of the numbers another random amount and then xor the numbers together and use that as the hash value. And to find those random values, you just create a program that tries different combinations until you get a good hash. The important part is that you only randomize the static values to xor against each input and the shift amount before xor'ing the results which should result in micro-ops that can execute really fast. And check the generated assembly to verify that the compiler inlines your hash function instead of calling a real function. And try to make the compiler to unroll the loop if at all possible. If you have multiple words to check for being a keyword, CPU might be able to execute those tests in parallel if the loop is unrolled 2x or 4x times. Also consider the byte alignment. If you can have the words starting at 4 or 16 byte alignment, the CPU may be able to load the data faster. The important thing is to keep trying different methods and profile which one is the fastest and always assume most of the code will be CPU cache limited, not instruction limited. The hard part is that modern CPUs do not have great options to check if your limit is branch mispredict or RAM access.

The burp at LCG moment was amazing

I had this video in my feed for like 3 weeks, I didn't want to watch it because hashing seems kinda boring but surprisingly it was the best video I have seen in a while

Legal Typescript source code files are expected to use UTF-8 for their character encoding format. Not ASCII. Be careful when making precise assumptions about your data (like that it includes only 8-bit ASCII characters).

In conclusion, Node.Js isn't still bad bad afterall, it's just the hype for Bun that was a little too much to get us exited all this while.

Gilfoyle from Silicon Valley, is that you?

Uh... Why not use an enumerated type?

I would probably name decode_UTF_8_result the same as you (I may remove the _ between the F and 8) But if it doesn't have any acronyms in it, I would just use camel case If it's truly a helper function, having it defined as a lambda inside of the function that it's helping seems better to me ... You're supposed to use std: unique 11:16 And on top of that I'm not always looking at my source control, which is why putting some sort of identifier there is a good idea

Where is the code?

I think the performance could be even better if you weren't using the Comic Sans font.

I dont mean to sound like youre not doing it right. But I think most of your problems originate from resting your hands on the table. I noticed that the modifiers go way easier when you rest your ellbows on the armrests of your chair and approach the chorder from the top, rather than the way you would do on a keyboard.

I need that rusty gyatt

why Why did you feel the need to cake up Ferrous and C++

I have an application that is doing high frequency trading using several LMDB in-memory DBs and many loops. Running it on bun vs node is a no brainer. Bun wins many times over. Nobody cares if the tests took a bit longer to run, that is not affecting production use of your application. The real meat is in the production code performance. I would suggest the slow test running is probably indicative of an issue somewhere in bun, and once fixed it is likely to be faster. Possibly something in how you test is not being translated into optimal code.

so why was the binary search slower?