Live-coding a linked hash map in Rust

preview_player
Показать описание


Рекомендации по теме
Комментарии
Автор

I got started in rust recently and these live sessions are so helpful! I get to see and understand implementations and learn from code style and functionality from you. Great video!

mihneagogu
Автор

Can't wait for more Live-coding. Thanks for sharing your knowledge!

Blure
Автор

I’m just starting to learn Rust, and I’m currently battling with the compiler.I think this video is very helpful to me.

YanezRussell
Автор

Audio suddenly fixes itself at 1:08:35

karelpeeters
Автор

How can you move the cursor so fast in vim? What kind of commands are you using?

kitgary
Автор

When I code in rust and the borrow checker complains, I'm wrong. When Jon codes in rust and the borrow checker complains, the borrow checker is wrong.

marcoherrera-rendon
Автор

I recently found your channel and love what you have been doing! It's a bit under the rust knowledge required as what you've been porting over, but do you think you'd ever do something like javas arraylist or a generic BST?

aaronleopold
Автор

50:40 Why &x.0? x is reference type, so shouldn't we instead dereference it(ie using * operator) to access the value? Or is it actually like &(x.0)?

cccc
Автор

I love how fast and efficient your workflow is. I'm currently learning Vim and soon I'm switching to Linux completely. Is that i3-wm + tmux you're using? I'm thinking of using arch + i3-wm. I hope I won't get lost :P Thanks for this video! ♥

roOt
Автор

Great video! Is there a data structures and algorithms text/resource that you can recommend that gave you a solid foundation/good understanding for doing a video such as this one? Thanks again for the great content!

randyt
Автор

Interesting screencast 👍 How is about vimium for firefox 🤓 have the same env, its quite great!

dimav
Автор

At 1:48:30 you talk about borrows being in the scope of blocks. With the now-merged non lexical lifetimes does this code now compile?

keldwikchaldain
Автор

Did you figured out the issue with mutable borrow in some way?

plausablewithdeniability
Автор

With a lot of previously recorded live-coding sessions I have to pump up the playback speed to 1.25. With Jon, I have to slow him down to 0.75. I tried coding along with this stream about a year ago and it was futile. Now I can keep up... at .75. Jon's videos are great for testing your progress with Rust by coming back and seeing if you can keep up AND comprehend.

Also, even if you are an experienced programmer but have never touched Rust, good idea to read the NoStarch book and/or the O'Reilly book before attempting to code along with Jon. For me, I think you start with the 'Cancellable Services' video, then move on to this one and then go on to the longer and multi-part videos. Just my opinion in hindsight.

joeldpalmer
Автор

Can someone define buckets and entries in easy terms? From what I understand, bucket is just an array index that can have one or more than one value (entries). The way an index or a bucket is chosen is typically done in the hash function, which takes a key, uses some mathematical functions and returns a hash value, which is then modded with the size of the hash table and then inserted in the bucket. Is my understanding correct?

anupkodlekere
Автор

i just watched this, and i find it interesting that this is a "simple" hashmap... i did not find this simple especially when it came to the entry api... a lot of generics, and lifetimes etc. Coming from java, i still find Rust syntax very hard to remember, especially where to declare generics, and lifetimes. When to use &, ref, when to consume the values (self, and when to &self)

toerktumlare
Автор

Therefore you don't need the if block either.

Nyawful
Автор

40:34 – why are those "CPU instructions unnecessary"? I'm pretty sure some sort of iteration needs to happen anyway, even if you could create the vector using the `vec![]` macro. It somehow has to fill _all_ of the elements of the vector with (a clone of) the provided value, after all… It might be less convenient to type up, but I highly doubt it performs any worse (in the sense of "performs iteration/doesn't perform iteration") than the macro.

HCOSzifon
Автор

Python dicts have the setdefault() method with kind of does the same thing or_insert, but Entry is more powerful in general.

dmsalomon
Автор

When you use like find and map together in Rust are they mixed together? Or they iterate twice

marcosfons
visit shbcf.ru