73 Ostream&
operator<<(Ostream&,
const dictionary&);
103 name_(move(
name.name_))
124 const word scopedName = name_.
name();
128 if (i == scopedName.npos)
134 return scopedName.substr(i + 1, scopedName.npos);
148 name_ = move(
name.name_);
181 const entry* lookupDotScopedSubEntryPtr
190 const entry* lookupSlashScopedSubEntryPtr
199 const entry* lookupScopedSubEntryPtr
209 const bool patternMatch,
218 const bool patternMatch,
272 template<
class T,
class ... KeysAndTs>
277 const KeysAndTs& ... keysAndTs
281 template<
class T,
class ... KeysAndTs>
287 const KeysAndTs& ... keysAndTs
329 return this == &
null;
360 bool recursive=
false,
361 bool patternMatch=
true
424 bool recursive=
false,
425 bool patternMatch=
true
436 bool recursive=
false,
437 bool patternMatch=
true
448 bool recursive=
false,
449 bool patternMatch=
true
460 bool recursive=
false,
461 bool patternMatch=
true
473 bool recursive=
false,
474 bool patternMatch=
true
486 bool recursive=
false,
487 bool patternMatch=
true
499 bool recursive=
false,
500 bool patternMatch=
true
512 bool recursive=
false,
513 bool patternMatch=
true
552 const bool mustRead =
false
592 bool add(
entry*,
bool mergeEntry=
false);
597 void add(
const entry&,
bool mergeEntry=
false);
605 void add(
const keyType&,
const string&,
bool overwrite=
false);
613 void add(
const keyType&,
const scalar,
bool overwrite=
false);
621 bool mergeEntry=
false
627 void add(
const keyType&,
const T&,
bool overwrite=
false);
643 template<
class T,
class ... KeysAndTs>
644 void set(
const keyType&,
const T&,
const KeysAndTs& ...);
655 bool forceOverwrite=
false
677 virtual bool global()
const;
753 virtual bool global()
const
778 const string& argString,
787 const string& argString,
838 const word& configName,
863 const word& configType,
864 const string& argString,
875 template<
class EntryType>
880 template<
class EntryType>
884 const word& entryName,
885 const EntryType& value1,
886 const EntryType& value2
Non-intrusive doubly-linked list.
Intrusive doubly-linked list.
graph_traits< Graph >::vertices_size_type size_type
An STL-conforming hash table.
Template class for intrusive linked lists.
An Istream is an abstract base class for all input systems (streams, files, token lists etc)....
An STL-conforming const_iterator.
An STL-conforming iterator.
Template class for non-intrusive linked lists.
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
An Ostream is an abstract base class for all output systems (streams, files, token lists,...
A 2-tuple for storing two objects of different types.
An STL-conforming const_iterator.
An STL-conforming iterator.
An auto-pointer similar to the STL auto_ptr but with automatic casting to a reference to the type and...
const word dictName() const
Return the local dictionary name (final part of scoped name)
void operator=(const dictionaryName &name)
dictionaryName()
Construct dictionaryName null.
const fileName & name() const
Return the dictionary name.
includedDictionary(const fileName &fName, const dictionary &parentDict)
Construct an included dictionary for the given parent.
virtual ~includedDictionary()
Destructor.
virtual bool global() const
Return true if the dictionary global,.
A list of keyword definitions, which are a keyword followed by any number of values (e....
T lookupOrDefaultBackwardsCompatible(const wordList &, const T &, bool recursive=false, bool patternMatch=true) const
Find and return a T, trying a list of keywords in sequence.
bool substituteScopedKeyword(const word &keyword)
Substitute the given scoped keyword prepended by '$' with the.
static bool writeOptionalEntries
If true write optional keywords and values.
const dictionary & topDict() const
Return the top of the tree.
ITstream & operator[](const word &) const
Find and return entry.
dictionary subOrEmptyDict(const word &, const bool mustRead=false) const
Find and return a sub-dictionary as a copy, or.
dictionary()
Construct top-level dictionary null.
autoPtr< dictionary > clone() const
Construct and return clone.
virtual bool global() const
Return true if the dictionary global,.
void operator<<=(const dictionary &)
Unconditionally include entries from the given dictionary.
void transfer(dictionary &)
Transfer the contents of the argument and annul the argument.
bool read(Istream &, const bool keepHeader=false)
Read dictionary from Istream, optionally keeping the header.
const dictionary & subDictBackwardsCompatible(const wordList &) const
Find and return a sub-dictionary, trying a list of keywords in.
const entry * lookupEntryPtr(const word &, bool recursive, bool patternMatch) const
Find and return an entry data stream pointer if present.
T lookupOrDefault(const word &, const T &, bool recursive=false, bool patternMatch=true) const
Find and return a T,.
ITstream & lookup(const word &, bool recursive=false, bool patternMatch=true) const
Find and return an entry data stream.
bool changeKeyword(const keyType &oldKeyword, const keyType &newKeyword, bool forceOverwrite=false)
Change the keyword for an entry,.
tokenList tokens() const
Return the dictionary as a list of tokens.
bool substituteKeyword(const word &keyword)
Substitute the given keyword prepended by '$' with the.
void set(entry *)
Assign a new entry, overwrite any existing entry.
void write(Ostream &, const bool subDict=true) const
Write dictionary, normally with sub-dictionary formatting.
const entry & lookupEntry(const word &, bool recursive, bool patternMatch) const
Find and return an entry data stream if present otherwise error.
List< keyType > keys(bool patterns=false) const
Return the list of available keys or patterns.
void operator+=(const dictionary &)
Include entries from the given dictionary.
const dictionary & optionalSubDict(const word &) const
Find and return a sub-dictionary if found.
const entry * lookupScopedEntryPtr(const word &, bool recursive, bool patternMatch) const
Find and return an entry data stream pointer if present.
word topDictKeyword() const
Return the scoped keyword with which this dictionary can be.
bool remove(const word &)
Remove an entry specified by keyword.
bool isDict(const word &) const
Check if entry is a sub-dictionary.
const dictionary & parent() const
Return the parent dictionary.
const dictionary & subDict(const word &) const
Find and return a sub-dictionary.
const entry & lookupEntryBackwardsCompatible(const wordList &, bool recursive, bool patternMatch) const
Find and return an entry data stream if present, trying a list.
T lookupOrAddDefault(const word &, const T &, bool recursive=false, bool patternMatch=true)
Find and return a T, if not found return the given.
label endLineNumber() const
Return line number of last token in dictionary.
wordList sortedToc() const
Return the sorted table of contents.
friend Istream & operator>>(Istream &, dictionary &)
Read dictionary from Istream.
const entry * lookupEntryPtrBackwardsCompatible(const wordList &, bool recursive, bool patternMatch) const
Find and return an entry data stream if present, trying a list.
bool isNull() const
Return whether this dictionary is null.
void operator|=(const dictionary &)
Conditionally include entries from the given dictionary.
bool add(entry *, bool mergeEntry=false)
Add a new entry.
void clear()
Clear the dictionary.
virtual ~dictionary()
Destructor.
bool readIfPresent(const word &, T &, bool recursive=false, bool patternMatch=true) const
Find an entry if present, and assign to T.
ITstream & lookupBackwardsCompatible(const wordList &, bool recursive=false, bool patternMatch=true) const
Find and return an entry data stream, trying a list of keywords.
const dictionary * subDictPtr(const word &) const
Find and return a sub-dictionary pointer if present.
void operator=(const dictionary &)
wordList toc() const
Return the table of contents.
bool found(const word &, bool recursive=false, bool patternMatch=true) const
Search dictionary for given keyword.
const dictionary & scopedDict(const word &) const
Find and return a sub-dictionary by scoped lookup.
label startLineNumber() const
Return line number of first token in dictionary.
friend Ostream & operator<<(Ostream &, const dictionary &)
Write dictionary to Ostream.
static autoPtr< dictionary > New(Istream &)
Construct top-level dictionary on freestore from Istream.
bool merge(const dictionary &)
Merge entries from the given dictionary.
SHA1Digest digest() const
Return the SHA1 digest of the dictionary contents.
A keyword and a list of tokens is an 'entry'.
A class for handling file names.
word name() const
Return file name (part beyond last /)
A class for handling keywords in dictionaries.
A class for handling words, derived from string.
static const word null
An empty word.
Macro definitions for declaring ClassName(), NamespaceName(), etc.
void writeEntryIfDifferent(Ostream &os, const word &entryName, const EntryType &value1, const EntryType &value2)
Helper function to write the keyword and entry only if the.
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
void dictArgList(const string &argString, word &configName, wordReList &args, List< Tuple2< word, string >> &namedArgs)
Parse dictionary substitution argument list.
wordList listAllConfigFiles(const fileName &configFilesPath)
Return the list of configuration files in.
bool readConfigFile(const word &configType, const string &argString, dictionary &parentDict, const fileName &configFilesPath, const Pair< string > &contextTypeAndValue, const word ®ion=word::null)
Read the specified configuration file.
Pair< word > dictAndKeyword(const word &scopedName)
Extracts dict name and keyword.
void writeEntry(Ostream &os, const HashTable< T, Key, Hash > &ht)
fileName findConfigFile(const word &configName, const fileName &configFilesPath, const word ®ion=word::null)
Search for configuration file for given region.
Istream & operator>>(Istream &, directionInfo &)
tmp< fvMatrix< Type > > operator+(const fvMatrix< Type > &, const fvMatrix< Type > &)
Ostream & operator<<(Ostream &, const ensightPart &)
void T(FieldField< Field, Type > &f1, const FieldField< Field, Type > &f2)
HashSet< Key, Hash > operator|(const HashSet< Key, Hash > &hash1, const HashSet< Key, Hash > &hash2)
Combine entries from HashSets.
Foam::argList args(argc, argv)