bidi/algorithm.py
def reverse_contiguous_sequence(chars, line_start, line_end, highest_level,
                                lowest_odd_level):
    """L2. From the highest level found in the text to the lowest odd
    level on each line, including intermediate levels not actually
    present in the text, reverse any contiguous sequence of characters
    that are at that level or higher.

    """
    for level in range(highest_level, lowest_odd_level-1, -1):
        _start = _end = None

        for run_idx in range(line_start, line_end+1):
            run_ch = chars[run_idx]

            if run_ch['level'] >= level:
                if _start is None:
                    _start = _end = run_idx
                else:
                    _end = run_idx
            else:
                if _end:
                    chars[_start:+_end+1] = \
                            reversed(chars[_start:+_end+1])
                    _start = _end = None

        # anything remaining ?
        if _start is not None:
            chars[_start:+_end+1] = \
                reversed(chars[_start:+_end+1])
def reverse_contiguous_sequence(chars, line_start, line_end, highest_level,
                                lowest_odd_level):
    for level in range(highest_level, lowest_odd_level-1, -1):
        _start = _end = None

        for run_idx in range(line_start, line_end+1):
            run_ch = chars[run_idx]

            if run_ch['level'] >= level:
                if _start is None:
                    _start = _end = run_idx
                else:
                    _end = run_idx
            else:
                if _end:
                    chars[_start:+_end+1] = \
                            reversed(chars[_start:+_end+1])
                    _start = _end = None

        # anything remaining ?
        if _start is not None:
            chars[_start:+_end+1] = \
                reversed(chars[_start:+_end+1])
def reverse_contiguous_sequence ( chars , line_start , line_end , highest_level , lowest_odd_level ) : for level in range ( highest_level , lowest_odd_level - 1 , - 1 ) : _start = _end = None for run_idx in range ( line_start , line_end + 1 ) : run_ch = chars [ run_idx ] if run_ch [ 'level' ] >= level : if _start is None : _start = _end = run_idx else : _end = run_idx else : if _end : chars [ _start : + _end + 1 ] = reversed ( chars [ _start : + _end + 1 ] ) _start = _end = None # anything remaining ? if _start is not None : chars [ _start : + _end + 1 ] = reversed ( chars [ _start : + _end + 1 ] )
L2. From the highest level found in the text to the lowest odd
    level on each line, including intermediate levels not actually
    present in the text, reverse any contiguous sequence of characters
    that are at that level or higher.
L2 . From the highest level found in the text to the lowest odd level on each line including intermediate levels not actually present in the text reverse any contiguous sequence of characters that are at that level or higher .