IsTom

27 ms·

571.
by IsTom 11y ago
All I see is a blank page with ads.
572.
by IsTom 11y ago
At company I work at we've got an application or two that have Erlang backend and a RoR frontend. It works pretty well IMO.
573.
by IsTom 11y ago
It's not really particles. http://profmattstrassler.com/articles-and-posts/particle-phy...
574.
by IsTom 11y ago
Meh. I thought this would be something cool like 110 rules. https://en.wikipedia.org/wiki/Rule_110
575.
by IsTom 11y ago
I think the argument mostly still stands. These are still a matter of "taxonomy".
576.
by IsTom 11y ago
I've made a litte patch for Wesnoth long time ago. While the codebase wasn't small it didn't really matter that much. There are a lot of things in the game (animation, networking, ui, game logic) that are separated enough tha
577.
by IsTom 11y ago
It makes array use really awkward in my experience.
578.
by IsTom 11y ago
Non-lexical lifetimes/borrows. This is a dealbreaker IMO.
579.
by IsTom 11y ago
I don't quite understand how it's not a setjmp/longjmp usecase. Isn't this exactly what longjmp is for?
580.
by IsTom 11y ago
The thing is that motivation is not something people compare to some known value, but rather between people. If you hear that people were unmotivated from an enthusiastic/workaholic person it doesn't mean that they really were unm
581.
by IsTom 11y ago
Will make you use your real name? If so I don't see this going very far.
582.
by IsTom 11y ago
> This game is kind of a throwback to the kinds of games I used to make I think this is a very important part. Personally I enjoyed pre-spacechem games a lot (e.g. http://www.zachtronics.com/the-codex-of-alchemical-engine
583.
by IsTom 11y ago
But this isn't readable at all. If you compare it JSON.parse(x) or fromJSON x it's just awful.
584.
by IsTom 11y ago
> Anyway, 1,000,000 Swift developers will change everything. All of these objective-C developers changed nothing for non-ios crowd. Why would swift be different?
585.
by IsTom 11y ago
There are ways to mark memory pages as read-only. It's not even difficult.
586.
by IsTom 11y ago
Honestly in my experience it's a deal-breaking bug. It's so awfully crippled compared to DDC regions.
587.
by IsTom 11y ago
There's nothing wrong with milk tea.
588.
by IsTom 12y ago
> Since I'm not a Haskell guy, this means that I'm easily tipped off the cliff into cabal hell Even Haskell people find themselves easily in the cabal hell. Everyone is aware of the issue, but it's still not solved.
589.
by IsTom 12y ago
You can always pick median element in O(n) time and it makes quicksort's worst case be O(nlogn)
590.
by IsTom 12y ago
There is an in-situ quicksort that has the same asymptotic time bounds as the usual kind. It (kind of) encodes stack by shuffling some elements in unsorted data.
591.
by IsTom 12y ago
There's a problem with with many-worlds that I haven't seen convincingly refuted: when collapsing superposition of two states you might need to (or rather almost always) need the ratio of worlds with outcome A to worlds with outco
592.
by IsTom 12y ago
I tried rust, I tried honestly, but it's just enraging when you can't just write: let x = ys.filter(|y| self.p(y)); self.z = x;
593.
by IsTom 12y ago
The author writes about balancing difficulty of DF. I've seen many people saying that DF is too easy once you figure it out. It's true that it isn't a difficult game, but I think it's missing the point. The point of DF i
594.
by IsTom 12y ago
Is there return type polymorphism in Swift? Without it monad-generic operations are limited.
595.
by IsTom 12y ago
And one also finds that there are people defending the solution of going back in time.
596.
by IsTom 12y ago
Looking deeper you're right, it seems to use atomic CAS operations. Still mutable data is bad for GC and optimization pass (can't share expressions etc.)
597.
by IsTom 12y ago
I would assume that no, but AFAIK GHC has separate (badly optimized) path for garbage collection on mutable data.
598.
by IsTom 12y ago
> Functional code in Haskell/OCaml can be faster than imperative code using iorefs. IORefs involve locking. They are bad performance-wise. An algorithm like this should be done either fully functionaly without any mutation at all or
599.
by IsTom 12y ago
It only concerns automatic objects though, right?
600.
by IsTom 12y ago
It's true if a reasonable part of data can fit into cache. What if you've got a 2 billion subset of 64-bit integers?

More ›