Mercurial > jhg
diff src/org/tmatesoft/hg/internal/IntSliceSeq.java @ 674:cce0387c6041
Introduced dedicated IntSliceSeq/IntTuple in place of IntArray with subsequences
author | Artem Tikhomirov <tikhomirov.artem@gmail.com> |
---|---|
date | Wed, 17 Jul 2013 15:40:51 +0200 |
parents | |
children | 19f5167c2155 |
line wrap: on
line diff
--- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/src/org/tmatesoft/hg/internal/IntSliceSeq.java Wed Jul 17 15:40:51 2013 +0200 @@ -0,0 +1,116 @@ +/* + * Copyright (c) 2013 TMate Software Ltd + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of the GNU General Public License as published by + * the Free Software Foundation; version 2 of the License. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * For information on how to redistribute this software under + * the terms of a license other than GNU General Public License + * contact TMate Software at support@hg4j.com + */ +package org.tmatesoft.hg.internal; + +import java.util.Iterator; +import java.util.NoSuchElementException; + +/** + * + * @author Artem Tikhomirov + * @author TMate Software Ltd. + */ +public final class IntSliceSeq implements Iterable<IntTuple> { + private final IntVector slices; + private final int slice; + + public IntSliceSeq(int sliceSize) { + // initial size/grow values are pure guess + this(sliceSize, 10, 5); + } + + public IntSliceSeq(int sliceSize, int initialSlices, int slicesToGrow) { + slices = new IntVector(sliceSize * initialSlices, sliceSize*slicesToGrow); + slice = sliceSize; + } + + public IntSliceSeq add(int... values) { + checkValues(values); + slices.add(values); + return this; + } + + public IntSliceSeq set(int sliceIndex, int... values) { + checkValues(values); + for (int i = 0, j = sliceIndex*slice; i < slice; i++,j++) { + slices.set(j, values[i]); + } + return this; + } + + public IntTuple get(int sliceIndex) { + checkArgRange(size(), sliceIndex); + return new IntTuple(slice).set(slices, sliceIndex*slice); + } + + public int get(int sliceIndex, int valueIndex) { + checkArgRange(size(), sliceIndex); + checkArgRange(slice, valueIndex); + return slices.get(sliceIndex*slice + valueIndex); + } + + public int size() { + return slices.size() / slice; + } + + public int sliceSize() { + return slice; + } + + public void clear() { + slices.clear(); + } + + public IntTuple last() { + int lastElementIndex = (size() - 1); + if (lastElementIndex < 0) { + throw new NoSuchElementException(); + } + return get(lastElementIndex); + } + + public Iterator<IntTuple> iterator() { + return new Iterator<IntTuple>() { + private final IntTuple t = new IntTuple(slice); + private int next = 0; + + public boolean hasNext() { + return next < size(); + } + + public IntTuple next() { + return t.set(slices, next++*slice); + } + + public void remove() { + throw new UnsupportedOperationException(); + } + }; + } + + private void checkArgRange(int rangeSize, int index) { + if (index >= 0 && index < rangeSize) { + return; + } + throw new IllegalArgumentException(String.valueOf(index)); + } + private void checkValues(int[] values) { + if (values == null || values.length != slice) { + throw new IllegalArgumentException(String.valueOf(values == null ? values : values.length)); + } + } +}