JAVA getitemlist,Java 8 Stream在列表中查找元素

I have the following class:

public class Item {

int id;

String name;

// few other fields, contructor, getters and setters

}

I have a list of Items. I want to iterate through the list and find the instance which has a particular id. I'm trying to do it through streams.

public void foobar() {

List items = getItemList();

List ids = getIdsToLookup();

int id, i = ids.size() - 1;

while (i >= 0) {

id = ids.get(i);

Optional item = items

.stream()

.filter(a -> a.getId() == id)

.findFirst();

// do stuff

i--;

}

}

Is this the best way to iterate over the list and get the element I need? Also, I get an error on the filter line for id which says variables used in lambda expressions must be final or effectively final. Maybe I can define id inside the while loop, that should get rid of the exception. Thanks.

解决方案

If you have lots of ids to search, it's recommended to use a solution which does it in a single pass rather than doing a linear search for each id:

Map> map=ids.stream()

.collect(Collectors.toMap(id -> id, id -> Optional.empty()));

items.forEach(item ->

map.computeIfPresent(item.getId(), (i,o)->o.isPresent()? o: Optional.of(item)));

for(ListIterator it=ids.listIterator(ids.size()); it.hasPrevious();) {

map.get(it.previous()).ifPresent(item -> {

// do stuff

});

}

The first statement simply create a map out of the ids list, mapping each search id to an empty Optional.

The second statement iterates over the items using forEach and for each item, it checks whether there’s a mapping from its id to an empty Optional and will replace it with an Optional encapsulating the item, if there is such a mapping, all in one operation, computeIfPresent.

The last for loop iterates backwards over the ids list, as you wished to process them in that order and perform the action if there’s a non-empty Optional. Since the map was initialized with all ids found in the list, get will never return null, it will return an empty Optional, if the id was not found in the items list.

That way, assuming that the Map’s lookup has O(1) time complexity, which is the case in typical implementations, the net time complexity changed from O(m×n) to O(m+n)…