Skip to main content

Duck typing considered harmful.

I've had a chance to work on a fairly large chunk of Python at this point and have decided that Python (like Perl) is completely untenable at scale.  <rant><rave><drool>  but wait!  I have reasons!

Programmers spend most of their time reading code.  We read massive amounts of code.  After we read massive amounts of code we write one... or change one... To make a change to a piece of code you first have to understand what it does and how it interacts with the system around it.  Then we start reading massive amounts of code again.  Anything you can do to minimize the amount of code a programmer has to understand to make a change becomes a huge gain in productivity.

Duck typing causes the amount of code you need to read to make a change to grow very large.
For example lets look at two functions, one in C++ and one in Python.

First in C++
int function(type1 arg1, type2 arg2) {
  return arg1->method(arg2);
}


In this function we know that it takes two types, type1 and type2.  We also know that type1 has a function called 'method' which takes an argument of type2.  If we need to understand this function we go to type1 and read the code.  If 'method' is virtual then we also read any class which inherits from type1.  Now lets look at an equivalent Python function.


Now in Python
def function(arg1, arg2):
  return arg1.method(arg2)


In this case the function takes any class which has a function called 'method'.  To understand this function you have to read the entire codebase to find classes which have a 'method' function or find every invocation of this function and determine the types used there (non trivial).  Even worse a class might not have 'method' but could gain it later.  To understand this function you really have to read everything.


This isn't a problem when dealing with hundreds of lines of code but when dealing with tens of thousands it becomes extremely time consuming.

Comments

  1. Completely agree with you. We have a large codebase dating back to 2013 and it's getting to be nearly impossible to know where things will be coming from when we call them.

    ReplyDelete

Post a Comment

Popular posts from this blog

Sieve of Eratosthenes

Another way to generate a list of primes is through the Sieve of Eratosthenes . Essentially you create a long list of numbers starting at 2. 1. Set p equal to 2.  This is your first prime. 2. Cross out every pth number because they are all divisible by p. 3. The first number after p which hasn't been crossed out is the new prime. 4. Repeat from setup 2. As an example lets take the number line from 2 to 10. list = 2, 3, 4, 5, 6, 7, 8, 9, 10 1. p = 2 2. list = 2 , 3, 4 , 5, 6 , 7, 8 , 9, 10 3. p = 3 4. goto 2 2. list = 2 , 3 , 4 , 5, 6 , 7, 8 , 9 , 10 3. p = 5 4. goto 2 2. list = 2 , 3 , 4 , 5, 6 , 7, 8 , 9 , 10 3. p = 7

How big are primes?

So, If we were to calculate the first billion primes how much ram would we need? At the end the primes won't fit in a 32bit integer.  If we store them all in 64bit integers we'd need 8GB. Even if they all fit in 32bit integers we'd still need 4GB of storage just to store the list. Seeing at my little machine has 4GB ram that isn't going to work either. How about just storing the intervals between primes? For the first primes (2, 3, 5, 7, 11, 13, 17) we would store (2, 1, 2, 2, 4, 2, 4) Using a byte for every interval less than 128 and a short for the rest lets us store the first billion primes in just about 1GB.  Now that we can do! Maybe we can do even better though...