BlocPoint.cxx

Go to the documentation of this file.

// Copyright (C) 2015-2025  CEA, EDF
//
// This library 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 2.1 of the License, or (at your option) any later version.
//
// This library 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 library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA
//
// See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
//
 
#include "BlocPoint.hxx"
#include "Node.hxx"
#include "NotSimpleCasePoint.hxx"
 
#include <algorithm>
 
using namespace YACS::ENGINE;
 
BlocPoint::BlocPoint(const std::list<AbstractPoint *>& nodes, AbstractPoint *father):AbstractPoint(father),_nodes(nodes)
{
  for(std::list<AbstractPoint *>::const_iterator it=_nodes.begin();it!=_nodes.end();it++)
    (*it)->setFather(this);
}
 
void BlocPoint::deepCopyFrom(const BlocPoint& other)
{
  const std::list<AbstractPoint *>& nodesToIterateOn(other.getListOfPoints());
  for(auto it : nodesToIterateOn)
    {
      _nodes.push_back(it->deepCopy(this));
    }
}
 
void BlocPoint::getOutPoint(AbstractPoint *node)
{
  std::list<AbstractPoint *>::iterator it(std::find(_nodes.begin(),_nodes.end(),node));
  if(it==_nodes.end())
    throw YACS::Exception("BlocPoint::getOutPoint : node not in this !");
  _nodes.erase(it);
  node->setFather(NULL);
}
 
AbstractPoint *BlocPoint::findPointWithNode(Node *node)
{
  for(std::list<AbstractPoint *>::iterator it=_nodes.begin();it!=_nodes.end();it++)
    {
      AbstractPoint *ret((*it)->findPointWithNode(node));
      if(ret)
        return AbstractPoint::GetDirectSonOf(this,ret);
    }
  return 0;
}
 
AbstractPoint *BlocPoint::getNodeAfter(Node *node)
{
  OutGate *oug(node->getOutGate());
  std::list<InGate *> fl(oug->edSetInGate());
  if(fl.size()>=1)
    {
      AbstractPoint *ret(0);
      IsCommonDirectSonOf(this,fl,ret);
      return ret;
    }
  else
    return 0;
}
 
AbstractPoint *BlocPoint::getNodeB4(Node *node)
{
  InGate *ing(node->getInGate());
  std::list<OutGate *> bl(ing->getBackLinks());
  if(bl.size()>=1)
    {
      AbstractPoint *ret(0);
      IsCommonDirectSonOf(this,bl,ret);
      return ret;
    }
  else
    return 0;
}
 
bool BlocPoint::contains(Node *node) const
{
  for(auto it : _nodes)
    {
      if(it->contains(node))
        return true;
    }
  return false;
}
 
bool BlocPoint::anyOf(const std::set<Node *>& nodes) const
{
  for(auto it : nodes)
    {
      if(this->contains(it))
        return true;
    }
  return false;
}
 
AbstractPoint *BlocPoint::getUnique()
{
  if(_nodes.size()!=1)
    throw YACS::Exception("BlocPoint::getUnique : invalid call !");
  else
    {
      AbstractPoint *ret(*_nodes.begin());
      if(!ret)
        throw YACS::Exception("BlocPoint::getUnique : Ooops !");
      return ret;
    }
}
 
const AbstractPoint *BlocPoint::getUnique() const
{
  if(_nodes.size()!=1)
    throw YACS::Exception("BlocPoint::getUnique const : invalid call !");
  else
    {
      AbstractPoint *ret(*_nodes.begin());
      if(!ret)
        throw YACS::Exception("BlocPoint::getUnique : Ooops !");
      return ret;
    }
}
 
AbstractPoint *BlocPoint::getUniqueAndReleaseIt()
{
  AbstractPoint *ret(getUnique());
  getOutPoint(ret);
  return ret;
}
 
int BlocPoint::getNumberOfNodes() const
{
  int ret(0);
  for(std::list<AbstractPoint *>::const_iterator it=_nodes.begin();it!=_nodes.end();it++)
    ret+=(*it)->getNumberOfNodes();
  return ret;
}
 
BlocPoint::~BlocPoint()
{
  for(std::list<AbstractPoint *>::iterator it=_nodes.begin();it!=_nodes.end();it++)
    delete *it;
}
 
bool BlocPoint::internalContinueForSimplify() const
{
  std::size_t i(0);
  std::for_each(_nodes.begin(),_nodes.end(),[&i](AbstractPoint *elt) { if(!dynamic_cast<NotSimpleCasePoint *>(elt)) i++; });
  return i>1;
}
 
bool BlocPoint::presenceOfNonSimpleCase() const
{
  std::size_t i(0);
  std::for_each(_nodes.begin(),_nodes.end(),[&i](AbstractPoint *elt) { if(dynamic_cast<NotSimpleCasePoint *>(elt)) i++; });
  return i>0;
}