UnitCell.h

Go to the documentation of this file.

// Copyright(C) 2021, 2022, 2023 National Technology & Engineering Solutions
// of Sandia, LLC (NTESS).  Under the terms of Contract DE-NA0003525 with
// NTESS, the U.S. Government retains certain rights in this software.
//
// See packages/seacas/LICENSE for details
#pragma once
 
#include <array>
#include <map>
#include <string>
#include <vector>
 
#include "Ioss_Region.h"
 
 
enum class Bnd { MIN_I = 0, MAX_I = 1, MIN_J = 2, MAX_J = 3, MIN_K = 4, MAX_K = 5 };
enum class Flg { MIN_I = 1, MAX_I = 4, MIN_J = 2, MAX_J = 8, MIN_K = 16, MAX_K = 32 };
 
struct GeneratedSideBlock
{
  GeneratedSideBlock()                           = default;
  GeneratedSideBlock(const GeneratedSideBlock &) = delete;
 
  std::map<std::string, std::vector<int64_t>> m_faces;
 
  size_t size() const
  {
    size_t count = 0;
    for (const auto &faces : m_faces) {
      count += faces.second.size();
    }
    return count;
  }
};
 
class UnitCell
{
public:
  explicit UnitCell(std::shared_ptr<Ioss::Region> region);
  UnitCell(const UnitCell &) = delete;
 
  std::vector<int> categorize_nodes(bool neighbor_i, bool neighbor_j, bool all_faces = false) const;
 
  std::shared_ptr<Ioss::Region> m_region{nullptr};
 
  std::vector<int64_t> min_I_face{};
  std::vector<int64_t> max_I_face{};
  std::vector<int64_t> min_J_face{};
  std::vector<int64_t> max_J_face{};
 
  std::pair<double, double> minmax_x{};
  std::pair<double, double> minmax_y{};
 
  void generate_boundary_faces(unsigned int which_faces);
 
  void categorize_z_nodes(std::vector<int> &categorized_nodes);
 
  std::array<GeneratedSideBlock, 6> boundary_blocks{};
 
  size_t cell_II{};
  size_t cell_JJ{};
  size_t cell_KK{};
};
 
using UnitCellMap = std::map<std::string, std::shared_ptr<UnitCell>>;