Code refactoring.

Author: suoapvs

src/main/java/com/yurii/salimov/lesson08/task05/MyArrayList.java

@@ -84,16 +84,16 @@ public T get(final int index) {
     @Override
     public T set(final int index, final T object) {
         checkIndex(index);
-        T value = (T) this.elementData[index];
+        final T value = (T) this.elementData[index];
         this.elementData[index] = object;
         return value;
     }
 
     @Override
     public T remove(final int index) {
         checkIndex(index);
-        T value = (T) this.elementData[index];
-        int numMoved = this.size - index - 1;
+        final T value = (T) this.elementData[index];
+        final int numMoved = this.size - index - 1;
         System.arraycopy(this.elementData, index + 1, this.elementData, index, numMoved);
         this.elementData[--this.size] = null;
         return value;
@@ -197,7 +197,7 @@ public boolean equals(final Object object) {
         if (this.getClass() != object.getClass()) {
             return false;
         }
-        MyArrayList other = (MyArrayList) object;
+        final MyArrayList other = (MyArrayList) object;
         if (this.size != other.size) {
             return false;
         }
@@ -216,7 +216,7 @@ public int hashCode() {
 
     private void ensureCapacity(final int minCapacity) throws IndexOutOfBoundsException {
         if (minCapacity > this.elementData.length) {
-            Object[] oldData = new Object[this.size];
+            final Object[] oldData = new Object[this.size];
             System.arraycopy(this.elementData, 0, oldData, 0, this.size);
             int newCapacity = this.size * 3 / 2 + 1;
             this.elementData = new Object[newCapacity];