Skip to content
Projects
Groups
Snippets
Help
Loading...
Sign in / Register
Toggle navigation
L
libzmq
Project
Project
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Packages
Packages
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
submodule
libzmq
Commits
26e14d30
Commit
26e14d30
authored
Jun 25, 2012
by
Martin Hurton
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Small code simplification
parent
6f1229be
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
5 additions
and
10 deletions
+5
-10
xpub.cpp
src/xpub.cpp
+5
-10
No files found.
src/xpub.cpp
View file @
26e14d30
...
...
@@ -56,15 +56,11 @@ void zmq::xpub_t::xread_activated (pipe_t *pipe_)
{
// There are some subscriptions waiting. Let's process them.
msg_t
sub
;
while
(
true
)
{
// Grab next subscription.
if
(
!
pipe_
->
read
(
&
sub
))
return
;
while
(
pipe_
->
read
(
&
sub
))
{
// Apply the subscription to the trie.
unsigned
char
*
data
=
(
unsigned
char
*
)
sub
.
data
();
size_t
size
=
sub
.
size
();
unsigned
char
*
const
data
=
(
unsigned
char
*
)
sub
.
data
();
const
size_t
size
=
sub
.
size
();
if
(
size
>
0
&&
(
*
data
==
0
||
*
data
==
1
))
{
bool
unique
;
if
(
*
data
==
0
)
...
...
@@ -75,11 +71,10 @@ void zmq::xpub_t::xread_activated (pipe_t *pipe_)
// If the subscription is not a duplicate store it so that it can be
// passed to used on next recv call.
if
(
unique
&&
options
.
type
!=
ZMQ_PUB
)
pending
.
push_back
(
blob_t
((
unsigned
char
*
)
sub
.
data
(),
sub
.
size
()));
pending
.
push_back
(
blob_t
(
data
,
size
));
}
sub
.
close
();
sub
.
close
();
}
}
...
...
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