@@ -75,18 +75,18 @@ def get_benchmark_cols(
75
75
max_x = longest_x_end [- 1 ]
76
76
77
77
# 根据当前col的起始x坐标,更新col的边界
78
- def update_longest_col (col_x_list , cur_v , min_x_ , max_x_ ):
78
+ # 2025.2.22 --- 解决最长列可能漏掉最后一列的问题
79
+ def update_longest_col (col_x_list , cur_v , min_x_ , max_x_ , insert_last ):
79
80
for i , v in enumerate (col_x_list ):
80
81
if cur_v - col_thresh <= v <= cur_v + col_thresh :
81
82
break
82
- if cur_v > v :
83
- continue
84
83
if cur_v < min_x_ :
85
- # col_x_list.insert(0, cur_v)
84
+ col_x_list .insert (0 , cur_v )
86
85
min_x_ = cur_v
87
86
break
88
87
if cur_v > max_x_ :
89
- # col_x_list.append(max_x_)
88
+ if insert_last :
89
+ col_x_list .append (cur_v )
90
90
max_x_ = cur_v
91
91
break
92
92
if cur_v < v :
@@ -101,10 +101,10 @@ def update_longest_col(col_x_list, cur_v, min_x_, max_x_):
101
101
zip (cur_row_start , cur_row_end )
102
102
):
103
103
min_x , max_x = update_longest_col (
104
- longest_x_start , cur_v_start , min_x , max_x
104
+ longest_x_start , cur_v_start , min_x , max_x , True
105
105
)
106
106
min_x , max_x = update_longest_col (
107
- longest_x_start , cur_v_end , min_x , max_x
107
+ longest_x_start , cur_v_end , min_x , max_x , False
108
108
)
109
109
110
110
longest_x_start = np .array (longest_x_start )
0 commit comments