Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
I
INMOST
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Kirill Terekhov
INMOST
Commits
d8f7b1e7
Commit
d8f7b1e7
authored
Jan 30, 2015
by
Igor Konshin
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Replace retrive -> retrieve
parent
24f3aaa1
Changes
6
Expand all
Hide whitespace changes
Inline
Side-by-side
Showing
6 changed files
with
42 additions
and
42 deletions
+42
-42
development/mspp_autodiff.h
development/mspp_autodiff.h
+1
-1
examples/FVDiscr/main.cpp
examples/FVDiscr/main.cpp
+1
-1
examples/Solver/main.cpp
examples/Solver/main.cpp
+1
-1
inmost_mesh.h
inmost_mesh.h
+37
-37
inmost_solver.h
inmost_solver.h
+1
-1
solver_ddpqiluc2.hpp
solver_ddpqiluc2.hpp
+1
-1
No files found.
development/mspp_autodiff.h
View file @
d8f7b1e7
...
...
@@ -1519,7 +1519,7 @@ namespace INMOST
}
//! Return the solution for given tag index of given element
INMOST_DATA_REAL_TYPE
GetIndex
(
Storage
*
e
,
INMOST_DATA_ENUM_TYPE
tagind
,
INMOST_DATA_ENUM_TYPE
comp
=
0
)
{
return
e
->
IntegerArray
(
GetDynamicIndexTag
(
tagind
))[
comp
];}
//! Retrive number of components on given element for given tag
//! Retri
e
ve number of components on given element for given tag
INMOST_DATA_ENUM_TYPE
GetComponents
(
Storage
*
e
,
INMOST_DATA_ENUM_TYPE
tagind
)
{
return
e
->
IntegerArray
(
GetDynamicIndexTag
(
tagind
)).
size
();}
enum
Precision
{
Double
,
Single
};
...
...
examples/FVDiscr/main.cpp
View file @
d8f7b1e7
...
...
@@ -266,7 +266,7 @@ int main(int argc,char ** argv)
if
(
cell
->
GetStatus
()
!=
Element
::
Ghost
)
cell
->
Real
(
phi
)
=
x
[
cell
->
Integer
(
id
)];
BARRIER
if
(
m
->
GetProcessorRank
()
==
0
)
std
::
cout
<<
"Retrive data: "
<<
Timer
()
-
ttt
<<
std
::
endl
;
if
(
m
->
GetProcessorRank
()
==
0
)
std
::
cout
<<
"Retri
e
ve data: "
<<
Timer
()
-
ttt
<<
std
::
endl
;
ttt
=
Timer
();
m
->
ExchangeData
(
phi
,
CELL
,
0
);
// Data exchange over processors
...
...
examples/Solver/main.cpp
View file @
d8f7b1e7
...
...
@@ -443,7 +443,7 @@ int main(int argc,char ** argv)
BARRIER
if
(
m
->
GetProcessorRank
()
==
0
)
std
::
cout
<<
"Retrive data: "
<<
Timer
()
-
ttt
<<
std
::
endl
;
if
(
m
->
GetProcessorRank
()
==
0
)
std
::
cout
<<
"Retri
e
ve data: "
<<
Timer
()
-
ttt
<<
std
::
endl
;
ttt
=
Timer
();
m
->
ExchangeData
(
phi
,
CELL
,
0
);
...
...
inmost_mesh.h
View file @
d8f7b1e7
This diff is collapsed.
Click to expand it.
inmost_solver.h
View file @
d8f7b1e7
...
...
@@ -98,7 +98,7 @@ namespace INMOST
/// Restore initial nonparallel state of the Vector.
void
RestoreVector
(
Vector
&
v
)
const
;
/// Retrieve the processor number by binary search for the specified global index.
INMOST_DATA_ENUM_TYPE
GetProcessor
(
INMOST_DATA_ENUM_TYPE
gind
)
const
;
//retrive processor by binary search in global_to_proc
INMOST_DATA_ENUM_TYPE
GetProcessor
(
INMOST_DATA_ENUM_TYPE
gind
)
const
;
//retri
e
ve processor by binary search in global_to_proc
void
GetOverlapRegion
(
INMOST_DATA_ENUM_TYPE
proc
,
INMOST_DATA_ENUM_TYPE
&
mbeg
,
INMOST_DATA_ENUM_TYPE
&
mend
)
const
;
/// Get the local index region for the specified process.
void
GetLocalRegion
(
INMOST_DATA_ENUM_TYPE
proc
,
INMOST_DATA_ENUM_TYPE
&
mbeg
,
INMOST_DATA_ENUM_TYPE
&
mend
)
const
;
...
...
solver_ddpqiluc2.hpp
View file @
d8f7b1e7
...
...
@@ -1270,7 +1270,7 @@ swap_algorithm:
// if (fabs(LU_Diag[k] - LineValues[k]) > 1e-6) std::cout << __LINE__ << " Diagonal value went wrong, good: " << LineValues[k] << " have " << LU_Diag[k] << " line " << k << std::endl;
//#endif
///////////////////////////////////////////////////////////////////////////////////
// Retri
ve diagonal value
//
// Retri
eve diagonal value
//
///////////////////////////////////////////////////////////////////////////////////
#if defined(DIAGONAL_PIVOT)
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment