table: enforce NameTree max depth universally

refs #4262

Change-Id: Ia9b04a89c12cd09aa244201b513cc1808c0c473f
diff --git a/tests/daemon/table/name-tree.t.cpp b/tests/daemon/table/name-tree.t.cpp
index 8b7307a..458d7e3 100644
--- a/tests/daemon/table/name-tree.t.cpp
+++ b/tests/daemon/table/name-tree.t.cpp
@@ -1,6 +1,6 @@
 /* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
 /*
- * Copyright (c) 2014-2017,  Regents of the University of California,
+ * Copyright (c) 2014-2018,  Regents of the University of California,
  *                           Arizona Board of Regents,
  *                           Colorado State University,
  *                           University Pierre & Marie Curie, Sorbonne University,
@@ -417,20 +417,6 @@
   BOOST_CHECK_EQUAL(nt.size(), 8);
 }
 
-BOOST_AUTO_TEST_CASE(LongName)
-{
-  Name name;
-  for (int i = 0; i < 2000; ++i) {
-    name.append("X");
-  }
-
-  NameTree nt;
-
-  Entry& entry1 = nt.lookup(name, true);
-  BOOST_CHECK_EQUAL(entry1.getName().size(), NameTree::getMaxDepth());
-  BOOST_CHECK_EQUAL(nt.size(), NameTree::getMaxDepth() + 1);
-}
-
 /** \brief verify a NameTree enumeration contains expected entries
  *
  *  Example: