Skip to content
GitLab
Explore
Sign in
Register
Primary navigation
Search or go to…
Project
gmsh
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Larry Price
gmsh
Commits
a5387340
Commit
a5387340
authored
15 years ago
by
Jean-François Remacle
Browse files
Options
Downloads
Patches
Plain Diff
*** empty log message ***
parent
43f9a045
No related branches found
No related tags found
No related merge requests found
Changes
3
Expand all
Hide whitespace changes
Inline
Side-by-side
Showing
3 changed files
Geo/MElementCut.cpp
+24
-5
24 additions, 5 deletions
Geo/MElementCut.cpp
Parser/Gmsh.tab.cpp
+2062
-2019
2062 additions, 2019 deletions
Parser/Gmsh.tab.cpp
Parser/Gmsh.y
+72
-64
72 additions, 64 deletions
Parser/Gmsh.y
with
2158 additions
and
2088 deletions
Geo/MElementCut.cpp
+
24
−
5
View file @
a5387340
...
@@ -172,11 +172,30 @@ void MPolygon::_initVertices()
...
@@ -172,11 +172,30 @@ void MPolygon::_initVertices()
}
}
}
}
_vertices
.
push_back
(
edges
.
back
().
getVertex
(
0
));
/*
_vertices.push_back(edges.back().getVertex(0));
_vertices.push_back(edges.back().getVertex(1));
_vertices.push_back(edges.back().getVertex(1));
edges
.
pop_back
();
edges.pop_back();*/
std
::
vector
<
MEdge
>::
iterator
ite
=
edges
.
begin
();
MVertex
*
vINIT
=
ite
->
getVertex
(
0
);
_vertices
.
push_back
(
ite
->
getVertex
(
0
));
_vertices
.
push_back
(
ite
->
getVertex
(
1
));
edges
.
erase
(
ite
);
while
(
edges
.
size
()
>
1
)
{
while
(
edges
.
size
()
>
1
)
{
for
(
int
k
=
edges
.
size
()
-
1
;
k
>=
0
;
k
--
)
{
ite
=
edges
.
begin
()
;
for
(
ite
=
edges
.
begin
();
ite
!=
edges
.
end
();
ite
++
)
{
if
(
ite
->
getVertex
(
0
)
==
_vertices
.
back
())
{
_vertices
.
push_back
(
ite
->
getVertex
(
1
));
edges
.
erase
(
ite
);
break
;
}
else
if
(
ite
->
getVertex
(
1
)
==
_vertices
.
back
())
{
_vertices
.
push_back
(
ite
->
getVertex
(
0
));
edges
.
erase
(
ite
);
break
;
}
}
/*for(int k = edges.size() - 1; k >= 0; k--) {
if(edges[k].getVertex(0) == _vertices.back()){
if(edges[k].getVertex(0) == _vertices.back()){
_vertices.push_back(edges[k].getVertex(1));
_vertices.push_back(edges[k].getVertex(1));
edges.erase(edges.begin() + k);
edges.erase(edges.begin() + k);
...
@@ -186,8 +205,8 @@ void MPolygon::_initVertices()
...
@@ -186,8 +205,8 @@ void MPolygon::_initVertices()
_vertices.push_back(edges[k].getVertex(0));
_vertices.push_back(edges[k].getVertex(0));
edges.erase(edges.begin() + k);
edges.erase(edges.begin() + k);
break;
break;
}
}
printf("no common summit k=%d\n",k);
}
}
*/
}
}
for
(
unsigned
int
i
=
0
;
i
<
_parts
.
size
();
i
++
)
{
for
(
unsigned
int
i
=
0
;
i
<
_parts
.
size
();
i
++
)
{
...
...
This diff is collapsed.
Click to expand it.
Parser/Gmsh.tab.cpp
+
2062
−
2019
View file @
a5387340
This diff is collapsed.
Click to expand it.
Parser/Gmsh.y
+
72
−
64
View file @
a5387340
...
@@ -1721,9 +1721,9 @@ ListOfShapes :
...
@@ -1721,9 +1721,9 @@ ListOfShapes :
// L E V E L S E T
// L E V E L S E T
LevelSet :
LevelSet :
tLevelset t
STRING
'(' FExpr ')' tAFFECT ListOfDouble tEND
tLevelset t
Plane
'(' FExpr ')' tAFFECT ListOfDouble tEND
{
{
if(
!strcmp($2, "plane") &&
List_Nbr($7) == 4){
if(List_Nbr($7) == 4){
int t = (int)$4;
int t = (int)$4;
if(FindLevelSet(t)){
if(FindLevelSet(t)){
yymsg(0, "Levelset %d already exists", t);
yymsg(0, "Levelset %d already exists", t);
...
@@ -1737,7 +1737,67 @@ LevelSet :
...
@@ -1737,7 +1737,67 @@ LevelSet :
Tree_Add(GModel::current()->getGEOInternals()->LevelSets, &l);
Tree_Add(GModel::current()->getGEOInternals()->LevelSets, &l);
}
}
}
}
else if(!strcmp($2, "union")){
else
yymsg(0, "Wrong levelset definition (%d)", $4);
}
| tLevelset tPlane '(' FExpr ')' tAFFECT '{' VExpr ',' VExpr ',' RecursiveListOfDouble '}' tEND
{
if(List_Nbr($12) == 0){
int t = (int)$4;
if(FindLevelSet(t)){
yymsg(0, "Levelset %d already exists", t);
}
else {
double pt[3] = {$8[0], $8[1], $8[2]};
double n[3] = {$10[0], $10[1], $10[2]};
gLevelset *ls = new gLevelsetPlane(pt, n, t);
LevelSet *l = Create_LevelSet(ls->getTag(), ls);
Tree_Add(GModel::current()->getGEOInternals()->LevelSets, &l);
}
}
else
yymsg(0, "Wrong levelset definition (%d)", $4);
}
| tLevelset tPlane '(' FExpr ')' tAFFECT '{' VExpr ',' VExpr ',' VExpr ',' RecursiveListOfDouble '}' tEND
{
if(List_Nbr($14) == 0){
int t = (int)$4;
if(FindLevelSet(t)){
yymsg(0, "Levelset %d already exists", t);
}
else {
double pt1[3] = {$8[0], $8[1], $8[2]};
double pt2[3] = {$10[0], $10[1], $10[2]};
double pt3[3] = {$12[0], $12[1], $12[2]};
gLevelset *ls = new gLevelsetPlane(pt1, pt2, pt3, t);
LevelSet *l = Create_LevelSet(ls->getTag(), ls);
Tree_Add(GModel::current()->getGEOInternals()->LevelSets, &l);
}
}
else
yymsg(0, "Wrong levelset definition (%d)", $4);
}
| tLevelset tSphere '(' FExpr ')' tAFFECT '{' VExpr ',' RecursiveListOfDouble '}' tEND
{
if(List_Nbr($10) == 1){
int t = (int)$4;
if(FindLevelSet(t)){
yymsg(0, "Levelset %d already exists", t);
}
else {
double d;
List_Read($10, 0, &d);
gLevelset *ls = new gLevelsetSphere($8[0], $8[1], $8[2], d, t);
LevelSet *l = Create_LevelSet(ls->getTag(), ls);
Tree_Add(GModel::current()->getGEOInternals()->LevelSets, &l);
}
}
else
yymsg(0, "Wrong levelset definition (%d)", $4);
}
| tLevelset tSTRING '(' FExpr ')' tAFFECT ListOfDouble tEND
{
if(!strcmp($2, "Union")){
int t = (int)$4;
int t = (int)$4;
if(FindLevelSet(t)){
if(FindLevelSet(t)){
yymsg(0, "Levelset %d already exists", t);
yymsg(0, "Levelset %d already exists", t);
...
@@ -1755,7 +1815,7 @@ LevelSet :
...
@@ -1755,7 +1815,7 @@ LevelSet :
Tree_Add(GModel::current()->getGEOInternals()->LevelSets, &l);
Tree_Add(GModel::current()->getGEOInternals()->LevelSets, &l);
}
}
}
}
else if(!strcmp($2, "
i
ntersection")){
else if(!strcmp($2, "
I
ntersection")){
int t = (int)$4;
int t = (int)$4;
if(FindLevelSet(t)){
if(FindLevelSet(t)){
yymsg(0, "Levelset %d already exists", t);
yymsg(0, "Levelset %d already exists", t);
...
@@ -1773,7 +1833,7 @@ LevelSet :
...
@@ -1773,7 +1833,7 @@ LevelSet :
Tree_Add(GModel::current()->getGEOInternals()->LevelSets, &l);
Tree_Add(GModel::current()->getGEOInternals()->LevelSets, &l);
}
}
}
}
else if(!strcmp($2, "
c
ut")){
else if(!strcmp($2, "
C
ut")){
int t = (int)$4;
int t = (int)$4;
if(FindLevelSet(t)){
if(FindLevelSet(t)){
yymsg(0, "Levelset %d already exists", t);
yymsg(0, "Levelset %d already exists", t);
...
@@ -1791,7 +1851,7 @@ LevelSet :
...
@@ -1791,7 +1851,7 @@ LevelSet :
Tree_Add(GModel::current()->getGEOInternals()->LevelSets, &l);
Tree_Add(GModel::current()->getGEOInternals()->LevelSets, &l);
}
}
}
}
else if(!strcmp($2, "
c
rack")){
else if(!strcmp($2, "
C
rack")){
int t = (int)$4;
int t = (int)$4;
if(FindLevelSet(t)){
if(FindLevelSet(t)){
yymsg(0, "Levelset %d already exists", t);
yymsg(0, "Levelset %d already exists", t);
...
@@ -1815,7 +1875,7 @@ LevelSet :
...
@@ -1815,7 +1875,7 @@ LevelSet :
}
}
| tLevelset tSTRING '{' FExpr '}' tEND
| tLevelset tSTRING '{' FExpr '}' tEND
{
{
if(!strcmp($2, "
c
utMesh")){
if(!strcmp($2, "
C
utMesh")){
int t = (int)$4;
int t = (int)$4;
GModel *GM = GModel::current();
GModel *GM = GModel::current();
GM->buildCutGModel(FindLevelSet(t)->ls);
GM->buildCutGModel(FindLevelSet(t)->ls);
...
@@ -1825,40 +1885,8 @@ LevelSet :
...
@@ -1825,40 +1885,8 @@ LevelSet :
yymsg(0, "Wrong levelset definition");
yymsg(0, "Wrong levelset definition");
Free($2);
Free($2);
}
}
| tLevelset tSTRING '(' FExpr ')' tAFFECT '{' VExpr ',' ListOfDouble '}' tEND
{
if(!strcmp($2, "sphere") && List_Nbr($10) == 1){
int t = (int)$4;
if(FindLevelSet(t)){
yymsg(0, "Levelset %d already exists", t);
}
else {
double d;
List_Read($10, 0, &d);
gLevelset *ls = new gLevelsetSphere($8[0], $8[1], $8[2], d, t);
LevelSet *l = Create_LevelSet(ls->getTag(), ls);
Tree_Add(GModel::current()->getGEOInternals()->LevelSets, &l);
}
}
else
yymsg(0, "Wrong levelset definition (%d)", $4);
Free($2);
}
| tLevelset tSTRING '(' FExpr ')' tAFFECT '{' VExpr ',' VExpr ',' ListOfDouble '}' tEND
| tLevelset tSTRING '(' FExpr ')' tAFFECT '{' VExpr ',' VExpr ',' ListOfDouble '}' tEND
{
{
if(!strcmp($2, "Plane") && List_Nbr($12) == 0){
int t = (int)$4;
if(FindLevelSet(t)){
yymsg(0, "Levelset %d already exists", t);
}
else {
double pt[3] = {$8[0], $8[1], $8[2]};
double n[3] = {$10[0], $10[1], $10[2]};
gLevelset *ls = new gLevelsetPlane(pt, n, t);
LevelSet *l = Create_LevelSet(ls->getTag(), ls);
Tree_Add(GModel::current()->getGEOInternals()->LevelSets, &l);
}
}
if(!strcmp($2, "Cylinder") && List_Nbr($12) == 1){
if(!strcmp($2, "Cylinder") && List_Nbr($12) == 1){
int t = (int)$4;
int t = (int)$4;
if(FindLevelSet(t)){
if(FindLevelSet(t)){
...
@@ -1874,7 +1902,7 @@ LevelSet :
...
@@ -1874,7 +1902,7 @@ LevelSet :
Tree_Add(GModel::current()->getGEOInternals()->LevelSets, &l);
Tree_Add(GModel::current()->getGEOInternals()->LevelSets, &l);
}
}
}
}
if(!strcmp($2, "Cone") && List_Nbr($12) == 1){
else
if(!strcmp($2, "Cone") && List_Nbr($12) == 1){
int t = (int)$4;
int t = (int)$4;
if(FindLevelSet(t)){
if(FindLevelSet(t)){
yymsg(0, "Levelset %d already exists", t);
yymsg(0, "Levelset %d already exists", t);
...
@@ -1889,7 +1917,7 @@ LevelSet :
...
@@ -1889,7 +1917,7 @@ LevelSet :
Tree_Add(GModel::current()->getGEOInternals()->LevelSets, &l);
Tree_Add(GModel::current()->getGEOInternals()->LevelSets, &l);
}
}
}
}
if(!strcmp($2, "Cylinder") && List_Nbr($12) == 2){
else
if(!strcmp($2, "Cylinder") && List_Nbr($12) == 2){
int t = (int)$4;
int t = (int)$4;
if(FindLevelSet(t)){
if(FindLevelSet(t)){
yymsg(0, "Levelset %d already exists", t);
yymsg(0, "Levelset %d already exists", t);
...
@@ -1905,7 +1933,7 @@ LevelSet :
...
@@ -1905,7 +1933,7 @@ LevelSet :
Tree_Add(GModel::current()->getGEOInternals()->LevelSets, &l);
Tree_Add(GModel::current()->getGEOInternals()->LevelSets, &l);
}
}
}
}
if(!strcmp($2, "Cylinder") && List_Nbr($12) == 3){
else
if(!strcmp($2, "Cylinder") && List_Nbr($12) == 3){
int t = (int)$4;
int t = (int)$4;
if(FindLevelSet(t)){
if(FindLevelSet(t)){
yymsg(0, "Levelset %d already exists", t);
yymsg(0, "Levelset %d already exists", t);
...
@@ -1921,7 +1949,7 @@ LevelSet :
...
@@ -1921,7 +1949,7 @@ LevelSet :
Tree_Add(GModel::current()->getGEOInternals()->LevelSets, &l);
Tree_Add(GModel::current()->getGEOInternals()->LevelSets, &l);
}
}
}
}
if(!strcmp($2, "Ellips") && List_Nbr($12) == 3){
else
if(!strcmp($2, "Ellips
oid
") && List_Nbr($12) == 3){
int t = (int)$4;
int t = (int)$4;
if(FindLevelSet(t)){
if(FindLevelSet(t)){
yymsg(0, "Levelset %d already exists", t);
yymsg(0, "Levelset %d already exists", t);
...
@@ -1937,7 +1965,7 @@ LevelSet :
...
@@ -1937,7 +1965,7 @@ LevelSet :
Tree_Add(GModel::current()->getGEOInternals()->LevelSets, &l);
Tree_Add(GModel::current()->getGEOInternals()->LevelSets, &l);
}
}
}
}
if(!strcmp($2, "Quadric") && List_Nbr($12) == 5){
else
if(!strcmp($2, "Quadric") && List_Nbr($12) == 5){
int t = (int)$4;
int t = (int)$4;
if(FindLevelSet(t)){
if(FindLevelSet(t)){
yymsg(0, "Levelset %d already exists", t);
yymsg(0, "Levelset %d already exists", t);
...
@@ -1957,26 +1985,6 @@ LevelSet :
...
@@ -1957,26 +1985,6 @@ LevelSet :
yymsg(0, "Wrong levelset definition (%d)", $4);
yymsg(0, "Wrong levelset definition (%d)", $4);
Free($2);
Free($2);
}
}
| tLevelset tSTRING '(' FExpr ')' tAFFECT '{' VExpr ',' VExpr ',' VExpr ',' ListOfDouble '}' tEND
{
if(!strcmp($2, "Plane") && List_Nbr($14) == 0){
int t = (int)$4;
if(FindLevelSet(t)){
yymsg(0, "Levelset %d already exists", t);
}
else {
double pt1[3] = {$8[0], $8[1], $8[2]};
double pt2[3] = {$10[0], $10[1], $10[2]};
double pt3[3] = {$12[0], $12[1], $12[2]};
gLevelset *ls = new gLevelsetPlane(pt1, pt2, pt3, t);
LevelSet *l = Create_LevelSet(ls->getTag(), ls);
Tree_Add(GModel::current()->getGEOInternals()->LevelSets, &l);
}
}
else
yymsg(0, "Wrong levelset definition (%d)", $4);
Free($2);
}
;
;
// D E L E T E
// D E L E T E
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment