fixed merge

libkeke_array.c

@@ -200,8 +200,16 @@ void keke_array_qsort_header(KekeArray *array, size_t start_header_size) {
 
 // requires pre-sorted arrays
 KekeArray *keke_array_merge(KekeArray *a, KekeArray *b) {
-	if(a->len == 0) return keke_array_clone(b);
-	if(b->len == 0) return keke_array_clone(a);
+	if(a->len == 0) {
+		KekeArray *r = keke_array_clone(b);
+		keke_array_set_len(b, 0);
+		return r;
+	}
+	if(b->len == 0) {
+		KekeArray *r = keke_array_clone(a);
+		keke_array_set_len(a, 0);
+		return r;
+	}
 	keke_array_reverse(a);
 	keke_array_reverse(b);
 	if(a->type_size != b->type_size) return NULL;