code: def fill_row(self, forward, items, idx, row, ro, ri, overlap,lengths):
          "Fill the row with tokens from the ragged array. --OBS-- overlap != 1 has not been implemented"
          ibuf = n = 0
          ro  -= 1
          while ibuf < row.size:
              ro   += 1
              ix    = idx[ro]
              rag   = items[ix]
              if forward:
                  ri = 0 if ibuf else ri
                  n  = min(lengths[ix] - ri, row.size - ibuf)
                  row[ibuf:ibuf+n] = rag[ri:ri+n]
              else:
                  ri = lengths[ix] if ibuf else ri
                  n  = min(ri, row.size - ibuf)
                  row[ibuf:ibuf+n] = rag[ri-n:ri][::-1]
              ibuf += n
          return ro, ri + ((n-overlap) if forward else -(n-overlap)f fill_row(self, forward, items, idx, row, ro, ri, overlap,lengths):
          "Fill the row with tokens from the ragged array. --OBS-- overlap != 1 has not been implemented"
          ibuf = n = 0
          ro  -= 1
          while ibuf < row.size:
              ro   += 1
              ix    = idx[ro]
              rag   = items[ix]
              if forward:
                  ri = 0 if ibuf else ri
                  n  = min(lengths[ix] - ri, row.size - ibuf)
                  row[ibuf:ibuf+n] = rag[ri:ri+n]
              else:
                  ri = lengths[ix] if ibuf else ri
                  n  = min(ri, row.size - ibuf)
                  row[ibuf:ibuf+n] = rag[ri-n:ri][::-1]
              ibuf += n
          return ro, ri + ((n-overlap) if forward else -(n-overlap))
docs: Fill the row with tokens from the ragged array. --OBS-- overlap != 1 has not been implemented