At least this kind of thing is genuinely useful as a stress test for the Rust compiler.
Show HN: FizzBuzz purely in Rust's trait system
11–20 of 32 posts
Re: Show HN: FizzBuzz purely in Rust's trait system
#12Makes me think of the time, many, many, many years go, when I was learning IBM 7090 assembly language (my introduction to computers). The macro assembler was powerful enough that I could check for primality at assembly time.
Re: Show HN: FizzBuzz purely in Rust's trait system
#13Oh good. We're reaching C++ levels of template metaprogramming.
Re: Show HN: FizzBuzz purely in Rust's trait system
#14what's Three here?
Re: Show HN: FizzBuzz purely in Rust's trait system
#15[deleted]
Re: Show HN: FizzBuzz purely in Rust's trait system
#16Wait, there's no loop from 1 to 100. I would not count.
Re: Show HN: FizzBuzz purely in Rust's trait system
#17It's horrible, I love it! Interesting implementation of `If`, I had no idea the trait system could be... used ... to such extent.
A lot of this is fairly standard church encoding.
Re: Show HN: FizzBuzz purely in Rust's trait system
#18Fizz Buzz rules here: https://en.m.wikipedia.org/wiki/Fizz_buzz
Rules for actually using this crate: Don't :-).
That said, there are legitimate reasons to implement things at compile time. It means that libraries can create very efficient code that you don't have to write. But like all of powerful capabilities you should beware of misusing them. Like this :-).
Re: Show HN: FizzBuzz purely in Rust's trait system
#19Someone looking for the unbeatable https://github.com/EnterpriseQualityCoding/FizzBuzzEnterpris... ?
Seems unrelated. Does Java have a compile-time feature that is Turing complete and can be (ab)used to write FizzBuzz? For example, C++ has such a feature: https://gist.github.com/bgaff/2496338 (there's more examples, try searching for "accidentally Turing-complete", there are some really fun solutions.)
As far as i know, No.
The compiler stubbornly refuse to inline any method calls.
But it has been proposed in JEP 303 [1]
Re: Show HN: FizzBuzz purely in Rust's trait system
#20Earlier quoted context omitted.
Seems unrelated. Does Java have a compile-time feature that is Turing complete and can be (ab)used to write FizzBuzz? For example, C++ has such a feature: https://gist.github.com/bgaff/2496338 (there's more examples, try searching for "accidentally Turing-complete", there are some really fun solutions.)
As far as i know, No. The compiler stubbornly refuse to inline any method calls. But it has been proposed in JEP 303 [1] [1] https://openjdk.java.net/jeps/303
Actually, subtype-checking in Java is Turing-complete. Someone proved this and used the result to build a parser generator for fluent interfaces. [1]