Starting with Spring 4.3, @Autowired can inject lists and maps and the given code in the question would work: That said, as of 4.3, collection/map and array types can be matched through Spring’s @Autowired type matching algorithm as well, as long as the element type information is preserved in @Bean return type signatures or collection … Read more
I would do this with Guava as follows: Ordering<Map.Entry<Key, Value>> entryOrdering = Ordering.from(valueComparator) .onResultOf(new Function<Entry<Key, Value>, Value>() { public Value apply(Entry<Key, Value> entry) { return entry.getValue(); } }).reverse(); // Desired entries in desired order. Put them in an ImmutableMap in this order. ImmutableMap.Builder<Key, Value> builder = ImmutableMap.builder(); for (Entry<Key, Value> entry : entryOrdering.sortedCopy(map.entrySet())) { builder.put(entry.getKey(), … Read more
I checked on internet for various polygon area formulas(or code) but did not find any one good or easy to implement. Now I have written the code snippet to calculate area of a polygon drawn on earth surface. The polygon can have n vertices with each vertex has having its own latitude longitude. Few Important … Read more
This might do the trick: apply Lloyd’s algorithm to get k centroids. Sort the centroids by descending size of their associated clusters in an array. For i = 1 through k-1, push the data points in cluster i with minimal distance to any other centroid j (i < j ≤ k) off to j and … Read more
You can use the Google Collections API for that, recently renamed to Guava, specifically a BiMap A bimap (or “bidirectional map”) is a map that preserves the uniqueness of its values as well as that of its keys. This constraint enables bimaps to support an “inverse view”, which is another bimap containing the same entries … Read more
I had this problem and solved it by the following 2 steps: 1) Put the following line in the application (important) element of AndroidManifest.xml file. <uses-library android:name=”com.google.android.maps” /> 2) extend MapActivity instead of Activity. enjoy!
Oh! One other option: since you’re looking for close correspondences between two sorted lists, you could go through them both simultaneously, using a merge-like algorithm. This should be O(max(length(xm), length(xn)))-ish. match_for_xn = zeros(length(xn), 1); last_M = 1; for N = 1:length(xn) % search through M until we find a match. for M = last_M:length(xm) dist_to_curr … Read more
Why don’t you use CLLocations distanceFromLocation: method? It will tell you the precise distance between the receiver and another CLLocation. CLLocation *locationA = [[CLLocation alloc] initWithLatitude:12.123456 longitude:12.123456]; CLLocation *locationB = [[CLLocation alloc] initWithLatitude:21.654321 longitude:21.654321]; CLLocationDistance distanceInMeters = [locationA distanceFromLocation:locationB]; // CLLocation is aka double [locationA release]; [locationB release]; It’s as easy as that.
Not strictly an answer to your question, but have you considered using a List instead? List<Map<String,Integer>> maps = new ArrayList<Map<String,Integer>>(); … maps.add(new HashMap<String,Integer>()); seems to work just fine. See Java theory and practice: Generics gotchas for a detailed explanation of why mixing arrays with generics is discouraged. Update: As mentioned by Drew in the comments, … Read more
As long as the map is not a multimap, one of the most elegant ways would be to use the count method if (m.count(key)) // key exists The count would be 1 if the element is indeed present in the map.