NamedValueSet efficiency


I have a set of hex values corresponding to a set of buttons on a mixer. The values may go as high as 607 (dec), but there are only about 350 buttons. I have a list of 70 of these values, corresponding to midi messages those specific buttons will send. I'm thinking about reading the list into an Array, where the index corresponds to the button value. This however means potetially an array of 607 indexes.

So I was thinking of using a NamedValueSet instead, thus only needing 70 "indexes".

What would be the best way to do this?


Sorry if this is a newbie question!





HashMap :-)