/*
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you under the Apache License, Version 2.0 (the
 * "License"); you may not use this file except in compliance
 * with the License.  You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package org.apache.cassandra.utils;

import java.util.Comparator;
import java.util.SortedMap;
import java.util.TreeMap;

import com.google.common.collect.SortedSetMultimap;
import com.google.common.collect.TreeMultimap;

public class SortedBiMultiValMap<K, V> extends BiMultiValMap<K, V>
{
    protected SortedBiMultiValMap(SortedMap<K, V> forwardMap, SortedSetMultimap<V, K> reverseMap)
    {
        super(forwardMap, reverseMap);
    }

    public static <K extends Comparable<K>, V extends Comparable<V>> SortedBiMultiValMap<K, V> create()
    {
        return new SortedBiMultiValMap<K, V>(new TreeMap<K,V>(), TreeMultimap.<V, K>create());
    }

    public static <K, V> SortedBiMultiValMap<K, V> create(Comparator<K> keyComparator, Comparator<V> valueComparator)
    {
        if (keyComparator == null)
            keyComparator = defaultComparator();
        if (valueComparator == null)
            valueComparator = defaultComparator();
        return new SortedBiMultiValMap<K, V>(new TreeMap<K,V>(keyComparator), TreeMultimap.<V, K>create(valueComparator, keyComparator));
    }

    public static <K extends Comparable<K>, V extends Comparable<V>> SortedBiMultiValMap<K, V> create(BiMultiValMap<K, V> map)
    {
        SortedBiMultiValMap<K, V> newMap = SortedBiMultiValMap.<K,V>create();
        newMap.forwardMap.putAll(map);
        newMap.reverseMap.putAll(map.inverse());
        return newMap;
    }

    public static <K, V> SortedBiMultiValMap<K, V> create(BiMultiValMap<K, V> map, Comparator<K> keyComparator, Comparator<V> valueComparator)
    {
        SortedBiMultiValMap<K, V> newMap = create(keyComparator, valueComparator);
        newMap.forwardMap.putAll(map);
        newMap.reverseMap.putAll(map.inverse());
        return newMap;
    }

    private static <T> Comparator<T> defaultComparator()
    {
        return new Comparator<T>()
        {
            @SuppressWarnings("unchecked")
            public int compare(T o1, T o2)
            {
                return ((Comparable<T>) o1).compareTo(o2);
            }
        };
    }
}

@@ -836,16 +836,45 @@
 utils;%0A%0A
+import java.util.Collection;%0A
 import j
@@ -1118,16 +1118,154 @@
 K, V%3E%0A%7B%0A
+    @SuppressWarnings(%22unchecked%22)%0A    private static final Comparator DEFAULT_COMPARATOR = (o1, o2) -%3E ((Comparable) o1).compareTo(o2);%0A%0A
     prot
@@ -2282,85 +2282,24 @@
     
-newMap.forwardMap.putAll(map);%0A        newMap.reverseMap.putAll(map.inverse()
+copy(map, newMap
 );%0A 
@@ -2571,397 +2571,587 @@
     
-newMap.forwardMap.putAll(map);%0A        newMap.reverseMap.putAll(map.inverse());%0A        return newMap;%0A    %7D%0A%0A    private static %3CT%3E Comparator%3CT%3E defaultComparator()%0A    %7B%0A        return new Comparator%3CT%3E()%0A        %7B%0A            @SuppressWarnings(%22unchecked%22)%0A            public int compare(T o1, T o2)%0A            %7B
+copy(map, newMap);%0A        return newMap;%0A    %7D%0A%0A    private static %3CK, V%3E void copy(BiMultiValMap%3CK, V%3E map, BiMultiValMap%3CK, V%3E newMap)%0A    %7B%0A        newMap.forwardMap.putAll(map);%0A        // Put each individual TreeSet instead of Multimap#putAll(Multimap) to get linear complexity%0A        // See CASSANDRA-14660%0A        for (Entry%3CV, Collection%3CK%3E%3E entry : map.inverse().asMap().entrySet())%0A            newMap.reverseMap.putAll(entry.getKey(), entry.getValue());
 %0A    
+%7D%0A%0A
     
-        return ((Comparable%3CT%3E) o1).compareTo(o2);%0A 
+@SuppressWarnings(%22unchecked%22)%0A    private static %3CT%3E Comparator%3CT%3E defaultComparator()%0A
    
+ %7B%0A
         
 %7D%0A  
@@ -3150,19 +3150,33 @@
     
-%7D%0A        %7D
+return DEFAULT_COMPARATOR
 ;%0A  

Improve TokenMetaData cache populating performance avoid long locking