summaryrefslogtreecommitdiff
path: root/src/t_set.c
diff options
context:
space:
mode:
authorguiquanz <nantangguyun@gmail.com>2013-01-17 01:00:20 +0800
committerantirez <antirez@gmail.com>2013-01-19 11:08:43 +0100
commit560e049947779a7cae29c7bd924bd86834275022 (patch)
treefcd6b4057c5075613235ae4f15c15a2cc74deeb3 /src/t_set.c
parentc2b43eac4f35fa1137a5539387c389a43e62725f (diff)
downloadredis-560e049947779a7cae29c7bd924bd86834275022.tar.gz
Fixed many typos.
Diffstat (limited to 'src/t_set.c')
-rw-r--r--src/t_set.c4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/t_set.c b/src/t_set.c
index 46a0c6ee5..3064807d1 100644
--- a/src/t_set.c
+++ b/src/t_set.c
@@ -188,7 +188,7 @@ robj *setTypeNextObject(setTypeIterator *si) {
* The caller provides both pointers to be populated with the right
* object. The return value of the function is the object->encoding
* field of the object and is used by the caller to check if the
- * int64_t pointer or the redis object pointere was populated.
+ * int64_t pointer or the redis object pointer was populated.
*
* When an object is returned (the set was a real set) the ref count
* of the object is not incremented so this function can be considered
@@ -598,7 +598,7 @@ void sinterGenericCommand(redisClient *c, robj **setkeys, unsigned long setnum,
sets[j] = setobj;
}
/* Sort sets from the smallest to largest, this will improve our
- * algorithm's performace */
+ * algorithm's performance */
qsort(sets,setnum,sizeof(robj*),qsortCompareSetsByCardinality);
/* The first thing we should output is the total number of elements...