The best way to transform int[] to List in Java?

Question

Possible Duplicate:
How to create ArrayList (ArrayList<T>) from array (T[]) in Java

How to implement this method:

List<Integer> toList(int[] integers) {
    ???
    //return Arrays.asList(integers); doesn't work
}

Is there a reason for the second part of this question, before I edit it out? — DJClayworth, Jul 08 '11 at 16:20
@DJClayworth: I think, no. I've already flagged the question and explaned that I met some difficulties during submitting this question. — Roman, Jul 08 '11 at 16:21
@Merlyn: Not a duplicate. Primitive arrays are different from Object arrays — Alexander Pogrebnyak, Jul 08 '11 at 16:32
@Alexander: Wow. That's gross :) I can't rescind my vote, so I'll just delete my comment. — Merlyn Morgan-Graham, Jul 08 '11 at 16:36
Instead of being a duplicate of the given question, this is a duplicate of https://stackoverflow.com/q/1073919/1108305. — M. Justin, Jun 14 '23 at 04:40

Dan Tao · Accepted Answer · 2011-07-08T17:38:33.650

There's probably a built-in method to do it somewhere* (as you note, Arrays.asList won't work as it expects an Integer[] rather than an int[]).

I don't know the Java libraries well enough to tell you where that is. But writing your own is quite simple:

public static List<Integer> createList(int[] array) {
    List<Integer> list = new ArrayList<Integer>(array.length);
    for (int i = 0; i < array.length; ++i) {
        list.add(array[i]);
    }
    return list;
}

Obviously one downside of this is that you can't do it generically. You'll have to write a separate createList method for each autoboxed primitive type you want.

_{*And if there isn't, I really wonder why not.}

For efficiency's sake, i might recommend `new ArrayList(array.length)`. Should keep Java from having to resize the collection to add elements. — cHao, Jul 08 '11 at 17:13

score 2 · Answer 2 · edited Dec 08 '11 at 14:16

2

List<Integer> asList(final int[] integers) {
    return new AbstractList<Integer>() {
        public Integer get(int index) {
            return integers[index];
        }

        public int size() {
            return integers.length;
        }
    };
}

edited Dec 08 '11 at 14:16

ordnungswidrig

3,140
1
18
29

answered Jul 08 '11 at 16:27

Christoffer Hammarström

27,242
4
49
58

1

There are a couple of big issues: (1) the list is backed by the array -- that is, if the array elements change, the list elements will too. (2) For larger ints, you'll get back a different Integer each time -- that is, you can not have any expectation of reference equality. Either of those might or might not be an issue, but they're semi-surprising behavior. Before i add (3), can Java actually do closures like that? – cHao Jul 08 '11 at 16:42
@cHao: 3. Yes, Java can do closures like that! – Alexander Pogrebnyak Jul 08 '11 at 16:45
1

Technically this should then be named **as** List, at least when assuming that Java follows the same naming convention as .NET in this regard (*as* providing a differently-typed view on the same collection while *to* actually doing a conversion). – Joey Jul 08 '11 at 16:51
2

These are not closures. They are anonymous classes. – Senthess Jul 08 '11 at 16:57
Just to add one more thing: whenever you are accessing this `List`, conversion from _`int` to `Integer`_ happens which is very slow. Don't do what this answer is recommending – Op De Cirkel Jul 08 '11 at 16:58
@Senthess: It's an anonymous class with methods that refer to a local variable from the context it's created in. That's pretty much the definition of a closure, at least in the way Java could do it. – cHao Jul 08 '11 at 17:01
invoking `addAll(...)` on such a list and then `get(...)` would result in odd behavior since `get(...)` only is able to access the numbers from the `int[]`. In short: although it looks neat, I wouldn't recommend doing it like this. – Bart Kiers Jul 08 '11 at 17:11
I remember when I saw this for the first time in Java. It's kind of sad, actually: they decided to do *big*-time support for anonymous classes, allowing you to implement an entire interface on the fly. But it involves so much typing that doing simple stuff like a one-line C#-style lambda isn't possible. – Dan Tao Jul 08 '11 at 17:12
@Op De Cirkel: That depends on the use. This will be faster if not all Integers in the list are accessed. And in most cases the performance difference will be too small to matter anyway. – Christoffer Hammarström Jul 10 '11 at 15:47
@cHao: That it's backed by the array is a much a feature as an issue. It depends on the use. – Christoffer Hammarström Jul 10 '11 at 15:58
@Bart Kiers: This list does not support `addAll()`, since `AbstractList#set(int, Integer)` is not overridden, so no, it would not result in odd behaviour. The behaviour is well-defined. That the list should be modifiable wasn't a requirement, and it might be considered a feature that it's not, depending on the use. – Christoffer Hammarström Jul 10 '11 at 15:58
Also, `AbstractList#add(int, Integer)` – Christoffer Hammarström Jul 10 '11 at 16:06
1

@Christoffer, ah, yes, then there's no problem: I thought `add(...)` was implemented in `AbstractList`. My bad, thanks for the info! – Bart Kiers Jul 10 '11 at 16:30

Op De Cirkel · Answer 3 · 2011-07-08T17:11:15.687

2

Use commons-lang3 org.apache.commons.lang3.ArrayUtils.toObject(<yout int array>) and then java.util.Arrays.asList(<>)

ArrayUtils.toObject() will copy the array, and Array.asList() will simply create list that is backed by new array.

int[] a = {1, 2, 3};
List<Integer> aI = Arrays.asList(ArrayUtils.toObject(a));

EDIT: This wont work if you want to add() new elements (resize) though the list interface, if you want to be able to add new elements, you can use new ArrayList(), but this will create one more copy.

edited Jul 08 '11 at 17:11

answered Jul 08 '11 at 16:41

Op De Cirkel

28,647
6
40
53

You can do it directly with `List xValues = Arrays.asList(new Integer[] { 150, 160, 175, 165, 165 });` – Alexander Pacha Jan 14 '13 at 21:23
@AlexanderPacha Definitely, it works with an `Integer[]` literal, but not with an existing `int[]`. It can not be placed in the method skeleton from the OP. – Dávid Horváth Nov 13 '18 at 09:35

score 1 · Answer 4 · answered Jul 08 '11 at 16:26

List<Integer> toList(int[] integers) {
    // Initialize result's size to length of the incoming array
    // this way it will not require reallocations
    ArrayList<Integer> result = new ArrayList<Integer>( integers.length );

    for ( int cur: integers )
    {
        result.add( Integer.valueOf( cur ) );
    }

    return result;
}

score 0 · Answer 5 · answered Jul 08 '11 at 16:27

0

I do not think there is a quick way to do it unfortunately. I believe you will have to iterate the array and add it one by one.

answered Jul 08 '11 at 16:27

Oscar Gomez

18,436
13
85
118

score 0 · Answer 6 · answered Jul 08 '11 at 16:44

import java.util.Arrays;
import java.util.ArrayList;
import java.util.List;

public class Listing {
  public static void main(String[] args) {

   int[] integers = {1,2,3,4};

   java.util.List<Integer> list = new ArrayList<Integer>();
  for (int i=0; i< integers.length; i++)
  {
      list.add(integers[i]);
  }
  System.out.println(list);
}
}

Tested and working as expected!

The best way to transform int[] to List in Java?

6 Answers6