ExternalVendorCode/corda
1
0
Fork 0
mirror of https://github.com/corda/corda.git synced 2025-06-13 04:38:19 +00:00
Code Issues Actions 2 Packages Projects Releases Wiki Activity

sketch of serialization/deserialization code (broken)

Browse Source
This commit is contained in:
Joel Dice
2007-08-12 15:01:47 -06:00
parent d3931b4853
commit 92ba1880d8
5 changed files with 500 additions and 22 deletions
Download Patch File Download Diff File Expand all files Collapse all files

38
classpath/java/util/HashMap.java
View File

@ -3,17 +3,17 @@ package java.util;
public class HashMap<K, V> implements Map<K, V> {
private int size;
private Cell[] array;
private final CellFactory factory;
private final Helper helper;
HashMap(int capacity, CellFactory<K, V> factory) {
HashMap(int capacity, Helper<K, V> helper) {
if (capacity > 0) {
array = new Cell[nextPowerOfTwo(capacity)];
}
this.factory = factory;
this.helper = helper;
}
public HashMap(int capacity) {
this(capacity, new MyCellFactory());
this(capacity, new MyHelper());
}
public HashMap() {
@ -30,14 +30,6 @@ public class HashMap<K, V> implements Map<K, V> {
return size;
}
private static int hash(Object a) {
return (a == null ? 0 : a.hashCode());
}
private static boolean equal(Object a, Object b) {
return (a == null && b == null) || (a != null && a.equals(b));
}
private void resize() {
if (array == null || size >= array.length * 2) {
resize(array == null ? 16 : array.length * 2);
@ -115,7 +107,7 @@ public class HashMap<K, V> implements Map<K, V> {
private Cell<K, V> putCell(K key, V value) {
Cell<K, V> c = find(key);
if (c == null) {
insert(factory.make(key, value, null));
insert(helper.make(key, value, null));
} else {
V old = c.getValue();
c.setValue(value);
@ -196,11 +188,15 @@ public class HashMap<K, V> implements Map<K, V> {
public void setNext(HashMap.Cell<K, V> next);
}
interface CellFactory<K, V> {
interface Helper<K, V> {
public Cell<K, V> make(K key, V value, Cell<K, V> next);
public int hash(K key);
public boolean equal(K a, K b);
}
private static class MyCell<K, V> implements Cell<K, V> {
private class MyCell<K, V> implements Cell<K, V> {
public final K key;
public V value;
public Cell<K, V> next;
@ -232,14 +228,22 @@ public class HashMap<K, V> implements Map<K, V> {
}
public int hashCode() {
return (key == null ? 0 : key.hashCode());
return helper.hash(key);
}
}
private static class MyCellFactory<K, V> implements CellFactory<K, V> {
static class MyHelper<K, V> implements Helper<K, V> {
public Cell<K, V> make(K key, V value, Cell<K, V> next) {
return new MyCell(key, value, next);
}
public int hash(K a) {
return (a == null ? 0 : a.hashCode());
}
public boolean equal(K a, K b) {
return (a == null && b == null) || (a != null && a.equals(b));
}
}
private class EntrySet implements Set<Entry<K, V>> {