Liam Watts
LightNews LightNews
banner
liam271.bsky.social
Liam Watts
@liam271.bsky.social
26 followers 170 following 7 posts
Software engineer and language leaner

I do backend, data engineering, some frontend, some AI. Love learning new things and so I've picked up languages like C#, Haskell, Rust, and Japanese

https://github.com/Wattsy2020
Posts Replies Media Videos
liam271.bsky.social
So for now I'll rest easy knowing Gemini 2 won't take my job. Fingers crossed for o3...
December 21, 2024 at 1:07 PM
liam271.bsky.social
I then asked it if it's possible to do this without cloning, it was too suggestible and said yes. The first attempt removed the clone calls and change nothing else (causing compiler errors for moving a value twice). After providing the compiler output it failed to fix the errors with this oddity
impl<T, I: Iterator<Item = T>> Iterator for PairwiseResults<T, I> { type Item = Pair<T>; fn next(&mut self) -> Option<Self::Item> { match self.iterator.next() { None => self.prev.take().map(Last), Some(next) => { match self.prev.take() { None => { self.prev = Some(next); match self.prev.take() { Some(val) => Some(First(val)), None => unreachable!(), // This should not happen } } Some(prev) => { self.prev = Some(next); match self.prev.take() { Some(val) => Some(Middle(prev, val)), None => unreachable!(), // This should not happen } } } } } } }
December 21, 2024 at 1:07 PM
liam271.bsky.social
It gave the following code, which at first looks good. It's an improvement over Claude Sonnet (which forgot the T: Clone bound, and thought Clone returned a Result<> for some reason).

However on closer look it removed the crucial `self.prev = None` line which means the iterator continues infinitely
impl<T, I: Iterator<Item = T>> Iterator for PairwiseResults<T, I> where T: Clone, // Add Clone bound if you need to clone the values { type Item = Pair<T>; fn next(&mut self) -> Option<Self::Item> { match self.iterator.next() { None => { let result = self.prev.take().map(Last); result }, Some(next) => { let temp = self.prev.take(); self.prev = Some(next.clone()); // Clone here if needed, otherwise move match temp { None => Some(First(next)), Some(prev) => Some(Middle(prev, next)) } } } } }
December 21, 2024 at 1:07 PM
liam271.bsky.social
It seems it's not just a rewrite, they want to add features to SQLite and make it Async turso.tech/blog/introdu.... In that case it makes sense why they'd want Rust's safety for the new features they're adding
Introducing Limbo: A complete rewrite of SQLite in Rust
we forked SQLite with the libSQL project. What would it be like if we just rewrote it?
turso.tech
December 10, 2024 at 11:36 PM
liam271.bsky.social
Good article! I liked it because I've dabbled in Haskell but never used it for anything practical. Would be interesting to learn how it is to say, write a microservice with FP. Is it that much better than imperative code despite the less mature ecosystem?
December 5, 2024 at 11:03 AM