java中数据库类_Java中简单的类似数据库的集合类

我认为你可以用以下两个类来实现你所需要的.虽然它确实涉及两个地图,但它们不会暴露给外部世界,因此不应该让它们失去同步.至于两次存储相同的“事实”,我认为你不会在任何有效的实现中解决这个问题,无论事实是在这里显式地存储两次,还是隐含在数据库创建索引时在2个表上使连接更有效.您可以向magicset添加新内容,它将更新两个映射,或者您可以向magicmapper添加内容,然后将自动更新反向地图.女朋友现在叫我睡觉所以我不能通过编译器运行它 – 它应该足以让你开始.你想解决什么难题？

public class MagicSet {

private Map forward;

private R r;

private Set set;

public MagicSet(Map forward, R r) {

this.forward = map;

this.r = r;

this.set = new HashSet();

}

public void add(L l) {

set.add(l);

forward.put(l,r);

}

public void remove(L l) {

set.remove(l);

forward.remove(l);

}

public int size() {

return set.size();

}

public in contains(L l){

return set.contains(l);

}

// caution, do not use the remove method from this iterator. if this class was going

// to be reused often you would want to return a wrapped iterator that handled the remove method properly. In fact, if you did that, i think you could then extend AbstractSet and MagicSet would then fully implement java.util.Set.

public Iterator iterator() {

return set.iterator();

}

}

public class MagicMapper { // note that it doesn't implement Map, though it could with some extra work. I don't get the impression you need that though.

private Map forward;

private Map> inverse;

public MagicMapper() {

forward = new HashMap;

inverse = new HashMap>;

}

public R getForward(L key) {

return forward.get(key);

}

public Set getBackward(R key) {

return inverse.get(key); // this assumes you want a null if

// you try to use a key that has no mapping. otherwise you'd return a blank MagicSet

}

public void put (L l, R r) {

R oldVal = forward.get(l);

// if the L had already belonged to an R, we need to undo that mapping

MagicSet oldSet = inverse.get(oldVal);

if (oldSet != null) {oldSet.remove(l);}

// now get the set the R belongs to, and add it.

MagicSet newSet = inverse.get(l);

if (newSet == null) {

newSet = new MagicSet(forward, r);

inverse.put(r,newSet);

}

newSet.add(l); // magically updates the "forward" map

}

}