diff options
| author | Christopher James Lahey <clahey@ximian.com> | 2001-04-04 17:06:01 +0800 |
|---|---|---|
| committer | Chris Lahey <clahey@src.gnome.org> | 2001-04-04 17:06:01 +0800 |
| commit | 115406e1e21fc378219700bac803102b317c6c4b (patch) | |
| tree | 1a11c2fe31c3aa57053d10a2d1b65179e69467c5 | |
| parent | 91f381352f9bff029bf8f2cf3ebe35272262e75f (diff) | |
| download | gsoc2013-evolution-115406e1e21fc378219700bac803102b317c6c4b.tar gsoc2013-evolution-115406e1e21fc378219700bac803102b317c6c4b.tar.gz gsoc2013-evolution-115406e1e21fc378219700bac803102b317c6c4b.tar.bz2 gsoc2013-evolution-115406e1e21fc378219700bac803102b317c6c4b.tar.lz gsoc2013-evolution-115406e1e21fc378219700bac803102b317c6c4b.tar.xz gsoc2013-evolution-115406e1e21fc378219700bac803102b317c6c4b.tar.zst gsoc2013-evolution-115406e1e21fc378219700bac803102b317c6c4b.zip | |
Make it so you can switch checking around the last access on and off for
2001-04-04 Christopher James Lahey <clahey@ximian.com>
* e-tree-sorted.c: Make it so you can switch checking around the
last access on and off for tuning purposes.
* e-tree-table-adapter.c: Apparently, ETreeTableAdapter is much
faster if the value_at function doesn't change the last_access
variable.
svn path=/trunk/; revision=9170
| -rw-r--r-- | widgets/table/e-tree-sorted.c | 6 | ||||
| -rw-r--r-- | widgets/table/e-tree-table-adapter.c | 2 |
2 files changed, 8 insertions, 0 deletions
diff --git a/widgets/table/e-tree-sorted.c b/widgets/table/e-tree-sorted.c index 3d70e019e4..ddea067b91 100644 --- a/widgets/table/e-tree-sorted.c +++ b/widgets/table/e-tree-sorted.c @@ -124,13 +124,17 @@ ets_insert_idle(ETreeSorted *ets) /* Helper functions */ +#define CHECK_AROUND_LAST_ACCESS + static inline ETreeSortedPath * check_last_access (ETreeSorted *ets, ETreePath corresponding) { +#ifdef CHECK_AROUND_LAST_ACCESS ETreeSortedPath *parent; int end; int start; int i; +#endif if (ets->priv->last_access == NULL) return NULL; @@ -140,6 +144,7 @@ check_last_access (ETreeSorted *ets, ETreePath corresponding) return ets->priv->last_access; } +#ifdef CHECK_AROUND_LAST_ACCESS parent = ets->priv->last_access->parent; if (parent && parent->children) { i = ets->priv->last_access->position; @@ -160,6 +165,7 @@ check_last_access (ETreeSorted *ets, ETreePath corresponding) } } } +#endif return NULL; } diff --git a/widgets/table/e-tree-table-adapter.c b/widgets/table/e-tree-table-adapter.c index 71c73d7724..82bb4186f9 100644 --- a/widgets/table/e-tree-table-adapter.c +++ b/widgets/table/e-tree-table-adapter.c @@ -437,8 +437,10 @@ etta_value_at (ETableModel *etm, int col, int row) { ETreeTableAdapter *etta = (ETreeTableAdapter *)etm; +#if 0 etta->priv->last_access = row; d(g_print("g) Setting last_access to %d\n", row)); +#endif switch (col) { case -1: |