Qpid Proton C++ API 0.39.0
 
Loading...
Searching...
No Matches
receiver

A channel for receiving messages. More...

#include <receiver.hpp>

Inheritance diagram for receiver:
link endpoint

Public Member Functions

 receiver ()=default
 Create an empty receiver.
 
void open ()
 Open the receiver.
 
void open (const receiver_options &opts)
 Open the receiver. More...
 
class source source () const
 Get the source node.
 
class target target () const
 Get the target node.
 
void add_credit (uint32_t)
 Increment the credit available to the sender. More...
 
void drain ()
 Unsettled API - Commence a drain cycle. More...
 
virtual bool uninitialized () const =0
 True if the local end is uninitialized. More...
 
virtual bool active () const =0
 True if the local end is active. More...
 
virtual bool closed () const =0
 True if the local and remote ends are closed. More...
 
virtual class error_condition error () const =0
 Get the error condition of the remote endpoint. More...
 
virtual void close ()=0
 Close the endpoint. More...
 
virtual void close (const error_condition &)=0
 Close the endpoint with an error condition. More...
 

Detailed Description

Member Function Documentation

◆ open()

void open ( const receiver_options opts)

Open the receiver.

◆ add_credit()

void add_credit ( uint32_t  )

Increment the credit available to the sender.

Credit granted during a drain cycle is not communicated to the receiver until the drain completes.

Examples
multithreaded_client_flow_control.cpp.

◆ drain()

void drain ( )

Unsettled API - Commence a drain cycle.

If there is positive credit, a request is sent to the sender to immediately use up all of the existing credit balance by sending messages that are immediately available and releasing any unused credit (see sender::return_credit). Throws proton::error if a drain cycle is already in progress. An on_receiver_drain_finish event will be generated when the outstanding drained credit reaches zero.


The documentation for this class was generated from the following file: