File: orderinglist.py

package info (click to toggle)
griffith 0.9.7.1-1
  • links: PTS, VCS
  • area: main
  • in suites: lenny
  • size: 5,912 kB
  • ctags: 5,224
  • sloc: python: 27,496; xml: 543; ansic: 325; makefile: 252
file content (185 lines) | stat: -rw-r--r-- 6,943 bytes parent folder | download
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
"""
A custom list implementation for mapped relations that syncs position in a
Python list with a position attribute on the mapped objects.
"""

__all__ = [ 'ordering_list' ]


def ordering_list(attr, count_from=None, **kw):
    """
    Prepares an OrderingList factory for use as an argument to a
    Mapper relation's 'collection_class' option.  Arguments are:

    attr
      Name of the mapped attribute to use for storage and retrieval of
      ordering information

    count_from (optional)
      Set up an integer-based ordering, starting at 'count_from'.  For example,
      ordering_list('pos', count_from=1) would create a 1-based list in SQL,
      storing the value in the 'pos' column.  Ignored if ordering_func is
      supplied.
      
    Passes along any keyword arguments to OrderingList constructor.
    """

    kw = _unsugar_count_from(count_from=count_from, **kw)
    return lambda: OrderingList(attr, **kw)

# Ordering utility functions
def count_from_0(index, collection):
    """Numbering function: consecutive integers starting at 0."""

    return index

def count_from_1(index, collection):
    """Numbering function: consecutive integers starting at 1."""

    return index + 1

def count_from_n_factory(start):
    """Numbering function: consecutive integers starting at arbitrary start."""

    def f(index, collection):
        return index + start
    try:
        f.__name__ = 'count_from_%i' % start
    except TypeError:
        pass
    return f

def _unsugar_count_from(**kw):
    """Keyword argument filter, prepares a simple ordering_func from
    a 'count_from' argument, otherwise passes ordering_func on unchanged."""
    
    count_from = kw.pop('count_from', None)
    if kw.get('ordering_func', None) is None and count_from is not None:
        if count_from == 0:
            kw['ordering_func'] = count_from_0
        elif count_from == 1:
            kw['ordering_func'] = count_from_1
        else:
            kw['ordering_func'] = count_from_n_factory(count_from)
    return kw

class OrderingList(list):
    def __init__(self, ordering_attr=None, ordering_func=None,
                 reorder_on_append=False):
        """
        A 'collection_class' list implementation that syncs position in a
        Python list with a position attribute on the mapped objects.

        This implementation counts on the list starting in the proper
        order, so be SURE to put an order_by on your relation.
        Arguments are:

        ordering_attr
          Name of the attribute that stores the object's order in the relation.

        ordering_func
          Optional.  A function that maps the position in the Python list to a
          value to store in the ordering_attr.  Values returned are usually
          (but need not be!) integers.

          ordering_funcs are called with two positional parameters: index of
          the element in the list, and the list itself.
          
          If omitted, list indexes are used for the attribute values.  Two
          basic pre-built numbering functions are provided: 'count_from_0' and
          'count_from_1'.  For more exotic examples like stepped numbering,
          alphabetical and Fibonacci numbering, see the unit tests.

        reorder_on_append
          Default false.  When appending an object with an existing (non-None)
          ordering value, that value will be left untouched unless
          reorder_on_append is true.  This is an optimization to avoid a
          variety of dangerous unexpected database writes.

          SQLAlchemy will add instances to the list via append() when your
          object loads.  If for some reason the result set from the database
          skips a step in the ordering (say, row '1' is missing but you get
          '2', '3', and '4'), reorder_on_append=True would immediately
          renumber the items to '1', '2', '3'.  If you have multiple sessions
          making changes, any of whom happen to load this collection even in
          passing, all of the sessions would try to 'clean up' the numbering
          in their commits, possibly causing all but one to fail with a
          concurrent modification error.  Spooky action at a distance.

          Recommend leaving this with the default of False, and just call
          ._reorder() if you're doing append() operations with previously
          ordered instances or doing housekeeping after manual sql operations.
        """

        self.ordering_attr = ordering_attr
        if ordering_func is None:
            ordering_func = count_from_0
        self.ordering_func = ordering_func
        self.reorder_on_append = reorder_on_append

    # More complex serialization schemes (multi column, e.g.) are possible by
    # subclassing and reimplementing these two methods.
    def _get_order_value(self, entity):
        return getattr(entity, self.ordering_attr)

    def _set_order_value(self, entity, value):
        setattr(entity, self.ordering_attr, value)

    def _reorder(self):
        """Sweep through the list and ensure that each object has accurate
        ordering information set."""
        
        for index, entity in enumerate(self):
            self._order_entity(index, entity, True)

    def _order_entity(self, index, entity, reorder=True):
        have = self._get_order_value(entity)

        # Don't disturb existing ordering if reorder is False
        if have is not None and not reorder:
            return

        should_be = self.ordering_func(index, self)
        if have <> should_be:
            self._set_order_value(entity, should_be)

    def append(self, entity):
        super(OrderingList, self).append(entity)
        self._order_entity(len(self) - 1, entity, self.reorder_on_append)

    def _raw_append(self, entity):
        """Append without any ordering behavior."""

        super(OrderingList, self).append(entity)

    def insert(self, index, entity):
        self[index:index] = [entity]

    def remove(self, entity):
        super(OrderingList, self).remove(entity)
        self._reorder()

    def pop(self, index=-1):
        entity = super(OrderingList, self).pop(index)
        self._reorder()
        return entity
        
    def __setitem__(self, index, entity):
        if isinstance(index, slice):
            for i in range(index.start or 0, index.stop or 0, index.step or 1):
                self.__setitem__(i, entity[i])
        else:
            self._order_entity(index, entity, True)
            super(OrderingList, self).__setitem__(index, entity)
            
    def __delitem__(self, index):
        super(OrderingList, self).__delitem__(index)
        self._reorder()

    def __setslice__(self, start, end, values):
        super(OrderingList, self).__setslice__(start, end, values)
        self._reorder()

    def __delslice__(self, start, end):
        super(OrderingList, self).__delslice__(start, end)
        self._reorder()