ternary_index_space.cc

//
// Copyright (c) 2014 Limit Point Systems, Inc. 
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//   http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//

// Implementation for class ternary_index_space

#include "SheafSystem/ternary_index_space.h"
#include "SheafSystem/assert_contract.h"

using namespace fiber_bundle; // Workaround for MS C++ bug.

// ===========================================================
// TERNARY_INDEX_SPACE FACET
// ===========================================================

sheaf::ragged_array<unary_index>*
fiber_bundle::ternary_index_space::
neighbor_list() const
{
  // Preconditions:

  // Body:

  // Create the block neighborhoods.

  ternary_index lblock_id, lnbr_id;
  ragged_array<unary_index>* result = new ragged_array<unary_index>(27*size);

  for(lblock_id.i=0; lblock_id.i<i_size; lblock_id.i++)
  {
    for(lblock_id.j=0; lblock_id.j<j_size; lblock_id.j++)
    {
      for(lblock_id.k=0; lblock_id.k<k_size; lblock_id.k++)
      {

        // Make a list of the members in the neighborhood of
        // the current member, including the current member itself.

        ternary_index ldelta;
        for(ldelta.i=-1; ldelta.i<2; ldelta.i++)
        {
          for(ldelta.j=-1; ldelta.j<2; ldelta.j++)
          {
            for(ldelta.k=-1; ldelta.k<2; ldelta.k++)
            {
              lnbr_id = lblock_id + ldelta;
              if(contains(lnbr_id))
              {
                result->push_back(to_row_major_offset(lnbr_id));
              }
            }
          }
        }

        if(result->row_ct() < size)
        {
          // Move the the next row.

          result->new_back_row();
        }
      }
    }
  }

  // Postconditions:

  ensure(result != 0);
  ensure(result->row_ct() == size);

  // Exit:

  return result;
}


// ===========================================================
//  NON-MEMBER FUNCTIONS
// ===========================================================

std::ostream&
fiber_bundle::
operator<<(std::ostream& os, const fiber_bundle::ternary_index_space& xbis)
{
  os << "i_size: " << xbis.i_size
  << " j_size: " << xbis.j_size
  << " k_size: " << xbis.k_size
  << " size: " << xbis.size;
  return os;
}