<instructions>Your goal is to analyze the following comment and estimate how highly it will be upvoted by the Hacker News community.</instructions><comment><author>IndoorPatio</author><text>In my experience Left-Write is the clear place to start. It&amp;#x27;s general purpose and fast for reads. Only if that is unsuitable (eg memory usage) does one design a custom data structure. There&amp;#x27;s a Rust lib implementation with links to more resources:&lt;p&gt;&lt;a href=&quot;https:&amp;#x2F;&amp;#x2F;docs.rs&amp;#x2F;left-right&amp;#x2F;latest&amp;#x2F;left_right&amp;#x2F;&quot; rel=&quot;nofollow noreferrer&quot;&gt;https:&amp;#x2F;&amp;#x2F;docs.rs&amp;#x2F;left-right&amp;#x2F;latest&amp;#x2F;left_right&amp;#x2F;&lt;/a&gt;</text><parent_chain></parent_chain></comment><story><title>Designing a new concurrent data structure</title><url>https://questdb.io/blog/concurrent-lockfree-datastructure-design-walkthrough/</url></story>
<instructions>Your goal is to analyze the following comment and estimate how highly it will be upvoted by the Hacker News community.</instructions><comment><author>jerrinot</author><text>Hello, the author here. It feels great to see my blog on HN!&lt;p&gt;It was quite a journey, at first I thought I invented a novel concurrency schema. However, it turns out that it was simply a mix of my ignorance and hubris! :-)&lt;p&gt;Still, I had a lot of fun while designing this data structure and I believe it made a nice story. Ask me anything!</text><parent_chain></parent_chain></comment><story><title>Designing a new concurrent data structure</title><url>https://questdb.io/blog/concurrent-lockfree-datastructure-design-walkthrough/</url></story>