Thomas Mailund

Come join us at the Bioinformatics Research Centre at Aarhus University. Tenure track/associate professor position available. Application deadline June 1, 2025. Application details below, please RT international.au.dk/about/profile/…

💡 Learn to implement hash tables with low overhead and constant time operations. This updated guide from @ThomasMailund is a must-read for developers! Source code available on GitHub for hands-on learning. #Coding #DataStructures #ProgrammingTips 🔍 🔗 ow.ly/EyHL50USKAS

💡 Learn to implement hash tables with low overhead and constant time operations. This updated guide from @ThomasMailund is a must-read for developers! Source code available on GitHub for hands-on learning. #Coding #DataStructures #ProgrammingTips 🔍 🔗 ow.ly/EyHL50USKAS

💡 Learn to implement hash tables with low overhead and constant time operations. This updated guide from @ThomasMailund is a must-read for developers! Source code available on GitHub for hands-on learning. #Coding #DataStructures #ProgrammingTips 🔍 🔗 ow.ly/EyHL50USKAS

💡 Learn to implement hash tables with low overhead and constant time operations. This updated guide from @ThomasMailund is a must-read for developers! Source code available on GitHub for hands-on learning. #Coding #DataStructures #ProgrammingTips 🔍 🔗 ow.ly/EyHL50USKAS

Playing with Scala Lists mailund.dk/posts/scala-li…

💡 Learn to implement hash tables with low overhead and constant time operations. This updated guide from @ThomasMailund is a must-read for developers! Source code available on GitHub for hands-on learning. #Coding #DataStructures #ProgrammingTips 🔍 🔗 ow.ly/EyHL50USKAS

@hoegsberg For readability it certainly is. You get almost exactly the same code. But you get 32 bit chars (which you also can in Python), which is an issue at some point. In any case where you would use this search algorithm, though, I cannot imagine it being an issue

@ThomasMailund Yeah, for sure. I do think iterator of chars is the most fair comparison.

Playing a bit with string search in Python, C, Go and Rust. mailund.dk/posts/some-sim…

@hoegsberg I should have stopped when I had my vector of char since from there I could implement the algorithm in a form very close to Python. It would be easy to recognize as the same. But of course it is highly arbitrary. Limitations only for play and nothing more

@ThomasMailund Right, but where do you draw the line? If you're using str.chars(), you're already using the std lib. Is str.starts_with() ok or cheating?

@hoegsberg I draw the line the only natural place you can draw it. When you get bored with the rabbit hole you are digging yourself into. Here, I just wanted something that resembled the other implementations. I regret going down the alphabet and remapping hole as that was a lot of work.

@hoegsberg In all languages (except C), I should say, there are primitives faster than what I wrote. You don’t gain anything by rolling your own for such a primitive algorithm. Once you get to suffix arrays, though, you start kicking ass

@hoegsberg True, but then I wouldn’t really be implementing it myself would I? ;) But yes there are a ton of ways you can turn a string into an Iterator and then filter it to only get the matches. I played around with it for a good two hours. It wasn’t particularly readable, though

💡 Learn to implement hash tables with low overhead and constant time operations. This updated guide from @ThomasMailund is a must-read for developers! Source code available on GitHub for hands-on learning. #Coding #DataStructures #ProgrammingTips 🔍 🔗 ow.ly/EyHL50USKAS

Today, I signed my resignation letter, so I am officially looking for new opportunities. I'll stay with Kvantify through the spring, but I should find something else to do afterwards, so if anyone has any suggestions, I am all ears.

💡 Learn to implement hash tables with low overhead and constant time operations. This updated guide from @ThomasMailund is a must-read for developers! Source code available on GitHub for hands-on learning. #Coding #DataStructures #ProgrammingTips 🔍 🔗 ow.ly/EyHL50USKAS

💡 Learn to implement hash tables with low overhead and constant time operations. This updated guide from @ThomasMailund is a must-read for developers! Source code available on GitHub for hands-on learning. #Coding #DataStructures #ProgrammingTips 🔍 🔗 ow.ly/EyHL50USKAS

I am advertising for a postdoc in statistical genetics (Aarhus University). Application deadline is 31st January. The position is linked to the ERC-funded project on statistical methods for classifying diseases. Please see international.au.dk/about/profile/… for more details.

Two weeks left to apply (Jan 15) for postdoc (2.5 years) in population genetics of the Paleolithic in my group. An interdisciplinary project with Felix Riede @ARCHAEOfelix , and a new postdoc in his group covering archaeology. Please RT or apply using tinyurl.com/4jt4dru4

Facts #lab