Merge rest of lazy mifs

src/faebryk/core/cpp/__init__.pyi

@@ -33,6 +33,9 @@ class Counter:
 class Graph:
     def __init__(self) -> None: ...
     def get_edges(self, arg: GraphInterface, /) -> dict[GraphInterface, Link]: ...
+    @property
+    def edges(self) -> list[tuple[GraphInterface, GraphInterface, Link]]: ...
+    def get_gifs(self) -> set[GraphInterface]: ...
     def invalidate(self) -> None: ...
     @property
     def node_count(self) -> int: ...
@@ -120,6 +123,9 @@ class LinkDirectConditionalFilterResult(enum.Enum):
 
     FILTER_FAIL_UNRECOVERABLE = 2
 
+class LinkDirectDerived(LinkDirect):
+    pass
+
 class LinkFilteredException(Exception):
     pass
 

src/faebryk/core/cpp/include/graph/graph.hpp

@@ -10,6 +10,7 @@
 #include <nanobind/stl/pair.h>
 #include <nanobind/stl/shared_ptr.h>
 #include <nanobind/stl/string.h>
+#include <nanobind/stl/tuple.h>
 #include <nanobind/stl/unordered_map.h>
 #include <nanobind/stl/unordered_set.h>
 #include <nanobind/stl/vector.h>
@@ -194,6 +195,9 @@ class Graph {
 
     std::string repr();
 
+    Set<GI_ref> get_gifs();
+    std::vector<std::tuple<GI_ref_weak, GI_ref_weak, Link_ref>> all_edges();
+
     // Algorithms
     std::unordered_set<Node_ref> node_projection();
     std::vector<std::pair<Node_ref, std::string>>

src/faebryk/core/cpp/src/graph/graph.cpp

@@ -200,3 +200,11 @@ Graph::bfs_visit(std::function<bool(std::vector<GI_ref_weak> &, Link_ref)> filte
 
     return visited;
 }
+
+Set<GI_ref> Graph::get_gifs() {
+    return this->v;
+}
+
+std::vector<std::tuple<GI_ref_weak, GI_ref_weak, Link_ref>> Graph::all_edges() {
+    return this->e;
+}

src/faebryk/core/cpp/src/main.cpp

@@ -91,6 +91,8 @@ PYMOD(m) {
     nb::class_<Graph>(m, "Graph")
         .def(nb::init<>())
         .def("get_edges", &Graph::get_edges, nb::rv_policy::reference)
+        .def_prop_ro("edges", &Graph::all_edges, nb::rv_policy::reference)
+        .def("get_gifs", &Graph::get_gifs, nb::rv_policy::reference)
         .def("invalidate", &Graph::invalidate)
         .def_prop_ro("node_count", &Graph::node_count)
         .def_prop_ro("edge_count", &Graph::edge_count)
@@ -141,6 +143,7 @@ PYMOD(m) {
     nb::class_<LinkDirectConditional, LinkDirect>(m, "LinkDirectConditional")
         .def(nb::init<LinkDirectConditional::FilterF, bool>(), "filter"_a,
              "needs_only_first_in_path"_a = false);
+    nb::class_<LinkDirectDerived, LinkDirect>(m, "LinkDirectDerived");
 
     nb::exception<LinkDirectConditional::LinkFilteredException>(m,
                                                                 "LinkFilteredException");

src/faebryk/core/link.py

@@ -10,6 +10,7 @@
     LinkDirect,
     LinkDirectConditional,
     LinkDirectConditionalFilterResult,
+    LinkDirectDerived,
     LinkFilteredException,
     LinkNamedParent,
     LinkParent,