Class inverse_index¶

Defined in File storage.h

Nested Relationships¶

Nested Types¶

Struct inverse_index::referenced_id_less

Class Documentation¶

class inverse_index¶

Public Types

typedef std::map<std::tuple<short, short>, std::vector<uint32_t>> legacy_bucket¶

typedef std::unordered_map<int, legacy_bucket> legacy_map¶

typedef legacy_map::key_type key_type¶

typedef legacy_map::mapped_type mapped_type¶

typedef legacy_map::value_type value_type¶

typedef legacy_map::iterator iterator¶

typedef legacy_map::const_iterator const_iterator¶

Public Functions

inverse_index() = default¶

inline inverse_index(const inverse_index &other)¶

inline inverse_index &operator=(const inverse_index &other)¶

inverse_index(inverse_index&&) noexcept = default¶

inverse_index &operator=(inverse_index&&) noexcept = default¶

inline void reserve(size_t size)¶

inline void add(uint32_t referenced_id, uint32_t source_id, uint16_t source_entity, int attribute_index)¶

inline bool remove(uint32_t referenced_id, uint32_t source_id, uint16_t source_entity, int attribute_index)¶

inline void sort() const¶

template<typename Fn> inline void for_each(uint32_t referenced_id, Fn &&fn) const¶

inline size_t count(uint32_t referenced_id) const¶

template<typename Pred> inline bool all_sources(uint32_t referenced_id, Pred &&pred) const¶

inline bool empty() const¶

inline size_t size() const¶

inline void clear()¶

inline iterator begin()¶

inline iterator end()¶

inline const_iterator begin() const¶

inline const_iterator end() const¶

inline iterator find(const key_type &key)¶

inline const_iterator find(const key_type &key) const¶

inline size_t erase(const key_type &key)¶

inline std::pair<iterator, bool> insert(const value_type &value)¶

Public Static Functions

static inline void sort_records(std::vector<inverse_record> &records)¶