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
5ecbad34
"README.txt" did not exist on "bf2300fdcfee73248131f9622fa95695c2b6eed8"
Commit
5ecbad34
authored
16 years ago
by
Christophe Geuzaine
Browse files
Options
Downloads
Patches
Plain Diff
patch for diff
parent
30dd0749
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
Geo/GModelIO_Mesh.cpp
+41
-38
41 additions, 38 deletions
Geo/GModelIO_Mesh.cpp
with
41 additions
and
38 deletions
Geo/GModelIO_Mesh.cpp
+
41
−
38
View file @
5ecbad34
...
@@ -873,7 +873,7 @@ static int readElementsVRML(FILE *fp, std::vector<MVertex*> &vertexVector, int r
...
@@ -873,7 +873,7 @@ static int readElementsVRML(FILE *fp, std::vector<MVertex*> &vertexVector, int r
return
0
;
return
0
;
}
}
Msg
::
Info
(
"%d elements"
,
elements
[
0
][
region
].
size
()
+
Msg
::
Info
(
"%d elements"
,
elements
[
0
][
region
].
size
()
+
elements
[
1
][
region
].
size
()
+
elements
[
2
][
region
].
size
());
elements
[
1
][
region
].
size
()
+
elements
[
2
][
region
].
size
());
return
1
;
return
1
;
}
}
...
@@ -2170,31 +2170,39 @@ int GModel::writeDIFF(const std::string &name, bool binary, bool saveAll,
...
@@ -2170,31 +2170,39 @@ int GModel::writeDIFF(const std::string &name, bool binary, bool saveAll,
if
(
noPhysicalGroups
())
saveAll
=
true
;
if
(
noPhysicalGroups
())
saveAll
=
true
;
// get all the entities in the model
std
::
vector
<
GEntity
*>
entities
;
getEntities
(
entities
);
// get the number of vertices and index the vertices in a continuous
// get the number of vertices and index the vertices in a continuous
// sequence
// sequence
int
numVertices
=
indexMeshVertices
(
saveAll
);
int
numVertices
=
indexMeshVertices
(
saveAll
);
std
::
list
<
int
>
vertices_tag
[
numVertices
];
for
(
unsigned
int
i
=
0
;
i
<
entities
.
size
();
i
++
){
// tag the vertices according to which surface they belong to (Note
if
(
entities
[
i
]
->
physicals
.
size
()
||
saveAll
){
// that we use a brute force approach here, so that we can deal with
std
::
list
<
GFace
*>
lf
=
entities
[
i
]
->
faces
();
// models with incomplete topology. For example, when we merge 2 STL
std
::
list
<
GFace
*>::
iterator
it
=
lf
.
begin
();
// triangulations we don't have the boundary information between the
for
(
unsigned
int
k
=
0
;
k
<
lf
.
size
();
k
++
){
// faces, and the vertices would end up categorized on either one.)
for
(
unsigned
int
l
=
0
;
l
<
(
*
it
)
->
mesh_vertices
.
size
();
l
++
)
std
::
list
<
int
>
vertexTags
[
numVertices
],
boundaryIndicators
;
vertices_tag
[(
*
it
)
->
mesh_vertices
[
l
]
->
getIndex
()
-
1
].
push_back
((
*
it
)
->
tag
());
int
numBoundaryIndicators
=
0
;
it
++
;
for
(
riter
it
=
firstRegion
();
it
!=
lastRegion
();
it
++
){
std
::
list
<
GFace
*>
faces
=
(
*
it
)
->
faces
();
for
(
std
::
list
<
GFace
*>::
iterator
itf
=
faces
.
begin
();
itf
!=
faces
.
end
();
itf
++
){
GFace
*
gf
=
*
itf
;
boundaryIndicators
.
push_back
(
gf
->
tag
());
for
(
unsigned
int
i
=
0
;
i
<
gf
->
getNumMeshElements
();
i
++
){
MElement
*
e
=
gf
->
getMeshElement
(
i
);
for
(
unsigned
int
j
=
0
;
j
<
e
->
getNumVertices
();
j
++
)
vertexTags
[
e
->
getVertex
(
j
)
->
getIndex
()
-
1
].
push_back
(
gf
->
tag
());
}
}
}
}
}
}
for
(
unsigned
int
i
=
0
;
i
<
numVertices
;
i
++
)
boundaryIndicators
.
sort
();
{
boundaryIndicators
.
unique
();
vertices_tag
[
i
].
unique
();
for
(
int
i
=
0
;
i
<
numVertices
;
i
++
){
vertices_tag
[
i
].
sort
();
// optional
vertexTags
[
i
].
sort
();
}
vertexTags
[
i
].
unique
();
}
// get all the entities in the model
std
::
vector
<
GEntity
*>
entities
;
getEntities
(
entities
);
// loop over all elements we need to save
// loop over all elements we need to save
int
numElements
=
0
,
maxNumNodesPerElement
=
0
;
int
numElements
=
0
,
maxNumNodesPerElement
=
0
;
...
@@ -2219,16 +2227,11 @@ int GModel::writeDIFF(const std::string &name, bool binary, bool saveAll,
...
@@ -2219,16 +2227,11 @@ int GModel::writeDIFF(const std::string &name, bool binary, bool saveAll,
fprintf
(
fp
,
" Max number of nodes in an element: %d
\n
"
,
maxNumNodesPerElement
);
fprintf
(
fp
,
" Max number of nodes in an element: %d
\n
"
,
maxNumNodesPerElement
);
fprintf
(
fp
,
" Only one subdomain el : dpFALSE
\n
"
);
fprintf
(
fp
,
" Only one subdomain el : dpFALSE
\n
"
);
fprintf
(
fp
,
" Lattice data ? 0
\n\n\n\n
"
);
fprintf
(
fp
,
" Lattice data ? 0
\n\n\n\n
"
);
int
nbi
=
getNumFaces
();
fprintf
(
fp
,
" %d Boundary indicators: "
,
boundaryIndicators
.
size
());
fprintf
(
fp
,
" %d Boundary indicators: "
,
nbi
);
for
(
std
::
list
<
int
>::
iterator
it
=
boundaryIndicators
.
begin
();
for
(
fiter
it
=
firstFace
();
it
!=
lastFace
();
++
it
){
it
!=
boundaryIndicators
.
end
();
it
++
)
// Jacques: are you sure about this? "nbi" might not reflect the
fprintf
(
fp
,
" %d"
,
*
it
);
// number of tags written if saveAll==false...
if
(
saveAll
||
(
*
it
)
->
physicals
.
size
()){
fprintf
(
fp
,
" %d"
,
(
*
it
)
->
tag
());
}
}
fprintf
(
fp
,
"
\n\n\n
"
);
fprintf
(
fp
,
"
\n\n\n
"
);
fprintf
(
fp
,
" Nodal coordinates and nodal boundary indicators,
\n
"
);
fprintf
(
fp
,
" Nodal coordinates and nodal boundary indicators,
\n
"
);
fprintf
(
fp
,
" the columns contain:
\n
"
);
fprintf
(
fp
,
" the columns contain:
\n
"
);
...
@@ -2237,19 +2240,19 @@ int GModel::writeDIFF(const std::string &name, bool binary, bool saveAll,
...
@@ -2237,19 +2240,19 @@ int GModel::writeDIFF(const std::string &name, bool binary, bool saveAll,
fprintf
(
fp
,
" - no of boundary indicators that are set (ON)
\n
"
);
fprintf
(
fp
,
" - no of boundary indicators that are set (ON)
\n
"
);
fprintf
(
fp
,
" - the boundary indicators that are set (ON) if any.
\n
"
);
fprintf
(
fp
,
" - the boundary indicators that are set (ON) if any.
\n
"
);
fprintf
(
fp
,
"#
\n
"
);
fprintf
(
fp
,
"#
\n
"
);
// write mesh vertices
// write mesh vertices
for
(
unsigned
int
i
=
0
;
i
<
entities
.
size
();
i
++
)
for
(
unsigned
int
i
=
0
;
i
<
entities
.
size
();
i
++
)
{
for
(
unsigned
int
j
=
0
;
j
<
entities
[
i
]
->
mesh_vertices
.
size
();
j
++
){
for
(
unsigned
int
j
=
0
;
j
<
entities
[
i
]
->
mesh_vertices
.
size
();
j
++
){
entities
[
i
]
->
mesh_vertices
[
j
]
->
writeDIFF
(
fp
,
binary
,
scalingFactor
);
MVertex
*
v
=
entities
[
i
]
->
mesh_vertices
[
j
];
fprintf
(
fp
,
" [%d] "
,
vertices_tag
[
entities
[
i
]
->
mesh_vertices
[
j
]
->
getIndex
()
-
1
].
size
());
v
->
writeDIFF
(
fp
,
binary
,
scalingFactor
);
std
::
list
<
int
>::
iterator
it
=
vertices_tag
[
entities
[
i
]
->
mesh_vertices
[
j
]
->
getIndex
()
-
1
].
begin
();
fprintf
(
fp
,
" [%d] "
,
vertexTags
[
v
->
getIndex
()
-
1
].
size
());
for
(
unsigned
k
=
0
;
k
<
vertices_tag
[
entities
[
i
]
->
mesh_vertices
[
j
]
->
getIndex
()
-
1
].
size
();
k
++
){
for
(
std
::
list
<
int
>::
iterator
it
=
vertexTags
[
v
->
getIndex
()
-
1
].
begin
();
fprintf
(
fp
,
" %d "
,
(
*
it
));
it
!=
vertexTags
[
v
->
getIndex
()
-
1
].
end
();
it
++
)
it
++
;
fprintf
(
fp
,
" %d "
,
*
it
);
}
fprintf
(
fp
,
"
\n
"
);
fprintf
(
fp
,
"
\n
"
);
}
}
}
fprintf
(
fp
,
"
\n
"
);
fprintf
(
fp
,
"
\n
"
);
fprintf
(
fp
,
"
\n
"
);
fprintf
(
fp
,
"
\n
"
);
...
...
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