tikue_

4 ms·

1.
by tikue_ 8y ago
Backwards-compatibly changing existing features feels qualitatively the same to me as adding new features. In either case you can ignore them until you need to work on a codebase that uses them.
2.
by tikue_ 8y ago
At least in Rust, capture granularity is per-variable, so I think closures don't contain a stack frame pointer? Though, I'm not sure why this would matter to a user evaluating Rust's closures vs. D's nested fns?
3.
by tikue_ 9y ago
Saying library authors are content with their absence is probably a bit too strong. There's not really another option, and I doubt many folks would choose not to author libraries for this reason alone. I personally have found their abs
4.
by tikue_ 10y ago
Functional typically implies higher-order functions, of which there are none in that Python code.
5.
by tikue_ 11y ago
What's it like working with Rust full-time? Is it similar to using any other language for a job? Do you find yourself enjoying coding more? Do you get unnecessarily caught up in micro-optimizations for things you wouldn't blink at
6.
by tikue_ 11y ago
Every language has different idioms. In many cases, what works in C++ doesn't work in Rust. Generally, anything the book says is bad you should take as qualified to mean bad in the context of Rust programming, not programming at large.
7.
by tikue_ 11y ago
They have them in the Czech Republic, too. I've been on one in Prague.
8.
by tikue_ 12y ago
I wish `and_then` were named `flat_map` so badly.
9.
by tikue_ 12y ago
Also seems like you could benefit from the entry() api (available on both BTreeMap and HashMap): http://doc.rust-lang.org/std/collections/struct.BTreeMap.htm... I think the example used in the docs is your exact u