26 #ifndef NFD_DAEMON_TABLE_CS_ENTRY_HPP
27 #define NFD_DAEMON_TABLE_CS_ENTRY_HPP
52 return m_data->getName();
60 return m_data->getFullName();
68 return m_isUnsolicited;
94 m_isUnsolicited =
false;
98 shared_ptr<const Data> m_data;
100 time::steady_clock::TimePoint m_freshUntil;
104 operator<(
const Entry& entry,
const Name& queryName);
107 operator<(
const Name& queryName,
const Entry& entry);
110 operator<(
const Entry& lhs,
const Entry& rhs);
116 using Table = std::set<Entry, std::less<>>;
119 operator<(Table::const_iterator lhs, Table::const_iterator rhs)
bool isFresh() const
check if the stored Data is fresh now
const Name & getFullName() const
return full name (including implicit digest) of the stored Data
Entry(shared_ptr< const Data > data, bool isUnsolicited)
void clearUnsolicited()
clear 'unsolicited' flag
const Name & getName() const
return stored Data name
bool canSatisfy(const Interest &interest) const
determine whether Interest can be satisified by the stored Data
void updateFreshUntil()
recalculate when the entry would become non-fresh, relative to current time
const Data & getData() const
return the stored Data
bool isUnsolicited() const
return whether the stored Data is unsolicited
std::set< Entry, std::less<> > Table
an ordered container of ContentStore entries
bool operator<(const Entry &entry, const Name &queryName)
Copyright (c) 2014-2015, Regents of the University of California, Arizona Board of Regents,...