⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 cell_prism18.c

📁 一个用来实现偏微分方程中网格的计算库
💻 C
📖 第 1 页 / 共 3 页
字号:
			   std::vector<unsigned int>& conn) const{  libmesh_assert (_nodes != NULL);  libmesh_assert (sc < this->n_sub_elem());  libmesh_assert (iop != INVALID_IO_PACKAGE);    switch (iop)    {    case TECPLOT:      {	conn.resize(8);	switch (sc)	  {      	  case 0:	    {	      conn[0] = this->node(0)+1;	      conn[1] = this->node(6)+1;	      conn[2] = this->node(8)+1;	      conn[3] = this->node(8)+1;	      conn[4] = this->node(9)+1;	      conn[5] = this->node(15)+1;	      conn[6] = this->node(17)+1;	      conn[7] = this->node(17)+1;		      return;	    }	  case 1:	    {	      conn[0] = this->node(6)+1;	      conn[1] = this->node(1)+1;	      conn[2] = this->node(7)+1;	      conn[3] = this->node(7)+1;	      conn[4] = this->node(15)+1;	      conn[5] = this->node(10)+1;	      conn[6] = this->node(16)+1;	      conn[7] = this->node(16)+1;		      return;	    }      	  case 2:	    {	      conn[0] = this->node(8)+1;	      conn[1] = this->node(7)+1;	      conn[2] = this->node(2)+1;	      conn[3] = this->node(2)+1;	      conn[4] = this->node(17)+1;	      conn[5] = this->node(16)+1;	      conn[6] = this->node(11)+1;	      conn[7] = this->node(11)+1;		      return;	    }      	  case 3:	    {	      conn[0] = this->node(6)+1;	      conn[1] = this->node(7)+1;	      conn[2] = this->node(8)+1;	      conn[3] = this->node(8)+1;	      conn[4] = this->node(15)+1;	      conn[5] = this->node(16)+1;	      conn[6] = this->node(17)+1;	      conn[7] = this->node(17)+1;		      return;	    }	  case 4:	    {	      conn[0] = this->node(9)+1;	      conn[1] = this->node(15)+1;	      conn[2] = this->node(17)+1;	      conn[3] = this->node(17)+1;	      conn[4] = this->node(3)+1;	      conn[5] = this->node(12)+1;	      conn[6] = this->node(14)+1;	      conn[7] = this->node(14)+1;		      return;	    }	  case 5:	    {	      conn[0] = this->node(15)+1;	      conn[1] = this->node(10)+1;	      conn[2] = this->node(16)+1;	      conn[3] = this->node(16)+1;	      conn[4] = this->node(12)+1;	      conn[5] = this->node(4)+1;	      conn[6] = this->node(13)+1;	      conn[7] = this->node(13)+1;		      return;	    }	  case 6:	    {	      conn[0] = this->node(17)+1;	      conn[1] = this->node(16)+1;	      conn[2] = this->node(11)+1;	      conn[3] = this->node(11)+1;	      conn[4] = this->node(14)+1;	      conn[5] = this->node(13)+1;	      conn[6] = this->node(5)+1;	      conn[7] = this->node(5)+1;		      return;	    }	  case 7:	    {	      conn[0] = this->node(15)+1;	      conn[1] = this->node(16)+1;	      conn[2] = this->node(17)+1;	      conn[3] = this->node(17)+1;	      conn[4] = this->node(12)+1;	      conn[5] = this->node(13)+1;	      conn[6] = this->node(14)+1;	      conn[7] = this->node(14)+1;		      return;	    }	  default:	    libmesh_error();	  }      }    case VTK:      {	conn.resize(6);	switch (sc)	  {      	  case 0:	    {	      conn[0] = this->node(0);	      conn[1] = this->node(6);	      conn[2] = this->node(8);	      conn[3] = this->node(9);	      conn[4] = this->node(15);	      conn[5] = this->node(17);		      return;	    }	  case 1:	    {	      conn[0] = this->node(6);	      conn[1] = this->node(1);	      conn[2] = this->node(7);	      conn[3] = this->node(15);	      conn[4] = this->node(10);	      conn[5] = this->node(16);		      return;	    }      	  case 2:	    {	      conn[0] = this->node(8);	      conn[1] = this->node(7);	      conn[2] = this->node(2);	      conn[3] = this->node(17);	      conn[4] = this->node(16);	      conn[5] = this->node(11);		      return;	    }      	  case 3:	    {	      conn[0] = this->node(6);	      conn[1] = this->node(7);	      conn[2] = this->node(8);	      conn[3] = this->node(15);	      conn[4] = this->node(16);	      conn[5] = this->node(17);		      return;	    }	  case 4:	    {	      conn[0] = this->node(9);	      conn[1] = this->node(15);	      conn[2] = this->node(17);	      conn[3] = this->node(3);	      conn[4] = this->node(12);	      conn[5] = this->node(14);		      return;	    }	  case 5:	    {	      conn[0] = this->node(15);	      conn[1] = this->node(10);	      conn[2] = this->node(16);	      conn[3] = this->node(12);	      conn[4] = this->node(4);	      conn[5] = this->node(13);		      return;	    }	  case 6:	    {	      conn[0] = this->node(17);	      conn[1] = this->node(16);	      conn[2] = this->node(11);	      conn[3] = this->node(14);	      conn[4] = this->node(13);	      conn[5] = this->node(5);		      return;	    }	  case 7:	    {	      conn[0] = this->node(15);	      conn[1] = this->node(16);	      conn[2] = this->node(17);	      conn[3] = this->node(12);	      conn[4] = this->node(13);	      conn[5] = this->node(14);		      return;	    }	  default:	    libmesh_error();	  }      }    default:      libmesh_error();    }  libmesh_error();}unsigned int Prism18::n_second_order_adjacent_vertices (const unsigned int n) const{  switch (n)    {      case 6:      case 7:      case 8:      case 9:      case 10:      case 11:      case 12:      case 13:      case 14:	return 2;      case 15:      case 16:      case 17:	return 4;

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -