fix: resolve confusing naming of priority queue

ref: eclipse#5508
qasimy123 · May 2, 2022 · 8bbc823 · 8bbc823
1 parent c3c33d2
commit 8bbc823
Show file tree

Hide file tree

Showing 2 changed files with 5 additions and 5 deletions.
diff --git a/compiler/optimizer/abstractinterpreter/IDT.cpp b/compiler/optimizer/abstractinterpreter/IDT.cpp
@@ -146,20 +146,20 @@ TR::IDTNode *TR::IDT::getNodeByGlobalIndex(int32_t index)
    return _indices[index + 1];
    }
 
-TR::IDTPreorderPriorityQueue::IDTPreorderPriorityQueue(TR::IDT* idt, TR::Region& region)  :
+TR::IDTPriorityQueue::IDTPriorityQueue(TR::IDT* idt, TR::Region& region)  :
       _entries(region),
       _idt(idt),
       _pQueue(IDTNodeCompare(), IDTNodeVector(region))
    {
    _pQueue.push(idt->getRoot());
    }
 
-TR::IDTNode* TR::IDTPreorderPriorityQueue::get(uint32_t index)
+TR::IDTNode* TR::IDTPriorityQueue::get(uint32_t index)
    {
    const size_t entriesSize = _entries.size();
 
    const uint32_t idtSize = size();
-   TR_ASSERT_FATAL(index < idtSize, "IDTPreorderPriorityQueue::get index out of bound!");
+   TR_ASSERT_FATAL(index < idtSize, "IDTPriorityQueue::get index out of bound!");
    // already in entries
    if (entriesSize > index) 
       return _entries.at(index);

diff --git a/compiler/optimizer/abstractinterpreter/IDT.hpp b/compiler/optimizer/abstractinterpreter/IDT.hpp
@@ -102,10 +102,10 @@ class IDT
  * The node has the larger cost will have the higher priority
  * The queue breaks the tie by comparing the benefit
  */
-class IDTPreorderPriorityQueue
+class IDTPriorityQueue
    {
    public:
-   IDTPreorderPriorityQueue(TR::IDT* idt, TR::Region& region);
+   IDTPriorityQueue(TR::IDT* idt, TR::Region& region);
    uint32_t size() { return _idt->getNumNodes(); }
 
    TR::IDTNode* get(uint32_t index);