Page Menu
Home
c4science
Search
Configure Global Search
Log In
Files
F83015781
region_intersect.cpp
No One
Temporary
Actions
Download File
Edit File
Delete File
View Transforms
Subscribe
Mute Notifications
Award Token
Subscribers
None
File Metadata
Details
File Info
Storage
Attached
Created
Sat, Sep 14, 18:20
Size
2 KB
Mime Type
text/x-c
Expires
Mon, Sep 16, 18:20 (2 d)
Engine
blob
Format
Raw Data
Handle
20784674
Attached To
rLAMMPS lammps
region_intersect.cpp
View Options
/* ----------------------------------------------------------------------
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_intersect.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)
/* ---------------------------------------------------------------------- */
RegIntersect::RegIntersect(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 intersect
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 intersection of regions
Region **regions = domain->regions;
extent_xlo = regions[list[0]]->extent_xlo;
extent_ylo = regions[list[0]]->extent_ylo;
extent_zlo = regions[list[0]]->extent_zlo;
extent_xhi = regions[list[0]]->extent_xhi;
extent_yhi = regions[list[0]]->extent_yhi;
extent_zhi = regions[list[0]]->extent_zhi;
for (int ilist = 1; ilist < nregion; ilist++) {
extent_xlo = MAX(extent_xlo,regions[list[ilist]]->extent_xlo);
extent_ylo = MAX(extent_ylo,regions[list[ilist]]->extent_ylo);
extent_zlo = MAX(extent_zlo,regions[list[ilist]]->extent_zlo);
extent_xhi = MIN(extent_xhi,regions[list[ilist]]->extent_xhi);
extent_yhi = MIN(extent_yhi,regions[list[ilist]]->extent_yhi);
extent_zhi = MIN(extent_zhi,regions[list[ilist]]->extent_zhi);
}
}
/* ---------------------------------------------------------------------- */
RegIntersect::~RegIntersect()
{
delete [] list;
}
/* ---------------------------------------------------------------------- */
int RegIntersect::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 all regions
if (ilist == nregion) inside = 1;
else inside = 0;
return !(inside ^ interior); // 1 if same, 0 if different
}
Event Timeline
Log In to Comment