All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.github.becausetesting.collections.ListUtils Maven / Gradle / Ivy

There is a newer version: 1.1.3
Show newest version
/**
 * Project Name:commons
 * File Name:ListUtils.java
 * Package Name:com.github.becausetesting.collections
 * Date:Apr 17, 20168:49:15 PM
 * Copyright (c) 2016, [email protected] All Rights Reserved.
 *
*/

package com.github.becausetesting.collections;

import java.text.Collator;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.LinkedList;
import java.util.List;

/**
 * ClassName:ListUtils  
Collection
├List
│├LinkedList
│├ArrayList
│└Vector
│ └Stack
└Set
Map
├Hashtable
├HashMap
└WeakHashMap
 * @author   Administrator
 * @version  1.0.0
 * @since    JDK 1.8 
 */
public class ListUtils {

	
	public String list2String(List list){
		return list.toString();
	}
	
	public String list2String(List list,String delimiter){
		return String.join(delimiter, list);
	}
	
	public Object[] list2Array(List list){
		return list.toArray();
	}
	
	public List fromArray(String[] arrays){
		return Arrays.asList(arrays);
	}
	
	//sorted list,Collections.sort
	
	/**
	 * sortList: Sorts the specified list into ascending order, 
	 * according to the natural ordering of its elements. 
	 * All elements in the list must implement the Comparable interface. 
	 * Furthermore, all elements in the list must be mutually
	 *  comparable (that is, e1.compareTo(e2) must not throw a ClassCastException 
	 *  for any elements e1 and e2 in the list). 
	 *  default is asc
	 *  http://blog.csdn.net/zxy_snow/article/details/7232035
	 * @author [email protected]
	 * @param list
	 * @since JDK 1.8
	 */
	public void sortList(List list){
		 Collections.sort(list);
		 Collections.sort(list,Collator.getInstance(java.util.Locale.CHINA)); //sort
		 //desc
		 Collections.reverse(list);//
	}
	
	public ArrayList toArrayList(LinkedList list){
		ArrayList arrayList = new ArrayList(list);
		return arrayList;
	}
	/**
	 * linkedList is linked list(chain table),like a stack
	 * add or delete is the same as ArrayList
	 * http://stackoverflow.com/questions/322715/when-to-use-linkedlist-over-arraylist
	 * LinkedList and ArrayList are two different implementations of the List interface.
	 *  LinkedList implements it with a doubly-linked list.
	 *   ArrayList implements it with a dynamically re-sizing array.
	 * 
	 * 
	 * @author [email protected]
	 * @since JDK 1.8
	 */
	private void linkedList(){
		LinkedList linkedList = new LinkedList();
		linkedList.getFirst();
		linkedList.getLast();
		linkedList.add("first");
		linkedList.add("second");
		
		//they all append in the last
	}
	
}





© 2015 - 2025 Weber Informatics LLC | Privacy Policy