{"id":201274,"date":"2025-05-10T10:31:39","date_gmt":"2025-05-10T02:31:39","guid":{"rendered":"https:\/\/server.hk\/cnblog\/201274\/"},"modified":"2025-05-10T10:31:39","modified_gmt":"2025-05-10T02:31:39","slug":"redis%e6%ba%90%e7%a0%81%e5%88%86%e6%9e%90%e4%b9%8bset-%e5%92%8c-sorted-set-%e4%bd%bf%e7%94%a8","status":"publish","type":"post","link":"https:\/\/server.hk\/cnblog\/201274\/","title":{"rendered":"Redis\u6e90\u7801\u5206\u6790\u4e4bset\u00a0\u548c\u00a0sorted\u00a0set\u00a0\u4f7f\u7528"},"content":{"rendered":"

<\/b> <\/p>\n

Redis\u6e90\u7801\u5206\u6790\u4e4bset \u548c sorted set \u4f7f\u7528<\/h1>\n

<\/i>\u6536\u85cf<\/span> <\/p>\n

\u4eb2\u7231\u7684\u7f16\u7a0b\u5b66\u4e60\u7231\u597d\u8005\uff0c\u5982\u679c\u4f60\u70b9\u5f00\u4e86\u8fd9\u7bc7\u6587\u7ae0\uff0c\u8bf4\u660e\u4f60\u5bf9\u300aRedis\u6e90\u7801\u5206\u6790\u4e4bset \u548c sorted set \u4f7f\u7528\u300b\u5f88\u611f\u5174\u8da3\u3002\u672c\u7bc7\u6587\u7ae0\u5c31\u6765\u7ed9\u5927\u5bb6\u8be6\u7ec6\u89e3\u6790\u4e00\u4e0b\uff0c\u4e3b\u8981\u4ecb\u7ecd\u4e00\u4e0bRedisset\u3001sorted\uff0c\u5e0c\u671b\u6240\u6709\u8ba4\u771f\u8bfb\u5b8c\u7684\u7ae5\u978b\u4eec\uff0c\u90fd\u6709\u5b9e\u8d28\u6027\u7684\u63d0\u9ad8\u3002<\/p>\n

set \u548c sorted set<\/h2>\n

\u524d\u8a00<\/h3>\n

\u524d\u9762\u5728\u51e0\u4e2a\u6587\u7ae0\u804a\u5230\u4e86 list\uff0cstring\uff0chash<\/code> \u7b49\u7ed3\u6784\u7684\u5b9e\u73b0\uff0c\u8fd9\u6b21\u6765\u804a\u4e00\u4e0b set \u548c sorted set<\/code> \u7684\u7ec6\u8282\u3002<\/p>\n

set<\/h3>\n

Redis \u7684 Set \u662f String \u7c7b\u578b\u7684\u65e0\u5e8f\u96c6\u5408\uff0c\u96c6\u5408\u6210\u5458\u662f\u552f\u4e00\u7684\u3002<\/p>\n

\u5e95\u5c42\u5b9e\u73b0\u4e3b\u8981\u7528\u5230\u4e86\u4e24\u79cd\u6570\u636e\u7ed3\u6784 hashtable \u548c inset(\u6574\u6570\u96c6\u5408)\u3002<\/p>\n

\u96c6\u5408\u4e2d\u6700\u5927\u7684\u6210\u5458\u6570\u4e3a2\u768432\u6b21\u65b9-1 (4294967295, \u6bcf\u4e2a\u96c6\u5408\u53ef\u5b58\u50a840\u591a\u4ebf\u4e2a\u6210\u5458)\u3002<\/p>\n

\u5e38\u89c1\u547d\u4ee4<\/h4>\n

\u6765\u770b\u4e0b\u51e0\u4e2a\u5e38\u7528\u7684\u547d\u4ee4<\/p>\n

# \u5411\u96c6\u5408\u6dfb\u52a0\u4e00\u4e2a\u6216\u591a\u4e2a\u6210\u5458\nSADD key member1 [member2]\n\n# \u83b7\u53d6\u96c6\u5408\u7684\u6210\u5458\u6570\nSCARD key\n# \u8fd4\u56de\u7b2c\u4e00\u4e2a\u96c6\u5408\u4e0e\u5176\u4ed6\u96c6\u5408\u4e4b\u95f4\u7684\u5dee\u5f02\u3002\nSDIFF key1 [key2]\n# \u8fd4\u56de\u7ed9\u5b9a\u6240\u6709\u96c6\u5408\u7684\u5dee\u96c6\u5e76\u5b58\u50a8\u5728 destination \u4e2d\nSDIFFSTORE destination key1 [key2]\n# \u8fd4\u56de\u7ed9\u5b9a\u6240\u6709\u96c6\u5408\u7684\u4ea4\u96c6\nSINTER key1 [key2]\n# \u8fd4\u56de\u7ed9\u5b9a\u6240\u6709\u96c6\u5408\u7684\u4ea4\u96c6\u5e76\u5b58\u50a8\u5728 destination \u4e2d\nSINTERSTORE destination key1 [key2]\n# \u5224\u65ad member \u5143\u7d20\u662f\u5426\u662f\u96c6\u5408 key \u7684\u6210\u5458\nSISMEMBER key member\n# \u8fd4\u56de\u96c6\u5408\u4e2d\u7684\u6240\u6709\u6210\u5458\nSMEMBERS key\n# \u5c06 member \u5143\u7d20\u4ece source \u96c6\u5408\u79fb\u52a8\u5230 destination \u96c6\u5408\nSMOVE source destination member\n# \u79fb\u9664\u5e76\u8fd4\u56de\u96c6\u5408\u4e2d\u7684\u4e00\u4e2a\u968f\u673a\u5143\u7d20\nSPOP key\n# \u8fd4\u56de\u96c6\u5408\u4e2d\u4e00\u4e2a\u6216\u591a\u4e2a\u968f\u673a\u6570\nSRANDMEMBER key [count]\n# \u79fb\u9664\u96c6\u5408\u4e2d\u4e00\u4e2a\u6216\u591a\u4e2a\u6210\u5458\nSREM key member1 [member2]\n# \u8fd4\u56de\u6240\u6709\u7ed9\u5b9a\u96c6\u5408\u7684\u5e76\u96c6\nSUNION key1 [key2]\n# \u6240\u6709\u7ed9\u5b9a\u96c6\u5408\u7684\u5e76\u96c6\u5b58\u50a8\u5728 destination \u96c6\u5408\u4e2d\nSUNIONSTORE destination key1 [key2]\n# \u8fed\u4ee3\u96c6\u5408\u4e2d\u7684\u5143\u7d20\nSSCAN key cursor [MATCH pattern] [COUNT count]<\/pre>\n
\u6765\u4e2a\u6817\u5b50<\/p>\n
127.0.0.1:6379>  SADD set-test xiaoming\n(integer) 1\n(integer) 0\n127.0.0.1:6379>  SADD set-test xiaoming1\n127.0.0.1:6379>  SADD set-test xiaoming2\n\n127.0.0.1:6379> SMEMBERS set-test\n1) \"xiaoming2\"\n2) \"xiaoming\"\n3) \"xiaoming1\"<\/pre>\n
\u4e0a\u9762\u91cd\u590d\u503c\u7684\u63d2\u5165\uff0c\u53ea\u6709\u7b2c\u4e00\u6b21\u53ef\u4ee5\u63d2\u5165\u6210\u529f<\/p>\n
set \u7684\u4f7f\u7528\u573a\u666f<\/h4>\n
\u6bd4\u8f83\u9002\u7528\u4e8e\u805a\u5408\u5206\u7c7b<\/p>\n
1\u3001\u6807\u7b7e\uff1a\u6bd4\u5982\u6211\u4eec\u535a\u5ba2\u7f51\u7ad9\u5e38\u5e38\u4f7f\u7528\u5230\u7684\u5174\u8da3\u6807\u7b7e\uff0c\u628a\u4e00\u4e2a\u4e2a\u6709\u7740\u76f8\u540c\u7231\u597d\uff0c\u5173\u6ce8\u7c7b\u4f3c\u5185\u5bb9\u7684\u7528\u6237\u5229\u7528\u4e00\u4e2a\u6807\u7b7e\u628a\u4ed6\u4eec\u8fdb\u884c\u5f52\u5e76\u3002<\/p>\n
2\u3001\u5171\u540c\u597d\u53cb\u529f\u80fd\uff0c\u5171\u540c\u559c\u597d\uff0c\u6216\u8005\u53ef\u4ee5\u5f15\u7533\u5230\u4e8c\u5ea6\u597d\u53cb\u4e4b\u7c7b\u7684\u6269\u5c55\u5e94\u7528\u3002<\/p>\n
3\u3001\u7edf\u8ba1\u7f51\u7ad9\u7684\u72ec\u7acbIP\u3002\u5229\u7528set\u96c6\u5408\u5f53\u4e2d\u5143\u7d20\u4e0d\u552f\u4e00\u6027\uff0c\u53ef\u4ee5\u5feb\u901f\u5b9e\u65f6\u7edf\u8ba1\u8bbf\u95ee\u7f51\u7ad9\u7684\u72ec\u7acbIP\u3002<\/p>\n
\u4e0d\u8fc7\u5bf9\u4e8e set \u4e2d\u7684\u547d\u4ee4\u8981\u5408\u7406\u7684\u5e94\u7528\uff0c\u4e0d\u7136\u5f88\u5bb9\u6613\u9020\u6210\u6162\u67e5\u8be2<\/p>\n
1\u3001\u4f7f\u7528\u9ad8\u6548\u7684\u547d\u4ee4\uff0c\u6bd4\u5982\u8bf4\uff0c\u5982\u679c\u4f60\u9700\u8981\u8fd4\u56de\u4e00\u4e2a SET \u4e2d\u7684\u6240\u6709\u6210\u5458\u65f6\uff0c\u4e0d\u8981\u4f7f\u7528 SMEMBERS \u547d\u4ee4\uff0c\u800c\u662f\u8981\u4f7f\u7528 SSCAN \u591a\u6b21\u8fed\u4ee3\u8fd4\u56de\uff0c\u907f\u514d\u4e00\u6b21\u8fd4\u56de\u5927\u91cf\u6570\u636e\uff0c\u9020\u6210\u7ebf\u7a0b\u963b\u585e\u3002<\/p>\n
2\u3001\u5f53\u4f60\u9700\u8981\u6267\u884c\u6392\u5e8f\u3001\u4ea4\u96c6\u3001\u5e76\u96c6\u64cd\u4f5c\u65f6\uff0c\u53ef\u4ee5\u5728\u5ba2\u6237\u7aef\u5b8c\u6210\uff0c\u800c\u4e0d\u8981\u7528SORT\u3001SUNION\u3001SINTER<\/code>\u8fd9\u4e9b\u547d\u4ee4\uff0c\u4ee5\u514d\u62d6\u6162 Redis \u5b9e\u4f8b\u3002<\/p>\n
\u770b\u4e0b\u6e90\u7801\u5b9e\u73b0<\/h4>\n
\u8fd9\u91cc\u6765\u770b\u4e0b set \u4e2d\u4e3b\u8981\u7528\u5230\u7684\u6570\u636e\u7c7b\u578b<\/p>\n
\u4ee3\u7801\u8def\u5f84https:\/\/github.com\/redis\/redis\/blob\/6.2\/src\/t_set.c<\/code><\/p>\n
void saddCommand(client *c) {\n    robj *set;\n    int j, added = 0;\n\n    set = lookupKeyWrite(c->db,c->argv[1]);\n    if (checkType(c,set,OBJ_SET)) return;\n    \n    if (set == NULL) {\n        set = setTypeCreate(c->argv[2]->ptr);\n        dbAdd(c->db,c->argv[1],set);\n    }\n    for (j = 2; j argc; j++) {\n        if (setTypeAdd(set,c->argv[j]->ptr)) added++;\n    if (added) {\n        signalModifiedKey(c,c->db,c->argv[1]);\n        notifyKeyspaceEvent(NOTIFY_SET,\"sadd\",c->argv[1],c->db->id);\n    server.dirty += added;\n    addReplyLongLong(c,added);\n}\n\/\/ \u5f53 value \u662f\u6574\u6570\u7c7b\u578b\u4f7f\u7528 intset\n\/\/ \u5426\u5219\u4f7f\u7528\u54c8\u5e0c\u8868\nrobj *setTypeCreate(sds value) {\n    if (isSdsRepresentableAsLongLong(value,NULL) == C_OK)\n        return createIntsetObject();\n    return createSetObject();\n\/* Add the specified value into a set.\n *\n * If the value was already member of the set, nothing is done and 0 is\n * returned, otherwise the new element is added and 1 is returned. *\/\nint setTypeAdd(robj *subject, sds value) {\n    long long llval;\n    \/\/ \u5982\u679c\u662f OBJ_ENCODING_HT \u8bf4\u660e\u662f\u54c8\u5e0c\u7c7b\u578b\n    if (subject->encoding == OBJ_ENCODING_HT) {\n        dict *ht = subject->ptr;\n        dictEntry *de = dictAddRaw(ht,value,NULL);\n        if (de) {\n            \/\/ \u8bbe\u7f6ekey ,value \u8bbe\u7f6e\u6210null\n            dictSetKey(ht,de,sdsdup(value));\n            dictSetVal(ht,de,NULL);\n            return 1;\n        }\n    \/\/ OBJ_ENCODING_INTSET \u4ee3\u8868\u662f inset\n    } else if (subject->encoding == OBJ_ENCODING_INTSET) {\n        if (isSdsRepresentableAsLongLong(value,&llval) == C_OK) {\n            uint8_t success = 0;\n            subject->ptr = intsetAdd(subject->ptr,llval,&success);\n            if (success) {\n                \/* Convert to regular set when the intset contains\n                 * too many entries. *\/\n                \/\/ \u5982\u679c\u6761\u76ee\u8fc7\u591a\u5c06\u4f1a\u8f6c\u6362\u6210\u96c6\u5408\n                size_t max_entries = server.set_max_intset_entries;\n                \/* limit to 1G entries due to intset internals. *\/\n                if (max_entries >= 1ptr) > max_entries)\n                    setTypeConvert(subject,OBJ_ENCODING_HT);\n                return 1;\n            }\n        } else {\n            \/* Failed to get integer from object, convert to regular set. *\/\n            setTypeConvert(subject,OBJ_ENCODING_HT);\n            \/* The set *was* an intset and this value is not integer\n             * encodable, so dictAdd should always work. *\/\n            serverAssert(dictAdd(subject->ptr,sdsdup(value),NULL) == DICT_OK);\n    } else {\n        serverPanic(\"Unknown set encoding\");\n    return 0;<\/pre>\n
\u901a\u8fc7\u4e0a\u9762\u7684\u6e90\u7801\u5206\u6790\uff0c\u53ef\u4ee5\u770b\u5230<\/p>\n
1\u3001set \u4e2d\u4e3b\u8981\u7528\u5230\u4e86 hashtable \u548c inset\uff1b<\/p>\n
2\u3001\u5982\u679c\u5b58\u50a8\u7684\u7c7b\u578b\u662f\u6574\u6570\u7c7b\u578b\u5c31\u4f1a\u4f7f\u7528 inset\uff0c\u5426\u5219\u4f7f\u7528 hashtable\uff1b<\/p>\n
3\u3001\u4f7f\u7528 inset \u6709\u4e00\u4e2a\u6700\u5927\u7684\u9650\u5236\uff0c\u8fbe\u5230\u4e86\u6700\u5927\u7684\u9650\u5236\uff0c\u4e5f\u662f\u4f1a\u4f7f\u7528 hashtable\uff1b<\/p>\n
\u518d\u6765\u770b\u4e0b inset \u6570\u636e\u7ed3\u6784<\/p>\n
\u4ee3\u7801\u5730\u5740<\/p>\n
typedef struct intset {\n    \/\/ \u7f16\u7801\u65b9\u6cd5\uff0c\u6307\u5b9a\u5f53\u524d\u5b58\u50a8\u7684\u662f 16 \u4f4d\uff0c32 \u4f4d\uff0c\u8fd8\u662f 64 \u4f4d\u7684\u6574\u6570\n    uint32_t encoding;\n    uint32_t length;\n    \/\/ \u5b9e\u9645\u4fdd\u5b58\u5143\u7d20\u7684\u6570\u7ec4\n    int8_t contents[];\n} intset;<\/pre>\n
insert<\/h5>\n
\u6765\u770b\u4e0b intset \u7684\u6570\u636e\u63d2\u5165<\/p>\n
\/* Insert an integer in the intset *\/\nintset *intsetAdd(intset *is, int64_t value, uint8_t *success) {\n    \/\/ \u8ba1\u7b97value\u7684\u7f16\u7801\u957f\u5ea6\n    uint8_t valenc = _intsetValueEncoding(value);\n    uint32_t pos;\n    if (success) *success = 1;\n\n    \/* Upgrade encoding if necessary. If we need to upgrade, we know that\n     * this value should be either appended (if > 0) or prepended (if  intrev32ifbe(is->encoding)) {\n        \/* This always succeeds, so we don't need to curry *success. *\/\n        return intsetUpgradeAndAdd(is,value);\n    } else {\n        \/* Abort if the value is already present in the set.\n         * This call will populate \"pos\" with the right position to insert\n         * the value when it cannot be found. *\/\n        \/\/ \u5f53\u524d\u503c\u4e0d\u5b58\u5728\u7684\u65f6\u5019\u624d\u8fdb\u884c\u63d2\u5165  \n        if (intsetSearch(is,value,&pos)) {\n            if (success) *success = 0;\n            return is;\n        }\n        is = intsetResize(is,intrev32ifbe(is->length)+1);\n        if (pos length)) intsetMoveTail(is,pos,pos+1);\n    }\n    \/\/ \u6570\u636e\u63d2\u5165\n    _intsetSet(is,pos,value);\n    is->length = intrev32ifbe(intrev32ifbe(is->length)+1);\n    return is;\n}<\/pre>\n
intset \u7684\u6570\u636e\u63d2\u5165\u6709\u4e00\u4e2a\u6570\u636e\u5347\u7ea7\u7684\u8fc7\u7a0b\uff0c\u5f53\u4e00\u4e2a\u6574\u6570\u88ab\u6dfb\u52a0\u5230\u6574\u6570\u96c6\u5408\u65f6\uff0c\u9996\u5148\u9700\u8981\u5224\u65ad\u4e0b \u65b0\u5143\u7d20\u7684\u7c7b\u578b\u548c\u96c6\u5408\u4e2d\u73b0\u6709\u5143\u7d20\u7c7b\u578b\u7684\u957f\u77ed\uff0c\u5982\u679c\u65b0\u5143\u7d20\u662f\u4e00\u4e2a32\u4f4d\u7684\u6570\u5b57\uff0c\u73b0\u6709\u96c6\u5408\u7c7b\u578b\u662f16\u4f4d\u7684\uff0c\u90a3\u4e48\u5c31\u9700\u8981\u5c06\u6574\u6570\u96c6\u5408\u8fdb\u884c\u5347\u7ea7\uff0c\u7136\u540e\u624d\u80fd\u5c06\u65b0\u7684\u5143\u7d20\u52a0\u5165\u8fdb\u6765\u3002<\/p>\n
\u8fd9\u6837\u505a\u7684\u4f18\u70b9\uff1a<\/p>\n
1\u3001\u63d0\u5347\u6574\u6570\u96c6\u5408\u7684\u7075\u6d3b\u6027\uff0c\u53ef\u4ee5\u968f\u610f\u7684\u6dfb\u52a0\u6574\u6570\uff0c\u800c\u4e0d\u7528\u5173\u5fc3\u6574\u6570\u7684\u7c7b\u578b\uff1b<\/p>\n
2\u3001\u53ef\u4ee5\u5c3d\u53ef\u80fd\u7684\u8282\u7ea6\u5185\u5b58\u3002<\/p>\n
\u4e86\u89e3\u5b8c\u6570\u636e\u7684\u63d2\u5165\u518d\u6765\u770b\u4e0b intset \u4e2d\u662f\u5982\u4f55\u6765\u5feb\u901f\u7684\u641c\u7d22\u91cc\u9762\u7684\u6570\u636e<\/p>\n
\/* Search for the position of \"value\". Return 1 when the value was found and\n * sets \"pos\" to the position of the value within the intset. Return 0 when\n * the value is not present in the intset and sets \"pos\" to the position\n * where \"value\" can be inserted. *\/\n\/\/ \u5982\u679c\u627e\u5230\u4e86\u5bf9\u5e94\u7684\u6570\u636e\uff0c\u8fd4\u56de 1 \u5c06 pos \u8bbe\u7f6e\u4e3a\u5bf9\u5e94\u7684\u4f4d\u7f6e\n\/\/ \u5982\u679c\u627e\u4e0d\u5230\uff0c\u8fd4\u56de0\uff0c\u8bbe\u7f6e pos \u4e3a\u53ef\u4ee5\u4e3a\u6570\u636e\u53ef\u4ee5\u63d2\u5165\u7684\u4f4d\u7f6e\n\/\/ intset \u4e2d\u7684\u6570\u636e\u662f\u6392\u597d\u5e8f\u7684\uff0c\u6240\u4ee5\u4f7f\u7528\u4e8c\u5206\u67e5\u627e\u6765\u5bfb\u627e\u5bf9\u5e94\u7684\u5143\u7d20  \nstatic uint8_t intsetSearch(intset *is, int64_t value, uint32_t *pos) {\n    int min = 0, max = intrev32ifbe(is->length)-1, mid = -1;\n    int64_t cur = -1;\n\n    \/* The value can never be found when the set is empty *\/\n    if (intrev32ifbe(is->length) == 0) {\n        if (pos) *pos = 0;\n        return 0;\n    } else {\n        \/* Check for the case where we know we cannot find the value,\n         * but do know the insert position. *\/\n        if (value > _intsetGet(is,max)) {\n            if (pos) *pos = intrev32ifbe(is->length);\n            return 0;\n        } else if (value = min) {\n        mid = ((unsigned int)min + (unsigned int)max) >> 1;\n        cur = _intsetGet(is,mid);\n        if (value > cur) {\n            min = mid+1;\n        } else if (value \n
\u53ef\u4ee5\u770b\u5230\u8fd9\u91cc\u7528\u5230\u7684\u662f\u4e8c\u5206\u67e5\u627e\uff0cintset \u4e2d\u7684\u6570\u636e\u672c\u8eab\u4e5f\u5c31\u662f\u6392\u597d\u5e8f\u7684<\/p>\n
dict<\/h5>\n
\u6765\u770b\u4e0b dict \u7684\u6570\u636e\u7ed3\u6784<\/p>\n
typedef struct dict {\n    dictType *type;\n    void *privdata;\n    \/\/ \u54c8\u5e0c\u8868\u6570\u7ec4\uff0c\u957f\u5ea6\u4e3a2\uff0c\u4e00\u4e2a\u6b63\u5e38\u5b58\u50a8\u6570\u636e\uff0c\u4e00\u4e2a\u7528\u6765\u6269\u5bb9\n    dictht ht[2];\n    long rehashidx; \/* rehashing not in progress if rehashidx == -1 *\/\n    int16_t pauserehash; \/* If >0 rehashing is paused (\n
\u53ef\u4ee5\u770b\u5230 dict \u4e2d\uff0c\u662f\u9884\u7559\u4e86\u4e24\u4e2a\u54c8\u5e0c\u8868\uff0c\u6765\u5904\u7406\u6e10\u8fdb\u5f0f\u7684 rehash<\/p>\n
rehash \u7ec6\u8282\u53c2\u8003  redis \u4e2d\u7684\u5b57\u5178<\/p>\n
\u518d\u6765\u770b\u4e0b dict \u6570\u636e\u7684\u63d2\u5165<\/p>\n
dictEntry *dictAddRaw(dict *d, void *key, dictEntry **existing)\n{\n    long index;\n    dictEntry *entry;\n    dictht *ht;\n\n    if (dictIsRehashing(d)) _dictRehashStep(d);\n    \/* Get the index of the new element, or -1 if\n     * the element already exists. *\/\n    if ((index = _dictKeyIndex(d, key, dictHashKey(d,key), existing)) == -1)\n        return NULL;\n    \/* Allocate the memory and store the new entry.\n     * Insert the element in top, with the assumption that in a database\n     * system it is more likely that recently added entries are accessed\n     * more frequently. *\/\n    \/\/ \u8fd9\u91cc\u6765\u5224\u65ad\u662f\u5426\u6b63\u5728 Rehash \u4e2d\n    ht = dictIsRehashing(d) ? &d->ht[1] : &d->ht[0];\n    entry = zmalloc(sizeof(*entry));\n    entry->next = ht->table[index];\n    ht->table[index] = entry;\n    ht->used++;\n    \/* Set the hash entry fields. *\/\n    \/\/ \u63d2\u5165\u5177\u4f53\u7684\u6570\u636e  \n    dictSetKey(d, entry, key);\n    return entry;\n}<\/pre>\n
\u8fd9\u91cc\u91cd\u70b9\u6765\u5206\u6790\u4e0b Rehash \u7684\u8fc7\u7a0b<\/p>\n
int dictRehash(dict *d, int n) {\n    int empty_visits = n*10; \/* Max number of empty buckets to visit. *\/\n    \/\/ \u8fd9\u91cc\u6765\u5224\u65ad\u662f\u5426\u6b63\u5728 Rehash \u4e2d\n    if (!dictIsRehashing(d)) return 0;\n\n    \/\/ used \u5b9e\u9645\u5b58\u50a8\u7684 dictEntry \u6570\u91cf\n    \/\/ \u5982\u679c\u6709\u6570\u636e\u8fdb\u884c\u4e0b\u9762\u7684\u8fc1\u79fb\n    while(n-- && d->ht[0].used != 0) {\n        dictEntry *de, *nextde;\n        \/* Note that rehashidx can't overflow as we are sure there are more\n         * elements because ht[0].used != 0 *\/\n        assert(d->ht[0].size > (unsigned long)d->rehashidx);\n        while(d->ht[0].table[d->rehashidx] == NULL) {\n            d->rehashidx++;\n            if (--empty_visits == 0) return 1;\n        }\n        \/\/ \u83b7\u53d6\u8001\u6570\u636e\u4e2d\u7684\u6570\u636e\n        de = d->ht[0].table[d->rehashidx];\n        \/* Move all the keys in this bucket from the old to the new hash HT *\/\n        while(de) {\n            uint64_t h;\n            nextde = de->next;\n            \/* Get the index in the new hash table *\/\n            \/\/ \u83b7\u53d6\u65b0\u54c8\u5e0c\u8868\u7684\u7d22\u5f15\n            h = dictHashKey(d, de->key) & d->ht[1].sizemask;\n            de->next = d->ht[1].table[h];\n            \/\/ \u5c06\u6570\u636e\u653e\u5165\u5230\u65b0\u7684 dity \u4e2d\n            d->ht[1].table[h] = de;\n            d->ht[0].used--;\n            d->ht[1].used++;\n            de = nextde;\n        d->ht[0].table[d->rehashidx] = NULL;\n        d->rehashidx++;\n    }\n    \/* Check if we already rehashed the whole table... *\/\n    \/\/ \u8fd9\u91cc\u6765\u68c0\u6d4b\u662f\u5426\u5b8c\u6210\u4e86\u6574\u4e2a\u7684 rehash \u64cd\u4f5c  \n    if (d->ht[0].used == 0) {\n        zfree(d->ht[0].table);\n        \/\/ \u5c06 ht[1] \u7684\u5185\u5bb9\u653e\u5165\u5230 ht[0] \u4e2d\uff0cht[1] \u4f5c\u4e3a\u5907\u7528\uff0c\u4e0b\u6b21 rehash \u4f7f\u7528\n        d->ht[0] = d->ht[1];\n        _dictReset(&d->ht[1]);\n        d->rehashidx = -1;\n        return 0;\n    \/* More to rehash... *\/\n    return 1;\n}\n\/\/ \u4f7f\u7528\u589e\u91cf\u7684\u65b9\u5f0f rehash \n\/\/ \u5f53\u7136\u6570\u636e\u5f88\u5927\u7684\u8bdd\uff0c\u4e00\u6b21\u8fc1\u79fb\u6240\u6709\u7684\u6570\u636e\uff0c\u663e\u7136\u662f\u4e0d\u5408\u7406\u7684\uff0c\u4f1a\u9020\u6210Redis\u7ebf\u7a0b\u963b\u585e\uff0c\u65e0\u6cd5\u670d\u52a1\u5176\u4ed6\u8bf7\u6c42\u3002\u8fd9\u91cc Redis \u4f7f\u7528\u7684\u662f\u6e10\u8fdb\u5f0f rehash\u3002\n\/\/ \u5728 rehash \u671f\u95f4\uff0c\u6bcf\u6b21\u6267\u884c\u6dfb\u52a0\uff0c\u5220\u9664\uff0c\u67e5\u627e\u6216\u8005\u66f4\u65b0\u64cd\u4f5c\u65f6\uff0c\u9664\u4e86\u5bf9\u547d\u4ee4\u672c\u8eab\u7684\u5904\u7406\uff0c\u8fd8\u4f1a\u987a\u5e26\u5c06\u54c8\u5e0c\u88681\u4e2d\u7684\u6570\u636e\u62f7\u8d1d\u5230\u54c8\u5e0c\u88682\u4e2d\u3002\u4ece\u7d22\u5f150\u5f00\u59cb\uff0c\u6bcf\u6267\u884c\u4e00\u6b21\u64cd\u4f5c\u547d\u4ee4\uff0c\u62f7\u8d1d\u4e00\u4e2a\u7d22\u5f15\u4f4d\u7f6e\u7684\u6570\u636e\u3002  \n\/\/ \u5982\u679c\u6ca1\u6709\u8bfb\u5165\u548c\u5199\u5165\u64cd\u4f5c\uff0c\u8fd9\u65f6\u5019\u5c31\u4e0d\u80fd\u8fdb\u884c rehash\n\/\/ \u6240\u4ee5\u4f1a\u5b9a\u65f6\u6267\u884c\u4e00\u5b9a\u6570\u91cf\u7684 rehash \u64cd\u4f5c  \nint incrementallyRehash(int dbid) {\n    \/* Keys dictionary *\/\n    if (dictIsRehashing(server.db[dbid].dict)) {\n        dictRehashMilliseconds(server.db[dbid].dict,1);\n        return 1; \/* already used our millisecond for this loop... *\/\n    \/* Expires *\/\n    if (dictIsRehashing(server.db[dbid].expires)) {\n        dictRehashMilliseconds(server.db[dbid].expires,1);\n    return 0;<\/pre>\n
1\u3001rehash \u7684\u8fc7\u7a0b Redis \u9ed8\u8ba4\u4f7f\u7528\u4e86\u4e24\u4e2a\u5168\u5c40\u54c8\u5e0c\u8868;<\/p>\n
2\u3001rehash \u7684\u8fc7\u7a0b\u662f\u6e10\u8fdb\u5f0f\u7684\uff0c\u56e0\u4e3a\u5982\u679c\u6570\u636e\u91cf\u5f88\u5927\u7684\u8bdd\uff0c\u4e00\u6b21\u8fc1\u79fb\u6240\u6709\u7684\u6570\u636e\uff0c\u4f1a\u9020\u6210Redis\u7ebf\u7a0b\u963b\u585e\uff0c\u65e0\u6cd5\u670d\u52a1\u5176\u4ed6\u8bf7\u6c42\uff1b<\/p>\n
3\u3001\u5728\u8fdb\u884c rehash \u671f\u95f4\uff0c\u5220\u9664\uff0c\u67e5\u627e\u6216\u8005\u66f4\u65b0\u64cd\u4f5c\u90fd\u4f1a\u5728\u4e24\u4e2a\u54c8\u5e0c\u8868\u4e2d\u6267\u884c\uff0c\u6dfb\u52a0\u64cd\u4f5c\u5c31\u76f4\u63a5\u6dfb\u52a0\u5230\u54c8\u5e0c\u88682\u4e2d\u4e86\u3002\u67e5\u627e\u4f1a\u628a\u4e24\u4e2a\u54c8\u5e0c\u8868\u90fd\u627e\u4e00\u904d\uff0c\u76f4\u5230\u627e\u5230\u6216\u8005\u4e24\u4e2a\u90fd\u627e\u4e0d\u5230\uff1b<\/p>\n
4\u3001\u5982\u679c\u5728 reash \u671f\u95f4\uff0c\u5982\u679c\u6ca1\u6709\u8bfb\u5199\u64cd\u4f5c\uff0c\u8fd9\u65f6\u5019\uff0c\u5c31\u4e0d\u80fd\u8fc1\u79fb\u5de5\u4f5c\u4e86\uff0c\u6240\u4ee5\u540e\u53f0\u5b9a\u65f6\u6267\u884c\u4e00\u5b9a\u6570\u91cf\u7684\u6570\u636e\u8fc1\u79fb\u3002<\/p>\n
sorted set<\/h3>\n
sorted set<\/code>\u6709\u5e8f\u96c6\u5408\u548c\u96c6\u5408\u4e00\u6837\u4e5f\u662f string \u7c7b\u578b\u5143\u7d20\u7684\u96c6\u5408\uff0c\u540c\u65f6\u4e5f\u4e0d\u5141\u8bb8\u6709\u91cd\u590d\u7684\u6210\u5458\u3002<\/p>\n
\u4e0d\u540c\u7684\u662fsorted set<\/code>\u4e2d\u7684\u6bcf\u4e2a\u5143\u7d20\u90fd\u4f1a\u5173\u8054\u4e00\u4e2a double \u7c7b\u578b\u7684\u5206\u6570\uff0csorted set<\/code>\u901a\u8fc7\u8fd9\u4e2a\u5206\u6570\u7ed9\u96c6\u5408\u4e2d\u7684\u6210\u5458\u8fdb\u884c\u4ece\u5c0f\u5230\u5927\u7684\u6392\u5e8f\u3002\u6709\u5e8f\u96c6\u5408\u4e2d\u7684\u6210\u5458\u662f\u552f\u4e00\u7684\uff0c\u5173\u8054\u7684 score \u53ef\u4ee5\u91cd\u590d\u3002<\/p>\n
\u5e38\u89c1\u7684\u547d\u4ee4<\/h4>\n
\u4e0b\u9762\u770b\u4e0b\u6709\u5e8f\u96c6\u5408\u4e2d\u5e38\u89c1\u7684\u547d\u4ee4<\/p>\n
# \u5411\u6709\u5e8f\u96c6\u5408\u6dfb\u52a0\u4e00\u4e2a\u6216\u591a\u4e2a\u6210\u5458\uff0c\u6216\u8005\u66f4\u65b0\u5df2\u5b58\u5728\u6210\u5458\u7684\u5206\u6570\nZADD key score1 member1 [score2 member2]\n\n# \u83b7\u53d6\u6709\u5e8f\u96c6\u5408\u7684\u6210\u5458\u6570\nZCARD key\n# \u8ba1\u7b97\u5728\u6709\u5e8f\u96c6\u5408\u4e2d\u6307\u5b9a\u533a\u95f4\u5206\u6570\u7684\u6210\u5458\u6570\nZCOUNT key min max\n# \u6709\u5e8f\u96c6\u5408\u4e2d\u5bf9\u6307\u5b9a\u6210\u5458\u7684\u5206\u6570\u52a0\u4e0a\u589e\u91cf increment\nZINCRBY key increment member\n# \u8ba1\u7b97\u7ed9\u5b9a\u7684\u4e00\u4e2a\u6216\u591a\u4e2a\u6709\u5e8f\u96c6\u7684\u4ea4\u96c6\u5e76\u5c06\u7ed3\u679c\u96c6\u5b58\u50a8\u5728\u65b0\u7684\u6709\u5e8f\u96c6\u5408 destination \u4e2d\nZINTERSTORE destination numkeys key [key ...]\n# \u5728\u6709\u5e8f\u96c6\u5408\u4e2d\u8ba1\u7b97\u6307\u5b9a\u5b57\u5178\u533a\u95f4\u5185\u6210\u5458\u6570\u91cf\nZLEXCOUNT key min max\n# \u901a\u8fc7\u7d22\u5f15\u533a\u95f4\u8fd4\u56de\u6709\u5e8f\u96c6\u5408\u6307\u5b9a\u533a\u95f4\u5185\u7684\u6210\u5458\nZRANGE key start stop [WITHSCORES]\n# \u901a\u8fc7\u5b57\u5178\u533a\u95f4\u8fd4\u56de\u6709\u5e8f\u96c6\u5408\u7684\u6210\u5458\nZRANGEBYLEX key min max [LIMIT offset count]\n# \u901a\u8fc7\u5206\u6570\u8fd4\u56de\u6709\u5e8f\u96c6\u5408\u6307\u5b9a\u533a\u95f4\u5185\u7684\u6210\u5458\nZRANGEBYSCORE key min max [WITHSCORES] [LIMIT]\n# \u8fd4\u56de\u6709\u5e8f\u96c6\u5408\u4e2d\u6307\u5b9a\u6210\u5458\u7684\u7d22\u5f15\nZRANK key member\n# \u79fb\u9664\u6709\u5e8f\u96c6\u5408\u4e2d\u7684\u4e00\u4e2a\u6216\u591a\u4e2a\u6210\u5458\nZREM key member [member ...]\n# \u79fb\u9664\u6709\u5e8f\u96c6\u5408\u4e2d\u7ed9\u5b9a\u7684\u5b57\u5178\u533a\u95f4\u7684\u6240\u6709\u6210\u5458\nZREMRANGEBYLEX key min max\n# \u79fb\u9664\u6709\u5e8f\u96c6\u5408\u4e2d\u7ed9\u5b9a\u7684\u6392\u540d\u533a\u95f4\u7684\u6240\u6709\u6210\u5458\nZREMRANGEBYRANK key start stop\n# \u79fb\u9664\u6709\u5e8f\u96c6\u5408\u4e2d\u7ed9\u5b9a\u7684\u5206\u6570\u533a\u95f4\u7684\u6240\u6709\u6210\u5458\nZREMRANGEBYSCORE key min max\n# \u8fd4\u56de\u6709\u5e8f\u96c6\u4e2d\u6307\u5b9a\u533a\u95f4\u5185\u7684\u6210\u5458\uff0c\u901a\u8fc7\u7d22\u5f15\uff0c\u5206\u6570\u4ece\u9ad8\u5230\u4f4e\nZREVRANGE key start stop [WITHSCORES]\n# \u8fd4\u56de\u6709\u5e8f\u96c6\u4e2d\u6307\u5b9a\u5206\u6570\u533a\u95f4\u5185\u7684\u6210\u5458\uff0c\u5206\u6570\u4ece\u9ad8\u5230\u4f4e\u6392\u5e8f\nZREVRANGEBYSCORE key max min [WITHSCORES]\n# \u8fd4\u56de\u6709\u5e8f\u96c6\u5408\u4e2d\u6307\u5b9a\u6210\u5458\u7684\u6392\u540d\uff0c\u6709\u5e8f\u96c6\u6210\u5458\u6309\u5206\u6570\u503c\u9012\u51cf(\u4ece\u5927\u5230\u5c0f)\u6392\u5e8f\nZREVRANK key member\n# \u8fd4\u56de\u6709\u5e8f\u96c6\u4e2d\uff0c\u6210\u5458\u7684\u5206\u6570\u503c\nZSCORE key member\n# \u8ba1\u7b97\u7ed9\u5b9a\u7684\u4e00\u4e2a\u6216\u591a\u4e2a\u6709\u5e8f\u96c6\u7684\u5e76\u96c6\uff0c\u5e76\u5b58\u50a8\u5728\u65b0\u7684 key \u4e2d\nZUNIONSTORE destination numkeys key [key ...]\n# \u8fed\u4ee3\u6709\u5e8f\u96c6\u5408\u4e2d\u7684\u5143\u7d20\uff08\u5305\u62ec\u5143\u7d20\u6210\u5458\u548c\u5143\u7d20\u5206\u503c\uff09\nZSCAN key cursor [MATCH pattern] [COUNT count]<\/pre>\n
\u6765\u4e2a\u6817\u5b50<\/p>\n
127.0.0.1:6379> ZADD test-sset 1 member1\n(integer) 1\n127.0.0.1:6379> ZADD test-sset 2 member2\n(integer) 1\n127.0.0.1:6379> ZADD test-sset 3 member3\n(integer) 1\n127.0.0.1:6379> ZADD test-sset 3 member3\n(integer) 0\n127.0.0.1:6379> ZADD test-sset 4 member3\n(integer) 0\n127.0.0.1:6379> ZADD test-sset 5 member5\n(integer) 1\n127.0.0.1:6379> ZRANGE test-sset 0 10 WITHSCORES\n1) \"member1\"\n2) \"1\"\n3) \"member2\"\n4) \"2\"\n5) \"member3\"\n6) \"4\"\n7) \"member5\"\n8) \"5\"<\/pre>\n
\u4f7f\u7528\u573a\u666f<\/h4>\n
\u6765\u770b\u4e0bsorted set<\/code>\u7684\u4f7f\u7528\u573a\u666f<\/p>\n
1\u3001\u901a\u8fc7 score \u7684\u6392\u5e8f\u529f\u80fd\uff0c\u53ef\u4ee5\u5b9e\u73b0\u7c7b\u4f3c\u6392\u884c\u699c\uff0c\u5b66\u4e60\u6210\u7ee9\u7684\u6392\u5e8f\u529f\u80fd\uff1b<\/p>\n
2\u3001\u4e5f\u53ef\u4ee5\u5b9e\u73b0\u5e26\u6743\u91cd\u961f\u5217\uff0c\u6bd4\u5982\u666e\u901a\u6d88\u606f\u7684 score \u4e3a1\uff0c\u91cd\u8981\u6d88\u606f\u7684 score \u4e3a2\uff0c\u7136\u540e\u5de5\u4f5c\u7ebf\u7a0b\u53ef\u4ee5\u9009\u62e9\u6309 score \u7684\u5012\u5e8f\u6765\u83b7\u53d6\u5de5\u4f5c\u4efb\u52a1\u3002\u8ba9\u91cd\u8981\u7684\u4efb\u52a1\u4f18\u5148\u6267\u884c\uff1b<\/p>\n
3\u3001\u4e5f\u53ef\u4ee5\u5b9e\u73b0\u4e00\u4e2a\u5ef6\u8fdf\u961f\u5217\uff0c\u5c06 score \u5b58\u50a8\u8fc7\u671f\u65f6\u95f4\uff0c\u4ece\u5c0f\u5230\u5927\u6392\u5e8f\uff0c\u6700\u9760\u524d\u7684\u5c31\u662f\u6700\u5148\u8fc7\u671f\u7684\u3002<\/p>\n
\u5206\u6790\u4e0b\u6e90\u7801\u5b9e\u73b0<\/h4>\n
sorted set<\/code> \u4e2d\u7684\u4ee3\u7801\u4e3b\u8981\u5728\u4e0b\u9762\u7684\u4e24\u4e2a\u6587\u4ef6\u4e2d<\/p>\n
\u7ed3\u6784\u5b9a\u4e49\uff1aserver.h<\/code><\/p>\n
\u5b9e\u73b0\uff1at_zset.c<\/code><\/p>\n
\u5148\u6765\u770b\u4e0bsorted set<\/code>\u7684\u6570\u636e\u7ed3\u6784<\/p>\n
typedef struct zset {\n    dict *dict;\n    zskiplist *zsl;\n} zset;\n\ntypedef struct zskiplist {\n    \/\/ \u5934\uff0c\u5c3e\u8282\u70b9\n    struct zskiplistNode *header, *tail;\n    \/\/ \u8282\u70b9\u6570\u91cf\n    unsigned long length;\n    \/\/ \u76ee\u524d\u8868\u5185\u8282\u70b9\u7684\u6700\u5927\u5c42\u6570\n    int level;\n} zskiplist;\n\/* ZSETs use a specialized version of Skiplists *\/\n\/\/ ZSETs \u4f7f\u7528\u7684\u662f\u7279\u5b9a\u7248\u7684 Skiplists\ntypedef struct zskiplistNode {\n    \/\/ \u8fd9\u91cc\u4f7f\u7528 sds \u5b58\u50a8\u5177\u4f53\u7684\u5143\u7d20\n    sds ele;\n    \/\/ \u5143\u7d20\u7684\u6743\u91cd\n    double score;\n    \/\/ \u540e\u5411\u6307\u9488\uff08\u4e3a\u4e86\u4fbf\u4e8e\u4ece\u8df3\u8868\u7684\u5c3e\u8282\u70b9\u5012\u5e8f\u67e5\u627e\uff09\n    struct zskiplistNode *backward;\n    \/\/ \u5c42\n    \/\/ \u4fdd\u5b58\u7740\u6307\u5411\u5176\u4ed6\u5143\u7d20\u7684\u6307\u9488\u3002\u9ad8\u5c42\u7684\u6307\u9488\u8d8a\u8fc7\u7684\u5143\u7d20\u6570\u91cf\u5927\u4e8e\u7b49\u4e8e\u4f4e\u5c42\u7684\u6307\u9488\uff0c\u4e3a\u4e86\u63d0\u9ad8\u67e5\u627e\u7684\u6548\u7387\uff0c\u7a0b\u5e8f\u603b\u662f\u4ece\u9ad8\u5c42\u5148\u5f00\u59cb\u8bbf\u95ee\uff0c\u7136\u540e\u968f\u7740\u5143\u7d20\u503c\u8303\u56f4\u7684\u7f29\u5c0f\uff0c\u6162\u6162\u964d\u4f4e\u5c42\u6b21\u3002\n    struct zskiplistLevel {\n        \/\/ \u8282\u70b9\u4e0a\u7684\u524d\u5411\u6307\u9488\n        struct zskiplistNode *forward;\n        \/\/ \u8de8\u5ea6\n        \/\/ \u7528\u4e8e\u8bb0\u5f55\u4e24\u4e2a\u8282\u70b9\u4e4b\u95f4\u7684\u8ddd\u79bb\n        unsigned long span;\n    } level[];\n} zskiplistNode;<\/pre>\n
\u770b\u4e0a\u9762\u7684\u6570\u636e\u7ed3\u6784\u53ef\u4ee5\u53d1\u73b0sorted set<\/code>\u7684\u5b9e\u73b0\u4e3b\u8981\u4f7f\u7528\u4e86 dict \u548c zskiplist \u4e24\u79cd\u6570\u636e\u7ed3\u6784\u3002\u4e0d\u8fc7sorted set<\/code>\u5728\u5143\u7d20\u8f83\u5c11\u7684\u60c5\u51b5\u4e0b\u4f7f\u7528\u7684\u538b\u7f29\u5217\u8868\uff0c\u5177\u4f53\u7ec6\u8282\u53c2\u89c1\u4e0b\u6587\u7684 zsetAdd \u51fd\u6570\u3002<\/p>\n
<\/p>\n
ZADD<\/h5>\n
\u6765\u770b\u4e0b ZADD \u7684\u63d2\u5165<\/p>\n
\/\/ \u4ee3\u7801\u5730\u5740 https:\/\/github.com\/redis\/redis\/blob\/6.2\/src\/t_zset.c\n\/\/ ZADD \u547d\u4ee4\nvoid zaddCommand(client *c) {\n    zaddGenericCommand(c,ZADD_IN_NONE);\n}\n\n\/* This generic command implements both ZADD and ZINCRBY. *\/\nvoid zaddGenericCommand(client *c, int flags) {\n    ...\n    \/* Lookup the key and create the sorted set if does not exist. *\/\n    zobj = lookupKeyWrite(c->db,key);\n    if (checkType(c,zobj,OBJ_ZSET)) goto cleanup;\n    if (zobj == NULL) {\n        if (xx) goto reply_to_client; \/* No key + XX option: nothing to do. *\/\n        \/\/ \u8d85\u8fc7\u9608\u503c\uff08zset-max-ziplist-entries\u3001zset-max-ziplist-value\uff09\u540e\uff0c\u4f7f\u7528 hashtable + skiplist \u5b58\u50a8\n        if (server.zset_max_ziplist_entries == 0 ||\n            server.zset_max_ziplist_value argv[scoreidx+1]->ptr))\n        {\n            zobj = createZsetObject();\n        } else {\n            zobj = createZsetZiplistObject();\n        }\n        dbAdd(c->db,key,zobj);\n    }\n\/\/ \u770b\u4e0b\u5177\u4f53\u7684\u63d2\u5165\u8fc7\u7a0b\nint zsetAdd(robj *zobj, double score, sds ele, int in_flags, int *out_flags, double *newscore) {\n    \/* Turn options into simple to check vars. *\/\n    int incr = (in_flags & ZADD_IN_INCR) != 0;\n    int nx = (in_flags & ZADD_IN_NX) != 0;\n    int xx = (in_flags & ZADD_IN_XX) != 0;\n    int gt = (in_flags & ZADD_IN_GT) != 0;\n    int lt = (in_flags & ZADD_IN_LT) != 0;\n    \/* Update the sorted set according to its encoding. *\/\n    \/\/ \u5982\u679c\u7c7b\u578b\u662f ZIPLIST\n    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {\n        unsigned char *eptr;\n        if ((eptr = zzlFind(zobj->ptr,ele,&curscore)) != NULL) {\n             ...\n            \/* Remove and re-insert when score changed. *\/\n            \/\/ \u5f53\u5206\u6570\u6539\u53d8\u65f6\u79fb\u9664\u5e76\u91cd\u65b0\u63d2\u5165\n            if (score != curscore) {\n                zobj->ptr = zzlDelete(zobj->ptr,eptr);\n                zobj->ptr = zzlInsert(zobj->ptr,ele,score);\n                *out_flags |= ZADD_OUT_UPDATED;\n            }\n            return 1;\n        \/\/ \u65b0\u5143\u7d20\n        } else if (!xx) {\n            \/* check if the element is too large or the list\n             * becomes too long *before* executing zzlInsert. *\/\n            \/\/ \u5982\u679c\u5143\u7d20\u8fc7\u5927\u5c31\u4f7f\u7528\u8df3\u8868\n            if (zzlLength(zobj->ptr)+1 > server.zset_max_ziplist_entries ||\n                sdslen(ele) > server.zset_max_ziplist_value ||\n                !ziplistSafeToAdd(zobj->ptr, sdslen(ele)))\n            {\n                zsetConvert(zobj,OBJ_ENCODING_SKIPLIST);\n            } else {\n                if (newscore) *newscore = score;\n                *out_flags |= ZADD_OUT_ADDED;\n                return 1;\n            *out_flags |= ZADD_OUT_NOP;\n    \/* Note that the above block handling ziplist would have either returned or\n     * converted the key to skiplist. *\/\n    \/\/ \u8868\u793a\u4f7f\u7528\u7684\u7c7b\u578b\u662f\u8df3\u8868\n    if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {\n        zset *zs = zobj->ptr;\n        zskiplistNode *znode;\n        dictEntry *de;\n        \/\/ \u5728\u54c8\u5e0c\u8868\u4e2d\u67e5\u627e\u5143\u7d20\n        de = dictFind(zs->dict,ele);\n        if (de != NULL) {\n            \/* NX? Return, same element already exists. *\/\n            if (nx) {\n                *out_flags |= ZADD_OUT_NOP;\n            \/\/ \u54c8\u5e0c\u8868\u4e2d\u83b7\u53d6\u5143\u7d20\u7684\u6743\u91cd\n            curscore = *(double*)dictGetVal(de);\n            \/* Prepare the score for the increment if needed. *\/\n            \/\/ \u66f4\u65b0\u6743\u91cd\u503c\n            if (incr) {\n                score += curscore;\n                if (isnan(score)) {\n                    *out_flags |= ZADD_OUT_NAN;\n                    return 0;\n                }\n            \/* GT\/LT? Only update if score is greater\/less than current. *\/\n            if ((lt && score >= curscore) || (gt && score zsl,curscore,ele,score);\n                \/* Note that we did not removed the original element from\n                 * the hash table representing the sorted set, so we just\n                 * update the score. *\/\n                dictGetVal(de) = &znode->score; \/* Update score ptr. *\/\n        \/\/ \u5982\u679c\u65b0\u5143\u7d20\u4e0d\u5b58\u5728\n            ele = sdsdup(ele);\n            \/\/ \u63d2\u5165\u5230\u8df3\u8868\u8282\u70b9\n            znode = zslInsert(zs->zsl,score,ele);\n            \/\/ \u5728\u54c8\u5e0c\u8868\u4e2d\u63d2\u5165\n            serverAssert(dictAdd(zs->dict,ele,&znode->score) == DICT_OK);\n            *out_flags |= ZADD_OUT_ADDED;\n    } else {\n        serverPanic(\"Unknown sorted set encoding\");\n    return 0; \/* Never reached. *\/<\/pre>\n
sorted set<\/code> \u7684\u63d2\u5165\u4f7f\u7528\u4e86\u4e24\u79cd\u7b56\u7565<\/p>\n
1\u3001\u5982\u679c\u63d2\u5165\u7684\u6570\u636e\u91cf\u548c\u957f\u5ea6\u6ca1\u6709\u8fbe\u5230\u9600\u503c\uff0c\u5c31\u4f7f\u7528\u538b\u7f29\u5217\u8868\u8fdb\u884c\u4fdd\u5b58\uff0c\u53cd\u4e4b\u5c31\u4f7f\u7528\u8df3\u8868\u52a0\u54c8\u5e0c\u8868\u7684\u7ec4\u5408\u65b9\u5f0f\u8fdb\u884c\u4fdd\u5b58\uff1b<\/p>\n
2\u3001\u538b\u7f29\u5217\u8868\u672c\u8eab\u662f\u5c31\u4e0d\u9002\u5408\u4fdd\u5b58\u8fc7\u591a\u7684\u5143\u7d20\uff0c\u6240\u4ee5\u8fbe\u5230\u9600\u503c\u4f7f\u7528\u8df3\u8868\u52a0\u54c8\u5e0c\u8868\u7684\u7ec4\u5408\u65b9\u5f0f\u8fdb\u884c\u4fdd\u5b58\uff1b<\/p>\n
3\u3001\u8fd9\u91cc\u8df3\u8868\u52a0\u54c8\u5e0c\u8868\u7684\u7ec4\u5408\u65b9\u5f0f\u4e5f\u662f\u5f88\u5de7\u5999\u7684\uff0c\u8df3\u8868\u7528\u6765\u8fdb\u884c\u8303\u56f4\u7684\u67e5\u8be2\uff0c\u901a\u8fc7\u54c8\u5e0c\u8868\u6765\u5b9e\u73b0\u5355\u4e2a\u5143\u7d20\u6743\u91cd\u503c\u7684\u67e5\u8be2\uff0c\u7ec4\u5408\u7684\u65b9\u5f0f\u63d0\u9ad8\u4e86\u67e5\u8be2\u7684\u6548\u7387\uff1b<\/p>\n
<\/p>\n
ZRANGE<\/h5>\n
\u770b\u5b8c\u4e86\u63d2\u5165\u51fd\u6570\uff0c\u8fd9\u91cc\u518d\u6765\u5206\u6790\u4e0b ZRANGE<\/p>\n
\/\/ \u83b7\u53d6\u6709\u5e8f\u96c6\u5408\u4e2d, \u6307\u5b9a\u6570\u636e\u7684\u6392\u540d.\n\/\/ \u82e5reverse==0, \u6392\u540d\u4ee5\u5f97\u5206\u5347\u5e8f\u6392\u5217. \u5426\u5219\u6392\u540d\u4ee5\u5f97\u5206\u964d\u5e8f\u6392\u5217.\n\/\/ \u7b2c\u4e00\u4e2a\u6570\u636e\u7684\u6392\u540d\u4e3a0, \u800c\u4e0d\u662f1\n\/\/ \u4f7f\u7528\u538b\u7f29\u5217\u8868\u6216\u8005\u8df3\u8868\uff0c\u91cc\u9762\u7684\u6570\u636e\u90fd\u662f\u6392\u597d\u5e8f\u7684\nlong zsetRank(robj *zobj, sds ele, int reverse) {\n    unsigned long llen;\n    unsigned long rank;\n\n    llen = zsetLength(zobj);\n    \/\/ \u538b\u7f29\u5217\u8868\n    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {\n        unsigned char *zl = zobj->ptr;\n        unsigned char *eptr, *sptr;\n        eptr = ziplistIndex(zl,0);\n        serverAssert(eptr != NULL);\n        sptr = ziplistNext(zl,eptr);\n        serverAssert(sptr != NULL);\n        rank = 1;\n        while(eptr != NULL) {\n            if (ziplistCompare(eptr,(unsigned char*)ele,sdslen(ele)))\n                break;\n            rank++;\n            zzlNext(zl,&eptr,&sptr);\n        }\n        if (eptr != NULL) {\n             \/\/ \u9006\u5411\u53d6rank\n             \/\/ \u8fd4\u56de\u540e\u9762\u7684\u6570\u636e\n            if (reverse)\n                return llen-rank;\n            else\n                return rank-1;\n        } else {\n            return -1;\n    \/\/ \u8df3\u8868\n    } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {\n        zset *zs = zobj->ptr;\n        zskiplist *zsl = zs->zsl;\n        dictEntry *de;\n        double score;\n        de = dictFind(zs->dict,ele);\n        if (de != NULL) {\n            score = *(double*)dictGetVal(de);\n            \/\/ \u67e5\u627e\u5305\u542b\u7ed9\u5b9a\u5206\u503c\u548c\u6210\u5458\u5bf9\u8c61\u7684\u8282\u70b9\u5728\u8df3\u8dc3\u8868\u4e2d\u7684\u6392\u4f4d\n            rank = zslGetRank(zsl,score,ele);\n            \/* Existing elements always have a rank. *\/\n            serverAssert(rank != 0);\n            \/\/ \u9006\u5411\u53d6rank\n    } else {\n        serverPanic(\"Unknown sorted set encoding\");\n    }\n}\n\/*\n * \u67e5\u627e\u5305\u542b\u7ed9\u5b9a\u5206\u503c\u548c\u6210\u5458\u5bf9\u8c61\u7684\u8282\u70b9\u5728\u8df3\u8dc3\u8868\u4e2d\u7684\u6392\u4f4d\u3002\n *\n * \u5982\u679c\u6ca1\u6709\u5305\u542b\u7ed9\u5b9a\u5206\u503c\u548c\u6210\u5458\u5bf9\u8c61\u7684\u8282\u70b9\uff0c\u8fd4\u56de 0 \uff0c\u5426\u5219\u8fd4\u56de\u6392\u4f4d\u3002\n * \u6ce8\u610f\uff0c\u56e0\u4e3a\u8df3\u8dc3\u8868\u7684\u8868\u5934\u4e5f\u88ab\u8ba1\u7b97\u5728\u5185\uff0c\u6240\u4ee5\u8fd4\u56de\u7684\u6392\u4f4d\u4ee5 1 \u4e3a\u8d77\u59cb\u503c\u3002\n * T_wrost = O(N), T_avg = O(log N)\n *\/\nunsigned long zslGetRank(zskiplist *zsl, double score, sds ele) {\n    zskiplistNode *x;\n    unsigned long rank = 0;\n    int i;\n    x = zsl->header;\n    for (i = zsl->level-1; i >= 0; i--) {\n        \/\/ \u904d\u5386\u6240\u6709\u5bf9\u6bd4\u7684\u8282\u70b9\n        while (x->level[i].forward &&\n            (x->level[i].forward->score level[i].forward->score == score &&\n                sdscmp(x->level[i].forward->ele,ele) level[i].span;\n            \/\/ \u6cbf\u7740\u524d\u8fdb\u6307\u9488\u904d\u5386\u8df3\u8dc3\u8868\n            x = x->level[i].forward;\n        \/* x might be equal to zsl->header, so test if obj is non-NULL *\/\n        if (x->ele && sdscmp(x->ele,ele) == 0) {\n            return rank;\n    return 0;<\/pre>\n
\u901a\u8fc7\u7d22\u5f15\u533a\u95f4\u8fd4\u56de\u6709\u5e8f\u96c6\u5408\u6307\u5b9a\u533a\u95f4\u5185\u7684\u6210\u5458\uff0c\u56e0\u4e3a\u6570\u636e\u5728\u63d2\u5165\u7684\u65f6\u5019\uff0c\u5df2\u7ecf\u6309\u7167\u4ece\u5c0f\u5230\u5927\u8fdb\u884c\u4e86\uff0c\u6392\u5e8f\uff0c\u6240\u4ee5\u8fd4\u56de\u6307\u5b9a\u533a\u95f4\u7684\u6210\u5458\uff0c\u904d\u5386\u5bf9\u5e94\u7684\u6570\u636e\u5373\u53ef\u3002<\/p>\n
\u603b\u7ed3<\/h3>\n
1\u3001Redis \u7684 Set \u662f String \u7c7b\u578b\u7684\u65e0\u5e8f\u96c6\u5408\uff0c\u96c6\u5408\u6210\u5458\u662f\u552f\u4e00\u7684\uff1b<\/p>\n
2\u3001sorted set<\/code>\u6709\u5e8f\u96c6\u5408\u548c\u96c6\u5408\u4e00\u6837\u4e5f\u662f string \u7c7b\u578b\u5143\u7d20\u7684\u96c6\u5408\uff0c\u540c\u65f6\u4e5f\u4e0d\u5141\u8bb8\u6709\u91cd\u590d\u7684\u6210\u5458\u3002\u4e0d\u540c\u7684\u662fsorted set<\/code>\u4e2d\u7684\u6bcf\u4e2a\u5143\u7d20\u90fd\u4f1a\u5173\u8054\u4e00\u4e2a double \u7c7b\u578b\u7684\u5206\u6570\uff1b<\/p>\n
3\u3001set \u5e95\u5c42\u5b9e\u73b0\u4e3b\u8981\u7528\u5230\u4e86\u4e24\u79cd\u6570\u636e\u7ed3\u6784 hashtable \u548c inset(\u6574\u6570\u96c6\u5408)\uff1b<\/p>\n
4\u3001sorted set<\/code>\u5728\u5143\u7d20\u8f83\u5c11\u7684\u60c5\u51b5\u4e0b\u4f7f\u7528\u7684\u538b\u7f29\u5217\u8868\u5b58\u50a8\u6570\u636e\uff0c\u6570\u636e\u91cf\u8d85\u8fc7\u9600\u503c\u7684\u65f6\u5019 \u4f7f\u7528 dict \u52a0 zskiplist \u6765\u5b58\u50a8\u6570\u636e\uff1b<\/p>\n
4\u3001\u8df3\u8868\u52a0\u54c8\u5e0c\u8868\u7684\u7ec4\u5408\u65b9\u5f0f\u4e5f\u662f\u5f88\u5de7\u5999\u7684\uff0c\u8df3\u8868\u7528\u6765\u8fdb\u884c\u8303\u56f4\u7684\u67e5\u8be2\uff0c\u901a\u8fc7\u54c8\u5e0c\u8868\u6765\u5b9e\u73b0\u5355\u4e2a\u5143\u7d20\u6743\u91cd\u503c\u7684\u67e5\u8be2\uff0c\u7ec4\u5408\u7684\u65b9\u5f0f\u63d0\u9ad8\u4e86\u67e5\u8be2\u7684\u6548\u7387\u3002<\/p>\n
\u53c2\u8003<\/h3>\n
\u3010Redis\u6838\u5fc3\u6280\u672f\u4e0e\u5b9e\u6218\u3011
\u3010Redis\u8bbe\u8ba1\u4e0e\u5b9e\u73b0\u3011
\u3010redis \u96c6\u5408\uff08set\uff09\u7c7b\u578b\u7684\u4f7f\u7528\u548c\u5e94\u7528\u573a\u666f\u3011
\u3010\u8df3\u8dc3\u8868\u3011
\u3010Redis\u5b66\u4e60\u7b14\u8bb0\u3011
\u3010Redis \u4e2d\u7684 set \u548c sorted set \u5982\u4f55\u4f7f\u7528\u3011<\/p>\n","protected":false},"excerpt":{"rendered":"
Redis\u6e90\u7801\u5206\u6790\u4e4bset&nb...<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[101],"tags":[],"class_list":["post-201274","post","type-post","status-publish","format-standard","hentry","category-database"],"_links":{"self":[{"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/posts\/201274","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/comments?post=201274"}],"version-history":[{"count":0,"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/posts\/201274\/revisions"}],"wp:attachment":[{"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/media?parent=201274"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/categories?post=201274"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/tags?post=201274"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}