Skip to content
GitLab
Menu
Projects
Groups
Snippets
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
Menu
Open sidebar
ruanhaishen
redis
Commits
65fd32ab
Commit
65fd32ab
authored
Apr 07, 2012
by
Erik Dubbelboer
Browse files
Fixed some spelling errors in the comments
parent
69e79589
Changes
4
Hide whitespace changes
Inline
Side-by-side
src/dict.c
View file @
65fd32ab
...
...
@@ -116,8 +116,8 @@ unsigned int dictGenCaseHashFunction(const unsigned char *buf, int len) {
/* ----------------------------- API implementation ------------------------- */
/* Reset a
n
hashtable already initialized with ht_init().
* NOTE: This function should only called by ht_destroy(). */
/* Reset a hash
table already initialized with ht_init().
* NOTE: This function should only
be
called by ht_destroy(). */
static
void
_dictReset
(
dictht
*
ht
)
{
ht
->
table
=
NULL
;
...
...
@@ -162,18 +162,18 @@ int dictResize(dict *d)
return
dictExpand
(
d
,
minimal
);
}
/* Expand or create the hashtable */
/* Expand or create the hash
table */
int
dictExpand
(
dict
*
d
,
unsigned
long
size
)
{
dictht
n
;
/* the new hashtable */
dictht
n
;
/* the new hash
table */
unsigned
long
realsize
=
_dictNextPower
(
size
);
/* the size is invalid if it is smaller than the number of
* elements already inside the hashtable */
* elements already inside the hash
table */
if
(
dictIsRehashing
(
d
)
||
d
->
ht
[
0
].
used
>
size
)
return
DICT_ERR
;
/* Allocate the new hashtable and initialize all pointers to NULL */
/* Allocate the new hash
table and initialize all pointers to NULL */
n
.
size
=
realsize
;
n
.
sizemask
=
realsize
-
1
;
n
.
table
=
zcalloc
(
realsize
*
sizeof
(
dictEntry
*
));
...
...
@@ -280,7 +280,7 @@ int dictAdd(dict *d, void *key, void *val)
* a value returns the dictEntry structure to the user, that will make
* sure to fill the value field as he wishes.
*
* This function is also directly expoed to user API to be called
* This function is also directly expo
s
ed to user API to be called
* mainly in order to store non-pointers inside the hash value, example:
*
* entry = dictAddRaw(dict,mykey);
...
...
@@ -607,7 +607,7 @@ static int _dictKeyIndex(dict *d, const void *key)
unsigned
int
h
,
idx
,
table
;
dictEntry
*
he
;
/* Expand the hashtable if needed */
/* Expand the hash
table if needed */
if
(
_dictExpandIfNeeded
(
d
)
==
DICT_ERR
)
return
-
1
;
/* Compute the key hash value */
...
...
src/rdb.c
View file @
65fd32ab
...
...
@@ -786,7 +786,7 @@ robj *rdbLoadObject(int rdbtype, rio *rdb) {
}
/* This will also be called when the set was just converted
* to regular hashtable encoded set */
* to regular hash
table encoded set */
if
(
o
->
encoding
==
REDIS_ENCODING_HT
)
{
dictAdd
((
dict
*
)
o
->
ptr
,
ele
,
NULL
);
}
else
{
...
...
src/t_set.c
View file @
65fd32ab
...
...
@@ -185,7 +185,7 @@ unsigned long setTypeSize(robj *subject) {
}
/* Convert the set to specified encoding. The resulting dict (when converting
* to a hashtable) is presized to hold the number of elements in the original
* to a hash
table) is presized to hold the number of elements in the original
* set. */
void
setTypeConvert
(
robj
*
setobj
,
int
enc
)
{
setTypeIterator
*
si
;
...
...
src/zipmap.c
View file @
65fd32ab
...
...
@@ -52,15 +52,15 @@
* <len> lengths are encoded in a single value or in a 5 bytes value.
* If the first byte value (as an unsigned 8 bit value) is between 0 and
* 252, it's a single-byte length. If it is 253 then a four bytes unsigned
* integer follows (in the host byte ordering). A value
f
o 255 is used to
* integer follows (in the host byte ordering). A value o
f
255 is used to
* signal the end of the hash. The special value 254 is used to mark
* empty space that can be used to add new key/value pairs.
*
* <free> is the number of free unused bytes
*
after the string, resulting
from modification of values associated to a
*
key (for instance if "foo"
is set to "bar
'
, and later "foo" will be se to
*
"hi", I'll have a
free byte to use if the value will enlarge again later,
*
or even in
order to add a key/value pair if it fits.
* <free> is the number of free unused bytes
after the string, resulting
* from modification of values associated to a
key. For instance if "foo"
* is set to "bar
"
, and later "foo" will be se
t
to
"hi", it will have a
* free byte to use if the value will enlarge again later,
or even in
* order to add a key/value pair if it fits.
*
* <free> is always an unsigned 8 bit number, because if after an
* update operation there are more than a few free bytes, the zipmap will be
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment