Fixed RNTuple tree structure and minor refactoring

Author: ariostas

src/uproot_browser/tree.py

@@ -6,9 +6,9 @@
 
 import dataclasses
 import functools
-from collections.abc import Mapping
+from collections.abc import Iterable
 from pathlib import Path
-from typing import Any, Literal, TypedDict
+from typing import Any, Literal, Protocol, TypedDict
 
 import uproot
 import uproot.reading
@@ -29,6 +29,10 @@
 )
 
 
+class SupportsRecursiveKeys(Protocol):
+    def keys(self, recursive: bool = True) -> Iterable[str]: ...
+
+
 def __dir__() -> tuple[str, ...]:
     return __all__
 
@@ -53,21 +57,14 @@ def _(item: uproot.reading.ReadOnlyDirectory) -> Literal[True]:  # noqa: ARG001
 
 
 @is_dir.register
-def _(item: uproot.behaviors.TBranch.HasBranches) -> bool:
-    return len(item.branches) > 0
-
-
-@is_dir.register
-def _(item: uproot.behaviors.RNTuple.HasFields) -> bool:
-    return len(item.keys()) > 0
+def _(
+    item: uproot.behaviors.TBranch.HasBranches | uproot.behaviors.RNTuple.HasFields,
+) -> bool:
+    return len(item) > 0
 
 
-def get_children(item: Mapping[str, Any]) -> set[str]:
-    return {
-        key.split(";")[0]
-        for key in item.keys()  # noqa: SIM118
-        if "/" not in key
-    }
+def get_children(item: SupportsRecursiveKeys) -> set[str]:
+    return {key.split(";")[0] for key in item.keys(recursive=False)}
 
 
 @dataclasses.dataclass