~bzr-pqm/bzr/bzr.dev

3641.3.29 by John Arbash Meinel
Cleanup the copyright headers
1
# Copyright (C) 2008 Canonical Ltd
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
2
#
3
# This program is free software; you can redistribute it and/or modify
3641.3.29 by John Arbash Meinel
Cleanup the copyright headers
4
# it under the terms of the GNU General Public License as published by
5
# the Free Software Foundation; either version 2 of the License, or
6
# (at your option) any later version.
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
7
#
8
# This program is distributed in the hope that it will be useful,
9
# but WITHOUT ANY WARRANTY; without even the implied warranty of
10
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
11
# GNU General Public License for more details.
12
#
13
# You should have received a copy of the GNU General Public License
14
# along with this program; if not, write to the Free Software
3641.3.29 by John Arbash Meinel
Cleanup the copyright headers
15
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
16
#
17
18
"""B+Tree index parsing."""
19
20
def _parse_leaf_lines(bytes, key_length, ref_list_length):
21
    lines = bytes.split('\n')
22
    nodes = []
23
    for line in lines[1:]:
24
        if line == '':
25
            return nodes
26
        elements = line.split('\0', key_length)
27
        # keys are tuples
28
        key = tuple(elements[:key_length])
29
        line = elements[-1]
30
        references, value = line.rsplit('\0', 1)
31
        if ref_list_length:
32
            ref_lists = []
33
            for ref_string in references.split('\t'):
34
                ref_lists.append(tuple([
35
                    tuple(ref.split('\0')) for ref in ref_string.split('\r') if ref
36
                    ]))
37
            ref_lists = tuple(ref_lists)
38
            node_value = (value, ref_lists)
39
        else:
40
            node_value = (value, ())
41
        nodes.append((key, node_value))
42
    return nodes
3641.3.18 by John Arbash Meinel
Start working on a compiled function for transforming
43
44
45
def _flatten_node(node, reference_lists):
46
    """Convert a node into the serialized form.
47
48
    :param node: A tuple representing a node (key_tuple, value, references)
49
    :param reference_lists: Does this index have reference lists?
50
    :return: (string_key, flattened)
51
        string_key  The serialized key for referencing this node
52
        flattened   A string with the serialized form for the contents
53
    """
54
    if reference_lists:
55
        # TODO: Consider turning this back into the 'unoptimized' nested loop
56
        #       form. It is probably more obvious for most people, and this is
57
        #       just a reference implementation.
58
        flattened_references = ['\r'.join(['\x00'.join(reference)
59
                                           for reference in ref_list])
60
                                for ref_list in node[3]]
61
    else:
62
        flattened_references = []
63
    string_key = '\x00'.join(node[1])
64
    line = ("%s\x00%s\x00%s\n" % (string_key,
65
        '\t'.join(flattened_references), node[2]))
66
    return string_key, line