8000 refactored rpc_server.js · syk-coder/rabbitmq-tutorials@38411ac · GitHub
[go: up one dir, main page]

Skip to content

Commit 38411ac

Browse files
committed
refactored rpc_server.js
1 parent bd9f582 commit 38411ac

File tree

1 file changed

+21
-31
lines changed

1 file changed

+21
-31
lines changed

javascript-nodejs/src/rpc_server.js

Lines changed: 21 additions & 31 deletions
Original file line numberDiff line numberDiff line change
@@ -1,42 +1,32 @@
11
#!/usr/bin/env node
22

3-
var amqp = require('amqplib');
3+
var amqp = require('amqplib/callback_api');
44

5-
var conn = amqp.connect('amqp://localhost');
6-
conn.then(createChannel).then(null, console.warn);
5+
amqp.connect('amqp://localhost', function(err, conn) {
6+
conn.createChannel(function(err, ch) {
7+
var q = 'rpc_queue';
78

8-
function createChannel(conn) {
9-
process.once('SIGINT', function() { conn.close(); });
10-
return conn.createChannel().then(consume);
11-
}
12-
13-
function consume(ch) {
14-
var ok = ch.assertQueue('rpc_queue', {durable: false});
15-
ok = ok.then(function() {
9+
ch.assertQueue(q, {durable: false});
1610
ch.prefetch(1);
17-
return ch.consume('rpc_queue', reply);
18-
});
19-
20-
return ok.then(function(_ignore) {
2111
console.log(' [x] Awaiting RPC requests');
22-
});
12+
ch.consume(q, function reply(msg) {
13+
var n = parseInt(msg.content.toString());
14+
var r = fibonacci(n);
2315

24-
function reply(msg) {
25-
var n = parseInt(msg.content.toString());
26-
console.log(' [.] fib(%d)', n);
27-
var response = fib(n);
28-
ch.sendToQueue( msg.properties.replyTo,
29-
new Buffer(response.toString()),
16+
console.log(" [.] fib(%d)", n);
17+
18+
ch.sendToQueue(msg.properties.replyTo,
19+
new Buffer(r.toString()),
3020
{correlationId: msg.properties.correlationId});
31-
ch.ack(msg);
32-
}
33-
}
3421

35-
function fib(n) {
36-
if(n == 0)
37-
return 0;
38-
else if(n == 1)
39-
return 1;
22+
ch.ack(msg);
23+
});
24+
});
25+
});
26+
27+
function fibonacci(n) {
28+
if (n == 0 || n == 1)
29+
return n;
4030
else
41-
return fib(n-1) + fib(n-2);
31+
return fibonacci(n - 1) + fibonacci(n - 2);
4232
}

0 commit comments

Comments
 (0)
0