GraphInit
Description
Initialize an empty shallow-copy Graph. Inside a Scope block the allocator argument may be omitted; otherwise pass a typed allocator handle.
Success
Returns a live, empty graph with NULL copy callbacks (bitwise-copy semantics).
Failure
Cannot fail at construction; first allocation failures surface from later inserts.
Usage example (Cross-references)
Usage examples (Cross-references)
- In
Ops.c:13:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Ops.c:39:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Ops.c:86:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Ops.c:113:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Ops.c:162:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Ops.c:191:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Ops.c:225:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Ops.c:251:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Ops.c:287:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Ops.c:322:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Ops.c:350:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Ops.c:392:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Ops.c:427:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Ops.c:461:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Ops.c:501:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Ops.c:525:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Ops.c:551:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Ops.c:575:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Ops.c:618:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Ops.c:676:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Ops.c:730:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Init.c:21:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphReserve(&graph, 8);- In
Init.c:146:
aligned_64.base.retry_limit = 31;
StrGraph graph_a = GraphInit(&alloc);
StrGraph graph_b = GraphInitT(graph_b, &alloc);
StrGraph graph_c = GraphInitWithDeepCopy(str_init_copy, str_deinit, &alloc);- In
Init.c:150:
StrGraph graph_c = GraphInitWithDeepCopy(str_init_copy, str_deinit, &alloc);
StrGraph graph_d = GraphInitWithDeepCopyT(graph_d, str_init_copy, str_deinit, &alloc);
StrGraph graph_e = GraphInit(&aligned_8);
StrGraph graph_f = GraphInitT(graph_f, &aligned_16);
StrGraph graph_g = GraphInitWithDeepCopy(str_init_copy, str_deinit, &aligned_32);- In
Init.c:199:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
bool result = GraphReserve(&graph, 64);- In
Init.c:221:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&dbg);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Insert.c:37:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
int owned = 42;
int shared = 7;- In
Insert.c:60:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 1);- In
Insert.c:90:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 1);- In
Insert.c:123:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
(void)GraphAddNodeR(&graph, 1);- In
Insert.c:150:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Type.c:21:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
ValidateGraph(&graph);- In
Type.c:47:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId node_id = GraphAddNodeR(&graph, 11);- In
Type.c:76:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Type.c:115:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
(void)GraphAddNodeR(&graph, 10);- In
Type.c:151:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
(void)GraphAddNodeR(&graph, 10);- In
Type.c:177:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
(void)GraphAddNodeR(&graph, 10);- In
Type.c:202:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
(void)GraphAddNodeR(&graph, 10);- In
Type.c:239:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Type.c:270:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Type.c:305:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Type.c:336:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Type.c:371:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Type.c:400:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Type.c:430:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Type.c:465:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Type.c:495:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Type.c:530:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Foreach.c:139:
typedef Map(GraphNodeId, u64) CountMap;
IntGraph graph = GraphInit(&alloc);
CountMap counts = MapInit(node_id_hash, node_id_compare, &alloc);- In
Foreach.c:177:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 1);- In
Foreach.c:213:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphAddNodeR(&graph, 1);- In
Foreach.c:234:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 1);- In
Foreach.c:258:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 1);- In
Foreach.c:289:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
// Pre-grow so the live capacity is deterministic and not 42.
- In
Foreach.c:327:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Foreach.c:367:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Foreach.c:404:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Foreach.c:442:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Foreach.c:478:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
// Pre-reserve enough capacity that appending a third slot does NOT realloc,
- In
Foreach.c:512:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
(void)GraphAddNodeR(&graph, 10);- In
Foreach.c:545:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Foreach.c:578:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
(void)GraphAddNodeR(&graph, 10);- In
Access.c:22:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Access.c:64:
typedef Graph(Zstr) ZstrGraph;
ZstrGraph graph = GraphInit(&alloc);
GraphNodeId red = GraphAddNodeR(&graph, "red");- In
Access.c:90:
typedef Graph(int) IntGraph;
IntGraph graph_a = GraphInit(&alloc);
IntGraph graph_b = GraphInit(&alloc);
GraphNode node = GraphGetNode(&graph_a, GraphAddNodeR(&graph_a, 10));- In
Access.c:91:
typedef Graph(int) IntGraph;
IntGraph graph_a = GraphInit(&alloc);
IntGraph graph_b = GraphInit(&alloc);
GraphNode node = GraphGetNode(&graph_a, GraphAddNodeR(&graph_a, 10));- In
Access.c:108:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Access.c:127:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Access.c:158:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Access.c:196:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Access.c:231:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Access.c:264:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Access.c:289:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Access.c:313:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);- In
Access.c:345:
typedef Graph(int) IntGraph;
IntGraph graph = GraphInit(&alloc);
GraphNodeId a = GraphAddNodeR(&graph, 10);
Last updated on