generated from mate-academy/jv-homework-template
-
Notifications
You must be signed in to change notification settings - Fork 1.4k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
created own ArrayList collection which implements our List interface …
…and uses custom exeption
- Loading branch information
1 parent
97ba460
commit 9a0e309
Showing
1 changed file
with
62 additions
and
9 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,48 +1,101 @@ | ||
package core.basesyntax; | ||
|
||
import java.util.Arrays; | ||
import java.util.NoSuchElementException; | ||
|
||
public class ArrayList<T> implements List<T> { | ||
private static final int DEFAULT_CAPACITY = 10; | ||
private Object[] elements; | ||
private int size; | ||
|
||
public ArrayList() { | ||
this.elements = new Object[DEFAULT_CAPACITY]; | ||
} | ||
|
||
private void ensureCapacity() { | ||
if (size == elements.length) { | ||
int newCapacity = (int) (elements.length * 1.5); | ||
elements = Arrays.copyOf(elements, newCapacity); | ||
} | ||
} | ||
|
||
@Override | ||
public void add(T value) { | ||
|
||
ensureCapacity(); | ||
elements[size++] = value; | ||
} | ||
|
||
@Override | ||
public void add(T value, int index) { | ||
|
||
if (index < 0 || index > size) { | ||
throw new ArrayListIndexOutOfBoundsException("Index: " + index + ", Size: " + size); | ||
} | ||
ensureCapacity(); | ||
System.arraycopy(elements, index, elements, index + 1, size - index); | ||
elements[index] = value; | ||
size++; | ||
} | ||
|
||
@Override | ||
public void addAll(List<T> list) { | ||
|
||
for (int i = 0; i < list.size(); i++) { | ||
add(list.get(i)); | ||
} | ||
} | ||
|
||
@Override | ||
public T get(int index) { | ||
return null; | ||
if (index < 0 || index >= size) { | ||
throw new ArrayListIndexOutOfBoundsException("Index: " + index + ", Size: " + size); | ||
} | ||
return (T) elements[index]; | ||
} | ||
|
||
@Override | ||
public void set(T value, int index) { | ||
|
||
if (index < 0 || index >= size) { | ||
throw new ArrayListIndexOutOfBoundsException("Index: " + index + ", Size: " + size); | ||
} | ||
elements[index] = value; | ||
} | ||
|
||
@Override | ||
public T remove(int index) { | ||
return null; | ||
if (index < 0 || index >= size) { | ||
throw new ArrayListIndexOutOfBoundsException("Index: " + index + ", Size: " + size); | ||
} | ||
T removedValue = (T) elements[index]; | ||
System.arraycopy(elements, index + 1, elements, index, size - index - 1); | ||
elements[--size] = null; | ||
return removedValue; | ||
} | ||
|
||
@Override | ||
public T remove(T element) { | ||
return null; | ||
if (element == null) { | ||
for (int i = 0; i < size; i++) { | ||
if (elements[i] == null) { | ||
return remove(i); | ||
} | ||
} | ||
throw new NoSuchElementException("Element not found"); | ||
} | ||
|
||
for (int i = 0; i < size; i++) { | ||
if (element.equals(elements[i])) { | ||
return remove(i); | ||
} | ||
} | ||
throw new NoSuchElementException("Element not found"); | ||
} | ||
|
||
@Override | ||
public int size() { | ||
return 0; | ||
return size; | ||
} | ||
|
||
@Override | ||
public boolean isEmpty() { | ||
return false; | ||
return size == 0; | ||
} | ||
} |