Hello guys! We all know about a Collection named ArrayList. You can find this class in java. This class belongs to the package “package java.util;”. We can store any kind of values inside this class and can sort, reverse accordingly. But you will face a problem while sorting with respect to any class with the help of comparator. In that case you are sorting with “Collections” class like “Collections.sort(myList,new Comparator)”. There might be an exception called “ConcurrentModificationException”, this happens because of the “Iterator” class. This “Iterator” class used to add or remove any data of the collection. Now, you have a question that you are not adding or removing any kind of data of that collection and you are not using “Iterator” class either then why are you going to face this exception? Yes! my friend the main problem is the method “sort()”, which belongs to the “Collections” class. In this method when you are sorting the collection the method converts the collection to “Array” then sort that collection, in this instance “Iterator” class is being used.<\/p>\n
package java.util;<\/p>\n
public static <T> void sort(List<T> list, Comparator<? super T> c) {<\/p>\n
\/\/ BEGIN Android-changed: Compat behavior for apps targeting APIs <= 25.<\/p>\n
\/\/ list.sort(c);<\/p>\n
int targetSdkVersion = VMRuntime.getRuntime().getTargetSdkVersion();<\/p>\n
if (targetSdkVersion > 25) {<\/p>\n
list.sort(c);<\/p>\n
} else {<\/p>\n
\/\/ Compatibility behavior for API <= 25. http:\/\/b\/33482884<\/p>\n
if (list.getClass() == ArrayList.class) {<\/p>\n
Arrays.sort((T[]) ((ArrayList) list).elementData, 0, list.size(), c);<\/p>\n
return;<\/p>\n
}<\/p>\n
Object[] a = list.toArray();<\/p>\n
Arrays.sort(a, (Comparator) c);<\/p>\n
ListIterator<T> i = list.listIterator();<\/p>\n
for (int j = 0; j < a.length; j++) {<\/p>\n
i.next();<\/p>\n
i.set((T) a[j]);<\/p>\n
}<\/p>\n
}<\/p>\n
\/\/ END Android-changed: Compat behavior for apps targeting APIs <= 25.<\/p>\n
}<\/p>\n
So, now you need to handle this exception. But that is almost untouchable because it’s an inner class. So, how can you solve this? yes, you’re in right place now. There is another collection named “CopyOnWriteArrayList”, it belongs to package “package java.util.concurrent;”, this class also implements “List<>” like “ArrayList<>”. So, you won’t face any problem of casting. Now your question is what it does? what’s the difference? yes, there is a difference, this class has its own sort() method, which doesn’t use “Iterator” class. So, In this way, you can avoid “ConcurrentModificationException”. Your code will run smoothly.<\/p>\n
package java.util.concurrent;<\/p>\n
public void sort(Comparator<? super E> c) {<\/p>\n
synchronized (lock) {<\/p>\n
Object[] elements = getArray();<\/p>\n
Object[] newElements = Arrays.copyOf(elements, elements.length);<\/p>\n
@SuppressWarnings(“unchecked”) E[] es = (E[])newElements;<\/p>\n
Arrays.sort(es, c);<\/p>\n
setArray(newElements);<\/p>\n
}<\/p>\n
}<\/p>\n","protected":false},"excerpt":{"rendered":"
Hello guys! We all know about a Collection named ArrayList. You can find this class in java. This class belongs to the package “package java.util;”. We can store any kind of values inside this class and can sort, reverse accordingly. But you will face a problem while sorting with respect to any class with the […]<\/p>\n","protected":false},"author":26,"featured_media":1545,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[94,72,5],"tags":[95,73,107],"yoast_head":"\n