Jack William Bell<p>Interesting idea, although I don't know if it needs to be a primitive. The os.tree() function in <a href="https://rustedneuron.com/tags/Python" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Python</span></a> does this for file systems and, as a model, could be used as the basis for other kinds of tree structures. (Note that os.tree() also properly handles both top down and bottom up processing.)</p><p>> Programming languages should have a tree traversal primitive. <a href="https://blog.tylerglaiel.com/p/programming-languages-should-have" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">blog.tylerglaiel.com/p/program</span><span class="invisible">ming-languages-should-have</span></a></p><p><a href="https://rustedneuron.com/tags/programming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>programming</span></a> <a href="https://rustedneuron.com/tags/C" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>C</span></a> <a href="https://rustedneuron.com/tags/CPP" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>CPP</span></a> <a href="https://rustedneuron.com/tags/algorithms" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>algorithms</span></a> <a href="https://rustedneuron.com/tags/DataStructures" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>DataStructures</span></a></p>
Recent searches
No recent searches
Search options
Only available when logged in.
mastodon.world is one of the many independent Mastodon servers you can use to participate in the fediverse.
Generic Mastodon server for anyone to use.
Administered by:
Server stats:
9.6Kactive users
mastodon.world: About · Status · Profiles directory · Privacy policy
Mastodon: About · Get the app · Keyboard shortcuts · View source code · v4.3.7
#datastructures
5 posts · 5 participants · 0 posts today
Hacker News<p>Packed Data Support in Haskell</p><p><a href="https://arthi-chaud.github.io/posts/packed/" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">arthi-chaud.github.io/posts/pa</span><span class="invisible">cked/</span></a></p><p><a href="https://mastodon.social/tags/HackerNews" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>HackerNews</span></a> <a href="https://mastodon.social/tags/PackedData" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>PackedData</span></a> <a href="https://mastodon.social/tags/Haskell" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Haskell</span></a> <a href="https://mastodon.social/tags/Programming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Programming</span></a> <a href="https://mastodon.social/tags/FunctionalProgramming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>FunctionalProgramming</span></a> <a href="https://mastodon.social/tags/DataStructures" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>DataStructures</span></a> <a href="https://mastodon.social/tags/HackerNews" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>HackerNews</span></a></p>
LavX News<p>Unlocking the Power of K: Advanced Indexing and Function Application Techniques</p><p>Delve into the unique features of the K programming language that revolutionize data manipulation and function application. This article explores the profound symmetry between indexing and function ca...</p><p><a href="https://news.lavx.hu/article/unlocking-the-power-of-k-advanced-indexing-and-function-application-techniques" rel="nofollow noopener noreferrer" target="_blank"><span class="invisible">https://</span><span class="ellipsis">news.lavx.hu/article/unlocking</span><span class="invisible">-the-power-of-k-advanced-indexing-and-function-application-techniques</span></a></p><p><a href="https://mastodon.cloud/tags/news" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>news</span></a> <a href="https://mastodon.cloud/tags/tech" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>tech</span></a> <a href="https://mastodon.cloud/tags/DataStructures" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>DataStructures</span></a> <a href="https://mastodon.cloud/tags/KProgramming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>KProgramming</span></a> <a href="https://mastodon.cloud/tags/FunctionApplication" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>FunctionApplication</span></a></p>
AK<p>🎯 Let’s Juggle Arrays! Master the Art of Rotation with the Juggling Algorithm 🔄✨ <br>In this post, we’ll break down the steps and uncover the magic behind this algorithm:<br>✅ Why cycles matter : How GCD helps us divide the array into manageable chunks 🔢<br>✅ Step-by-step rotation : Move elements in a juggling pattern—no extra memory needed! 🚀<br>✅ Interactive examples : Follow along as we rotate arrays left or right with ease 🔄 <br><a href="https://mastodon.social/tags/Coding" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Coding</span></a> <a href="https://mastodon.social/tags/Algorithms" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Algorithms</span></a> <a href="https://mastodon.social/tags/DataStructures" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>DataStructures</span></a> <a href="https://mastodon.social/tags/TechTips" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>TechTips</span></a> <a href="https://mastodon.social/tags/ProblemSolving" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ProblemSolving</span></a></p>
ResearchBuzz: Firehose<p>Search Engine Journal: Google Quietly Ends COVID-Era Structured Data Support. “Google announced that it is dropping support for the 2020 COVID-era Special Announcements structured data type and completely phasing it out by July 31, 2025. The announcement was posted on the SpecialAnnouncement structured data documentation.”</p><p><a href="https://rbfirehose.com/2025/04/26/search-engine-journal-google-quietly-ends-covid-era-structured-data-support/" class="" rel="nofollow noopener noreferrer" target="_blank">https://rbfirehose.com/2025/04/26/search-engine-journal-google-quietly-ends-covid-era-structured-data-support/</a></p>
Leanpub<p>Data Munging With Perl [2ed]: Techniques for data recognition, parsing, transformation and filtering <a href="https://leanpub.com/datamungingwithperl" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="">leanpub.com/datamungingwithperl</span><span class="invisible"></span></a> by Dave Cross is the featured book on the Leanpub homepage! <a href="https://leanpub.com" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="">leanpub.com</span><span class="invisible"></span></a> <a href="https://mastodon.social/tags/Perl" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Perl</span></a> <a href="https://mastodon.social/tags/DataStructures" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>DataStructures</span></a> <a href="https://mastodon.social/tags/SoftwareEngineering" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>SoftwareEngineering</span></a> <a href="https://mastodon.social/tags/books" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>books</span></a> <a href="https://mastodon.social/tags/ebooks" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ebooks</span></a> <a href="https://mastodon.social/tags/programming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>programming</span></a> <a href="https://mastodon.social/tags/datascience" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>datascience</span></a></p><p>Your desktop dictionary may not include it, but 'munging' is a common term in the programmer’s world.</p><p>Find it on Leanpub!</p>
LavX News<p>Unlocking Memory Efficiency: The Power of Bloom Filters in Modern Applications</p><p>In an age where data overload is the norm, Bloom filters emerge as a game-changing data structure, offering a memory-efficient solution for set membership checks. Discover how this probabilistic appro...</p><p><a href="https://news.lavx.hu/article/unlocking-memory-efficiency-the-power-of-bloom-filters-in-modern-applications" rel="nofollow noopener noreferrer" target="_blank"><span class="invisible">https://</span><span class="ellipsis">news.lavx.hu/article/unlocking</span><span class="invisible">-memory-efficiency-the-power-of-bloom-filters-in-modern-applications</span></a></p><p><a href="https://mastodon.cloud/tags/news" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>news</span></a> <a href="https://mastodon.cloud/tags/tech" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>tech</span></a> <a href="https://mastodon.cloud/tags/DataStructures" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>DataStructures</span></a> <a href="https://mastodon.cloud/tags/MemoryEfficiency" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>MemoryEfficiency</span></a> <a href="https://mastodon.cloud/tags/BloomFilters" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>BloomFilters</span></a></p>
FunctionalProgrammingIdeas and Solutions for Advent of Code 2021 in Kotlin — Part 2/4 Ideas and Solutions for Ad...<br><br><a href="https://medium.com/xorum-io/ideas-and-solutions-for-advent-of-code-2021-in-kotlin-part-2-4-5079d5066653?source=rss----92bb7980cc9f---4" rel="nofollow noopener noreferrer" target="_blank">https://medium.com/xorum-io/ideas-and-solutions-for-advent-of-code-2021-in-kotlin-part-2-4-5079d5066653?source=rss----92bb7980cc9f---4</a><br><br><a rel="nofollow noopener noreferrer" class="mention hashtag" href="https://mastodon.social/tags/kotlin" target="_blank">#kotlin</a> <a rel="nofollow noopener noreferrer" class="mention hashtag" href="https://mastodon.social/tags/algorithms" target="_blank">#algorithms</a> <a rel="nofollow noopener noreferrer" class="mention hashtag" href="https://mastodon.social/tags/advent-of-code" target="_blank">#advent-of-code</a> <a rel="nofollow noopener noreferrer" class="mention hashtag" href="https://mastodon.social/tags/data-structures" target="_blank">#data-structures</a> <a rel="nofollow noopener noreferrer" class="mention hashtag" href="https://mastodon.social/tags/competetive-programming" target="_blank">#competetive-programming</a><br><br><a href="https://awakari.com/pub-msg.html?id=Y58haf5EJYD3cVEj3isFBy3ud96" rel="nofollow noopener noreferrer" target="_blank">Event Attributes</a>
FunctionalProgrammingIdeas and Solutions for Advent of Code 2021 in Kotlin — Part 3/4 Ideas and Solutions for Ad...<br><br><a href="https://medium.com/xorum-io/ideas-and-solutions-for-advent-of-code-2021-in-kotlin-part-3-4-dbfd577703cc?source=rss----92bb7980cc9f---4" rel="nofollow noopener noreferrer" target="_blank">https://medium.com/xorum-io/ideas-and-solutions-for-advent-of-code-2021-in-kotlin-part-3-4-dbfd577703cc?source=rss----92bb7980cc9f---4</a><br><br><a rel="nofollow noopener noreferrer" class="mention hashtag" href="https://mastodon.social/tags/algorithms" target="_blank">#algorithms</a> <a rel="nofollow noopener noreferrer" class="mention hashtag" href="https://mastodon.social/tags/competitive-programming" target="_blank">#competitive-programming</a> <a rel="nofollow noopener noreferrer" class="mention hashtag" href="https://mastodon.social/tags/advent-of-code" target="_blank">#advent-of-code</a> <a rel="nofollow noopener noreferrer" class="mention hashtag" href="https://mastodon.social/tags/data-structures" target="_blank">#data-structures</a> <a rel="nofollow noopener noreferrer" class="mention hashtag" href="https://mastodon.social/tags/kotlin" target="_blank">#kotlin</a><br><br><a href="https://awakari.com/pub-msg.html?id=EWBZBqntEItno9DGEymftLvkips" rel="nofollow noopener noreferrer" target="_blank">Event Attributes</a>
LavX News<p>Revolutionizing Data Structures: Zig's New Intrusive LinkedList API</p><p>Zig's recent update introduces a streamlined, non-generic LinkedList API that enhances performance and memory efficiency. By embedding nodes directly within user data structures, developers can levera...</p><p><a href="https://news.lavx.hu/article/revolutionizing-data-structures-zig-s-new-intrusive-linkedlist-api" rel="nofollow noopener noreferrer" target="_blank"><span class="invisible">https://</span><span class="ellipsis">news.lavx.hu/article/revolutio</span><span class="invisible">nizing-data-structures-zig-s-new-intrusive-linkedlist-api</span></a></p><p><a href="https://mastodon.cloud/tags/news" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>news</span></a> <a href="https://mastodon.cloud/tags/tech" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>tech</span></a> <a href="https://mastodon.cloud/tags/DataStructures" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>DataStructures</span></a> <a href="https://mastodon.cloud/tags/MemoryManagement" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>MemoryManagement</span></a> <a href="https://mastodon.cloud/tags/ZigLang" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ZigLang</span></a></p>
Leanpub<p>Computational Complexity: From Asymptotic Foundations to Quantum Computing and NP Completeness Theory <a href="https://leanpub.com/computational-complexity?utm_content=bufferff35c&utm_medium=social&utm_source=twitter.com&utm_campaign=buffer" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">leanpub.com/computational-comp</span><span class="invisible">lexity?utm_content=bufferff35c&utm_medium=social&utm_source=twitter.com&utm_campaign=buffer</span></a> by Kalyan Chakravarthy Kodela is the featured book on the Leanpub homepage! <a href="https://leanpub.com" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="">leanpub.com</span><span class="invisible"></span></a> <a href="https://mastodon.social/tags/ComputerProgramming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ComputerProgramming</span></a> <a href="https://mastodon.social/tags/DataStructures" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>DataStructures</span></a> <a href="https://mastodon.social/tags/ComputerScience" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ComputerScience</span></a> <a href="https://mastodon.social/tags/Engineering" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Engineering</span></a> <a href="https://mastodon.social/tags/books" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>books</span></a> <a href="https://mastodon.social/tags/ebooks" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ebooks</span></a></p><p>Find it on Leanpub!</p>
noisediver<p>Visualising data structures and algorithms through animation</p><p><a href="https://visualgo.net/en" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="">visualgo.net/en</span><span class="invisible"></span></a></p><p><a href="https://med-mastodon.com/tags/datastructures" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>datastructures</span></a> <a href="https://med-mastodon.com/tags/algorithms" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>algorithms</span></a> <a href="https://med-mastodon.com/tags/computerscience" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>computerscience</span></a></p>
Leanpub<p>Data Munging With Perl [2ed]: Techniques for data recognition, parsing, transformation and filtering <a href="https://leanpub.com/datamungingwithperl" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="">leanpub.com/datamungingwithperl</span><span class="invisible"></span></a> by Dave Cross is the featured book on the Leanpub homepage! <a href="https://leanpub.com" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="">leanpub.com</span><span class="invisible"></span></a> <a href="https://mastodon.social/tags/Perl" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Perl</span></a> <a href="https://mastodon.social/tags/DataStructures" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>DataStructures</span></a> <a href="https://mastodon.social/tags/SoftwareEngineering" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>SoftwareEngineering</span></a> <a href="https://mastodon.social/tags/books" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>books</span></a> <a href="https://mastodon.social/tags/ebooks" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ebooks</span></a></p>
Leanpub<p>Mastering Discrete Mathematics - From Theory to Real World Engineering Applications <a href="https://leanpub.com/discretemathematics" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="">leanpub.com/discretemathematics</span><span class="invisible"></span></a> by Kalyan Chakravarthy Kodela is the featured book on the Leanpub homepage! <a href="https://leanpub.com" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="">leanpub.com</span><span class="invisible"></span></a> <a href="https://mastodon.social/tags/DataStructures" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>DataStructures</span></a> <a href="https://mastodon.social/tags/books" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>books</span></a> <a href="https://mastodon.social/tags/ebooks" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ebooks</span></a> <a href="https://mastodon.social/tags/mathematics" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>mathematics</span></a> <a href="https://mastodon.social/tags/engineering" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>engineering</span></a></p><p>Dive into the world of discrete mathematics with this expertly crafted guide.</p><p>Find it on Leanpub!</p>
Hacker News<p>Ruby, Ractors, and Lock-Free Data Structures</p><p><a href="https://iliabylich.github.io/ruby-ractors-and-lock-free-data-structures/" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">iliabylich.github.io/ruby-ract</span><span class="invisible">ors-and-lock-free-data-structures/</span></a></p><p><a href="https://mastodon.social/tags/HackerNews" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>HackerNews</span></a> <a href="https://mastodon.social/tags/Ruby" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Ruby</span></a> <a href="https://mastodon.social/tags/Ractors" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Ractors</span></a> <a href="https://mastodon.social/tags/LockFree" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>LockFree</span></a> <a href="https://mastodon.social/tags/DataStructures" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>DataStructures</span></a> <a href="https://mastodon.social/tags/ProgrammingConcurrency" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ProgrammingConcurrency</span></a></p>
Hacker News<p>Shift-to-Middle Array: A Faster Alternative to Std:Deque?</p><p><a href="https://github.com/attilatorda/Shift-To-Middle_Array" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/attilatorda/Shift-T</span><span class="invisible">o-Middle_Array</span></a></p><p><a href="https://mastodon.social/tags/HackerNews" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>HackerNews</span></a> <a href="https://mastodon.social/tags/ShiftToMiddleArray" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ShiftToMiddleArray</span></a> <a href="https://mastodon.social/tags/FasterAlternative" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>FasterAlternative</span></a> <a href="https://mastodon.social/tags/StdDeque" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>StdDeque</span></a> <a href="https://mastodon.social/tags/DataStructures" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>DataStructures</span></a> <a href="https://mastodon.social/tags/HackerNews" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>HackerNews</span></a></p>
Mark Gritter<p>For $PROJECT I am wondering how sparse a bitmap needs to be before it's worth looking at alternatives.</p><p>Say I have a 32-bit random seed and it produces a tuple (x_1, x_2, ..., x_n) of attributes through some process we want to analyze. What I'd like is to build an index that lets me identify seed values with, say, x_1=4, or quickly intersect several indexes to find a seed value with x_1=4 and x_2 = 13 and x_3 = 5.</p><p>If the domain of x_i is small (say, 16 different values) then we could use a bunch of bitmaps -- they're only 512MiB each. Each bitmap will be only 6% populated, is that enough to consider a fancier representation that compresses the bitmap?</p><p>I've read "Searchable compressed representations of very sparse bitmaps" <a href="https://www.stevenpigeon.com/Publications/publications/SparseBitmap.pdf" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">stevenpigeon.com/Publications/</span><span class="invisible">publications/SparseBitmap.pdf</span></a> but my feeling right now is this isn't a good fit.</p><p>There are a bunch of ideas of the form "index a collection of containers, which may be arrays or compressed arrays or bitmaps" which probably only work well when the set is not very evenly distributed.</p><p><a href="https://mathstodon.xyz/tags/DataStructures" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>DataStructures</span></a> <a href="https://mathstodon.xyz/tags/ExpressiveRangeAnalysis" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ExpressiveRangeAnalysis</span></a></p>
Hacker News<p>Visualising data structures and algorithms through animation</p><p><a href="https://visualgo.net/en" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="">visualgo.net/en</span><span class="invisible"></span></a></p><p><a href="https://mastodon.social/tags/HackerNews" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>HackerNews</span></a> <a href="https://mastodon.social/tags/Visualisation" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Visualisation</span></a> <a href="https://mastodon.social/tags/Animation" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Animation</span></a> <a href="https://mastodon.social/tags/DataStructures" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>DataStructures</span></a> <a href="https://mastodon.social/tags/Algorithms" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Algorithms</span></a> <a href="https://mastodon.social/tags/Education" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Education</span></a></p>
Leanpub<p>C++ Programming Cookbook: Proven solutions using C++ 20 across functions, file I/O, streams, memory management, STL, concurrency, type manipulation and error debugging <a href="https://leanpub.com/cprogrammingcookbook" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">leanpub.com/cprogrammingcookbo</span><span class="invisible">ok</span></a> by GitforGits | Asian Publishing House is the featured book on the Leanpub homepage! <a href="https://leanpub.com" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="">leanpub.com</span><span class="invisible"></span></a> <a href="https://mastodon.social/tags/CAndCpp" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>CAndCpp</span></a> <a href="https://mastodon.social/tags/Algorithm" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Algorithm</span></a> <a href="https://mastodon.social/tags/ProgrammingCookbooks" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ProgrammingCookbooks</span></a> <a href="https://mastodon.social/tags/DataStructures" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>DataStructures</span></a> <a href="https://mastodon.social/tags/SoftwareEngineering" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>SoftwareEngineering</span></a> <a href="https://mastodon.social/tags/books" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>books</span></a> <a href="https://mastodon.social/tags/ebooks" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ebooks</span></a></p><p>Find it on Leanpub!</p>
Manmohan Mishra<p>🚀 "Ever wondered how Python's lists, tuples, sets, and dicts work under the hood? Learn their secrets, speed hacks, and common mistakes to avoid! Perfect for coders aiming to optimize their Python skills. 🐍 <a href="https://mastodon.social/tags/Python" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Python</span></a> <a href="https://mastodon.social/tags/DataStructures" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>DataStructures</span></a> <a href="https://mastodon.social/tags/ProgrammingTips" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ProgrammingTips</span></a></p><p><a href="https://newwstuff.com/python-data-structures-internal-workings-of-lists-tuples-sets-dicts/" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">newwstuff.com/python-data-stru</span><span class="invisible">ctures-internal-workings-of-lists-tuples-sets-dicts/</span></a></p>
ExploreLive feeds
Mastodon is the best way to keep up with what's happening.
Follow anyone across the fediverse and see it all in chronological order. No algorithms, ads, or clickbait in sight.
Create accountLoginDrag & drop to upload