1 static char help[] = "Test scalability of PetscHSetIJ hash set.\n\n"; 2 3 #include <petscsys.h> 4 #include <petsctime.h> 5 #include <petsc/private/hashsetij.h> 6 7 int main(int argc, char **argv) 8 { 9 PetscHSetIJ table; 10 PetscInt N = 0, i, j, n; 11 PetscHashIJKey key; 12 PetscBool flag; 13 PetscLogDouble t_add = 0; 14 PetscLogDouble t_has = 0; 15 PetscLogDouble t_del = 0; 16 PetscErrorCode ierr; 17 18 ierr = PetscInitialize(&argc,&argv,NULL,help);if (ierr) return ierr; 19 ierr = PetscOptionsGetInt(NULL,NULL,"-N",&N,NULL);CHKERRQ(ierr); 20 ierr = PetscHSetIJCreate(&table);CHKERRQ(ierr); 21 22 /* The following line silences warnings from Clang Static Analyzer */ 23 ierr = PetscHSetIJResize(table,0);CHKERRQ(ierr); 24 25 ierr = PetscTimeSubtract(&t_add);CHKERRQ(ierr); 26 for (i = 0; i < N; ++i) { 27 for (j = 0; j < N; ++j) { 28 key.i = PetscMin(i, j); 29 key.j = PetscMax(i, j); 30 ierr = PetscHSetIJQueryAdd(table, key, &flag);CHKERRQ(ierr); 31 } 32 } 33 ierr = PetscTimeAdd(&t_add);CHKERRQ(ierr); 34 35 ierr = PetscHSetIJGetSize(table,&n);CHKERRQ(ierr); 36 37 ierr = PetscTimeSubtract(&t_has);CHKERRQ(ierr); 38 for (i = 0; i < N; ++i) { 39 for (j = 0; j < N; ++j) { 40 key.i = i; 41 key.j = j; 42 ierr = PetscHSetIJHas(table, key, &flag);CHKERRQ(ierr); 43 } 44 } 45 ierr = PetscTimeAdd(&t_has);CHKERRQ(ierr); 46 47 ierr = PetscTimeSubtract(&t_del);CHKERRQ(ierr); 48 for (i = 0; i < N; ++i) { 49 for (j = 0; j < N; ++j) { 50 key.i = i; 51 key.j = j; 52 ierr = PetscHSetIJQueryDel(table, key, &flag);CHKERRQ(ierr); 53 } 54 } 55 ierr = PetscTimeAdd(&t_del);CHKERRQ(ierr); 56 57 ierr = PetscPrintf(PETSC_COMM_WORLD,"N = %D - table size: %D, add: %g, has: %g, del: %g\n",N,n,t_add,t_has,t_del);CHKERRQ(ierr); 58 59 ierr = PetscHSetIJDestroy(&table);CHKERRQ(ierr); 60 ierr = PetscFinalize(); 61 return ierr; 62 } 63 64 /*TEST 65 66 test: 67 args: -N 32 68 69 TEST*/ 70