Module search 

Code search — graph-aware querying of CodeNodes and CodeEdges.

Extends mcp_tools::codegraph_query_objects with graph-traversal capabilities:

• Edge-based search: find callers of, callees of, importers of, tests for
• Pattern search: case-insensitive substring match on name, signature, docstring
• Dependency search: find all transitive dependencies (callers N levels deep)
• Composite search: combine structural + graph criteria

Structs

CodeSearch

A search query that combines structural and graph criteria.

SearchResult

Result of a code search.

Functions

callees

Find all callees of a function/method (convenience wrapper).

callers

Find all callers of a function/method (convenience wrapper).

children_of

Find all children (contained nodes) of a given node.

find_sources

Find all nodes that have an edge of predicate type pointing TO target_id.

find_targets

Find all nodes that source_id has an edge of predicate type pointing TO.

search_nodes

Find nodes matching a CodeSearch query.

tests_for

Find tests that cover a node (convenience wrapper).

transitive_callers

Reverse transitive search — find all nodes that can reach target_id following edges of type predicate in reverse, up to max_depth hops.

transitive_deps

Transitive dependency search — find all nodes reachable from start_id following edges of type predicate, up to max_depth hops.