mirror of
https://github.com/OpenMW/openmw.git
synced 2025-02-02 06:15:33 +00:00
5fffcab94f
- The order of info records with the same topic are maintained in Collection::mRecords
- The index lookup data structure are not ordered. The topic string is hashed. The infos for the topic are simply placed in a vector.
- The index values for appending or inserting a record takes prev/next values (if exist)
- FIXME: prev/next values are not adjusted for adding or removing records
- FIXME: undo after reordering does not reset the modified flag
(copied the changes from commit SHA-1: 06f9922822)
124 lines
4.2 KiB
C++
124 lines
4.2 KiB
C++
#ifndef CSM_WOLRD_INFOCOLLECTION_H
|
|
#define CSM_WOLRD_INFOCOLLECTION_H
|
|
|
|
#include <extern/murmurhash/MurmurHash2.h>
|
|
|
|
#include "collection.hpp"
|
|
#include "info.hpp"
|
|
|
|
namespace ESM
|
|
{
|
|
struct Dialogue;
|
|
}
|
|
|
|
namespace CSMWorld
|
|
{
|
|
struct StringHash
|
|
{
|
|
uint64_t mHash;
|
|
std::shared_ptr<std::string> mString;
|
|
|
|
StringHash (std::shared_ptr<std::string> str) : mString(str)
|
|
{
|
|
mHash = MurmurHash64A(str->c_str(), str->size(), /*seed*/1);
|
|
}
|
|
};
|
|
}
|
|
|
|
namespace std
|
|
{
|
|
template<> struct less<CSMWorld::StringHash>
|
|
{
|
|
bool operator() (const CSMWorld::StringHash& lhs, const CSMWorld::StringHash& rhs) const
|
|
{
|
|
if (lhs.mHash < rhs.mHash)
|
|
return true;
|
|
|
|
if (lhs.mHash > rhs.mHash)
|
|
return false;
|
|
|
|
return *lhs.mString < *rhs.mString;
|
|
}
|
|
};
|
|
}
|
|
|
|
namespace CSMWorld
|
|
{
|
|
template<>
|
|
void Collection<Info, IdAccessor<Info> >::removeRows (int index, int count);
|
|
|
|
template<>
|
|
void Collection<Info, IdAccessor<Info> >::insertRecord (std::unique_ptr<RecordBase> record,
|
|
int index, UniversalId::Type type);
|
|
|
|
template<>
|
|
bool Collection<Info, IdAccessor<Info> >::reorderRowsImp (int baseIndex,
|
|
const std::vector<int>& newOrder);
|
|
|
|
class InfoCollection : public Collection<Info, IdAccessor<Info> >
|
|
{
|
|
public:
|
|
|
|
typedef std::vector<std::unique_ptr<Record<Info> > >::const_iterator RecordConstIterator;
|
|
typedef std::pair<RecordConstIterator, RecordConstIterator> Range;
|
|
|
|
private:
|
|
|
|
// The general strategy is to keep the records in Collection kept in order (within
|
|
// a topic group) while the index lookup maps are not ordered. It is assumed that
|
|
// each topic has a small number of infos, which allows the use of vectors for
|
|
// iterating through them without too much penalty.
|
|
//
|
|
// NOTE: hashed topic string as well as id string are stored in lower case.
|
|
std::map<StringHash, std::vector<std::pair<std::string, int> > > mInfoIndex;
|
|
|
|
void load (const Info& record, bool base);
|
|
|
|
int getInfoIndex (const std::string& id, const std::string& topic) const;
|
|
///< Return index for record \a id or -1 (if not present; deleted records are considered)
|
|
///
|
|
/// \param id info ID without topic prefix
|
|
//
|
|
/// \attention id and topic are assumed to be in lower case
|
|
|
|
public:
|
|
|
|
int getInsertIndex (const std::string& id,
|
|
UniversalId::Type type = UniversalId::Type_None,
|
|
RecordBase *record = nullptr) const override;
|
|
///< \param type Will be ignored, unless the collection supports multiple record types
|
|
///
|
|
/// Works like getAppendIndex unless an overloaded method uses the record pointer
|
|
/// to get additional info about the record that results in an alternative index.
|
|
|
|
bool reorderRows (int baseIndex, const std::vector<int>& newOrder) override;
|
|
///< Reorder the rows [baseIndex, baseIndex+newOrder.size()) according to the indices
|
|
/// given in \a newOrder (baseIndex+newOrder[0] specifies the new index of row baseIndex).
|
|
///
|
|
/// \return Success?
|
|
|
|
void load (ESM::ESMReader& reader, bool base, const ESM::Dialogue& dialogue);
|
|
|
|
Range getTopicRange (const std::string& topic) const;
|
|
///< Return iterators that point to the beginning and past the end of the range for
|
|
/// the given topic.
|
|
|
|
void removeDialogueInfos(const std::string& dialogueId);
|
|
|
|
void removeRows (int index, int count);
|
|
|
|
void appendBlankRecord (const std::string& id,
|
|
UniversalId::Type type = UniversalId::Type_None);
|
|
|
|
int searchId (const std::string& id) const;
|
|
|
|
void appendRecord (std::unique_ptr<RecordBase> record,
|
|
UniversalId::Type type = UniversalId::Type_None);
|
|
|
|
void insertRecord (std::unique_ptr<RecordBase> record,
|
|
int index,
|
|
UniversalId::Type type = UniversalId::Type_None);
|
|
};
|
|
}
|
|
|
|
#endif
|