Lines Matching defs:counts
30 final int[] counts;
166 for (int i = 0; i < counts.length; ++i) {
167 if (counts[i] != 0) {
180 return counts[unit.ordinal] > 0;
191 if (counts[ord] == 0) {
194 return (counts[ord] - 1)/1000f;
254 * the same counts, both extend into the future or both into the
266 for (int i = 0; i < counts.length; ++i) {
267 if (counts[i] != rhs.counts[i]) {
282 for (int i = 0; i < counts.length; ++i) {
283 hc = (hc << 2) ^ counts[i];
294 this.counts = new int[TimeUnit.units.length];
295 this.counts[unit.ordinal] = (int)(count * 1000) + 1;
301 Period(int timeLimit, boolean inFuture, int[] counts) {
304 this.counts = counts;
327 if (counts[ord] != value) {
328 int[] newCounts = new int[counts.length];
329 for (int i = 0; i < counts.length; ++i) {
330 newCounts[i] = counts[i];
345 return new Period(timeLimit, future, counts);
358 return new Period(limit, inFuture, counts);