839     int __fill = 0;  in sort()  local
843       while (__i < __fill && !__counter[__i].empty()) {  in sort()
849       if (__i == __fill)  in sort()
850         ++__fill;  in sort()
853     for (int __i = 1; __i < __fill; ++__i)  in sort()
855     this->swap(__counter[__fill-1]);  in sort()
912     int __fill = 0;  in sort()  local
916       while (__i < __fill && !__counter[__i].empty()) {  in sort()
922       if (__i == __fill)  in sort()
923         ++__fill;  in sort()
926     for (int __i = 1; __i < __fill; ++__i)  in sort()
928     this->swap(__counter[__fill-1]);  in sort()