]> git.tdb.fi Git - ext/subsurface.git/commit
projects / ext / subsurface.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: d1ce430) | patch
Use a recursive (instead of iterative) minmax depth finder
authorLinus Torvalds <torvalds@linux-foundation.org>
Wed, 7 Sep 2011 20:51:35 +0000 (13:51 -0700)
committerLinus Torvalds <torvalds@linux-foundation.org>
Wed, 7 Sep 2011 20:51:35 +0000 (13:51 -0700)
commit96f5bea1ac89866aa58fe9fd39e625947bfa910a
tree662b8a1b9a49e2379719911cfa48cee26f53362dtree | snapshot
parentd1ce43087834a881885371e0c7ece9fe55e46e64commit | diff
Use a recursive (instead of iterative) minmax depth finder

This is a bit more natural, and makes it much easier to do scale
independence.  In particular, I want to make it possible to grow and
shrink the graph, and this should make it particularly simple to react
by giving more or fewer minmax points.

Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
profile.c diff | blob | history
Rough divelog in C and Gtk (from https://github.com/torvalds/subsurface)