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

Function cascade_delete_edges

src/graph_buffer/graph_buffer.c:474–492  ·  view source on GitHub ↗

Cascade-delete all edges touching nodes in deleted_set. */

Source from the content-addressed store, hash-verified

472
473/* Cascade-delete all edges touching nodes in deleted_set. */
474static void cascade_delete_edges(cbm_gbuf_t *gb, CBMHashTable *deleted_set) {
475 int write_idx = 0;
476 for (int i = 0; i < gb->edges.count; i++) {
477 cbm_gbuf_edge_t *e = gb->edges.items[i];
478 char src_id[CBM_SZ_32];
479 char tgt_id[CBM_SZ_32];
480 make_id_key(src_id, sizeof(src_id), e->source_id);
481 make_id_key(tgt_id, sizeof(tgt_id), e->target_id);
482
483 if (cbm_ht_get(deleted_set, src_id) || cbm_ht_get(deleted_set, tgt_id)) {
484 unindex_edge(gb, e);
485 free_edge_strings(e);
486 cbm_free(CBM_MEM_CLASS_GBUF_EDGE, e);
487 } else {
488 gb->edges.items[write_idx++] = gb->edges.items[i];
489 }
490 }
491 gb->edges.count = write_idx;
492}
493
494/* Register a node in primary (QN, ID) and secondary (label, name) indexes. */
495static void register_node_in_indexes(cbm_gbuf_t *gb, cbm_gbuf_node_t *node) {

Callers 3

cbm_gbuf_delete_by_labelFunction · 0.85
cbm_gbuf_delete_by_fileFunction · 0.85
gbuf_delete_untouchedFunction · 0.85

Calls 5

make_id_keyFunction · 0.85
cbm_ht_getFunction · 0.85
unindex_edgeFunction · 0.85
free_edge_stringsFunction · 0.85
cbm_freeFunction · 0.85

Tested by

no test coverage detected