-
Notifications
You must be signed in to change notification settings - Fork 578
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge Pull Request #9475 from trilinos/Trilinos/master_merge_20210723…
…_000552 Automatically Merged using Trilinos Master Merge AutoTester PR Title: Trilinos Master Merge PR Generator: Auto PR created to promote from master_merge_20210723_000552 branch to master PR Author: trilinos-autotester
- Loading branch information
Showing
128 changed files
with
2,396 additions
and
822 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
126 changes: 126 additions & 0 deletions
126
packages/panzer/adapters-stk/src/Panzer_STK_CheckSidesetOverlap.cpp
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,126 @@ | ||
| // @HEADER | ||
| // *********************************************************************** | ||
| // | ||
| // Panzer: A partial differential equation assembly | ||
| // engine for strongly coupled complex multiphysics systems | ||
| // Copyright (2011) Sandia Corporation | ||
| // | ||
| // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, | ||
| // the U.S. Government retains certain rights in this software. | ||
| // | ||
| // Redistribution and use in source and binary forms, with or without | ||
| // modification, are permitted provided that the following conditions are | ||
| // met: | ||
| // | ||
| // 1. Redistributions of source code must retain the above copyright | ||
| // notice, this list of conditions and the following disclaimer. | ||
| // | ||
| // 2. Redistributions in binary form must reproduce the above copyright | ||
| // notice, this list of conditions and the following disclaimer in the | ||
| // documentation and/or other materials provided with the distribution. | ||
| // | ||
| // 3. Neither the name of the Corporation nor the names of the | ||
| // contributors may be used to endorse or promote products derived from | ||
| // this software without specific prior written permission. | ||
| // | ||
| // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY | ||
| // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE | ||
| // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, | ||
| // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, | ||
| // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR | ||
| // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF | ||
| // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING | ||
| // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS | ||
| // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| // | ||
| // Questions? Contact Roger P. Pawlowski ([email protected]) and | ||
| // Eric C. Cyr ([email protected]) | ||
| // *********************************************************************** | ||
| // @HEADER | ||
|
|
||
| #include "Panzer_STK_CheckSidesetOverlap.hpp" | ||
| #include <vector> | ||
| #include <algorithm> | ||
|
|
||
| namespace panzer_stk { | ||
|
|
||
| /// Returns true if the sidesets overlap. | ||
| bool checkSidesetOverlap(const std::string& side_a_name, | ||
| const std::string& side_b_name, | ||
| const panzer_stk::STK_Interface& mesh) { | ||
|
|
||
| const bool print_debug = false; | ||
|
|
||
| // Get the locally owned nodes of sideset a | ||
| std::vector<stk::mesh::EntityId> gids_a; | ||
| { | ||
| std::vector<stk::mesh::Entity> nodes_a; | ||
| stk::mesh::Part* part_a = mesh.getSideset(side_a_name); | ||
| TEUCHOS_TEST_FOR_EXCEPTION(part_a==nullptr,std::runtime_error, | ||
| "panzer::checkSidesetOverlap: Unknown side set name \"" << side_a_name << "\""); | ||
| stk::mesh::Selector selector_a = *part_a & mesh.getMetaData()->locally_owned_part(); | ||
| const bool sort_by_gid = true; | ||
| stk::mesh::get_selected_entities(selector_a,mesh.getBulkData()->buckets(mesh.getNodeRank()),nodes_a,sort_by_gid); | ||
| // convert the entities to global ids | ||
| gids_a.resize(nodes_a.size()); | ||
| size_t i = 0; | ||
| for (auto&& node : nodes_a) { | ||
| gids_a[i] = mesh.getBulkData()->identifier(node); | ||
| ++i; | ||
| } | ||
| } | ||
|
|
||
| // Get all nodes of sideset b (including nodes from all mpi processes) | ||
| std::vector<stk::mesh::EntityId> gids_b; | ||
| { | ||
| std::vector<stk::mesh::Entity> nodes_b; | ||
| stk::mesh::Part* part_b = mesh.getSideset(side_b_name); | ||
| TEUCHOS_TEST_FOR_EXCEPTION(part_b==nullptr,std::runtime_error, | ||
| "panzer::checkSidesetOverlap: Unknown side set name \"" << side_b_name << "\""); | ||
| stk::mesh::Selector selector_b = *part_b; | ||
| const bool sort_by_gid = true; | ||
| stk::mesh::get_selected_entities(selector_b,mesh.getBulkData()->buckets(mesh.getNodeRank()),nodes_b,sort_by_gid); | ||
| // convert the entities to global ids | ||
| gids_b.resize(nodes_b.size()); | ||
| size_t i = 0; | ||
| for (auto&& node : nodes_b) { | ||
| gids_b[i] = mesh.getBulkData()->identifier(node); | ||
| ++i; | ||
| } | ||
| } | ||
|
|
||
| // Sort the element gids so we can use binary search | ||
| std::sort(gids_b.begin(),gids_b.end()); | ||
|
|
||
| if (print_debug) { | ||
| Teuchos::FancyOStream os(Teuchos::rcpFromRef(std::cout)); | ||
| os.setShowProcRank(true); | ||
| os << std::endl; | ||
| os << "gids_a.size()=" << gids_a.size() << std::endl; | ||
| for (auto&& gid : gids_a) | ||
| os << "gid_a=" << gid << std::endl; | ||
| os << "gids_b.size()=" << gids_b.size() << std::endl; | ||
| for (auto&& gid : gids_b) | ||
| os << "gid_b=" << gid << std::endl; | ||
| } | ||
|
|
||
| // Search for each node in a in b | ||
| // 0 = no overlap, 1 = overlap | ||
| // We use int for MPI communication | ||
| int has_local_overlap = 0; | ||
| for (auto&& a : gids_a) { | ||
| if (std::binary_search(gids_b.begin(),gids_b.end(),a)) { | ||
| has_local_overlap = 1; | ||
| break; | ||
| } | ||
| } | ||
| int has_overlap = 0; | ||
| Teuchos::reduceAll(*mesh.getComm(),Teuchos::REDUCE_SUM,1,&has_local_overlap,&has_overlap); | ||
| if (has_overlap == 0) | ||
| return false; | ||
|
|
||
| return true; | ||
| } | ||
| } |
Oops, something went wrong.