Is there a collection class that has LinkedHashMap quality of a predictable iteration order but is indexable at the same time? LinkedHashMap implements the get () method, which returns a value object, but the indexof () method is not available. I would like both.
Thanks.
I have such a thing, Linked Tree Map is free and without restrictions on my site. It looks like what you want.
A SortedMap (ConcurrentSkipListMap, TreeMap) has methods that return subframes of all keys> (or <) of the passed key. So,
index(key) == sortedMap.headMap(key).size();
.
Source: https://habr.com/ru/post/1715007/More articles:Image Noise Filtering - image-processingRemoving an object that has an unloaded child object - c #Why does a library compiled on two slightly different machines behave a little differently? - c ++Sharepoint Branding - Multiple Provisioning Files - sharepointIntercepting requests before moving to a controller in an annotation-based Spring web application - javaHow can I notify the parent page when the popup has completed the download initiated by the parent? - javascriptКак использовать DatePart в запросе на критерии NHibernate - nhibernateWeb page "metadata"? - sharepointLinq2Sql - using a local collection as part of an auxiliary query - "queries with local collections are not supported" - c #Linq2Sql → Database Search in Local Value Collection - "Queries with local collections are not supported" - c #All Articles