### Question:
NodeRef implements Bounded, Comparable<NodeRef> { public static boolean isChild(String parentPath, String nodePath) { checkNotNull(parentPath, "parentPath"); checkNotNull(nodePath, "nodePath"); return nodePath.length() > parentPath.length() && (parentPath.isEmpty() || nodePath.charAt(parentPath.length()) == PATH_SEPARATOR) && nodePath.startsWith(parentPath); } NodeRef(Node node, String parentPath, ObjectId metadataId); String getParentPath(); Node getNode(); String path(); String name(); ObjectId objectId(); ObjectId getMetadataId(); RevObject.TYPE getType(); @Override boolean equals(Object o); @Override int hashCode(); @Override int compareTo(NodeRef o); @Override String toString(); static @Nullable String parentPath(@Nullable String fullPath); static void checkValidPath(final String path); static @Nullable String nodeFromPath(@Nullable String fullPath); static boolean isDirectChild(String parentPath, String nodePath); static boolean isChild(String parentPath, String nodePath); static List<String> allPathsTo(final String path); static ImmutableList<String> split(final String path); static String appendChild(String parentTreePath, String childName); @Override boolean intersects(Envelope env); @Override void expand(Envelope env); static int depth(String path); static String removeParent(final String parentPath, final String childPath); static final String ROOT; static final char PATH_SEPARATOR; }### Answer:
@Test public void testIsChild() { assertFalse(isChild("", "")); assertTrue(isChild("", "path")); assertTrue(isChild("", "path/to")); assertFalse(isChild("path", "path")); assertFalse(isChild("path", "")); assertTrue(isChild("path", "path/to")); assertTrue(isChild("path", "path/to/node")); assertFalse(isChild("path/to", "")); assertFalse(isChild("path/to", "path")); assertFalse(isChild("path/to", "path/to")); assertFalse(isChild("path/to", "path2/to")); assertTrue(isChild("path/to", "path/to/node")); }