edgeIntersections Class Reference

Holder of intersections of edges of a surface with another surface. Optionally shuffles around points on surface to resolve any 'conflicts' (edge hitting triangle edge, edge hitting point etc.). More...

Inheritance diagram for edgeIntersections:
[legend]
Collaboration diagram for edgeIntersections:
[legend]

Public Member Functions

 ClassName ("edgeIntersections")
 
 edgeIntersections ()
 Construct null. More...
 
 edgeIntersections (const triSurface &surf1, const triSurfaceSearch &query2, const scalarField &surf1PointTol)
 Construct from surface and tolerance. More...
 
 edgeIntersections (const List< List< pointIndexHit > > &, const labelListList &)
 Construct from components. More...
 
const labelListListclassification () const
 For every intersection the classification status. More...
 
label removeDegenerates (const label nIters, const triSurface &surf1, const triSurfaceSearch &query2, const scalarField &surf1PointTol, pointField &points1)
 Resolve ties. Shuffles points so all edge - face intersections. More...
 
void merge (const edgeIntersections &, const labelList &edgeMap, const labelList &faceMap, const bool merge=true)
 Merge (or override) edge intersection for a subset. More...
 
- Public Member Functions inherited from List< List< pointIndexHit > >
constexpr List () noexcept
 Default construct. More...
 
 List (const label len)
 Construct with given size. More...
 
 List (const label len, const List< pointIndexHit > &val)
 Construct with given size and value for all elements. More...
 
 List (const label len, const Foam::zero)
 Construct with given size initializing all elements to zero. More...
 
 List (const Foam::one, const List< pointIndexHit > &val)
 Construct with length=1, copying the value as the only content. More...
 
 List (const Foam::one, List< pointIndexHit > &&val)
 Construct with length=1, moving the value as the only content. More...
 
 List (const Foam::one, const Foam::zero)
 Construct with length=1, initializing content to zero. More...
 
 List (const List< List< pointIndexHit > > &a)
 Copy construct from list. More...
 
 List (const UList< List< pointIndexHit > > &a)
 Copy construct contents from list. More...
 
 List (List< List< pointIndexHit > > &a, bool reuse)
 Construct as copy or re-use as specified. More...
 
 List (const UList< List< pointIndexHit > > &list, const labelUList &indices)
 Copy construct subset of list. More...
 
 List (const UList< List< pointIndexHit > > &list, const FixedList< label, N > &indices)
 Copy construct subset of list. More...
 
 List (const FixedList< List< pointIndexHit >, N > &list)
 Construct as copy of FixedList<T, N> More...
 
 List (const PtrList< List< pointIndexHit > > &list)
 Construct as copy of PtrList<T> More...
 
 List (const SLList< List< pointIndexHit > > &list)
 Construct as copy of SLList<T> More...
 
 List (const IndirectListBase< List< pointIndexHit >, Addr > &list)
 Construct as copy of IndirectList contents. More...
 
 List (std::initializer_list< List< pointIndexHit > > list)
 Construct from an initializer list. More...
 
 List (List< List< pointIndexHit > > &&list)
 Move construct from List. More...
 
 List (DynamicList< List< pointIndexHit >, SizeMin > &&list)
 Move construct from DynamicList. More...
 
 List (SLList< List< pointIndexHit > > &&list)
 Move construct from SLList. More...
 
 List (Istream &is)
 Construct from Istream. More...
 
autoPtr< List< List< pointIndexHit > > > clone () const
 Clone. More...
 
 ~List ()
 Destructor. More...
 
void clear ()
 Clear the list, i.e. set size to zero. More...
 
void resize (const label len)
 Adjust allocated size of list. More...
 
void resize (const label len, const List< pointIndexHit > &val)
 Adjust allocated size of list and set val for new elements. More...
 
void resize (const label newLen)
 
void resize_nocopy (const label len)
 Adjust allocated size of list without necessarily. More...
 
void setSize (const label n)
 Alias for resize() More...
 
void setSize (const label n, const List< pointIndexHit > &val)
 Alias for resize() More...
 
void append (const List< pointIndexHit > &val)
 Append an element at the end of the list. More...
 
void append (List< pointIndexHit > &&val)
 Move append an element at the end of the list. More...
 
void append (const UList< List< pointIndexHit > > &list)
 Append a List to the end of this list. More...
 
void append (const IndirectListBase< List< pointIndexHit >, Addr > &list)
 Append IndirectList contents at the end of this list. More...
 
label appendUniq (const List< pointIndexHit > &val)
 Append an element if not already in the list. More...
 
void transfer (List< List< pointIndexHit > > &list)
 
void transfer (DynamicList< List< pointIndexHit >, SizeMin > &list)
 
List< pointIndexHit > & newElmt (const label i)
 
void operator= (const UList< List< pointIndexHit > > &a)
 Assignment to UList operator. Takes linear time. More...
 
void operator= (const List< List< pointIndexHit > > &list)
 Assignment operator. Takes linear time. More...
 
void operator= (const SLList< List< pointIndexHit > > &list)
 Assignment to SLList operator. Takes linear time. More...
 
void operator= (const IndirectListBase< List< pointIndexHit >, Addr > &list)
 Assignment from IndirectList. Takes linear time. More...
 
void operator= (const FixedList< List< pointIndexHit >, N > &list)
 Copy assignment from FixedList. More...
 
void operator= (std::initializer_list< List< pointIndexHit > > list)
 Assignment to an initializer list. More...
 
void operator= (const List< pointIndexHit > &val)
 Assignment of all entries to the given value. More...
 
void operator= (const Foam::zero)
 Assignment of all entries to zero. More...
 
void operator= (List< List< pointIndexHit > > &&list)
 Move assignment. Takes constant time. More...
 
void operator= (DynamicList< List< pointIndexHit >, SizeMin > &&list)
 Move assignment. Takes constant time. More...
 
void operator= (SLList< List< pointIndexHit > > &&list)
 Move assignment. Takes constant time. More...
 
IstreamreadList (Istream &is)
 Read List from Istream, discarding contents of existing List. More...
 
IstreamreadList (Istream &is)
 
IstreamreadList (Istream &is)
 
void shallowCopy (const UList< List< pointIndexHit > > &)=delete
 No shallowCopy permitted. More...
 
std::enable_if< std::is_same< bool, TypeT >::value, bool >::type set (const label i, bool val=true)
 A bitSet::set() method for a list of bool. More...
 
- Public Member Functions inherited from UList< T >
 UList (const UList< T > &)=default
 Copy construct. More...
 
constexpr UList () noexcept
 Default construct, zero-sized and nullptr. More...
 
 UList (T *__restrict__ v, const label len) noexcept
 Construct from components. More...
 
label fcIndex (const label i) const noexcept
 
label rcIndex (const label i) const noexcept
 
const TfcValue (const label i) const
 Return forward circular value (ie, next value in the list) More...
 
TfcValue (const label i)
 Return forward circular value (ie, next value in the list) More...
 
const TrcValue (const label i) const
 Return reverse circular value (ie, previous value in the list) More...
 
TrcValue (const label i)
 Return reverse circular value (ie, previous value in the list) More...
 
const Tcdata () const noexcept
 Return pointer to the underlying array serving as data storage. More...
 
Tdata () noexcept
 Return pointer to the underlying array serving as data storage. More...
 
const char * cdata_bytes () const noexcept
 Return pointer to the underlying array serving as data storage,. More...
 
char * data_bytes () noexcept
 Return pointer to the underlying array serving as data storage,. More...
 
Tfirst ()
 Return the first element of the list. More...
 
const Tfirst () const
 Return first element of the list. More...
 
Tlast ()
 Return the last element of the list. More...
 
const Tlast () const
 Return the last element of the list. More...
 
std::streamsize size_bytes () const noexcept
 Number of contiguous bytes for the List data. More...
 
std::streamsize byteSize () const
 
void checkStart (const label start) const
 Check start is within valid range [0,size) More...
 
void checkSize (const label size) const
 Check size is within valid range [0,size]. More...
 
void checkRange (const label start, const label len) const
 Check that start and length define a valid range. More...
 
void checkIndex (const label i) const
 Check index is within valid range [0,size) More...
 
bool uniform () const
 True if all entries have identical values, and list is non-empty. More...
 
label find (const T &val, label pos=0) const
 Find index of the first occurrence of the value. More...
 
label rfind (const T &val, label pos=-1) const
 Find index of the last occurrence of the value. More...
 
bool found (const T &val, label pos=0) const
 True if the value if found in the list. More...
 
void moveFirst (const label i)
 Move element to the first position. More...
 
void moveLast (const label i)
 Move element to the last position. More...
 
void swapFirst (const label i)
 Swap element with the first element. Fatal on an empty list. More...
 
void swapLast (const label i)
 Swap element with the last element. Fatal on an empty list. More...
 
void shallowCopy (const UList< T > &list)
 Copy the pointer and size held by the given UList. More...
 
void deepCopy (const UList< T > &list)
 Copy elements of the given UList. Sizes must match! More...
 
template<class Addr >
void deepCopy (const IndirectListBase< T, Addr > &list)
 Copy elements of the given indirect list. Sizes must match! More...
 
SubList< Tslice (const label pos, label len=-1)
 Return SubList slice (non-const access) - no range checking. More...
 
const SubList< Tslice (const label pos, label len=-1) const
 Return SubList slice (const access) - no range checking. More...
 
SubList< Tslice (const labelRange &range)
 Return SubList slice (non-const access) - with range checking. More...
 
const SubList< Tslice (const labelRange &range) const
 Return SubList slice (const access) - with range checking. More...
 
Toperator[] (const label i)
 Return element of UList. More...
 
const Toperator[] (const label i) const
 Return element of constant UList. More...
 
 operator const Foam::List< T > & () const
 Allow cast to a const List<T>&. More...
 
void operator= (const T &val)
 Assignment of all entries to the given value. More...
 
void operator= (const Foam::zero)
 Assignment of all entries to zero. More...
 
iterator begin () noexcept
 Return an iterator to begin traversing the UList. More...
 
iterator end () noexcept
 Return an iterator to end traversing the UList. More...
 
const_iterator cbegin () const noexcept
 Return const_iterator to begin traversing the constant UList. More...
 
const_iterator cend () const noexcept
 Return const_iterator to end traversing the constant UList. More...
 
const_iterator begin () const noexcept
 Return const_iterator to begin traversing the constant UList. More...
 
const_iterator end () const noexcept
 Return const_iterator to end traversing the constant UList. More...
 
reverse_iterator rbegin ()
 Return reverse_iterator to begin reverse traversing the UList. More...
 
reverse_iterator rend ()
 Return reverse_iterator to end reverse traversing the UList. More...
 
const_reverse_iterator crbegin () const
 Return const_reverse_iterator to begin reverse traversing the UList. More...
 
const_reverse_iterator crend () const
 Return const_reverse_iterator to end reverse traversing the UList. More...
 
const_reverse_iterator rbegin () const
 Return const_reverse_iterator to begin reverse traversing the UList. More...
 
const_reverse_iterator rend () const
 Return const_reverse_iterator to end reverse traversing the UList. More...
 
label size () const noexcept
 The number of elements in the UList. More...
 
bool empty () const noexcept
 True if the UList is empty (ie, size() is zero) More...
 
void swap (UList< T > &list)
 Swap content with another UList of the same type in constant time. More...
 
bool operator== (const UList< T > &a) const
 Equality operation on ULists of the same type. More...
 
bool operator!= (const UList< T > &a) const
 The opposite of the equality operation. Takes linear time. More...
 
bool operator< (const UList< T > &list) const
 Compare two ULists lexicographically. Takes linear time. More...
 
bool operator> (const UList< T > &a) const
 Compare two ULists lexicographically. Takes linear time. More...
 
bool operator<= (const UList< T > &a) const
 Return true if !(a > b). Takes linear time. More...
 
bool operator>= (const UList< T > &a) const
 Return true if !(a < b). Takes linear time. More...
 
IstreamreadList (Istream &is)
 Read List contents from Istream. More...
 
void writeEntry (const word &keyword, Ostream &os) const
 Write the List as a dictionary entry with keyword. More...
 
OstreamwriteList (Ostream &os, const label shortLen=0) const
 Write List, with line-breaks in ASCII when length exceeds shortLen. More...
 
template<class TypeT = T>
std::enable_if< std::is_same< bool, TypeT >::value, bool >::type test (const label i) const
 
template<class TypeT = T>
std::enable_if< std::is_same< bool, TypeT >::value, bool >::type get (const label i) const
 
template<class TypeT = T>
std::enable_if< std::is_same< bool, TypeT >::value, bool >::type unset (const label i)
 
IstreamreadList (Istream &is)
 
OstreamwriteList (Ostream &os, const label) const
 
const booloperator[] (const label i) const
 
Foam::UPstream::commsStructoperator[] (const label procID)
 
const Foam::UPstream::commsStructoperator[] (const label procID) const
 
UPstream::commsStructoperator[] (const label procID)
 
const UPstream::commsStructoperator[] (const label procID) const
 
OstreamwriteList (Ostream &os, const label) const
 
IstreamreadList (Istream &is)
 

Static Public Member Functions

static scalarField minEdgeLength (const triSurface &surf)
 Calculate min edge length for every surface point. More...
 
- Static Public Member Functions inherited from List< List< pointIndexHit > >
static const List< List< pointIndexHit > > & null ()
 Return a null List. More...
 
- Static Public Member Functions inherited from UList< T >
static const UList< T > & null ()
 Return a UList reference to a nullObject. More...
 
static constexpr label max_size () noexcept
 The size of the largest possible UList. More...
 

Static Public Attributes

static scalar alignedCos_ = Foam::cos(degToRad(89.0))
 Cosine between edge and face normal when considered parallel. More...
 

Additional Inherited Members

- Public Types inherited from List< List< pointIndexHit > >
typedef SubList< List< pointIndexHit > > subList
 Declare type of subList. More...
 
- Public Types inherited from UList< T >
typedef T value_type
 The value type the list contains. More...
 
typedef Tpointer
 The pointer type for non-const access to value_type items. More...
 
typedef const Tconst_pointer
 The pointer type for const access to value_type items. More...
 
typedef Treference
 The type used for storing into value_type objects. More...
 
typedef const Tconst_reference
 The type used for reading from constant value_type objects. More...
 
typedef Titerator
 Random access iterator for traversing a UList. More...
 
typedef const Tconst_iterator
 Random access iterator for traversing a UList. More...
 
typedef label size_type
 The type to represent the size of a UList. More...
 
typedef label difference_type
 The difference between iterator objects. More...
 
typedef std::reverse_iterator< iteratorreverse_iterator
 Reverse iterator (non-const access) More...
 
typedef std::reverse_iterator< const_iteratorconst_reverse_iterator
 Reverse iterator (const access) More...
 
- Protected Member Functions inherited from UList< T >
void setAddressableSize (const label n) noexcept
 Set addressed size to be inconsistent with allocated storage. More...
 
void size (const label n)
 Older name for setAddressableSize. More...
 
void writeEntry (Ostream &os) const
 Write the UList with its compound type. More...
 
labelRange validateRange (const labelRange &requestedRange) const
 
UList< T > & operator= (const UList< T > &)=delete
 No copy assignment (default: shallow copy) More...
 
void writeEntry (Ostream &os) const
 
void writeEntry (Ostream &os) const
 

Detailed Description

Holder of intersections of edges of a surface with another surface. Optionally shuffles around points on surface to resolve any 'conflicts' (edge hitting triangle edge, edge hitting point etc.).

Source files

Definition at line 62 of file edgeIntersections.H.

Constructor & Destructor Documentation

◆ edgeIntersections() [1/3]

Construct null.

Definition at line 441 of file edgeIntersections.C.

◆ edgeIntersections() [2/3]

edgeIntersections ( const triSurface surf1,
const triSurfaceSearch query2,
const scalarField surf1PointTol 
)

Construct from surface and tolerance.

Definition at line 448 of file edgeIntersections.C.

References Foam::identity(), PrimitivePatch< FaceList, PointField >::nEdges(), and PrimitivePatch< FaceList, PointField >::points().

Here is the call graph for this function:

◆ edgeIntersections() [3/3]

edgeIntersections ( const List< List< pointIndexHit > > &  intersections,
const labelListList classification 
)

Construct from components.

Definition at line 475 of file edgeIntersections.C.

Member Function Documentation

◆ ClassName()

ClassName ( "edgeIntersections"  )

◆ minEdgeLength()

Foam::scalarField minEdgeLength ( const triSurface surf)
static

Calculate min edge length for every surface point.

Definition at line 488 of file edgeIntersections.C.

References PrimitivePatch< FaceList, PointField >::edges(), forAll, PrimitivePatch< FaceList, PointField >::localPoints(), Foam::mag(), Foam::min(), PrimitivePatch< FaceList, PointField >::pointEdges(), and UList< T >::size().

Here is the call graph for this function:

◆ classification()

const labelListList & classification ( ) const
inline

For every intersection the classification status.

Definition at line 180 of file edgeIntersections.H.

Referenced by edgeIntersections::merge().

Here is the caller graph for this function:

◆ removeDegenerates()

Foam::label removeDegenerates ( const label  nIters,
const triSurface surf1,
const triSurfaceSearch query2,
const scalarField surf1PointTol,
pointField points1 
)

Resolve ties. Shuffles points so all edge - face intersections.

will be on the face interior. Points will be the new surface points. Returns number of iterations needed. (= nIters if still has degenerate cuts)

Definition at line 515 of file edgeIntersections.C.

References Foam::abort(), UList< T >::empty(), Foam::endl(), Foam::FatalError, FatalErrorInFunction, forAll, PrimitivePatch< FaceList, PointField >::nEdges(), Foam::nl, Foam::Pout, rndGen, List< T >::setSize(), UList< T >::size(), triSurfaceSearch::surface(), and List< T >::transfer().

Here is the call graph for this function:

◆ merge()

void merge ( const edgeIntersections subInfo,
const labelList edgeMap,
const labelList faceMap,
const bool  merge = true 
)

Merge (or override) edge intersection for a subset.

(given as edge map and face map - for face indices stored in pointIndexHit.index())

Definition at line 673 of file edgeIntersections.C.

References edgeIntersections::classification(), Foam::faceMap(), forAll, PointIndexHit< PointType >::hit(), PointIndexHit< PointType >::index(), PointIndexHit< PointType >::rawPoint(), List< T >::setSize(), and UList< T >::size().

Here is the call graph for this function:

Member Data Documentation

◆ alignedCos_

Foam::scalar alignedCos_ = Foam::cos(degToRad(89.0))
static

Cosine between edge and face normal when considered parallel.

(note: should be private and make access- and set- function)

Definition at line 144 of file edgeIntersections.H.


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