Qpid Proton C++ API 0.40.0
 
Loading...
Searching...
No Matches
direct_recv.cpp

Accepts an incoming connection and then receives like simple_recv.

Accepts an incoming connection and then receives like simple_recv. You can connect directly to direct_recv without a broker using simple_send.cpp. Make sure to stop the broker first or use a different port for direct_recv.

/*
*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*
*/
#include "options.hpp"
#include <proton/link.hpp>
#include <proton/value.hpp>
#include <iostream>
#include <map>
class direct_recv : public proton::messaging_handler {
private:
class listener_ready_handler : public proton::listen_handler {
void on_open(proton::listener& l) override {
std::cout << "listening on " << l.port() << std::endl;
}
};
std::string url;
proton::listener listener;
listener_ready_handler listen_handler;
int expected;
int received;
public:
direct_recv(const std::string &s, int c) : url(s), expected(c), received(0) {}
listener = c.listen(url, listen_handler);
}
void on_message(proton::delivery &d, proton::message &msg) override {
if (proton::coerce<int>(msg.id()) < received) {
return; // Ignore duplicate
}
if (expected == 0 || received < expected) {
std::cout << msg.body() << std::endl;
received++;
}
if (received == expected) {
d.receiver().close();
listener.stop();
}
}
};
int main(int argc, char **argv) {
std::string address("127.0.0.1:5672/examples");
int message_count = 100;
example::options opts(argc, argv);
opts.add_value(address, 'a', "address", "listen and receive on URL", "URL");
opts.add_value(message_count, 'm', "messages", "receive COUNT messages", "COUNT");
try {
opts.parse();
direct_recv recv(address, message_count);
return 0;
} catch (const example::bad_option& e) {
std::cout << opts << std::endl << e.what() << std::endl;
} catch (const std::exception& e) {
std::cerr << e.what() << std::endl;
}
return 1;
}
void close()
Close the connection.
A top-level container of connections, sessions, and links.
Definition container.hpp:50
void run()
Run the container in the current thread.
listener listen(const std::string &listen_url, listen_handler &handler)
Listen for new connections on listen_url.
A received message.
Definition delivery.hpp:40
class receiver receiver() const
Return the receiver for this delivery.
Unsettled API - A handler for incoming connections.
Definition listen_handler.hpp:39
A listener for incoming connections.
Definition listener.hpp:33
int port()
Unsettedled API
void stop()
Stop listening on the address provided to the call to container::listen that returned this listener.
An AMQP message.
Definition message.hpp:48
void id(const message_id &)
Set the message ID.
void body(const value &x)
Set the body. Equivalent to body() = x.
Handler for Proton messaging events.
Definition messaging_handler.hpp:69
virtual void on_message(delivery &, message &)
A message is received.
virtual void on_container_start(container &)
The container event loop is starting.
class connection connection() const
Return the connection for this transfer.
A connection to a remote AMQP peer.
A top-level container of connections, sessions, and links.
A received message.
Unsettled API - A handler for incoming connections.
A listener for incoming connections.
An AMQP message.
An AMQP message ID.
Handler for Proton messaging events.
A holder for any AMQP value, simple or complex.