Bdtjtk

Consider the following code:

final Set<String> allPaths = new HashSet<String>();

for (final String path: paths) {

        allPaths.add(path);

}

final MyData d = new MyData(new ArrayList<String>(allPaths));

MyData is some class I should not touch. It should get an ArrayList as an argument. Before this day, we used that way because we didn't care about the order, that is why we used Set (so there will not be duplicated). But now, I would like to keep the order of the elements, so after some research, I found out that I can use the data structure LinkedHashSet in order to do so. So I did:

final LinkedHashSet<String> allPaths = new LinkedHashSet<String>();

for (final String path: paths) {

        allPaths .add(path);

}

final MyData d = new MyData(new ArrayList<String>(allPaths));

Problem is, I'm not sure how to convert LinkedHashSet to ArrayList. Also, I thought of using ArrayList instead of LinkedHashSet so I won't have to convert it, but I'll have to iterate over the array (O(n)).

What good, clean and effiect way should I use?

Just use the public boolean addAll(Collection<? extends E> c) method, on the arrayList, it accepts any Collection.

You have your LinkedHashSet:

final LinkedHashSet<String> allPaths = new LinkedHashSet<String>();

for (final String path: paths) {

        allPaths .add(path);

}

and then do (you can use this even if mylist is not empty):

List<String> myList = new ArrayList<>();

mylist.addAll(allPaths);

or for even a simpler approach:

List<String> myList = new ArrayList<>(allPaths);

Why dont you just convert your paths to an LinkedHashSet like that (assuming that paths is a Collection?

final MyData d = new MyData(new ArrayList<>(new LinkedHashSet<>(paths)));

In case paths is an array, you can use Arrays.asList(paths) inside the conversion above

@TTaJTa4 you can use the code below as an example. Both ways are fine.







import java.util.ArrayList;

import java.util.LinkedHashSet;

import java.util.Set;



public class ConvertLinkedHashSetToArrayList

{



  public static void main(String args)

  {

    Set<String> testStrings = new LinkedHashSet<>();

    testStrings.add("String 1");

    testStrings.add("String 2");

    testStrings.add("String 3");

    testStrings.add("String 4");

    testStrings.add("String 5");



    System.out.println("** Printing LinkedHashSet: " + testStrings);

    ArrayList<String> linkedHashSetToArrayList1 = new ArrayList<>(testStrings);

    System.out.println("** Printing linkedHashSetToArrayList1:" + 

    linkedHashSetToArrayList1);



    ArrayList<String> linkedHashSetToArrayList2 = new ArrayList<>();

    linkedHashSetToArrayList2.addAll(testStrings);

    System.out.println("** Printing linkedHashSetToArrayList2:" + 

    linkedHashSetToArrayList2);

  }

}

Results are like:

** Printing LinkedHashSet: [String 1, String 2, String 3, String 4, String 5]

** Printing linkedHashSetToArrayList1:[String 1, String 2, String 3, String 4, String 5]

** Printing linkedHashSetToArrayList2:[String 1, String 2, String 3, String 4, String 5]

Follow the GitHub link for the full java project:
GitHub example

If paths is a collection you can get an array list no duplicates:

ArrayList<String> p = paths.stream().distinct().collect(Collectors.toCollection(ArrayList::new));

If paths is an array:

ArrayList<String> p = Stream.of(paths).distinct().collect(Collectors.toCollection(ArrayList::new));