chadaustin

12 ms·

61.
by chadaustin 9y ago
Milo Yip (author of RapidJSON) has done fantastic work on validating the correctness of and benchmarking JSON parsers. The results listed there predate the current round of sajson optimizations and sajson's dynamic allocation mode, so
62.
by chadaustin 9y ago
Oh, didn't know that! Thanks.
63.
by chadaustin 9y ago
Hi all, author here. Several people have raised questions about SIMD. For many workloads, SIMD is obviously a huge win. But in my experience, for problems like this, the gains are marginal and the additional complexity often isn't wo
64.
by chadaustin 9y ago
PCMPISTRI and friends are great, but they're not very friendly to the problem described in the article, since they can only check membership in a 16-element set.
65.
by chadaustin 9y ago
My first exposure to American Fuzzy Lop! What an amazingly easy tool to get running.
66.
by chadaustin 10y ago
Fix is in the App Store! Update should come soon.
67.
by chadaustin 10y ago
Yikes! I'll see if I can reproduce. Thanks for the bug report!
68.
Show HN: Is It Snappy? – Measure latency with your iPhone's 240 Hz camera(isitsnappy.com)
293 points by chadaustin 10y ago|84 comments
69.
by chadaustin 10y ago
Funny, I was just thinking about this and Steve Blank. Early at IMVU we really struggled with our crash rate. It was a 3D desktop application for _mainstream computers_. This was back before Windows 7 and everyone had terrible onboard gra
70.
by chadaustin 10y ago
Those rules are encoded pretty well in this library: https://blogs.dropbox.com/tech/2012/04/zxcvbn-realistic-pass... Online demo at https://www.bennish.net/password-strength-checker/
71.
by chadaustin 10y ago
Field Runners Cooking Mama iOS Wolfenstein RPG Those were just a few I tried.
72.
by chadaustin 10y ago
Hi, I recently used a hash function like this as part of a React-style delta calculation engine but for Swift / iOS. I needed a hash function that was fast but collision-resistant, and I did not need a cryptographic hash, as all data i
73.
by chadaustin 10y ago
But he's comparing to reference counting, where you pay a substantial throughput penalty round-tripping to RAM (especially if atomic) and don't get the benefit of a bump allocator.
74.
by chadaustin 10y ago
You probably mean minimal latency, not maximum throughput. GC generally has higher throughput at the cost of latency and higher peak memory usage. :)
75.
by chadaustin 10y ago
Value types only avoid refcounts if they contain only primitive fields, which is not all that often in interesting code. For example, count the number of atomic refcounts on each iteration of the following loop: // given str
76.
by chadaustin 10y ago
Swift does not have many free abstractions - what specifically are you referring to? (Also Swift's pervasive atomic refcounting means that typical idiomatic code often has pretty atrocious performance.)
77.
by chadaustin 10y ago
First, let me say that I think Evan has done amazing work with Elm, and Elm is a very interesting language on several fronts. It is a positive contribution to the world, especially the idea that error messages can be great and compilers an
78.
by chadaustin 10y ago
In my experience at IMVU, surprisingly not very difficult. It's easier to learn Haskell in a team environment than on your own because your peers can help you connect the dots and accomplish your task at hand. It did seem like less ex
79.
Reasoning About Performance(bitfunnel.org)
2 points by chadaustin 10y ago|0 comments
80.
by chadaustin 10y ago
Kinda. Paul Khuong goes into depth here. https://www.pvk.ca/Blog/2012/07/03/binary-search-star-elimin...
81.
by chadaustin 10y ago
In my experience, it is tricky for people to learn Haskell meaningfully outside of a team of people to explain the concepts. I'd say write a few real programs in Haskell. Beyond that, if you find the right company, they will hire base
82.
by chadaustin 10y ago
The term 'functional language' is not terribly useful these days. You can program in a functional style in many languages, just as you can program in an imperative style in Haskell or Scheme. Last year, I wrote an article [1] tal
83.
by chadaustin 10y ago
Sure, they're library functions, but they're also specified in the haskell 2010 spec. That makes them built-in from a practical perspective.
84.
Evaluating Employees in Product Design and Development Roles(mikeindustries.com)
2 points by chadaustin 10y ago|0 comments
85.
by chadaustin 10y ago
People spend time on this because Haskell syntax is deeply unpleasant to a lot of people, including myself. I love the capabilities and expressiveness of Haskell, but I find the syntax annoying, and it hasn't gotten better even coming
86.
Where have all the iOS games gone?(minotaurproject.co.uk)
313 points by chadaustin 10y ago|207 comments
87.
by chadaustin 10y ago
I find both mental models useful. For example, "accumulate all of the monoids in this collection" ( https://hackage.haskell.org/package/base-4.9.0.0/docs/Data-F... ) makes total sense as a functional
88.
by chadaustin 10y ago
Personally, I think you'll have more success with something more gradual than a complete syntactic overhaul. I've never used pure4j or frege but it sounds like pure4j is something you could try out incrementally, which could be q
89.
by chadaustin 10y ago
Super cool! Glad I could help! Isn't it hilarious how almost everything you could do in Sphere is actually quite easy directly in browsers these days?
90.
by chadaustin 10y ago
Oh man, that's a great idea. If I get some time I'll try to write that up too.

More ›