Lines Matching refs:remainder
69 int remainder = branches % kMaxChildren;
70 if (remainder > 0) {
72 if (remainder >= kMinChildren) {
73 remainder = 0;
75 remainder = kMinChildren - remainder;
85 if (remainder != 0) {
86 if (remainder <= kMaxChildren - kMinChildren) {
87 incrementBy -= remainder;
88 remainder = 0;
91 remainder -= kMaxChildren - kMinChildren;
113 int remainder = branches->count() % kMaxChildren;
116 if (remainder > 0) {
118 // If the remainder isn't enough to fill a node, we'll add fewer nodes to other branches.
119 if (remainder >= kMinChildren) {
120 remainder = 0;
122 remainder = kMinChildren - remainder;
134 if (remainder != 0) {
135 // if need be, omit some nodes to make up for remainder
136 if (remainder <= kMaxChildren - kMinChildren) {
137 incrementBy -= remainder;
138 remainder = 0;
141 remainder -= kMaxChildren - kMinChildren;
