typo fix
This commit is contained in:
parent
e216ceaf0e
commit
321dfe1b3c
|
@ -74,7 +74,7 @@ typedef struct streamConsumer {
|
||||||
consumer not yet acknowledged. Keys are
|
consumer not yet acknowledged. Keys are
|
||||||
big endian message IDs, while values are
|
big endian message IDs, while values are
|
||||||
the same streamNACK structure referenced
|
the same streamNACK structure referenced
|
||||||
in the "pel" of the conumser group structure
|
in the "pel" of the consumer group structure
|
||||||
itself, so the value is shared. */
|
itself, so the value is shared. */
|
||||||
} streamConsumer;
|
} streamConsumer;
|
||||||
|
|
||||||
|
|
|
@ -676,7 +676,7 @@ void srandmemberWithCountCommand(client *c) {
|
||||||
* In this case we create a set from scratch with all the elements, and
|
* In this case we create a set from scratch with all the elements, and
|
||||||
* subtract random elements to reach the requested number of elements.
|
* subtract random elements to reach the requested number of elements.
|
||||||
*
|
*
|
||||||
* This is done because if the number of requsted elements is just
|
* This is done because if the number of requested elements is just
|
||||||
* a bit less than the number of elements in the set, the natural approach
|
* a bit less than the number of elements in the set, the natural approach
|
||||||
* used into CASE 3 is highly inefficient. */
|
* used into CASE 3 is highly inefficient. */
|
||||||
if (count*SRANDMEMBER_SUB_STRATEGY_MUL > size) {
|
if (count*SRANDMEMBER_SUB_STRATEGY_MUL > size) {
|
||||||
|
|
|
@ -244,7 +244,7 @@ int zslDelete(zskiplist *zsl, double score, sds ele, zskiplistNode **node) {
|
||||||
return 0; /* not found */
|
return 0; /* not found */
|
||||||
}
|
}
|
||||||
|
|
||||||
/* Update the score of an elmenent inside the sorted set skiplist.
|
/* Update the score of an element inside the sorted set skiplist.
|
||||||
* Note that the element must exist and must match 'score'.
|
* Note that the element must exist and must match 'score'.
|
||||||
* This function does not update the score in the hash table side, the
|
* This function does not update the score in the hash table side, the
|
||||||
* caller should take care of it.
|
* caller should take care of it.
|
||||||
|
@ -1307,7 +1307,7 @@ int zsetScore(robj *zobj, sds member, double *score) {
|
||||||
* The commad as a side effect of adding a new element may convert the sorted
|
* The commad as a side effect of adding a new element may convert the sorted
|
||||||
* set internal encoding from ziplist to hashtable+skiplist.
|
* set internal encoding from ziplist to hashtable+skiplist.
|
||||||
*
|
*
|
||||||
* Memory managemnet of 'ele':
|
* Memory management of 'ele':
|
||||||
*
|
*
|
||||||
* The function does not take ownership of the 'ele' SDS string, but copies
|
* The function does not take ownership of the 'ele' SDS string, but copies
|
||||||
* it if needed. */
|
* it if needed. */
|
||||||
|
|
|
@ -317,7 +317,7 @@ unsigned int zipIntSize(unsigned char encoding) {
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
/* Write the encoidng header of the entry in 'p'. If p is NULL it just returns
|
/* Write the encoding header of the entry in 'p'. If p is NULL it just returns
|
||||||
* the amount of bytes required to encode such a length. Arguments:
|
* the amount of bytes required to encode such a length. Arguments:
|
||||||
*
|
*
|
||||||
* 'encoding' is the encoding we are using for the entry. It could be
|
* 'encoding' is the encoding we are using for the entry. It could be
|
||||||
|
@ -914,7 +914,7 @@ unsigned char *ziplistMerge(unsigned char **first, unsigned char **second) {
|
||||||
} else {
|
} else {
|
||||||
/* !append == prepending to target */
|
/* !append == prepending to target */
|
||||||
/* Move target *contents* exactly size of (source - [END]),
|
/* Move target *contents* exactly size of (source - [END]),
|
||||||
* then copy source into vacataed space (source - [END]):
|
* then copy source into vacated space (source - [END]):
|
||||||
* [SOURCE - END, TARGET - HEADER] */
|
* [SOURCE - END, TARGET - HEADER] */
|
||||||
memmove(target + source_bytes - ZIPLIST_END_SIZE,
|
memmove(target + source_bytes - ZIPLIST_END_SIZE,
|
||||||
target + ZIPLIST_HEADER_SIZE,
|
target + ZIPLIST_HEADER_SIZE,
|
||||||
|
|
Loading…
Reference in New Issue