@@ -169,11 +169,17 @@ <h2 id="returns">Returns</h2>
169169 for i, index in enumerate(valueIndexes):
170170 mat[level][index] = [center("/", unitSize=unitSize, fillChar=" "), center("\\", unitSize=unitSize, fillChar=" ")][i % 2]
171171
172+ # Fill gaps between each pair with gapFillChar
173+ for i in range(0, len(valueIndexes), 2):
174+ if i + 1 < len(valueIndexes):
175+ # Fill columns between valueIndexes[i] and valueIndexes[i+1]
176+ for col in range(valueIndexes[i] + 1, valueIndexes[i + 1]):
177+ mat[level][col] = center("", unitSize=unitSize, fillChar=gapFillChar)
178+
172179 # Calculate parent positions (midpoints between child pairs)
173180 next = []
174181 for i in range(0, len(valueIndexes) - 1, 2):
175182 next.append((valueIndexes[i] + valueIndexes[i + 1]) // 2)
176- prev = valueIndexes
177183 valueIndexes = next
178184 continue
179185
@@ -185,14 +191,6 @@ <h2 id="returns">Returns</h2>
185191 for i, index in enumerate(valueIndexes):
186192 if codes[i] in tree:
187193 mat[level][index] = tree[codes[i]]
188-
189- # Fill gaps between pairs for this level
190- if len(valueIndexes) > 1:
191- for i in range(0, len(valueIndexes), 2):
192- if i + 1 < len(valueIndexes):
193- # Fill columns between valueIndexes[i] and valueIndexes[i+1]
194- for col in range(valueIndexes[i] + 1, valueIndexes[i + 1]):
195- mat[level][col] = center("", unitSize=unitSize, fillChar=gapFillChar)
196194
197195 # Remove empty leading columns if requested
198196 if removeEmpty:
0 commit comments