Function _AR_NodeDegree

src/arithmetic/entity_funcs/entity_funcs.c:144–211

returns node incoming/outgoing degree

// returns node incoming/outgoing degree
static SIValue _AR_NodeDegree
(
	SIValue *argv,
	int argc,
	GRAPH_EDGE_DIR dir  // edge direction
) {
	ASSERT(SI_TYPE(argv[0]) != T_NULL);

	Node          *n     = (Node*)argv[0].ptrval;
	uint64_t      count  = 0;
	GraphContext  *gc    = QueryCtx_GetGraphCtx();

	if(argc > 1) {
		// we're interested in specific relationship type(s)

		// get labels array from input arguments, but removing duplicates
		SIValue labels = SI_EmptyArray();
		if(SI_TYPE(argv[1]) == T_STRING) {
			// validate signature function(NODE, STR_0, STR_1, ... STR_N)
			for(int i = 1; i < argc; i++) {
				if(SI_TYPE(argv[i]) == T_STRING) {
					if(SIArray_ContainsValue(labels, argv[i], NULL) == false) {
						SIArray_Append(&labels, argv[i]);
					}
				} else {
					Error_SITypeMismatch(argv[i], T_STRING);
				}
			}
		} else if (SI_TYPE(argv[1]) == T_ARRAY) {
			if(argc > 2) {
				ErrorCtx_SetError("Received %d arguments, expected at most 2 because second argument is List", argc);
			}
			// validate signature function(NODE, ARRAY_OF_STRINGS)
			uint len = SIArray_Length(argv[1]);
			for(int j = 0; j < len; j++) {
				SIValue elem = SIArray_Get(argv[1], j);
				if(SI_TYPE(elem) != T_STRING) {
					SIArray_Free(labels);
					Error_SITypeMismatch(elem, T_STRING);
					return SI_NullVal();
				}
				if(SIArray_ContainsValue(labels, elem, NULL) == false) {
					SIArray_Append(&labels, elem);
				}
			}
		}
		uint len = SIArray_Length(labels);
		for(int i = 0; i < len; i++) {
			SIValue elem = SIArray_Get(labels, i);
			const char *label = elem.stringval;
			// make sure relationship exists.
			Schema *s = GraphContext_GetSchema(gc, label, SCHEMA_EDGE);
			if(s == NULL) {
				continue;
			}

			// count edges
			count += Graph_GetNodeDegree(gc->g, n, dir, s->id);