本之后才有的数据结构。
hashes存的是字符串和字符串值之间的映射,比如一个用户要存储其全名、姓氏、年龄等等,就很适合使用哈希。
1.hset 设置散列值
127.0.0.1:6379> hset news1 title "New1 title"
(integer) 1
127.0.0.1:6379> hset news1 content "This is first news"
(integer) 1
2.hget 获取散列值
127.0.0.1:6379> hget news1 content
"This is first news"
127.0.0.1:6379> hget news1 title
"New1 title"
3.hmset 设置多对散列表
127.0.0.1:6379> hmset news2 title "New2 title" content "This is seconde news"
OK
4.hmget 获取多对散列值
127.0.0.1:6379> hmget news2 title content
1) "New2 title"
2) "This is seconde news"
5.hsetnx 如果散列已经存在,则不设置(防止覆盖key)
# 1代表设置成功,0代表设置失败
127.0.0.1:6379> hsetnx news2 title "news 2"
(integer) 0
127.0.0.1:6379> hsetnx news3 title "news 3"
(integer) 1
6.hkeys 返回所有keys
127.0.0.1:6379> hkeys news1
1) "content"
2) "title"
7.hvals 返回所有values
127.0.0.1:6379> hvals news1
1) "This is first news"
2) "New1 title"
8.hlen 返回散列包含域(field)的数量
127.0.0.1:6379> hlen news1
(integer) 2
127.0.0.1:6379> hlen news2
(integer) 2
9.hdel 删除散列指定的域(field)
127.0.0.1:6379> hdel news1 title
(integer) 1
127.0.0.1:6379> hget news1 title
(nil)
10.hexists 判断是否存在
127.0.0.1:6379> hexists news1 title
(integer) 0
127.0.0.1:6379> hexists news1 content
(integer) 1
#0表示不存在,1表示存在