Function Map_Compare

src/datatypes/map.c:216–262

}

int Map_Compare
(
	SIValue mapA,
	SIValue mapB,
	int *disjointOrNull
) {
	int   order        =  0;
	Map   A            =  mapA.map;
	Map   B            =  mapB.map;
	uint  key_count    =  Map_KeyCount(mapA);
	uint  A_key_count  =  Map_KeyCount(mapA);
	uint  B_key_count  =  Map_KeyCount(mapB);

	if(A_key_count != B_key_count) {
		if(A_key_count > B_key_count) return 1;
		else return -1;
	}

	// sort both maps
	qsort(A, A_key_count, sizeof(Pair),
			(int(*)(const void*, const void*))_key_cmp);
	qsort(B, B_key_count, sizeof(Pair),
			(int(*)(const void*, const void*))_key_cmp);

	// element-wise key comparison
	for(uint i = 0; i < key_count; i++) {
		// if the maps contain different keys, order in favor
		// of the first lexicographically greater key
		order = SIValue_Compare(A[i].key, B[i].key, NULL);
		if(order != 0) return order;
	}

	// element-wise value comparison
	for(uint i = 0; i < key_count; i++) {
		// key lookup succeeded; compare values
		order = SIValue_Compare(A[i].val, B[i].val, disjointOrNull);
		if(disjointOrNull && (*disjointOrNull == COMPARED_NULL ||
							  *disjointOrNull == DISJOINT)) {
			return 0;
		}

		if(order != 0) return order;
	}

	// maps are equal
	return 0;
}

// this method referenced by Java ArrayList.hashCode() method, which takes
// into account the hashing of nested values