#include "inmost.h"
#include "incident_matrix.hpp"
#include <queue>
#if defined(USE_MESH)

//TODO:
// incident_matrix class should measure for minimal volume,
// possibly check and update from projects/OctreeCutcell/octgrid.cpp
#if defined(USE_PARALLEL_WRITE_TIME)
#define REPORT_MPI(x) {WriteTab(out_time) << "<MPI><![CDATA[" << #x << "]]></MPI>" << std::endl; x;}
#define REPORT_STR(x) {WriteTab(out_time) << "<TEXT><![CDATA[" << x << "]]></TEXT>" << std::endl;}
#define REPORT_VAL(str,x) {WriteTab(out_time) << "<VALUE name=\"" << str << "\"> <CONTENT><![CDATA[" << x << "]]></CONTENT> <CODE><![CDATA[" << #x << "]]></CODE></VALUE>" << std::endl;}
#define ENTER_FUNC() double all_time = Timer(); {WriteTab(out_time) << "<FUNCTION name=\"" << __FUNCTION__ << "\" id=\"func" << func_id++ << "\">" << std::endl; Enter();}
#define EXIT_FUNC() {WriteTab(out_time) << "<TIME>" << Timer() - all_time << "</TIME>" << std::endl; Exit(); WriteTab(out_time) << "</FUNCTION>" << std::endl;}
#define EXIT_FUNC_DIE() {WriteTab(out_time) << "<TIME>" << -1 << "</TIME>" << std::endl; Exit(); WriteTab(out_time) << "</FUNCTION>" << std::endl;}
#else
#define REPORT_MPI(x) x
#define REPORT_STR(x) {}
#define REPORT_VAL(str,x) {}
#define ENTER_FUNC() {}
#define EXIT_FUNC() {}
#define EXIT_FUNC_DIE()  {}
#endif


namespace INMOST
{

	


	
	
	void Element::Disconnect(bool del_upper) const
	{
		
		dynarray<adj_type::size_type,64> del;
		Mesh * m = GetMeshLink();
		//BEGIN NEW CODE - CHECK
		//Reorder face edges, so that they always apear in right direction
		if( GetElementType() == CELL ) //This is a cell
		{
			getAsCell()->SwapBackCell();
			/*
			MarkerType hm = m->HideMarker();
			adj_type & lc = m->LowConn(GetHandle());
			for( adj_type::size_type it = 0; it < lc.size(); it++) //if( !m->GetMarker(lc[it],hm) ) //iterator over unhidden faces
			{
				adj_type & hc = m->HighConn(lc[it]);
				if( !hc.empty() && m->Count(hc.data(),static_cast<enumerator>(hc.size()),hm) == 2 ) //there are two cells connected to face
				{
					enumerator k1 = ENUMUNDEF, k2;
					k1 = m->getNext(hc.data(),static_cast<enumerator>(hc.size()),k1,hm);
					if( hc[k1] == GetHandle() ) //the first cell is current
					{
						k2 = m->getNext(hc.data(),static_cast<enumerator>(hc.size()),k1,hm);
						hc[k1] = hc[k2];
						//hc[k2] = GetHandle(); //cannot use the cell because virtualization table is already destroyed and FixNormalOrientation will do bad things
						hc.resize(1); //just remove element, we will do this anyway later
						Face(m,lc[it])->FixNormalOrientation(); //restore orientation
					}
				}
			}
			*/
		}
		//END NEW CODE - CHECK
		adj_type & hc = m->HighConn(GetHandle());
		adj_type::size_type i = 0;
		for( adj_type::size_type it = 0; it < hc.size(); it++)
		{
			int flag = 0;
			adj_type & ilc = m->LowConn(hc[it]);
			adj_type::iterator jt = ilc.begin();
			while (jt != ilc.end())
			{
				if(*jt == GetHandle())
				{
					flag = 1;
					jt = ilc.erase(jt);
				}
				else ++jt;
			}
			if( flag ) del.push_back(i);
			i++;
		}
		if( del_upper )
		{
			if( GetElementType() < CELL ) 
			{
				if( Hidden() ) 
				{
					for(dynarray<adj_type::size_type,64>::iterator it = del.begin(); it != del.end(); it++)
						if( m->GetMarker(hc[*it],m->HideMarker()) ) m->Delete(hc[*it]);
				}
				else 
				{
					for(dynarray<adj_type::size_type,64>::iterator it = del.begin(); it != del.end(); it++)
						m->Delete(hc[*it]);
				}
			}
		}
		hc.clear();
		adj_type & lc = m->LowConn(GetHandle());
		for(adj_type::size_type it = 0; it < lc.size(); it++)
		{
			adj_type & ihc = m->HighConn(lc[it]);
			adj_type::iterator jt = ihc.begin();
			while (jt != ihc.end())
			{
				if(*jt == GetHandle()) jt = ihc.erase(jt);
				else ++jt;
			}
		}
		lc.clear();
	}
	
	Cell Cell::UniteCells(const ElementArray<Cell> & unite, MarkerType del_protect)
	{
		Mesh * m = unite.GetMeshLink();
		if( unite.empty() ) return Cell(m,InvalidHandle());
		tiny_map<HandleType, int, 64> face_visit; // we check all edges of faces, inner edges are visited several times, outer - once
		ElementArray<Face> faces(m); 
		dynarray<HandleType,64> inner_faces;
		bool doexit = false;
		MarkerType hm = m->HideMarker();
		//Compute which faces of the provided cells lay on boundary (1 visit) and
		//inside of the set of cells (2 visits)
		for(ElementArray<Cell>::size_type j = 0; j < unite.size(); j++)
		{
			if( unite[j]->GetMarker(del_protect) ) doexit = true;
			//access faces
			adj_type const & lc = m->LowConn(unite.at(j));
			for(adj_type::size_type it = 0; it < lc.size(); it++)
				if( !m->GetMarker(lc[it],hm) ) face_visit[lc[it]]++;
		}
		if( doexit ) return Cell(m,InvalidHandle());
		MarkerType visited = m->CreateMarker(), rem = m->CreateMarker();
		dynarray<HandleType,64> edges;
		dynarray<HandleType,64> nodes;
		//gather boundary faces into set that will be used to create new cell
		//mark internal faces to be deleted. For internal faces find out
		//all internal edges that should be deleted as well.
		for(tiny_map<HandleType,int,64>::iterator it = face_visit.begin(); it != face_visit.end(); it++)
		{
			if( it->second == 1 ) //boundary faces, use for new cell
				faces.push_back(it->first);
			else //internal faces
			{
				if( m->GetMarker(it->first,del_protect) ) doexit = true;
				//mark face to be deleted
				m->SetMarker(it->first,rem);
				//access edges of the face, gather into array
				adj_type const & lc = m->LowConn(it->first);
				for(adj_type::size_type jt = 0; jt < lc.size(); jt++) if( !m->GetMarker(lc[jt],hm) )
					if( !m->GetMarker(lc[jt],visited) )
					{
						m->SetMarker(lc[jt],visited);
						edges.push_back(lc[jt]);
					}
				//gather internal faces
				inner_faces.push_back(it->first);
			}
		}
		//for edges of internal faces gather their nodes,
		//for each edge check if all it's faces are to be deleted,
		//then the edge should be deleted, otherwise keep the edge
		for(dynarray<HandleType,64>::size_type i = 0; i < edges.size(); i++) 
		{
			m->RemMarker(edges[i],visited);
			//access nodes of the edge, gather into array
			adj_type const & lc = m->LowConn(edges[i]);
			for(adj_type::size_type jt = 0; jt < lc.size(); jt++) if( !m->GetMarker(lc[jt],hm) )
			{
				if( !m->GetMarker(lc[jt],visited) )
				{
					m->SetMarker(lc[jt],visited);
					nodes.push_back(lc[jt]);
				}
			}
			//access faces of the edge, check is there any
			//face that would not be deleted
			int nonzero = 0;
			adj_type const & hc = m->HighConn(edges[i]);
			for(adj_type::size_type jt = 0; jt < hc.size(); jt++) if( !m->GetMarker(hc[jt],hm) )//iterate over faces
				if( !m->GetMarker(hc[jt],rem) ) nonzero++; // check if it is not deleted
			if( nonzero == 0 ) //all faces should be deleted, edge to remove
			{
				//mark edge to be deleted
				m->SetMarker(edges[i],rem);
				if( m->GetMarker(edges[i],del_protect) ) doexit = true;
			}
		}
		//for nodes of internal faces check is there any edges
		//that should not be deleted
		for(dynarray<HandleType,64>::size_type i = 0; i < nodes.size(); i++) 
		{
			m->RemMarker(nodes[i],visited);
			int nonzero = 0;
			//acces edges of the node, check is there any
			//edge that would not be deleted
			adj_type const & hc = m->HighConn(nodes[i]);
			for(adj_type::size_type jt = 0; jt < hc.size(); jt++) if( !m->GetMarker(hc[jt],hm) )
				if( !m->GetMarker(hc[jt],rem) ) nonzero++;
			if( nonzero == 0 ) //all edges should be deleted, node to remove
			{
				//mark node to be deleted
				m->SetMarker(nodes[i],rem);
				if( m->GetMarker(nodes[i],del_protect) ) doexit = true;
			}
		}
		m->ReleaseMarker(visited);
		if( doexit )
		{
			m->RemMarkerArray(inner_faces.data(),(enumerator)inner_faces.size(),rem);
			m->RemMarkerArray(edges.data(), (enumerator)edges.size(), rem);
			m->RemMarkerArray(nodes.data(), (enumerator)nodes.size(), rem);
			m->ReleaseMarker(rem);
			return Cell(m,InvalidHandle());
		}
		//delete cells
		for(ElementArray<Cell>::size_type j = 0; j < unite.size(); j++)
		{
			if( m->GetMarker(unite.at(j),del_protect) )
				std::cout << __FUNCTION__ << " deleted protected cells, united " << unite.size() << " cells " << std::endl;
			if( m->HideMarker() )
				m->Hide(unite.at(j));
			else
				m->Delete(unite.at(j));
		}
		//delete inner faces
		for(dynarray<HandleType,64>::size_type j = 0; j < inner_faces.size(); j++)
		{
			//std::cout << "delete face " << GetHandleID(inner_faces[j]) << std::endl;
			if( m->GetMarker(inner_faces[j],rem) )
			{
				m->RemMarker(inner_faces[j],rem);
				if( m->GetMarker(inner_faces[j],del_protect) )
					std::cout << __FUNCTION__ << " deleted protected faces, united " << unite.size() << " cells " << std::endl;
				if( m->HideMarker() )
					m->Hide(inner_faces[j]);
				else
					m->Delete(inner_faces[j]);
			}
		}
		//delete unused edges
		for(dynarray<HandleType,64>::size_type j = 0; j < edges.size(); j++)
		{
			if( m->GetMarker(edges[j],rem) )
			{
				m->RemMarker(edges[j],rem);
				if( m->GetMarker(edges[j],del_protect) )
					std::cout << __FUNCTION__ << " deleted protected edge, united " << unite.size() << " cells " << std::endl;
				if( m->HideMarker() )
					m->Hide(edges[j]);
				else
					m->Delete(edges[j]);
			}
		}
		//delete unused nodes
		for(dynarray<HandleType,64>::size_type j = 0; j < nodes.size(); j++)
		{

			if( m->GetMarker(nodes[j],rem) ) //there are no edges that use this edge
			{
				m->RemMarker(nodes[j],rem);
				// there must be no cells that use this node
				assert( m->LowConn(nodes[j]).empty() || m->Count(m->LowConn(nodes[j]).data(),static_cast<integer>(m->LowConn(nodes[j]).size()),hm) == 0 );
				if( m->GetMarker(nodes[j],del_protect) )
					std::cout << __FUNCTION__ << " deleted protected node, united " << unite.size() << " cells " << std::endl;
				if( m->HideMarker() )
					m->Hide(nodes[j]);
				else
					m->Delete(nodes[j]);
				//disconnect node from cell
				//we don't need this algorithm, because all dependent cells should be deleted
				//if( !nodes[j]->Hide() )
				//{					
					//adj_iterator it = nodes[j]->LowConn().begin();
					//while(it != nodes[j]->LowConn().end()) if( !(*it)->GetMarker(hm) ) //iterate through cells of the node
					//{
					//	adj_iterator jt =(*it)->HighConn().begin();
					//	while(jt != (*it)->HighConn().end() ) if( !(*jt)->GetMarker(hm) ) // iterate through nodes of the cell
					//	{
					//		if( *jt == nodes[j] )
					//			jt = (*it)->HighConn().erase(jt); //erase link to node
					//		else ++jt;
					//	}
					//  ++it;
					//}
					//nodes[j]->Disconnect();
					//nodes[j]->Delete();
				//}
			}
		}
		m->ReleaseMarker(rem);
		//reconstruct cell by outer faces
		return m->CreateCell(faces).first;
	}
	
	
	bool Cell::TestUniteCells(const ElementArray<Cell> & unite, MarkerType del_protect)
	{
		if( unite.empty() ) return false;
		Mesh * m = unite.GetMeshLink();
		tiny_map<HandleType,int,64> face_visit; // we check all edges of faces, inner edges are visited several times, outer - once
		bool doexit = false;
		MarkerType hm = m->HideMarker();			
		for(ElementArray<Cell>::size_type j = 0; j < unite.size(); j++)
		{
			if( m->GetMarker(unite.at(j),del_protect) ) doexit = true; 
			adj_type const & lc = m->LowConn(unite.at(j));
			for(adj_type::size_type it = 0; it < lc.size(); it++) if( !m->GetMarker(lc[it],hm) )
				face_visit[lc[it]]++;
		}
		if( doexit ) return false;
		MarkerType rem = m->CreateMarker();
		dynarray<HandleType,64> edges;
		dynarray<HandleType,64> nodes;		
		for(tiny_map<HandleType,int,64>::iterator it = face_visit.begin(); it != face_visit.end(); it++)
		{
			if( it->second != 1 )
			{
				if( m->GetMarker(it->first,del_protect) ) doexit = true;
				m->SetMarker(it->first,rem);
				adj_type const & lc = m->LowConn(it->first);
				for(adj_type::size_type jt = 0; jt < lc.size(); jt++) if( !m->GetMarker(lc[jt],hm) )
					if( !m->GetMarker(lc[jt],rem) )
					{
						m->SetMarker(lc[jt],rem);
						edges.push_back(lc[jt]);
					}
			}
		}
		for(dynarray<HandleType,64>::size_type i = 0; i < edges.size(); i++) 
		{
			m->RemMarker(edges[i],rem);
			adj_type const & lc = m->LowConn(edges[i]);
			for(adj_type::size_type jt = 0; jt < lc.size(); jt++) if( !m->GetMarker(lc[jt],hm) )
			{
				if( !m->GetMarker(lc[jt],rem) )
				{
					m->SetMarker(lc[jt],rem);
					nodes.push_back(lc[jt]);
				}
			}
			int nonzero = 0;
			//access faces of the edge, check is there any
			//that would not be deleted
			adj_type const & hc = m->HighConn(edges[i]);
			for(adj_type::size_type jt = 0; jt < hc.size(); jt++) if( !m->GetMarker(hc[jt],hm) ) //iterate over faces
				if( !m->GetMarker(hc[jt],rem) ) nonzero++; // check if it is not deleted
			//all faces should be deleted, edge to remove
			if( nonzero == 0 && m->GetMarker(edges[i],del_protect) )
				doexit = true;
		}
		for(dynarray<HandleType,64>::size_type i = 0; i < nodes.size(); i++) 
		{
			int nonzero = 0;
			//access edges of the node, check is there
			//any that would not be deleted
			adj_type const & hc = m->HighConn(nodes[i]);
			for(adj_type::size_type jt = 0; jt < hc.size(); jt++) if( !m->GetMarker(hc[jt],hm) )
				if( !m->GetMarker(hc[jt],rem) ) nonzero++;
			//all edges should be deleted, node to remove
			if( nonzero == 0 && m->GetMarker(edges[i],del_protect) )
				doexit = true;
		}
		for(tiny_map<HandleType,int,64>::iterator it = face_visit.begin(); it != face_visit.end(); it++) m->RemMarker(it->first,rem);
		m->RemMarkerArray(edges.data(), (enumerator)edges.size(),rem);
		m->RemMarkerArray(nodes.data(), (enumerator)nodes.size(), rem);
		m->ReleaseMarker(rem);
		if( doexit ) return false;
		return true;
	}
	
	
	Face Face::UniteFaces(const ElementArray<Face> & unite, MarkerType del_protect)
	{
		Mesh * m = const_cast<Mesh *>(unite.GetMeshLink());
		assert(m != NULL);
		if( unite.empty() ) return Face(m,InvalidHandle());
		MarkerType hm = m->HideMarker();
		bool doexit = false, dothrow = false;
		for(ElementArray<Face>::size_type j = 0; j < unite.size(); j++)
			if( m->GetMarker(unite.at(j),del_protect) ) doexit = true;
		if( doexit ) return Face(m,InvalidHandle());
		dynarray<HandleType,64> cells;
		MarkerType edge_set = m->CreateMarker();
		MarkerType rem = m->CreateMarker();
		
		//gather cells adjacent to united faces
		for(ElementArray<Face>::size_type j = 0; j < unite.size(); j++)
		{
			adj_type const & hc = m->HighConn(unite.at(j));
			for(adj_type::size_type it = 0; it < hc.size(); it++) if( !m->GetMarker(hc[it],hm) )
			{
				if( !m->GetMarker(hc[it],edge_set) )
				{
					cells.push_back(hc[it]);
					m->SetMarker(hc[it],edge_set);
				}
			}
		}
		m->RemMarkerArray(cells.data(), (enumerator)cells.size(), edge_set);
		assert(cells.size() <= 2);
		//check is there a topological problem
		//new face should be adjacent to no more then two cells
		if( m->GetTopologyCheck(TRIPLE_SHARED_FACE) && cells.size() > 2 )
		{
			m->SetTopologyError(TRIPLE_SHARED_FACE);
			if( m->GetTopologyCheck(PRINT_NOTIFY) ) std::cerr << TopologyCheckNotifyString(TRIPLE_SHARED_FACE) << std::endl;
			if( m->GetTopologyCheck(THROW_EXCEPTION) ) throw TopologyCheckError;
		}
		
		dynarray<HandleType,64> nodes;
		tiny_map<HandleType, int,64> edge_visit;
		ElementArray<Edge> edges(m);
		//compute how many times each edge is visited
		for(ElementArray<Face>::size_type j = 0; j < unite.size(); j++)
		{
			//access edges of the face
			adj_type const & lc = m->LowConn(unite.at(j));
			for(adj_type::size_type it = 0; it < lc.size(); it++)
				if( !m->GetMarker(lc[it],hm) ) edge_visit[lc[it]]++;
		}
		HandleType first = InvalidHandle(); //first edge
		HandleType prev = InvalidHandle(); //prev node
		//Mark all the edges on boundary to recreate the face,
		//assemble set of nodes
		int expect_q = 0; //used to test for consistency of the loop of edges
		for(tiny_map<HandleType,int,64>::iterator it = edge_visit.begin(); it != edge_visit.end(); it++)
		{
			if( it->second == 1 )
			{
				expect_q++;
				m->SetMarker(it->first,edge_set);
				if( first == InvalidHandle() ) first = it->first;
			}
			else if( it->second == 2 )
			{
				//edge is protected
				if( m->GetMarker(it->first,del_protect) ) doexit = true;
				//mark edge to be deleted
				m->SetMarker(it->first,rem);
				//access nodes of the edge
				adj_type const & lc = m->LowConn(it->first);
				for(adj_type::size_type jt = 0; jt < lc.size(); jt++) if( !m->GetMarker(lc[jt],hm) )
				{
					if( !m->GetMarker(lc[jt],edge_set) )
					{
						m->SetMarker(lc[jt],edge_set);
						nodes.push_back(lc[jt]);
					}
				}
			}
			else 
			{
				doexit = true; //the faces we unite would not appear as one surface
				dothrow = true;
			}
		}
		//Find out set of nodes to be deleted
		for(dynarray<HandleType,64>::size_type j = 0; j < nodes.size(); j++) 
		{
			m->RemMarker(nodes[j],edge_set);
			int nonzero = 0;
			//access edges of the nodes, find out whether all
			//of them are deleted
			adj_type const & hc = m->HighConn(nodes[j]);
			for(adj_type::size_type it = 0; it < hc.size(); it++) if( !m->GetMarker(hc[it],hm) ) //iterate through edges of the node
				if( !m->GetMarker(hc[it],rem) ) nonzero++; // check if edge should not be deleted
			if( nonzero == 0 ) //all edges are deleted but the node is protected
			{
				m->SetMarker(nodes[j],rem);
				if( m->GetMarker(nodes[j],del_protect) ) doexit = true;
			}
		}
			
		if( doexit )
		{
			for(tiny_map<HandleType,int,64>::iterator it = edge_visit.begin(); it != edge_visit.end(); it++)
			{
				m->RemMarker(it->first,rem);
				m->RemMarker(it->first,edge_set);
			}
			m->RemMarkerArray(nodes.data(), (enumerator)nodes.size(), rem);
			m->ReleaseMarker(edge_set);
			m->ReleaseMarker(rem);
			assert( !dothrow ); //report the situation, because user need to debug the input
			return Face(m,InvalidHandle());
		}
		//Order edges on the boundary of united faces into loop
		edges.push_back(first);
		edges.back()->RemMarker(edge_set);
		bool done = false;
		int q = 1;
		while( !done )
		{
			enumerator k1 = ENUMUNDEF,k2;
			//access nodes of the last pushed edge
			adj_type const & lc = m->LowConn(edges.atback());
			//find out first node
			k1 = m->getNext(lc.data(),static_cast<enumerator>(lc.size()),k1,hm);
			//find out second node
			k2 = m->getNext(lc.data(),static_cast<enumerator>(lc.size()),k1,hm);
			//find out which of the nodes should connect to the next edge
			//at the begining we can select any of the two
			if( lc[k1] != prev ) 
				prev = lc[k1]; 
			else 
				prev = lc[k2];
			//find out the next edge connected to the privious node
			bool found = false; //detect that edge was found, otherwise there is no loop
			adj_type const & hc = m->HighConn(prev);
			for(adj_type::size_type it = 0; it < hc.size(); ++it) if( !m->GetMarker(hc[it],hm) )
			{
				//we came back to the first edge, the loop is closed
				if( hc[it] == first && q != 1)
				{
					found = done = true;
					break;
				}
				if( m->GetMarker(hc[it],edge_set) )
				{
					q++;
					found = true;
					edges.push_back(hc[it]);
					m->RemMarker(hc[it],edge_set);
					break;
				}
			}
			assert(found); //there is no loop
			//if( !found ) throw Failure;
		}
		m->ReleaseMarker(edge_set);
		
		//number of edges collected matches number of edges expected
		assert(expect_q == q);
		

		
		
		if( !m->HideMarker() ) //we can't hide elements
		{
			unite.SetMarker(rem);
			//untie every face from the cell
			for(dynarray<HandleType,64>::size_type it = 0; it < cells.size(); it++)
			{
				adj_type & lc = m->LowConn(cells[it]);
				adj_type::iterator jt = lc.begin();
				while( jt != lc.end()) //don't need to check is it hidden
					if( m->GetMarker(*jt,rem) )
						jt = lc.erase(jt);
					else jt++;
			}
			unite.RemMarker(rem);
		}
		
		//delete old faces
		if( m->HideMarker() )
			for(ElementArray<Face>::size_type j = 0; j < unite.size(); j++)
				m->Hide(unite.at(j));
		else
		{
			// delete all faces
			for(ElementArray<Face>::size_type j = 0; j < unite.size(); j++)
			{
				//untie cells from face
				m->HighConn(unite.at(j)).clear();
				if( m->GetMarker(unite.at(j),del_protect) )
					std::cout << __FUNCTION__ << " deleted protected face, united " << unite.size() << " faces " << std::endl;
				m->Delete(unite.at(j)); 
			}
		}

		for(tiny_map<HandleType,int,64>::iterator it = edge_visit.begin(); it != edge_visit.end(); it++)
			if( it->second != 1 )
			{
				m->RemMarker(it->first,rem);
				assert( m->HighConn(it->first).empty() || m->Count(m->HighConn(it->first).data(),static_cast<integer>(m->HighConn(it->first).size()),hm) == 0 ); //it's connected to face somewhere
				if( m->GetMarker(it->first,del_protect) )
					std::cout << __FUNCTION__ << " deleted protected edge, united " << unite.size() << " faces " << std::endl;
				if( m->HideMarker() )
					m->Hide(it->first);
				else
					m->Delete(it->first);
			}
			
		

		for(dynarray<HandleType,64>::size_type it = 0; it < nodes.size(); it++) //delete nodes inside the face
		{
			//adj_type const & hc = m->HighConn(nodes[it]);
			if( m->GetMarker(nodes[it],rem) )
			{
				assert( m->HighConn(nodes[it]).empty() || m->Count(m->HighConn(nodes[it]).data(),static_cast<integer>(m->HighConn(nodes[it]).size()),hm) == 0 );
				m->RemMarker(nodes[it],rem);
				if( !m->HideMarker() )
				{
					adj_type & lc = m->LowConn(nodes[it]);
					adj_type::iterator jt = lc.begin();
					while(jt != lc.end() ) // iterate through cells of the node
					{
						adj_type & ihc = m->HighConn(*jt);
						adj_type::iterator qt = ihc.begin(); //iterate through nodes of the cell
						while( qt != ihc.end() )
						{
							if( *qt == nodes[it] ) 
								qt = ihc.erase(qt); //remove links from the cell to the node
							else ++qt;
						}
						++jt;
					}
					lc.clear(); // remove links to cells
					if( m->GetMarker(nodes[it],del_protect) )
						std::cout << __FUNCTION__ << " deleted protected node, united " << unite.size() << " faces " << std::endl;
					m->Destroy(nodes[it]);
				}
				else m->Hide(nodes[it]);
			}
		}
		
		m->ReleaseMarker(rem);
				
		Face ret = m->CreateFace(edges).first;
		
		
		assert( ret->GetGeometricType() != MultiLine );
		
		
		adj_type & hc = m->HighConn(ret->GetHandle());
		for(dynarray<HandleType,64>::size_type it = 0; it < cells.size(); it++)  //tie new face to old cells
		{
			hc.push_back(cells[it]); // connect new face to cells
			m->LowConn(cells[it]).push_back(ret.GetHandle()); // connect cells to new face
			
		}
		
		
		for(dynarray<HandleType,64>::size_type it = 0; it < cells.size(); it++)  //tie new face to old cells
		{
			assert(m->Count(m->LowConn(cells[it]).data(),m->LowConn(cells[it]).size(),hm) >= 4);
			//compute geometric data
			m->ComputeGeometricType(cells[it]);
			assert(m->GetGeometricType(cells[it]) != MultiPolygon);
			//change nodes of the cell according to ordering
			ElementArray<Node> nodes(m);
			m->RestoreCellNodes(cells[it],nodes);
			adj_type & hc = m->HighConn(cells[it]);
			assert(nodes.size() == m->Count(hc.data(),hc.size(),hm));
			//should keep hidden nodes of the cell
			//todo: think about how we should order them
			for(adj_type::size_type k = 0; k < hc.size(); ++k)
				if( m->Hidden(hc[k]) ) nodes.push_back(hc[k]);
			hc.replace(hc.begin(),hc.end(),nodes.begin(),nodes.end());
			//recompute geometric data
			m->RecomputeGeometricData(cells[it]);
		}
		
		return ret;
	}
	
	
	bool Face::TestUniteFaces(const ElementArray<Face> & unite, MarkerType del_protect)
	{
		Mesh * m = const_cast<Mesh *>(unite.GetMeshLink());
		if( unite.size() == 0 ) return false;
		bool doexit = false, dothrow = false;
		for(ElementArray<Face>::size_type j = 0; j < unite.size(); j++)
			if( m->GetMarker(unite.at(j),del_protect) ) doexit = true;
		MarkerType hm = m->HideMarker();
		if( doexit ) return false;
		dynarray<HandleType,64> cells;
		MarkerType rem = m->CreateMarker();
		for(ElementArray<Face>::size_type j = 0; j < unite.size(); j++)
		{
			adj_type const & hc = m->HighConn(unite.at(j));
			for(adj_type::size_type it = 0; it < hc.size(); it++) if( !m->GetMarker(hc[it],hm) )
				if( !m->GetMarker(hc[it],rem) )
				{
					cells.push_back(hc[it]);
					m->SetMarker(hc[it],rem);
				}
		}
		m->RemMarkerArray(cells.data(), (enumerator)cells.size(), rem);
		dynarray<HandleType,64> nodes;
		tiny_map<HandleType, int,64> edge_visit;
		for(ElementArray<Face>::size_type j = 0; j < unite.size(); j++)
		{
			adj_type const & lc = m->LowConn(unite.at(j));
			for(adj_type::size_type it = 0; it < lc.size(); it++) if( !m->GetMarker(lc[it],hm) )
				edge_visit[lc[it]]++;
		}
		for(tiny_map<HandleType,int,64>::iterator it = edge_visit.begin(); it != edge_visit.end(); it++)
		{
			if( it->second == 2 )
			{
				if( m->GetMarker(it->first,del_protect) ) doexit = true; // edge is protected
				m->SetMarker(it->first,rem);
				adj_type const & lc = m->LowConn(it->first);
				for(adj_type::size_type jt = 0; jt < lc.size(); jt++) if( !m->GetMarker(lc[jt],hm) )
				{
					if( !m->GetMarker(lc[jt],rem) )
					{
						m->SetMarker(lc[jt],rem);
						nodes.push_back(lc[jt]);
					}
				}
			}
			else if( it->second != 1 )
			{
				doexit = true;
				dothrow = true;
			}
		}
		for(dynarray<HandleType,64>::size_type j = 0; j < nodes.size(); j++) 
		{
			m->RemMarker(nodes[j],rem);
			int nonzero = 0;
			adj_type const & hc = m->HighConn(nodes[j]);
			for(adj_type::size_type it = 0; it < hc.size(); it++) if( !m->GetMarker(hc[it],hm) )//iterate through edges of the node
				if( !m->GetMarker(hc[it],rem) ) nonzero++; // check if edge should not be deleted
			//all edges are deleted but the node is protected
			if( nonzero == 0 && m->GetMarker(nodes[j],del_protect)) doexit = true;
		}
		for(tiny_map<HandleType,int,64>::iterator it = edge_visit.begin(); it != edge_visit.end(); it++)
			if( it->second != 1 ) m->RemMarker(it->first,rem);
		m->ReleaseMarker(rem);
		if( doexit )
		{
			assert(!dothrow);
			//if( dothrow ) throw Impossible; //something went the way it shouldn't, possibly bad input
			return false;
		}
		return true;
	}

	Edge Edge::UniteEdges(const ElementArray<Edge> & edges, MarkerType del_protect)
	{
		Mesh * m = const_cast<Mesh *>(edges.GetMeshLink());
		if( edges.size() == 0 ) return Edge(m,InvalidHandle());
		
		bool doexit = false, dothrow = false;
		MarkerType hm = m->HideMarker();
		MarkerType rem = m->CreateMarker();
		dynarray<HandleType,64> cells;
		dynarray<HandleType,64> faces;
		tiny_map<HandleType,int,64> nodes;
		ElementArray<Node> build_nodes(m);
		for(ElementArray<Edge>::size_type it = 0; it < edges.size(); ++it)
		{
			if( m->GetMarker(edges.at(it),del_protect) )
				doexit = true;
			adj_type const & hc = m->HighConn(edges.at(it));
			for(adj_type::size_type jt = 0; jt != hc.size(); ++jt) if( !m->GetMarker(hc[jt],hm) )
			{
				if( !m->GetMarker(hc[jt],rem) )
				{
					faces.push_back(hc[jt]);
					m->SetMarker(hc[jt],rem);
				}
			}
			adj_type const & lc = m->LowConn(edges.at(it));
			for(adj_type::size_type jt = 0; jt < lc.size(); ++jt) if( !m->GetMarker(lc[jt],hm) )
				nodes[lc[jt]]++;
		}
		
		for(dynarray<HandleType,64>::size_type it = 0; it < faces.size(); ++it)
		{
			m->RemMarker(faces[it],rem);
			adj_type const & hc = m->HighConn(faces[it]);
			for(adj_type::size_type jt = 0; jt < hc.size(); ++jt)
			{
				if( !m->GetMarker(hc[jt],rem) )
				{
					m->SetMarker(hc[jt],rem);
					cells.push_back(hc[jt]);
				}
			}
		}
		
		m->RemMarkerArray(cells.data(), (enumerator)cells.size(), rem);
		
		

		if( doexit )
		{
			m->ReleaseMarker(rem);
			return Edge(m,InvalidHandle());
		}
		
		for(tiny_map<HandleType,int,64>::iterator it = nodes.begin(); it != nodes.end(); it++)
		{
			
			if( it->second == 1 )
				build_nodes.push_back(it->first);
			else if( it->second == 2 )
			{
				if( m->GetMarker(it->first,del_protect) )
					doexit = true;
			}
			else 
			{
				doexit = true; //edges have some loop
				dothrow = true;
			}
		}
		
		
		assert(build_nodes.size() == 2);

		if( doexit )
		{
			m->ReleaseMarker(rem);
			assert(!dothrow);
			//if( dothrow ) throw Impossible; // bad input
			return Edge(m,InvalidHandle());
		}


		dynarray<adj_type::size_type,64> insert_pos; //position where we insert new edge

		for(ElementArray<Edge>::size_type it = 0; it < edges.size(); ++it)
			m->SetMarker(edges.at(it),rem);

		for(dynarray<HandleType,64>::size_type it = 0; it < faces.size(); ++it)
		{
			adj_type const & lc = m->LowConn(faces[it]); //edges of face
			bool found_rem = false;
			for(adj_type::size_type k = 0; k < lc.size(); k++) //insert new edge to the first position where we delete old edge
			{
				if( m->GetMarker(lc[k],rem) )
				{
					//all united edges should appear in consecutive order in deleted face
					/*
					adj_type::size_type sum = 0, j = k;
					while( j < lc.size() && !m->GetMarker(lc[j],hm) && m->GetMarker(lc[j],rem) )
					{
						sum++; j++;
					}
					if( sum != static_cast<adj_type::size_type>(edges.size()) ) //not all edges belong to current face - face will be broken!
					{
						doexit = true;
						dothrow = true;
					}
					 */
					insert_pos.push_back(k);
					found_rem = true;
					break;
				}
			}
			if( !found_rem )
			{
				doexit = true;
				dothrow = true;
			}
		}

		if( doexit )
		{
			m->RemMarkerArray(edges.data(), (enumerator)edges.size(), rem);
			m->ReleaseMarker(rem);
			assert(!dothrow);
			//if( dothrow ) throw Impossible; // bad input
			return Edge(m,InvalidHandle());
		}

		if( !m->HideMarker() ) //disconnect if cannot hide
		{
			for(dynarray<HandleType,64>::size_type it = 0; it < faces.size(); ++it)
			{
				adj_type & lc = m->LowConn(faces[it]);
				adj_iterator jt = lc.begin(); //iterate over edges of faces
				while( jt != lc.end())
				{
					if( m->GetMarker(*jt,rem) )
						jt = lc.erase(jt);
					else ++jt;
				}
			}
		}


		for(ElementArray<Edge>::size_type it = 0; it < edges.size(); ++it)//delete edges
		{
			m->RemMarker(edges.at(it),rem);
			if( !m->Hide(edges.at(it)) ) //cannot hide
			{
				m->HighConn(edges.at(it)).clear(); //remove connection from edge to faces
				m->Destroy(edges.at(it));
			}
		}

		m->ReleaseMarker(rem);

		for(tiny_map<HandleType,int,64>::iterator it = nodes.begin(); it != nodes.end(); it++)
		{
			if( it->second != 1 )
			{
				if( !m->Hide(it->first) ) //cannot hide, we have to untie cells from nodes
				{
					adj_type & lc = m->LowConn(it->first);
					for(adj_type::size_type qt = 0; qt < lc.size(); ++qt) //iterate through cells of the node
					{
						adj_type & hc = m->HighConn(lc[qt]);
						adj_iterator jt = hc.begin();
						while(jt != hc.end() ) // iterate through nodes of the cell
						{
							if( *jt == it->first )
							{
								jt = hc.erase(jt); //erase link to node
							}
							else ++jt;
						}
					}
					m->Destroy(it->first);
				}
			}
		}
			
		Edge e = m->CreateEdge(build_nodes).first;
		adj_type & ehc = m->HighConn(e->GetHandle());

		for(dynarray<adj_type::size_type,64>::size_type k = 0; k < insert_pos.size(); k++)
		{
			adj_type & lc = m->LowConn(faces[k]);
			lc.insert(lc.begin()+insert_pos[k],e->GetHandle());
			ehc.push_back(faces[k]);
			m->ComputeGeometricType(faces[k]);
			m->RecomputeGeometricData(faces[k]);
		}

		for(dynarray<HandleType,64>::size_type it = 0; it < cells.size(); ++it)
		{
			m->ComputeGeometricType(cells[it]);
			//change nodes of the cell according to ordering
			ElementArray<Node> nodes(m);
			m->RestoreCellNodes(cells[it],nodes);
			adj_type & hc = m->HighConn(cells[it]);
			assert(nodes.size() == m->Count(hc.data(),hc.size(),hm));
			//should keep hidden nodes of the cell
			//todo: think about how we should order them
			for(adj_type::size_type k = 0; k < hc.size(); ++k)
				if( m->Hidden(hc[k]) ) nodes.push_back(hc[k]);
			hc.replace(hc.begin(),hc.end(),nodes.begin(),nodes.end());
			//update centroid, volume, orientation, etc
			m->RecomputeGeometricData(cells[it]);
		}
		
		

		return e;
	}
	bool Edge::TestUniteEdges(const ElementArray<Edge> & edges, MarkerType del_protect)
	{
		if( edges.empty() ) return false;
		Mesh * m = edges.GetMeshLink();
		bool doexit = false, dothrow = false;
		MarkerType hm = m->HideMarker();
		MarkerType rem = m->CreateMarker();
		dynarray<HandleType,64> faces;
		tiny_map<HandleType,int,64> nodes;

		for(ElementArray<Edge>::size_type it = 0; it < edges.size(); ++it)
		{
			if( m->GetMarker(edges.at(it),del_protect) )
				doexit = true;
			adj_type const & hc = m->HighConn(edges.at(it));
			for(adj_type::size_type jt = 0; jt < hc.size(); ++jt) if( !m->GetMarker(hc[jt],hm) )
			{
				if( !m->GetMarker(hc[jt],rem) )
				{
					faces.push_back(hc[jt]);
					m->SetMarker(hc[jt],rem);
				}
			}
			adj_type const & lc = m->LowConn(edges.at(it));
			for(adj_type::size_type jt = 0; jt < lc.size(); ++jt) if( !m->GetMarker(lc[jt],hm) )
				nodes[lc[jt]]++;
		}
		
		for(dynarray<HandleType,64>::size_type it = 0; it < faces.size(); ++it)
			m->RemMarker(faces[it],rem);

		if( doexit )
		{
			m->ReleaseMarker(rem);
			return false;
		}
		
		for(tiny_map<HandleType,int,64>::iterator it = nodes.begin(); it != nodes.end(); it++)
		{
			if( it->second == 1 )
			{
//				build_nodes.push_back(it->first);
			}
			else if( it->second == 2 )
			{
				if( m->GetMarker(it->first,del_protect) )
					doexit = true;
			}
			else 
			{
				doexit = true;
				dothrow = true;
			}
		}

		if( doexit )
		{
			m->ReleaseMarker(rem);
			assert(!dothrow); //inner loop in deleted edges
			//if( dothrow ) throw Impossible; // bad input
			return false;
		}



		for(ElementArray<Edge>::size_type it = 0; it < edges.size(); ++it) m->SetMarker(edges.at(it),rem);

		for(dynarray<HandleType,64>::size_type it = 0; it < faces.size(); ++it)
		{
			adj_type const & lc = m->LowConn(faces[it]);
			bool found_rem = false;
			for(adj_type::size_type k = 0; k < lc.size(); k++) //insert new edge to the first position where we delete old edge
			{
				if( m->GetMarker(lc[k],rem) )
				{
					/*
					//all united edges should appear in consecutive order in deleted face
					adj_type::size_type sum = 0, j = k;
					while( !m->GetMarker(lc[j],hm) && m->GetMarker(lc[j],rem) )
					{
						sum++; j++;
					}
					if( sum != static_cast<adj_type::size_type>(edges.size()) )
					{
						doexit = true;
						dothrow = true;
					}
					 */
					found_rem = true;
					break;
				}
			}
			if( !found_rem )
			{
				doexit = true;
				dothrow = true;
			}
		}
		for(ElementArray<Edge>::size_type it = 0; it < edges.size(); ++it) m->RemMarker(edges.at(it),rem);

		if( doexit )
		{
			m->ReleaseMarker(rem);
			assert(!dothrow);
			//if( dothrow ) throw Impossible; // bad input
			return false;
		}

		return true;
	}
	
	
	Node Edge::CollapseEdge(Edge e, MarkerType del_protect)
	{
		Node n = InvalidNode();
		Mesh & m = *e.GetMeshLink();
		bool reconnect = true;
		//e.PrintElementConnectivity();
		{
			double a = 0.5, cnt[3] = {0,0,0};
			if( e.getBeg().Boundary() ) a -= 0.5;
			if( e.getEnd().Boundary() ) a += 0.5;
			for(unsigned k = 0; k < m.GetDimensions(); ++k)
				cnt[k] = (1-a)*e.getBeg().Coords()[k] + a*e.getEnd().Coords()[k];
			n = m.CreateNode(cnt);
		}
		TagInteger index = m.CreateTag("element_index",DATA_INTEGER,CELL|FACE|EDGE,NONE,1);
		ElementArray<Node> nodes = e.getNodes();
		ElementArray<Edge> edges(&m), new_edges(&m);
		ElementArray<Face> faces(&m), new_faces(&m);
		ElementArray<Cell> cells(&m), new_cells(&m);
		for(ElementArray<Node>::iterator kt = nodes.begin(); kt != nodes.end(); kt++)
		{
			edges.Unite(kt->getEdges());
			faces.Unite(kt->getFaces());
			cells.Unite(kt->getCells());
		}
		for(ElementArray<Edge>::iterator it = edges.begin(); it != edges.end(); ++it)
		{
			ElementArray<Node> edge_nodes = it->getNodes();
			if( edge_nodes[0] == nodes[0] || edge_nodes[0] == nodes[1] ) edge_nodes[0] = n;
			if( edge_nodes[1] == nodes[0] || edge_nodes[1] == nodes[1] ) edge_nodes[1] = n;
			if( edge_nodes[0] != edge_nodes[1] )
			{
				Edge ne = m.CreateEdge(edge_nodes).first;
				new_edges.push_back(ne);
				index[*it] = new_edges.size();
			}
			else index[*it] = -1;
		}
		for(ElementArray<Face>::iterator it = faces.begin(); it != faces.end(); ++it)
		{
			ElementArray<Edge> face_edges = it->getEdges();
			ElementArray<Edge>::iterator jt = face_edges.begin();
			while(jt != face_edges.end())
			{
				if( index[*jt] == -1 )
					jt = face_edges.erase(jt);
				else
				{
					if( index[*jt] > 0 ) *jt = new_edges[index[*jt]-1].GetHandle();
					jt++;
				}
			}
			if( face_edges.size() >= 3 )
			{
				Face nf = m.CreateFace(face_edges).first;
				new_faces.push_back(nf);
				index[*it] = new_faces.size();
			}
			else index[*it] = -1;
		}
		//transfer edge data
		for(ElementArray<Edge>::iterator it = edges.begin(); it != edges.end(); ++it)
		{
			if( index[*it] > 0 )
				Mesh::CopyData(new_edges[index[*it]-1],it->self());
			index[*it] = 0;
		}
		for(ElementArray<Cell>::iterator it = cells.begin(); it != cells.end(); ++it)
		{
			ElementArray<Face> cell_faces = it->getFaces();
			ElementArray<Face>::iterator jt = cell_faces.begin();
			while(jt != cell_faces.end())
			{
				if( index[*jt] == -1 )
					jt = cell_faces.erase(jt);
				else
				{
					if( index[*jt] > 0 ) *jt = new_faces[index[*jt]-1].GetHandle();
					jt++;
				}
			}
			if( cell_faces.size() >= 4 )
			{
				ElementArray<Node> check_nodes(&m);
				for(jt = cell_faces.begin(); jt != cell_faces.end(); ++jt)
					check_nodes.Unite(jt->getNodes());
				bool flattened = false;
				for(jt = cell_faces.begin(); jt != cell_faces.end(); ++jt)
					if( check_nodes.size() == jt->nbAdjElements(NODE) )
						flattened = true;
				if( !flattened )
				{
					Cell nc = m.CreateCell(cell_faces).first;
					new_cells.push_back(nc);
					index[*it] = new_cells.size();
				}
				else index[*it] = -1;
			}
			else index[*it] = -1;
		}
		//transfer face data
		for(ElementArray<Face>::iterator it = faces.begin(); it != faces.end(); ++it)
		{
			if( index[*it] > 0 )
				Mesh::CopyData(new_faces[index[*it]-1],it->self());
			index[*it] = 0;
		}
		//transfer cell data
		for(ElementArray<Cell>::iterator it = cells.begin(); it != cells.end(); ++it)
		{
			if( index[*it] > 0 )
				Mesh::CopyData(new_cells[index[*it]-1],it->self());
			index[*it] = 0;
		}
		//delete old elements
		for(ElementArray<Cell>::iterator it = cells.begin(); it != cells.end(); ++it) it->Delete();
		for(ElementArray<Face>::iterator it = faces.begin(); it != faces.end(); ++it) it->Delete();
		for(ElementArray<Edge>::iterator it = edges.begin(); it != edges.end(); ++it) it->Delete();
		for(ElementArray<Node>::iterator kt = nodes.begin(); kt != nodes.end(); kt++) kt->Delete();
		m.DeleteTag(index);
		return n;
	}


	ElementArray<Edge> Edge::SplitEdge(Edge e, const ElementArray<Node> & nodes, MarkerType del_protect)
	{
		Mesh * m = e->GetMeshLink();
		ElementArray<Edge> ret(m);
		dynarray<HandleType,64> faces;
		dynarray<HandleType,128> cells;
		HandleType n[2];
		if( e->GetMarker(del_protect) || nodes.empty() ) return ret;
		ret.reserve(nodes.size()+1);
		MarkerType hm = m->HideMarker();
		MarkerType dup = m->CreateMarker();
		adj_type & hc = m->HighConn(e->GetHandle());
		
		for(adj_type::size_type it = 0; it < hc.size(); ++it) if( !m->GetMarker(hc[it],hm) )
		{
			faces.push_back(hc[it]);
			adj_type const & ihc = m->HighConn(hc[it]);
			for(adj_type::size_type jt = 0; jt < ihc.size(); ++jt) if( !m->GetMarker(ihc[jt],hm) )
			{
				if( !m->GetMarker(ihc[jt],dup) )
				{
					cells.push_back(ihc[jt]);
					m->SetMarker(ihc[jt],dup);
				}
			}
		}

		for(dynarray<HandleType,128>::size_type it = 0; it < cells.size(); ++it)
			m->RemMarker(cells[it],dup);

		m->ReleaseMarker(dup);

		int k = 0;

		adj_type const & lc = m->LowConn(e->GetHandle());

		for(adj_type::size_type it = 0; it < lc.size(); ++it)
			if( !m->GetMarker(lc[it],hm) )
				n[k++] = lc[it];

		assert( k == 2 );

		dynarray<adj_type::size_type,64> insert_pos; //position where we insert new edges

		for(dynarray<HandleType,64>::size_type it = 0; it < faces.size(); ++it)
		{
			adj_type const ilc = m->LowConn(faces[it]);
			for(adj_type::size_type jt = 0; jt < ilc.size(); ++jt) if( !m->GetMarker(ilc[jt],hm) )
			{
				if( ilc[jt] == e->GetHandle() )
				{
					insert_pos.push_back(jt);
					break;
				}
			}
		}
		

		if( !e->Hide() ) //we cannot hide the edge, should disconnect faces
		{
			for(adj_type::size_type it = 0; it < hc.size(); ++it)
			{
				adj_type & ilc = m->LowConn(hc[it]);
				adj_iterator jt = ilc.begin();
				while(jt != ilc.end())
					if( *jt == e->GetHandle() ) jt = ilc.erase(jt);
					else ++jt;
			}
			hc.clear();
			m->Destroy(e->GetHandle());
		}
		
		{
			ElementArray<Node> build_nodes(m,2);
			build_nodes.at(0) = n[0];
			build_nodes.at(1) = nodes.at(0);
			ret.push_back(m->CreateEdge(build_nodes).first->GetHandle());
			
			for(ElementArray<Node>::size_type k = 0; k < nodes.size()-1; k++)
			{
				build_nodes.at(0) = nodes.at(k);
				build_nodes.at(1) = nodes.at(k+1);
				ret.push_back(m->CreateEdge(build_nodes).first->GetHandle());
			}

			build_nodes.at(0) = nodes.at(nodes.size()-1);
			build_nodes.at(1) = n[1];
			ret.push_back(m->CreateEdge(build_nodes).first->GetHandle());
		}

		//connect new edges to faces
		for(dynarray<HandleType,64>::size_type it = 0; it < faces.size(); ++it)
		{
			adj_type & lc = m->LowConn(faces[it]);
			//check that that one of the nodes of privious edge match n[0],
			//otherwise we have to insert in reverse
			const adj_type & phc = m->LowConn(lc[(insert_pos[it]+lc.size()-1)%lc.size()]);
			if( phc[0] == n[0] || phc[1] == n[0] )
				lc.insert(lc.begin()+insert_pos[it],ret.begin(),ret.end());
			else
				lc.insert(lc.begin()+insert_pos[it],ret.rbegin(),ret.rend());
			m->ComputeGeometricType(faces[it]);
			m->RecomputeGeometricData(faces[it]);
			//Face(m,faces[it]).FixEdgeOrder();
		}
		//inform edges that they are connected to faces
		for(ElementArray<Edge>::iterator kt = ret.begin(); kt != ret.end(); ++kt)
		{
			adj_type & hc = m->HighConn(kt->GetHandle());
			hc.insert(hc.end(),faces.begin(),faces.end());
		}

		for(dynarray<HandleType,128>::size_type it = 0; it < cells.size(); ++it)
		{
			adj_type & hc = m->HighConn(cells[it]); //cell nodes
			//hc.clear(); //have to recompute cell nodes
			m->ComputeGeometricType(cells[it]);
			ElementArray<Node> nn(m);
			m->RestoreCellNodes(cells[it],nn);
			//should keep hidden nodes of the cell
			//todo: think about how we should order them
			for(adj_type::size_type k = 0; k < hc.size(); ++k)
				if( m->Hidden(hc[k]) ) nn.push_back(hc[k]);
			hc.replace(hc.begin(),hc.end(),nn.begin(),nn.end());
			m->RecomputeGeometricData(cells[it]);
			//connect nodes to cells
			for(ElementArray<Node>::size_type k = 0; k < nn.size(); k++)
			{
				adj_type & nlc = m->LowConn(nn[k].GetHandle()); //node cells
				bool have_cell = false;
				for(adj_type::iterator kt = nlc.begin(); kt != nlc.end() && !have_cell; ++kt)
					if( *kt == cells[it] ) have_cell = true;
				if( !have_cell )
					nlc.push_back(cells[it]);
			}
		}
		return ret;
	}
	
	bool Edge::TestSplitEdge(Edge e, const ElementArray<Node> & nodes, MarkerType del_protect)
	{
		return !nodes.empty() && !e->GetMarker(del_protect);
	}

	
	ElementArray<Face> Face::SplitFace(Face face, const ElementArray<Edge> & edges, MarkerType del_protect)
	{
		//bool did_restart = false;
		//bool report = false;
		//restart_algorithm:
		Mesh * m = face->GetMeshLink();
		ElementArray<Edge> loop(m);
		ElementArray<Face> ret(m);
		dynarray<HandleType,128> temp;
		if( edges.empty() || face->GetMarker(del_protect) ) return ret;
		MarkerType hm = m->HideMarker();
		dynarray<HandleType,2> cells;
		
		//if( report ) std::cout << "Marker for hidden elements: " << hm << std::endl;

		adj_type & hc = m->HighConn(face->GetHandle());
		//if( report ) std::cout << "Adjacent cells for face: ";
		for(adj_type::size_type it = 0; it < hc.size(); ++it) 
		{
			if( !m->GetMarker(hc[it],hm) )
			{
				cells.push_back(hc[it]);
				//if( report ) std::cout << GetHandleID(hc[it]) << " ";
			}
		}
		//if( report ) std::cout << std::endl;

		//assert(cells.size() == 2);

		
		MarkerType outer = m->CreateMarker();

		int ninner = 0;
		adj_type & lc = m->LowConn(face->GetHandle());
		//if( report ) std::cout << "Edges for face: ";
		for(adj_type::size_type it = 0; it < lc.size(); ++it) if( !m->GetMarker(lc[it],hm) )
		{
			m->SetMarker(lc[it],outer);
			//if( report ) std::cout << GetHandleID(lc[it]) << " ";
		}
		//if( report ) std::cout << std::endl;
		
		
		//if( report ) std::cout << "Split edges: ";
		for(ElementArray<Edge>::size_type it = 0; it < edges.size(); ++it)
			if( !m->GetMarker(edges[it].GetHandle(),outer) )
			{
				temp.push_back(edges[it].GetHandle());
				//if( report ) std::cout << GetHandleID(edges[it].GetHandle()) << " ";
				ninner++;
			}
		//if( report ) std::cout << std::endl;

		for(adj_type::size_type it = 0; it < lc.size(); ++it) if( !m->GetMarker(lc[it],hm) )
		{
			temp.push_back(lc[it]);
			m->RemMarker(lc[it],outer);
		}
		m->ReleaseMarker(outer);

		//all provided edges coincide with boundary edges of current face, no action required
		if( ninner == 0 ) 
		{
			ret.push_back(face);
			return ret;
		}
		
		/*
		if( !did_restart )
		{
			incident_matrix<Edge> mat(m,temp.begin(),temp.end(),ninner);
			do
			{
				mat.find_shortest_loop(loop);
				if (!loop.empty())
				{
					if( loop.size() > 2 )
					{
						//ret.push_back(m->CreateFace(loop).first);
						//adj_type & hc = m->HighConn(ret.back()->GetHandle());
						//hc.replace(hc.begin(),hc.end(),cells.begin(),cells.end());
					}
					else report = true;
				}
				else break;
			} while(true);
			
			
			if(report )//!mat.all_visited())
			{
				mat.print_matrix();
				incident_matrix<Edge> mat(m,temp.begin(),temp.end(),ninner,GridCoords(),true);
				do
				{
					mat.find_shortest_loop(loop);
					if( loop.empty() ) break;
				} while( true );
				did_restart = true;
				goto restart_algorithm;
			}
		}
		*/

		
		if( !face->Hide() )
		{
			for(dynarray<HandleType,2>::size_type k = 0; k < cells.size(); k++)
			{
				adj_type & ilc = m->LowConn(cells[k]);
				for(adj_type::size_type it = 0; it < ilc.size(); ++it)
				{
					if( ilc[it] == face->GetHandle() )
					{
						ilc.erase(ilc.begin()+it);
						break;
					}
				}
			}
			hc.clear();
			m->Destroy(face->GetHandle());
		}
		
		incident_matrix<Edge> mat(m,temp.begin(),temp.end(),ninner);

		
		do
		{
			mat.find_shortest_loop(loop);
			if (!loop.empty())
			{
				if( loop.size() > 2 )
				{
					std::pair<Face,bool> ff = m->CreateFace(loop);
					ret.push_back(ff.first); //collect new faces
					adj_type & hc = m->HighConn(ret.back()->GetHandle());
					if( ff.second ) //connect brand new face to cells
					{
						//std::cout << "hello1 from " << ff.first.LocalID() << std::endl;
						hc.replace(hc.begin(),hc.end(),cells.begin(),cells.end());
					}
					else //face already existed before and may be connected to some cells
					{
						//std::cout << "hello2 from " << ff.first.LocalID() << std::endl;
						//std::cout << "cells: ";
						//for(int k = 0; k < (int)cells.size(); ++k) std::cout << GetHandleID(cells[k]) << " ";
						//std::cout << std::endl;
						//std::cout << "conns: ";
						//for(int k = 0; k < (int)hc.size(); ++k) std::cout << GetHandleID(hc[k]) << " ";
						//std::cout << std::endl;
						for(int k = 0; k < (int)cells.size(); ++k)
						{
							bool add = true;
							for(int j = 0; j < (int)hc.size() && add; ++j)
								if( hc[j] == cells[k] ) add = false;
							if( add ) hc.push_back(cells[k]);
						} //FIXME: what if more then 2 connections? have to fire topology exception, unless there are hidden cells
					}
				}
			}
			else break;
		} while(true);



		for(dynarray<HandleType,2>::size_type it = 0; it < cells.size(); ++it)
		{
			adj_type & hc = m->HighConn(cells[it]); //cell nodes
			//hc.clear(); //have to recompute cell nodes
			adj_type & lc = m->LowConn(cells[it]); //cell faces
			lc.insert(lc.end(),ret.begin(),ret.end());
			m->ComputeGeometricType(cells[it]);
			ElementArray<Node> nn(m);
			m->RestoreCellNodes(cells[it],nn);
			//should keep hidden nodes of the cell
			//todo: think about how we should order them
			for(adj_type::size_type k = 0; k < hc.size(); ++k)
				if( m->Hidden(hc[k]) ) nn.push_back(hc[k]);
			hc.replace(hc.begin(),hc.end(),nn.begin(),nn.end());
			m->RecomputeGeometricData(cells[it]);
			//have to add cell to nodes that do not yet have connection to the cell
			for(ElementArray<Node>::iterator jt = nn.begin(); jt != nn.end(); ++jt)
			{
				adj_type & nlc = m->LowConn(*jt); //node cells
				bool have_cell = false;
				for(adj_type::iterator kt = nlc.begin(); kt != nlc.end() && !have_cell; ++kt)
					if( *kt == cells[it] ) have_cell = true;
				if( !have_cell )
					nlc.push_back(cells[it]);
			}
		}

		return ret;
	}
	bool Face::TestSplitFace(Face face, const ElementArray<Edge> & edges, MarkerType del_protect)
	{
		return !edges.empty() && !face->GetMarker(del_protect);
	}


	ElementArray<Cell> Cell::SplitCell(Cell cell, const ElementArray<Face> & faces, MarkerType del_protect)
	{
		Mesh * m = cell->GetMeshLink();
		ElementArray<Cell> ret(m);
		ElementArray<Face> loop(m);
		dynarray<HandleType,128> temp;
		if( faces.empty() || cell->GetMarker(del_protect) ) return ret;
		MarkerType hm = m->HideMarker();



		MarkerType outer = m->CreateMarker();
		int ninner = 0;
		adj_type & lc = m->LowConn(cell->GetHandle());
		for(adj_type::size_type it = 0; it < lc.size(); ++it) if( !m->GetMarker(lc[it],hm) )
			m->SetMarker(lc[it],outer);

		for(ElementArray<Face>::size_type it = 0; it < faces.size(); ++it)
			if( !m->GetMarker(faces[it].GetHandle(),outer) )
			{
				temp.push_back(faces[it].GetHandle());
				ninner++;
			}

		for(adj_type::size_type it = 0; it < lc.size(); ++it) if( !m->GetMarker(lc[it],hm) )
		{
			temp.push_back(lc[it]);
			m->RemMarker(lc[it],outer);
		}
		m->ReleaseMarker(outer);

		//all provided faces coincide with boundary faces of current cell, no action required
		if( ninner == 0 )
		{
			ret.push_back(cell);
			return ret;
		}
			
		incident_matrix<Face> mat(m,temp.begin(),temp.end(),ninner);
		//mat.print_matrix();
		cell->Delete();
		
		bool report = false;
		do
		{
			mat.find_shortest_loop(loop);
			if (!loop.empty() ) 
			{
				if( loop.size() > 3 )
					ret.push_back(m->CreateCell(loop).first);
				else
					report = true;
			}
			else break;
		} while( true );
		
		//debug
		
		if( false ) if(report || !mat.all_visited())
		{
			mat.print_matrix();
			incident_matrix<Face> mat(m,temp.begin(),temp.end(),ninner,GridCoords(),true);
			do
			{
				mat.find_shortest_loop(loop);
				if( loop.empty() ) break;
			} while( true );
		}
		 

		return ret;
	}
	bool Cell::TestSplitCell(Cell cell, const ElementArray<Face> & faces, MarkerType del_protect)
	{
		return !faces.empty() && !cell->GetMarker(del_protect);
	}
	
	void Mesh::BeginModification()
	{
		ENTER_FUNC();
		hide_element = CreateMarker();
		new_element = CreateMarker();
		EXIT_FUNC();
	}
	
	void Mesh::SwapModification(bool recompute_geometry)
	{
		ENTER_FUNC();
		MarkerType temp = hide_element;
		hide_element = new_element;
		new_element = temp;

		integer tmp[6];
		memcpy(tmp,hidden_count,sizeof(integer)*6);
		memcpy(hidden_count,hidden_count_zero,sizeof(integer)*6);
		memcpy(hidden_count_zero,tmp,sizeof(integer)*6);

		if( recompute_geometry )
		{
			for(ElementType etype = EDGE; etype <= CELL; etype = etype << 1)
			{
				for(integer it = 0; it < LastLocalID(etype); ++it) if( isValidElement(etype,it) )
				{
					HandleType h = ComposeHandle(etype,it);
					if( GetMarker(h,new_element) )
					{
						ComputeGeometricType(h);
						RecomputeGeometricData(h);
					}
				}
			}
		}
		EXIT_FUNC();
	}
	
	void Mesh::ApplyModification()
	{
		ENTER_FUNC();
		for(Mesh::iteratorTag it = BeginTag(); it != EndTag(); ++it)
		{
			if( it->GetDataType() == DATA_REFERENCE )
			{
				if( *it == HighConnTag() || *it  == LowConnTag() ) continue;
				for(ElementType etype = NODE; etype <= CELL; etype = etype << 1)
					if( it->isDefined(etype) )
					{
						if( it->isSparse(etype) )
						{
							for(integer jt = 0; jt < LastLocalID(etype); ++jt) if( isValidElement(etype,jt) )
							{
								HandleType h = ComposeHandle(etype,jt);
								if( HaveData(h,*it) )
								{
									reference_array arr = ReferenceArray(h,*it);
									for(reference_array::size_type qt = 0; qt < arr.size(); ++qt)
										if( arr.at(qt) != InvalidHandle() && Hidden(arr.at(qt)) ) arr.at(qt) = InvalidHandle();
								}
							}
						}
						else
						{
							for(integer jt = 0; jt < LastLocalID(etype); ++jt) if( isValidElement(etype,jt) )
							{
								HandleType h = ComposeHandle(etype,jt);
								reference_array arr = ReferenceArray(h,*it);
								for(reference_array::size_type qt = 0; qt < arr.size(); ++qt)
									if( arr.at(qt) != InvalidHandle() && Hidden(arr.at(qt)) ) arr.at(qt) = InvalidHandle();
							}
						}
					}
			}
		}
		//need to gather the set of deleted elements
		/*//old approach
		ElementSet erase = CreateSet("TEMPORARY_ERASE_SET").first;
		for(ElementType etype = NODE; etype <= ESET; etype = etype << 1)
		{
			for(integer it = 0; it < LastLocalID(etype); ++it)
				if( isValidElement(etype,it) && Hidden(ComposeHandle(etype,it)) )
					erase->PutElement(ComposeHandle(etype,it)); 
		}
		//the formed above set will be automatically sorted by handles, it does not harm to explicitly indicate that,
		//in case any algorithm further will use this fact (Subtract currently would not use this fact)
		//but may use by retriving lower_bound/higher_bound O(log(n)) operations to narrow performed operations
		erase->BulkDF(SetComparatorTag()) = ElementSet::HANDLE_COMPARATOR;
		*/

		//for(integer jt = 0; jt < LastLocalID(ESET); ++jt) if( isValidElementSet(jt) )
		for(Mesh::iteratorSet it = BeginSet(); it != EndSet(); it++)
		{
			//ElementSet it = EsetByLocalID(jt);
			//std::cout << "set name: " << it->GetName() << " size " << it->Size() << " id " << it->LocalID() << std::endl;
			if( it->HaveParent() && it->GetParent()->Hidden() )
				it->GetParent()->RemChild(it->self());
			while( it->HaveChild() && it->GetChild()->Hidden() )
				it->RemChild(it->GetChild());
			while( it->HaveSibling() && it->GetSibling()->Hidden() )
				it->RemSibling(it->GetSibling());
			temp_hide_element = hide_element;
			hide_element = 0;
			ElementSet::iterator jt = it->Begin();
			//int q = 0;
			while(jt != it->End() )
			{
				//++q;
				//std::cout << "check element " << ElementTypeName(jt->GetElementType()) << " num " << jt->LocalID() << " handle " << jt->GetHandle() << std::endl;
				if( jt->GetMarker(temp_hide_element) ) 
				{
					//std::cout << "erase element " << ElementTypeName(jt->GetElementType()) << " num " << jt->LocalID() << " handle " << jt->GetHandle() << std::endl;
					jt = it->Erase(jt);
				}
				else ++jt;
			}
			//std::cout << "size " << it->Size() << " traversed " << q << std::endl;
			hide_element = temp_hide_element;
			//it->Subtract(erase); //old approach
		}
#if defined(USE_PARALLEL_STORAGE)
		for(parallel_storage::iterator it = shared_elements.begin(); it != shared_elements.end(); it++)
			for(int i = 0; i < 5; i++)
			{
				unsigned k = 0, l;
				for(l = 0; l < it->second[i].size(); ++l)
				{
					if( !GetMarker(it->second[i][l],hide_element) )
						it->second[i][k++] = it->second[i][l];
				}
				it->second[i].resize(k);
			}
		for(parallel_storage::iterator it = ghost_elements.begin(); it != ghost_elements.end(); it++)
			for(int i = 0; i < 5; i++)
			{
				unsigned k = 0, l;
				for(l = 0; l < it->second[i].size(); ++l)
				{
					if( !GetMarker(it->second[i][l],hide_element) )
						it->second[i][k++] = it->second[i][l];
				}
				it->second[i].resize(k);
			}
#endif
		//Destroy(erase);//old approach
		EXIT_FUNC();
	}
	void Mesh::ResolveModification()
	{
		if( GetProcessorsNumber() == 1 ) return;
		ENTER_FUNC();
		//ReportParallelStorage();
		//CheckCentroids(__FILE__,__LINE__);
		/*
		int h = 0, n = 0, hn = 0;
		for(ElementType etype = NODE; etype <= CELL; etype = NextElementType(etype))
		for(int k = 0; k < LastLocalID(etype); ++k) if( isValidElement(etype,k) )
		{
			Element it = ElementByLocalID(etype,k);
			if( it->New() ) n++;
			if( it->Hidden() ) h++;
			if( it->New() && it->Hidden() ) hn++;
		}
		std::cout << GetProcessorRank() << " before resolve shared new " << n << " hidden " << h << " both " << hn << std::endl;
		*/
		CheckSetLinks(__FILE__,__LINE__);
		ResolveSets();
		CheckSetLinks(__FILE__,__LINE__);
		ResolveShared(true);
		CheckSetLinks(__FILE__,__LINE__);
		//ReportParallelStorage();
		//CheckCentroids(__FILE__,__LINE__);
		/*
		h = 0, n = 0, hn = 0;
		for(ElementType etype = NODE; etype <= CELL; etype = NextElementType(etype))
		for(int k = 0; k < LastLocalID(etype); ++k) if( isValidElement(etype,k) )
		{
			Element it = ElementByLocalID(etype,k);
			if( it->New() ) n++;
			if( it->Hidden() ) h++;
			if( it->New() && it->Hidden() ) hn++;
		}
		std::cout << GetProcessorRank() << " before exchange ghost new " << n << " hidden " << h << " both " << hn << std::endl;
		*/
		//std::cout << "layers " << Integer(GetHandle(),tag_layers) << " bridge " << ElementTypeName(ElementType(Integer(GetHandle(),tag_bridge))) << std::endl;
		ExchangeGhost(Integer(GetHandle(),tag_layers),Integer(GetHandle(),tag_bridge));//,NewMarker()); //TODO!!!!
		//ReportParallelStorage();
		//CheckCentroids(__FILE__,__LINE__);
		//Save("after_exchange_ghost.pvtk");
		/*
		h = 0, n = 0, hn = 0;
		for(ElementType etype = NODE; etype <= CELL; etype = NextElementType(etype))
		for(int k = 0; k < LastLocalID(etype); ++k) if( isValidElement(etype,k) )
		{
			Element it = ElementByLocalID(etype,k);
			if( it->New() ) n++;
			if( it->Hidden() ) h++;
			if( it->New() && it->Hidden() ) hn++;
		}
		std::cout << GetProcessorRank() << " after exchange ghost new " << n << " hidden " << h << " both " << hn << std::endl;
		*/
		
		//ReportParallelStorage();
		//CheckCentroids(__FILE__,__LINE__);
		//exit(-1);
		EXIT_FUNC();
	}
	
	void Mesh::EndModification()
	{
		ENTER_FUNC();
		//ApplyModification();
		//temp_hide_element = hide_element;
		//hide_element = 0;
		/*
		for(ElementType etype = FACE; etype >= NODE; etype = PrevElementType(etype))
		{
			for(integer it = 0; it < LastLocalID(etype); ++it) if( isValidElement(etype,it) )
			{
				//all upper elements are deleted
				if( ElementByLocalID(etype,it).nbAdjElements(NextElementType(etype),hide_element) ==
				    ElementByLocalID(etype,it).nbAdjElements(NextElementType(etype)) )
					SetMarker(ComposeHandle(etype,it),hide_element);
			}
		}
		 */
		MarkerType nm = new_element;
		new_element = 0;
		for(ElementType etype = ESET; etype >= NODE; etype = PrevElementType(etype))
		{
			for(integer it = 0; it < LastLocalID(etype); ++it) if( isValidElement(etype,it) )
			{
				HandleType h = ComposeHandle(etype,it);
				RemMarker(h,nm);
				if( GetMarker(h,hide_element) )
					Destroy(h);
			}
		}
		new_element = nm;
		/*
		for(ElementType etype = FACE; etype >= NODE; etype = PrevElementType(etype))
		{
			for(integer it = 0; it < LastLocalID(etype); ++it) if( isValidElement(etype,it) )
			{
				if( ElementByLocalID(etype,it).nbAdjElements(NextElementType(etype)) == 0 )
					Destroy(ComposeHandle(etype,it));
			}
		}
		 */
		//RecomputeParallelStorage(ESET|CELL|FACE|EDGE|NODE);
		//ExchangeGhost(Integer(GetHandle(),tag_layers),Integer(GetHandle(),tag_bridge),NewMarker()); //TODO!!!!
		memset(hidden_count,0,sizeof(integer)*6);
		memset(hidden_count_zero,0,sizeof(integer)*6);
		ReleaseMarker(hide_element);
		ReleaseMarker(new_element);
		hide_element = 0;
		new_element = 0;
		//This should be done in ResolveModification
		ElementType have_global_id = NONE;
		if( GlobalIDTag().isValid() )
		{
			for(ElementType etype = NODE; etype <= MESH; etype = NextElementType(etype))
				if( GlobalIDTag().isDefined(etype) ) have_global_id |= etype;
		}
		if( have_global_id ) AssignGlobalID(have_global_id);
		EXIT_FUNC();
	}


	void Mesh::Destroy(HandleType h)
	{
		//if( h == 1073743552 || h == 1073742933)
		//	std::cout << GetProcessorRank() << " destroy " << ElementTypeName(GetHandleElementType(h)) << " id " << GetHandleID(h) << " handle " << h << std::endl;// << (GetMarker(h,temp_hide_element) ? " hidden " : " not hidden ") << std::endl;
		assert(isValidHandleRange(h));
		assert(isValidHandle(h));
		ElementType htype = GetHandleElementType(h);
		//if( Hidden(h) ) Show(h);
		if( htype & (NODE|EDGE|FACE|CELL) )
			ElementByHandle(h).Disconnect(true);
		else if( htype & ESET )
		{
			ElementSet eset(this,h);
			set_search.erase(eset->GetName());
			if( eset->HaveParent() )
				eset->GetParent()->RemChild(eset);
			while( eset->HaveChild() )
				eset->RemChild(eset->GetChild());
		}
		for(iteratorTag t = BeginTag(); t != EndTag(); ++t) 
			if( t->isDefined(htype) ) DelData(h,*t);
		UntieElement(GetHandleElementNum(h),GetHandleID(h));
	}

	bool Mesh::Hide(HandleType h)
	{
		if(HideMarker()) 
		{
			if( !Hidden(h) )
			{
				//TODO if we hide a back cell for a face we have to swap it's normal!
				if( GetHandleElementType(h) == CELL ) Cell(this,h)->SwapBackCell();
				hidden_count[GetHandleElementNum(h)]++;
				SetMarker(h,HideMarker()); 
			}
			return true;
		} 
		return false;
	}
	
	bool Mesh::Show(HandleType h)
	{
		if(HideMarker()) 
		{
			if( Hidden(h) )
			{
				hidden_count[GetHandleElementNum(h)]--;
				RemMarker(h,HideMarker()); 
			}
			return true;
		} 
		return false;
	}
	
	bool Mesh::Delete(HandleType h) 
	{
		if(/*!New(h) &&*/ Hide(h))
		{
			//mark all elements that rely on this that they should be deleted
			if( GetHandleElementType(h) < CELL )
			{
				Element::adj_type & hc = HighConn(h);
				for(Element::adj_type::size_type it = 0; it < hc.size(); ++it)
					if( !Hidden(hc[it]) ) Delete(hc[it]);
			}
			return false;
		}
		else 
		{
			Destroy(h);
			return true;
		}
	}
	
	bool Mesh::Hidden(HandleType h) const
	{
		assert(h != InvalidHandle());
		return GetMarker(h,HideMarker());
	}
	
	bool Mesh::New(HandleType h) const
	{
		assert(h != InvalidHandle());
		return GetMarker(h,NewMarker());
	}
	
	bool Element::Hide() const
	{
		return GetMeshLink()->Hide(GetHandle());
	}
	
	bool Element::Show() const
	{
		return GetMeshLink()->Show(GetHandle());
	}
	
	bool Element::Delete() 
	{
		bool ret = GetMeshLink()->Delete(GetHandle());
		if( ret ) handle = InvalidHandle();
		return ret;
	}
	
	bool Element::Hidden() const
	{
		return GetMeshLink()->Hidden(GetHandle());
	}
	
	bool Element::New() const
	{
		return GetMeshLink()->New(GetHandle());
	}
	
	
	Storage::enumerator Mesh::getNext(const HandleType * arr, enumerator size, enumerator k, MarkerType marker) const
	{
		k++;
		while(k < size && GetMarker(arr[k],marker)) k++;
		return k;
	}
	
	Storage::enumerator Mesh::Count(const HandleType * arr, enumerator size, MarkerType marker) const
	{
		enumerator ret = 0, k = 0;
		while(k < size) 
		{
			if( !GetMarker(arr[k],marker) ) ret++;
			k++;
		}
		return ret;
	}

	void Element::UpdateGeometricData() const
	{
		GetMeshLink()->RecomputeGeometricData(GetHandle());
	}
	
	void Cell::SwapBackCell() const
	{
		Mesh * m = GetMeshLink();
		
		//if( m->HaveGeometricData(ORIENTATION,FACE) )
		{
			//retrive faces
			MarkerType hm = m->HideMarker();
			adj_type & lc = m->LowConn(GetHandle());
			for( adj_type::size_type it = 0; it < lc.size(); it++) if( !m->GetMarker(lc[it],hm) ) //iterator over unhidden faces
			{
				adj_type & hc = m->HighConn(lc[it]);
				if( !hc.empty() && m->Count(hc.data(),static_cast<enumerator>(hc.size()),hm) == 2 ) //there are two cells connected to face
				{
					enumerator k1 = ENUMUNDEF, k2;
					k1 = m->getNext(hc.data(),static_cast<enumerator>(hc.size()),k1,hm);
					if( hc[k1] == GetHandle() ) //the first cell is current
					{
						k2 = m->getNext(hc.data(),static_cast<enumerator>(hc.size()),k1,hm);
						std::swap(hc[k1],hc[k2]);
						//hc[k2] = GetHandle(); //cannot use the cell because virtualization table is already destroyed and FixNormalOrientation will do bad things
						//hc.resize(1); //just remove element, we will do this anyway later
						if( m->HaveGeometricData(ORIENTATION,FACE) ) Face(m,lc[it])->FixNormalOrientation(); //restore orientation
					}
				}
			}
		}
	}
	
	void Element::Disconnect(const HandleType * adjacent, INMOST_DATA_ENUM_TYPE num) const
	{
		Mesh * m = GetMeshLink();
		INMOST_DATA_ENUM_TYPE k = 0;
		dynarray<HandleType,64> arr[4];
		MarkerType mrk = m->CreateMarker(), mod = m->CreateMarker();
		for(k = 0; k < num; k++) m->SetMarker(adjacent[k], mrk);
		adj_iterator it;
		// disconnects nodes from current edge, edges from current face, faces from current cell
		if( GetElementType() > NODE ) //cannot disconnect cells from current node
		{
			adj_type & lc = m->LowConn(GetHandle());
			it = lc.begin();
			//look into nodes (edge), edges (face), faces (cell)
			while(it != lc.end() ) 
			{
				if( m->GetMarker(*it,mrk) ) //element should be disconnected
				{
					adj_type & hc = m->HighConn(*it);
					if( GetElementType() == CELL ) //update some geometric data
					{
						MarkerType hm = m->HideMarker();
						if( !hc.empty() && m->Count(hc.data(),static_cast<enumerator>(hc.size()),hm) == 2 )
						{
							enumerator k1 = ENUMUNDEF, k2;
							k1 = m->getNext(hc.data(),static_cast<enumerator>(hc.size()),k1,hm);
							if( hc[k1] == GetHandle() ) //the first cell is current
							{
								k2 = m->getNext(hc.data(),static_cast<enumerator>(hc.size()),k1,hm);
								hc[k1] = hc[k2];
								hc[k2] = GetHandle();
								Face(m,*it)->FixNormalOrientation(); //restore orientation
							}
						}
					}
					//look into edges of node (edge) faces of edge (face) cells of face (cell)
					for(adj_iterator jt = hc.begin(); jt != hc.end(); ++jt)
					{
						if( *jt == GetHandle() ) //remove me
						{
							hc.erase(jt);
							//don't update me
							//only lower adjacencies affect geometric data of element
							//this may be subject to change
							break;
						}
					}
					//update my data
					if( !m->GetMarker(GetHandle(),mod) ) 
					{
						m->SetMarker(GetHandle(),mod);
						arr[GetElementNum()].push_back(GetHandle());
					}
					//disconnect element
					it = lc.erase(it);
				}
				else it++;
			}
		}
		// disconnect edges from current node, faces from current edge, cells from current face
		if( GetElementType() < CELL ) //Cell cannot be disconnected from nodes
		{
			adj_type & hc = m->HighConn(GetHandle());
			it = hc.begin();
			//go over edges (node), faces (edge), cells (face)
			while(it != hc.end() ) 
			{
				if( m->GetMarker(*it,mrk) ) //should be disconnected
				{
					adj_type & lc = m->LowConn(*it);
					//look into nodes of edge (node), edges of face (edge), faces of cell (face)
					for(adj_iterator jt = lc.begin(); jt != lc.end(); ++jt)
					{
						if( *jt == GetHandle() ) //remove me
						{
							lc.erase(jt);
							// lower adjacencies of edge (node), face (edge), cell (face) where modified
							// update it's geometric data
							if( !m->GetMarker(*it,mod) ) 
							{
								m->SetMarker(*it,mod);
								arr[GetHandleElementNum(*it)].push_back(*it);
							}
							break;
						}
					}
					/* //don't update me
					//only lower adjacencies affect geometric data of element
					//this may be subject to change
					if( !GetMarker(mod) )
					{
						SetMarker(mod);
						arr[GetElementNum()].push_back(this);
					}
					*/
					//disconnect element
					it = hc.erase(it);
				}
				else it++;
			}
		}
		for(k = 0; k < num; k++) m->RemMarker(adjacent[k],mrk);
		//if element placed below on ierarhy was modified, then all upper elements
		//should be also modified, start from lowest elements in ierarchy and go up
		for(ElementType etype = NODE; etype <= CELL; etype = etype << 1 )
		{
			int el_num = ElementNum(etype);
			for(dynarray<HandleType, 64>::size_type it = 0; it < arr[el_num].size(); it++) 
			{
				assert( GetHandleElementType(arr[el_num][it]) == etype );
				if( etype < CELL ) //check for upper adjacencies of current element
				{
					//check all upper adjacencies that may be affected by modification of me
					adj_type & hc = m->HighConn(arr[el_num][it]);
					for(adj_type::size_type jt = 0; jt < hc.size(); ++jt)
					{
						if( !m->GetMarker(hc[jt],mod))
						{
							m->SetMarker(hc[jt],mod);
							arr[GetHandleElementNum(hc[jt])].push_back(hc[jt]);
						}
					}
					m->ComputeGeometricType(arr[el_num][it]);
				}
				else //update nodes for current cell
				{
					//remove me from old nodes
					adj_type & hc = m->HighConn(arr[el_num][it]);
					for(adj_iterator jt = hc.begin(); jt != hc.end(); ++jt) //iterate over my nodes
					{
						adj_type & lc = m->LowConn(*jt);
						adj_iterator kt = lc.begin(); 
						while(kt != lc.end()) //iterate over nodes's cells
						{
							if( (*kt) == arr[el_num][it] ) // if nodes's cell is equal to modified cell, then remove connection
							{
								kt = lc.erase(kt);
								break;
							}
							else kt++;
						}
					}
					hc.clear(); //disconnect cell from all of it's nodes
					m->ComputeGeometricType(arr[el_num][it]);
					if( !m->LowConn(arr[el_num][it]).empty() )
					{
						ElementArray<Node> newnodes(m);
						m->RestoreCellNodes(arr[el_num][it],newnodes); //find new nodes of the cell
						hc.insert(hc.end(),newnodes.begin(),newnodes.end()); //connect to new nodes
						//add me to my new nodes
						for(adj_iterator jt = hc.begin(); jt != hc.end(); ++jt)
							m->LowConn(*jt).push_back(arr[el_num][it]);
					}
				}
				m->RecomputeGeometricData(arr[el_num][it]);
				m->RemMarker(arr[el_num][it],mod);
			}
		}
		m->ReleaseMarker(mod);
		m->ReleaseMarker(mrk);
	}

	void Element::Connect(const HandleType * adjacent, INMOST_DATA_ENUM_TYPE num) const
	{
		assert( !(GetElementType() == EDGE && GetMeshLink()->LowConn(GetHandle()).size() > 2) ); // cannot add another node to edge
		Mesh * m = GetMeshLink();
		dynarray<HandleType, 64> arr[4];
		MarkerType mod = m->CreateMarker();
		for(INMOST_DATA_ENUM_TYPE k = 0; k < num; k++)
		{
			assert( GetHandleElementType(adjacent[k]) == (GetElementType() >> 1) ); //only lower dimension elements can be connected
			assert( !(GetHandleElementType(adjacent[k]) == FACE && m->HighConn(adjacent[k]).size() > 1) ); // face already connected to two cells

			m->HighConn(adjacent[k]).push_back(GetHandle());
			//this may be dead slow
			//LowConn().push_back(adjacent[k]);
			if (!m->GetMarker(adjacent[k], mod))
			{
				m->SetMarker(adjacent[k], mod);
				arr[GetHandleElementNum(adjacent[k])].push_back(adjacent[k]);
			}
		}
		adj_type & lc = m->LowConn(GetHandle());
		//TODO:
		//for face have to find positions where to attach edges
		lc.insert(lc.end(),adjacent,adjacent+num);
		if (!m->GetMarker(GetHandle(), mod))
		{
			m->SetMarker(GetHandle(), mod);
			arr[GetElementNum()].push_back(GetHandle());
		}
		//perform fix instead of algorithm above
		if( Element::GetGeometricDimension(m->GetGeometricType(GetHandle())) == 2 )
		{
			if( GetElementType() == CELL ) 
			{
				getAsCell()->FixEdgeOrder();
			}
			else if( GetElementType() == FACE ) 
			{
				if( getAsFace()->FixEdgeOrder() )
					getAsFace()->FixNormalOrientation();
			}
		}
		/*
		if( GetElementType() == CELL ) //update cell nodes
		{
			//remove me from old nodes
			adj_type & hc = m->HighConn(GetHandle());
			for(adj_type::size_type jt = 0; jt < hc.size(); ++jt) //iterate over my nodes
			{
				adj_type & ilc = m->LowConn(hc[jt]);
				adj_iterator kt = ilc.begin(); 
				while(kt != ilc.end()) //iterate over nodes's cells
				{
					if( (*kt) == GetHandle() ) // if nodes's cell is equal to modified cell, then remove connection
					{
						kt = ilc.erase(kt);
						break;
					}
					else kt++;
				}
			}
			hc.clear(); //disconnect cell from all of it's nodes
			if( !lc.empty() )
			{
				ElementArray<Node> newnodes(m);
				ComputeGeometricType();
				m->RestoreCellNodes(GetHandle(),newnodes); //find new nodes of the cell
				hc.insert(hc.end(),newnodes.begin(),newnodes.end()); //connect to new nodes
				//add me to my new nodes
				for(adj_type::size_type jt = 0; jt < hc.size(); ++jt) m->LowConn(hc[jt]).push_back(GetHandle());
			}
		}
		else ComputeGeometricType();
		*/
		//if element placed below on ierarhy was modified, then all upper elements
		//should be also modified, start from lowest elements in ierarchy and go up
		for (ElementType etype = NODE; etype <= CELL; etype = etype << 1)
		{
			int el_num = ElementNum(etype);
			for (dynarray<HandleType, 64>::size_type it = 0; it < arr[el_num].size(); it++)
			{
				assert(GetHandleElementType(arr[el_num][it]) == etype);
				if (etype < CELL) //check for upper adjacencies of current element
				{
					//check all upper adjacencies that may be affected by modification of me
					adj_type & hc = m->HighConn(arr[el_num][it]);
					for (adj_type::size_type jt = 0; jt < hc.size(); ++jt)
					{
						if (!m->GetMarker(hc[jt], mod))
						{
							m->SetMarker(hc[jt], mod);
							arr[GetHandleElementNum(hc[jt])].push_back(hc[jt]);
						}
					}
					m->ComputeGeometricType(arr[el_num][it]);
				}
				else //update nodes for current cell
				{
					//remove me from old nodes
					adj_type & hc = m->HighConn(arr[el_num][it]);
					for (adj_iterator jt = hc.begin(); jt != hc.end(); ++jt) //iterate over my nodes
					{
						adj_type & lc = m->LowConn(*jt);
						adj_iterator kt = lc.begin();
						while (kt != lc.end()) //iterate over nodes's cells
						{
							if ((*kt) == arr[el_num][it]) // if nodes's cell is equal to modified cell, then remove connection
							{
								kt = lc.erase(kt);
								break;
							}
							else kt++;
						}
					}
					hc.clear(); //disconnect cell from all of it's nodes
					m->ComputeGeometricType(arr[el_num][it]);
					if (!m->LowConn(arr[el_num][it]).empty())
					{
						ElementArray<Node> newnodes(m);
						m->RestoreCellNodes(arr[el_num][it], newnodes); //find new nodes of the cell
						hc.insert(hc.end(), newnodes.begin(), newnodes.end()); //connect to new nodes
						//add me to my new nodes
						for (adj_iterator jt = hc.begin(); jt != hc.end(); ++jt)
							m->LowConn(*jt).push_back(arr[el_num][it]);
					}
				}
				m->RecomputeGeometricData(arr[el_num][it]);
				m->RemMarker(arr[el_num][it], mod);
			}
		}
		m->ReleaseMarker(mod);
	}
}




#endif