hash-B-使用在哈希法存储数据
来源:互联网 发布:c语言ide 轻便 编辑:程序博客网 时间:2024/05/17 06:36
package i_hash.B_hashDouble;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/**
* 使用在哈希法存储数据
*
* @author Administrator
*
*/
public class HashDoubleApp {
public static void main(String[] args) throws NumberFormatException,
IOException {
int size, n, aKey;
DataItem aDataItem;
System.out.print("请指定哈希表的大小: ");
size = getInt();
System.out.print("指定哈希表初始化数据量:");
n = getInt();
HashTable theHashTable = new HashTable(size);
for (int i = 0; i < n; i++) {
aKey = (int) (Math.random() * 2 * size);
aDataItem = new DataItem(aKey);
theHashTable.insert(aKey, aDataItem);
}
while (true) {
System.out.print("请输入第一个字母:");
System.out.println("find,insert,show or delete");
char choice = getChar();
switch (choice) {
case 'i':
System.out.print("请输入要插入的值: ");
aKey = getInt();
aDataItem = new DataItem(aKey);
theHashTable.insert(aKey, aDataItem);
break;
case 's':
theHashTable.display();
break;
case 'f':
System.out.print("请输入要查询的值: ");
aKey = getInt();
aDataItem = theHashTable.find(aKey);
if (aDataItem != null) {
System.out.println("找到值:" + aKey);
} else {
System.out.println("没有找到值:" + aKey);
}
break;
case 'd':
System.out.println("请输入要删除的值:");
aKey = getInt();
theHashTable.delete(aKey);
break;
default:
System.out.println("无效输入!!!");
}
}
}
private static char getChar() throws IOException {
return getString().charAt(0);
}
private static String getString() throws IOException {
return new BufferedReader(new InputStreamReader(System.in)).readLine();
}
private static int getInt() throws NumberFormatException, IOException {
return Integer.parseInt(getString());
}
}package i_hash.B_hashDouble;
public class HashTable {
private DataItem[] hashArray;
private int arraySize;
private DataItem nonItem;
public HashTable(int size) {
arraySize = size;
hashArray = new DataItem[arraySize];
nonItem = new DataItem(-1);
}
public void display() {
System.out.print("Table: ");
for (int i = 0; i < arraySize; i++) {
if (hashArray[i] != null) {
System.out.print(hashArray[i].getKey() + " ");
} else {
System.out.print("** ");
}
}
System.out.println();
}
private int hashFunc1(int key) {
return key % arraySize;
}
private int hashFunc2(int key) {
return 5 - key % 5;
}
public void insert(int key, DataItem item) {
int hashVal = hashFunc1(key);
int stepSize = hashFunc2(key);
while (hashArray[hashVal] != null && hashArray[hashVal].getKey() != -1) {
hashVal += stepSize;
hashVal %= arraySize;
}
hashArray[hashVal] = item;
}
public DataItem delete(int key) {
int hashVal = hashFunc1(key);
int stepSize = hashFunc2(key);
while (hashArray[hashVal] != null) {
if (hashArray[hashVal].getKey() == key) {
DataItem temp = hashArray[hashVal];
hashArray[hashVal] = nonItem;
return temp;
}
hashVal += stepSize;
hashVal %= arraySize;
}
return null;
}
public DataItem find(int key) {
int hashVal = hashFunc1(key);
int stepSize = hashFunc2(key);
while (hashArray[hashVal] != null) {
if (hashArray[hashVal].getKey() == key) {
return hashArray[hashVal];
}
hashVal += stepSize;
hashVal %= arraySize;
}
return null;
}
}package i_hash.B_hashDouble;
public class DataItem {
private int iData;
public DataItem(int iData) {
super();
this.iData = iData;
}
public int getKey(){
return iData;
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/**
* 使用在哈希法存储数据
*
* @author Administrator
*
*/
public class HashDoubleApp {
public static void main(String[] args) throws NumberFormatException,
IOException {
int size, n, aKey;
DataItem aDataItem;
System.out.print("请指定哈希表的大小: ");
size = getInt();
System.out.print("指定哈希表初始化数据量:");
n = getInt();
HashTable theHashTable = new HashTable(size);
for (int i = 0; i < n; i++) {
aKey = (int) (Math.random() * 2 * size);
aDataItem = new DataItem(aKey);
theHashTable.insert(aKey, aDataItem);
}
while (true) {
System.out.print("请输入第一个字母:");
System.out.println("find,insert,show or delete");
char choice = getChar();
switch (choice) {
case 'i':
System.out.print("请输入要插入的值: ");
aKey = getInt();
aDataItem = new DataItem(aKey);
theHashTable.insert(aKey, aDataItem);
break;
case 's':
theHashTable.display();
break;
case 'f':
System.out.print("请输入要查询的值: ");
aKey = getInt();
aDataItem = theHashTable.find(aKey);
if (aDataItem != null) {
System.out.println("找到值:" + aKey);
} else {
System.out.println("没有找到值:" + aKey);
}
break;
case 'd':
System.out.println("请输入要删除的值:");
aKey = getInt();
theHashTable.delete(aKey);
break;
default:
System.out.println("无效输入!!!");
}
}
}
private static char getChar() throws IOException {
return getString().charAt(0);
}
private static String getString() throws IOException {
return new BufferedReader(new InputStreamReader(System.in)).readLine();
}
private static int getInt() throws NumberFormatException, IOException {
return Integer.parseInt(getString());
}
}package i_hash.B_hashDouble;
public class HashTable {
private DataItem[] hashArray;
private int arraySize;
private DataItem nonItem;
public HashTable(int size) {
arraySize = size;
hashArray = new DataItem[arraySize];
nonItem = new DataItem(-1);
}
public void display() {
System.out.print("Table: ");
for (int i = 0; i < arraySize; i++) {
if (hashArray[i] != null) {
System.out.print(hashArray[i].getKey() + " ");
} else {
System.out.print("** ");
}
}
System.out.println();
}
private int hashFunc1(int key) {
return key % arraySize;
}
private int hashFunc2(int key) {
return 5 - key % 5;
}
public void insert(int key, DataItem item) {
int hashVal = hashFunc1(key);
int stepSize = hashFunc2(key);
while (hashArray[hashVal] != null && hashArray[hashVal].getKey() != -1) {
hashVal += stepSize;
hashVal %= arraySize;
}
hashArray[hashVal] = item;
}
public DataItem delete(int key) {
int hashVal = hashFunc1(key);
int stepSize = hashFunc2(key);
while (hashArray[hashVal] != null) {
if (hashArray[hashVal].getKey() == key) {
DataItem temp = hashArray[hashVal];
hashArray[hashVal] = nonItem;
return temp;
}
hashVal += stepSize;
hashVal %= arraySize;
}
return null;
}
public DataItem find(int key) {
int hashVal = hashFunc1(key);
int stepSize = hashFunc2(key);
while (hashArray[hashVal] != null) {
if (hashArray[hashVal].getKey() == key) {
return hashArray[hashVal];
}
hashVal += stepSize;
hashVal %= arraySize;
}
return null;
}
}package i_hash.B_hashDouble;
public class DataItem {
private int iData;
public DataItem(int iData) {
super();
this.iData = iData;
}
public int getKey(){
return iData;
}
}
0 0
- hash-B-使用在哈希法存储数据
- B-Tree数据存储
- ruby on rails 使用text存储hash类型的数据 Use text filed to store the hash map
- 在QT中使用哈希表存储数据
- 存储引擎——Hash存储引擎,B树存储引擎,LSM树存储引擎
- 使用多维数据集在SQLServer2000 中有效存储数据
- hash存储
- ;计算ffff:0~ffff:b单元中的数据,结果存储在dx中
- 在存储过程中使用游标循环表,组织数据
- 使用 PHP 直接在共享内存中存储数据集
- 使用 PHP 直接在共享内存中存储数据集
- 在Android中Preferences数据存储的使用
- 在android中使用SharedPreferences进行数据存储
- 在android中使用SharedPreferences进行数据存储
- 使用 PHP 直接在共享内存中存储数据集
- 使用PHP直接在共享内存中存储数据…
- 使用 PHP 直接在共享内存中存储数据集
- 使用 PHP 直接在共享内存中存储数据集
- Win7还原未知文件打开方式
- Restful更改状态码和返回文字
- hash-A-hash表
- 学习资源整理
- LeetCode:Sum of Two Integers
- hash-B-使用在哈希法存储数据
- Mybatis实战之TypeHandler高级进阶
- storm中fieldsGrouping的分配策略实质
- Mybatis实战之自定义TypeHandler处理枚举
- Github Pages搭建自己写的页面
- hash-c-链地址法
- 排队打水问题(贪心)
- 深度学习框架性能评测(Caffe、CNTK、MXNet、TensorFlow、Torch)
- 北京云端微服科技2017笔试题