Live data from Hacker News

Viewing profile — leiroigh

leiroigh

HN member
Joined
Sat, Sep 08, 2018, 2:48 PM UTC
HN karma
185
Public activity
64 items

About leiroigh

No profile information was provided.

Recent public activity

  1. comment
    Comment #48596915

    I'll be interested in seeing the fallout of the (unavoidable) compat issue: If I have a function that has a value `x` that erases to `java.lang.Object` (e.g. a parametric function …

  2. comment
    Comment #45770192

    Yes. O(1) snapshots are awesome! Persistent datastructures are a monumental achievement. But that comes at a performance price, and in the end, you only really need persistent data…

  3. comment
    Comment #45770011

    There is nothing counter-intuitive or julia-specific about it: Fastest way is to have your datastructure in a (virtual) register, and that works better with immutable structures (i…

  4. comment
    Comment #45015635

    Pumping heat from 300K to 900K is not a big gain over heating -- the entire thing is premised on using extremely cheap intermittent electricity during the summer, and your savings …

  5. comment
    Comment #44271441

    "The Planck dive", freely available on Greg Egan's website https://www.gregegan.net/PLANCK/Complete/Planck.html

  6. comment
    Comment #44267329

    The bounce is invisible from the outside -- an event horizon means causal decoupling. From outside, the formation of the black hole looks like the good old "frozen star" picture. T…

  7. comment
    Comment #44267288

    I have not really looked at the summary, opted to go straight to the source. This identification happens in equations 31-34 on page 7f subsection "Cosmic Acceleration" in https://a…

  8. comment
    Comment #44255562

    >in a higher-dimensional parent universe That's incorrect: The parent universe is not higher-dimensional, it's the same good old 3+1 as our universe. What they propose is: Let's ta…

  9. comment
    Comment #43470445

    >so unfortunately I see a fellow enjoyer of bugs ;) >vmap afaict only exposes push-back and pop-front for mutation what about https://doc.rust-lang.org/nightly/std/io/trait.Write.h…

  10. comment
    Comment #43460287

    The main problem with that is that it doesn't play nice with most languages. Consider int foo(int* ptr) { int x = ptr[1 Compilers/languages/specs tend to decide that `ptr` and `ptr…

  11. comment
    Comment #41706956

    That's pretty cool. Normally it would be the either the programmer's or the compiler's job to unroll a loop and then reduce dependency chain lengths. But its nice if the renamer ca…

  12. comment
    Comment #39615702

    ^this! In garbage-collected languages, please give me gradual / optional annotations that permit deterministic fast freeing of temps, in code that opts in. Basically to relieve GC …

  13. comment
    Comment #38561121

    This is very very well known. Cf https://en.wikipedia.org/wiki/Affine_group I don't see how people should glorify this with the word "algorithm". It is a trivial undergrad homework…

  14. comment
    Comment #37934672

    This is awesome and the first precedent I've ever seen for a standard library doing the right thing on rand floats. Big kudos to the zig people and thanks for brightening my day!

  15. comment
    Comment #37931587

    Depends on control registers like e.g. MXCSR. It's an utter mess. Consider e.g. https://news.ycombinator.com/item?id=32738206

  16. comment
    Comment #37927615

    Fair enough, if a user asks for a random float between [0, 1e-38f] then subnormals are expected. I was just thinking about the (0,1) case, under the mistaken assumption that one co…

  17. comment
    Comment #37927522

    Comparability between implementations: Say GPU vs CPU, or between languages, or to pseudocode in old papers. Typical example where the badness of the floats bites you is if you do …

  18. comment
    Comment #37927339

    You think there might be applications like complex very large simulations where an event with probability 1:10^38 matters? You are aware that the current age of the universe is < 1…

  19. comment
    Comment #37927190

    I don't think that would be a good idea -- sticking to positive normals and truncating below is enough for float32 and float64. I mean, consider that 1.1754944f-38 is a normal 32 b…

  20. comment
    Comment #37927018

    That thread was in 0.6 days on my long-dead broadwell using DSFMT as a C library with afaiu hand-written intrinsic code for bulk generation of floats. We switched RNG to xoshiro in…

  21. comment
    Comment #37926493

    This problem is much more acute in Float32. Another sample implementation (maybe easier to read?) is in https://discourse.julialang.org/t/output-distribution-of-ran... As far as I …

  22. comment
    Comment #20735600

    Nobody complains about julia for "shelling out". The imo justified complaint is that julia sucks at "shelling in". (OK, the pipe buffering rules still annoy me) Similar with FFI: J…

  23. comment
    Comment #20735573

    Are startup times really your problem? Consider https://github.com/JuliaLang/julia/issues/30044 You can manually enable buffering of the pipe endpoints. Otherwise julia will be sup…

  24. comment
    Comment #20731742

    It's not. But people who like the language will invariably use beyond its core competency. Hence it is important to ensure that julia is "kinda mediocre" for CLI scripting (big ste…

  25. comment
    Comment #20731663

    Speed depends on workload. Fast startup, high throughput, high productivity: Choose two. C/C++/Fortran take fast startup and high throughput, python takes fast startup and high pro…