Linked lists are suitable as a flexible and modular way to implement simple and powerful code with ease. This library will allow you to leverage the simplicity, power and flexibility of linked lists.
A linked list is a data structure that represents a sequence of nodes (Elements). This library implements a so called "double linked list", which simply means that the list gives each Element pointers to both the next Element and the previous Element. Unlike an array, a linked list does not provide constant time access to a particular “index” within the list. This means that if you’d like to find the K-th element in the list, you will need to iterate through K elements. The benefit of a linked list is that you can add and remove Elements from the list during runtime so this means you can very easily extend your code with new FB's without extra coding since interaction with lists is always done in FOR loops.
This means that by design your code doesn't need to be rewritten as demonstrated in the example below 👇
Insert the Library Reference in your program.
Declare a new FB called FB_ExtendedElement
// we need to extend at least one FB_Element since it has been decorated as ABSTRACT.// Any new FB that will be a part of the List should preferably use encapsulation and composition to implement// FB_ExtendedElement. So FB_ExtendElement will act as a baseclass for your Element.// If you use encapsulationn and composition it will provide you with (way) more flexibility but also more programming since you have to encapsulate/composite all methods and properties tooFUNCTION_BLOCKFB_ExtendedlementEXTENDSLinkedList.FB_ElementVAR_uiCount:UINT:=0;END_VAR// BodySuper^();METHODReturnInstance:POINTERTOFB_ExtendedElement// BodyReturnInstance:=THIS;METHODCount:UINT;// Body_uiCount:=uiCount+1;