62     int remainder   = branches % kMaxChildren;  in CountNodes()  local
63     if (remainder > 0) {  in CountNodes()
65         if (remainder >= kMinChildren) {  in CountNodes()
66             remainder = 0;  in CountNodes()
68             remainder = kMinChildren - remainder;  in CountNodes()
75         if (remainder != 0) {  in CountNodes()
76             if (remainder <= kMaxChildren - kMinChildren) {  in CountNodes()
77                 incrementBy -= remainder;  in CountNodes()
78                 remainder = 0;  in CountNodes()
81                 remainder -= kMaxChildren - kMinChildren;  in CountNodes()
102     int remainder   = (int)branches->size() % kMaxChildren;  in bulkLoad()  local
105     if (remainder > 0) {  in bulkLoad()
108         if (remainder >= kMinChildren) {  in bulkLoad()
109             remainder = 0;  in bulkLoad()
111             remainder = kMinChildren - remainder;  in bulkLoad()
118         if (remainder != 0) {  in bulkLoad()
120             if (remainder <= kMaxChildren - kMinChildren) {  in bulkLoad()
121                 incrementBy -= remainder;  in bulkLoad()
122                 remainder = 0;  in bulkLoad()
125                 remainder -= kMaxChildren - kMinChildren;  in bulkLoad()