#include <EC_Conjunction_Filter.h>
Inheritance diagram for TAO_EC_Conjunction_Filter:
Public Types | |
typedef unsigned int | Word |
Public Methods | |
TAO_EC_Conjunction_Filter (TAO_EC_Filter *children[], size_t n) | |
Constructor. It assumes ownership of both the array and the children. More... | |
virtual | ~TAO_EC_Conjunction_Filter (void) |
Destructor. More... | |
virtual ChildrenIterator | begin (void) const |
STL-like iterators Filters follow the Composite pattern. More... | |
virtual ChildrenIterator | end (void) const |
virtual int | size (void) const |
virtual int | filter (const RtecEventComm::EventSet &event, TAO_EC_QOS_Info &qos_info ACE_ENV_ARG_DECL) |
Filter this event, returns 1 if the event is accepted, 0 otherwise. More... | |
virtual int | filter_nocopy (RtecEventComm::EventSet &event, TAO_EC_QOS_Info &qos_info ACE_ENV_ARG_DECL) |
virtual void | push (const RtecEventComm::EventSet &event, TAO_EC_QOS_Info &qos_info ACE_ENV_ARG_DECL) |
This is called by the children when they accept an event and which to pass it up. More... | |
virtual void | push_nocopy (RtecEventComm::EventSet &event, TAO_EC_QOS_Info &qos_info ACE_ENV_ARG_DECL) |
virtual void | clear (void) |
Clear any saved state, must reset and assume no events have been received. More... | |
virtual CORBA::ULong | max_event_size (void) const |
Returns the maximum size of the events pushed by this filter. More... | |
virtual int | can_match (const RtecEventComm::EventHeader &header) const |
Returns 0 if an event with that header could never be accepted. More... | |
virtual int | add_dependencies (const RtecEventComm::EventHeader &header, const TAO_EC_QOS_Info &qos_info ACE_ENV_ARG_DECL) |
This is used for computing the scheduling dependencies:. More... | |
Private Methods | |
int | all_received (void) const |
Determine if all the children have received their events. More... |
This filter waits until each one of its children has accepted at least one event. Only in that case it accepts and publishes the sequence formed by all the children events.
|
|
|
Constructor. It assumes ownership of both the array and the children.
|
|
Destructor.
|
|
This is used for computing the scheduling dependencies:. Leaf filters check if the header could be matched, similar to the can_match() method; if it does they return 1, and 0 otherwise. Intermediate nodes always return 0. This is used to build precise dependencies between the suppliers and the leaf of the filters that accept that event. Notice that only the nodes doing scheduling recurse through the list, so in configurations that do no require scheduling the recursion stops fairly soon. Reimplemented from TAO_EC_Filter. |
|
Determine if all the children have received their events.
|
|
STL-like iterators Filters follow the Composite pattern. All filters expose the same interface as if they all had children, but for simple filters the iterators return an empty range. Reimplemented from TAO_EC_Filter. |
|
Returns 0 if an event with that header could never be accepted. This can used by the suppliers to filter out consumers that couldn't possibly be interested in their events. The rt_info and Reimplemented from TAO_EC_Filter. |
|
Clear any saved state, must reset and assume no events have been received.
Reimplemented from TAO_EC_Filter. |
|
Reimplemented from TAO_EC_Filter. |
|
Filter this event, returns 1 if the event is accepted, 0 otherwise. Notice that there are two versions of the method, if the event is not const then filter can take ownership of the event. Reimplemented from TAO_EC_Filter. |
|
Reimplemented from TAO_EC_Filter. |
|
Returns the maximum size of the events pushed by this filter.
Reimplemented from TAO_EC_Filter. |
|
This is called by the children when they accept an event and which to pass it up. Notice that there are two versions of the method, if the event is not const then filter can take ownership of the event. Reimplemented from TAO_EC_Filter. |
|
Reimplemented from TAO_EC_Filter. |
|
Reimplemented from TAO_EC_Filter. |