Mercurial > hg > truffle
view graal/com.oracle.max.base/src/com/sun/max/collect/ChainingValueChainedHashMapping.java @ 4184:fa6b78681c54
Added copyright check to the gate.
author | Doug Simon <doug.simon@oracle.com> |
---|---|
date | Tue, 03 Jan 2012 12:37:31 +0100 |
parents | e233f5660da4 |
children |
line wrap: on
line source
/* * Copyright (c) 2007, 2011, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. */ package com.sun.max.collect; /** * A chained hash table where the value type also doubles as an {@linkplain ChainedHashMapping.Entry entry} in a chain. * Such tables are more memory efficient than a chained hash table which uses separate objects for keys, values and * buckets. */ public class ChainingValueChainedHashMapping<K, V extends ChainedHashMapping.Entry<K, V>> extends ChainedHashMapping<K, V> { /** * Creates a chained hash table with {@linkplain HashEquality equality} key semantics and whose values double as the * {@linkplain ChainedHashMapping.Entry entry} in a chain. * * @param initialCapacity * the initial capacity of the table */ public ChainingValueChainedHashMapping(int initialCapacity) { super(initialCapacity); } /** * Creates a chained hash table with {@linkplain HashEquality equality} key semantics and an initial capacity of * {@value ChainedHashMapping#DEFAULT_INITIAL_CAPACITY} whose values double as the * {@linkplain ChainedHashMapping.Entry entry} in a chain. */ public ChainingValueChainedHashMapping() { } @Override protected Entry<K, V> createEntry(int hashForKey, K key, V value, Entry<K, V> next) { value.setNext(next); return value; } }