Java/Data Structures/HashMap/HashMap.java at master · QBUGER/Java · GitHub

History

283 lines (239 loc) · 6.28 KB

Raw

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

261

262

263

264

265

266

267

268

269

270

271

272

273

274

275

276

277

278

279

280

281

282

283

<<<<<<< HEAD:Data Structures/HashMap/HashMap.java

import java.util.ArrayList;

import java.util.LinkedList;

public class HashMap<K,V> {

public class hmnodes{ //HashMap nodes

K key;

V value;

}

private int size=0; //size of hashmap

private LinkedList<hmnodes> buckets[]; //array of addresses of list

public HashMap(){

buckets=new LinkedList[4]; //initially create bucket of any size

for(int i=0;i<4;i++)

buckets[i]=new LinkedList<>();

}

public void put(K key,V value) throws Exception{

int bi=bucketIndex(key); //find the index,the new key will be inserted in linklist at that index

int fountAt=find(bi,key); //check if key already exists or not

if(fountAt==-1){

hmnodes temp=new hmnodes(); //if doesn't exist create new node and insert

temp.key=key;

temp.value=value;

buckets[bi].addLast(temp);

this.size++;

}else{

buckets[bi].get(fountAt).value=value;//if already exist modify the value

}

double lambda = (this.size*1.0)/this.buckets.length;

if(lambda>2.0){

rehash(); //rehashing function which will increase the size of bucket as soon as lambda exceeds 2.0

}

return;

}

public V get(K key) throws Exception{

int bi=bucketIndex(key);

int fountAt=find(bi,key);

if(fountAt==-1){

return null;

}else{

return buckets[bi].get(fountAt).value;

}

public V remove(K key) throws Exception{

int bi=bucketIndex(key);

int fountAt=find(bi,key);

if(fountAt==-1){

return null;

}else{

this.size--;

return buckets[bi].remove(fountAt).value;

}

public boolean containskey(K key) throws Exception{

int bi=bucketIndex(key);

int fountAt=find(bi,key);

if(fountAt==-1){

return false;

}else{

return true;

}

public int size(){

return this.size;

}

public boolean isempty(){

return this.size==0;

}

public ArrayList<K> keyset() throws Exception{

ArrayList<K> arr=new ArrayList<>();

for(int i=0;i<buckets.length;i++){

for(int j=0;j<buckets[i].size();j++){

arr.add(buckets[i].get(j).key);

}

return arr;

}

public ArrayList<V> valueset() throws Exception{

ArrayList<V> arr=new ArrayList<>();

for(int i=0;i<buckets.length;i++){

for(int j=0;j<buckets[i].size();j++){

arr.add(buckets[i].get(j).value);

}

return arr;

}

public void display() throws Exception{

for(int i=0;i<buckets.length;i++){

System.out.print("Bucket: "+i+" ");

for(int j=0;j<buckets[i].size();j++){

hmnodes temp=buckets[i].get(j);

System.out.print("["+temp.key+"->"+temp.value+"]");

}

System.out.println();

}

public int find(int bi,K key) throws Exception{

for(int i=0;i<buckets[bi].size();i++){

if(key.equals(buckets[bi].get(i).key))

return i;

}

return -1;

}

public int bucketIndex(K key) throws Exception{

int bi=key.hashCode();

return Math.abs(bi%buckets.length);

}

private void rehash() throws Exception{

LinkedList<hmnodes> ob[]= buckets;

buckets=new LinkedList[ob.length*2];

for(int i=0;i<ob.length*2;i++)

buckets[i]=new LinkedList<>();

size = 0;

for(int i=0;i<ob.length;i++){

for(int j=0;j<ob[i].size();j++){

put(ob[i].get(j).key,ob[i].get(j).value);

}

=======

import java.util.ArrayList;

import java.util.LinkedList;

public class HashMap<K,V> {

public class hmnodes{ //HashMap nodes

K key;

V value;

}

private int size=0; //size of hashmap

private LinkedList<hmnodes> buckets[]; //array of addresses of list

public HashMap(){

buckets=new LinkedList[4]; //initially create bucket of any size

for(int i=0;i<4;i++)

buckets[i]=new LinkedList<>();

}

public void put(K key,V value) throws Exception{

int bi=bucketIndex(key); //find the index,the new key will be inserted in linklist at that index

int fountAt=find(bi,key); //check if key already exists or not

if(fountAt==-1){

hmnodes temp=new hmnodes(); //if doesn't exist create new node and insert

temp.key=key;

temp.value=value;

buckets[bi].addLast(temp);

this.size++;

}else{

buckets[bi].get(fountAt).value=value;//if already exist modify the value

}

double lambda = (this.size*1.0)/this.buckets.length;

if(lambda>2.0){

rehash(); //rehashing function which will increase the size of bucket as soon as lambda exceeds 2.0

}

return;

}

public V get(K key) throws Exception{

int bi=bucketIndex(key);

int fountAt=find(bi,key);

if(fountAt==-1){

return null;

}else{

return buckets[bi].get(fountAt).value;

}

public V remove(K key) throws Exception{

int bi=bucketIndex(key);

int fountAt=find(bi,key);

if(fountAt==-1){

return null;

}else{

this.size--;

return buckets[bi].remove(fountAt).value;

}

public boolean containskey(K key) throws Exception{

int bi=bucketIndex(key);

int fountAt=find(bi,key);

if(fountAt==-1){

return false;

}else{

return true;

}

public int size(){

return this.size;

}

public boolean isempty(){

return this.size==0;

}

public ArrayList<K> keyset() throws Exception{

ArrayList<K> arr=new ArrayList<>();

for(int i=0;i<buckets.length;i++){

for(int j=0;j<buckets[i].size();j++){

arr.add(buckets[i].get(j).key);

}

return arr;

}

public ArrayList<V> valueset() throws Exception{

ArrayList<V> arr=new ArrayList<>();

for(int i=0;i<buckets.length;i++){

for(int j=0;j<buckets[i].size();j++){

arr.add(buckets[i].get(j).value);

}

return arr;

}

public void display() throws Exception{

for(int i=0;i<buckets.length;i++){

System.out.print("Bucket: "+i+" ");

for(int j=0;j<buckets[i].size();j++){

hmnodes temp=buckets[i].get(j);

System.out.print("["+temp.key+"->"+temp.value+"]");

}

System.out.println();

}

public int find(int bi,K key) throws Exception{

for(int i=0;i<buckets[bi].size();i++){

if(key.equals(buckets[bi].get(i).key))

return i;

}

return -1;

}

public int bucketIndex(K key) throws Exception{

int bi=key.hashCode();

return Math.abs(bi%buckets.length);

}

private void rehash() throws Exception{

LinkedList<hmnodes> ob[]= buckets;

buckets=new LinkedList[ob.length*2];

for(int i=0;i<ob.length*2;i++)

buckets[i]=new LinkedList<>();

size = 0;

for(int i=0;i<ob.length;i++){

for(int j=0;j<ob[i].size();j++){

put(ob[i].get(j).key,ob[i].get(j).value);

}

>>>>>>> 7e3a8c55c865471a33f6932a022a1059c5243fc3:data_structures/HashMap/HashMap.java

Java/Data Structures/HashMap/HashMap.java at master · QBUGER/Java · GitHub

Expand file tree

Breadcrumbs

HashMap.java

Latest commit

History

Breadcrumbs

HashMap.java

File metadata and controls