Skip to content
项目
群组
代码片段
帮助
正在加载...
帮助
为 GitLab 提交贡献
登录/注册
切换导航
H
h2database
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
分枝图
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
计划
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
分枝图
统计图
创建新议题
作业
提交
议题看板
打开侧边栏
Administrator
h2database
Commits
eed8f2ba
提交
eed8f2ba
authored
11月 17, 2016
作者:
Noel Grandin
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Optimise LIKE queries for the common cases of '%Foo' and '%Foo%'
上级
fe535f21
显示空白字符变更
内嵌
并排
正在显示
2 个修改的文件
包含
69 行增加
和
5 行删除
+69
-5
changelog.html
h2/src/docsrc/html/changelog.html
+2
-0
CompareLike.java
h2/src/main/org/h2/expression/CompareLike.java
+67
-5
没有找到文件。
h2/src/docsrc/html/changelog.html
浏览文件 @
eed8f2ba
...
@@ -21,6 +21,8 @@ Change Log
...
@@ -21,6 +21,8 @@ Change Log
<h2>
Next Version (unreleased)
</h2>
<h2>
Next Version (unreleased)
</h2>
<ul>
<ul>
<li>
Optimise LIKE queries for the common cases of '%Foo' and '%Foo%'
</li>
<li>
Issue #387: H2 MSSQL Compatibility Mode - Support uniqueidentifier
<li>
Issue #387: H2 MSSQL Compatibility Mode - Support uniqueidentifier
</li>
</li>
<li>
Issue #401: NPE in "SELECT DISTINCT * ORDER BY"
<li>
Issue #401: NPE in "SELECT DISTINCT * ORDER BY"
...
...
h2/src/main/org/h2/expression/CompareLike.java
浏览文件 @
eed8f2ba
...
@@ -49,6 +49,10 @@ public class CompareLike extends Condition {
...
@@ -49,6 +49,10 @@ public class CompareLike extends Condition {
private
boolean
invalidPattern
;
private
boolean
invalidPattern
;
/** indicates that we can shortcut the comparison and use startsWith */
/** indicates that we can shortcut the comparison and use startsWith */
private
boolean
shortcutToStartsWith
;
private
boolean
shortcutToStartsWith
;
/** indicates that we can shortcut the comparison and use endsWith */
private
boolean
shortcutToEndsWith
;
/** indicates that we can shortcut the comparison and use contains */
private
boolean
shortcutToContains
;
public
CompareLike
(
Database
db
,
Expression
left
,
Expression
right
,
public
CompareLike
(
Database
db
,
Expression
left
,
Expression
right
,
Expression
escape
,
boolean
regexp
)
{
Expression
escape
,
boolean
regexp
)
{
...
@@ -179,12 +183,14 @@ public class CompareLike extends Condition {
...
@@ -179,12 +183,14 @@ public class CompareLike extends Condition {
return
;
return
;
}
}
String
p
=
right
.
getValue
(
session
).
getString
();
String
p
=
right
.
getValue
(
session
).
getString
();
if
(!
isInit
)
{
Value
e
=
escape
==
null
?
null
:
escape
.
getValue
(
session
);
Value
e
=
escape
==
null
?
null
:
escape
.
getValue
(
session
);
if
(
e
==
ValueNull
.
INSTANCE
)
{
if
(
e
==
ValueNull
.
INSTANCE
)
{
// should already be optimized
// should already be optimized
DbException
.
throwInternalError
();
DbException
.
throwInternalError
();
}
}
initPattern
(
p
,
getEscapeChar
(
e
));
initPattern
(
p
,
getEscapeChar
(
e
));
}
if
(
invalidPattern
)
{
if
(
invalidPattern
)
{
return
;
return
;
}
}
...
@@ -260,12 +266,42 @@ public class CompareLike extends Condition {
...
@@ -260,12 +266,42 @@ public class CompareLike extends Condition {
result
=
patternRegexp
.
matcher
(
value
).
find
();
result
=
patternRegexp
.
matcher
(
value
).
find
();
}
else
if
(
shortcutToStartsWith
)
{
}
else
if
(
shortcutToStartsWith
)
{
result
=
value
.
regionMatches
(
ignoreCase
,
0
,
patternString
,
0
,
patternLength
-
1
);
result
=
value
.
regionMatches
(
ignoreCase
,
0
,
patternString
,
0
,
patternLength
-
1
);
}
else
if
(
shortcutToEndsWith
)
{
result
=
value
.
regionMatches
(
ignoreCase
,
value
.
length
()
-
patternLength
+
1
,
patternString
,
1
,
patternLength
-
1
);
}
else
if
(
shortcutToContains
)
{
String
p
=
patternString
.
substring
(
1
,
patternString
.
length
()
-
1
);
if
(
ignoreCase
)
{
result
=
containsIgnoreCase
(
value
,
p
);
}
else
{
result
=
value
.
contains
(
p
);
}
}
else
{
}
else
{
result
=
compareAt
(
value
,
0
,
0
,
value
.
length
(),
patternChars
,
patternTypes
);
result
=
compareAt
(
value
,
0
,
0
,
value
.
length
(),
patternChars
,
patternTypes
);
}
}
return
ValueBoolean
.
get
(
result
);
return
ValueBoolean
.
get
(
result
);
}
}
private
static
boolean
containsIgnoreCase
(
String
src
,
String
what
)
{
final
int
length
=
what
.
length
();
if
(
length
==
0
)
return
true
;
// Empty string is contained
final
char
firstLo
=
Character
.
toLowerCase
(
what
.
charAt
(
0
));
final
char
firstUp
=
Character
.
toUpperCase
(
what
.
charAt
(
0
));
for
(
int
i
=
src
.
length
()
-
length
;
i
>=
0
;
i
--)
{
// Quick check before calling the more expensive regionMatches() method:
final
char
ch
=
src
.
charAt
(
i
);
if
(
ch
!=
firstLo
&&
ch
!=
firstUp
)
continue
;
if
(
src
.
regionMatches
(
true
,
i
,
what
,
0
,
length
))
return
true
;
}
return
false
;
}
private
boolean
compareAt
(
String
s
,
int
pi
,
int
si
,
int
sLen
,
private
boolean
compareAt
(
String
s
,
int
pi
,
int
si
,
int
sLen
,
char
[]
pattern
,
int
[]
types
)
{
char
[]
pattern
,
int
[]
types
)
{
for
(;
pi
<
patternLength
;
pi
++)
{
for
(;
pi
<
patternLength
;
pi
++)
{
...
@@ -390,6 +426,32 @@ public class CompareLike extends Condition {
...
@@ -390,6 +426,32 @@ public class CompareLike extends Condition {
}
}
if
(
maxMatch
==
patternLength
-
1
&&
patternTypes
[
patternLength
-
1
]
==
ANY
)
{
if
(
maxMatch
==
patternLength
-
1
&&
patternTypes
[
patternLength
-
1
]
==
ANY
)
{
shortcutToStartsWith
=
true
;
shortcutToStartsWith
=
true
;
return
;
}
}
// optimizes the common case of LIKE '%foo'
if
(
compareMode
.
getName
().
equals
(
CompareMode
.
OFF
)
&&
patternLength
>
1
)
{
if
(
patternTypes
[
0
]
==
ANY
)
{
int
maxMatch
=
1
;
while
(
maxMatch
<
patternLength
&&
patternTypes
[
maxMatch
]
==
MATCH
)
{
maxMatch
++;
}
if
(
maxMatch
==
patternLength
)
{
shortcutToEndsWith
=
true
;
return
;
}
}
}
// optimizes the common case of LIKE '%foo%'
if
(
compareMode
.
getName
().
equals
(
CompareMode
.
OFF
)
&&
patternLength
>
2
)
{
if
(
patternTypes
[
0
]
==
ANY
)
{
int
maxMatch
=
1
;
while
(
maxMatch
<
patternLength
&&
patternTypes
[
maxMatch
]
==
MATCH
)
{
maxMatch
++;
}
if
(
maxMatch
==
patternLength
-
1
&&
patternTypes
[
patternLength
-
1
]
==
ANY
)
{
shortcutToContains
=
true
;
}
}
}
}
}
}
}
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论