/*
* (non-Javadoc)
* @see com.lexst.db.view.View#getChunkIds()
*/
@Override
public Set<Long> getChunkIds() {
Set<Long> all = new TreeSet<Long>();
for (IdentitySet set : mapSet.values()) {
all.addAll(set.keySet());
}
return all;
}
/*
* (non-Javadoc)
* @see com.lexst.db.view.View#add(com.lexst.util.host.SiteHost, com.lexst.db.sign.range.SignRange)
*/
@Override
public boolean add(SiteHost host, IndexRange index) {
if (index.getClass() != ShortIndexRange.class) {
throw new ClassCastException("not small index");
}
ShortIndexRange idx = (ShortIndexRange) index;
short begin = idx.getBegin();
short end = idx.getEnd();
ShortRange range = new ShortRange(begin, end);
long chunkId = idx.getChunkId();
IdentitySet set = mapSet.get(range);
if (set == null) {
set = new IdentitySet();
mapSet.put(range, set);
}
return set.add(host, chunkId);
}
/*
* (non-Javadoc)
* @see com.lexst.db.view.View#remove(com.lexst.util.host.SiteHost)
*/
@Override
public int remove(SiteHost host) {
int size = mapSet.size();
if (size == 0) return size;
int count = 0;
ArrayList<ShortRange> a = new ArrayList<ShortRange>(size);
for (ShortRange range : mapSet.keySet()) {
IdentitySet set = mapSet.get(range);
if (set != null) {
count += set.remove(host);
if (set.isEmpty()) a.add(range);
} else {
a.add(range);
}
}
for (ShortRange range : a) {
mapSet.remove(range);
}
return count;
}
/*
* (non-Javadoc)
* @see com.lexst.db.view.View#remove(com.lexst.util.host.SiteHost, long)
*/
@Override
public int remove(SiteHost host, long chunkId) {
int size = mapSet.size();
if (size == 0) return 0;
int count = 0;
ArrayList<ShortRange> a = new ArrayList<ShortRange>(size);
for (ShortRange range : mapSet.keySet()) {
IdentitySet set = mapSet.get(range);
if (set != null) {
boolean success = set.remove(host, chunkId);
if (success) count++;
if (set.isEmpty()) a.add(range);
} else {
a.add(range);
}
}
for (ShortRange range : a) {
mapSet.remove(range);
}
return count;
}
/*
* (non-Javadoc)
* @see com.lexst.db.view.View#delete(com.lexst.util.host.SiteHost)
*/
@Override
public List<Long> delete(SiteHost host) {
int size = mapSet.size();
if (size == 0) return null;
ArrayList<Long> array = new ArrayList<Long>(256);
ArrayList<ShortRange> a = new ArrayList<ShortRange>(size);
for (ShortRange range : mapSet.keySet()) {
IdentitySet set = mapSet.get(range);
if (set != null) {
set.remove(host, array);
if (set.isEmpty()) a.add(range);
} else {
a.add(range);
}
}
for (ShortRange range : a) {
mapSet.remove(range);
}
return array;
}
/*
* (non-Javadoc)
* @see com.lexst.db.view.View#find(com.lexst.db.statement.Condition)
*/
@Override
public Set<Long> find(Condition condi) {
IndexColumn num = condi.getValue();
if (num == null || num.getClass() != ShortIndex.class) {
throw new IllegalArgumentException("null pointer or invalid index!");
}
short value = ((ShortIndex) num).getValue();
// 找到范围分片截止点
HashSet<Long> all = new HashSet<Long>(1024);
// 列名在左,参数值在右(固定!, 检查可以的范围)
switch (condi.getCompare()) {
case Condition.EQUAL:
for (ShortRange range : mapSet.keySet()) {
if (range.inside(value)) {
IdentitySet set = mapSet.get(range);
all.addAll(set.keySet());
}
}
break;
case Condition.NOT_EQUAL:
for (ShortRange range : mapSet.keySet()) {
if (range.getBegin() != value || range.getEnd() != value) {
IdentitySet set = mapSet.get(range);
all.addAll(set.keySet());
}
}
break;
case Condition.LESS:
for (ShortRange range : mapSet.keySet()) {
if (range.getBegin() < value || range.getEnd() < value) {
IdentitySet set = mapSet.get(range);
all.addAll(set.keySet());
}
}
break;
case Condition.LESS_EQUAL:
for (ShortRange range : mapSet.keySet()) {
if (range.getBegin() <= value || range.getEnd() <= value) {
IdentitySet set = mapSet.get(range);
all.addAll(set.keySet());
}
}
break;
case Condition.GREATER:
for (ShortRange range : mapSet.keySet()) {
if (range.getBegin() > value || range.getEnd() > value) {
IdentitySet set = mapSet.get(range);
all.addAll(set.keySet());
}
}
break;
case Condition.GREATER_EQUAL:
for (ShortRange range : mapSet.keySet()) {
if (range.getBegin() >= value || range.getEnd() >= value) {
IdentitySet set = mapSet.get(range);
all.addAll(set.keySet());
}
}
break;
case Condition.LIKE:
for (IdentitySet set : mapSet.values()) {
all.addAll(set.keySet());
}
break;
}
return all;
}