75 Ostream&
operator<<(Ostream&,
const dictionary&);
105 name_(move(
name.name_))
126 const word scopedName = name_.
name();
130 if (i == scopedName.npos)
136 return scopedName.substr(i + 1, scopedName.npos);
150 name_ = move(
name.name_);
168 static bool writeOptionalEntries;
187 const entry* lookupScopedSubEntryPtr
197 const bool patternMatch,
206 const bool patternMatch,
291 return this == &null;
298 label startLineNumber()
const;
301 label endLineNumber()
const;
318 bool recursive=
false,
319 bool patternMatch =
true 326 const entry* lookupEntryPtr
337 entry* lookupEntryPtr
347 const entry& lookupEntry
360 bool recursive=
false,
361 bool patternMatch=
true 372 bool recursive=
false,
373 bool patternMatch=
true 385 bool recursive=
false,
386 bool patternMatch=
true 398 bool recursive=
false,
399 bool patternMatch=
true 411 bool recursive=
false,
412 bool patternMatch=
true 418 const entry* lookupScopedEntryPtr
426 bool isDict(
const word&)
const;
447 const bool mustRead =
false 468 bool substituteKeyword(
const word& keyword);
472 bool substituteScopedKeyword(
const word& keyword);
477 bool add(
entry*,
bool mergeEntry=
false);
482 void add(
const entry&,
bool mergeEntry=
false);
490 void add(
const keyType&,
const string&,
bool overwrite=
false);
498 void add(
const keyType&,
const scalar,
bool overwrite=
false);
506 bool mergeEntry=
false 512 void add(
const keyType&,
const T&,
bool overwrite=
false);
518 void set(
const entry&);
525 void set(
const keyType&,
const T&);
528 bool remove(
const word&);
534 const keyType& oldKeyword,
535 const keyType& newKeyword,
536 bool forceOverwrite=
false 616 template<
class EntryType>
621 template<
class EntryType>
625 const word& entryName,
626 const EntryType& value1,
627 const EntryType& value2
Template class for intrusive linked lists.
A class for handling keywords in dictionaries.
HashSet< Key, Hash > operator|(const HashSet< Key, Hash > &hash1, const HashSet< Key, Hash > &hash2)
Combine entries from HashSets.
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
A class for handling file names.
A list of keyword definitions, which are a keyword followed by any number of values (e...
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
Template class for non-intrusive linked lists.
An Istream is an abstract base class for all input systems (streams, files, token lists etc)...
dictionaryName()
Construct dictionaryName null.
void writeEntryIfDifferent(Ostream &os, const word &entryName, const EntryType &value1, const EntryType &value2)
Helper function to write the keyword and entry only if the.
An STL-conforming const_iterator.
An STL-conforming iterator.
An STL-conforming const_iterator.
tmp< DimensionedField< TypeR, GeoMesh > > New(const tmp< DimensionedField< TypeR, GeoMesh >> &tdf1, const word &name, const dimensionSet &dimensions)
const word dictName() const
Return the local dictionary name (final part of scoped name)
#define ClassName(TypeNameString)
Add typeName information from argument TypeNameString to a class.
bool read(const char *, int32_t &)
stressControl lookup("compactNormalStress") >> compactNormalStress
bool isNull(const T &t)
Return true if t is a reference to the nullObject of type T.
const fileName & name() const
Return the dictionary name.
Intrusive doubly-linked list.
A class for handling words, derived from string.
Istream & operator>>(Istream &, directionInfo &)
word name() const
Return file name (part beyond last /)
An STL-conforming iterator.
tmp< fvMatrix< Type > > operator+(const fvMatrix< Type > &, const fvMatrix< Type > &)
An STL-conforming hash table.
graph_traits< Graph >::vertices_size_type size_type
An Ostream is an abstract base class for all output systems (streams, files, token lists...
void add(FieldField< Field1, typename typeOfSum< Type1, Type2 >::type > &f, const FieldField< Field1, Type1 > &f1, const FieldField< Field2, Type2 > &f2)
void T(FieldField< Field, Type > &f1, const FieldField< Field, Type > &f2)
void writeEntry(Ostream &os, const HashTable< T, Key, Hash > &ht)
void operator=(const dictionaryName &name)
Macro definitions for declaring ClassName(), NamespaceName(), etc.
Ostream & operator<<(Ostream &, const ensightPart &)
Non-intrusive doubly-linked list.
An auto-pointer similar to the STL auto_ptr but with automatic casting to a reference to the type and...
A keyword and a list of tokens is an 'entry'.