// Test with normal URLs
        String parentUrl = "http://example.com/parent";
        String url = "http://example.com/child";
        ContentNotFoundException exception = new ContentNotFoundException(parentUrl, url);

        assertNotNull(exception);
        assertEquals("Not Found: http://example.com/child Parent: http://example.com/parent", exception.getMessage());
        assertNull(exception.getCause());
    }

	font-size: 1.2em;
	margin: 0.2em;
}

.searchButtonBox {
	margin-top: 1em;
}

/* search */

:first-child.list-group-item {
	border-radius: 0px;
}

:last-child.list-group-item {
	border-radius: 0px;
}

#result ol li {
	margin: 1em 0;
}

#result ol li:first-child {
	margin-top: 0;
}

#result .title a:visited {
	color: #014c8c;
}

#result .body {

    protected @Nullable T computeNext() {
      while (!stack.isEmpty()) {
        PostOrderNode<T> top = stack.getLast();
        if (top.childIterator.hasNext()) {
          T child = top.childIterator.next();
          stack.addLast(expand(child));
        } else {
          stack.removeLast();
          return top.root;
        }
      }
      return endOfData();
    }

            public static final String IGNORE_ROBOTS_TAGS = "ignore.robots.tags";
            public static final String SCRIPT_TYPE = "script.type";
            public static final String HTML_CHILD_URL_RULES = "html.child.url.rules";
            public static final String CRAWL_ORDER = "crawl.order";
        }

        // meta.*
        // meta.<field>=<value>

        // value.*
        // value.<field>=<value>

        // Read all the children
        idx += doParseTrieToBuilder(stack, encoded, idx, builder);

        if (encoded.charAt(idx) == '?' || encoded.charAt(idx) == ',') {
          // An extra '?' or ',' after a child node indicates the end of all children of this node.
          idx++;
          break;
        }
      }
    }

    stack.pop();
    return idx - start;
  }

    protected @Nullable T computeNext() {
      while (!stack.isEmpty()) {
        PostOrderNode<T> top = stack.getLast();
        if (top.childIterator.hasNext()) {
          T child = top.childIterator.next();
          stack.addLast(expand(child));
        } else {
          stack.removeLast();
          return top.root;
        }
      }
      return endOfData();
    }