aboutsummaryrefslogtreecommitdiffstats
path: root/libbe/util/id.py
blob: ab623597d53bb93db7e78e6c6521e6b1896d34a1 (plain) (blame)
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
# Copyright (C) 2008-2009 Gianluca Montecchi <gian@grys.it>
#                         W. Trevor King <wking@drexel.edu>
#
# 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.,
# 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.

"""
Handle ID creation and parsing.
"""

import os.path
import re

import libbe

if libbe.TESTING == True:
    import doctest
    import sys
    import unittest

try:
    from uuid import uuid4 # Python >= 2.5
    def uuid_gen():
        id = uuid4()
        idstr = id.urn
        start = "urn:uuid:"
        assert idstr.startswith(start)
        return idstr[len(start):]
except ImportError:
    import os
    import sys
    from subprocess import Popen, PIPE

    def uuid_gen():
        # Shell-out to system uuidgen
        args = ['uuidgen', 'r']
        try:
            if sys.platform != "win32":
                q = Popen(args, stdin=PIPE, stdout=PIPE, stderr=PIPE)
            else:
                # win32 don't have os.execvp() so have to run command in a shell
                q = Popen(args, stdin=PIPE, stdout=PIPE, stderr=PIPE, 
                          shell=True, cwd=cwd)
        except OSError, e :
            strerror = "%s\nwhile executing %s" % (e.args[1], args)
            raise OSError, strerror
        output, error = q.communicate()
        status = q.wait()
        if status != 0:
            strerror = "%s\nwhile executing %s" % (status, args)
            raise Exception, strerror
        return output.rstrip('\n')


HIERARCHY = ['bugdir', 'bug', 'comment']


class MultipleIDMatches (ValueError):
    def __init__(self, id, matches):
        msg = ("More than one id matches %s.  "
               "Please be more specific.\n%s" % (id, matches))
        ValueError.__init__(self, msg)
        self.id = id
        self.matches = matches

class NoIDMatches (KeyError):
    def __init__(self, id, possible_ids):
        msg = "No id matches %s.\n%s" % (id, possible_ids)
        KeyError.__init__(self, msg)
        self.id = id
        self.possible_ids = possible_ids


def _assemble(*args):
    args = list(args)
    for i,arg in enumerate(args):
        if arg == None:
            args[i] = ''
    return '/'.join(args)

def _split(id):
    args = id.split('/')
    for i,arg in enumerate(args):
        if arg == '':
            args[i] = None
    return args

def _truncate(uuid, other_uuids, min_length=3):
    chars = min_length
    for id in other_uuids:
        if id == uuid:
            continue
        while (id[:chars] == uuid[:chars]):
            chars+=1
    return uuid[:chars]

def _expand(truncated_id, other_ids):
    matches = []
    for id in other_ids:
        if id.startswith(truncated_id):
            matches.append(id)
    if len(matches) > 1:
        raise MultipleIDMatches(truncated_id, matches)
    if len(matches) == 0:
        raise NoIDMatches(truncated_id, other_ids)
    return matches[0]


class ID (object):
    """
    IDs have several formats specialized for different uses.

    In storage, all objects are represented by their uuid alone,
    because that is the simplest globally unique identifier.  You can
    generate ids of this sort with the .storage() method.  Because an
    object's storage may be distributed across several chunks, and the
    chunks may not have their own uuid, we generate chunk ids by
    prepending the objects uuid to the chunk name.  The user id types
    do not support this chunk extension feature.

    For users, the full uuids are a bit overwhelming, so we truncate
    them while retaining local uniqueness (with regards to the other
    objects currently in storage).  We also prepend truncated parent
    ids for two reasons:
      (1) so that a user can locate the repository containing the
          referenced object.  It would be hard to find bug 'XYZ' if
          that's all you knew.  Much easier with 'ABC/XYZ', where ABC
          is the bugdir.  Each project can publish a list of bugdir-id
          - to - location mappings, e.g.
            ABC...(full uuid)...DEF   https://server.com/projectX/be/
          which is easier than publishing all-object-ids-to-location
          mappings.
      (2) because it's easier to generate and parse truncated ids if
          you don't have to fetch all the ids in the storage
          repository, but can restrict yourself to a specific branch.
    You can generate ids of this sort with the .user() method,
    although in order to preform the truncation, your object (and its
    parents must define a .sibling_uuids() method.


    While users can use the convenient short user ids in the short
    term, the truncation will inevitably lead to name collision.  To
    avoid that, we provide a non-truncated form of the short user ids
    via the .long_user() method.  These long user ids should be
    converted to short user ids by intelligent user interfaces.

    Related tools:
      * get uuids back out of the user ids:
        parse_user()
      * scan text for user ids & convert to long user ids:
        short_to_long_user()
      * scan text for long user ids & convert to short user ids:
        long_to_short_user()

    Supported types: 'bugdir', 'bug', 'comment'
    """
    def __init__(self, object, type):
        self._object = object
        self._type = type
        assert self._type in HIERARCHY, self._type

    def storage(self, *args):
        import libbe.comment
        return _assemble(self._object.uuid, *args)

    def _ancestors(self):
        ret = [self._object]
        index = HIERARCHY.index(self._type)
        if index == 0:
            return ret
        o = self._object
        for i in range(index, 0, -1):
            parent_name = HIERARCHY[i-1]
            o = getattr(o, parent_name, None)
            ret.insert(0, o)
        return ret

    def long_user(self):
        return _assemble(*[o.uuid for o in self._ancestors()])

    def user(self):
        ids = []
        for o in self._ancestors():
            if o == None:
                ids.append(None)
            else:
                ids.append(_truncate(o.uuid, o.sibling_uuids()))
        return _assemble(*ids)

def child_uuids(child_storage_ids):
    """
    Extract uuid children from other children generated by the
    ID.storage() method.
    >>> list(child_uuids(['abc123/values', '123abc', '123def']))
    ['123abc', '123def']
    """
    for id in child_storage_ids:
        fields = libbe.util.id._split(id)
        if len(fields) == 1:
            yield fields[0]


def parse_user(id):
    """
    >>> parse_user('ABC/DEF/GHI') == \\
    ...     {'bugdir':'ABC', 'bug':'DEF', 'comment':'GHI', 'type':'comment'}
    True
    >>> parse_user('ABC/DEF') == \\
    ...     {'bugdir':'ABC', 'bug':'DEF', 'type':'bug'}
    True
    >>> parse_user('ABC') == \\
    ...     {'bugdir':'ABC', 'type':'bugdir'}
    True
    """
    ret = {}
    args = _split(id)
    assert len(args) > 0 and len(args) < 4, 'Invalid id "%s"' % id
    for type,arg in zip(HIERARCHY, args):
        assert len(arg) > 0, 'Invalid part "%s" of id "%s"' % (arg, id)
        ret['type'] = type
        ret[type] = arg
    return ret

REGEXP = '#([-a-f0-9]*)(/[-a-g0-9]*)?(/[-a-g0-9]*)?#'

class IDreplacer (object):
    def __init__(self, bugdirs, direction):
        self.bugdirs = bugdirs
        self.direction = direction
    def __call__(self, match):
        ids = [m.lstrip('/') for m in match.groups() if m != None]
        ids = self.switch_ids(ids)
        return '#' + '/'.join(ids) + '#'
    def switch_id(self, id, sibling_uuids):
        if id == None:
            return None
        if self.direction == 'long_to_short':
            return _truncate(id, sibling_uuids)
        return _expand(id, sibling_uuids)
    def switch_ids(self, ids):
        assert ids[0] != None, ids
        if self.direction == 'long_to_short':
            bugdir = [bd for bd in self.bugdirs if bd.uuid == ids[0]][0]
            objects = [bugdir]
            if len(ids) >= 2:
                bug = bugdir.bug_from_uuid(ids[1])
                objects.append(bug)
            if len(ids) >= 3:
                comment = bug.comment_from_uuid(ids[2])
                objects.append(comment)
            for i,obj in enumerate(objects):
                ids[i] = self.switch_id(ids[i], obj.sibling_uuids())
        else:
            ids[0] = self.switch_id(ids[0], [bd.uuid for bd in self.bugdirs])
            if len(ids) == 1:
                return ids
            bugdir = [bd for bd in self.bugdirs if bd.uuid == ids[0]][0]
            ids[1] = self.switch_id(ids[1], bugdir.uuids())
            if len(ids) == 2:
                return ids
            bug = bugdir.bug_from_uuid(ids[1])
            ids[2] = self.switch_id(ids[2], bug.uuids())
        return ids

def short_to_long_user(bugdirs, text):
    return re.sub(REGEXP, IDreplacer(bugdirs, 'short_to_long'), text)
def long_to_short_user(bugdirs, text):
    return re.sub(REGEXP, IDreplacer(bugdirs, 'long_to_short'), text)

if libbe.TESTING == True:
    class UUIDtestCase(unittest.TestCase):
        def testUUID_gen(self):
            id = uuid_gen()
            self.failUnless(len(id) == 36, 'invalid UUID "%s"' % id)

    class DummyObject (object):
        def __init__(self, uuid, siblings=[]):
            self.uuid = uuid
            self._siblings = siblings
        def sibling_uuids(self):
            return self._siblings
        
    class IDtestCase(unittest.TestCase):
        def setUp(self):
            self.bugdir = DummyObject('1234abcd')
            self.bug = DummyObject('abcdef', ['a1234', 'ab9876'])
            self.bug.bugdir = self.bugdir
            self.comment = DummyObject('12345678', ['1234abcd', '1234cdef'])
            self.comment.bug = self.bug
            self.bd_id = ID(self.bugdir, 'bugdir')
            self.b_id = ID(self.bug, 'bug')
            self.c_id = ID(self.comment, 'comment')
        def test_storage(self):
            self.failUnless(self.bd_id.storage() == self.bugdir.uuid,
                            self.bd_id.storage())
            self.failUnless(self.b_id.storage() == self.bug.uuid,
                            self.b_id.storage())
            self.failUnless(self.c_id.storage() == self.comment.uuid,
                            self.c_id.storage())
            self.failUnless(self.bd_id.storage('x','y','z') == \
                                '1234abcd/x/y/z', self.bd_id.storage())
        def test_long_user(self):
            self.failUnless(self.bd_id.long_user() == self.bugdir.uuid,
                            self.bd_id.long_user())
            self.failUnless(self.b_id.long_user() == \
                                '/'.join([self.bugdir.uuid, self.bug.uuid]),
                            self.b_id.long_user())
            self.failUnless(self.c_id.long_user() ==
                                '/'.join([self.bugdir.uuid, self.bug.uuid,
                                          self.comment.uuid]),
                            self.c_id.long_user)
        def test_user(self):
            self.failUnless(self.bd_id.user() == '123',
                            self.bd_id.user())
            self.failUnless(self.b_id.user() == '123/abc',
                            self.b_id.user())
            self.failUnless(self.c_id.user() == '123/abc/12345',
                            self.c_id.user())

    class IDtestCase(unittest.TestCase):
        def setUp(self):
            self.bugdir = DummyObject('1234abcd')
            self.bug = DummyObject('abcdef', ['a1234', 'ab9876'])
            self.bug.bugdir = self.bugdir
            self.bugdir.bug_from_uuid = lambda uuid: self.bug
            self.bugdir.uuids = lambda : self.bug.sibling_uuids() + [self.bug.uuid] 
            self.comment = DummyObject('12345678', ['1234abcd', '1234cdef'])
            self.comment.bug = self.bug
            self.bug.comment_from_uuid = lambda uuid: self.comment
            self.bug.uuids = lambda : self.comment.sibling_uuids() + [self.comment.uuid] 
            self.bd_id = ID(self.bugdir, 'bugdir')
            self.b_id = ID(self.bug, 'bug')
            self.c_id = ID(self.comment, 'comment')
            self.short = 'bla bla #123/abc# bla bla #123/abc/12345# bla bla'
            self.long = 'bla bla #1234abcd/abcdef# bla bla #1234abcd/abcdef/12345678# bla bla'
        def test_short_to_long(self):
            self.failUnless(short_to_long_user([self.bugdir], self.short) == self.long,
                            '\n' + self.short + '\n' + short_to_long_user([self.bugdir], self.short) + '\n' + self.long)
        def test_long_to_short(self):
            self.failUnless(long_to_short_user([self.bugdir], self.long) == self.short,
                            '\n' + long_to_short_user([self.bugdir], self.long) + '\n' + self.short)

    unitsuite =unittest.TestLoader().loadTestsFromModule(sys.modules[__name__])
    suite = unittest.TestSuite([unitsuite, doctest.DocTestSuite()])