+bool wxDataViewSortedListModel::ChildRowAppended()
+{
+ // no need to fix up array
+
+ size_t len = m_array.GetCount();
+
+ size_t pos = m_array.Add( len );
+
+ if (pos == 0)
+ return wxDataViewListModel::RowPrepended();
+
+ if (pos == len)
+ return wxDataViewListModel::RowAppended();
+
+ return wxDataViewListModel::RowInserted( pos );
+}
+
+bool wxDataViewSortedListModel::ChildRowPrepended()
+{
+ // fix up array
+ size_t i;
+ size_t len = m_array.GetCount();
+ for (i = 0; i < len; i++)
+ {
+ size_t value = m_array[i];
+ m_array[i] = value+1;
+ }
+
+ size_t pos = m_array.Add( 0 );
+
+ if (pos == 0)
+ return wxDataViewListModel::RowPrepended();
+
+ if (pos == len)
+ return wxDataViewListModel::RowAppended();
+
+ return wxDataViewListModel::RowInserted( pos );
+}
+
+bool wxDataViewSortedListModel::ChildRowInserted( size_t before )
+{
+ // fix up array
+ size_t i;
+ size_t len = m_array.GetCount();
+ for (i = 0; i < len; i++)
+ {
+ size_t value = m_array[i];
+ if (value >= before)
+ m_array[i] = value+1;
+ }
+
+ size_t pos = m_array.Add( before );
+
+ if (pos == 0)
+ return wxDataViewListModel::RowPrepended();
+
+ if (pos == len)
+ return wxDataViewListModel::RowAppended();
+
+ return wxDataViewListModel::RowInserted( pos );
+}
+
+bool wxDataViewSortedListModel::ChildRowDeleted( size_t row )
+{
+ size_t i;
+ size_t len = m_array.GetCount();
+ int pos = -1;
+ for (i = 0; i < len; i++)
+ {
+ size_t value = m_array[i];
+ if (value == row)
+ {
+ // delete later
+ pos = (int) i;
+ }
+ else
+ {
+ // Fix up array
+ if (value > row)
+ m_array[i] = value-1;
+ }
+ }
+
+ if (pos == -1)
+ return false; // we should probably assert
+
+ // remove
+ m_array.RemoveAt( (size_t) pos );
+
+ return wxDataViewListModel::RowDeleted( (size_t) pos);
+}
+
+bool wxDataViewSortedListModel::ChildRowChanged( size_t row )
+{
+ size_t i;
+ size_t len = m_array.GetCount();
+
+ // Remove and readd sorted. Find out at which
+ // position it was and where it ended.
+ size_t start_pos = 0,end_pos = 0;
+ for (i = 0; i < len; i++)
+ if (m_array[i] == row)
+ {
+ start_pos = i;
+ break;
+ }
+ m_array.RemoveAt( start_pos );
+ m_array.Add( row );
+
+ for (i = 0; i < len; i++)
+ if (m_array[i] == row)
+ {
+ end_pos = i;
+ break;
+ }
+
+ if (end_pos == start_pos)
+ return wxDataViewListModel::RowChanged( start_pos );
+
+ // Create an array where order[old] -> new_pos, so that
+ // if nothing changed order[0] -> 0 etc.
+ size_t *order = new size_t[ len ];
+ // Fill up initial values.
+ for (i = 0; i < len; i++)
+ order[i] = i;
+
+ if (start_pos < end_pos)
+ {
+ for (i = start_pos; i < end_pos; i++)
+ order[i] = order[i+1];
+ order[end_pos] = start_pos;
+ }
+ else
+ {
+ for (i = end_pos; i > start_pos; i--)
+ order[i] = order[i-1];
+ order[start_pos] = end_pos;
+ }
+
+ wxDataViewListModel::RowsReordered( order );
+
+ delete [] order;
+
+ return true;
+}
+