mirror of https://github.com/redis/redis.git
Minor typo fix
This commit is contained in:
parent
479f7f7af4
commit
267e0e6994
|
@ -245,7 +245,7 @@ double *zslDefrag(zskiplist *zsl, double score, sds oldele, sds newele) {
|
||||||
return NULL;
|
return NULL;
|
||||||
}
|
}
|
||||||
|
|
||||||
/* Defrag helpler for sorted set.
|
/* Defrag helper for sorted set.
|
||||||
* Defrag a single dict entry key name, and corresponding skiplist struct */
|
* Defrag a single dict entry key name, and corresponding skiplist struct */
|
||||||
long activeDefragZsetEntry(zset *zs, dictEntry *de) {
|
long activeDefragZsetEntry(zset *zs, dictEntry *de) {
|
||||||
sds newsds;
|
sds newsds;
|
||||||
|
|
|
@ -154,7 +154,7 @@ int latencyResetEvent(char *event_to_reset) {
|
||||||
|
|
||||||
/* Analyze the samples available for a given event and return a structure
|
/* Analyze the samples available for a given event and return a structure
|
||||||
* populate with different metrics, average, MAD, min, max, and so forth.
|
* populate with different metrics, average, MAD, min, max, and so forth.
|
||||||
* Check latency.h definition of struct latenctStat for more info.
|
* Check latency.h definition of struct latencyStats for more info.
|
||||||
* If the specified event has no elements the structure is populate with
|
* If the specified event has no elements the structure is populate with
|
||||||
* zero values. */
|
* zero values. */
|
||||||
void analyzeLatencyForEvent(char *event, struct latencyStats *ls) {
|
void analyzeLatencyForEvent(char *event, struct latencyStats *ls) {
|
||||||
|
|
|
@ -58,7 +58,7 @@
|
||||||
* successive nodes having a single child are "compressed" into the node
|
* successive nodes having a single child are "compressed" into the node
|
||||||
* itself as a string of characters, each representing a next-level child,
|
* itself as a string of characters, each representing a next-level child,
|
||||||
* and only the link to the node representing the last character node is
|
* and only the link to the node representing the last character node is
|
||||||
* provided inside the representation. So the above representation is turend
|
* provided inside the representation. So the above representation is turned
|
||||||
* into:
|
* into:
|
||||||
*
|
*
|
||||||
* ["foo"] ""
|
* ["foo"] ""
|
||||||
|
|
Loading…
Reference in New Issue