2006-05-17 06:18:46 +05:30
|
|
|
#
|
|
|
|
# Gramps - a GTK+/GNOME based genealogy program
|
|
|
|
#
|
|
|
|
# Copyright (C) 2000-2006 Donald N. Allingham
|
|
|
|
#
|
|
|
|
# This program is free software; you can redistribute it and/or modify
|
|
|
|
# it under the terms of the GNU General Public License as published by
|
|
|
|
# the Free Software Foundation; either version 2 of the License, or
|
|
|
|
# (at your option) any later version.
|
|
|
|
#
|
|
|
|
# This program is distributed in the hope that it will be useful,
|
|
|
|
# but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
# GNU General Public License for more details.
|
|
|
|
#
|
|
|
|
# You should have received a copy of the GNU General Public License
|
|
|
|
# along with this program; if not, write to the Free Software
|
|
|
|
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
|
|
#
|
|
|
|
# $Id$
|
|
|
|
|
|
|
|
#-------------------------------------------------------------------------
|
|
|
|
#
|
|
|
|
# python modules
|
|
|
|
#
|
|
|
|
#-------------------------------------------------------------------------
|
|
|
|
import locale
|
2006-05-27 02:18:40 +05:30
|
|
|
try:
|
|
|
|
set()
|
|
|
|
except:
|
|
|
|
from sets import Set as set
|
|
|
|
|
2006-05-17 06:18:46 +05:30
|
|
|
#-------------------------------------------------------------------------
|
|
|
|
#
|
|
|
|
# GNOME/GTK modules
|
|
|
|
#
|
|
|
|
#-------------------------------------------------------------------------
|
|
|
|
import gtk
|
|
|
|
|
|
|
|
#-------------------------------------------------------------------------
|
|
|
|
#
|
|
|
|
# GRAMPS modules
|
|
|
|
#
|
|
|
|
#-------------------------------------------------------------------------
|
|
|
|
from Filters import SearchFilter
|
|
|
|
|
|
|
|
#-------------------------------------------------------------------------
|
|
|
|
#
|
|
|
|
# BaseModel
|
|
|
|
#
|
|
|
|
#-------------------------------------------------------------------------
|
|
|
|
class BaseModel(gtk.GenericTreeModel):
|
|
|
|
|
|
|
|
def __init__(self, db, scol=0, order=gtk.SORT_ASCENDING,
|
2006-05-27 02:18:40 +05:30
|
|
|
tooltip_column=None, search=None, skip=set()):
|
2006-05-17 06:18:46 +05:30
|
|
|
gtk.GenericTreeModel.__init__(self)
|
|
|
|
self.prev_handle = None
|
|
|
|
self.prev_data = None
|
|
|
|
self.set_property("leak_references",False)
|
|
|
|
self.db = db
|
|
|
|
self.sort_func = self.smap[scol]
|
|
|
|
self.sort_col = scol
|
2006-05-27 02:18:40 +05:30
|
|
|
self.skip = skip
|
2006-07-10 09:04:19 +05:30
|
|
|
|
2006-05-17 06:18:46 +05:30
|
|
|
if search:
|
2006-07-10 09:04:19 +05:30
|
|
|
if search[0]:
|
|
|
|
self.search = search[1]
|
|
|
|
self.rebuild_data = self._rebuild_filter
|
|
|
|
else:
|
|
|
|
if search[1]:
|
|
|
|
col = search[1][0]
|
|
|
|
text = search[1][1]
|
|
|
|
inv = search[1][2]
|
|
|
|
func = lambda x: self.on_get_value(x, col) or u""
|
|
|
|
self.search = SearchFilter(func, text, inv)
|
|
|
|
else:
|
|
|
|
self.search = None
|
|
|
|
self.rebuild_data = self._rebuild_search
|
2006-05-17 06:18:46 +05:30
|
|
|
else:
|
|
|
|
self.search = None
|
2006-07-10 09:04:19 +05:30
|
|
|
self.rebuild_data = self._rebuild_search
|
2006-05-17 06:18:46 +05:30
|
|
|
|
|
|
|
self.reverse = (order == gtk.SORT_DESCENDING)
|
|
|
|
self.tooltip_column = tooltip_column
|
|
|
|
self.rebuild_data()
|
|
|
|
|
|
|
|
def set_sort_column(self,col):
|
|
|
|
self.sort_func = self.smap[col]
|
|
|
|
|
|
|
|
def sort_keys(self):
|
|
|
|
cursor = self.gen_cursor()
|
|
|
|
sarray = []
|
|
|
|
data = cursor.next()
|
|
|
|
|
|
|
|
while data:
|
|
|
|
key = locale.strxfrm(self.sort_func(data[1]))
|
|
|
|
sarray.append((key,data[0]))
|
|
|
|
data = cursor.next()
|
|
|
|
cursor.close()
|
|
|
|
|
|
|
|
sarray.sort()
|
|
|
|
|
|
|
|
if self.reverse:
|
|
|
|
sarray.reverse()
|
|
|
|
|
|
|
|
return [ x[1] for x in sarray ]
|
|
|
|
|
2006-07-10 09:04:19 +05:30
|
|
|
def _rebuild_search(self):
|
2006-05-17 06:18:46 +05:30
|
|
|
if self.db.is_open():
|
|
|
|
if self.search:
|
|
|
|
self.datalist = [h for h in self.sort_keys()\
|
2006-05-27 02:18:40 +05:30
|
|
|
if self.search.match(h) and h not in self.skip]
|
2006-05-17 06:18:46 +05:30
|
|
|
else:
|
2006-05-27 02:18:40 +05:30
|
|
|
self.datalist = [h for h in self.sort_keys() if h not in self.skip]
|
2006-05-17 06:18:46 +05:30
|
|
|
i = 0
|
|
|
|
self.indexlist = {}
|
|
|
|
for key in self.datalist:
|
2006-05-27 02:18:40 +05:30
|
|
|
if key not in self.skip:
|
|
|
|
self.indexlist[key] = i
|
|
|
|
i += 1
|
2006-05-17 06:18:46 +05:30
|
|
|
else:
|
|
|
|
self.datalist = []
|
|
|
|
self.indexlist = {}
|
2006-07-10 09:04:19 +05:30
|
|
|
|
|
|
|
def _rebuild_filter(self):
|
|
|
|
if self.db.is_open():
|
|
|
|
if self.search:
|
|
|
|
self.datalist = self.search.apply(self.db, self.sort_keys())
|
|
|
|
else:
|
|
|
|
self.datalist = self.sort_keys()
|
|
|
|
|
|
|
|
i = 0
|
|
|
|
self.indexlist = {}
|
|
|
|
for key in self.datalist:
|
|
|
|
if key not in self.skip:
|
|
|
|
self.indexlist[key] = i
|
|
|
|
i += 1
|
|
|
|
else:
|
|
|
|
self.datalist = []
|
|
|
|
self.indexlist = {}
|
2006-05-17 06:18:46 +05:30
|
|
|
|
|
|
|
def add_row_by_handle(self,handle):
|
|
|
|
self.datalist = self.sort_keys()
|
|
|
|
i = 0
|
|
|
|
self.indexlist = {}
|
|
|
|
for key in self.datalist:
|
|
|
|
self.indexlist[key] = i
|
|
|
|
i += 1
|
|
|
|
index = self.indexlist[handle]
|
|
|
|
node = self.get_iter(index)
|
|
|
|
self.row_inserted(index,node)
|
|
|
|
|
|
|
|
def delete_row_by_handle(self,handle):
|
|
|
|
index = self.indexlist[handle]
|
|
|
|
self.indexlist = {}
|
|
|
|
self.datalist = []
|
|
|
|
i = 0
|
|
|
|
for key in self.sort_keys():
|
|
|
|
if key != handle:
|
|
|
|
self.indexlist[key] = i
|
|
|
|
self.datalist.append(key)
|
|
|
|
i += 1
|
|
|
|
self.row_deleted(index)
|
|
|
|
|
|
|
|
def update_row_by_handle(self,handle):
|
|
|
|
index = self.indexlist[handle]
|
|
|
|
node = self.get_iter(index)
|
|
|
|
self.row_changed(index,node)
|
|
|
|
|
|
|
|
def on_get_flags(self):
|
|
|
|
'''returns the GtkTreeModelFlags for this particular type of model'''
|
|
|
|
return gtk.TREE_MODEL_LIST_ONLY | gtk.TREE_MODEL_ITERS_PERSIST
|
|
|
|
|
|
|
|
def on_get_n_columns(self):
|
|
|
|
return 1
|
|
|
|
|
|
|
|
def on_get_path(self, node):
|
|
|
|
'''returns the tree path (a tuple of indices at the various
|
|
|
|
levels) for a particular node.'''
|
|
|
|
return self.indexlist[node]
|
|
|
|
|
|
|
|
def on_get_column_type(self,index):
|
|
|
|
if index == self.tooltip_column:
|
|
|
|
return object
|
|
|
|
return str
|
|
|
|
|
|
|
|
def on_get_iter(self, path):
|
|
|
|
try:
|
|
|
|
return self.datalist[path[0]]
|
|
|
|
except IndexError:
|
|
|
|
return None
|
|
|
|
|
|
|
|
def on_get_value(self,node,col):
|
|
|
|
try:
|
|
|
|
if node != self.prev_handle:
|
|
|
|
self.prev_data = self.map(str(node))
|
|
|
|
self.prev_handle = node
|
|
|
|
return self.fmap[col](self.prev_data)
|
|
|
|
except:
|
|
|
|
return u''
|
|
|
|
|
|
|
|
def on_iter_next(self, node):
|
|
|
|
'''returns the next node at this level of the tree'''
|
|
|
|
try:
|
|
|
|
return self.datalist[self.indexlist[node]+1]
|
|
|
|
except IndexError:
|
|
|
|
return None
|
|
|
|
|
|
|
|
def on_iter_children(self,node):
|
|
|
|
"""Return the first child of the node"""
|
|
|
|
if node == None and self.datalist:
|
|
|
|
return self.datalist[0]
|
|
|
|
return None
|
|
|
|
|
|
|
|
def on_iter_has_child(self, node):
|
|
|
|
'''returns true if this node has children'''
|
|
|
|
if node == None:
|
|
|
|
return len(self.datalist) > 0
|
|
|
|
return False
|
|
|
|
|
|
|
|
def on_iter_n_children(self,node):
|
|
|
|
if node == None:
|
|
|
|
return len(self.datalist)
|
|
|
|
return 0
|
|
|
|
|
|
|
|
def on_iter_nth_child(self,node,n):
|
|
|
|
if node == None:
|
|
|
|
return self.datalist[n]
|
|
|
|
return None
|
|
|
|
|
|
|
|
def on_iter_parent(self, node):
|
|
|
|
'''returns the parent of this node'''
|
|
|
|
return None
|