kakoune/src/idvaluemap.hh

104 lines
2.5 KiB
C++
Raw Normal View History

#ifndef idvaluemap_hh_INCLUDED
#define idvaluemap_hh_INCLUDED
2012-01-15 14:40:58 +01:00
#include <vector>
#include "completion.hh"
namespace Kakoune
{
template<typename _Id, typename _Value>
class idvaluemap
{
public:
typedef std::pair<_Id, _Value> value_type;
typedef std::vector<value_type> container_type;
typedef typename container_type::iterator iterator;
typedef typename container_type::const_iterator const_iterator;
void append(const value_type& value)
{
m_content.push_back(value);
}
void append(value_type&& value)
{
2011-12-07 19:57:07 +01:00
m_content.push_back(std::forward<value_type>(value));
}
iterator find(const _Id& id)
{
for (auto it = begin(); it != end(); ++it)
{
if (it->first == id)
return it;
}
return end();
}
const_iterator find(const _Id& id) const
{
for (auto it = begin(); it != end(); ++it)
{
if (it->first == id)
return it;
}
return end();
}
bool contains(const _Id& id) const
{
return find(id) != end();
}
void remove(const _Id& id)
{
for (auto it = m_content.begin(); it != m_content.end(); ++it)
{
if (it->first == id)
{
m_content.erase(it);
return;
}
}
}
template<typename _Condition>
CandidateList complete_id_if(const String& prefix,
ByteCount cursor_pos,
_Condition condition)
{
String real_prefix = prefix.substr(0, cursor_pos);
CandidateList result;
for (auto& value : m_content)
{
if (not condition(value))
continue;
String id_str = value.first;
if (id_str.substr(0, real_prefix.length()) == real_prefix)
result.push_back(std::move(id_str));
}
return result;
}
CandidateList complete_id(const String& prefix,
ByteCount cursor_pos)
{
return complete_id_if(
prefix, cursor_pos, [](const value_type&) { return true; });
}
iterator begin() { return m_content.begin(); }
iterator end() { return m_content.end(); }
const_iterator begin() const { return m_content.begin(); }
const_iterator end() const { return m_content.end(); }
private:
container_type m_content;
};
}
#endif // idvaluemap_hh_INCLUDED