MCPcopy Create free account
hub / github.com/DeusData/codebase-memory-mcp / cov_require

Function cov_require

tests/test_java_lsp_coverage.c:65–78  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

63}
64
65static int cov_require(const CBMFileResult *r, const char *callerSub, const char *calleeSub) {
66 int idx = cov_find(r, callerSub, calleeSub);
67 if (idx < 0) {
68 printf("\n MISSING: %s -> %s (have %d entries)\n", callerSub, calleeSub,
69 r->resolved_calls.count);
70 for (int i = 0; i < r->resolved_calls.count; i++) {
71 const CBMResolvedCall *rc = &r->resolved_calls.items[i];
72 printf(" %s -> %s [%s %.2f]\n", rc->caller_qn ? rc->caller_qn : "(null)",
73 rc->callee_qn ? rc->callee_qn : "(null)",
74 rc->strategy ? rc->strategy : "(null)", rc->confidence);
75 }
76 }
77 return idx;
78}
79
80static int cov_count_strict(const CBMFileResult *r) {
81 int n = 0;

Callers 1

Calls 1

cov_findFunction · 0.85

Tested by

no test coverage detected