{ "numberGroups", new IntArrayWrapper(new int[]{ 10, 1 }) },
while (k < groups.getLength()) if (mult / groups.getInt(k) <= 0) // look for right table k++; else lookupIndex = (int)mult / groups.getInt(k); while (count < groups.getLength()) if (val / groups.getInt(count) <= 0) // look for correct table count++; else lookupIndex = (int)val / groups.getInt(count); val = val % groups.getInt(count);
{ "numberGroups", new IntArrayWrapper(new int[]{ 10, 1 }) },
while (k < groups.getLength()) if (mult / groups.getInt(k) <= 0) // look for right table k++; else lookupIndex = (int)mult / groups.getInt(k); while (count < groups.getLength()) if (val / groups.getInt(count) <= 0) // look for correct table count++; else lookupIndex = (int)val / groups.getInt(count); val = val % groups.getInt(count);
{ "numberGroups", new IntArrayWrapper(new int[]{ 1 }) },
{ "numberGroups", new IntArrayWrapper(new int[]{ 1 }) },
{ "numberGroups", new IntArrayWrapper(new int[]{ 1 }) },
{ "numberGroups", new IntArrayWrapper(new int[]{ 1 }) },
{ "numberGroups", new IntArrayWrapper(new int[]{ 1000, 100, 10, 1 }) },
{ "numberGroups", new IntArrayWrapper(new int[]{ 1 }) },
{ "numberGroups", new IntArrayWrapper(new int[]{ 1 }) },
{ "numberGroups", new IntArrayWrapper(new int[]{ 1000, 100, 10, 1 }) },
{ "numberGroups", new IntArrayWrapper(new int[]{ 1 }) },
{ "numberGroups", new IntArrayWrapper(new int[]{ 1 }) },
{ "numberGroups", new IntArrayWrapper(new int[]{ 1 }) },
{ "numberGroups", new IntArrayWrapper(new int[]{ 1 }) },
{ "numberGroups", new IntArrayWrapper(new int[]{ 1 }) },
{ "numberGroups", new IntArrayWrapper(new int[]{ 1000, 100, 10, 1 }) },
{ "numberGroups", new IntArrayWrapper(new int[]{ 1 }) },
{ "numberGroups", new IntArrayWrapper(new int[]{ 1 }) },