Tweaks to LCPArray::depth()

jltsiren · Mar 16, 2016 · b433cc2 · b433cc2
1 parent 7ef2c1f
commit b433cc2
Show file tree

Hide file tree

Showing 2 changed files with 11 additions and 2 deletions.
diff --git a/lcp.cpp b/lcp.cpp
@@ -291,11 +291,19 @@ LCPArray::depth(const LCPArray::node_type& node) const
   return this->depth(node.range());
 }
 
+size_type
+LCPArray::depth(LCPArray::node_type& node) const
+{
+  if(node.lcp() == node_type::UNKNOWN) { node.node_lcp = this->depth(node.range()); }
+  return node.lcp();
+}
+
 size_type
 LCPArray::depth(range_type range) const
 {
-  if(Range::length(range) <= 1 || this->root() == range) { return 0; }
-  return this->rmq(range.first + 1, range.second).second;
+  if(Range::length(range) <= 1) { return node_type::UNKNOWN; }
+  range_type res = this->rmq(range.first + 1, range.second);
+  return (res == this->notFound() ? node_type::UNKNOWN : res.second);
 }
 
 //------------------------------------------------------------------------------

diff --git a/lcp.h b/lcp.h
@@ -141,6 +141,7 @@ class LCPArray
   // String depth of the node; the length of the longest pattern matching the range.
   // Not supported for leaf nodes / ranges of length 1.
   size_type depth(const node_type& node) const;
+  size_type depth(node_type& node) const;
   size_type depth(range_type range) const;
 
 //------------------------------------------------------------------------------