/* ---------------------------------------------------------------------- LAMMPS - Large-scale Atomic/Molecular Massively Parallel Simulator http://lammps.sandia.gov, Sandia National Laboratories Steve Plimpton, sjplimp@sandia.gov Copyright (2003) Sandia Corporation. Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, the U.S. Government retains certain rights in this software. This software is distributed under the GNU General Public License. See the README file in the top-level LAMMPS directory. ------------------------------------------------------------------------- */ #include "stdlib.h" #include "string.h" #include "region_union.h" #include "domain.h" #include "error.h" using namespace LAMMPS_NS; #define MIN(A,B) ((A) < (B)) ? (A) : (B) #define MAX(A,B) ((A) > (B)) ? (A) : (B) #define BIG 1.0e20 /* ---------------------------------------------------------------------- */ RegUnion::RegUnion(LAMMPS *lmp, int narg, char **arg) : Region(lmp, narg, arg) { if (narg < 5) error->all("Illegal region command"); int n = atoi(arg[2]); if (n < 2) error->all("Illegal region command"); options(narg-(n+3),&arg[n+3]); // build list of regions to union list = new int[n]; nregion = 0; int iregion; for (int iarg = 0; iarg < n; iarg++) { for (iregion = 0; iregion < domain->nregion; iregion++) if (strcmp(arg[iarg+3],domain->regions[iregion]->id) == 0) break; if (iregion == domain->nregion) error->all("Region union region ID does not exist"); list[nregion++] = iregion; } // extent of union of regions Region **regions = domain->regions; extent_xlo = extent_ylo = extent_zlo = BIG; extent_xhi = extent_yhi = extent_zhi = -BIG; for (int ilist = 0; ilist < nregion; ilist++) { extent_xlo = MIN(extent_xlo,regions[list[ilist]]->extent_xlo); extent_ylo = MIN(extent_ylo,regions[list[ilist]]->extent_ylo); extent_zlo = MIN(extent_zlo,regions[list[ilist]]->extent_zlo); extent_xhi = MAX(extent_xhi,regions[list[ilist]]->extent_xhi); extent_yhi = MAX(extent_yhi,regions[list[ilist]]->extent_yhi); extent_zhi = MAX(extent_zhi,regions[list[ilist]]->extent_zhi); } } /* ---------------------------------------------------------------------- */ RegUnion::~RegUnion() { delete [] list; } /* ---------------------------------------------------------------------- */ int RegUnion::match(double x, double y, double z) { int ilist; Region **regions = domain->regions; for (ilist = 0; ilist < nregion; ilist++) if (regions[list[ilist]]->match(x,y,z)) break; int inside; // inside if matched any region if (ilist == nregion) inside = 0; else inside = 1; return !(inside ^ interior); // 1 if same, 0 if different }