vocalbit.com

rickystewart.wordpress.com

December | 2013 | foreign keys

https://rickystewart.wordpress.com/2013/12

Monthly Archives: December 2013. A preprocessor hack to implement “with” blocks in pure C. Alright, everyone, get out your pencils: it’s time for a quick test on the C language. Don’t worry if you didn’t study; the test will be rather painless, and you should be able to follow along even if you don’t really know C that well. Here it is:. Johnny is trying to design a function to be integrated into the codebase of an evil genius. The function must meet the following specifications:. If the test succeeds (if.

rickystewart.wordpress.com

September | 2013 | foreign keys

https://rickystewart.wordpress.com/2013/09

Monthly Archives: September 2013. Why sorting an array makes a Python loop faster. This morning I ran across a blog post that presented two Python scripts, one of which was much more efficient than the other. The blog post has since been deleted so I can’t link to it, but the scripts basically boil down to this:. Import time a = [i for i in range(1000000)] sum = 0 t1 = time.time() for i in a: sum = sum i t2 = time.time() print t2-t1. Is consistently a tenth of a second quicker than. The author of the ori...

rickystewart.wordpress.com

January | 2016 | foreign keys

https://rickystewart.wordpress.com/2016/01

Monthly Archives: January 2016. A simpler approach to functional programming. The issue is that. Type system will simultaneously be too weak to express some constraints and strong enough to keep you from getting your job done. There’s a fallacy in presuming that because Haskell (or more generally, any language) has some feature, it should be considered the baseline. No problem, we have liftM2. Need one that will work with 6? That’s one person’s words, with some specific examples. I agree ...Else, includi...

rickystewart.wordpress.com

Reverse inheritance | foreign keys

https://rickystewart.wordpress.com/2015/09/26/reverse-inheritance

This post is about reverse inheritance. As far as I know, no popular language supports reverse inheritance conveniently. (I’ve been wrong before — if it turns out I’m wrong, and some popular language does have this feature, please do point it out to me.). What do I say when I mean “reverse inheritance”? Of the functionality of B, but not necessarily all of it. Here’s an example in a made-up language:. In this example,. And so it satisfies the. Interface; i.e., it can do everything a. But no other method.

rickystewart.wordpress.com

A preprocessor hack to implement “with” blocks in pure C | foreign keys

https://rickystewart.wordpress.com/2013/12/17/a-preprocessor-hack-to-implement-with-blocks-in-pure-c

A preprocessor hack to implement “with” blocks in pure C. Alright, everyone, get out your pencils: it’s time for a quick test on the C language. Don’t worry if you didn’t study; the test will be rather painless, and you should be able to follow along even if you don’t really know C that well. Here it is:. Johnny is trying to design a function to be integrated into the codebase of an evil genius. The function must meet the following specifications:. The function takes two parameters, an unsigned integer.

rickystewart.wordpress.com

February | 2015 | foreign keys

https://rickystewart.wordpress.com/2015/02

Monthly Archives: February 2015. There has to be another way: my entry in the FP vs. OO debate. The other day I read an article. This is my response to that article. What I disagree with is the conclusion this observation led the author to. Quoth the article:. On the other hand, forbidding mutable state and other such side effects without changing anything else is. You need a whole new bag of tricks. Persistent data structures. Standard higher order functions. So you have an alternative to most of your.

rickystewart.wordpress.com

A simpler approach to functional programming | foreign keys

https://rickystewart.wordpress.com/2016/01/02/a-simpler-approach-to-functional-programming

A simpler approach to functional programming. The issue is that. Type system will simultaneously be too weak to express some constraints and strong enough to keep you from getting your job done. There’s a fallacy in presuming that because Haskell (or more generally, any language) has some feature, it should be considered the baseline. Haskell is littered with good examples of its own limitations (as is any language). Need a version of liftM which will work with two parameters? That’s one person&#82...

rickystewart.wordpress.com

There has to be another way: my entry in the FP vs. OO debate | foreign keys

https://rickystewart.wordpress.com/2015/02/11/there-has-to-be-another-way-my-entry-in-the-fp-vs-oo-debate

There has to be another way: my entry in the FP vs. OO debate. The other day I read an article. This is my response to that article. What I disagree with is the conclusion this observation led the author to. Quoth the article:. On the other hand, forbidding mutable state and other such side effects without changing anything else is. You need a whole new bag of tricks. Persistent data structures. So you don’t have to copy the state of your entire application for every little update. The m-word was spoken.

rickystewart.wordpress.com

Why sorting an array makes a Python loop faster | foreign keys

https://rickystewart.wordpress.com/2013/09/03/why-sorting-an-array-makes-a-python-loop-faster/comment-page-1

Why sorting an array makes a Python loop faster. This morning I ran across a blog post that presented two Python scripts, one of which was much more efficient than the other. The blog post has since been deleted so I can’t link to it, but the scripts basically boil down to this:. Import time a = [i for i in range(1000000)] sum = 0 t1 = time.time() for i in a: sum = sum i t2 = time.time() print t2-t1. Is consistently a tenth of a second quicker than. This is a nontrivial speedup given that. The author of ...