g2o::EstimatePropagator::PriorityQueue Class Reference

priority queue for AdjacencyMapEntry More...

#include <estimate_propagator.h>

Inheritance diagram for g2o::EstimatePropagator::PriorityQueue:

Collaboration diagram for g2o::EstimatePropagator::PriorityQueue:

Public Member Functions
void	push (AdjacencyMapEntry *entry)
AdjacencyMapEntry *	pop ()

Detailed Description

priority queue for AdjacencyMapEntry

Definition at line 95 of file estimate_propagator.h.

Member Function Documentation

EstimatePropagator::AdjacencyMapEntry * g2o::EstimatePropagator::PriorityQueue::pop

(

)

Definition at line 224 of file estimate_propagator.cpp.

References g2o::EstimatePropagator::AdjacencyMapEntry::inQueue, and g2o::EstimatePropagator::AdjacencyMapEntry::queueIt.

Referenced by g2o::EstimatePropagator::propagate().

  {
    assert(!empty());
    iterator it = begin();
    AdjacencyMapEntry* entry = it->second;
    erase(it);

    assert(entry != NULL);
    entry->queueIt = end();
    entry->inQueue = false;
    return entry;
  }

void g2o::EstimatePropagator::PriorityQueue::push

(

AdjacencyMapEntry *

entry

)

Definition at line 211 of file estimate_propagator.cpp.

References g2o::EstimatePropagator::AdjacencyMapEntry::distance(), g2o::EstimatePropagator::AdjacencyMapEntry::inQueue, and g2o::EstimatePropagator::AdjacencyMapEntry::queueIt.

Referenced by g2o::EstimatePropagator::propagate().

  {
    assert(entry != NULL);
    if (entry->inQueue) {
      assert(entry->queueIt->second == entry);
      erase(entry->queueIt);
    }

    entry->queueIt = insert(std::make_pair(entry->distance(), entry));
    assert(entry->queueIt != end());
    entry->inQueue = true;
  }

---

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

• /home/xuezhisd/CLionProjects/g2o/g2o/core/estimate_propagator.h
• /home/xuezhisd/CLionProjects/g2o/g2o/core/estimate_propagator.cpp