Collections.singletonList使用方法

方法注释


应用：
这个方法主要用于只有一个元素的优化，减少内存分配，无需分配额外的内存，可以从SingletonList内部类看得出来,由于只有一个element,因此可以做到内存分配最小化，相比之下ArrayList的DEFAULT_CAPACITY=10个。

rivate static class SingletonList<E>
        extends AbstractList<E>
        implements RandomAccess, Serializable {
   

        private static final long serialVersionUID = 3093736618740652951L;

        private final E element;

        SingletonList(E obj)                {
   element = obj;}

        public Iterator<E> iterator() {
   
            return singletonIterator(element);
        }

        public int size()                   {
   return 1;}

        public boolean contains(Object obj) {
   return eq(obj, element);}

        public E get(int index) {
   
            if (index != 0)
              throw new IndexOutOfBoundsException("Index: "+index+", Size: 1");
            return element;
        }

        // Override default methods for Collection
        @Override
        public void forEach(Consumer<? super E> action) {
   
            action.accept(element);
        }
        @Override
        public boolean removeIf(Predicate<? super E> filter) {
   
            throw new UnsupportedOperationException();
        }
        @Override
        public void replaceAll(UnaryOperator<E> operator) {
   
            throw new UnsupportedOperationException();
        }
        @Override
        public void sort(Comparator<? super E> c) {
   
        }
        @Override
        public Spliterator<E> spliterator() {
   
            return singletonSpliterator