I have created a list of objects and have people added to it:
ArrayList<Person> peeps = new ArrayList<Person>();
peeps.add(new Person("112", "John", "Smith"));
peeps.add(new Person("516", "Jane", "Smith"));
peeps.add(new Person("114", "John", "Doe"));
I am trying to figure out how to remove the person from the list by ID number. So if I wanted to remove the person with the ID number 114 but didn't now where it fell in the list, how would I?
Using Java8:
peeps.removeIf(p -> p.getId().equals("112"));
Note that this is equivalent to linear search and will take O(n) time. If this operation will be repeated frequently it is recommended to use a HashMap in order to speed things up to O(1).
Alternatively using a sorted list would also do the trick, but require O(log n) time.
If you are going to be using an ArrayList, the the only way is to go through the entire list, looking at each person, and seeing it their id number is 114. For larger datasets, this is not going to efficient and should be avoided.
If you can change your data structure, then some sort of Map would be better (HashMap is typically a good choice). You could have the id number as a "key" and then associate it with each person. Later you can query the Map by key. The con is you can only have one value as a key, so you can't have say both name and id number keys
Edit:
An more efficient way to do use an ArrayList would be to keep it sorted by id number. Then you can use something like Collections.binarySearch() to quickly access the elements by id number. The con is is that it is expensive to remove from/insert into a sorted array, as everything greater the element has to be moved. So if you are going to be doing relatively few changes compared to the number of reads, this might be viable
There are many ways to tackle this.
CollectionUtils.select(peeps, new Predicate<Person>() {
@Override
public boolean evaluate(Person object) {
return object.getId().equals("114");
}
});
Iterator<Person> iterator = peeps.iterator();
while(iterator.hasNext()) {
Person next = iterator.next();
if(next.getId().equals("114")) {
iterator.remove();
}
}
iterate in the ArrayList elements and remove the ones which match the string you want to remove: The Iterator remove operations is safe and does not create a ConcurrentModificationException
for (Iterator<String> iterator = peeps.iterator(); elementToCheck = iterator.next();) {
if (elementToCheck.getId().equals("112")) {
// Remove the current element from the iterator and the list.
iterator.remove();
}
}
You first need to have a working equals in your Person class (which you should). Then you can just use List#indexOf and List#remove. For example:
final Person toRemove = new Person("112");
peeps.remove(peeps.indexOf(toRemove));
(assuming the Person ID is unique).
Alternatively if your list is an ArrayList you can use ArrayList#remove(Object):
final Person toRemove = new Person("112");
peeps.remove(toRemove);
If you're using Java 8, you can use Paul's solution.
if you want to search for string then should use .equals
String query;
ArrayList<String> list;
for(int i=0; i < list.size();i++)
if (list.get(i).equals(query)){
list.remove(i);
break;
}
class Processor{
ArrayList<Person> peeps = new ArrayList<Person>();
void setPeeps(){
peeps.add(new Person(112, "John", "Smith"));
peeps.add(new Person(516, "Jane", "Smith"));
peeps.add(new Person(114, "John", "Doe"));
}
void removePerson(int id){
for(int i=0; i <= peeps.size(); i++){
Person person = peeps.get(i);
if(person.id == id)
peeps.remove(peeps.get(i));
}
}
void displayPersonsList(){
for(Person person : peeps){
System.out.println(person.id + ":" + person.fName + ":" + person.lName);
}
}
public static void main(String args[]){
Processor objProcessor = new Processor();
objProcessor.setPeeps();
objProcessor.removePerson(114);
objProcessor.displayPersonsList();
}
}
class Person{
int id;
String fName;
String lName;
public Person(int id, String fName, String lName){
this.id = id;
this.fName = fName;
this.lName = lName;
}
}
Map, not aList.Map<String, Person>