I’ve a Record<Record<PersonTypeAccess>>
. PersonTypeAccess
is an object that has 2 properties: PersonType
and AccessType
. These are each an enum.
If I strive visualizing it, the lists might probably seem like this:
{
{ PersonType = 0, AccessType = 2},
{ PersonType = 5, AccessType = 0},
{ PersonType = 2, AccessType = 1}
},
{
{ PersonType = 6, AccessType = 1},
{ PersonType = 3, AccessType = 0}
},
{
{ PersonType = 3, AccessType = 1},
{ PersonType = 5, AccessType = 0},
{ PersonType = 8, AccessType = -1},
{ PersonType = 0, AccessType = 1}
}
I must create a Dictionary<PersonType, AccessType>
that solely has every PersonType as soon as, mixed with its highest AccessType worth discovered troughout the lists.
For my instance above that will be:
{
PersonType 0 -> AccessType 2,
PersonType 8 -> AccessType -1,
PersonType 5 -> AccessType 0,
PersonType 3 -> AccessType 1,
PersonType 6 -> AccessType 1,
PersonType 2 -> AccessType 1
}
How would I’m going about doing this?