OilfieldToolsNet/ResInsight
4
0
Fork 0
mirror of https://github.com/OPM/ResInsight.git synced 2025-02-25 18:55:39 -06:00
Code Issues Packages Projects Releases Wiki Activity

Fixes by misspell-fixer

Browse Source
This commit is contained in:
github-actions[bot]
2020-06-03 20:31:58 +00:00
committed by Magne Sjaastad
parent 490dc1aa05
commit 674b764cb6
63 changed files with 143 additions and 143 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
ApplicationCode/ReservoirDataModel/RigCaseCellResultsData.cpp
View File

@@ -1361,7 +1361,7 @@ size_t RigCaseCellResultsData::findOrLoadKnownScalarResult( const RigEclipseResu
// Add one more result to result container
size_t timeStepCount = this->infoForEachResultIndex()[scalarResultIndex].timeStepInfos().size();
bool resultLoadingSucess = true;
bool resultLoadingSuccess = true;
size_t tempGridCellCount = m_ownerMainGrid->totalTemporaryGridCellCount();
@@ -1375,7 +1375,7 @@ size_t RigCaseCellResultsData::findOrLoadKnownScalarResult( const RigEclipseResu
std::vector<double>& values = m_cellScalarResults[scalarResultIndex][i];
if ( !m_readerInterface->dynamicResult( resultName, m_porosityModel, i, &values ) )
{
resultLoadingSucess = false;
resultLoadingSuccess = false;
}
else if ( tempGridCellCount > 0 )
{
@@ -1395,7 +1395,7 @@ size_t RigCaseCellResultsData::findOrLoadKnownScalarResult( const RigEclipseResu
std::vector<double>& values = m_cellScalarResults[scalarResultIndex][0];
if ( !m_readerInterface->staticResult( resultName, m_porosityModel, &values ) )
{
resultLoadingSucess = false;
resultLoadingSuccess = false;
}
else if ( tempGridCellCount > 0 )
{
@@ -1408,7 +1408,7 @@ size_t RigCaseCellResultsData::findOrLoadKnownScalarResult( const RigEclipseResu
}
}
if ( !resultLoadingSucess )
if ( !resultLoadingSuccess )
{
// Remove last scalar result because loading of result failed
m_cellScalarResults[scalarResultIndex].clear();
@@ -1549,7 +1549,7 @@ size_t RigCaseCellResultsData::findOrLoadKnownScalarResultForTimeStep( const Rig
{
size_t timeStepCount = this->infoForEachResultIndex()[scalarResultIndex].timeStepInfos().size();
bool resultLoadingSucess = true;
bool resultLoadingSuccess = true;
if ( type == RiaDefines::ResultCatType::DYNAMIC_NATIVE && timeStepCount > 0 )
{
@@ -1560,7 +1560,7 @@ size_t RigCaseCellResultsData::findOrLoadKnownScalarResultForTimeStep( const Rig
{
if ( !m_readerInterface->dynamicResult( resultName, m_porosityModel, timeStepIndex, &values ) )
{
resultLoadingSucess = false;
resultLoadingSuccess = false;
}
}
}
@@ -1571,11 +1571,11 @@ size_t RigCaseCellResultsData::findOrLoadKnownScalarResultForTimeStep( const Rig
std::vector<double>& values = m_cellScalarResults[scalarResultIndex][0];
if ( !m_readerInterface->staticResult( resultName, m_porosityModel, &values ) )
{
resultLoadingSucess = false;
resultLoadingSuccess = false;
}
}
if ( !resultLoadingSucess )
if ( !resultLoadingSuccess )
{
// Error logging
CVF_ASSERT( false );
@@ -2199,7 +2199,7 @@ void RigCaseCellResultsData::computeRiTransComponent( const QString& riTransComp
}
else
{
faceAreaVec = nativeCell.faceNormalWithAreaLenght( faceId );
faceAreaVec = nativeCell.faceNormalWithAreaLength( faceId );
}
if ( !isFaceNormalsOutwards ) faceAreaVec = -faceAreaVec;
@@ -2647,7 +2647,7 @@ void RigCaseCellResultsData::computeRiTRANSbyAreaComponent( const QString& riTra
}
else
{
faceAreaVec = nativeCell.faceNormalWithAreaLenght( faceId );
faceAreaVec = nativeCell.faceNormalWithAreaLength( faceId );
}
double areaOfOverlap = faceAreaVec.length();
@@ -3112,7 +3112,7 @@ void RigCaseCellResultsData::computeAllanResults( RigCaseCellResultsData* cellRe
auto fnBinAllanResAddr = RigEclipseResultAddress( RiaDefines::ResultCatType::ALLAN_DIAGRAMS,
RiaDefines::formationBinaryAllanResultName() );
// Create and retreive nnc result arrays
// Create and retrieve nnc result arrays
std::vector<double>& fnAllanNncResults =
mainGrid->nncData()->makeStaticConnectionScalarResult( RiaDefines::formationAllanResultName() );

2
ApplicationCode/ReservoirDataModel/RigCaseToCaseCellMapperTools.cpp
View File

@@ -405,7 +405,7 @@ void RigCaseToCaseCellMapperTools::rotateCellTopologicallyToMatchBaseCell( const
flipQuadWinding( femDeepestQuad );
}
// We now need to rotate the fem quads to be alligned with the ecl quads
// We now need to rotate the fem quads to be aligned with the ecl quads
// Since the start point of the quad always is aligned with the opposite face-quad start
// we can find the rotation for the top, and apply it to both top and bottom

2
ApplicationCode/ReservoirDataModel/RigCaseToCaseRangeFilterMapper.cpp
View File

@@ -89,7 +89,7 @@ void RigCaseToCaseRangeFilterMapper::convertRangeFilter( const RimCellRangeFilte
src.StartJ = srcFilter->startIndexJ() - 1;
src.StartK = srcFilter->startIndexK() - 1;
// Needs to subtract one more to have the end idx beeing
// Needs to subtract one more to have the end idx being
// the last cell in the selection, not the first outside
src.EndI = src.StartI + srcFilter->cellCountI() - 1;
src.EndJ = src.StartJ + srcFilter->cellCountJ() - 1;

20
ApplicationCode/ReservoirDataModel/RigCell.cpp
View File

@@ -207,19 +207,19 @@ bool RigCell::isLongPyramidCell( double maxHeightFactor, double nodeNearToleranc
// Check the ratio of the length of opposite edges.
// both ratios have to be above threshold to detect a pyramid-ish cell
// Only test this if we have all nonzero edge lenghts.
// Only test this if we have all nonzero edge lengths.
else if ( zeroLengthEdgeCount == 0 ) // If the four first faces are ok, the two last must be as well
{
double e0SquareLenght = ( c1 - c0 ).lengthSquared();
double e2SquareLenght = ( c3 - c2 ).lengthSquared();
if ( e0SquareLenght / e2SquareLenght > squaredMaxHeightFactor ||
e2SquareLenght / e0SquareLenght > squaredMaxHeightFactor )
double e0SquareLength = ( c1 - c0 ).lengthSquared();
double e2SquareLength = ( c3 - c2 ).lengthSquared();
if ( e0SquareLength / e2SquareLength > squaredMaxHeightFactor ||
e2SquareLength / e0SquareLength > squaredMaxHeightFactor )
{
double e1SquareLenght = ( c2 - c1 ).lengthSquared();
double e3SquareLenght = ( c0 - c3 ).lengthSquared();
double e1SquareLength = ( c2 - c1 ).lengthSquared();
double e3SquareLength = ( c0 - c3 ).lengthSquared();
if ( e1SquareLenght / e3SquareLenght > squaredMaxHeightFactor ||
e3SquareLenght / e1SquareLenght > squaredMaxHeightFactor )
if ( e1SquareLength / e3SquareLength > squaredMaxHeightFactor ||
e3SquareLength / e1SquareLength > squaredMaxHeightFactor )
{
return true;
}
@@ -316,7 +316,7 @@ cvf::Vec3d RigCell::faceCenter( cvf::StructGridInterface::FaceType face ) const
/// the corresponding plane.
/// See http://geomalgorithms.com/a01-_area.html
//--------------------------------------------------------------------------------------------------
cvf::Vec3d RigCell::faceNormalWithAreaLenght( cvf::StructGridInterface::FaceType face ) const
cvf::Vec3d RigCell::faceNormalWithAreaLength( cvf::StructGridInterface::FaceType face ) const
{
cvf::ubyte faceVertexIndices[4];
cvf::StructGridInterface::cellFaceVertexIndices( face, faceVertexIndices );

2
ApplicationCode/ReservoirDataModel/RigCell.h
View File

@@ -70,7 +70,7 @@ public:
cvf::Vec3d center() const;
cvf::Vec3d faceCenter( cvf::StructGridInterface::FaceType face ) const;
cvf::Vec3d faceNormalWithAreaLenght( cvf::StructGridInterface::FaceType face ) const;
cvf::Vec3d faceNormalWithAreaLength( cvf::StructGridInterface::FaceType face ) const;
double volume() const;
int firstIntersectionPoint( const cvf::Ray& ray, cvf::Vec3d* intersectionPoint ) const;

4
ApplicationCode/ReservoirDataModel/RigFishbonesGeometry.cpp
View File

@@ -107,10 +107,10 @@ void RigFisbonesGeometry::computeLateralPositionAndOrientation( size_t subI
}
{
double intialRotationAngle = m_fishbonesSub->rotationAngle( subIndex );
double initialRotationAngle = m_fishbonesSub->rotationAngle( subIndex );
double lateralOffsetDegrees = 360.0 / m_fishbonesSub->lateralLengths().size();
double lateralOffsetRadians = cvf::Math::toRadians( intialRotationAngle + lateralOffsetDegrees * lateralIndex );
double lateralOffsetRadians = cvf::Math::toRadians( initialRotationAngle + lateralOffsetDegrees * lateralIndex );
cvf::Mat4d lateralOffsetMatrix = cvf::Mat4d::fromRotation( alongWellPath, lateralOffsetRadians );

2
ApplicationCode/ReservoirDataModel/RigGeoMechWellLogExtractor.cpp
View File

@@ -1123,7 +1123,7 @@ cvf::Vec3f RigGeoMechWellLogExtractor::cellCentroid( size_t intersectionIdx ) co
size_t elmIdx = m_intersectedCellsGlobIdx[intersectionIdx];
RigElementType elmType = femPart->elementType( elmIdx );
int elementNodeCount = RigFemTypes::elmentNodeCount( elmType );
int elementNodeCount = RigFemTypes::elementNodeCount( elmType );
const int* elmNodeIndices = femPart->connectivities( elmIdx );

2
ApplicationCode/ReservoirDataModel/RigGridBase.cpp
View File

@@ -147,7 +147,7 @@ void RigGridBase::initSubCellsMainGridCellIndex()
}
//--------------------------------------------------------------------------------------------------
/// For main grid, this will work with reservoirCellIndices retreiving the correct lgr cells as well.
/// For main grid, this will work with reservoirCellIndices retrieving the correct lgr cells as well.
/// the cell() call retreives correct cell, because main grid has offset of 0, and we access the global
/// cell array in main grid.
//--------------------------------------------------------------------------------------------------

2
ApplicationCode/ReservoirDataModel/RigMainGrid.cpp
View File

@@ -643,7 +643,7 @@ bool RigMainGrid::isFaceNormalsOutwards() const
{
cvf::Vec3d cellCenter = m_cells[gcIdx].center();
cvf::Vec3d faceCenter = m_cells[gcIdx].faceCenter( StructGridInterface::POS_I );
cvf::Vec3d faceNormal = m_cells[gcIdx].faceNormalWithAreaLenght( StructGridInterface::POS_I );
cvf::Vec3d faceNormal = m_cells[gcIdx].faceNormalWithAreaLength( StructGridInterface::POS_I );
double typicalIJCellSize = characteristicIJCellSize();
double dummy, dummy2, typicalKSize;

2
ApplicationCode/ReservoirDataModel/RigSimWellData.cpp
View File

@@ -223,7 +223,7 @@ void RigSimWellData::computeStaticWellCellPath() const
// Now find all result cells in ranges between pairs in the static path
// If the result has items that "compete" with those in the static path,
// those items are inserted after the ones in the static path. This
// is not neccesarily correct. They could be in front, and also merged in
// is not necessarily correct. They could be in front, and also merged in
// strange ways. A geometric test could make this more robust, but we will
// not solve before we see that it actually ends up as a problem

8
ApplicationCode/ReservoirDataModel/RigWellLogExtractor.cpp
View File

@@ -114,15 +114,15 @@ void RigWellLogExtractor::insertIntersectionsInMap( const std::vector<HexInterse
{
for ( size_t intIdx = 0; intIdx < intersections.size(); ++intIdx )
{
double lenghtAlongLineSegment1 = ( intersections[intIdx].m_intersectionPoint - p1 ).length();
double lenghtAlongLineSegment2 = ( p2 - intersections[intIdx].m_intersectionPoint ).length();
double lengthAlongLineSegment1 = ( intersections[intIdx].m_intersectionPoint - p1 ).length();
double lengthAlongLineSegment2 = ( p2 - intersections[intIdx].m_intersectionPoint ).length();
double measuredDepthDiff = md2 - md1;
double lineLength = lenghtAlongLineSegment1 + lenghtAlongLineSegment2;
double lineLength = lengthAlongLineSegment1 + lengthAlongLineSegment2;
double measuredDepthOfPoint = 0.0;
if ( lineLength > 0.00001 )
{
measuredDepthOfPoint = md1 + measuredDepthDiff * lenghtAlongLineSegment1 / ( lineLength );
measuredDepthOfPoint = md1 + measuredDepthDiff * lengthAlongLineSegment1 / ( lineLength );
}
else
{

10
ApplicationCode/ReservoirDataModel/eclLibDocumentedHeaders.h
View File

@@ -198,7 +198,7 @@ int ecl_file_get_num_kw( const ecl_file_type * ecl_fil );
// Check if the keyword exists in the ecl_file structure
bool ecl_file_has_kw( const ecl_file_type * ecl_file , const char * kw);
// Access the list of keyword names occuring in the ecl_file structure
// Access the list of keyword names occurring in the ecl_file structure
int ecl_file_get_num_distinct_kw( const ecl_file_type * ecl_file);
const char * ecl_file_iget_distinct_kw ( const ecl_file_type * ecl_file , int index);
@@ -206,10 +206,10 @@ const char * ecl_file_iget_distinct_kw ( const ecl_file_type * ecl_file , i
const char * ecl_file_get_src_file( const ecl_file_type * ecl_file );
// Get the keyword at "globKWIndex" and return the position it has among the other keywords with same name
int ecl_file_iget_occurence( const ecl_file_type * ecl_file , int globalKWindex);
int ecl_file_iget_occurrence( const ecl_file_type * ecl_file , int globalKWindex);
time_t ecl_file_iget_restart_sim_date( const ecl_file_type * restart_file , int occurence );
time_t ecl_file_iget_restart_sim_date( const ecl_file_type * restart_file , int occurrence );
ecl_version_enum ecl_file_get_ecl_version( const ecl_file_type * file );
int ecl_file_get_restart_index(const ecl_file_type * restart_file , time_t sim_time);
@@ -230,8 +230,8 @@ ecl_file_type * ecl_file_fread_alloc_summary_section(fortio_type * fortio);
ecl_file_type * ecl_file_fread_alloc_RFT_section(fortio_type * fortio);
// Manage ecl_kw instances in the ecl_file structure "manually"
void ecl_file_delete_kw( ecl_file_type * ecl_file , const char * name , int occurence );
void ecl_file_insert_kw( ecl_file_type * ecl_file , ecl_kw_type * ecl_kw , bool after , const char * neighbour_name , int neighbour_occurence );
void ecl_file_delete_kw( ecl_file_type * ecl_file , const char * name , int occurrence );
void ecl_file_insert_kw( ecl_file_type * ecl_file , ecl_kw_type * ecl_kw , bool after , const char * neighbour_name , int neighbour_occurrence );
void ecl_file_replace_kw( ecl_file_type * ecl_file , ecl_kw_type * old_kw , const ecl_kw_type * new_kw , bool insert_copy);
bool ecl_file_has_kw_ptr(const ecl_file_type * ecl_file , const ecl_kw_type * ecl_kw);