@Override protected Long2ObjectAVLTreeMap<V> create(Kryo kryo, Input input, Class<? extends Long2ObjectAVLTreeMap<V>> type, int size, LongComparator comparator) { return new Long2ObjectAVLTreeMap<V>(comparator); } }
/** * Creates a new consistent hash function with given skip strategy. * * @param skipStrategy a skip strategy, or <code>null</code>. */ public ConsistentHashFunction( final SkipStrategy<T> skipStrategy ) { this( new Long2ObjectAVLTreeMap<Object>(), new Object2IntOpenHashMap<T>(), skipStrategy ); }
/** * Returns a copy of this consistent hash function. * * <p>Note that for this method to work properly, the skip strategy {@linkplain #ConsistentHashFunction(SkipStrategy) provided * at construction time}, if any, must be stateless, as it will be shared by the copy. * * @return a copy of this consistent hash function. */ @SuppressWarnings("unchecked") public ConsistentHashFunction<T> copy() { final Long2ObjectSortedMap<Object> replicaeCopy = new Long2ObjectAVLTreeMap<Object>(); for( Long2ObjectMap.Entry<Object> entry: replicae.long2ObjectEntrySet() ) { final Object value = entry.getValue(); replicaeCopy.put( entry.getLongKey(), value instanceof ObjectAVLTreeSet ? ((ObjectAVLTreeSet<T>)value).clone() : value ); } return new ConsistentHashFunction<T>( replicaeCopy, new Object2IntOpenHashMap<T>( sizes ), skipStrategy ); }
for (Collection<ISubgraph> subgraphBin : alternateSubgraphOrdering) { for (ISubgraph subgraph : subgraphBin) { Long2ObjectMap<RemoteVertexInfo> remoteVertices = new Long2ObjectAVLTreeMap<>();
vertexPropertyValueMap.put(kvp_property.Key(), new Long2ObjectAVLTreeMap<Object>()); edgePropertyValueMap.put(kvp_property.Key(), new Long2ObjectAVLTreeMap<Object>());