unfold

In my .vimrc I've put set foldmethod=syntax to enable folding of methods etc. However, I don't like the default that everytime I open a file, the whole thing is folded. Is there a way to enable foldmethod , yet have files unfolded when I open them? set foldlevel=99 should open all folds, regardless of method used for folding. With foldlevel=0 all folded, foldlevel=1 only somes, ... higher numbers will close fewer folds. You can put this in your .vimrc : au BufRead * normal zR It declares an automatic command ( au ), triggered when a buffer is read ( BufRead ), matching all files ( * ) and

I'm trying to solve this recurrence, but I don't know how to unfold it. T(n)=2T((n+2)/3) + 1 Can I ignore that "+2" and solve it as it was 2T(n/3) + 1? This comes from a from a problem that uses a V[a..b] array and makes this return: return V(X) + f(V, a, Y) + f(V, Z, b) Where Y is (2a+b)/3 and Z is (a+2b)/3 So: ((b-a+3)/3) = ((n+2)/3) Sort of. The rigorous version of this trick is to set U(n) = T(n+1) and write U(n) = T(n+1) = 2T((n+1+2)/3) + 1 = 2T(n/3 + 1) + 1 = 2U(n/3) + 1. Then solve for U (e.g., U(n) = O(n^log3(2)) ) and then you should be able to find an asymptotic expression for T of

Data.Tree includes unfoldTreeM_BF and unfoldForestM_BF functions to construct trees breadth-first using the results of monadic actions. The tree unfolder can be written easily using the forest unfolder, so I'll focus on the latter: unfoldForestM_BF :: Monad m => (b -> m (a, [b])) -> [b] -> m [Tree a] Starting with a list of seeds, it applies a function to each, generating actions that will produce the tree roots and the seeds for the next level of unfolding. The algorithm used is somewhat strict, so using unfoldForestM_BF with the Identity monad is not exactly the same as using the pure