views:

394

answers:

6

In .NET, both array and list have Enumerable as ancestor, so a method that accept Enumerable as an argument can receive both array and list as its argument. I wonder if there is a similar thing in Java?

A: 

Both derive from java.lang.Object. However, this isn't collection-related, which I think is what you're looking for.

Brian Agnew
+2  A: 

Array and List in Java do not share a common ancestor other than java.lang.Object.

Both can be accessed using the foreach loop, like so:

String [] array = new String [] { "foo", "bar", "baz", };
List<String> list = Arrays.asList( "x", "y", "z");

for (String s : array)
    System.out.println(s);

for (String s : list)
    System.out.println(s);
duffymo
Getting my languages confused - been reading C# lately.
duffymo
+3  A: 

The big picture of Java Collections classes: http://falkhausen.org/en/diagram/html/java.util.Collection.html http://falkhausen.org/en/diagram/html/java.util.Collection.html

darlinton
Does this really answer the OP's question?
kdgregory
The question is not clear about what kind of arrays and list are considered. ArrayList is an implementation of the List type, so List could be its ancestor. Looking at the diagram it is clear. If you think about a super type for all kinds of collections in Java, it is clear that is the Collection class. But if the question is about the primitive array type and List so I think @duffymo answer is the best. When you look at the big picture - that is not so big - it is easy to see the relationship between these classes.
darlinton
+4  A: 

No, there's no equivalent in Java. I would generally suggest that you design API methods to receive List<T>, Collection<T> or Iterable<T>. While these preclude directly calling the method with an array, you can wrap an array very easily using Arrays.asList. This is more flexible for the caller than specifying an array as a method parameter, which forces a single implementation.

I agree it's not ideal though.

Note that in .NET, single-dimensional arrays don't just implement IEnumerable<T> - they implement IList<T> as well.

Jon Skeet
+2  A: 

They don't have a common ancestor, however, there are methods to cast between the two types as needed -

So you could provide an overloaded method to cast to a common type - i.e.

public void doAll(MyType[] array) {
    doAll(Arrays.asList(array));
}

public void doAll(List<MyType> list) {
    //... process List here.
}
Nate
+1  A: 

Basically, arrays have an implicit type that is a subclass of object. See Arrays in the JLS:

   public static void main(String[] args) {
            int[] ia = new int[3];
            System.out.println(ia.getClass());
            System.out.println(ia.getClass().getSuperclass());
   }

   > class [I
   > class java.lang.Object

The way arrays and lists are handled is also not the same when we consider covariance/contravariance.

List<Object> l = new ArrayList<String>(); // complain 
Object[] l2 = new String[1]; // ok

l2[0] = 4; // throw ArrayStoreException.

It gets even worse if we consider generics, but that's another topic. All in all, I don't know the rationale of this design, but we need to live with it.

ewernli