概要

本期嘉宾是 Rust Search Extension 作者朱霜（网络 ID：Folyd ），他在 2018 年开始接触 Rust 后，便一直活跃在 Rust 社区内，除了使用广泛的这个插件，他还参与了《 Rust 日报》的编辑工作，而且还给 Rust 官方标准库贡献过代码，是一位追求极简主义的极客。本期节目聊到了他与 Rust 的种种有趣故事，近一个小时的内容，精彩不容错过。

收听方式

https://rusttalk.github.io/podcast/001/

对节目有任何想法 or 建议，欢迎留言

9 条回复 • 2022-02-14 23:21:48 +08:00

ldm0

2022-01-26 14:00:09 +08:00

资瓷！

liuxu

2022-01-26 14:06:09 +08:00

听听

illuz

2022-01-26 14:37:08 +08:00

资瓷！
另外网页打开很快

FlyingDough

2022-01-26 15:01:10 +08:00

反手就是一个订阅，支持！

liuxu

2022-01-26 15:32:02 +08:00

牛逼，代码预测都要处理

polkadot:
Compiling the rust compiler without this commit and using the self-built compiler to compile our node showed that the native runtime produced the correct data and we could sync the chain. The commit changed the `binary_search_by` function in a way that it could return a different index when there are multiple matches. As we use this function in the runtime, it can lead to a slightly different ordering of the data that is stored in the state, which leads to a different storage root.

binary_search_by:
If the value is found then Result::Ok is returned, containing the index of the matching element. If there are multiple matches, then any one of the matches could be returned. The index is chosen deterministically, but is subject to change in future versions of Rust.