Eliza Weisman

And if you do, you still have something nicer than just naively sticking one hash map inside of a read-write lock, because sometimes doing the write operation to The map will do a bunch more. You might have to allocate something inside the map. You might have to fill up a bucket and have to move things around. And all of that happens in a write lock that's only contended by writers, right?

And if you do, you still have something nicer than just naively sticking one hash map inside of a read-write lock, because sometimes doing the write operation to The map will do a bunch more. You might have to allocate something inside the map. You might have to fill up a bucket and have to move things around. And all of that happens in a write lock that's only contended by writers, right?

And then the lock that also contends with reads just swaps two pointers, right? So the amount of time that a reader... with that lock is substantially reduced relative to just putting one hash map inside of a . But you're still contending with the reader because you have said, I want to do this refresh operation on every write.

And then the lock that also contends with reads just swaps two pointers, right? So the amount of time that a reader... with that lock is substantially reduced relative to just putting one hash map inside of a . But you're still contending with the reader because you have said, I want to do this refresh operation on every write.

But you also can tune the consistency of the map and say, I actually don't want to do that. I want to do it periodically. And now you have a situation where you've reduced the contention readers substantially by every 5 or 10 or 25 writes you refresh the replica that's read from.

But you also can tune the consistency of the map and say, I actually don't want to do that. I want to do it periodically. And now you have a situation where you've reduced the contention readers substantially by every 5 or 10 or 25 writes you refresh the replica that's read from.

And this is just kind of neat, because I find it very beautiful in its sort of conceptual elegance, and depending on the particular need you have for a concurrent HashMap, it could be the right one, or it could be wildly incorrect for your use case. I just think it's fun.

And this is just kind of neat, because I find it very beautiful in its sort of conceptual elegance, and depending on the particular need you have for a concurrent HashMap, it could be the right one, or it could be wildly incorrect for your use case. I just think it's fun.

Yeah, the thing that I neglected to mention is I believe there's a way to explicitly say, right now I want to synchronize the two replicas, as well as you can set an interval or a number of writes after which you will refresh. I haven't used this in quite some time. I don't remember the API for it. But the idea of it has stuck with me as long as I've known about it.

Yeah, the thing that I neglected to mention is I believe there's a way to explicitly say, right now I want to synchronize the two replicas, as well as you can set an interval or a number of writes after which you will refresh. I haven't used this in quite some time. I don't remember the API for it. But the idea of it has stuck with me as long as I've known about it.

That's most of my list. The rest was... Oh, I wanted to mention the Bytes Crate, which is a terrible name for a wonderful library that many of you probably already encountered, or perhaps unknowingly, because if you use Hyper, you actually are secretly using this. And Bytes is something from the Tokyo Project, and what it is... Oh, Sean's here in the chat. Sean can talk lots about Bytes.

That's most of my list. The rest was... Oh, I wanted to mention the Bytes Crate, which is a terrible name for a wonderful library that many of you probably already encountered, or perhaps unknowingly, because if you use Hyper, you actually are secretly using this. And Bytes is something from the Tokyo Project, and what it is... Oh, Sean's here in the chat. Sean can talk lots about Bytes.

Bytes is essentially a reference-counted byte buffer. So it's like an ARC VEC U8, except that you can take slices of it, and the slices are also owned objects that participate in the reference count of the whole buffer. So this is very nice if you want to read data from the network and then parse it into something and you want to take slices out of it.

Bytes is essentially a reference-counted byte buffer. So it's like an ARC VEC U8, except that you can take slices of it, and the slices are also owned objects that participate in the reference count of the whole buffer. So this is very nice if you want to read data from the network and then parse it into something and you want to take slices out of it.

for, like, here's the HTTP request's path and its headers can all be sub-slices of one buffer that all of the bytes into. And I think bytes is just sort of a really lovely library. Really nicely. And also is the foundational building block under creative that Rain and I collaborated in past, which is buff list, which is just some code that...

for, like, here's the HTTP request's path and its headers can all be sub-slices of one buffer that all of the bytes into. And I think bytes is just sort of a really lovely library. Really nicely. And also is the foundational building block under creative that Rain and I collaborated in past, which is buff list, which is just some code that...

was that I think Rain asked me how to do something, and I referenced some code that had been written probably by Sean MacArthur within an application that Rain just went and turned into a library that he used at Oxide. And I'm going to let Rain talk about that.

was that I think Rain asked me how to do something, and I referenced some code that had been written probably by Sean MacArthur within an application that Rain just went and turned into a library that he used at Oxide. And I'm going to let Rain talk about that.