@Downgoat No, it does fancy 3d stuff. But e.g. police could unlock someone's phone by holding it in front of them. Apple was against giving police phone access, remember.
I like how Android is Linux-based, and has to be open source. Fuchsia is licensed under Apache/MIT so phone manufacturers would be free to insert hidden proprietary things without the consumer knowing.
Pizza is human, personal, each pizza is unique and special, the same phone can be used again and again to do the same thing, but each pizza is single use, infinitely more valuable.
Link to your own answer
This is a codegolf challenge and the only thing your code has to do is provide a link, that when pasted in the adress bar of a browser redirects to your answer.
May the shortest code win!
@LeakyNun This is because SWI-Prolog's constraint library is not powerful enough to automatically deduce that 2^X #= 0 is impossible. I had submitted an issue on github about this but this has not been improved yet afaik.
So it succeeds because it creates the constraint 2^L #= 0 without realizing it cannot be satisfied
Since you don't request a value for L it wont try any.
@ASCII-only I intentionally ignored the invite because I'm not interested in re-inventing the wheel
@cairdcoinheringaahing I think it might be better if loops operate off the Dump rather than the Cell
otherwise you can't reliably make any sort of loop
in BrainFlump right now we need to do ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++. to print H, in brainfuck we can just do ++++++[>++++++++++++<-]>. So it should be possible to do something similar in BrainFlump if loops operate on the Dump rather than the Cell
The problem is how to remove the root when there are no children left. The way I usually do trees is by writing a class for a node which stores its parent, children, and value, and then I only need to track the root object, but when the last node is removed, that doesn't really work :P
One way I could do it is write the tree as a tuple like I have it in the parser for BrainFlex
Alternatively, I can have an extra "superroot" node above the root that doesn't really exist but I can use it to keep track of nodes
I have a new idea: "datatype" where push XORs the current seed with the new value and pop/peek generates a random number using the current seed
@Mayube 528 bytes (tio link does not work, of course) (https://tio.run/##RZGxbsMgEIbn8BS0C5DYVtxuONcla9UXsDxYcCRIKVhAnHTpq6fgNumE@O/jv/@O6SsdvXu93UzwnzR@RWo/Jx/SmixCGJ3Ox10bYQyHmcyAYGFLNPQDsYae0PFRPMGrxKtNXGSN1YYBjH07SAN@KkD/MojOg2kCjpqLzjTq5CP@4eqOeygk0WjoO4@Vqj6qICShuU9slD@7xJXYfciA6Rxc3RIaIfZShqEzORM1PlBLrSvZD8hLtiiywWqfMTuQldmAAtiTVXY0AA@nbx7etmL9@6C2hD46XI72hNTuSsmXLAp8scqZGM@5lcQNtB1eUTEL79xXz@K5wqoVbM2dT3QWCysWdmk8yz@QF7BuBVnhKaLEGvJExalnczZlFZvr5dAb6Oeh3EE3k594@Zv/GbUQYin6oHlM2rrfPbeLnAV/Ts0l2IRcHQOfF3nLhp5tatlVDWuMdTqvtoyVG99uPw)
@NathanMerrill I was only thinking about java but I suppose I agree for other languages as well. Consider a recursive function with a base case:public void foo(int bar) { if (bar == 0) return; foo(bar - 1); }
it may be common for languages to require something like that
but best practices would suggest you write a function in a way that it's easy to use and hard to misuse
so if the first call needs an empty value
maybe you write an overloaded method signature that only takes the one parameter
i guess i can't argue best practices in code golf, though
Anonymous
@Downgoat They have very short lifetimes in their reference frames, but because they move so fast, relativistic effects make them look long-lived to us
right, you can make a wrapper method. I just don't think that the wrapper method is needed on this site. That's my personal opinion
as far as the issue of gaining type information through static methods: I think its a fantastic abuse of the fact that we still don't require types on parameters. It's easily the meta I disagree with the most, and it's nice to see that people are abusing it like they should.
Link to your own answer
This is a codegolf challenge and the only thing your code has to do is provide a link, that when pasted in the adress bar of a browser redirects to your answer.
May the shortest code win!
