From 11e81a1e9ad1d1b4639aa8ed3fd2616ed8d1f176 Mon Sep 17 00:00:00 2001 From: antirez Date: Thu, 5 Dec 2013 16:35:32 +0100 Subject: Fixed grammar: before H the article is a, not an. --- src/db.c | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) (limited to 'src/db.c') diff --git a/src/db.c b/src/db.c index 1bdcf9e83..be71d2592 100644 --- a/src/db.c +++ b/src/db.c @@ -370,7 +370,7 @@ int parseScanCursorOrReply(redisClient *c, robj *o, unsigned long *cursor) { } /* This command implements SCAN, HSCAN and SSCAN commands. - * If object 'o' is passed, then it must be an Hash or Set object, otherwise + * If object 'o' is passed, then it must be a Hash or Set object, otherwise * if 'o' is NULL the command will operate on the dictionary associated with * the current database. * @@ -378,7 +378,7 @@ int parseScanCursorOrReply(redisClient *c, robj *o, unsigned long *cursor) { * the client arguments vector is a key so it skips it before iterating * in order to parse options. * - * In the case of an Hash object the function returns both the field and value + * In the case of a Hash object the function returns both the field and value * of every element on the Hash. */ void scanGenericCommand(redisClient *c, robj *o, unsigned long cursor) { int rv; @@ -433,12 +433,12 @@ void scanGenericCommand(redisClient *c, robj *o, unsigned long cursor) { /* Step 2: Iterate the collection. * * Note that if the object is encoded with a ziplist, intset, or any other - * representation that is not an hash table, we are sure that it is also + * representation that is not a hash table, we are sure that it is also * composed of a small number of elements. So to avoid taking state we * just return everything inside the object in a single call, setting the * cursor to zero to signal the end of the iteration. */ - /* Handle the case of an hash table. */ + /* Handle the case of a hash table. */ ht = NULL; if (o == NULL) { ht = c->db->dict; @@ -520,7 +520,7 @@ void scanGenericCommand(redisClient *c, robj *o, unsigned long cursor) { listDelNode(keys, node); } - /* If this is an hash or a sorted set, we have a flat list of + /* If this is a hash or a sorted set, we have a flat list of * key-value elements, so if this element was filtered, remove the * value, or skip it if it was not filtered: we only match keys. */ if (o && (o->type == REDIS_ZSET || o->type == REDIS_HASH)) { -- cgit v1.2.1