| allocator_ | uavcan::AvlTree< CanTxQueueEntry > | protected |
| appendToEndOf(Node *head, Node *newNode) | uavcan::AvlTree< CanTxQueueEntry > | inlineprivatestatic |
| AvlTree(IPoolAllocator &allocator, std::size_t allocator_quota) | uavcan::AvlTree< CanTxQueueEntry > | inline |
| balanceOf(Node *n) | uavcan::AvlTree< CanTxQueueEntry > | inlineprivatestatic |
| CanTxQueue(IPoolAllocator &allocator, ISystemClock &sysclock, std::size_t allocator_quota) | uavcan::CanTxQueue | inline |
| contains(const CanFrame &frame) const | uavcan::CanTxQueue | |
| AvlTree< CanTxQueueEntry >::contains(const CanTxQueueEntry *data) const | uavcan::AvlTree< CanTxQueueEntry > | inline |
| deleteFromList(Node *root, CanTxQueueEntry *data) | uavcan::AvlTree< CanTxQueueEntry > | inlineprivate |
| deleteNode(Node *&n) | uavcan::AvlTree< CanTxQueueEntry > | inlineprivate |
| getRejectedFrameCount() const | uavcan::CanTxQueue | inline |
| getSize() const | uavcan::AvlTree< CanTxQueueEntry > | inline |
| heightOf(const Node *n) | uavcan::AvlTree< CanTxQueueEntry > | inlineprivatestatic |
| insert(CanTxQueueEntry *data) | uavcan::AvlTree< CanTxQueueEntry > | inline |
| insertNode(Node *node, Node *newNode) | uavcan::AvlTree< CanTxQueueEntry > | inlineprivate |
| isEmpty() const | uavcan::AvlTree< CanTxQueueEntry > | inline |
| len_ | uavcan::AvlTree< CanTxQueueEntry > | private |
| linkedListContains(Node *head, const CanFrame &frame) const | uavcan::CanTxQueue | protected |
| AvlTree< CanTxQueueEntry >::linkedListContains(Node *head, const CanTxQueueEntry *data) | uavcan::AvlTree< CanTxQueueEntry > | inlineprotectedstatic |
| makeNode(CanTxQueueEntry *payload) | uavcan::AvlTree< CanTxQueueEntry > | inlineprivate |
| max() const | uavcan::AvlTree< CanTxQueueEntry > | inline |
| maxOf(int16_t a, int16_t b) | uavcan::AvlTree< CanTxQueueEntry > | inlineprivatestatic |
| Noncopyable(const Noncopyable &) | uavcan::Noncopyable | private |
| Noncopyable() | uavcan::Noncopyable | inlineprivate |
| operator=(const Noncopyable &) | uavcan::Noncopyable | private |
| peek() | uavcan::CanTxQueue | |
| postOrderNodeTraverseRecursively(Node *n, std::function< void(Node *&)> forEach) | uavcan::AvlTree< CanTxQueueEntry > | inlineprotected |
| postOrderTraverseEntryCleanup(Node *n) | uavcan::CanTxQueue | private |
| postOrderTraverseNodeCleanup(Node *n) | uavcan::AvlTree< CanTxQueueEntry > | inlineprivate |
| postOrderTraverseRecursively(Node *n, std::function< void(CanTxQueueEntry *&)> forEach) | uavcan::AvlTree< CanTxQueueEntry > | inlineprivate |
| push(const CanFrame &frame, MonotonicTime tx_deadline, CanIOFlags flags) | uavcan::CanTxQueue | |
| rejected_frames_cnt_ | uavcan::CanTxQueue | protected |
| remove(CanTxQueueEntry *entry) | uavcan::CanTxQueue | |
| removeEntry(CanTxQueueEntry *data) | uavcan::AvlTree< CanTxQueueEntry > | inline |
| removeNode(Node *node, CanTxQueueEntry *data) | uavcan::AvlTree< CanTxQueueEntry > | inlineprotected |
| root_ | uavcan::AvlTree< CanTxQueueEntry > | protected |
| rotateLeft(Node *x) | uavcan::AvlTree< CanTxQueueEntry > | inlineprivatestatic |
| rotateRight(Node *y) | uavcan::AvlTree< CanTxQueueEntry > | inlineprivatestatic |
| safeIncrementRejectedFrames() | uavcan::CanTxQueue | protected |
| searchForNonExpiredMax(Node *n) | uavcan::CanTxQueue | protected |
| sysclock_ | uavcan::CanTxQueue | protected |
| topPriorityHigherOrEqual(const CanFrame &rhs_frame) | uavcan::CanTxQueue | |
| walkPostOrder(std::function< void(CanTxQueueEntry *&)> forEach) | uavcan::AvlTree< CanTxQueueEntry > | inline |
| ~AvlTree() | uavcan::AvlTree< CanTxQueueEntry > | inlinevirtual |
| ~CanTxQueue() override | uavcan::CanTxQueue | |
| ~Noncopyable() | uavcan::Noncopyable | inlineprivate |