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
5e46e080
"vscode:/vscode.git/clone" did not exist on "0e5a4a27ea49da6423513ff749093ccf1582171d"
Unverified
Commit
5e46e080
authored
Jun 18, 2020
by
Salvatore Sanfilippo
Committed by
GitHub
Jun 18, 2020
Browse files
Merge pull request #7402 from chenhui0212/unstable
Fix comments in listpack.c
parents
ab4cc1e1
f800b521
Changes
2
Show whitespace changes
Inline
Side-by-side
src/listpack.c
View file @
5e46e080
...
@@ -773,13 +773,13 @@ unsigned char *lpSeek(unsigned char *lp, long index) {
...
@@ -773,13 +773,13 @@ unsigned char *lpSeek(unsigned char *lp, long index) {
* is past the half of the listpack. */
* is past the half of the listpack. */
if
(
index
>
numele
/
2
)
{
if
(
index
>
numele
/
2
)
{
forward
=
0
;
forward
=
0
;
/*
Lef
t to
righ
t scanning always expects a negative index. Convert
/*
Righ
t to
lef
t scanning always expects a negative index. Convert
* our index to negative form. */
* our index to negative form. */
index
-=
numele
;
index
-=
numele
;
}
}
}
else
{
}
else
{
/* If the listpack length is unspecified, for negative indexes we
/* If the listpack length is unspecified, for negative indexes we
* want to always scan
lef
t-to-
righ
t. */
* want to always scan
righ
t-to-
lef
t. */
if
(
index
<
0
)
forward
=
0
;
if
(
index
<
0
)
forward
=
0
;
}
}
...
...
src/rax.c
View file @
5e46e080
...
@@ -487,8 +487,8 @@ static inline size_t raxLowWalk(rax *rax, unsigned char *s, size_t len, raxNode
...
@@ -487,8 +487,8 @@ static inline size_t raxLowWalk(rax *rax, unsigned char *s, size_t len, raxNode
if
(
h
->
iscompr
)
j
=
0
;
/* Compressed node only child is at index 0. */
if
(
h
->
iscompr
)
j
=
0
;
/* Compressed node only child is at index 0. */
memcpy
(
&
h
,
children
+
j
,
sizeof
(
h
));
memcpy
(
&
h
,
children
+
j
,
sizeof
(
h
));
parentlink
=
children
+
j
;
parentlink
=
children
+
j
;
j
=
0
;
/* If the new node is compressed and we do not
j
=
0
;
/* If the new node is
non
compressed and we do not
iterate again (since i == l) set the split
iterate again (since i == l
en
) set the split
position to 0 to signal this node represents
position to 0 to signal this node represents
the searched key. */
the searched key. */
}
}
...
...
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