GenericQueue_SingleTask.RemoveAll (METH) ¶ METHOD FINAL RemoveAll Removes all elements of the queue and resets the end of data flag. Invalidates the pointer returned by a prior call to GetFirst.
GenericQueue_SingleTask.RemoveFirst (METH) ¶ METHOD FINAL RemoveFirst : BOOL Removes the first element of the queue. Invalidates the pointer returned by a prior call to GetFirst. InOut: Scope Name Type Return RemoveFirst BOOL
GenericQueue_SingleTask.RemoveFirstN (METH) ¶ METHOD FINAL RemoveFirstN : BOOL Removes the first n elements of the queue. Invalidates the pointer returned by a prior call to GetFirst. InOut: Scope Name Type Input n UDINT Return RemoveFirstN BOOL
GenericQueue_SingleTask.RemoveLast (METH) ¶ METHOD FINAL RemoveLast : BOOL Removes the last element of the queue. InOut: Scope Name Type Return RemoveLast BOOL
GenericQueue_SingleTask.RemoveLastN (METH) ¶ METHOD FINAL RemoveLastN : BOOL Removes the last n elements of the queue. InOut: Scope Name Type Input n UDINT Return RemoveLastN BOOL
GenericQueue_SingleTask.Reset (METH) ¶ METHOD FINAL Reset
GenericQueue_SingleTask.SetEndOfData (METH) ¶ METHOD PUBLIC FINAL SetEndOfData Marks the end of data flag of the queue.
FindRoot_NewtonExt (FB) ¶ FUNCTION_BLOCK FINAL FindRoot_NewtonExt See FindRoot_Newton. In addition, we update an interval that’s supposed to contain the solution, and, once we’ve got both a negative and a positive limit, make sure that this interval is never left. (Depending on the first derivative, Newton iteration tends to leave that interval.) InOut: Scope Name Type Initial Comment Input bEnable BOOL Initializes the computation on the rising edge. dx0 LREAL The initial guess df0 LREAL The function value at x0 df0_s LREAL The derivative at x0 dEpsX LREAL g_EPS_X_ROOT Epsilon for the relative size of the narrowed down interval containing the root dEpsF LREAL g_EPS_F_ROOT Epsilon for the absolute magnitude of the function at the approximated root dfi LREAL The value of f at point xi. Only necessary after initialization. dfi_s LREAL The derivative of f at point xi. Only necessary after initialization. Output bBusy BOOL Whether the computation is active bDone BOOL Whether the computation is finished dxi LREAL The approximation xi of the root
FindRoot_RegulaFalsi (FB) ¶ FUNCTION_BLOCK FINAL FindRoot_RegulaFalsi Then, while rf.bBusy, call it while supplying function values at the requested points rf.c: rf(fc:= f(rf.c)) ; Note: the values of all inputs except bEnable and fc are only evaluated at a rising edge of bEnable, which resets the function block. The root is approximated using the regula falsi method of locating a root of a continuous function p in the interval ]a,b[ given that f(a) * f(b) < 0. See http://de.wikipedia.org/wiki/Regula_falsi . InOut: Scope Name Type Initial Comment Input bEnable BOOL Initializes the computation on the rising edge. variant RF_Variant Which variant to use to avoid retention of one end point da_In LREAL The lower limit of the interval db_In LREAL The upper limit of the interval dfa_In LREAL The value of f(da_In) dfb_In LREAL The value of f(db_In) dEpsX LREAL g_EPS_X_ROOT Epsilon for the relative size of the narrowed down interval containing the root dEpsF LREAL g_EPS_F_ROOT Epsilon for the absolute magnitude of the function at the approximated root fc LREAL The value of f at point c. Only necessary after initialization. Output bBusy BOOL Whether the computation is active bDone BOOL Whether the computation is finished c LREAL The point c in [a..b] where the function value is requested
FindRoot_Ridder (FB) ¶ FUNCTION_BLOCK FINAL FindRoot_Ridder Then, while rf.bBusy, call it while supplying function values at the requested points rf.c: rz(fc:= f(rz.c)) ; Note: the values of all inputs except bEnable and fc are only evaluated at a rising edge of bEnable, which resets the function block. The root is approximated using ridders method of locating a root of a continuous function f in the interval ]a,b[ given that f(a) * f(b) < 0 ; InOut: Scope Name Type Initial Comment Input bEnable BOOL Initializes the computation on the rising edge. da_In LREAL The lower limit of the interval db_In LREAL The upper limit of the interval dfa_In LREAL The value of f(da_In) dfb_In LREAL The value of f(db_In) dEpsX LREAL g_EPS_X_ROOT Epsilon for the relative size of the narrowed down interval containing the root dEpsF LREAL g_EPS_F_ROOT Epsilon for the absolute magnitude of the function at the approximated root fc LREAL The value of f at point c. Only necessary after initialization. Output bBusy BOOL Whether the computation is active bDone BOOL Whether the computation is finished c LREAL The point c in [a..b] where the function value is requested