131
enumerateContents(version, address, enumerate)
/* a fair amount of setup for the main enumeration loop */
/* the move stack tracks the currently active move operation */
if address.path().length > 1 then
Put move IDs and endpoints of move source ranges
for moves in address.path() onto mc_stack.
They must be entered in reverse order. This means that
address.path().head() should be top of the stack.
else
mc_stack = empty
endif
cur_address = address
cur_seg = findSegment(version, address.path(), address.index())
cur_deletion = findDeletionFor(version, cur_address)
while (cur_seg != null && application still wants data) then
if cur_deletion.start() < cur_address)
cur_address = cur_deletion.end().next()
else
test_move = getMoveRegion(version, cur_address,
mc_stack.top().getID())
if test_move != null then
cur_address = test_move.end()
else
/* we are now sure that the data (if any) is OK. */
/* we always have a whole segment, because boundaries
for deletions and moves split segments */
cur_address = process(cur_seg, mc_stack, enumerate,
version)
endif
endif
if cur_address =mc_stack.top().sourceRegion().end()
cur_address = mc_stack.top().destAddress().next()
mc_stack.pop()
endif
cur_deletion = findDeletionFor(cur_address)
endwhile
F F F F iii ig g g gu u u ur r r re e e e 6666....6666:::: AAAAllllggggoooorrrriiiitttthhhhmmmm ffffoooorrrr eeeennnnuuuummmmeeeerrrraaaattttiiiinnnngggg tttthhhheeee ccccoooonnnntttteeeennnnttttssss ooooffff aaaa PPPP----sssseeeeqqqquuuueeeennnncccceeee
The pseudo-code in Figure 6.6 shows exactly how the information about deleted and
moved subsequences can be used to skip over portions of the sequence that are not part of
the current version. One aspect not shown is that thesegment.next()operation could be
modified to take an argument, version, specifying the change set being traversed. This
enumerateContents(version, address, enumerate)
/* a fair amount of setup for the main enumeration loop */
/* the move stack tracks the currently active move operation */
if address.path().length > 1 then
Put move IDs and endpoints of move source ranges
for moves in address.path() onto mc_stack.
They must be entered in reverse order. This means that
address.path().head() should be top of the stack.
else
mc_stack = empty
endif
cur_address = address
cur_seg = findSegment(version, address.path(), address.index())
cur_deletion = findDeletionFor(version, cur_address)
while (cur_seg != null && application still wants data) then
if cur_deletion.start() < cur_address)
cur_address = cur_deletion.end().next()
else
test_move = getMoveRegion(version, cur_address,
mc_stack.top().getID())
if test_move != null then
cur_address = test_move.end()
else
/* we are now sure that the data (if any) is OK. */
/* we always have a whole segment, because boundaries
for deletions and moves split segments */
cur_address = process(cur_seg, mc_stack, enumerate,
version)
endif
endif
if cur_address =mc_stack.top().sourceRegion().end()
cur_address = mc_stack.top().destAddress().next()
mc_stack.pop()
endif
cur_deletion = findDeletionFor(cur_address)
endwhile
F F F F iii ig g g gu u u ur r r re e e e 6666....6666:::: AAAAllllggggoooorrrriiiitttthhhhmmmm ffffoooorrrr eeeennnnuuuummmmeeeerrrraaaattttiiiinnnngggg tttthhhheeee ccccoooonnnntttteeeennnnttttssss ooooffff aaaa PPPP----sssseeeeqqqquuuueeeennnncccceeee
The pseudo-code in Figure 6.6 shows exactly how the information about deleted and
moved subsequences can be used to skip over portions of the sequence that are not part of
the current version. One aspect not shown is that thesegment.next()operation could be
modified to take an argument, version, specifying the change set being traversed. This
