diff options
author | Jérémy Zurcher <jeremy@asynk.ch> | 2018-09-15 15:38:09 +0200 |
---|---|---|
committer | Jérémy Zurcher <jeremy@asynk.ch> | 2018-09-15 15:38:09 +0200 |
commit | 57cddbf4b79b6c342e53acfa804d01f94d9bd266 (patch) | |
tree | 9fcc89fecc3166ff19a7ab90b14f1a4111903df4 /core/src/ch/asynk/gdx/board/util | |
parent | 898a7c34189e2b7d52c794c93e9fa0aeb759ca64 (diff) | |
download | gdx-boardgame-57cddbf4b79b6c342e53acfa804d01f94d9bd266.zip gdx-boardgame-57cddbf4b79b6c342e53acfa804d01f94d9bd266.tar.gz |
namespecat gdx.board -> gdx.tabletop
Diffstat (limited to 'core/src/ch/asynk/gdx/board/util')
-rw-r--r-- | core/src/ch/asynk/gdx/board/util/Collection.java | 28 | ||||
-rw-r--r-- | core/src/ch/asynk/gdx/board/util/IterableArray.java | 143 | ||||
-rw-r--r-- | core/src/ch/asynk/gdx/board/util/IterableQueue.java | 19 | ||||
-rw-r--r-- | core/src/ch/asynk/gdx/board/util/IterableSet.java | 16 | ||||
-rw-r--r-- | core/src/ch/asynk/gdx/board/util/IterableStack.java | 26 |
5 files changed, 0 insertions, 232 deletions
diff --git a/core/src/ch/asynk/gdx/board/util/Collection.java b/core/src/ch/asynk/gdx/board/util/Collection.java deleted file mode 100644 index 8aadadf..0000000 --- a/core/src/ch/asynk/gdx/board/util/Collection.java +++ /dev/null @@ -1,28 +0,0 @@ -package ch.asynk.gdx.board.util; - -import java.util.Iterator; - -public interface Collection<E> extends Iterator, Iterable<E> -{ - public int size(); - - public boolean isEmpty(); - - public void clear(); - - public void ensureCapacity(int c); - - public boolean contains(E e); - - public E get(int idx); - - public int indexOf(E e); - - public boolean add(E e); - - public boolean insert(E e, int idx); - - public E remove(int idx); - - public boolean remove(E e); -} diff --git a/core/src/ch/asynk/gdx/board/util/IterableArray.java b/core/src/ch/asynk/gdx/board/util/IterableArray.java deleted file mode 100644 index 2dc4481..0000000 --- a/core/src/ch/asynk/gdx/board/util/IterableArray.java +++ /dev/null @@ -1,143 +0,0 @@ -package ch.asynk.gdx.board.util; - -import java.util.Arrays; -import java.util.Iterator; - -public class IterableArray<E> implements Collection<E> -{ - private int idx; - private int s; - private int c; - transient E[] data; - - @SuppressWarnings("unchecked") - public IterableArray(int capacity) - { - this.s = 0; - this.c = capacity; - this.data = (E[]) new Object[c]; - } - - @Override public int size() - { - return s; - } - - @Override public boolean isEmpty() - { - return (s == 0); - } - - @Override public void clear() - { - for (int i = 0; i < s; i++) - data[i] = null; - s = 0; - } - - @Override public void ensureCapacity(int min) - { - if (c > min) return; - c += (c >> 1); - if (c < min) - c = min; - data = Arrays.copyOf(data, c); - } - - @Override public boolean contains(E e) - { - if (e == null) { - for (int i = 0; i < s; i++) { - if (data[i] == null) - return true; - } - } else { - for (int i = 0; i < s; i++) { - if (e.equals(data[i])) - return true; - } - } - return false; - } - - @Override public E get(int i) - { - return data[i]; - } - - @Override public int indexOf(E e) - { - for (int i = 0; i < data.length; i++) { - if (data[i] != null && data[i].equals(e)) - return i; - } - return -1; - } - - @Override public boolean add(E e) - { - ensureCapacity(s + 1); - data[s] = e; - s += 1; - return true; - } - - @Override public boolean insert(E e, int idx) - { - ensureCapacity(s + 1); - System.arraycopy(data, idx, data, idx+1, (s - idx)); - data[idx] = e; - s += 1; - return true; - } - - @Override public E remove(int i) - { - E e = data[i]; - int m = (s - i - 1); - if (m > 0) - System.arraycopy(data, i+1, data, i, m); - data[--s] = null; - - return e; - } - - @Override public boolean remove(E e) - { - for (int i = 0; i < s; i++) { - if (e.equals(data[i])) { - int m = (s - i - 1); - if (m > 0) - System.arraycopy(data, i+1, data, i, m); - data[--s] = null; - return true; - } - } - return false; - } - - @SuppressWarnings("unchecked") - @Override public Iterator<E> iterator() - { - this.idx = 0; - return (Iterator<E>) this; - } - - @Override public boolean hasNext() - { - return (idx < s); - } - - @Override public E next() - { - E e = get(idx); - idx += 1; - return e; - } - - @Override public void remove() - { - idx -= 1; - remove(idx); - } -} diff --git a/core/src/ch/asynk/gdx/board/util/IterableQueue.java b/core/src/ch/asynk/gdx/board/util/IterableQueue.java deleted file mode 100644 index 8a9a74f..0000000 --- a/core/src/ch/asynk/gdx/board/util/IterableQueue.java +++ /dev/null @@ -1,19 +0,0 @@ -package ch.asynk.gdx.board.util; - -public class IterableQueue<E> extends IterableArray<E> -{ - public IterableQueue(int n) - { - super(n); - } - - public void enqueue(E e) - { - add(e); - } - - public E dequeue() - { - return remove(0); - } -} diff --git a/core/src/ch/asynk/gdx/board/util/IterableSet.java b/core/src/ch/asynk/gdx/board/util/IterableSet.java deleted file mode 100644 index 7e37f4e..0000000 --- a/core/src/ch/asynk/gdx/board/util/IterableSet.java +++ /dev/null @@ -1,16 +0,0 @@ -package ch.asynk.gdx.board.util; - -public class IterableSet<E> extends IterableArray<E> -{ - public IterableSet(int n) - { - super(n); - } - - @Override public boolean add(E e) - { - if (contains(e)) return false; - super.add(e); - return true; - } -} diff --git a/core/src/ch/asynk/gdx/board/util/IterableStack.java b/core/src/ch/asynk/gdx/board/util/IterableStack.java deleted file mode 100644 index 1365408..0000000 --- a/core/src/ch/asynk/gdx/board/util/IterableStack.java +++ /dev/null @@ -1,26 +0,0 @@ -package ch.asynk.gdx.board.util; - -public class IterableStack<E> extends IterableArray<E> -{ - public IterableStack(int n) - { - super(n); - } - - public void push(E e) - { - add(e); - } - - public E pop() - { - if (size() <= 0) return null; - return remove(size() - 1); - } - - public E getTop() - { - if (size() <= 0) return null; - return get(size() - 1); - } -} |