mirror of
https://codeberg.org/redict/redict.git
synced 2025-01-24 00:59:02 -05:00
b9a0500f16
New commands: `HRANDFIELD [<count> [WITHVALUES]]` `ZRANDMEMBER [<count> [WITHSCORES]]` Algorithms are similar to the one in SRANDMEMBER. Both return a simple bulk response when no arguments are given, and an array otherwise. In case values/scores are requested, RESP2 returns a long array, and RESP3 a nested array. note: in all 3 commands, the only option that also provides random order is the one with negative count. Changes to SRANDMEMBER * Optimization when count is 1, we can use the more efficient algorithm of non-unique random * optimization: work with sds strings rather than robj Other changes: * zzlGetScore: when zset needs to convert string to double, we use safer memcpy (in case the buffer is too small) * Solve a "bug" in SRANDMEMBER test: it intended to test a positive count (case 3 or case 4) and by accident used a negative count Co-authored-by: xinluton <xinluton@qq.com> Co-authored-by: Oran Agra <oran@redislabs.com>
72 lines
3.6 KiB
C
72 lines
3.6 KiB
C
/*
|
|
* Copyright (c) 2009-2012, Pieter Noordhuis <pcnoordhuis at gmail dot com>
|
|
* Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* * Redistributions of source code must retain the above copyright notice,
|
|
* this list of conditions and the following disclaimer.
|
|
* * Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* * Neither the name of Redis nor the names of its contributors may be used
|
|
* to endorse or promote products derived from this software without
|
|
* specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#ifndef _ZIPLIST_H
|
|
#define _ZIPLIST_H
|
|
|
|
#define ZIPLIST_HEAD 0
|
|
#define ZIPLIST_TAIL 1
|
|
|
|
/* Each entry in the ziplist is either a string or an integer. */
|
|
typedef struct {
|
|
/* When string is used, it is provided with the length (slen). */
|
|
unsigned char *sval;
|
|
unsigned int slen;
|
|
/* When integer is used, 'sval' is NULL, and lval holds the value. */
|
|
long long lval;
|
|
} ziplistEntry;
|
|
|
|
unsigned char *ziplistNew(void);
|
|
unsigned char *ziplistMerge(unsigned char **first, unsigned char **second);
|
|
unsigned char *ziplistPush(unsigned char *zl, unsigned char *s, unsigned int slen, int where);
|
|
unsigned char *ziplistIndex(unsigned char *zl, int index);
|
|
unsigned char *ziplistNext(unsigned char *zl, unsigned char *p);
|
|
unsigned char *ziplistPrev(unsigned char *zl, unsigned char *p);
|
|
unsigned int ziplistGet(unsigned char *p, unsigned char **sval, unsigned int *slen, long long *lval);
|
|
unsigned char *ziplistInsert(unsigned char *zl, unsigned char *p, unsigned char *s, unsigned int slen);
|
|
unsigned char *ziplistDelete(unsigned char *zl, unsigned char **p);
|
|
unsigned char *ziplistDeleteRange(unsigned char *zl, int index, unsigned int num);
|
|
unsigned int ziplistCompare(unsigned char *p, unsigned char *s, unsigned int slen);
|
|
unsigned char *ziplistFind(unsigned char *zl, unsigned char *p, unsigned char *vstr, unsigned int vlen, unsigned int skip);
|
|
unsigned int ziplistLen(unsigned char *zl);
|
|
size_t ziplistBlobLen(unsigned char *zl);
|
|
void ziplistRepr(unsigned char *zl);
|
|
typedef int (*ziplistValidateEntryCB)(unsigned char* p, void* userdata);
|
|
int ziplistValidateIntegrity(unsigned char *zl, size_t size, int deep,
|
|
ziplistValidateEntryCB entry_cb, void *cb_userdata);
|
|
void ziplistRandomPair(unsigned char *zl, unsigned long total_count, ziplistEntry *key, ziplistEntry *val);
|
|
void ziplistRandomPairs(unsigned char *zl, int count, ziplistEntry *keys, ziplistEntry *vals);
|
|
|
|
#ifdef REDIS_TEST
|
|
int ziplistTest(int argc, char *argv[]);
|
|
#endif
|
|
|
|
#endif /* _ZIPLIST_H */
|