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

AbstractDataSqlSource

Browse Source
This commit is contained in:
redkale
2024-01-06 19:58:16 +08:00
parent a34bc80f19
commit a7f1ef2c3b
1 changed files with 2 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
src/main/java/org/redkale/source/AbstractDataSqlSource.java
View File

@@ -3075,10 +3075,8 @@ public abstract class AbstractDataSqlSource extends AbstractDataSource implement
return new LinkedHashMap<>(); return new LinkedHashMap<>();
} }
final EntityInfo<T> info = loadEntityInfo(clazz); final EntityInfo<T> info = loadEntityInfo(clazz);
final ArrayList<K> ids = new ArrayList<>();
keyStream.forEach(k -> ids.add(k));
final Attribute<T, Serializable> primary = info.getPrimary(); final Attribute<T, Serializable> primary = info.getPrimary();
List<T> rs = queryList(clazz, FilterNodes.in(primary.field(), ids)); List<T> rs = queryList(clazz, FilterNodes.in(primary.field(), keyStream));
Map<K, T> map = new LinkedHashMap<>(); Map<K, T> map = new LinkedHashMap<>();
if (rs.isEmpty()) { if (rs.isEmpty()) {
return new LinkedHashMap<>(); return new LinkedHashMap<>();
@@ -3095,10 +3093,8 @@ public abstract class AbstractDataSqlSource extends AbstractDataSource implement
return CompletableFuture.completedFuture(new LinkedHashMap<>()); return CompletableFuture.completedFuture(new LinkedHashMap<>());
} }
final EntityInfo<T> info = loadEntityInfo(clazz); final EntityInfo<T> info = loadEntityInfo(clazz);
final ArrayList<K> pks = new ArrayList<>();
keyStream.forEach(k -> pks.add(k));
final Attribute<T, Serializable> primary = info.getPrimary(); final Attribute<T, Serializable> primary = info.getPrimary();
return queryListAsync(clazz, FilterNodes.in(primary.field(), pks)).thenApply((List<T> rs) -> { return queryListAsync(clazz, FilterNodes.in(primary.field(), keyStream)).thenApply((List<T> rs) -> {
Map<K, T> map = new LinkedHashMap<>(); Map<K, T> map = new LinkedHashMap<>();
if (rs.isEmpty()) { if (rs.isEmpty()) {
return new LinkedHashMap<>(); return new LinkedHashMap<>();