Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
hanoi2005
redis
提交
d975bb58
R
redis
项目概览
hanoi2005
/
redis
与 Fork 源项目一致
从无法访问的项目Fork
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
R
redis
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
d975bb58
编写于
4月 16, 2014
作者:
A
antirez
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
ZLEXCOUNT implemented.
Like ZCOUNT for lexicographical ranges.
上级
71dfb87f
变更
3
隐藏空白更改
内联
并排
Showing
3 changed file
with
75 addition
and
0 deletion
+75
-0
src/redis.c
src/redis.c
+1
-0
src/redis.h
src/redis.h
+1
-0
src/t_zset.c
src/t_zset.c
+73
-0
未找到文件。
src/redis.c
浏览文件 @
d975bb58
...
...
@@ -176,6 +176,7 @@ struct redisCommand redisCommandTable[] = {
{
"zrangebylex"
,
zrangebylexCommand
,
-
4
,
"r"
,
0
,
NULL
,
1
,
1
,
1
,
0
,
0
},
{
"zrevrangebylex"
,
zrevrangebylexCommand
,
-
4
,
"r"
,
0
,
NULL
,
1
,
1
,
1
,
0
,
0
},
{
"zcount"
,
zcountCommand
,
4
,
"r"
,
0
,
NULL
,
1
,
1
,
1
,
0
,
0
},
{
"zlexcount"
,
zlexcountCommand
,
4
,
"r"
,
0
,
NULL
,
1
,
1
,
1
,
0
,
0
},
{
"zrevrange"
,
zrevrangeCommand
,
-
4
,
"r"
,
0
,
NULL
,
1
,
1
,
1
,
0
,
0
},
{
"zcard"
,
zcardCommand
,
2
,
"r"
,
0
,
NULL
,
1
,
1
,
1
,
0
,
0
},
{
"zscore"
,
zscoreCommand
,
3
,
"r"
,
0
,
NULL
,
1
,
1
,
1
,
0
,
0
},
...
...
src/redis.h
浏览文件 @
d975bb58
...
...
@@ -1308,6 +1308,7 @@ void zrevrangebyscoreCommand(redisClient *c);
void
zrangebylexCommand
(
redisClient
*
c
);
void
zrevrangebylexCommand
(
redisClient
*
c
);
void
zcountCommand
(
redisClient
*
c
);
void
zlexcountCommand
(
redisClient
*
c
);
void
zrevrangeCommand
(
redisClient
*
c
);
void
zcardCommand
(
redisClient
*
c
);
void
zremCommand
(
redisClient
*
c
);
...
...
src/t_zset.c
浏览文件 @
d975bb58
...
...
@@ -2357,6 +2357,79 @@ void zcountCommand(redisClient *c) {
addReplyLongLong
(
c
,
count
);
}
void
zlexcountCommand
(
redisClient
*
c
)
{
robj
*
key
=
c
->
argv
[
1
];
robj
*
zobj
;
zlexrangespec
range
;
int
count
=
0
;
/* Parse the range arguments */
if
(
zslParseLexRange
(
c
->
argv
[
2
],
c
->
argv
[
3
],
&
range
)
!=
REDIS_OK
)
{
addReplyError
(
c
,
"min or max not valid string range item"
);
return
;
}
/* Lookup the sorted set */
if
((
zobj
=
lookupKeyReadOrReply
(
c
,
key
,
shared
.
czero
))
==
NULL
||
checkType
(
c
,
zobj
,
REDIS_ZSET
))
return
;
if
(
zobj
->
encoding
==
REDIS_ENCODING_ZIPLIST
)
{
unsigned
char
*
zl
=
zobj
->
ptr
;
unsigned
char
*
eptr
,
*
sptr
;
/* Use the first element in range as the starting point */
eptr
=
zzlFirstInLexRange
(
zl
,
range
);
/* No "first" element */
if
(
eptr
==
NULL
)
{
addReply
(
c
,
shared
.
czero
);
return
;
}
/* First element is in range */
sptr
=
ziplistNext
(
zl
,
eptr
);
redisAssertWithInfo
(
c
,
zobj
,
zzlLexValueLteMax
(
eptr
,
&
range
));
/* Iterate over elements in range */
while
(
eptr
)
{
/* Abort when the node is no longer in range. */
if
(
!
zzlLexValueLteMax
(
eptr
,
&
range
))
{
break
;
}
else
{
count
++
;
zzlNext
(
zl
,
&
eptr
,
&
sptr
);
}
}
}
else
if
(
zobj
->
encoding
==
REDIS_ENCODING_SKIPLIST
)
{
zset
*
zs
=
zobj
->
ptr
;
zskiplist
*
zsl
=
zs
->
zsl
;
zskiplistNode
*
zn
;
unsigned
long
rank
;
/* Find first element in range */
zn
=
zslFirstInLexRange
(
zsl
,
range
);
/* Use rank of first element, if any, to determine preliminary count */
if
(
zn
!=
NULL
)
{
rank
=
zslGetRank
(
zsl
,
zn
->
score
,
zn
->
obj
);
count
=
(
zsl
->
length
-
(
rank
-
1
));
/* Find last element in range */
zn
=
zslLastInLexRange
(
zsl
,
range
);
/* Use rank of last element, if any, to determine the actual count */
if
(
zn
!=
NULL
)
{
rank
=
zslGetRank
(
zsl
,
zn
->
score
,
zn
->
obj
);
count
-=
(
zsl
->
length
-
rank
);
}
}
}
else
{
redisPanic
(
"Unknown sorted set encoding"
);
}
addReplyLongLong
(
c
,
count
);
}
/* This command implements ZRANGEBYLEX, ZREVRANGEBYLEX. */
void
genericZrangebylexCommand
(
redisClient
*
c
,
int
reverse
)
{
zlexrangespec
range
;
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录