From fbcb1cad3eca5ca670f623bdb25a78b8fe54af1b Mon Sep 17 00:00:00 2001 From: Peter Mikkelsen Date: Wed, 19 Jan 2022 10:42:21 +0000 Subject: =?UTF-8?q?Add=20dyadic=20=E2=89=A1=20match?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- array.c | 38 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 38 insertions(+) (limited to 'array.c') diff --git a/array.c b/array.c index 5fb2a32..cf5a7f3 100644 --- a/array.c +++ b/array.c @@ -209,4 +209,42 @@ simplifyarray(Array *a) return b; }else return fnSame(a); +} + +int +comparearray(Array *a, Array *b) +{ + /* returns -1 if a < b, 0 if a == b and 1 if a > b. + Only correctly handles test for equality right now, + and returns 1 for unequal data. */ + + if(a->type != b->type) + return 1; + if(a->rank != b->rank) + return 1; + if(a->size != b->size) + return 1; + for(int i = 0; i < a->rank; i++) + if(a->shape[i] != b->shape[i]) + return 1; + for(int i = 0; i < a->size; i++){ + if(a->type == AtypeArray){ + /* do something recursive here */ + int sub = comparearray(a->arraydata[i], b->arraydata[i]); + if(sub != 0) + return sub; + }else{ + int sub = memcmp( + a->rawdata + i * datasizes[a->type], + b->rawdata + i * datasizes[a->type], + datasizes[a->type]); + if(sub < 0) + return -1; + else if(sub > 0) + return 1; + } + } + + /* if we get here, the arrays are equal */ + return 0; } \ No newline at end of file -- cgit v1.2.3