FreeFull

70 ms·

1. 721.▲
   by FreeFull 13y ago

   You don't have to refresh the page, you can just click again to get a different face.
2. 722.▲
   by FreeFull 13y ago

   I think there has been a study where it was found that the senses aren't actually enhanced, but they just pay more attention to them.
3. 723.▲
   by FreeFull 13y ago

   Infinite levels of undo does sound like something that would cause a big memory leak for a long-running simulation. It could be accomplished in an imperative language if it was written in a functional style (assuming the language is suffici
4. 724.▲
   by FreeFull 13y ago

   I have thought about it, and my reply didn't really address what you have said. Single-letter names obviously don't improve the code's performance. The reason they tend to be used is that the values associated with each bindi
5. 725.▲
   by FreeFull 13y ago

   Bytestring is a widely used library with very special performance requirements, and not a typical example of good Haskell code.
6. 726.▲
   by FreeFull 13y ago

   I still regularly make searches in duckduckgo (which gets results from Bing) and then find that I have to switch Google to actually find what I'm looking for. The worst thing about this is that Google's results don't seem to
7. 727.▲
   by FreeFull 13y ago

   I don't think triclosan would work well against a virus either.
8. 728.▲
   by FreeFull 13y ago

   You could probably approximate the sound by taking an ultrasound recording from a room that exists like this right now and slowing it down.
9. 729.▲
   by FreeFull 13y ago

   I once broke into my own home when I forgot my keys using a broomstick and the letter hole in the door. I shoved the broomstick through, and pressed on the knob in such a way that it spun and opened the door.
10. 730.▲
    by FreeFull 13y ago

    The Haskell equivalent of cons would probably be the 2-tuple constructor, (,), which has the type a -> b -> (a,b). You probably wouldn't use it to make data structures like you would in Lisp though.
11. 731.▲
    by FreeFull 13y ago

    Taking multiple arguments has nothing to do with Monads. You can either take in a tuple of arguments f (x,y,z) = x*y + z or take them in curried form f x y z = x*y + z where f 3 is a single argument function that retur
12. 732.▲
    by FreeFull 13y ago

    Rust: Nothing else offers guarantees of memory safety without garbage collection.
13. 733.▲
    by FreeFull 13y ago

    Firefox actually lets you select a URL and right click to see the normal link options. I assume the addon makes even malformed URLs work though.
14. 734.▲
    by FreeFull 13y ago

    This isn't something that happens to all users. Ever since Firefox 4, I've been able to open literally hundreds (400 to 600) tabs without suffering much of a hit at all. This is on Linux, and with several addons.
15. 735.▲
    by FreeFull 13y ago

    It probably doesn't help that the immune system is what it infects.
16. 736.▲
    by FreeFull 13y ago

    Is the anywhere that lists the new features in Mesa 10?
17. 737.▲
    by FreeFull 13y ago

    The reversal of the decomposed noël doesn't produce the right result. Converting baffle to uppercase does do the right thing though, and the rest works as expected.
18. 738.▲
    by FreeFull 13y ago

    The propellants are butane, isobutane and propane. The same sort of gases you'd use as fuel for a portable gas stove.
19. 739.▲
    by FreeFull 13y ago

    In Firefox 25 on Linux, Array Join Nocopy seems to perform the fastest.
20. 740.▲
    by FreeFull 13y ago

    Google gives me "late Middle English: from Old French ethimologie, via Latin from Greek etumologia, from etumologos ‘student of etymology,’ from etumon, neuter singular of etumos ‘true.’". It doesn't give the fancy tree diagr
21. 741.▲
    by FreeFull 13y ago

    There is also the option of alternative substrates, such as graphene, carbon nanotubes or doped diamond. Diamond could operate at higher temperatures and frequencies (giving us better single-threaded performance again). Graphene would be mo
22. 742.▲
    by FreeFull 13y ago

    Are there other blurs that are cheaper than the Gaussian but look good enough to replace it for this sort of purpose?
23. 743.▲
    by FreeFull 13y ago

    What if you use a vector whole length is indexed by a Natural in the type signature? It would still allow permutations and such (like reverse), but not tail. Using a dependent type system, it would actually be possible to statically ensure
24. 744.▲
    by FreeFull 13y ago

    Note that where binary operations on screen coordinates tend to produce Sierpiński's triangle, ternary operations will produce Sierpiński's carpet (I don't know what happens as you increase bases beyond that, the number of po
25. 745.▲
    by FreeFull 13y ago

    Now I'm wondering if someone will provide a 4 cube division of this.
26. 746.▲
    by FreeFull 13y ago

    Could just take all the numbers as command-line arguments or something similar.
27. 747.▲
    by FreeFull 13y ago

    There isn't much to Monads at all. One problem that some Haskell beginners hit is that they read some bunk monad explanations and only get confused, and that monads get so hyped up that when met with the actual description, they try to
28. 748.▲
    by FreeFull 13y ago

    Thanks for fixing the compile
29. 749.▲
    by FreeFull 13y ago

    That seems to be the case, since running file on one of the existing .o files says that they are Mach-O i386 objects. The readme doesn't mention OS X though, only Ubuntu
30. 750.▲
    by FreeFull 13y ago

    After renaming the Makefiles to fix the case, running make clean and then make all, I get the same error.