From d8bd12f984d3d5f78c0bcc9819fe002a3b379308 Mon Sep 17 00:00:00 2001 From: antirez Date: Wed, 11 Jan 2012 20:25:41 +0100 Subject: [PATCH 1/1] error in comment fixed --- src/t_zset.c | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/t_zset.c b/src/t_zset.c index f42e5a31..fe65bf75 100644 --- a/src/t_zset.c +++ b/src/t_zset.c @@ -17,7 +17,7 @@ /* This skiplist implementation is almost a C translation of the original * algorithm described by William Pugh in "Skip Lists: A Probabilistic * Alternative to Balanced Trees", modified in three ways: - * a) this implementation allows for repeated values. + * a) this implementation allows for repeated scores. * b) the comparison is not just by key (our 'score') but by satellite data. * c) there is a back pointer, so it's a doubly linked list with the back * pointers being only at "level 1". This allows to traverse the list -- 2.45.2