gmg-direct-info.cc

Go to the documentation of this file.

/*
 * lib-gmapkernel : Un noyau de 3-G-cartes et des opérations.
 * Copyright (C) 2004, Moka Team, Université de Poitiers, Laboratoire SIC
 *               http://www.sic.sp2mi.univ-poitiers.fr/
 * Copyright (C) 2009, Guillaume Damiand, CNRS, LIRIS,
 *               guillaume.damiand@liris.cnrs.fr, http://liris.cnrs.fr/
 *
 * This file is part of lib-gmapkernel
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */

//******************************************************************************
#include "g-map-generic.hh"
#include "alt-stdint.hh"
using namespace GMap3d;
//******************************************************************************
void CGMapGeneric::allocMemoryToDirectInfo(int AMarkNumber,
                       int ADirectInfoIndex,
                       int ABytes, TOrbit AOrbitUsed)
{
  assert(ABytes>0);

  if (AOrbitUsed==ORBIT_NONE)
    {
      for (CDynamicCoverageAll it(this); it.cont(); ++it)
    if (isMarked(*it, AMarkNumber))
      setDirectInfo(*it, ADirectInfoIndex, new uint8_t[ABytes]);
    }
  else
    {
      assert(isOrbitUsed(AOrbitUsed));
      int treated = getNewMark();

      for (CDynamicCoverageAll it(this); it.cont(); ++it)
    if (!isMarked(*it, treated))
      {
        if (isMarked(*it, AMarkNumber))
          {
        CDart * owner = getEmbeddingOwner(*it, AOrbitUsed);
        assert(owner!=NULL);

        setDirectInfo(owner, ADirectInfoIndex, new uint8_t[ABytes]);

        markOrbit(owner, AOrbitUsed, treated);
          }
        else
          setMark(*it, treated);
      }

      negateMaskMark(treated);
      freeMark(treated);
    }
}
//******************************************************************************
void CGMapGeneric::allocMemoryToDirectInfo(CDart * ADart, TOrbit AOrbit,
                       int ADirectInfoIndex,
                       int ABytes, TOrbit AOrbitUsed)
{
  assert(ADart!=NULL);

  int mark = getNewMark();

  markOrbit(ADart, AOrbit, mark);
  allocMemoryToDirectInfo(mark, ADirectInfoIndex, ABytes, AOrbitUsed);
  unmarkOrbit(ADart, AOrbit, mark);

  freeMark(mark);
}
//******************************************************************************
void CGMapGeneric::freeMemoryFromDirectInfo(int AMarkNumber,
                        int ADirectInfoIndex,
                        TOrbit AOrbitUsed)
{
  if (AOrbitUsed==ORBIT_NONE)
    {
      for (CDynamicCoverageAll it(this); it.cont(); ++it)
    if (isMarked(*it, AMarkNumber))
      delete (uint8_t *) getDirectInfo(*it, ADirectInfoIndex);
    }
  else
    {
      assert(isOrbitUsed(AOrbitUsed));
      int treated = getNewMark();

      for (CDynamicCoverageAll it(this); it.cont(); ++it)
    if (!isMarked(*it, treated))
      {
        if (isMarked(*it, AMarkNumber))
          {
        CDart * owner = getEmbeddingOwner(*it, AOrbitUsed);
        assert(owner!=NULL);

        delete (uint8_t *) getDirectInfo(owner, ADirectInfoIndex);

        markOrbit(owner, AOrbitUsed, treated);
          }
        else
          setMark(*it, treated);
      }

      negateMaskMark(treated);
      freeMark(treated);
    }
}
//******************************************************************************
void CGMapGeneric::freeMemoryFromDirectInfo(CDart * ADart, TOrbit AOrbit,
                        int ADirectInfoIndex,
                        TOrbit AOrbitUsed /*ORBIT_NONE*/)
{
  assert(ADart!=NULL);

  int mark = getNewMark();

  markOrbit(ADart, AOrbit, mark);
  freeMemoryFromDirectInfo(mark, ADirectInfoIndex, AOrbitUsed);
  unmarkOrbit(ADart, AOrbit, mark);

  freeMark(mark);
}
//******************************************************************************
void CGMapGeneric::saveAlphaInDirectInfo(int AAlphaIndex, int ADirectInfoIndex)
{
  assert(0 <= AAlphaIndex && AAlphaIndex <= 3);

  for (CDynamicCoverageAll it(this); it.cont(); ++it)
    setDirectInfo(*it, ADirectInfoIndex, alpha(*it, AAlphaIndex));
}
//******************************************************************************
void CGMapGeneric::initUnionFindTrees(int AIndex, TOrbit AOrbit)
{
  int treated = getNewMark();
  for (CDynamicCoverageAll it(this); it.cont(); ++it)
    {
      if ( !isMarked(*it,treated) )
    {
      CCoverage* it2 = getDynamicCoverage(*it,AOrbit);
      for ( ; it2->cont(); ++(*it2) )
        {
          setDirectInfo(**it2, AIndex, *it);
          setMark(**it2,treated);
        }
      delete it2;
    }
    }
  negateMaskMark(treated);
  freeMark(treated);
}
//******************************************************************************
void CGMapGeneric::initTwoUnionFindTrees(int AIndex1, TOrbit AOrbit1,
                     int AIndex2, TOrbit AOrbit2)
{
  assert(AIndex1!=AIndex2);
  
  int treated1 = getNewMark();
  int treated2 = getNewMark();
  for (CDynamicCoverageAll it(this); it.cont(); ++it)
    {
      if ( !isMarked(*it,treated1) )
    {
      CCoverage* it2 = getDynamicCoverage(*it,AOrbit1);
      for ( ; it2->cont(); ++(*it2) )
        {
          setDirectInfo(**it2, AIndex1, *it);
          setMark(**it2,treated1);
        }
      delete it2;
    }
      if ( !isMarked(*it,treated2) )
    {
      CCoverage* it2 = getDynamicCoverage(*it,AOrbit2);
      for ( ; it2->cont(); ++(*it2) )
        {
          setDirectInfo(**it2, AIndex2, *it);
          setMark(**it2,treated2);
        }
      delete it2;
    }
    }
  negateMaskMark(treated1);
  negateMaskMark(treated2);
  freeMark(treated1);
  freeMark(treated2);
}
//******************************************************************************
void CGMapGeneric::initUnionFindTreesFaceVolume(int AIndexFace, int AIndexVol)
{
  assert(AIndexFace!=AIndexVol);
  
  int treatedFace = getNewMark();
  int treatedVol = getNewMark();
  for (CDynamicCoverageAll it(this); it.cont(); ++it)
  {
    if ( !isMarked(*it,treatedFace) )
    {
      for (CDynamicCoverageFace it2(this,*it); it2.cont(); ++it2)
      {
        setDirectInfo(*it2, AIndexFace, *it);
        setMark(*it2,treatedFace);
      }
    }
    if ( !isMarked(*it,treatedVol) )
    {
      for (CBasicDynamicCoverageVolume it2(this, *it, treatedVol);
           it2.cont(); ++it2)
      {
        setDirectInfo(*it2, AIndexVol, *it);
        assert( isMarked(*it2, treatedVol) );
      }
    }
  }
  
  negateMaskMark(treatedFace);
  negateMaskMark(treatedVol);
  freeMark(treatedFace);
  freeMark(treatedVol);
}
//******************************************************************************
void CGMapGeneric::initUnionFindTreesVerticesEdges(int AIndexVertex,
                                                   int AIndexEdge)
{
  assert(AIndexVertex!=AIndexEdge);

  int treatedVertex = getNewMark();
  int treatedEdge = getNewMark();
  for (CDynamicCoverageAll it(this); it.cont(); ++it)
  {
    if ( !isMarked(*it,treatedVertex) )
    {
      for (CBasicDynamicCoverageVertex it2(this,*it,treatedVertex);
           it2.cont(); ++it2)
      {
        setDirectInfo(*it2, AIndexVertex, *it);
        assert( isMarked(*it2, treatedVertex) );
      }
    }
    if ( !isMarked(*it,treatedEdge) )
    {
      for (CDynamicCoverageEdge it2(this, *it); it2.cont(); ++it2)
      {
        setDirectInfo(*it2, AIndexEdge, *it);
        setMark(*it2,treatedEdge);
      }
    }
  }

  negateMaskMark(treatedVertex);
  negateMaskMark(treatedEdge);
  freeMark(treatedVertex);
  freeMark(treatedEdge);

}
//******************************************************************************
CDart* CGMapGeneric::findUnionFindTrees(CDart* ADart,int AIndex)
{
  CDart *res = ADart, *cur = ADart;
  
  while (getDirectInfo(res, AIndex)!=res)
    res = static_cast<CDart*>(getDirectInfo(res,AIndex));
  
  while (getDirectInfo(cur, AIndex)!=res)
    {
      ADart=static_cast<CDart*>(getDirectInfo(cur,AIndex));
      setDirectInfo(cur, AIndex, res);
      cur=ADart;
    }

  return res;
}
//******************************************************************************
void CGMapGeneric::mergeUnionFindTrees(CDart* ADart1,CDart* ADart2,int AIndex)
{
  CDart *root1 = findUnionFindTrees(ADart1,AIndex);
  CDart *root2 = findUnionFindTrees(ADart2,AIndex);
  
  if ( root1==root2 ) return;

  setDirectInfo(root1, AIndex, root2);  
}
//******************************************************************************