PathElemQueue.Append (METH) ¶ METHOD FINAL Append : BOOL Tries to append a new element to the queue. Returns TRUE if the queue was not full yet, FALSE otherwise. InOut: Scope Name Type Inout Const geo PathElem Input dS0 LREAL Return Append BOOL
PathElemQueue.Capacity (METH) ¶ METHOD FINAL Capacity : UDINT The maximum number of samples that can be stored in the queue InOut: Scope Name Type Return Capacity UDINT
PathElemQueue.Full (METH) ¶ METHOD FINAL Full : BOOL Returns whether the queue is full. InOut: Scope Name Type Return Full BOOL
PathElemQueue.GetFromStart (METH) ¶ METHOD FINAL GetFromStart : POINTER TO PathElemOff Returns a pointer to the n-th element if the queue is at least n elements, otherwise 0. The pointer is valid until the next call to RemoveFirst. Only to be called safely from the consumer task, or when it is made sure that no elements are removed concurrently. InOut: Scope Name Type Input n UDINT Return GetFromStart POINTER TO PathElemOff
PathPosition (STRUCT) ¶ TYPE PathPosition : STRUCT InOut: Name Type segment SegmentId dS LREAL elemId PathElem_Id
PathPosition_Equal (FUN) ¶ FUNCTION PathPosition_Equal : BOOL InOut: Scope Name Type Inout Const pp0 PathPosition pp1 PathPosition Return PathPosition_Equal BOOL
PathElemQueue_ReadWritePos (STRUCT) ¶ TYPE PathElemQueue_ReadWritePos : STRUCT InOut: Name Type nPosPathElemQueue UDINT posElemFunQueue ElemFunQueue_ReadWritePos
PathElemQueue_StartOfSegment (FUN) ¶ FUNCTION PathElemQueue_StartOfSegment InOut: Scope Name Type Inout Const path PathElemQueue Input segment SegmentId Output Path_StartOfSegment POINTER TO PathElemOff k UDINT dS0 LREAL
PathElemQueue.SpaceElemsLeft (METH) ¶ METHOD FINAL SpaceElemsLeft : UDINT Returns how many samples may be appended to the queue. InOut: Scope Name Type Return SpaceElemsLeft UDINT
PathElemQueue.StartCycle (METH) ¶ METHOD FINAL StartCycle