Nicholas C. Zakas writes in his blog: Internet Explorer 7: 1,789 Firefox 3: 3,000 Chrome 1: 21,837 Opera 9.62: 10,000 Safari 3.2: 500 There’s some more data on different browsers and OSs here. I’ve created a Browserscope test to get more data. Please run it here. Update: The results above are now obsolete, but the … Read more
Zygomorphism is the high-falutin’ mathsy name we give to folds built from two semi-mutually recursive functions. I’ll give an example. Imagine a function pm :: [Int] -> Int (for plus-minus) which intersperses + and – alternately through a list of numbers, such that pm [v,w,x,y,z] = v – (w + (x – (y + z))). … Read more
You have two problems with your code: because of condition if (property.PropertyType.Assembly == objType.Assembly) you will omit System.Collections like List<> you do not treat differently propValue that are collections. Hence it will print List properties, not its elements properties. You can change that for example into: public void PrintProperties(object obj, int indent) { if (obj … Read more
When you use a function recursively, the compiler takes care of stack management for you, which is what makes recursion possible. Anything you can do recursively, you can do by managing a stack yourself (for indirect recursion, you just have to make sure your different functions share that stack). So, no, there is nothing that … Read more
With TS 2.8 and conditional types we can simply write: type DeepPartial<T> = { [P in keyof T]?: T[P] extends Array<infer U> ? Array<DeepPartial<U>> : T[P] extends ReadonlyArray<infer U> ? ReadonlyArray<DeepPartial<U>> : DeepPartial<T[P]> }; or with [] instead of Array<> that would be: type DeepPartial<T> = { [P in keyof T]?: T[P] extends (infer U)[] … Read more
First, to your original question, just be aware that if you’re working with very long strings, you don’t want to be making exact copies minus a single letter each time you make a function call. So you should favor using indexes or verify that your language of choice isn’t making copies behind the scenes. Second, … Read more
You should add a counter argument to your function definition: function singleDigit(num, counter = 0) { console.log(`called ${counter} times`) //… return singleDigit(number, counter+1) } singleDigit(39)
You can give the function a name, even when you’re creating the function as a value and not a “function declaration” statement. In other words: (function foo() { foo(); })(); is a stack-blowing recursive function. Now, that said, you probably don’t may not want to do this in general because there are some weird problems … Read more
It is a guard against a stack overflow, yes. Python (or rather, the CPython implementation) doesn’t optimize tail recursion, and unbridled recursion causes stack overflows. You can check the recursion limit with sys.getrecursionlimit: import sys print(sys.getrecursionlimit()) and change the recursion limit with sys.setrecursionlimit: sys.setrecursionlimit(1500) but doing so is dangerous — the standard limit is a … Read more
You can often entirely preserve the original structure of a recursive algorithm, but avoid the stack, by employing tail calls and changing to continuation-passing, as suggested by this blog entry. (I should really cook up a better standalone example.)