1 static char help[] = "Test PETSc integer hash map.\n\n"; 2 3 #include <petsc/private/hashmapi.h> 4 #include <petsc/private/hashmapiv.h> 5 #include <petscsys.h> 6 7 /* Unused, keep it for testing purposes */ 8 PETSC_HASH_MAP(HMapIP, PetscInt, void*, PetscHashInt, PetscHashEqual, NULL) 9 10 /* Unused, keep it for testing purposes */ 11 typedef struct { double x; double y; double z; } Point; 12 static Point origin = {0.0, 0.0, 0.0}; 13 PETSC_HASH_MAP(HMapIS, PetscInt, Point, PetscHashInt, PetscHashEqual, origin) 14 15 #define PetscAssert(expr) do { \ 16 if (PetscUnlikely(!(expr))) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB, "Assertion: `%s' failed.", PetscStringize(expr)); \ 17 } while (0) 18 19 int main(int argc,char **argv) 20 { 21 PetscHMapI ht = NULL, hd; 22 PetscHMapIV htv; 23 PetscInt n, v, koff, keys[4], voff, vals[4],na,nb,i,size,*karray,off; 24 PetscScalar *varray,*vwork; 25 PetscBool has, flag; 26 PetscErrorCode ierr; 27 28 ierr = PetscInitialize(&argc,&argv,NULL,help);if (ierr) return ierr; 29 30 ierr = PetscHMapICreate(&ht);CHKERRQ(ierr); 31 PetscAssert(ht != NULL); 32 ierr = PetscHMapIGetSize(ht,&n);CHKERRQ(ierr); 33 PetscAssert(n == 0); 34 35 ierr = PetscHMapIResize(ht,0);CHKERRQ(ierr); 36 ierr = PetscHMapIGetSize(ht,&n);CHKERRQ(ierr); 37 PetscAssert(n == 0); 38 39 ierr = PetscHMapIHas(ht,123,&has);CHKERRQ(ierr); 40 PetscAssert(has == PETSC_FALSE); 41 ierr = PetscHMapIGet(ht,123,&v);CHKERRQ(ierr); 42 PetscAssert(v == -1); 43 44 ierr = PetscHMapISet(ht,123,42);CHKERRQ(ierr); 45 ierr = PetscHMapIGetSize(ht,&n);CHKERRQ(ierr); 46 PetscAssert(n == 1); 47 ierr = PetscHMapIHas(ht,123,&has);CHKERRQ(ierr); 48 PetscAssert(has == PETSC_TRUE); 49 ierr = PetscHMapIGet(ht,123,&v);CHKERRQ(ierr); 50 PetscAssert(v == 42); 51 52 ierr = PetscHMapIDel(ht,123);CHKERRQ(ierr); 53 ierr = PetscHMapIGetSize(ht,&n);CHKERRQ(ierr); 54 PetscAssert(n == 0); 55 ierr = PetscHMapIHas(ht,123,&has);CHKERRQ(ierr); 56 PetscAssert(has == PETSC_FALSE); 57 ierr = PetscHMapIGet(ht,123,&v);CHKERRQ(ierr); 58 PetscAssert(v == -1); 59 60 ierr = PetscHMapIQuerySet(ht,123,1,&flag);CHKERRQ(ierr); 61 PetscAssert(flag == PETSC_TRUE); 62 ierr = PetscHMapIQuerySet(ht,123,1,&flag);CHKERRQ(ierr); 63 PetscAssert(flag == PETSC_FALSE); 64 ierr = PetscHMapIQueryDel(ht,123,&flag);CHKERRQ(ierr); 65 PetscAssert(flag == PETSC_TRUE); 66 ierr = PetscHMapIQueryDel(ht,123,&flag);CHKERRQ(ierr); 67 PetscAssert(flag == PETSC_FALSE); 68 69 ierr = PetscHMapIResize(ht,13);CHKERRQ(ierr); 70 ierr = PetscHMapIGetSize(ht,&n);CHKERRQ(ierr); 71 PetscAssert(n == 0); 72 73 ierr = PetscHMapIClear(ht);CHKERRQ(ierr); 74 ierr = PetscHMapIGetSize(ht,&n);CHKERRQ(ierr); 75 PetscAssert(n == 0); 76 77 ierr = PetscHMapISet(ht,321,24);CHKERRQ(ierr); 78 ierr = PetscHMapISet(ht,123,42);CHKERRQ(ierr); 79 ierr = PetscHMapIGetSize(ht,&n);CHKERRQ(ierr); 80 PetscAssert(n == 2); 81 82 koff = 0; keys[0] = keys[1] = 0; 83 ierr = PetscHMapIGetKeys(ht,&koff,keys);CHKERRQ(ierr); 84 ierr = PetscSortInt(koff,keys);CHKERRQ(ierr); 85 PetscAssert(koff == 2); 86 PetscAssert(keys[0] == 123); 87 PetscAssert(keys[1] == 321); 88 89 voff = 0; vals[0] = vals[1] = 0; 90 ierr = PetscHMapIGetVals(ht,&voff,vals);CHKERRQ(ierr); 91 ierr = PetscSortInt(voff,vals);CHKERRQ(ierr); 92 PetscAssert(voff == 2); 93 PetscAssert(vals[0] == 24); 94 PetscAssert(vals[1] == 42); 95 96 koff = 0; keys[0] = keys[1] = 0; 97 voff = 0; vals[0] = vals[1] = 0; 98 ierr = PetscHMapIDuplicate(ht,&hd);CHKERRQ(ierr); 99 ierr = PetscHMapIGetKeys(ht,&koff,keys);CHKERRQ(ierr); 100 ierr = PetscHMapIGetVals(ht,&voff,vals);CHKERRQ(ierr); 101 ierr = PetscSortInt(koff,keys);CHKERRQ(ierr); 102 ierr = PetscSortInt(voff,vals);CHKERRQ(ierr); 103 PetscAssert(koff == 2); 104 PetscAssert(voff == 2); 105 PetscAssert(keys[0] == 123); 106 PetscAssert(keys[1] == 321); 107 PetscAssert(vals[0] == 24); 108 PetscAssert(vals[1] == 42); 109 ierr = PetscHMapIDestroy(&hd);CHKERRQ(ierr); 110 111 ierr = PetscHMapISet(ht,0,0);CHKERRQ(ierr); 112 ierr = PetscHMapIGetSize(ht,&n);CHKERRQ(ierr); 113 PetscAssert(n != 0); 114 ierr = PetscHMapIReset(ht);CHKERRQ(ierr); 115 ierr = PetscHMapIGetSize(ht,&n);CHKERRQ(ierr); 116 PetscAssert(n == 0); 117 ierr = PetscHMapIReset(ht);CHKERRQ(ierr); 118 ierr = PetscHMapIGetSize(ht,&n);CHKERRQ(ierr); 119 PetscAssert(n == 0); 120 ierr = PetscHMapISet(ht,0,0);CHKERRQ(ierr); 121 ierr = PetscHMapIGetSize(ht,&n);CHKERRQ(ierr); 122 PetscAssert(n != 0); 123 124 ierr = PetscHMapIDestroy(&ht);CHKERRQ(ierr); 125 PetscAssert(ht == NULL); 126 127 ierr = PetscHMapICreate(&ht);CHKERRQ(ierr); 128 ierr = PetscHMapIReset(ht);CHKERRQ(ierr); 129 ierr = PetscHMapIGetSize(ht,&n);CHKERRQ(ierr); 130 PetscAssert(n == 0); 131 ierr = PetscHMapIDestroy(&ht);CHKERRQ(ierr); 132 133 ierr = PetscHMapIVCreate(&htv);CHKERRQ(ierr); 134 n = 10; 135 ierr = PetscHMapIVResize(htv,n);CHKERRQ(ierr); 136 ierr = PetscHMapIVGetCapacity(htv,&na);CHKERRQ(ierr); 137 PetscAssert(na>=n); 138 for (i=0; i<n; i++) { 139 ierr = PetscHMapIVSet(htv,i+100,10.);CHKERRQ(ierr); 140 } 141 ierr = PetscHMapIVGetCapacity(htv,&nb);CHKERRQ(ierr); 142 PetscAssert(nb>=na); 143 for (i=0; i<(2*n); i++) { 144 ierr = PetscHMapIVAddValue(htv,i+100,5.);CHKERRQ(ierr); 145 } 146 ierr = PetscHMapIVGetSize(htv,&size);CHKERRQ(ierr); 147 PetscAssert(size==(2*n)); 148 ierr = PetscMalloc3(size,&karray,size,&varray,size,&vwork);CHKERRQ(ierr); 149 off = 0; 150 ierr = PetscHMapIVGetPairs(htv,&off,karray,varray);CHKERRQ(ierr); 151 PetscAssert(off==(2*n)); 152 ierr = PetscSortIntWithDataArray(off,karray,varray,sizeof(PetscScalar),vwork);CHKERRQ(ierr); 153 for (i=0; i<n; i++) { 154 PetscAssert(karray[i]==(i+100)); 155 PetscAssert(karray[n+i]==(n+i+100)); 156 PetscAssert(varray[i]==15.); 157 PetscAssert(varray[n+i]==5.); 158 } 159 ierr = PetscFree3(karray,varray,vwork);CHKERRQ(ierr); 160 ierr = PetscHMapIVDestroy(&htv);CHKERRQ(ierr); 161 162 ierr = PetscFinalize(); 163 return ierr; 164 } 165 166 /*TEST 167 168 test: 169 170 TEST*/ 171