summaryrefslogtreecommitdiffstats
path: root/file.h
diff options
context:
space:
mode:
authorGravatar Dirk Hohndel <dirk@hohndel.org>2012-09-28 15:16:31 -0700
committerGravatar Dirk Hohndel <dirk@hohndel.org>2012-09-28 16:23:59 -0700
commit7f5ecb5bb7791a9c07380f66693f78aa9acb4f28 (patch)
treec9fccb0d95357b757683abf07727f8f699a0a438 /file.h
parentbd3df859bcc08965bde4f38ca094e1191ad83bbd (diff)
downloadsubsurface-7f5ecb5bb7791a9c07380f66693f78aa9acb4f28.tar.gz
Redo the delete dive code
The existing code (both my first single dive delete and then Lubomir's multi dive delete code) had way too many issues and was just painfully inefficient. This new code takes a radically different approach and mostly ignores the Gtk tree model (as that gets recreated after a delete, anyway) and instead is linear time on the number of dives in the list. It does do its best to maintain the existing selection and the expand state of tree model (the latter isn't possible if we have switched to the list model). Many thanks to "Lubomir I. Ivanov" <neolit123@gmail.com> for his work on this - this commit actually contains a few lines out of one of the patches that he wrote. Reported-by: "Lubomir I. Ivanov" <neolit123@gmail.com> Tested-by: "Lubomir I. Ivanov" <neolit123@gmail.com> Signed-off-by: Dirk Hohndel <dirk@hohndel.org>
Diffstat (limited to 'file.h')
0 files changed, 0 insertions, 0 deletions