does that work with a fingertree though? ^^
July 21, 2025 at 8:35 PM
does that work with a fingertree though? ^^
Algorithms for Trees -- Foldable, Applicative, Traversable accepted for C++Now 2026.
Fingertree as the motivating example, but the algorithms are adaptable to any tree with a handful of functions you define.
Looking forward to Aspen in May!
#CppNow @cppnow
Fingertree as the motivating example, but the algorithms are adaptable to any tree with a handful of functions you define.
Looking forward to Aspen in May!
#CppNow @cppnow
March 11, 2026 at 11:22 AM
Algorithms for Trees -- Foldable, Applicative, Traversable accepted for C++Now 2026.
Fingertree as the motivating example, but the algorithms are adaptable to any tree with a handful of functions you define.
Looking forward to Aspen in May!
#CppNow @cppnow
Fingertree as the motivating example, but the algorithms are adaptable to any tree with a handful of functions you define.
Looking forward to Aspen in May!
#CppNow @cppnow
Hi! My name is Ty Anderson and I write horror and fantasy and sometimes other things too. My short story, The Fingertree, was published this year in the Dark Town anthology from D&T Publishing. Another thing you should know about me is I wish the trend where food influencers eat what they make…
September 19, 2023 at 12:09 PM
Hi! My name is Ty Anderson and I write horror and fantasy and sometimes other things too. My short story, The Fingertree, was published this year in the Dark Town anthology from D&T Publishing. Another thing you should know about me is I wish the trend where food influencers eat what they make…
Me implementing Okasaki’s skew binary random access lists (RAL) in haskell:
How are these nearly an order of magnitude slower than Data.Sequence? The constant factor should be low and the original fingertree paper said RAL was faster.
After compiling with O2:
Oh beautiful. It’s faster now.
How are these nearly an order of magnitude slower than Data.Sequence? The constant factor should be low and the original fingertree paper said RAL was faster.
After compiling with O2:
Oh beautiful. It’s faster now.
March 5, 2025 at 1:37 PM
Me implementing Okasaki’s skew binary random access lists (RAL) in haskell:
How are these nearly an order of magnitude slower than Data.Sequence? The constant factor should be low and the original fingertree paper said RAL was faster.
After compiling with O2:
Oh beautiful. It’s faster now.
How are these nearly an order of magnitude slower than Data.Sequence? The constant factor should be low and the original fingertree paper said RAL was faster.
After compiling with O2:
Oh beautiful. It’s faster now.
March 8, 2025 at 10:15 PM
Hi! My name is Ty Anderson and I write horror and fantasy and sometimes a combination of both! My short story, The Fingertree, was published this year in the Dark Town anthology from D&T Publishing. It has to be Milk Duds all the way down for me, I am at least 10% Milk Duds. Maybe 30%.
September 19, 2023 at 1:53 PM
Hi! My name is Ty Anderson and I write horror and fantasy and sometimes a combination of both! My short story, The Fingertree, was published this year in the Dark Town anthology from D&T Publishing. It has to be Milk Duds all the way down for me, I am at least 10% Milk Duds. Maybe 30%.
fingertree library edish twitch.tv/vaportone
June 5, 2025 at 8:22 PM
fingertree library edish twitch.tv/vaportone