You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
<!DOCTYPE html><html lang="en"> <head> <meta charset="utf-8"> <meta name="viewport" content="width=device-width, initial-scale=1, viewport-fit=cover"> <title>prydt's library</title> <meta name="description" content="Pranoy Dutta's Library"> <link href="source-code-pro.css" rel="stylesheet"> <link href="style.css" rel="stylesheet"> </head> <body> <div id="col"> <h1><span id="p">p</span><span id="r">r</span><span id="y">y</span><span id="d">d</span><span id="t">t</span>'s library 📚</h1> <blockquote>"Libraries always remind me that there are good things in this world." - Lauren Ward</blockquote> <details open> <summary>Memory Allocator design (malloc)</summary> <br> <table> <thead> <tr> <th>Document</th> <th>Archive</th> <th>🏴☠️</th> </tr> </thead> <tr> <td><a href="https://danluu.com/malloc-tutorial/">Dan Luu's Malloc Tutorial</a></td> <td><a href="https://web.archive.org/web/20210803151102/https://danluu.com/malloc-tutorial/">archive</a></td> <td>n/a</td> </tr> <tr> <td><a href="http://www.cs.cmu.edu/~bryant/pubdir/sigcse18.pdf">Implementing Malloc [PDF]</a></td> <td><a href="https://web.archive.org/web/20210415003815/http://www.cs.cmu.edu/~bryant/pubdir/sigcse18.pdf">archive</a></td> <td>n/a</td> </tr> <tr> <td><a href="https://arxiv.org/pdf/1902.04738.pdf">MESH: Compacting Memory Management for C/C++ Applications [PDF]</a></td> <td><a href="https://web.archive.org/web/20210604210743/https://arxiv.org/pdf/1902.04738.pdf">archive</a></td> <td>n/a</td> </tr> <tr> <td><a href="https://link.springer.com/chapter/10.1007%2F3-540-60368-9_19">Dynamic storage allocation: A survey and critical review</a></td> <td><a href="https://web.archive.org/web/20210803153927/https://sci-hub.st/https://doi.org/10.1007/3-540-60368-9_19">archive</a></td> <td><a href="https://sci-hub.st/https://doi.org/10.1007/3-540-60368-9_19">sci-hub</a></td> </tr> </table> </details> <details open> <summary>Hashtable design</summary> <br> <table> <thead> <tr> <th>Document</th> <th>Archive</th> <th>🏴☠️</th> </tr> </thead> <tr> <td><a href="https://probablydance.com/2017/02/26/i-wrote-the-fastest-hashtable/">I Wrote the Fastest Hashtable</a></td> <td><a href="https://web.archive.org/web/20210126220454/https://probablydance.com/2017/02/26/i-wrote-the-fastest-hashtable/">archive</a></td> <td>n/a</td> </tr> <tr> <td><a href="https://probablydance.com/2018/05/28/a-new-fast-hash-table-in-response-to-googles-new-fast-hash-table/">A new fast hash table in response to Google’s new fast hash table</a></td> <td><a href="https://web.archive.org/web/20210803160820/https://probablydance.com/2018/05/28/a-new-fast-hash-table-in-response-to-googles-new-fast-hash-table/">archive</a></td> <td>n/a</td> </tr> <tr> <td><a href="https://probablydance.com/2018/06/16/fibonacci-hashing-the-optimization-that-the-world-forgot-or-a-better-alternative-to-integer-modulo/">Fibonacci Hashing: The Optimization that the World Forgot (or: a Better Alternative to Integer Modulo)</a></td> <td><a href="https://web.archive.org/web/20210803161336/https://probablydance.com/2018/06/16/fibonacci-hashing-the-optimization-that-the-world-forgot-or-a-better-alternative-to-integer-modulo/">archive</a></td> <td>n/a</td> </tr> </table> </details> </div> </body></html>
|
