Lines Matching defs:remainder
62 int remainder = branches % kMaxChildren;
63 if (remainder > 0) {
65 if (remainder >= kMinChildren) {
66 remainder = 0;
68 remainder = kMinChildren - remainder;
75 if (remainder != 0) {
76 if (remainder <= kMaxChildren - kMinChildren) {
77 incrementBy -= remainder;
78 remainder = 0;
81 remainder -= kMaxChildren - kMinChildren;
102 int remainder = (int)branches->size() % kMaxChildren;
105 if (remainder > 0) {
107 // If the remainder isn't enough to fill a node, we'll add fewer nodes to other branches.
108 if (remainder >= kMinChildren) {
109 remainder = 0;
111 remainder = kMinChildren - remainder;
118 if (remainder != 0) {
119 // if need be, omit some nodes to make up for remainder
120 if (remainder <= kMaxChildren - kMinChildren) {
121 incrementBy -= remainder;
122 remainder = 0;
125 remainder -= kMaxChildren - kMinChildren;