AfflictionNetworks/depot
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Let's note what we're doing here.

Browse Source
This commit is contained in:
Par Winzell
2007-08-27 16:22:46 +00:00
parent 8081e7bfad
commit 45a03ed42d
1 changed files with 2 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/java/com/samskivert/jdbc/depot/FindAllQuery.java
+2
View File
@@ -114,6 +114,7 @@ public abstract class FindAllQuery<T extends PersistentRecord>
SQLExpression condition; SQLExpression condition;
if (_marsh.getPrimaryKeyFields().length == 1) { if (_marsh.getPrimaryKeyFields().length == 1) {
// Single-column keys result in the compact IN(keyVal1, keyVal2, ...)
Comparable[] keyFieldValues = new Comparable[fetchKeys.size()]; Comparable[] keyFieldValues = new Comparable[fetchKeys.size()];
for (int ii = 0; ii < keyFieldValues.length; ii ++) { for (int ii = 0; ii < keyFieldValues.length; ii ++) {
keyFieldValues[ii] = fetchKeys.get(ii).condition.getValues()[0]; keyFieldValues[ii] = fetchKeys.get(ii).condition.getValues()[0];
@@ -121,6 +122,7 @@ public abstract class FindAllQuery<T extends PersistentRecord>
condition = new In(_type, _marsh.getPrimaryKeyFields()[0], keyFieldValues); condition = new In(_type, _marsh.getPrimaryKeyFields()[0], keyFieldValues);
} else { } else {
// Multi-column keys result in OR'd AND's, of unknown efficiency (TODO check).
SQLExpression[] keyArray = new SQLExpression[fetchKeys.size()]; SQLExpression[] keyArray = new SQLExpression[fetchKeys.size()];
for (int ii = 0; ii < keyArray.length; ii ++) { for (int ii = 0; ii < keyArray.length; ii ++) {
keyArray[ii] = fetchKeys.get(ii).condition; keyArray[ii] = fetchKeys.get(ii).condition;