Better design pattern to compare two lists

Question

i need a suggestion for the scenario noted below :

Contents in List A : string name , byte[] ,etc

Contents in List B : string name.

i have two collections and i need to iterate the List A with List B and check in a sequence if name from List B == name from List A .

for this i do a while loop with the sequence lengths and if /else loop for decision making if name matches or not.

i have to take decisions and other processing things for each match/unmatch item in list , also the two lists are not guaranteed of same size

is there any better way to avoid loops and if/else?

There is an `Intersect` method from `System.Linq`, have a look at existing thread [Intersect Two Lists in C#](https://stackoverflow.com/questions/7187996/intersect-two-lists-in-c-sharp) — Pavel Anikhouski, Jan 04 '20 at 12:06
Are you looking for a way to make the code more concise or more efficient? — Paul, Jan 04 '20 at 13:03

score 0 · Answer 1 · answered Jan 04 '20 at 12:11

0

You could use the Zip function of Enumerable after building a projection:

ListA.Select(a => a.name).Zip(ListB, (a, b) => a == b)

at the end you have a list of booleans and you could use Any to find if all items match:

ListA.Select(a => a.name).Zip(ListB, (a, b) => a == b).Where(r => r).Any()

answered Jan 04 '20 at 12:11

ema

i have to take decisions and other processing for each match/unmatch item in list , also the two lists are not guaranteed of same size – Keshav Raghav Jan 04 '20 at 12:38

score 0 · Answer 2 · answered Jan 04 '20 at 14:45

0

Using dictionary will solve performance issue.

answered Jan 04 '20 at 14:45

Arun Kola

2 Answers2