.contains(Qe)))}_keydown(t){if(![qe,We,Re,Ke].includes(t.key))return;t.stopPropagation(),t.preventDefault();const e=[We,Ke].includes(t.key),s=w(this._getChildren().filter((t=>!d(t))),t.target,e,!0);s&&(s.focus({preventScroll:!0}),Ge.getOrCreateInstance(s).show())}_getChildren(){return K.find(Ue,this._parent)}_getActiveElem(){return this._getChildren().find((t=>this._elemIsActive(t)))||null}_setInitialAttributes(t,e){this._setAttributeIfNotExists(t,"role","tablist");for(const t of e)this._setInit...

const isNext = [ARROW_RIGHT_KEY, ARROW_DOWN_KEY].includes(event.key)\n    const nextActiveElement = getNextActiveElement(this._getChildren().filter(element => !isDisabled(element)), event.target, isNext, true)\n\n    if (nextActiveElement) {\n      nextActiveElement.focus({ preventScroll: true })\n      Tab.getOrCreateInstance(nextActiveElement).show()\n    }\n  }\n\n  _getChildren() { // collection of inner elements\n    return SelectorEngine.find(SELECTOR_INNER_ELEM, this._parent)\n  }\n\n  _getActiveElem()...

        assertEquals(DirectoryCacheScope.IMMEDIATE_CHILDREN, entry.getScope());
        assertFalse(entry.isComplete());
        assertFalse(entry.hasChanges());
        assertTrue(entry.getChildren().isEmpty());
    }

    @Test
    public void testUpdateChild() {
        String childName = "file1.txt";
        long size = 1024L;
        long lastModified = System.currentTimeMillis();

        directoryLeaseManager.updateDirectoryCache(directoryPath, files);

        // Step 6: Verify cache is complete and populated
        assertTrue(cacheEntry.isComplete());
        assertEquals(2, cacheEntry.getChildren().size());
        assertTrue(cacheEntry.hasChild("document.txt"));
        assertTrue(cacheEntry.hasChild("subfolder"));

        // Step 7: Verify cached directory listing

 *
 * <p>If you have your own graph implementation based around a custom node type {@code MyNode},
 * which has a method {@code getChildren()} that retrieves its successors in a graph:
 *
 * {@snippet :
 * someGraphAlgorithm(startNode, MyNode::getChildren);
 * }
 *
 * <p>If you have some other mechanism for returning the successors of a node, or one that doesn't

        assertNotNull(cacheEntry);
        assertTrue(cacheEntry.isComplete());
        assertEquals(2, cacheEntry.getChildren().size());

        // Verify the cached files have correct names
        List<DirectoryCacheEntry.FileInfo> children = cacheEntry.getChildren();
        assertTrue(children.stream().anyMatch(f -> "file1.txt".equals(f.getName())));

    @Nullable
    Dependency getDependency();

    /**
     * Gets the child nodes of this node.
     *
     * @return the child nodes of this node, never {@code null}
     */
    @Nonnull
    List<Node> getChildren();

    /**
     * @return repositories of this node
     */
    @Nonnull
    List<RemoteRepository> getRemoteRepositories();

    /**
     * The repository where this artifact has been downloaded from.

            addEdge(parentVertex, vertex, e);
        } else {
            entry = vertex;
        }

        MetadataTreeNode[] kids = node.getChildren();
        if (kids == null || kids.length < 1) {
            return;
        }

        for (int i = 0; i < kids.length; i++) {
            MetadataTreeNode n = kids[i];

    entry.updateChild("file1.txt", attrs);
    
    assertTrue(entry.hasChild("file1.txt"));
    assertEquals(1, entry.getChildren().size());
    
    // Test removal
    entry.removeChild("file1.txt");
    assertFalse(entry.hasChild("file1.txt"));
    assertEquals(0, entry.getChildren().size());
}

@Test
public void testDirectoryLeaseManager() {

 *
 * <p>If you have your own graph implementation based around a custom node type {@code MyNode},
 * which has a method {@code getChildren()} that retrieves its successors in a graph:
 *
 * {@snippet :
 * someGraphAlgorithm(startNode, MyNode::getChildren);
 * }
 *
 * <p>If you have some other mechanism for returning the successors of a node, or one that doesn't