Skip to content
项目
群组
代码片段
帮助
正在加载...
帮助
为 GitLab 提交贡献
登录/注册
切换导航
H
h2database
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
分枝图
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
计划
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
分枝图
统计图
创建新议题
作业
提交
议题看板
打开侧边栏
Administrator
h2database
Commits
f6f3a3d8
提交
f6f3a3d8
authored
5月 06, 2018
作者:
Noel Grandin
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
address review comments
上级
c3deabaa
隐藏空白字符变更
内嵌
并排
正在显示
2 个修改的文件
包含
65 行增加
和
64 行删除
+65
-64
Select.java
h2/src/main/org/h2/command/dml/Select.java
+63
-61
ValueHashMap.java
h2/src/main/org/h2/util/ValueHashMap.java
+2
-3
没有找到文件。
h2/src/main/org/h2/command/dml/Select.java
浏览文件 @
f6f3a3d8
...
...
@@ -187,9 +187,7 @@ public class Select extends Query {
public
void
setCurrentGroupExprData
(
Expression
expr
,
Object
obj
)
{
Integer
index
=
exprToIndexInGroupByData
.
get
(
expr
);
if
(
index
!=
null
)
{
if
(
currentGroupByExprData
[
index
]
!=
null
)
{
throw
DbException
.
throwInternalError
();
}
assert
currentGroupByExprData
[
index
]
!=
null
;
currentGroupByExprData
[
index
]
=
obj
;
return
;
}
...
...
@@ -368,73 +366,77 @@ public class Select extends Query {
currentGroupByExprData
=
null
;
currentGroupsKey
=
null
;
exprToIndexInGroupByData
.
clear
();
int
rowNumber
=
0
;
setCurrentRowNumber
(
0
);
ValueArray
defaultGroup
=
ValueArray
.
get
(
new
Value
[
0
]);
int
sampleSize
=
getSampleSizeValue
(
session
);
while
(
topTableFilter
.
next
())
{
setCurrentRowNumber
(
rowNumber
+
1
);
if
(
isConditionMet
())
{
rowNumber
++;
if
(
groupIndex
==
null
)
{
currentGroupsKey
=
defaultGroup
;
}
else
{
Value
[]
keyValues
=
new
Value
[
groupIndex
.
length
];
// update group
for
(
int
i
=
0
;
i
<
groupIndex
.
length
;
i
++)
{
int
idx
=
groupIndex
[
i
];
Expression
expr
=
expressions
.
get
(
idx
);
keyValues
[
i
]
=
expr
.
getValue
(
session
);
try
{
int
rowNumber
=
0
;
setCurrentRowNumber
(
0
);
ValueArray
defaultGroup
=
ValueArray
.
get
(
new
Value
[
0
]);
int
sampleSize
=
getSampleSizeValue
(
session
);
while
(
topTableFilter
.
next
())
{
setCurrentRowNumber
(
rowNumber
+
1
);
if
(
isConditionMet
())
{
rowNumber
++;
if
(
groupIndex
==
null
)
{
currentGroupsKey
=
defaultGroup
;
}
else
{
Value
[]
keyValues
=
new
Value
[
groupIndex
.
length
];
// update group
for
(
int
i
=
0
;
i
<
groupIndex
.
length
;
i
++)
{
int
idx
=
groupIndex
[
i
];
Expression
expr
=
expressions
.
get
(
idx
);
keyValues
[
i
]
=
expr
.
getValue
(
session
);
}
currentGroupsKey
=
ValueArray
.
get
(
keyValues
);
}
Object
[]
values
=
groupByData
.
get
(
currentGroupsKey
);
if
(
values
==
null
)
{
values
=
new
Object
[
Math
.
max
(
exprToIndexInGroupByData
.
size
(),
expressions
.
size
())];
groupByData
.
put
(
currentGroupsKey
,
values
);
}
currentGroupByExprData
=
values
;
currentGroupRowId
++;
for
(
int
i
=
0
;
i
<
columnCount
;
i
++)
{
if
(
groupByExpression
==
null
||
!
groupByExpression
[
i
])
{
Expression
expr
=
expressions
.
get
(
i
);
expr
.
updateAggregate
(
session
);
}
}
if
(
sampleSize
>
0
&&
rowNumber
>=
sampleSize
)
{
break
;
}
currentGroupsKey
=
ValueArray
.
get
(
keyValues
);
}
Object
[]
values
=
groupByData
.
get
(
currentGroupsKey
);
if
(
values
==
null
)
{
values
=
new
Object
[
Math
.
max
(
exprToIndexInGroupByData
.
size
(),
expressions
.
size
())];
groupByData
.
put
(
currentGroupsKey
,
values
);
}
if
(
groupIndex
==
null
&&
groupByData
.
size
()
==
0
)
{
groupByData
.
put
(
defaultGroup
,
new
Object
[
Math
.
max
(
exprToIndexInGroupByData
.
size
(),
expressions
.
size
())]);
}
ArrayList
<
Value
>
keys
=
groupByData
.
keys
();
for
(
Value
v
:
keys
)
{
currentGroupsKey
=
(
ValueArray
)
v
;
currentGroupByExprData
=
groupByData
.
get
(
currentGroupsKey
);
Value
[]
keyValues
=
currentGroupsKey
.
getList
();
Value
[]
row
=
new
Value
[
columnCount
];
for
(
int
j
=
0
;
groupIndex
!=
null
&&
j
<
groupIndex
.
length
;
j
++)
{
row
[
groupIndex
[
j
]]
=
keyValues
[
j
];
}
currentGroupByExprData
=
values
;
currentGroupRowId
++;
for
(
int
i
=
0
;
i
<
columnCount
;
i
++)
{
if
(
groupByExpression
==
null
||
!
groupByExpression
[
i
])
{
Expression
expr
=
expressions
.
get
(
i
);
expr
.
updateAggregate
(
session
);
for
(
int
j
=
0
;
j
<
columnCount
;
j
++)
{
if
(
groupByExpression
!=
null
&&
groupByExpression
[
j
])
{
continue
;
}
Expression
expr
=
expressions
.
get
(
j
);
row
[
j
]
=
expr
.
getValue
(
session
);
}
if
(
sampleSize
>
0
&&
rowNumber
>=
sampleSize
)
{
break
;
}
}
}
if
(
groupIndex
==
null
&&
groupByData
.
size
()
==
0
)
{
groupByData
.
put
(
defaultGroup
,
new
Object
[
Math
.
max
(
exprToIndexInGroupByData
.
size
(),
expressions
.
size
())]);
}
ArrayList
<
Value
>
keys
=
groupByData
.
keys
();
for
(
Value
v
:
keys
)
{
currentGroupsKey
=
(
ValueArray
)
v
;
currentGroupByExprData
=
groupByData
.
get
(
currentGroupsKey
);
Value
[]
keyValues
=
currentGroupsKey
.
getList
();
Value
[]
row
=
new
Value
[
columnCount
];
for
(
int
j
=
0
;
groupIndex
!=
null
&&
j
<
groupIndex
.
length
;
j
++)
{
row
[
groupIndex
[
j
]]
=
keyValues
[
j
];
}
for
(
int
j
=
0
;
j
<
columnCount
;
j
++)
{
if
(
groupByExpression
!=
null
&&
groupByExpression
[
j
])
{
if
(
isHavingNullOrFalse
(
row
))
{
continue
;
}
Expression
expr
=
expressions
.
get
(
j
);
r
ow
[
j
]
=
expr
.
getValue
(
session
);
row
=
keepOnlyDistinct
(
row
,
columnCount
);
r
esult
.
addRow
(
row
);
}
if
(
isHavingNullOrFalse
(
row
))
{
continue
;
}
row
=
keepOnlyDistinct
(
row
,
columnCount
)
;
result
.
addRow
(
row
);
}
finally
{
groupByData
=
null
;
currentGroupsKey
=
null
;
currentGroupByExprData
=
null
;
exprToIndexInGroupByData
.
clear
(
);
}
groupByData
=
null
;
currentGroupsKey
=
null
;
currentGroupByExprData
=
null
;
exprToIndexInGroupByData
.
clear
();
}
/**
...
...
h2/src/main/org/h2/util/ValueHashMap.java
浏览文件 @
f6f3a3d8
...
...
@@ -19,14 +19,13 @@ import org.h2.value.ValueNull;
* <p>
* HashMap in archaic versions of Java have some overhead for allocation of
* entries, but slightly better behaviour with limited number of collisions,
* because collisions have no impact on non-colliding ent
ir
es. HashMap in modern
* because collisions have no impact on non-colliding ent
ri
es. HashMap in modern
* versions of Java also have the same overhead, but it builds a trees of keys
* with colliding hashes, that's why even if the all keys have exactly the same
* hash code it still offers a good performance similar to TreeMap. So
* ValueHashMap is faster in typical cases, but may behave really bad in some
* cases. HashMap is slower in typical cases, but its performance does not
* degrade too much even in the worst possible case (if keys are comparable,
* like our Value class).
* degrade too much even in the worst possible case (if keys are comparable).
*
* @param <V> the value type
*/
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论