49 lagrangianFields.emplace_set(cloudi, fieldObjects.
size());
51 forAll(fieldObjects, fieldi)
53 cloudFields.emplace_set(fieldi, fieldObjects[fieldi]);
62 const IOobjectList& lagrangianObjects,
63 PtrList<PtrList<CompactIOField<Field<Type>, Type>>>& lagrangianFields
67 UPtrList<const IOobject> fieldObjects
69 lagrangianObjects.cobjects<IOField<Field<Type>>>()
72 fieldObjects.push_back
74 lagrangianObjects.cobjects<CompactIOField<Field<Type>, Type>>()
81 lagrangianFields.emplace_set(cloudi, fieldObjects.size());
83 forAll(fieldObjects, fieldi)
85 cloudFields.emplace_set(fieldi, fieldObjects[fieldi]);
List of IOobjects with searching and retrieving facilities. Implemented as a HashTable, so the various sorted methods should be used if traversing in parallel.
#define forAll(list, i)
Loop across all elements in list.
static void readFieldFields(const label cloudi, const IOobjectList &lagrangianObjects, PtrList< PtrList< CompactIOField< Field< Type >, Type >>> &cloudFields)
Read the field-fields and store on the pointer list.
void sort(UList< T > &list)
Sort the list.
static void readFields(const label cloudi, const IOobjectList &lagrangianObjects, PtrList< PtrList< IOField< Type >>> &cloudFields)
Read the fields and store on the pointer list.
label size() const noexcept
The number of entries in the list.
A list of pointers to objects of type <T>, without allocation/deallocation management of the pointers...
A list of pointers to objects of type <T>, with allocation/deallocation management of the pointers...
UPtrList< const IOobject > csorted() const
The sorted list of IOobjects with headerClassName == Type::typeName.
A primitive field of type <T> with automated input and output.