-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdata.py
More file actions
362 lines (315 loc) · 13 KB
/
data.py
File metadata and controls
362 lines (315 loc) · 13 KB
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
'''Data model for collaborative manifesto maker'''
# TODO: check existence of referenced objects on put. JWM
import time
import sys
import json
import inspect
from collections import Set
from random import randrange
from redis import Redis
# this is how times are stored (chosen to be sortable)
TIME_FORMAT = '%Y-%m-%d %H:%M:%S'
def rnd():
'''Generates a random value for usage in keys'''
return hex(randrange(0,2**32))[2:]
# def parse_obj(attrs):
# '''Takes a dictionary representation of a DataModel
# instance and returns the corresponding object'''
# obj_type = attrs['type'].split(':')[-1]
# if not obj_type in DATA_TYPES:
# raise ValueError('Illegal type for DataModel instance: %s' % obj_type)
# # parse lists where necessary
# for key in LIST_ATTRS[obj_type]:
# if isinstance(attrs[key], basestring):
# attrs[key] = attrs[key].strip('[]').split(', ')
# # get object class
# Obj = globals()[obj_type]
# # init new object with specified attributes
# return Obj(**attrs)
def parse_key(attrs):
'''Extracts object key from an attribute representation
of a DataModel instance
'''
if 'type' in attrs and 'id' in attrs:
return Key('%s:%s' % (attrs['type'], attrs['id']))
if 'key' in attrs:
return Key(attrs['key'])
def parse_obj(attrs):
'''Takes a dictionary representation of a DataModel
instance and returns the corresponding object. Any invalid
attributes are ignored when initializing the object.
'''
obj_type = attrs['type'] if 'type' in attrs \
else Key(attrs.get('key', None)).type()
if not obj_type:
raise ValueError('Cannot determine object type from attrs.'
+ 'Needs to define either "key" or "type".')
if 'id' in attrs:
obj_id = attrs['id']
attrs['key'] = Key('%s:%s' % (obj_type, obj_id))
# strip any unexpected arguments from attrs
obj_class = globals()[obj_type]
args = inspect.getargspec(obj_class.__init__).args
attrs = {k: attrs[k] for k in args if k in attrs}
return obj_class(**attrs)
class DataStore(object):
'''Interface with redis datastore'''
def __init__(self, *args, **kwargs):
self.redis = Redis(*args, **kwargs)
def delete(self, key):
'''Removes an element from the datastore'''
obj = self.get(key)
# todo: for now, only deletion of revisions is allowed
if isinstance(obj, Revision):
# remove revision references
self.redis.srem('%s:authored' % obj.author, obj.key)
self.redis.srem('%s:revisions' % obj.root, obj.key)
self.redis.srem('%s:revisions' % obj.document, obj.key)
if obj.parent:
self.redis.srem('%s:forks' % obj.parent, obj.key)
# if this is a root revision, delete the whole tree of forks
if obj.key == obj.root:
self.redis.srem('%s:roots' % obj.document, obj.key)
rev_keys = self.members('%s:revisions' % obj.key)
for r in rev_keys:
self.delete(r)
self.redis.delete('%s:revisions', obj.key)
# remove revision
self.redis.delete(obj.key)
self.redis.delete('%s:forks', obj.key)
def exists(self, key):
'''Checks if key exists'''
return self.redis.exists(key)
def members(self, set_key):
'''Returns a list of references under key'''
members = self.redis.smembers(set_key)
return [Key(m) for m in members if self.redis.exists(Key(m))]
def ismember(self, set_key, obj_key):
'''Check whether key in set'''
return self.redis.sismember(set_key, obj_key)
def sadd(self, set_key, *obj_keys):
for k in obj_keys:
if self.redis.exists(k):
self.redis.sadd(set_key, k)
def inter(self, set_keys):
'''Returns intersection between sets'''
return self.redis.sinter(set_keys)
def get_all(self, set_key):
'''Returns all objects in a set'''
keys = self.members(set_key)
return [self.get(k) for k in keys]
def get_tree(self, rev_key):
'''Returns a populated revision tree'''
rev = self.get(rev_key)
forks = self.members('%s:forks' % rev_key)
rev.forks = [self.get_tree(k) for k in forks]
for r in rev.forks:
r.parent = rev
return rev
def get(self, obj_key):
'''Retrieves a DataModel object'''
attrs = self.redis.hgetall(obj_key)
if attrs:
if Key(obj_key).type() == 'User':
# retrieve set members separately
for k in ['authored', 'up_voted', 'down_voted']:
attrs[k] = self.members('%s:%s' % (obj_key, k))
if Key(obj_key).type() == 'Revision':
attrs['forks'] = self.members('%s:%s' % (obj_key, 'forks'))
return parse_obj(attrs)
else:
return None
def put(self, data):
'''Writes out a DataModel object'''
# for users, don't write out reference sets
# (these are stored separately)
attrs = dict(data.__dict__.items())
if isinstance(data, User):
for s in ['authored', 'up_voted', 'down_voted']:
if s in attrs:
self.redis.delete('%s:%s' % (data.key, s))
keys = attrs.pop(s, [])
if keys:
self.sadd('%s:%s' % (data.key, s), *keys)
success = self.redis.hmset(data.key, attrs)
# objects need to be added to their respective sets
if isinstance(data, User):
self.sadd('users', data.key)
if isinstance(data, Document):
self.sadd('documents', data.key)
if isinstance(data, Revision):
if data.parent:
self.sadd('%s:forks' % data.parent, data.key)
if data.document:
self.sadd('%s:revisions' % data.document, data.key)
if data.key == data.root:
self.sadd('%s:roots' % data.document, data.key)
if data.key != data.root:
self.sadd('%s:revisions' % data.root, data.key)
else:
self.sadd('%s:revisions' % data.key, data.key)
if data.author:
self.sadd('%s:authored' % data.author, data.key)
return data.key if success else success
def update(self, attrs):
'''Writes subset of attributes to specified object'''
key = parse_key(attrs)
try:
if key and self.redis.exists(key):
orig = self.get(key).__dict__
for k in attrs:
if k in orig:
orig[k] = attrs[k]
# write out object
data = parse_obj(orig)
else:
data = parse_obj(attrs)
except ValueError:
return 0
success = self.put(data)
return data.key if success else success
def update_scores(self, key, parent=None, base_up=0, base_down=0):
'''re-calculates scores for tree under specified revision'''
rev = self.get(key)
rev.tot_up = rev.up
rev.tot_down = rev.down
if not parent and rev.parent:
parent = self.get(rev.parent)
if parent:
rev.tot_up += parent.tot_up
rev.tot_down += parent.tot_down
else:
rev.tot_up += base_up
rev.tot_down += base_down
rev.score = (rev.tot_up + 1.) / (rev.tot_up + rev.tot_down + 2.)
self.put(rev)
for r in rev.forks:
self.update_scores(r, parent=rev)
def vote(self, user_key, rev_key, vote):
'''Votes up, down or blank on specified revision, and update
user records'''
dirty = False
# vote 0 means blanking
if vote == 0:
if self.ismember('%s:up_voted' % user_key, rev_key):
self.redis.srem('%s:up_voted' % user_key, rev_key)
self.redis.hincrby(rev_key, 'up', -1)
dirty = True
elif self.ismember('%s:down_voted' % user_key, rev_key):
self.redis.srem('%s:down_voted' % user_key, rev_key)
self.redis.hincrby(rev_key, 'down', -1)
dirty = True
# vote 1 means upvote
if vote == 1 and not self.ismember('%s:up_voted' % user_key, rev_key):
self.sadd('%s:up_voted' % user_key, rev_key)
self.redis.hincrby(rev_key, 'up', 1)
dirty = True
# vote -1 means downvote
elif vote == -1 and not self.ismember('%s:down_voted' % user_key, rev_key):
self.sadd('%s:down_voted' % user_key, rev_key)
self.redis.hincrby(rev_key, 'down', 1)
dirty = True
# update scores
if dirty:
self.update_scores(rev_key)
return True
return False
class Key(str):
'''BaseClass for datastore keys'''
def __nonzero__(self):
return str(self) and (self != 'None')
def type(self):
'''Returns object type of key'''
return self.split(':')[0] if len(self.split(':')) == 2 else None
def id(self):
'''Returns id of object'''
return self.split(':')[1] if len(self.split(':')) == 2 else None
# class KeyList(list):
# '''BaseClass for sets of datastore references'''
# # this is just here so you can use isinstance(object.attr, KeyList)
# def __init__(self, members=(), key=None):
# super(KeyList, self).__init__(members)
class DataModel(object):
'''Base class for DataStore object model. Each DataModel instance
must have a key property, which indicates its location in the
redis backend. Object keys take the format
key = ObjType:obj_id
:key:
Reference to object in dataset. Can be specified
either as full key or object id.
'''
def __init__(self, key=None):
key = key if key else ''
if len(key.split(':')) < 2:
key = '%s:%s' % (self.__class__.__name__, key if key else rnd())
self.key = Key(key)
def __eq__(self, other):
if hasattr(other, 'key'):
return (self.key == other.key)
else:
return False
def __repr__(self):
return self.key
class DataEncoder(json.JSONEncoder):
def default(self, obj):
if isinstance(obj, DataModel):
attrs = dict(obj.__dict__.items())
# split key to type and id
attrs.pop('key')
attrs['type'] = obj.key.type()
attrs['id'] = obj.key.id()
return attrs
return json.JSONEncoder.default(self, obj)
class Document(DataModel):
def __init__(self, name='', created=None, key=None):
super(Document, self).__init__(key=key)
self.name = name
self.created = created if created else time.strftime(TIME_FORMAT)
class Revision(DataModel):
def __init__(self, text=None, author=None, created=None,
topic='', score=0, forks=[],
up=0, down=0, tot_up=0, tot_down=0,
parent=None, root=None, document=None, key=None):
super(Revision, self).__init__(key=key)
if text is None:
raise ValueError('text of revision needs to be specified')
self.text = text
self.author = Key(author) if author else ''
self.root = Key(root) if root else self.key
self.parent = Key(parent) if parent else ''
self.document = Key(document) if document else ''
self.forks = forks
self.created = created if created else time.strftime(TIME_FORMAT)
self.topic = topic
self.up = int(up)
self.down = int(down)
self.tot_up = int(tot_up)
self.tot_down = int(tot_down)
self.score = float(score)
# class Thread(DataModel):
# def __init__(self, root=None, revisions=[], **kwargs):
# super(Revision, self).__init__(**kwargs)
# def tree(self, root=None):
# '''recursively populate references in revision tree'''
# children = []
# for child in root.children:
# children.append(self.tree(root=child))
# return
# def scores(self):
# '''get score for each revision'''
class User(DataModel):
def __init__(self, screen_name=None, real_name=None,
created=None, location=None, bio=None,
authored=[], up_voted=[], down_voted=[],
oauth_token=None, oauth_secret=None, key=None):
super(User, self).__init__(key=key)
self.screen_name = screen_name
self.real_name = real_name
self.location = location
self.bio = bio
self.created = created if created else time.strftime(TIME_FORMAT)
self.authored = [Key(rev) for rev in authored]
self.up_voted = [Key(rev) for rev in up_voted]
self.down_voted = [Key(rev) for rev in down_voted]
self.oauth_token = oauth_token
self.oauth_secret = oauth_secret