← Back to branch summary

~bzr-pqm/bzr/bzr.dev

« back to all changes in this revision

Viewing changes to bzrlib/btree_index.py

  • Committer: Frank Aspell
  • Date: 2009-02-22 16:54:02 UTC
  • mto: This revision was merged to the branch mainline in revision 4256.
  • Revision ID: frankaspell@googlemail.com-20090222165402-2myrucnu7er5w4ha
Fixing various typos

Show diffs side-by-side

added added

removed removed

Lines of Context:
bzrlib/btree_index.py
296
296
            new_row = True
297
297
            for row in reversed(rows[:-1]):
298
298
                # Mark the start of the next node in the node above. If it
299
 
                # doesn't fit then propogate upwards until we find one that
 
299
                # doesn't fit then propagate upwards until we find one that
300
300
                # it does fit into.
301
301
                if row.writer.write(key_line):
302
302
                    row.finish_node()
344
344
        self.row_lengths = []
345
345
        # Loop over all nodes adding them to the bottom row
346
346
        # (rows[-1]). When we finish a chunk in a row,
347
 
        # propogate the key that didn't fit (comes after the chunk) to the
 
347
        # propagate the key that didn't fit (comes after the chunk) to the
348
348
        # row above, transitively.
349
349
        for node in node_iterator:
350
350
            if key_count == 0: