bjoli

183 ms·

2191.
by bjoli 9y ago
Development in a language like that, you quickly start using editor macros. Even simple things like Emacs abbrev mode is enough to remove the vast majority of shift usage.
2192.
by bjoli 9y ago
Which amino acid is lacking from a vegan diet? The only thing I know is is that eating legumes is good to balance the low lysine value of most grains.
2193.
by bjoli 9y ago
Like... Singly linked lists? I even remember using VLists (work by Philip Bagwell, that probably inspired the data structures in clojure) in 2006, and I am not even a programmer.
2194.
by bjoli 9y ago
Well, typed racket is not racket with types,but a language that you will use differently than regular racket. I have stopped using for-loops for complex things, since they expand to something that makes life hard for the type checker. With
2195.
by bjoli 9y ago
Apart from confounded's response, we are getting constantly better at factoring nunbers. Due to that the security margin of RSA has been dropping a lot faster than computer power has increased. In fact, we don't even know whether
2196.
by bjoli 9y ago
It is an Ivy Bridge or Haswell mobile i7. It was pretty high en for a laptop in late 2013/early 2014.
2197.
by bjoli 9y ago
Whoa! Code golf. Here is the most compact I could make it in racket in about 3 minutes: (define (erathostenes n) (let ([vec (make-vector n #t)]) (for/list ([i (in-range i n)] #:when (vector-ref vec i)) (fo
2198.
by bjoli 9y ago
I implemented that in chez scheme recently, and it is pretty darn fast. https://bitbucket.org/bjoli/primes/src (the file lazy-prime-sieve.scm) it uses Nietzsche which can be found in my repos. On my three year old
2199.
by bjoli 9y ago
One thing that makes racket shine is it's macro facilities. Syntax case is nice and all that, but Jesus Christ in a chicken basket I wish scheme would have standardised on syntax-parse. Syntax case vs. syntax parse isn't and will
2200.
by bjoli 9y ago
> That said, I do think it's neat that the fastest brute-force variant is a rough factor-2 from your naïve memoized version. My naive memoized version in a GCd language that is consistently 4-5x slower than my own (pretty bad) C ver
2201.
by bjoli 9y ago
I know is it is not the point of the question, but that problem would benefit greatly from memoization. Calculate it recursively and memoize the result of every step. With all the neat trickery that they are doing with assembly they could e
2202.
by bjoli 9y ago
And considering the author of iris has apparently "cheated" on benchmarks before, I would be extra careful reading these benchmarks,since kataras is the author.... http://www.florinpatan.ro/2016/10/why-yo
2203.
by bjoli 9y ago
Scheme. The whole "build a language from a small set of well-chosen primitives" really resonated with me. I tried a bunch of other lisps but disliked them for various reasons. Clojure is nice because of the tooling, but I disliked