zoukankan      html  css  js  c++  java
  • How to implement an ArrayList structure in Java

    List implementations in Java

    This article describes how to implement a list data structure in Java.

    The implementations in this articles are for demonstration and education purpose. They do not try to be as efficient as the standard libraries and they are not intended to be an replacement for the standard Java libraries structures.

     

    1. List

    The following example is contained in the project called de.vogella.datastructures.list.

    List represents a data structure which allows to dynamically add, access and remove objects of the same type. Adding objects to the list is usually done via the add() method. The get(int i) method allows to retrieve the element at position i.

    package de.vogella.datastructures.list;
    
    import java.util.Arrays;
    
    public class MyList<E> {
      private int size = 0;
      private static final int DEFAULT_CAPACITY = 10;
      private Object elements[];
      
      public MyList() {
        elements = new Object[DEFAULT_CAPACITY];
      }
    
      public void add(E e) {
        if (size == elements.length) {
          ensureCapa();
        }  
        elements[size++] = e;
      }
     
    
      private void ensureCapa() {
        int newSize = elements.length * 2;
        elements = Arrays.copyOf(elements, newSize);
      }
    
      @SuppressWarnings("unchecked")
      public E get(int i) {
        if (i>= size || i <0) {
          throw new IndexOutOfBoundsException("Index: " + i + ", Size " + i);
        }
        return (E) elements[i];
      }
    }
     
    

      

    The following show contains a small JUnit test for the data structure. I use in the first test the MyList implementation and in the second test the standard Java List implementation.

    package de.vogella.datastructures.list;
    import java.util.ArrayList;
    import java.util.List;
    
    import org.junit.Test;
    
    import static org.junit.Assert.assertTrue;
    
    public class MyListTest {
    
    
      @Test(expected=IndexOutOfBoundsException.class)
      public void testMyList() {
        MyList<Integer> list = new MyList<Integer>();
        list.add(1);
        list.add(2);
        list.add(3);
        list.add(3);
        list.add(4);
        assertTrue(4 == list.get(4));
        assertTrue(2 == list.get(1));
        assertTrue(3 == list.get(2));
        
        list.get(6);
      }
      
    
      @Test(expected=IndexOutOfBoundsException.class)
      public void testNegative() {
        MyList<Integer> list = new MyList<Integer>();
        list.add(1);
        list.add(2);
        list.add(3);
        list.add(3);
        list.add(4);
        list.get(-1);
      }
    
      @Test(expected=IndexOutOfBoundsException.class)
      public void testList() {
        List<Integer> list = new ArrayList<Integer>();
        list.add(1);
        list.add(2);
        list.add(3);
        list.add(3);
        list.add(4);
        assertTrue(4 == list.get(4));
        assertTrue(2 == list.get(1));
        assertTrue(3 == list.get(2));
        
        list.get(6);
      }
      
      
      
    } 
     
    
     
    

      

    Tip

     You typically also have the remove(int i) method to remove the element at position i but I leave this implementation for the reader. To delete elements in your list just shift all elements after position i one position to the left and decrease size.
  • 相关阅读:
    腾讯一面有感(移动开发岗位)
    kafka 在java中的使用
    Kafka史上最详细原理总结下
    java jdk原生的http请求工具类
    kafka(一)
    MySQL:互联网公司常用分库分表方案汇总
    密码正则
    springboot 打war包
    oracle存储过程的一些使用
    对象的深度克隆
  • 原文地址:https://www.cnblogs.com/hephec/p/4579647.html
Copyright © 2011-2022 走看看