m1el

20 ms·

1. 151.▲
   by m1el 9y ago

   Oh, there's many problems with suggested approach. - Callback-oriented programming is its own deep can of worms. What do you want to inline where? In case of leftMap, it's easy for a compiler to inline flatMap, because it's
2. 152.▲
   by m1el 9y ago

   > 1. Are these colleges selecting students for some reason other than general intelligence, and if so, can we measure the IQ of men and women at these colleges and find a significant difference? I'm open to being wrong, but my predi
3. 153.▲
   by m1el 9y ago

   > I argue that you don't actually have any reason to believe that the differences are biological instead of social. I could provide studies on how IQ development is set by genetics and very early childhood. So yes, I do have a re
4. 154.▲
   by m1el 9y ago

   I understand that there are biases against women in our society, and I don't argue with that. I argue that there are biological differences between men and women, and these differences are causing different representation in STEM field
5. 155.▲
   by m1el 9y ago

   Let's assume for a moment, that engineering requires intelligence, and to be a top engineer you need to be in the top X% percentile of the population. As it turns out the distribution of IQ in men and women is different[0][1][2][3], wi
6. 156.▲
   by m1el 9y ago

   > For this project I landed on gtk-rs, but it's a nightmare of Rc's, RefCells, and borrow_mut just to get even the simplest UI working. > Without thinking too much about it, I feel like things could be better. If Rust was dr
7. 157.▲
   by m1el 10y ago

   > Existing physical speech synthesis models are pretty crude and sound quite robotic. Could you provide some links/publications please?
8. 158.▲
   by m1el 10y ago

   Question: why do people generate waveforms by neural networks? Would it be easier for a neural network to "control" an emulated throat/mouth and train against the sound output? Emitting and post-processing waveforms entirely
9. 159.▲
   by m1el 10y ago

   No mention of Dymaxion map? https://en.wikipedia.org/wiki/Dymaxion_map https://upload.wikimedia.org/wikipedia/commons/0/0b/Fuller_p... https://upload.wikimedia.org/w
10. 160.▲
    by m1el 10y ago

    > 1. There is no such thing as a FREE meal (OS) Windows is not free.
11. 161.▲
    by m1el 10y ago

    NASA's HELAPix, in C: http://healpix.jpl.nasa.gov/ https://sourceforge.net/projects/healpix/
12. 162.▲
    by m1el 10y ago

    I have mixed feelings about this. On one side, I'm very happy for blind people being enabled by software and hardware. On the other side, I'm concerned that people have to use proprietary software to enable their sight. I doubt t
13. 163.▲
    by m1el 10y ago

    You don't comprehend the magnitude of "just fixing the equations". As other commenters said, physics has a history of "adding unobservable objects", and then finding a way to observe them.
14. 164.▲
    by m1el 10y ago

    This struct doesn't compile: recursive type `BinaryTree` has infinite size
15. 165.▲
    by m1el 10y ago

    It's not quite a "pair". It's a "tagged union" in C-speak, "enum" in Rust-speak and "sum type" in CS-speak. In this case, numerical result and errno will be located in the same memory, but
16. 166.▲
    by m1el 10y ago

    It's horribly cumbersome AND it doesn't solve the same problem. // Rust let v: Result<i32, i32> = Ok(1); // std::variant (doesn't compile) std::variant<i32, i32> v = 1;
17. 167.▲
    by m1el 10y ago

    Thanks. Added links to paredit demos.
18. 168.▲
    by m1el 10y ago

    It depends on your requirements. ParEdit limits you to only perform AST transformations, which could be very good if you edit s-expressions or explicitly tree-like structures. If I was working on lisp-like languages, I would definitely use
19. 169.▲
    by m1el 10y ago

    Emacs has ParEdit minor mode which is a general-purpose tree editor. https://www.emacswiki.org/emacs/ParEdit edit: paredit demos: Productive Emacs: Paredit https://www.youtube.com/watch?v=T1WBsI3gdDE
20. 170.▲
    by m1el 10y ago

    In principle, nothing stops C++ compilers from implementing this feature. However, this - requires additional input from the programmer, such as lifetime parameters in Rust. - C and C++ don't have ADTs which help working with lifetimes
21. 171.▲
    by m1el 10y ago

    Let's translate this code to C++: class X { public: Y* getY(void) { return &y; } private: Y y; }; } `getY` returns a pointer to the struct field, this field is alloca
22. 172.▲
    by m1el 10y ago

    Well, this could be explained by my ignorance in *nix tools.
23. 173.▲
    by m1el 10y ago

    I had this exact idea almost a year ago: https://github.com/m1el/du-flamegraph find $1 -type f | xargs -n32 -d'\n' -- du -ab \ | awk -F'\t' '{print $2" "$1;}' | sed &#x
24. 174.▲
    by m1el 10y ago

    do I understand correctly that v3 stores sort-of closure in C?
25. 175.▲
    by m1el 10y ago

    - What kind of theorems were hard to prove using this system? - Is there a limit on the size of the conjecture/formula? - Would it be viable to use this method (or something similar) for faster formal software verification?
26. 176.▲
    by m1el 10y ago

    I've been waiting for this for a long time. Hopefully, this will allow automatically proving some of unproven theorems.
27. 177.▲
    by m1el 10y ago

    Yes, it is. If you replace Array literals with `React.createElement`, you will (almost) get compiled JSX templates.
28. 178.▲
    by m1el 10y ago

    I was playing with the idea of using JS objects as a template engine: http://m1el.github.io/jsonht.htm , and I'm pretty happy with it. I think DOM is pretty damn fast in modern browsers. `innerHTML` can be slower than c
29. 179.▲
    by m1el 10y ago

    Losing the Google reader was a big deal for me, and I managed to write a Chrome extension that re-used most of Google Reader's UI and hijacked browser's XHR to redirect requests to browser background page. https://chrom
30. 180.▲
    by m1el 11y ago

    Does this mean that it is now possible to create a circular data structure in git? :)