InsertionOrderedMap Struct Reference

#include <InsertionOrderedMap.h>

Classes
struct	Iterator

Public Member Functions
auto &	operator[] (llvm::Value *key)
void	replace (llvm::Value *key1, llvm::Value *key2)
auto	begin ()
auto	end ()
auto	find (llvm::Value *key)
std::pair< Iterator, bool >	emplace (llvm::Value *key, llvm::Value *val)

Public Attributes
std::unordered_map < llvm::Value *, llvm::Value * >	m_
std::vector< llvm::Value * >	v_

Detailed Description

Definition at line 35 of file InsertionOrderedMap.h.

Member Function Documentation

auto InsertionOrderedMap::begin ( )

inline

Definition at line 89 of file InsertionOrderedMap.h.

References v_.

Referenced by Executor::redeclareFilterFunction().

{ return Iterator{this, v_.begin()}; }

Here is the caller graph for this function:

std::pair<Iterator, bool> InsertionOrderedMap::emplace ( llvm::Value *  key, llvm::Value *  val  )

inline

Definition at line 100 of file InsertionOrderedMap.h.

References end(), find(), m_, and v_.

                                                                  {
    auto it = find(key);
    if (it != end()) {
      return std::pair(it, false);
    } else {
      m_.emplace(key, val);
      v_.push_back(key);
      return std::pair(Iterator{this, v_.end() - 1}, true);
    }
  }

Here is the call graph for this function:

auto InsertionOrderedMap::end ( )

inline

Definition at line 90 of file InsertionOrderedMap.h.

References v_.

Referenced by emplace(), and Executor::redeclareFilterFunction().

{ return Iterator{this, v_.end()}; }

Here is the caller graph for this function:

auto InsertionOrderedMap::find ( llvm::Value *  key )

inline

Definition at line 92 of file InsertionOrderedMap.h.

References m_, and v_.

Referenced by emplace(), and Executor::redeclareFilterFunction().

                            {
    if (m_.count(key)) {
      return Iterator{this, std::find(v_.begin(), v_.end(), key)};
    } else {
      return Iterator{this, v_.end()};
    }
  }

Here is the caller graph for this function:

auto& InsertionOrderedMap::operator[] ( llvm::Value *  key )

inline

Definition at line 39 of file InsertionOrderedMap.h.

References m_, and v_.

                                   {
    auto m_it = m_.find(key);
    if (m_it == m_.end()) {
      v_.push_back(key);
      return m_[key];
    }
    return m_it->second;
  }

void InsertionOrderedMap::replace ( llvm::Value *  key1, llvm::Value *  key2  )

inline

Definition at line 48 of file InsertionOrderedMap.h.

References m_, and v_.

                                                 {
    if (m_.count(key2)) {
      return;
    }
    auto m_it = m_.find(key1);
    if (m_it == m_.end()) {
      return;
    }
    auto v_it = std::find(v_.begin(), v_.end(), key1);
    if (v_it == v_.end()) {
      return;
    }
    *v_it = key2;
    m_[key2] = m_it->second;
    m_.erase(m_it);
  }

Member Data Documentation

std::unordered_map<llvm::Value*, llvm::Value*> InsertionOrderedMap::m_

Definition at line 36 of file InsertionOrderedMap.h.

Referenced by emplace(), find(), InsertionOrderedMap::Iterator::operator*(), InsertionOrderedMap::Iterator::operator->(), operator[](), and replace().

std::vector<llvm::Value*> InsertionOrderedMap::v_

Definition at line 37 of file InsertionOrderedMap.h.

Referenced by begin(), emplace(), end(), find(), InsertionOrderedMap::Iterator::operator*(), InsertionOrderedMap::Iterator::operator->(), operator[](), Executor::redeclareFilterFunction(), and replace().

---

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

• /home/jenkins-slave/workspace/core-os-doxygen/Shared/InsertionOrderedMap.h