table: better ContentStore findRightmost algorithm
refs #2254
Change-Id: Ib8f473f0cce1a1636b600a98494292499d71972e
diff --git a/daemon/table/cs-entry.hpp b/daemon/table/cs-entry.hpp
index 12a65b0..a35d9e9 100644
--- a/daemon/table/cs-entry.hpp
+++ b/daemon/table/cs-entry.hpp
@@ -1,12 +1,12 @@
/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
/**
- * Copyright (c) 2014, Regents of the University of California,
- * Arizona Board of Regents,
- * Colorado State University,
- * University Pierre & Marie Curie, Sorbonne University,
- * Washington University in St. Louis,
- * Beijing Institute of Technology,
- * The University of Memphis
+ * Copyright (c) 2014-2015, Regents of the University of California,
+ * Arizona Board of Regents,
+ * Colorado State University,
+ * University Pierre & Marie Curie, Sorbonne University,
+ * Washington University in St. Louis,
+ * Beijing Institute of Technology,
+ * The University of Memphis.
*
* This file is part of NFD (Named Data Networking Forwarding Daemon).
* See AUTHORS.md for complete list of NFD authors and contributors.
@@ -56,6 +56,9 @@
getData() const;
const Name&
+ getName() const;
+
+ const Name&
getFullName() const;
/** \return true if entry can become stale, false if entry is never stale
@@ -75,6 +78,9 @@
void
unsetUnsolicited();
+ /** \brief determines whether Interest can be satisified by this cached Data
+ * \note ChildSelector is not considered
+ */
bool
canSatisfy(const Interest& interest) const;