先来一个通用的ProxyMap。如果不需要重用,这个类可以不用写。主要为了展示Proxy,delegate。
Java代码
public class ProxyMap {
protected Map map;
public ProxyMap(Map map) {
super();
this.map = map;
}
public Map getMap() {
return map;
}
public void clear() {
map.clear();
}
public boolean containsKey(Object key) {
return map.containsKey(key);
}
public boolean containsValue(Object value) {
return map.containsValue(value);
}
public Set entrySet() {
return map.entrySet();
}
public boolean equals(Object o) {
return map.equals(o);
}
public Object get(Object key) {
return map.get(key);
}
public int hashCode() {
return map.hashCode();
}
public boolean isEmpty() {
return map.isEmpty();
}
public Set keySet() {
return map.keySet();
}
public Object put(Object arg0, Object arg1) {
return map.put(arg0, arg1);
}
public void putAll(Map arg0) {
map.putAll(arg0);
}
public Object remove(Object key) {
return map.remove(key);
}
public int size() {
return map.size();
}
public Collection values() {
return map.values();
}
}
public class ProxyMap {
protected Map map;
public ProxyMap(Map map) {
super();
this.map = map;
}
public Map getMap() {
return map;
}
public void clear() {
map.clear();
}
public boolean containsKey(Object key) {
return map.containsKey(key);
}
public boolean containsValue(Object value) {
return map.containsValue(value);
}
public Set entrySet() {
return map.entrySet();
}
public boolean equals(Object o) {
return map.equals(o);
}
public Object get(Object key) {
return map.get(key);
}
public int hashCode() {
return map.hashCode();
}
public boolean isEmpty() {
return map.isEmpty();
}
public Set keySet() {
return map.keySet();
}
public Object put(Object arg0, Object arg1) {
return map.put(arg0, arg1);
}
public void putAll(Map arg0) {
map.putAll(arg0);
}
public Object remove(Object key) {
return map.remove(key);
}
public int size() {
return map.size();
}
public Collection values() {
return map.values();
}
}
--------------------------------
IndexMap 继承 ProxyMap。
如果没有ProxyMap这个类,那么就不用继承。
需要自己实现所有Map的delegate方法。
IndexMap的代码几乎和 fins 给出的一样(就是copy过来的)。
只是可以截获所有的Map。而不只是HashMap。
Java代码
import java.util.ArrayList;
import java.util.List;
import java.util.Map;
public class IndexMap extends ProxyMap{
public IndexMap(Map map) {
super(map);
}
private List list = new ArrayList();
public Object put(Object key, Object value) {
if (!containsKey(key)){
list.add(key);
}
return super.put(key, value);
}
public Object get(int idx){
return super.get(getKey(idx));
}
public int getIndex(Object key){
return list.indexOf(key);
}
public Object getKey(int idx){
if (idx>=list.size()) return null;
return list.get(idx);
}
public void remove(int idx){
Object key=getKey(idx);
removeFromList(getIndex(key));
super.remove(key);
}
public Object remove(Object key) {
removeFromList(getIndex(key));
return super.remove(key);
}
public void clear() {
this.list = new ArrayList();
super.clear();
}
private void removeFromList(int idx){
if (idx<list.size() && idx>=0) {
list.remove(idx);
}
}
}
Java代码
public class ProxyMap {
protected Map map;
public ProxyMap(Map map) {
super();
this.map = map;
}
public Map getMap() {
return map;
}
public void clear() {
map.clear();
}
public boolean containsKey(Object key) {
return map.containsKey(key);
}
public boolean containsValue(Object value) {
return map.containsValue(value);
}
public Set entrySet() {
return map.entrySet();
}
public boolean equals(Object o) {
return map.equals(o);
}
public Object get(Object key) {
return map.get(key);
}
public int hashCode() {
return map.hashCode();
}
public boolean isEmpty() {
return map.isEmpty();
}
public Set keySet() {
return map.keySet();
}
public Object put(Object arg0, Object arg1) {
return map.put(arg0, arg1);
}
public void putAll(Map arg0) {
map.putAll(arg0);
}
public Object remove(Object key) {
return map.remove(key);
}
public int size() {
return map.size();
}
public Collection values() {
return map.values();
}
}
public class ProxyMap {
protected Map map;
public ProxyMap(Map map) {
super();
this.map = map;
}
public Map getMap() {
return map;
}
public void clear() {
map.clear();
}
public boolean containsKey(Object key) {
return map.containsKey(key);
}
public boolean containsValue(Object value) {
return map.containsValue(value);
}
public Set entrySet() {
return map.entrySet();
}
public boolean equals(Object o) {
return map.equals(o);
}
public Object get(Object key) {
return map.get(key);
}
public int hashCode() {
return map.hashCode();
}
public boolean isEmpty() {
return map.isEmpty();
}
public Set keySet() {
return map.keySet();
}
public Object put(Object arg0, Object arg1) {
return map.put(arg0, arg1);
}
public void putAll(Map arg0) {
map.putAll(arg0);
}
public Object remove(Object key) {
return map.remove(key);
}
public int size() {
return map.size();
}
public Collection values() {
return map.values();
}
}
--------------------------------
IndexMap 继承 ProxyMap。
如果没有ProxyMap这个类,那么就不用继承。
需要自己实现所有Map的delegate方法。
IndexMap的代码几乎和 fins 给出的一样(就是copy过来的)。
只是可以截获所有的Map。而不只是HashMap。
Java代码
import java.util.ArrayList;
import java.util.List;
import java.util.Map;
public class IndexMap extends ProxyMap{
public IndexMap(Map map) {
super(map);
}
private List list = new ArrayList();
public Object put(Object key, Object value) {
if (!containsKey(key)){
list.add(key);
}
return super.put(key, value);
}
public Object get(int idx){
return super.get(getKey(idx));
}
public int getIndex(Object key){
return list.indexOf(key);
}
public Object getKey(int idx){
if (idx>=list.size()) return null;
return list.get(idx);
}
public void remove(int idx){
Object key=getKey(idx);
removeFromList(getIndex(key));
super.remove(key);
}
public Object remove(Object key) {
removeFromList(getIndex(key));
return super.remove(key);
}
public void clear() {
this.list = new ArrayList();
super.clear();
}
private void removeFromList(int idx){
if (idx<list.size() && idx>=0) {
list.remove(idx);
}
}
}