Loading...
Searching...
No Matches
cellShape Class Reference

An analytical geometric cellShape. More...

#include <cellShape.H>

Inheritance diagram for cellShape:
Collaboration diagram for cellShape:

Public Member Functions

constexpr cellShape () noexcept
 Default construct. Empty shape, no cell model.
 cellShape (const cellModel &model, const labelUList &labels, const bool doCollapse=false)
 Copy construct from components.
template<unsigned N>
 cellShape (const cellModel &model, const FixedList< label, N > &labels, const bool doCollapse=false)
 Copy construct from components.
 cellShape (const cellModel &model, labelList &&labels, const bool doCollapse=false)
 Move construct from components.
 cellShape (const cellModel::modelType model, const labelUList &labels, const bool doCollapse=false)
 Copy construct from components, lookup cellModel by type.
 cellShape (const cellModel::modelType model, labelList &&labels, const bool doCollapse=false)
 Move construct from components, lookup cellModel by type.
 cellShape (const word &modelName, const labelUList &labels, const bool doCollapse=false)
 Copy construct from components, lookup cellModel by name.
 cellShape (Istream &is)
 Construct from Istream.
autoPtr< cellShapeclone () const
 Clone.
const cellModelmodel () const
 Model reference.
label nPoints () const noexcept
 Number of points.
label nEdges () const
 Number of edges.
label nFaces () const
 Number of faces.
pointField points (const UList< point > &meshPoints) const
 The points corresponding to this shape.
labelList meshFaces (const faceList &allFaces, const cell &cFaces) const
 Mesh face labels of this cell (in order of model).
labelList meshEdges (const edgeList &allEdges, const labelList &cEdges) const
 Mesh edge labels of this cell (in order of model).
Foam::face face (const label modelFacei) const
 The face for the specified model face.
faceList faces () const
 Faces of this cell.
faceList collapsedFaces () const
 Collapsed faces of this cell.
Foam::edge edge (const label modelEdgei) const
 The edge for the specified model edge.
edgeList edges () const
 Edges of this shape.
point centre (const UList< point > &points) const
 Centroid of the cell.
scalar mag (const UList< point > &points) const
 Scalar magnitude.
label min () const
 Return the smallest vertex label used by the shape or -1 if the shape is empty.
label max () const
 Return the largest vertex label used by the shape or -1 if the shape is empty.
void reset (const cellModel &model, const labelUList &labels, const bool doCollapse=false)
 Reset from components.
template<unsigned N>
void reset (const cellModel &model, const FixedList< label, N > &labels, const bool doCollapse=false)
 Reset from components.
void collapse ()
 Collapse shape to correct one after removing duplicate vertices.
InfoProxy< cellShapeinfo () const noexcept
 Return info proxy, used to print information to a stream.
void operator+= (const label vertexOffset)
 Increment (offset) vertices by given amount.
Public Member Functions inherited from List< label >
constexpr List () noexcept
 Default construct.
 List (const label len)
 Construct with given size.
 List (const label len, const label &val)
 Construct with given size and value for all elements.
 List (const label len, Foam::zero)
 Construct with given size initializing all elements to zero.
 List (Foam::one, const label &val)
 Construct with length=1, copying the value as the only content.
 List (Foam::one, label &&val)
 Construct with length=1, moving the value as the only content.
 List (Foam::one, Foam::zero)
 Construct with length=1, initializing content to zero.
 List (const List< label > &list)
 Copy construct from list.
 List (const UList< label > &list)
 Copy construct contents from list.
 List (List< label > &list, bool reuse)
 Construct as copy or re-use as specified.
 List (const UList< label > &list, const labelUList &indices)
 Copy construct subset of list.
 List (const UList< label > &list, const FixedList< label, N > &indices)
 Copy construct subset of list.
 List (const FixedList< label, N > &list)
 Construct as copy of FixedList<T, N>.
 List (const UPtrList< label > &list)
 Construct as copy of UPtrList<T> content.
 List (const IndirectListBase< label, Addr > &list)
 Construct as copy of IndirectList contents.
 List (std::initializer_list< label > list)
 Construct from an initializer list.
 List (List< label > &&list) noexcept
 Move construct from List.
 List (DynamicList< label, SizeMin > &&list)
 Move construct from DynamicList.
 List (Istream &is)
 Construct from Istream.
autoPtr< List< label > > clone () const
 Clone.
 ~List ()
 Destructor.
void clear ()
 Clear the list, i.e. set size to zero.
void resize (const label len)
 Adjust allocated size of list.
void resize (const label len, const label &val)
 Adjust allocated size of list and set val for new elements.
void resize_copy (label count, const label len)
 Change allocated size of list, retaining the first count elements.
void resize_fill (const label len, const label &val)
 Adjust allocated size of list and set val for all elements.
void resize_nocopy (const label len)
 Adjust allocated size of list without necessarily.
void transfer (List< label > &list)
 Transfer the contents of the argument List into this list and annul the argument list.
void transfer (DynamicList< label, SizeMin > &list)
 Transfer the contents of the argument List into this list and annul the argument list.
label & newElmt (const label i)
 Return subscript-checked element of UList and resizing the list if required.
label & emplace_back (Args &&... args)
 Construct an element at the end of the list, return reference to the new list element.
void push_back (const label &val)
 Append an element at the end of the list.
void push_back (label &&val)
 Move append an element at the end of the list.
void push_back (const UList< label > &list)
 Append a List to the end of this list.
void push_back (const IndirectListBase< label, Addr > &list)
 Append IndirectList contents at the end of this list.
label push_uniq (const label &val)
 Append an element if not already in the list.
void pop_back (label n=1)
 Reduce size by 1 or more elements. Can be called on an empty list.
void operator= (const UList< label > &list)
 Assignment to UList operator. Takes linear time.
void operator= (const List< label > &list)
 Assignment operator. Takes linear time.
void operator= (const IndirectListBase< label, Addr > &list)
 Assignment from IndirectList. Takes linear time.
void operator= (const FixedList< label, N > &list)
 Copy assignment from FixedList.
void operator= (std::initializer_list< label > list)
 Assignment to an initializer list.
void operator= (const label &val)
 Assignment of all entries to the given value.
void operator= (Foam::zero)
 Assignment of all entries to zero.
void operator= (List< label > &&list)
 Move assignment. Takes constant time.
void operator= (DynamicList< label, SizeMin > &&list)
 Move assignment. Takes constant time.
IstreamreadList (Istream &is)
 Read List from Istream, discarding contents of existing List.
void shallowCopy (const UList< label > &)=delete
 No shallowCopy permitted.
bool set (const label i, bool val=true)
 A bitSet::set() method for a list of bool.
void append (const label &val)
 Append an element at the end of the list.
void append (label &&val)
 Move append an element at the end of the list.
void append (const UList< label > &list)
 Append a List to the end of this list.
void append (const IndirectListBase< label, Addr > &list)
 Append IndirectList contents at the end of this list.
label appendUniq (const label &val)
 Same as push_uniq().
void setSize (label n)
 Alias for resize().
void setSize (label n, const label &val)
 Alias for resize().
 List (const Expression::ListExpression< E > &expr)
 Construct from value expression.
void operator= (const Expression::ListExpression< E > &expr)
 Assign values from expression.
void resize (const label len)
Public Member Functions inherited from UList< label >
 UList (const UList< label > &) noexcept=default
 Copy construct, shallow copy.
 UList (UList< label > &&) noexcept=default
 Move construct, shallow copy.
UList< label > & operator= (const UList< label > &)=delete
 No copy assignment (default: shallow copy).
UList< label > & operator= (UList< label > &&) noexcept=default
 Move assignment, shallow copy.
constexpr UList () noexcept
 Default construct, zero-sized and nullptr.
 UList (label *__restrict__ ptr, const label len) noexcept
 Construct from components.
 UList (SubList< label > &&) noexcept
 Move construct from a SubList, shallow copy.
label fcIndex (const label i) const noexcept
 The forward circular index. The next index in the list which returns to the first at the end of the list.
label rcIndex (const label i) const noexcept
 The reverse circular index. The previous index in the list which returns to the last at the beginning of the list.
const label & fcValue (const label i) const
 Return forward circular value (ie, next value in the list).
label & fcValue (const label i)
 Return forward circular value (ie, next value in the list).
const label & rcValue (const label i) const
 Return reverse circular value (ie, previous value in the list).
label & rcValue (const label i)
 Return reverse circular value (ie, previous value in the list).
const label * cdata () const noexcept
 Return pointer to the underlying array serving as data storage.
label * data () noexcept
 Return pointer to the underlying array serving as data storage.
const char * cdata_bytes () const noexcept
 Return pointer to the underlying array serving as data storage,.
char * data_bytes () noexcept
 Return pointer to the underlying array serving as data storage,.
label & front ()
 Access first element of the list, position [0].
const label & front () const
 Access first element of the list.
label & back ()
 Access last element of the list, position [size()-1].
const label & back () const
 Access last element of the list, position [size()-1].
std::streamsize size_bytes () const noexcept
 Number of contiguous bytes for the List data.
std::streamsize byteSize () const
 Number of contiguous bytes for the List data, runtime FatalError if type is not contiguous.
void checkStart (const label start) const
 Check start is within valid range [0,size).
void checkSize (const label size) const
 Check size is within valid range [0,size].
void checkRange (const label start, const label len) const
 Check that start and length define a valid range.
void checkIndex (const label i) const
 Check index is within valid range [0,size).
bool uniform () const
 True if all entries have identical values, and list is non-empty.
bool contains (const label &val) const
 True if the value is contained in the list.
bool contains (const label &val, label pos, label len=-1) const
 Is the value contained in the list?
label find (const label &val) const
 Find index of the first occurrence of the value.
label find (const label &val, label pos, label len=-1) const
 Find index of the first occurrence of the value.
label rfind (const label &val, label pos=-1) const
 Find index of the last occurrence of the value.
void moveFirst (const label i)
 Move element to the first position.
void moveLast (const label i)
 Move element to the last position.
void swapFirst (const label i)
 Swap element with the first element. Fatal on an empty list.
void swapLast (const label i)
 Swap element with the last element. Fatal on an empty list.
void shallowCopy (label *__restrict__ ptr, const label len) noexcept
 Copy the pointer and size.
void shallowCopy (std::nullptr_t) noexcept
 Copy nullptr and zero size.
void shallowCopy (const UList< label > &list) noexcept
 Copy the pointer and size held by the given UList.
void deepCopy (const UList< label > &list)
 Copy elements of the given UList. Sizes must match!
void deepCopy (const IndirectListBase< label, Addr > &list)
 Copy elements of the given indirect list. Sizes must match!
SubList< label > slice (const label pos, label len=-1)
 Return SubList slice (non-const access) - no range checking.
const SubList< label > slice (const label pos, label len=-1) const
 Return SubList slice (const access) - no range checking.
SubList< label > slice (const labelRange &range)
 Return SubList slice (non-const access) - with range checking.
const SubList< label > slice (const labelRange &range) const
 Return SubList slice (const access) - with range checking.
label & operator[] (const label i)
 Return element of UList.
const label & operator[] (const label i) const
 Return element of constant UList.
 operator const Foam::List< label > & () const
 Allow cast to a const List<T>&.
void operator= (const label &val)
 Assignment of all entries to the given value.
void operator= (Foam::zero)
 Assignment of all entries to zero.
iterator begin () noexcept
 Return an iterator to begin traversing the UList.
iterator end () noexcept
 Return an iterator to end traversing the UList.
iterator begin (const label i) noexcept
 Return iterator at offset i from begin, clamped to [0,size] range.
const_iterator cbegin () const noexcept
 Return const_iterator to begin traversing the constant UList.
const_iterator cend () const noexcept
 Return const_iterator to end traversing the constant UList.
const_iterator begin () const noexcept
 Return const_iterator to begin traversing the constant UList.
const_iterator end () const noexcept
 Return const_iterator to end traversing the constant UList.
const_iterator cbegin (const label i) const noexcept
 Return const_iterator at offset i from begin, clamped to [0,size] range.
const_iterator begin (const label i) const noexcept
 Return const_iterator at offset i from begin, clamped to [0,size] range.
reverse_iterator rbegin ()
 Return reverse_iterator to begin reverse traversing the UList.
reverse_iterator rend ()
 Return reverse_iterator to end reverse traversing the UList.
const_reverse_iterator crbegin () const
 Return const_reverse_iterator to begin reverse traversing the UList.
const_reverse_iterator crend () const
 Return const_reverse_iterator to end reverse traversing the UList.
const_reverse_iterator rbegin () const
 Return const_reverse_iterator to begin reverse traversing the UList.
const_reverse_iterator rend () const
 Return const_reverse_iterator to end reverse traversing the UList.
bool empty () const noexcept
 True if List is empty (ie, size() is zero).
label size () const noexcept
 The number of elements in the container.
label capacity () const noexcept
 Size of the underlying storage.
void swap (UList< label > &list) noexcept
 Swap content with another UList of the same type in constant time.
bool operator== (const UList< label > &list) const
 Equality operation on ULists of the same type.
bool operator!= (const UList< label > &list) const
 The opposite of the equality operation. Takes linear time.
bool operator< (const UList< label > &list) const
 Compare two ULists lexicographically. Takes linear time.
bool operator> (const UList< label > &list) const
 Compare two ULists lexicographically. Takes linear time.
bool operator<= (const UList< label > &list) const
 Return true if !(a > b). Takes linear time.
bool operator>= (const UList< label > &list) const
 Return true if !(a < b). Takes linear time.
IstreamreadList (Istream &is)
 Read List contents from Istream.
void writeEntry (const word &keyword, Ostream &os) const
 Write the List as a dictionary entry with keyword.
OstreamwriteList (Ostream &os, const label shortLen=0) const
 Write List, with line-breaks in ASCII when length exceeds shortLen.
bool all () const
 True if all entries are 'true' or if the list is empty.
bool any () const
 True if any entries are 'true'.
bool none () const
 True if no entries are 'true'.
bool test (const label i) const
 Test bool value at specified position, always false for out-of-range access.
bool get (const label i) const
 Return bool value at specified position, always false for out-of-range access.
bool unset (const label i)
 Unset the bool entry at specified position, always false for out-of-range access.
std::string_view view () const
 Return a string_view of the charList. Content is non-modifiable.
label & first ()
 Access first element of the list, position [0].
const label & first () const
 Access first element of the list.
label & last ()
 Access last element of the list, position [size()-1].
const label & last () const
 Access last element of the list, position [size()-1].
bool found (const label &val, label pos=0) const
 Same as contains().
auto expr () const
 Wrap value as expression.
void operator= (const Expression::ListExpression< E > &expr)
 Assign values from expression.
 operator const Foam::List< label > & () const
 Allow cast to a const List<T>&.

Static Public Member Functions

static int compare (const cellShape &a, const cellShape &b)
 Compare cellShape vertices.
Static Public Member Functions inherited from List< label >
static const List< label > & null () noexcept
 Return a null List (reference to a nullObject). Behaves like an empty List.
Static Public Member Functions inherited from UList< label >
static const UList< label > & null () noexcept
 Return a null UList (reference to a nullObject). Behaves like an empty UList.
static constexpr label max_size () noexcept
 The size of the largest possible UList.

Friends

bool operator== (const cellShape &a, const cellShape &b)
Istreamoperator>> (Istream &is, cellShape &s)
Ostreamoperator<< (Ostream &os, const cellShape &s)

Additional Inherited Members

Public Types inherited from List< label >
typedef SubList< label > subList
 Declare type of subList.
Public Types inherited from UList< label >
typedef label value_type
 The value type the list contains.
typedef label * pointer
 The pointer type for non-const access to value_type items.
typedef const label * const_pointer
 The pointer type for const access to value_type items.
typedef label & reference
 The type used for storing into value_type objects.
typedef const label & const_reference
 The type used for reading from constant value_type objects.
typedef label * iterator
 Random access iterator for traversing a UList.
typedef const label * const_iterator
 Random access iterator for traversing a UList.
typedef label size_type
 The type to represent the size of a UList.
typedef label difference_type
 The difference between iterator objects.
typedef std::reverse_iterator< iteratorreverse_iterator
 Reverse iterator (non-const access).
typedef std::reverse_iterator< const_iteratorconst_reverse_iterator
 Reverse iterator (const access).
using is_List
 Have unique tag.
Protected Member Functions inherited from UList< label >
void setAddressableSize (const label n) noexcept
 Set addressed size to be inconsistent with allocated storage.
void size (const label n)
 Older name for setAddressableSize.
void writeEntry (Ostream &os) const
 Write the UList with its compound type.
labelRange validateRange (const labelRange &requestedRange) const
 Return a validated (start,size) subset range, which means that it always addresses a valid section of the list.
void fill_uniform (const label &val)
 Assign all entries to the given value.
void fill_uniform (Foam::zero)
 Assign all entries to zero.

Detailed Description

An analytical geometric cellShape.

The optional collapse functionality changes the cellModel to the correct type after removing any duplicate points.

Source files

Definition at line 68 of file cellShape.H.

Constructor & Destructor Documentation

◆ cellShape() [1/8]

cellShape ( )
inlineconstexprnoexcept

Default construct. Empty shape, no cell model.

Definition at line 29 of file cellShapeI.H.

References Foam::noexcept.

Referenced by compare(), operator<<, operator==, and operator>>.

Here is the caller graph for this function:

◆ cellShape() [2/8]

cellShape ( const cellModel & model,
const labelUList & labels,
const bool doCollapse = false )
inline

Copy construct from components.

Definition at line 36 of file cellShapeI.H.

References collapse(), and model().

Here is the call graph for this function:

◆ cellShape() [3/8]

template<unsigned N>
cellShape ( const cellModel & model,
const FixedList< label, N > & labels,
const bool doCollapse = false )
inline

Copy construct from components.

Definition at line 54 of file cellShapeI.H.

References collapse(), and model().

Here is the call graph for this function:

◆ cellShape() [4/8]

cellShape ( const cellModel & model,
labelList && labels,
const bool doCollapse = false )
inline

Move construct from components.

Definition at line 71 of file cellShapeI.H.

References collapse(), and model().

Here is the call graph for this function:

◆ cellShape() [5/8]

cellShape ( const cellModel::modelType model,
const labelUList & labels,
const bool doCollapse = false )
inline

Copy construct from components, lookup cellModel by type.

Definition at line 88 of file cellShapeI.H.

References collapse(), and model().

Here is the call graph for this function:

◆ cellShape() [6/8]

cellShape ( const cellModel::modelType model,
labelList && labels,
const bool doCollapse = false )
inline

Move construct from components, lookup cellModel by type.

Definition at line 105 of file cellShapeI.H.

References collapse(), and model().

Here is the call graph for this function:

◆ cellShape() [7/8]

cellShape ( const word & modelName,
const labelUList & labels,
const bool doCollapse = false )
inline

Copy construct from components, lookup cellModel by name.

Definition at line 122 of file cellShapeI.H.

References collapse().

Here is the call graph for this function:

◆ cellShape() [8/8]

cellShape ( Istream & is)
inlineexplicit

Construct from Istream.

Definition at line 139 of file cellShapeI.H.

Member Function Documentation

◆ clone()

Foam::autoPtr< Foam::cellShape > clone ( ) const
inline

Clone.

Definition at line 145 of file cellShapeI.H.

References autoPtr< T >::New().

Here is the call graph for this function:

◆ model()

const Foam::cellModel & model ( ) const
inline

Model reference.

Definition at line 153 of file cellShapeI.H.

Referenced by cellShape(), cellShape(), cellShape(), cellShape(), cellShape(), Foam::operator<<(), reset(), and reset().

Here is the caller graph for this function:

◆ nPoints()

Foam::label nPoints ( ) const
inlinenoexcept

Number of points.

Definition at line 159 of file cellShapeI.H.

References Foam::noexcept, and UList< label >::size().

Here is the call graph for this function:

◆ nEdges()

Foam::label nEdges ( ) const
inline

Number of edges.

Definition at line 165 of file cellShapeI.H.

◆ nFaces()

Foam::label nFaces ( ) const
inline

Number of faces.

Definition at line 171 of file cellShapeI.H.

◆ points()

Foam::pointField points ( const UList< point > & meshPoints) const
inline

The points corresponding to this shape.

Definition at line 177 of file cellShapeI.H.

Referenced by centre(), mag(), and voxelMeshSearch::makeMesh().

Here is the caller graph for this function:

◆ meshFaces()

Foam::labelList meshFaces ( const faceList & allFaces,
const cell & cFaces ) const
inline

Mesh face labels of this cell (in order of model).

Definition at line 186 of file cellShapeI.H.

References faces(), forAll, and UList< T >::size().

Here is the call graph for this function:

◆ meshEdges()

Foam::labelList meshEdges ( const edgeList & allEdges,
const labelList & cEdges ) const
inline

Mesh edge labels of this cell (in order of model).

Definition at line 217 of file cellShapeI.H.

References e, edges(), forAll, and UList< T >::size().

Here is the call graph for this function:

◆ face()

Foam::face face ( const label modelFacei) const
inline

The face for the specified model face.

Definition at line 248 of file cellShapeI.H.

References face::face().

Here is the call graph for this function:

◆ faces()

Foam::faceList faces ( ) const
inline

Faces of this cell.

Definition at line 254 of file cellShapeI.H.

Referenced by collapsedFaces(), and meshFaces().

Here is the caller graph for this function:

◆ collapsedFaces()

Foam::faceList collapsedFaces ( ) const
inline

Collapsed faces of this cell.

Definition at line 260 of file cellShapeI.H.

References f(), faces(), List< T >::resize(), and UList< T >::size().

Referenced by degenerateMatcher::match().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ edge()

Foam::edge edge ( const label modelEdgei) const
inline

The edge for the specified model edge.

Definition at line 302 of file cellShapeI.H.

References edge::edge().

Here is the call graph for this function:

◆ edges()

Foam::edgeList edges ( ) const
inline

Edges of this shape.

Definition at line 308 of file cellShapeI.H.

Referenced by meshEdges().

Here is the caller graph for this function:

◆ centre()

Foam::point centre ( const UList< point > & points) const
inline

Centroid of the cell.

Definition at line 314 of file cellShapeI.H.

References Vector< Cmpt >::centre(), and points().

Here is the call graph for this function:

◆ mag()

Foam::scalar mag ( const UList< point > & points) const
inline

Scalar magnitude.

Definition at line 320 of file cellShapeI.H.

References Vector< Cmpt >::mag(), and points().

Here is the call graph for this function:

◆ min()

Foam::label min ( ) const
inline

Return the smallest vertex label used by the shape or -1 if the shape is empty.

Definition at line 326 of file cellShapeI.H.

References UList< label >::empty().

Here is the call graph for this function:

◆ max()

Foam::label max ( ) const
inline

Return the largest vertex label used by the shape or -1 if the shape is empty.

Definition at line 342 of file cellShapeI.H.

References UList< label >::empty().

Here is the call graph for this function:

◆ reset() [1/2]

void reset ( const cellModel & model,
const labelUList & labels,
const bool doCollapse = false )
inline

Reset from components.

Definition at line 358 of file cellShapeI.H.

References collapse(), and model().

Referenced by hexMatcher::matches(), prismMatcher::matches(), pyrMatcher::matches(), tetMatcher::matches(), tetWedgeMatcher::matches(), and wedgeMatcher::matches().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ reset() [2/2]

template<unsigned N>
void reset ( const cellModel & model,
const FixedList< label, N > & labels,
const bool doCollapse = false )
inline

Reset from components.

Definition at line 376 of file cellShapeI.H.

References collapse(), and model().

Here is the call graph for this function:

◆ collapse()

void collapse ( )

Collapse shape to correct one after removing duplicate vertices.

Definition at line 26 of file cellShape.C.

References List< label >::operator=().

Referenced by cellShape(), cellShape(), cellShape(), cellShape(), cellShape(), cellShape(), reset(), and reset().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ info()

InfoProxy< cellShape > info ( ) const
inlinenoexcept

Return info proxy, used to print information to a stream.

Definition at line 283 of file cellShape.H.

References Foam::noexcept.

◆ compare()

int compare ( const cellShape & a,
const cellShape & b )
static

Compare cellShape vertices.

Returns
  • 0: different
  • +1: identical values and order used
  • -1: identical values, but in different order

Definition at line 26 of file cellShapeEqual.C.

References b, cellShape(), UList< T >::find(), and UList< T >::size().

Referenced by Foam::operator==().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ operator+=()

void operator+= ( const label vertexOffset)
inline

Increment (offset) vertices by given amount.

Definition at line 395 of file cellShapeI.H.

◆ operator==

bool operator== ( const cellShape & a,
const cellShape & b )
friend

References b, and cellShape().

◆ operator>>

Istream & operator>> ( Istream & is,
cellShape & s )
friend

References cellShape(), and s().

◆ operator<<

Ostream & operator<< ( Ostream & os,
const cellShape & s )
friend

References cellShape(), os(), and s().


The documentation for this class was generated from the following files: