锐客网

  1. 首页 > 睿知 > it技术 > >

javahash代码 java hardcode

IT技术区间

java HashMap代码HashMap是Map接口javahash代码的实现
public class HashMapK,V
extends AbstractMapK,V
implements MapK,V, Cloneable, Serializable
{
static final int DEFAULT_INITIAL_CAPACITY = 16;
static final int MAXIMUM_CAPACITY = 130;
static final float DEFAULT_LOAD_FACTOR = 0.75f;
transient Entry[] table;
transient int size;
【javahash代码 java hardcode】int threshold;
final float loadFactor;
transient volatile int modCount;
public HashMap(int initialCapacity, float loadFactor) {
if (initialCapacity0)
throw new IllegalArgumentException("Illegal initial capacity: "
initialCapacity);
if (initialCapacityMAXIMUM_CAPACITY)
initialCapacity = MAXIMUM_CAPACITY;
if (loadFactor = 0 || Float.isNaN(loadFactor))
throw new IllegalArgumentException("Illegal load factor: "
loadFactor);
int capacity = 1;
while (capacityinitialCapacity)
capacity = 1;
this.loadFactor = loadFactor;
threshold = (int)(capacity * loadFactor);
table = new Entry[capacity];
init();
}
public HashMap(int initialCapacity) {
this(initialCapacity, DEFAULT_LOAD_FACTOR);
}
public HashMap() {
this.loadFactor = DEFAULT_LOAD_FACTOR;
threshold = (int)(DEFAULT_INITIAL_CAPACITY * DEFAULT_LOAD_FACTOR);
table = new Entry[DEFAULT_INITIAL_CAPACITY];
init();
}
public HashMap(Map? extends K, ? extends V m) {
this(Math.max((int) (m.size() / DEFAULT_LOAD_FACTOR) 1,
DEFAULT_INITIAL_CAPACITY), DEFAULT_LOAD_FACTOR);
putAllForCreate(m);
}
....
一下省略 --~
java代码实现hashmap的插入 ， 删除一个对象，并将value值放入数组中，并获取数据显示出来import java.util.HashMap;
import java.util.Iterator;
import java.util.Set;
public class TestHm {
public static void main(String atgs[]){
HashMap hm=new HashMap();
//添加内容
hm.put("Object key1", "Object value");
hm.put("Object key2", "Object value");
hm.put("Object key3", "Object value");
hm.put("Object key4", "Object value");
//删除Object key3
hm.remove("Object key3");
//创建数组,声明i作为数组下标
String s[]=new String[hm.size()];
int i=0;
//显示内容
Set set=hm.keySet();
Iterator it=set.iterator();
while(it.hasNext()){
String t=(String)it.next();
System.out.println(t);
s[i++]=t;
}
//测试数组是否添加值
System.out.println("===================");
for(int t=0;t=2;t++)
System.out.println(s[t]);
}
}
急求java代码 利用两个hashmap存入姓和名，然后拆分 ， 遍历排序，急求java大神啊package com.synchronize.test;import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Map.Entry;
public class Demo {
public static void fileRead(String filePath)
{
try {
String encoding="gbk";
File file=new File(filePath);
//判断是否是文本 并且路径是否存在
if(file.isFile()file.exists())
{
//获取读取字节流
InputStreamReader read=new InputStreamReader(new FileInputStream(file),encoding);
//将输入字节流包装成输入字符流
BufferedReader bufferedReader = new BufferedReader(read);
String lineTxt = null;
//按行读取
while((lineTxt = bufferedReader.readLine()) != null){
String[] split = lineTxt.split(",");
//将姓存入到map中
HashMapString, StringsurName=new HashMap();
for(int i=0;isplit.length;i++)
{
String substring = split[i].substring(0,1);

推荐阅读


上一篇：满洲里商城开发小程序，满洲里购物中心怎么样

下一篇：包含皮皮虾什么梗视频的词条