Actual source code: ex43.c

  1: static char help[] = "Test scalability of PetscHSetIJ hash set.\n\n";

  3: #include <petscsys.h>
  4: #include <petsctime.h>
  5: #include <petsc/private/hashsetij.h>

  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;

 17:   PetscFunctionBeginUser;
 18:   PetscCall(PetscInitialize(&argc, &argv, NULL, help));
 19:   PetscCall(PetscOptionsGetInt(NULL, NULL, "-N", &N, NULL));
 20:   PetscCall(PetscHSetIJCreate(&table));

 22:   /* The following line silences warnings from Clang Static Analyzer */
 23:   PetscCall(PetscHSetIJResize(table, 0));

 25:   PetscCall(PetscTimeSubtract(&t_add));
 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:       PetscCall(PetscHSetIJQueryAdd(table, key, &flag));
 31:     }
 32:   }
 33:   PetscCall(PetscTimeAdd(&t_add));

 35:   PetscCall(PetscHSetIJGetSize(table, &n));

 37:   PetscCall(PetscTimeSubtract(&t_has));
 38:   for (i = 0; i < N; ++i) {
 39:     for (j = 0; j < N; ++j) {
 40:       key.i = i;
 41:       key.j = j;
 42:       PetscCall(PetscHSetIJHas(table, key, &flag));
 43:     }
 44:   }
 45:   PetscCall(PetscTimeAdd(&t_has));

 47:   PetscCall(PetscTimeSubtract(&t_del));
 48:   for (i = 0; i < N; ++i) {
 49:     for (j = 0; j < N; ++j) {
 50:       key.i = i;
 51:       key.j = j;
 52:       PetscCall(PetscHSetIJQueryDel(table, key, &flag));
 53:     }
 54:   }
 55:   PetscCall(PetscTimeAdd(&t_del));

 57:   PetscCall(PetscPrintf(PETSC_COMM_WORLD, "N = %" PetscInt_FMT " - table size: %" PetscInt_FMT ", add: %g, has: %g, del: %g\n", N, n, t_add, t_has, t_del));

 59:   PetscCall(PetscHSetIJDestroy(&table));
 60:   PetscCall(PetscFinalize());
 61:   return 0;
 62: }

 64: /*TEST

 66:    test:
 67:      args: -N 32

 69: TEST*/