📄 inthashtable.java
字号:
/*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program 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 for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
/**
* Title: XELOPES Data Mining Library
* Description: The XELOPES library is an open platform-independent and data-source-independent library for Embedded Data Mining.
* Copyright: Copyright (c) 2002 Prudential Systems Software GmbH
* Company: ZSoft (www.zsoft.ru), Prudsys (www.prudsys.com)
* @author Michael Thess
* @version 1.0
*/
package com.prudsys.pdm.Utils;
import java.util.Hashtable;
/**
* Implementation of a simple hashtable of integers
* derived from java.util.Hashtable.
*
* @author Michael Thess
* @version 1.0, 2001/04/03
*/
public class IntHashtable extends Hashtable {
/**
*
*/
private static final long serialVersionUID = 1082983834750751835L;
public boolean contains(int value)
{ return super.contains(new Integer(value)); }
public boolean containsKey(int key)
{ return super.containsKey(new Integer(key)); }
public Integer get(int key)
{ return (Integer) super.get(new Integer(key)); }
public Object getByInteger(int key)
{ return super.get(new Integer(key)); }
@SuppressWarnings("unchecked")
public Integer put(int key, int value)
{ return (Integer)super.put(new Integer(key), new Integer(value)); }
@SuppressWarnings("unchecked")
public Integer put(int key, Object value)
{ return (Integer)super.put(new Integer(key), value); }
@SuppressWarnings("unchecked")
public Object put(Object key, int value)
{ return super.put(key, new Integer(value)); }
public Integer remove(int key)
{ return (Integer) super.remove(new Integer(key)); }
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -