Erik Grinaker is sharing code with you
Bitbucket is a code hosting site. Unlimited public and private repositories. Free for small teams.
Don't show this againRevelation / src / lib / data.py
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 | #
# Revelation 0.4.0 - a password manager for GNOME 2
# http://oss.codepoet.no/revelation/
# $Id$
#
# Module containing data-related functionality
#
#
# Copyright (c) 2003-2005 Erik Grinaker
#
# 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.
#
import datahandler, entry, ui
import gobject, gtk, gtk.gdk
COLUMN_NAME = 0
COLUMN_ICON = 1
COLUMN_ENTRY = 2
SEARCH_NEXT = "next"
SEARCH_PREVIOUS = "prev"
class Clipboard(gobject.GObject):
"A normal text-clipboard"
def __init__(self):
gobject.GObject.__init__(self)
self.clip_clipboard = gtk.clipboard_get("CLIPBOARD")
self.clip_primary = gtk.clipboard_get("PRIMARY")
self.content = None
self.contentpointer = 0
def __cb_clear(self, clipboard, data = None):
"Clears the clipboard data"
return
self.content = None
self.contentpointer = 0
def __cb_get(self, clipboard, selectiondata, info, data):
"Returns text for clipboard requests"
if self.content == None:
text = ""
elif type(self.content) == list:
if len(self.content) == 0:
text = ""
else:
text = self.content[self.contentpointer]
if self.contentpointer < len(self.content) - 1:
self.contentpointer += 1
else:
text = str(self.content)
selectiondata.set_text(text, len(text))
def clear(self):
"Clears the clipboard"
self.clip_clipboard.clear()
self.clip_primary.clear()
def get(self):
"Fetches text from the clipboard"
text = self.clip_clipboard.wait_for_text()
if text is None:
text = ""
return text
def has_contents(self):
"Checks if the clipboard has any contents"
return self.clip_clipboard.wait_is_text_available()
def set(self, content):
"Copies text to the clipboard"
self.content = content
self.contentpointer = 0
targets = (
( "text/plain", 0, 0 ),
( "STRING", 0, 0 ),
( "TEXT", 0, 0 ),
( "COMPOUND_TEXT", 0, 0 ),
( "UTF8_STRING", 0, 0 )
)
self.clip_clipboard.set_with_data(targets, self.__cb_get, self.__cb_clear, None)
self.clip_primary.set_with_data(targets, self.__cb_get, self.__cb_clear, None)
class EntryClipboard(gobject.GObject):
"A clipboard for entries"
def __init__(self):
gobject.GObject.__init__(self)
self.clipboard = gtk.Clipboard(gtk.gdk.display_get_default(), "_REVELATION_ENTRY")
self.__has_contents = False
gobject.timeout_add(500, lambda: self.__check_contents())
def __check_contents(self):
"Callback which check the clipboard"
state = self.has_contents()
if state != self.__has_contents:
self.emit("content-toggled", state)
self.__has_contents = state
return True
def clear(self):
"Clears the clipboard"
self.clipboard.clear()
self.__check_contents()
def get(self):
"Fetches entries from the clipboard"
try:
xml = self.clipboard.wait_for_text()
if xml in ( None, "" ):
return None
handler = datahandler.RevelationXML()
entrystore = handler.import_data(xml)
return entrystore
except datahandler.HandlerError:
return None
def has_contents(self):
"Checks if the clipboard has any contents"
return self.clipboard.wait_for_text() is not None
def set(self, entrystore, iters):
"Copies entries from an entrystore to the clipboard"
copystore = EntryStore()
for iter in entrystore.filter_parents(iters):
copystore.import_entry(entrystore, iter)
xml = datahandler.RevelationXML().export_data(copystore)
self.clipboard.set_text(xml)
self.__check_contents()
gobject.signal_new("content-toggled", EntryClipboard, gobject.SIGNAL_ACTION, gobject.TYPE_BOOLEAN, ( gobject.TYPE_BOOLEAN, ))
class EntrySearch(gobject.GObject):
"Handles searching in an EntryStore"
def __init__(self, entrystore):
gobject.GObject.__init__(self)
self.entrystore = entrystore
self.folders = True
self.namedesconly = False
self.casesensitive = False
def find(self, string, entrytype = None, offset = None, direction = SEARCH_NEXT):
"Searches for an entry, starting at the given offset"
iter = offset
while 1:
if direction == SEARCH_NEXT:
iter = self.entrystore.iter_traverse_next(iter)
else:
iter = self.entrystore.iter_traverse_prev(iter)
# if we've wrapped around, return None
if self.entrystore.get_path(iter) == self.entrystore.get_path(offset):
return None
if self.match(iter, string, entrytype) == True:
return iter
def match(self, iter, string, entrytype = None):
"Check if an entry matches the search criteria"
if iter is None:
return False
e = self.entrystore.get_entry(iter)
# check entry type
if type(e) == entry.FolderEntry and self.folders == False:
return False
if entrytype is not None and type(e) not in ( entrytype, entry.FolderEntry ):
return False
# check entry fields
items = [ e.name, e.description ]
if self.namedesconly == False:
items.extend([ field.value for field in e.fields if field.value != "" ])
# run the search
for item in items:
if self.casesensitive == True and item.find(string) >= 0:
return True
elif self.casesensitive == False and item.lower().find(string.lower()) >= 0:
return True
return False
class EntryStore(gtk.TreeStore):
"A data structure for storing entries"
def __init__(self):
gtk.TreeStore.__init__(
self,
gobject.TYPE_STRING, # name
gobject.TYPE_STRING, # icon
gobject.TYPE_PYOBJECT # entry
)
self.changed = False
self.connect("row-has-child-toggled", self.__cb_iter_has_child)
def __cb_iter_has_child(self, widget, path, iter):
"Callback for iters having children"
if self.iter_n_children(iter) == 0:
self.folder_expanded(iter, False)
def add_entry(self, e, parent = None, sibling = None):
"Adds an entry"
# place after parent if it's not a folder
if parent is not None and type(self.get_entry(parent)) != entry.FolderEntry:
iter = self.insert_after(self.iter_parent(parent), parent)
# place before sibling, if given
elif sibling is not None:
iter = self.insert_before(parent, sibling)
# otherwise, append to parent
else:
iter = self.append(parent)
self.update_entry(iter, e)
self.changed = True
return iter
def clear(self):
"Removes all entries"
gtk.TreeStore.clear(self)
self.changed = False
def copy_entry(self, iter, parent = None, sibling = None):
"Copies an entry recursively"
newiter = self.add_entry(self.get_entry(iter), parent, sibling)
for i in range(self.iter_n_children(iter)):
child = self.iter_nth_child(iter, i)
self.copy_entry(child, newiter)
return newiter
def filter_parents(self, iters):
"Removes all descendants from the list of iters"
parents = []
for child in iters:
for parent in iters:
if self.is_ancestor(parent, child):
break
else:
parents.append(child)
return parents
def folder_expanded(self, iter, expanded):
"Sets the expanded state of an entry"
if iter is None or type(self.get_entry(iter)) != entry.FolderEntry:
return
elif expanded == True:
self.set_value(iter, COLUMN_ICON, ui.STOCK_ENTRY_FOLDER_OPEN)
else:
self.set_value(iter, COLUMN_ICON, ui.STOCK_ENTRY_FOLDER)
def get_entry(self, iter):
"Fetches data for an entry"
if iter is None:
return None
return self.get_value(iter, COLUMN_ENTRY).copy()
def get_iter(self, path):
"Gets an iter from a path"
try:
if path in ( None, "", (), [] ):
return None
if type(path) == list:
path = tuple(path)
return gtk.TreeStore.get_iter(self, path)
except ValueError:
return None
def get_path(self, iter):
"Gets a path from an iter"
return iter is not None and gtk.TreeStore.get_path(self, iter) or None
def get_popular_values(self, fieldtype, threshold = 3):
"Gets popular values for a field type"
valuecount = {}
iter = self.iter_nth_child(None, 0)
while iter is not None:
e = self.get_entry(iter)
if e.has_field(fieldtype) == False:
iter = self.iter_traverse_next(iter)
continue
value = e[fieldtype].strip()
if value != "":
if valuecount.has_key(value) == False:
valuecount[value] = 0
valuecount[value] += 1
iter = self.iter_traverse_next(iter)
popular = [ value for value, count in valuecount.items() if count >= threshold ]
popular.sort()
return popular
def import_entry(self, source, iter, parent = None, sibling = None):
"Recursively copies an entry from a different entrystore"
if iter is not None:
copy = self.add_entry(source.get_entry(iter), parent, sibling)
parent, sibling = copy, None
else:
copy = None
newiters = []
for i in range(source.iter_n_children(iter)):
child = source.iter_nth_child(iter, i)
newiter = self.import_entry(source, child, parent, sibling)
newiters.append(newiter)
return copy is not None and copy or newiters
def iter_traverse_next(self, iter):
"Gets the 'logically next' iter"
# get the first child, if any
child = self.iter_nth_child(iter, 0)
if child is not None:
return child
# check for a sibling or, if not found, a sibling of any ancestors
parent = iter
while parent is not None:
sibling = parent.copy()
sibling = self.iter_next(sibling)
if sibling is not None:
return sibling
parent = self.iter_parent(parent)
return None
def iter_traverse_prev(self, iter):
"Gets the 'logically previous' iter"
# get the previous sibling, or parent, of the iter - if any
if iter is not None:
parent = self.iter_parent(iter)
index = self.get_path(iter)[-1]
# if no sibling is found, return the parent
if index == 0:
return parent
# otherwise, get the sibling
iter = self.iter_nth_child(parent, index - 1)
# get the last, deepest child of the sibling or root, if any
while self.iter_n_children(iter) > 0:
iter = self.iter_nth_child(iter, self.iter_n_children(iter) - 1)
return iter
def move_entry(self, iter, parent = None, sibling = None):
"Moves an entry"
newiter = self.copy_entry(iter, parent, sibling)
self.remove_entry(iter)
return newiter
def remove_entry(self, iter):
"Removes an entry, and its children if any"
if iter is None:
return None
self.remove(iter)
self.changed = True
def update_entry(self, iter, e):
"Updates an entry"
if None in ( iter, e):
return None
self.set_value(iter, COLUMN_NAME, e.name)
self.set_value(iter, COLUMN_ICON, e.icon)
self.set_value(iter, COLUMN_ENTRY, e.copy())
self.changed = True
class UndoQueue(gobject.GObject):
"Handles undo/redo tracking"
def __init__(self):
gobject.GObject.__init__(self)
self.queue = []
self.pointer = 0
def add_action(self, name, cb_undo, cb_redo, actiondata):
"Adds an action to the undo queue"
del self.queue[self.pointer:]
self.queue.append(( name, cb_undo, cb_redo, actiondata ))
self.pointer = len(self.queue)
self.emit("changed")
def can_redo(self):
"Checks if a redo action is possible"
return self.pointer < len(self.queue)
def can_undo(self):
"Checks if an undo action is possible"
return self.pointer > 0
def clear(self):
"Clears the queue"
self.queue = []
self.pointer = 0
self.emit("changed")
def get_redo_action(self):
"Returns data for the next redo operation"
if self.can_redo() == False:
return None
name, cb_undo, cb_redo, actiondata = self.queue[self.pointer]
return cb_redo, name, actiondata
def get_undo_action(self):
"Returns data for the next undo operation"
if self.can_undo() == False:
return None
name, cb_undo, cb_redo, actiondata = self.queue[self.pointer - 1]
return cb_undo, name, actiondata
def redo(self):
"Executes a redo operation"
if self.can_redo() == False:
return None
cb_redo, name, actiondata = self.get_redo_action()
self.pointer += 1
cb_redo(name, actiondata)
self.emit("changed")
def undo(self):
"Executes an undo operation"
if self.can_undo() == False:
return None
cb_undo, name, actiondata = self.get_undo_action()
self.pointer -= 1
cb_undo(name, actiondata)
self.emit("changed")
gobject.type_register(UndoQueue)
gobject.signal_new("changed", UndoQueue, gobject.SIGNAL_ACTION, gobject.TYPE_BOOLEAN, ())
|