lxy/redkale
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

EntityCache优化

Browse Source
This commit is contained in:
redkale
2023-03-29 21:05:18 +08:00
parent 7de19f142f
commit df0a290032
1 changed files with 21 additions and 40 deletions
Download Patch File Download Diff File Expand all files Collapse all files

61
src/main/java/org/redkale/source/EntityCache.java
View File

@@ -186,24 +186,7 @@ public final class EntityCache<T> {
}); });
} }
this.list = all2 == null ? new ConcurrentLinkedQueue() : new ConcurrentLinkedQueue(all2); this.list = all2 == null ? new ConcurrentLinkedQueue() : new ConcurrentLinkedQueue(all2);
if (continuousid && all2 != null && !all2.isEmpty()) { this.array = transferArray(all2);
Collections.sort(all2, (T o1, T o2) -> {
int v1 = o1 == null ? 0 : (Integer) primary.get(o1);
int v2 = o2 == null ? 0 : (Integer) primary.get(o2);
return v1 - v2;
});
if ((Integer) primary.get(all2.get(0)) != 0) {
all2.add(null);
Collections.sort(all2, (T o1, T o2) -> {
int v1 = o1 == null ? 0 : (Integer) primary.get(o1);
int v2 = o2 == null ? 0 : (Integer) primary.get(o2);
return v1 - v2;
});
}
this.array = all2.toArray(arrayer);
} else {
this.array = null;
}
this.map = newmap2; this.map = newmap2;
} catch (Throwable t) { } catch (Throwable t) {
logger.log(Level.SEVERE, type + " schedule(interval=" + interval + "s) Cacheable error", t); logger.log(Level.SEVERE, type + " schedule(interval=" + interval + "s) Cacheable error", t);
@@ -223,24 +206,7 @@ public final class EntityCache<T> {
}); });
} }
this.list = new ConcurrentLinkedQueue(all); this.list = new ConcurrentLinkedQueue(all);
if (continuousid && all != null && !all.isEmpty()) { this.array = transferArray(all);
Collections.sort(all, (T o1, T o2) -> {
int v1 = o1 == null ? 0 : (Integer) primary.get(o1);
int v2 = o2 == null ? 0 : (Integer) primary.get(o2);
return v1 - v2;
});
if ((Integer) primary.get(all.get(0)) != 0) {
all.add(null);
Collections.sort(all, (T o1, T o2) -> {
int v1 = o1 == null ? 0 : (Integer) primary.get(o1);
int v2 = o2 == null ? 0 : (Integer) primary.get(o2);
return v1 - v2;
});
}
this.array = all.toArray(arrayer);
} else {
this.array = null;
}
this.map = newmap; this.map = newmap;
this.fullloaded = true; this.fullloaded = true;
loading.set(false); loading.set(false);
@@ -248,6 +214,24 @@ public final class EntityCache<T> {
return this.loadFuture; return this.loadFuture;
} }
private T[] transferArray(List<T> all) {
if (continuousid && all != null && !all.isEmpty()) {
try {
int maxid = all.stream().mapToInt(v -> v == null ? 0 : (Integer) primary.get(v)).max().orElse(0);
T[] result = arrayer.apply(maxid + 1);
for (T v : all) {
int index = v == null ? 0 : (Integer) primary.get(v);
result[index] = v;
}
return result;
} catch (Exception e) { //主键值可能是负数，导致数组下标异常
return null;
}
} else {
return null;
}
}
public Class<T> getType() { public Class<T> getType() {
return type; return type;
} }
@@ -304,11 +288,8 @@ public final class EntityCache<T> {
return result; return result;
} }
} }
if (continuousid) { if (continuousid && array != null) {
T[] array0 = array; T[] array0 = array;
if (array0 == null) {
return arrayer.apply(pks.length);
}
T[] result = arrayer.apply(pks.length); T[] result = arrayer.apply(pks.length);
if (needCopy) { if (needCopy) {
for (int i = 0; i < result.length; i++) { for (int i = 0; i < result.length; i++) {