callisto-debian/evolution
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Made this only up the insert_count if it actually had to do any non

Browse Source 
2001-03-23  Christopher James Lahey  <clahey@ximian.com>

	* e-tree-sorted.c (reposition_path): Made this only up the
	insert_count if it actually had to do any non constant work to
	reposition the path.

svn path=/trunk/; revision=8918
This commit is contained in:
Christopher James Lahey
2001-03-23 21:44:32 +00:00
committed by Chris Lahey
parent 320e990197
commit 2829dd55fd
1 changed files with 4 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
widgets/table/e-tree-sorted.c
View File

@ -302,7 +302,6 @@ reposition_path (ETreeSorted *ets, ETreeSortedPath *path)
ETreeSortedPath *parent = path->parent;
if (parent) {
if (ets->priv->sort_idle_id == 0) {
ets->priv->insert_count++;
if (ets->priv->insert_count > ETS_INSERT_MAX) {
/* schedule a sort, and append instead */
schedule_resort(ets, parent, TRUE, FALSE);
@ -322,20 +321,22 @@ reposition_path (ETreeSorted *ets, ETreeSortedPath *path)
if (new_index > old_index) {
int i;
e_tree_model_pre_change(E_TREE_MODEL(ets));
ets->priv->insert_count++;
memmove(parent->children + old_index, parent->children + old_index + 1, sizeof (ETreePath) * (new_index - old_index));
parent->children[new_index] = path;
for (i = old_index; i <= new_index; i++)
parent->children[i]->position = i;
e_tree_model_node_changed(E_TREE_MODEL(ets), parent);
e_tree_model_pre_change(E_TREE_MODEL(ets));
} else if (new_index < old_index) {
int i;
e_tree_model_pre_change(E_TREE_MODEL(ets));
ets->priv->insert_count++;
memmove(parent->children + new_index + 1, parent->children + new_index, sizeof (ETreePath) * (old_index - new_index));
parent->children[new_index] = path;
for (i = new_index; i <= old_index; i++)
parent->children[i]->position = i;
e_tree_model_node_changed(E_TREE_MODEL(ets), parent);
e_tree_model_pre_change(E_TREE_MODEL(ets));
}
}
} else