Remove object from ArrayList with some Object property

Using Java-8 Collection#removeIf

myList.removeIf(obj -> obj.id == 10);

With Java-7 you'll have to use iterator:

for(Iterator<MyType> iterator = myList.iterator(); iterator.hasNext(); ) {
    if(iterator.next().id == 10)
        iterator.remove();
}

Note that list iteration is necessary in any case. In Java-8 removeIf method it's just performed internally.

Maybe I don't understand the question but why nobody suggested to use override equals and hashcode for that user class?

class MyObject {
    final String id;
    final String name;

    MyObject(String id, String name) {
        this.id = id;
        this.name = name;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;
        return Objects.equals(id, ((MyObject) o).id);
    }

    @Override
    public int hashCode() {
        return id != null ? id.hashCode() : 0;
    }

    @Override
    public String toString() {
        return "MyObject{id='" + id + "', name='" + name + "'}";
    }
}

in this case you can easy remove any object from list

        final ArrayList<MyObject> list = new ArrayList<>();
        list.add(new MyObject("id1", "name1"));
        list.add(new MyObject("id2", "name2"));
        list.add(new MyObject("id3", "name3"));

        MyObject removeCandidate = new MyObject("id2", "name2");

        list.remove(removeCandidate);
        System.out.println(list);

code above prints

[MyObject{id='id1', name='name1'}, MyObject{id='id3', name='name3'}]

If you really do not want to iterate over the list, you could use a stream but I personnally prefer Collection#removeIf like @TagirValeev suggested

myList = myList.stream()
               .filter(x -> x.id() != 10)
               .collect(Collectors.toList());

It is not possible¹ to remove instances of an element from an ArrayList without iterating the list in some way². The ArrayList is an array under the hood, and you need to examine each element in the array to see whether it matches the criteria for removal. At the fundamental level, that entails a loop ... to iterate over the elements.

Also note that when you remove a single element from an array, all elements with positions after the removed elements need to be moved. On average, that will be half of the array elements.

Now, you can code these operations in ways that avoid you using an explicit for loop, but the iteration will be happening behind the scenes, no matter how you code it.

^{1 - Not strictly true. Hypothetically, if you had a separate data structure that (for instance) mapped values to the indexes of elements in the ArrayList, then you could remove the elements without iterating. But I can't see how you could manage that data structure efficiently.}

^{2 - Iteration doesn't just mean using an Iterator. For loops, Stream, Collections.removeIf and other solutions all entail iterating the elements of the list under the hood.}

You could not do that without iterator, you should you Hashmap for this.

public class ObjectStructure{
private int Id;
private String name;
//and any data field you need
}

generate all setters and getters.

Use this class in

Hashmap<Integer, ObjectStructure> data = new HashMap<>();

you can add and delete data with only key which is Integer.

data.remove(10);