equal
deleted
inserted
replaced
2618 maxTabWidth = Math.max(maxTabWidth, rect.width); |
2618 maxTabWidth = Math.max(maxTabWidth, rect.width); |
2619 |
2619 |
2620 // Never move a TAB down a run if it is in the first column. |
2620 // Never move a TAB down a run if it is in the first column. |
2621 // Even if there isn't enough room, moving it to a fresh |
2621 // Even if there isn't enough room, moving it to a fresh |
2622 // line won't help. |
2622 // line won't help. |
2623 if (rect.x != 2 + insets.left && rect.x + rect.width > returnAt) { |
2623 if (rect.x != x && rect.x + rect.width > returnAt) { |
2624 if (runCount > tabRuns.length - 1) { |
2624 if (runCount > tabRuns.length - 1) { |
2625 expandTabRunsArray(); |
2625 expandTabRunsArray(); |
2626 } |
2626 } |
2627 tabRuns[runCount] = i; |
2627 tabRuns[runCount] = i; |
2628 runCount++; |
2628 runCount++; |
2646 maxTabHeight = Math.max(maxTabHeight, rect.height); |
2646 maxTabHeight = Math.max(maxTabHeight, rect.height); |
2647 |
2647 |
2648 // Never move a TAB over a run if it is in the first run. |
2648 // Never move a TAB over a run if it is in the first run. |
2649 // Even if there isn't enough room, moving it to a fresh |
2649 // Even if there isn't enough room, moving it to a fresh |
2650 // column won't help. |
2650 // column won't help. |
2651 if (rect.y != 2 + insets.top && rect.y + rect.height > returnAt) { |
2651 if (rect.y != y && rect.y + rect.height > returnAt) { |
2652 if (runCount > tabRuns.length - 1) { |
2652 if (runCount > tabRuns.length - 1) { |
2653 expandTabRunsArray(); |
2653 expandTabRunsArray(); |
2654 } |
2654 } |
2655 tabRuns[runCount] = i; |
2655 tabRuns[runCount] = i; |
2656 runCount++; |
2656 runCount++; |