From 573a313f467b4897fc89117f30c41db695b6669d Mon Sep 17 00:00:00 2001 From: Mark Olesen Date: Mon, 7 Jan 2019 09:51:45 +0100 Subject: [PATCH] STYLE: deprecate hashedWordList contains() method - identical to found(), which should be used for more consistency. The contains() is a remnant from when hashedWordList was generalized from a speciesTable (OCT 2010) --- .../interfaceCompositionModels/Henry/Henry.C | 2 +- .../Raoult/Raoult.C | 4 +- .../interfaceCompositionModel.C | 12 +-- .../primitives/strings/lists/hashedWordList.H | 56 +++++++----- .../strings/lists/hashedWordListI.H | 89 +++++++++---------- .../basicMultiComponentMixtureI.H | 2 +- .../reaction/Reactions/Reaction/Reaction.C | 12 +-- 7 files changed, 85 insertions(+), 92 deletions(-) diff --git a/applications/solvers/multiphase/reactingEulerFoam/interfacialCompositionModels/interfaceCompositionModels/Henry/Henry.C b/applications/solvers/multiphase/reactingEulerFoam/interfacialCompositionModels/interfaceCompositionModels/Henry/Henry.C index 8ed6e4a0cd..671bfaba4c 100644 --- a/applications/solvers/multiphase/reactingEulerFoam/interfacialCompositionModels/interfaceCompositionModels/Henry/Henry.C +++ b/applications/solvers/multiphase/reactingEulerFoam/interfacialCompositionModels/interfaceCompositionModels/Henry/Henry.C @@ -89,7 +89,7 @@ Foam::interfaceCompositionModels::Henry::Yf const volScalarField& Tf ) const { - if (this->speciesNames_.contains(speciesName)) + if (this->speciesNames_.found(speciesName)) { const label index = this->speciesNames_[speciesName]; diff --git a/applications/solvers/multiphase/reactingEulerFoam/interfacialCompositionModels/interfaceCompositionModels/Raoult/Raoult.C b/applications/solvers/multiphase/reactingEulerFoam/interfacialCompositionModels/interfaceCompositionModels/Raoult/Raoult.C index b178253db5..7a4245275b 100644 --- a/applications/solvers/multiphase/reactingEulerFoam/interfacialCompositionModels/interfaceCompositionModels/Raoult/Raoult.C +++ b/applications/solvers/multiphase/reactingEulerFoam/interfacialCompositionModels/interfaceCompositionModels/Raoult/Raoult.C @@ -121,7 +121,7 @@ Foam::interfaceCompositionModels::Raoult::Yf const volScalarField& Tf ) const { - if (this->speciesNames_.contains(speciesName)) + if (this->speciesNames_.found(speciesName)) { return this->otherThermo_.composition().Y(speciesName) @@ -144,7 +144,7 @@ Foam::interfaceCompositionModels::Raoult::YfPrime const volScalarField& Tf ) const { - if (this->speciesNames_.contains(speciesName)) + if (this->speciesNames_.found(speciesName)) { return this->otherThermo_.composition().Y(speciesName) diff --git a/applications/solvers/multiphase/reactingEulerFoam/interfacialCompositionModels/interfaceCompositionModels/interfaceCompositionModel/interfaceCompositionModel.C b/applications/solvers/multiphase/reactingEulerFoam/interfacialCompositionModels/interfaceCompositionModels/interfaceCompositionModel/interfaceCompositionModel.C index 383171ab5e..583854f3a5 100644 --- a/applications/solvers/multiphase/reactingEulerFoam/interfacialCompositionModels/interfaceCompositionModels/interfaceCompositionModel/interfaceCompositionModel.C +++ b/applications/solvers/multiphase/reactingEulerFoam/interfacialCompositionModels/interfaceCompositionModels/interfaceCompositionModel/interfaceCompositionModel.C @@ -63,17 +63,9 @@ const Foam::hashedWordList& Foam::interfaceCompositionModel::species() const } -bool Foam::interfaceCompositionModel::transports -( - word& speciesName -) const +bool Foam::interfaceCompositionModel::transports(word& speciesName) const { - if (this->speciesNames_.contains(speciesName)) - { - return true; - } - - return false; + return this->speciesNames_.found(speciesName); } diff --git a/src/OpenFOAM/primitives/strings/lists/hashedWordList.H b/src/OpenFOAM/primitives/strings/lists/hashedWordList.H index 4d4089037e..e2830e275d 100644 --- a/src/OpenFOAM/primitives/strings/lists/hashedWordList.H +++ b/src/OpenFOAM/primitives/strings/lists/hashedWordList.H @@ -3,7 +3,7 @@ \\ / F ield | OpenFOAM: The Open Source CFD Toolbox \\ / O peration | \\ / A nd | Copyright (C) 2011-2016 OpenFOAM Foundation - \\/ M anipulation | Copyright (C) 2016-2017 OpenCFD Ltd. + \\/ M anipulation | Copyright (C) 2016-2019 OpenCFD Ltd. ------------------------------------------------------------------------------- License This file is part of OpenFOAM. @@ -47,7 +47,7 @@ namespace Foam // Forward declarations class hashedWordList; -inline Istream& operator>>(Istream& is, hashedWordList& lst); +inline Istream& operator>>(Istream& is, hashedWordList& list); /*---------------------------------------------------------------------------*\ @@ -71,22 +71,22 @@ public: inline hashedWordList() = default; //- Copy construct. - inline hashedWordList(const hashedWordList& lst); + inline hashedWordList(const hashedWordList& list); //- Move construct. - inline hashedWordList(hashedWordList&& lst); + inline hashedWordList(hashedWordList&& list); //- Copy construct from list of words - inline explicit hashedWordList(const wordUList& lst); + inline explicit hashedWordList(const wordUList& list); //- Copy construct from list of words, eliminating duplicates - inline hashedWordList(const wordUList& lst, bool unique); + inline hashedWordList(const wordUList& list, bool unique); //- Move construct from list of words, optionally eliminating duplicates - inline hashedWordList(wordList&& lst, bool unique=false); + inline hashedWordList(wordList&& list, bool unique=false); //- Construct from an initializer list - inline hashedWordList(std::initializer_list lst); + inline hashedWordList(std::initializer_list list); //- Construct from the word keys of any HashTable, sorting immediately. // This also handles a wordHashSet, which is derived from a HashTable. @@ -102,7 +102,7 @@ public: hashedWordList(const label len, const char** array, bool unique=false); //- Construct from a nullptr-terminated list of words, - // optionally eliminating duplicates + //- optionally eliminating duplicates hashedWordList(const char** array, bool unique=false); //- Construct from Istream @@ -115,28 +115,25 @@ public: inline void clear(); //- Append an element at the end of the list, - // optionally avoid append if it would be a duplicate entry + //- optionally avoid append if it would be a duplicate entry inline void append(const word& name, bool unique=false); - //- Does the list contain the specified name + //- Search hashed values for the specified name inline bool found(const word& name) const; - //- Does the list contain the specified name - inline bool contains(const word& name) const; - //- Return the hash of words/indices for inspection inline const HashTable