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
|
# sAsync:
# An enhancement to the SQLAlchemy package that provides persistent
# dictionaries, text indexing and searching, and an access broker for
# conveniently managing database access, table setup, and
# transactions. Everything can be run in an asynchronous fashion using the
# Twisted framework and its deferred processing capabilities.
#
# Copyright (C) 2006-2007 by Edwin A. Suominen, http://www.eepatents.com
#
# 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 file COPYING 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., 51
# Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
"""
Dictionary-like objects with behind-the-scenes database persistence
"""
# Imports
from UserDict import DictMixin
from twisted.internet import defer
from misc import DeferredTracker
import items
class AsyncError(Exception):
"""
The requested action is incompatible with asynchronous operations.
"""
class PersistentDictBase(DictMixin, object):
"""
I am a base class for a database-persistent dictionary-like object uniquely
identified by the hashable constructor argument I{ID}.
Before you use any instance of me, you must specify the parameters for
creating an SQLAlchemy database engine. A single argument is used, which
specifies a connection to a database via an RFC-1738 url. In addition, the
following keyword options can be employed, which are listed in the API docs
for L{sasync} and L{sasync.database.AccessBroker}.
You can set an engine globally, for all instances of me, via the
L{sasync.engine} package-level function, or via the L{AccessBroker.engine}
class method. Alternatively, you can specify an engine for one particular
instance by supplying the parameters to my constructor.
In my default mode of operation, both read and write item accesses occur
asynchronously and return deferreds. However, you can put me into B{load}
mode by calling my L{preload} method. At that point, all my items will be
accessed synchronously as with any other dictionary. No other deferreds
will be returned from any item access. Lazy writing will still be done, but
behind the scenes and with no API access to write completions.
B{IMPORTANT}: As with all sasync data store objects, make sure you call my
L{shutdown} method for an instance of me that you're done with before
allowing that instance to be deleted.
@ivar isPreloadMode: Boolean flag that indicates if I am operating in
preload mode.
"""
def __init__(self, ID, *url, **kw):
"""
Instantiates me with an item store keyed to the supplied hashable
I{ID}. Ensures that I have access to a class-wide instance of a
L{Search} object so that I can update the database's full-text index
when writing values containing text content.
In addition to any engine-specifying keywords supplied, the following
are particular to this constructor:
@param ID: A hashable object that is used as my unique identifier.
@keyword search: Set C{True} if text indexing is to be updated when items
are added, updated, or deleted.
"""
try:
self.ID = hash(ID)
except:
raise TypeError("Item IDs must be hashable")
# In-memory Caches
self.data, self.keyCache = {}, {}
# For tracking lazy writes
self.writeTracker = DeferredTracker()
# My very own persistent items store
if url:
self.i = items.Items(self.ID, url[0], **kw)
else:
self.i = items.Items(self.ID)
self.isPreloadMode = False
def preload(self):
"""
This method preloads all my items from the database (which may take a
while), returning a C{Deferred} that fires when everything's ready and
I've completed the transition into B{preload} mode.
"""
d = self.loadAll()
d.addCallback(lambda _: setattr(self, 'isPreloadMode', True))
return d
def shutdown(self, *null):
"""
Shuts down my database L{Transactor} and its synchronous task queue.
"""
d = self.writeTracker.deferToAll()
d.addCallback(self.i.shutdown)
return d
def loadAll(self, *null):
"""
Loads all items from the database, setting my in-memory dict and key
cache accordingly.
"""
def loaded(items):
self.data.clear()
self.data.update(items)
self.keyCache = dict.fromkeys(items.keys(), True)
return self.data
return self.i.loadAll().addCallback(loaded)
def deferToWrites(self, lastOnly=False):
"""
@see: L{DeferredTracker.deferToAll}
"""
if lastOnly:
d = self.writeTracker.deferToLast()
else:
d = self.writeTracker.deferToAll()
return d
class PersistentDict(PersistentDictBase):
"""
I am a database-persistent dictionary-like object with memory caching of
items and lazy writing.
Getting, setting, or deleting my items returns C{Deferred} objects of the
Twisted asynchronous framework that fire when the underlying database
accesses are completed. Returning a deferred value avoids forcing the
client code to block while the real value is being read from the
database.
@ivar data: The in-memory dictionary that each instance of me uses to cache
values for a given ID.
"""
#--- Core dict operations -------------------------------------------------
def __getitem__(self, name):
"""
Returns a C{Deferred} to the value of item I{name} or the value itself
if in preload mode.
The value is only loaded from the database if it isn't already in the
in-memory dictionary.
"""
def valueLoaded(value):
if isinstance(value, items.Missing):
raise KeyError(
"No item '%s' in the database" % name)
self.data[name] = value
self.keyCache.setdefault(name, False)
return value
if name in self.data:
value = self.data[name]
if self.isPreloadMode:
return value
else:
return defer.succeed(value)
elif self.isPreloadMode:
raise KeyError(
"No item '%s' in the database" % name)
else:
return self.i.load(name).addCallback(valueLoaded)
def __setitem__(self, name, value):
"""
Sets item I{name} to I{value}, saving it to the database if there
isn't already an in-memory dictionary item with that exact value.
"""
def valueLoaded(loadedValue):
if isinstance(loadedValue, items.Missing):
# Item isn't in the database, so insert it
return self.i.insert(name, value)
else:
# Update current value of item in the database
return self.i.update(name, value)
oldValue = self.data.get(name, None)
self.data[name] = value
self.keyCache.setdefault(name, False)
# Everything from here on is just lazy writing
if oldValue is None:
# We're writing an item that hasn't been loaded from the database
# yet
if self.isPreloadMode:
# If it hasn't been loaded yet, in preload mode, it ain't there
d = self.i.insert(name, value)
else:
# Not in preload mode, so it may be in the database but not yet
# loaded
d = self.i.load(name)
d.addCallback(valueLoaded)
else:
# There's already a value in the in-memory dictionary, update it
d = self.i.update(name, value)
self.writeTracker.put(d)
def __delitem__(self, name):
"""
Deletes item I{name}, removing its entry from both the in-memory
dictionary and the database
"""
if name in self.data:
del self.data[name]
self.keyCache.pop(name, None)
d = self.i.delete(name)
self.writeTracker.put(d)
else:
raise KeyError(name)
def __contains__(self, key):
"""
Indicates if I contain item I{key}.
In I{preload} mode, returns C{True} if the item is present in my
in-memory dictionary and C{False} if not.
In normal mode, returns an immediate C{Deferred} firing with C{True}
without a transaction if the item is already present in my in-memory
dictionary. If it isn't, tries to load the item (it will probably be
requested soon anyhow) and returns a C{Deferred} that will ultimately
fire with C{True} unless the load resulted in a L{Missing} object. In
that case, deletes the loaded C{Missing} object from my in-memory
dictionary and fires the deferred with C{False}.
Using the C{<key> in <dict>} Python construct doesn't seem to work in
normal mode. Use L{has_key} instead.
"""
if self.isPreloadMode:
return self.data.__contains__(key)
elif key in self.data or key in self.keyCache:
return defer.succeed(True)
else:
d = self.i.load(key)
d.addCallback(lambda value: not isinstance(value, items.Missing))
return d
def keys(self):
"""
Returns an immediate or deferred list of the names of all my items in
the database.
"""
def gotKeyList(keyList):
self.keyCache = dict.fromkeys(keyList, True)
return keyList
if self.isPreloadMode:
return self.data.keys()
if True in self.keyCache.values():
# The key cache is valid as long as it has entries (=True) that were
# retrieved from preloading or a previous call of this method. The
# __setitem__ method will add new keys to the cache, but that
# doesn't initialize it.
keys = self.keyCache.keys()
return defer.succeed(keys)
# Empty or invalid key cache, load and cache a list of keys
return self.i.names().addCallback(gotKeyList)
#--- Replacement dict methods as needed -----------------------------------
def has_key(self, key):
"""
Returns an immediate or deferred Boolean indicating whether the key is
present.
"""
return self.__contains__(key)
def clear(self):
"""
Clears the in-memory dictionary of all items and deletes all their
database entries.
"""
self.keyCache.clear()
self.data.clear()
d = self.writeTracker.deferToAll()
d.addCallback(lambda _: self.i.names())
d.addCallback(lambda names: self.i.delete(*names))
self.writeTracker.put(d)
return d
def iteritems(self):
"""
B{Only for preload mode}: Iterate over all my items.
"""
if self.isPreloadMode:
for item in self.data.iteritems():
yield item
else:
raise AsyncError("Can't iterate asynchronously")
def iterkeys(self):
"""
B{Only for preload mode}: Iterate over all my keys.
"""
if self.isPreloadMode:
for key in self.data.iterkeys():
yield key
else:
raise AsyncError("Can't iterate asynchronously")
def itervalues(self):
"""
B{Only for preload mode}: Iterate over all my values.
"""
if self.isPreloadMode:
for value in self.data.itervalues():
yield values
else:
raise AsyncError("Can't iterate asynchronously")
def items(self):
"""
Returns an immediate or deferred sequence of (name, value) tuples
representing all my items.
"""
if self.isPreloadMode:
return self.data.items()
else:
return self.loadAll().addCallback(lambda x: x.items())
def values(self):
"""
Returns an immediate or deferred sequence of all my values.
"""
if self.isPreloadMode:
return self.data.values()
else:
return self.loadAll().addCallback(lambda x: x.values())
def get(self, *args):
"""
Returns an immediate or deferred value of the value for the key
specified as the first argument, or a default value if specified as an
optional second argument. If the item is not present and no default
value is supplied, raises the appropriate exception.
"""
def gotItem(loadedValue, key, defaultValue):
if isinstance(loadedValue, items.Missing):
return defaultValue
else:
self.data[key] = loadedValue
return loadedValue
key = args[0]
if len(args) == 1:
return self[key]
defaultValue = args[1]
if self.isPreloadMode:
if self.has_key(key):
return self[key]
return defaultValue
d = self.i.load(key)
d.addCallback(gotItem, key, defaultValue)
return d
def setdefault(self, key, value):
"""
Sets my item specified by I{key} to I{value} if it doesn't exist
already. Returns an immediate or deferred reference to the item's
value after its new value (if any) is set.
"""
def gotItem(loadedValue):
if isinstance(loadedValue, items.Missing):
self.__setitem__(key, value)
d = self.writeTracker.deferToLast()
d.addCallback(lambda _: value)
return d
else:
self.data[key] = loadedValue
return loadedValue
if self.isPreloadMode:
if key in self.data:
return self.data[key]
else:
self.__setitem__(key, value)
return value
elif key in self.data:
return defer.succeed(self.data[key])
else:
d = self.i.load(key)
d.addCallback(gotItem)
return d
def copy(self):
"""
Returns an immediate or deferred copy of me that is a conventional
(non-persisted) dictionary.
"""
if self.isPreloadMode:
return self.data.copy()
else:
return self.loadAll()
|