Recent changes to Home

Home modified by hermsen

hermsen — Sat, 06 Jul 2024 21:02:32 -0000

--- v48
+++ v49
@@ -128,21 +128,18 @@


 // Program
-PROGRAM Main
-VAR
     i : __UXINT;
     BuildList : BOOL := TRUE;
     RemoveElem: BOOL;
     List : LinkedList.List;
+    ListSize : UDINT;
     El1: FB_MyElement;
     El2: FB_MyElement;
     El3: FB_MyElement;
     El4: FB_MyElement;     
-    ListSize : UDINT := 0;
     itfElement : LinkedList.IElement;
     itfCurElement : IElement2;
-    CurCount : UINT;
-END_VAR
+    HasNext : BOOL;


 // Body
@@ -153,6 +150,7 @@
    List.AppendElem( El2 );
    List.AppendElem( El3 );
    List.AppendElem( El4 );
+   itfElement := List.HeadElem;
    BuildList := FALSE;       
 END_IF

@@ -166,22 +164,15 @@
     RemoveElem := FALSE;
 END_IF;

-ListSize := List.ListSize;
-IF ListSize <> 0 THEN // not empty
-    itfElement := List.HeadElem;
-    IF __QUERYINTERFACE( itfElement, itfCurElement ) THEN 
-        WHILE itfCurElement <> 0 DO
-            FOR i := 1 TO 10 DO
-            // Count gets tallied up
-                itfCurElement.Count();
-            END_FOR;
-            CurCount := itfCurElement.GetCount;
-            // Get the next element by using the pointer stored in the element itself (we can also use PrevElem to get the previous element)
-            itfElement := itfCurElement.NextElem;
-            __QUERYINTERFACE( itfElement, itfCurElement );
-        END_WHILE
-    END_IF;
-END_IF
+List.ItterateRestart( HasNext => HasNext );
+WHILE HasNext DO
+    List.ItterateNext( itfElement => itfElement, HasNext => HasNext );
+    IF __QUERYINTERFACE( itfElement, itfCurElement ) THEN
+        itfCurElement.Count();
+        // get next element
+        CurCount := itfCurElement.GetCount;
+    END_IF
+END_WHILE


 ~~~

Home modified by hermsen

hermsen — Sat, 06 Jul 2024 20:17:58 -0000

--- v47
+++ v48
@@ -31,6 +31,7 @@


 INTERFACE IElement2 EXTENDS LinkedList.IElement
+METHOD ReturnInstance : POINTER TO FB_MyElement;
 METHOD Count : UINT;
 PROPERTY GetCount : UINT
 // Get only
@@ -124,8 +125,13 @@
 * Declare an instance of LIST
 * Declare an instance of FB_MyElement;
 ~~~
+
+
+// Program
+PROGRAM Main
 VAR
-    BuildList : BOOL;
+    i : __UXINT;
+    BuildList : BOOL := TRUE;
     RemoveElem: BOOL;
     List : LinkedList.List;
     El1: FB_MyElement;
@@ -133,46 +139,51 @@
     El3: FB_MyElement;
     El4: FB_MyElement;     
     ListSize : UDINT := 0;
+    itfElement : LinkedList.IElement;
     itfCurElement : IElement2;
+    CurCount : UINT;
 END_VAR
-  
-// Body
+
+
+// Body
+i := i + 1;
+
 IF BuildList THEN // Add all elements
    List.AppendElem( El1 );
    List.AppendElem( El2 );
    List.AppendElem( El3 );
    List.AppendElem( El4 );
-   BuildList := FALSE;  
-   CurCount : UINT;   
+   BuildList := FALSE;       
 END_IF

 IF RemoveElem THEN // Removes the latest valid accessed element
-   IF itfCurElement <> 0 THEN
-      List.RemoveElem( itfCurElement );
-   END_IF
-   RemoveElem := FALSE;
+    IF itfCurElement <> 0 THEN
+        //__QUERYINTERFACE(<itf_source>,<itf_dest>);
+        IF __QUERYINTERFACE( itfElement, itfCurElement ) THEN 
+            List.RemoveElem( itfElement );
+        END_IF;
+    END_IF
+    RemoveElem := FALSE;
 END_IF;

 ListSize := List.ListSize;
-
 IF ListSize <> 0 THEN // not empty
-
-    itfCurElement := List.HeadElem;
-
-    WHILE itfCurElement <> 0 DO
-        
-        FOR i := 1 TO 10 DO
-        // Count gets tallied up
-            itfCurElement.Count();
-        END_FOR;
-        CurCount := itfCurElement.GetCount;
-        
-        // Get the next element by using the pointer stored in the element itself (we can also use PrevElem to get the previous element)
-        itfCurElement := itfCurElement.NextElem;
-        
-    END_WHILE
-    
+    itfElement := List.HeadElem;
+    IF __QUERYINTERFACE( itfElement, itfCurElement ) THEN 
+        WHILE itfCurElement <> 0 DO
+            FOR i := 1 TO 10 DO
+            // Count gets tallied up
+                itfCurElement.Count();
+            END_FOR;
+            CurCount := itfCurElement.GetCount;
+            // Get the next element by using the pointer stored in the element itself (we can also use PrevElem to get the previous element)
+            itfElement := itfCurElement.NextElem;
+            __QUERYINTERFACE( itfElement, itfCurElement );
+        END_WHILE
+    END_IF;
 END_IF
+
+
 ~~~


</itf_dest></itf_source>

Home modified by hermsen

hermsen — Sat, 06 Jul 2024 20:05:27 -0000

--- v46
+++ v47
@@ -18,16 +18,25 @@
 * Insert the Library Reference in your program's library manager.
 * Declare a new FB named FB_ExtendedElement
 * We need to either to
-    * 1) extend ~FB_Element~ since it has been decorated as ~~~ ABSTRACT ~~~ or 
-    * 2) implement interface ~~~ LinkedList.IElement ~~~
-
-
- > **Pro Tip**
-   Any new FB that will be a part of the List should *preferably* use method 2) implement interface. This way FB_ExtendElement will act as a baseclass for your Element without being itself of type "FB_ELEMENT". EXTENDS means "IS OF CLASS .. ", while IMPLEMENTS means "MAKES USE OF INTERFACE .. ". 
-   If you use encapsulation and composition for the appropriate interface, as a bonus you gain more freedom and more flexibility, it isn't a CLASS of! However, the penalty is that it will demand more programming effort since the Interface needs to be implemented.
-
-~~~
-FUNCTION_BLOCK FB_MyElement IMPLEMENTS LinkedList.IElement // We choose implement interface here
+    * A) extend ~FB_Element~ since it has been decorated as ~~~ ABSTRACT ~~~ or 
+    * B) implement interface ~~~ LinkedList.IElement ~~~
+
+
+ > **Tip**
+   Any  FB that will be a part of the List should *preferably* use method B) implement interface. 
+   This way FB_ExtendElement will act as a baseclass for your Element without being itself of type "FB_ELEMENT". EXTENDS means "IS OF CLASS .. ", while IMPLEMENTS means "MAKES USE OF INTERFACE .. ". 
+   If you use encapsulation and composition for the appropriate interface,you gain more freedom and more flexibility as the FB is not a CLASS of. However, the penalty taken is that this will demand more programming effort since the Interface(s) need to be implemented.
+
+~~~
+
+
+INTERFACE IElement2 EXTENDS LinkedList.IElement
+METHOD Count : UINT;
+PROPERTY GetCount : UINT
+// Get only
+
+
+FUNCTION_BLOCK FB_MyElement IMPLEMENTS IElement2
 VAR
     _itfPrev : IElement;
     _itfNext : IElement;
@@ -38,7 +47,7 @@
 // Body


-METHOD IsListMemberOf : BOOL // xMember
+METHOD IsListMemberOf : BOOL
 VAR_INPUT
    itfList : IList;
 END_VAR
@@ -124,21 +133,22 @@
     El3: FB_MyElement;
     El4: FB_MyElement;     
     ListSize : UDINT := 0;
-    itfCurElement : IElement;
+    itfCurElement : IElement2;
 END_VAR

 // Body
 IF BuildList THEN // Add all elements
-   List.AppendElement( El1 );
-   List.AppendElement( El2 );
-   List.AppendElement( El3 );
-   List.AppendElement( El4 );
-   BuildList := FALSE;       
+   List.AppendElem( El1 );
+   List.AppendElem( El2 );
+   List.AppendElem( El3 );
+   List.AppendElem( El4 );
+   BuildList := FALSE;  
+   CurCount : UINT;   
 END_IF

 IF RemoveElem THEN // Removes the latest valid accessed element
    IF itfCurElement <> 0 THEN
-      List.RemoveElement( itfCurElement );
+      List.RemoveElem( itfCurElement );
    END_IF
    RemoveElem := FALSE;
 END_IF;
@@ -166,11 +176,12 @@
 ~~~


-> PRO TIPS
+> TIPS
   Always obtain access to elements via the functionblock instance of List.
   Element require some burnerplate-code when compared to array's but they also more flexible due to their dynamic nature.
-  You can even claim dynamic Elements on the fly through use of the pre claimed dynamic memory pool factory class. This factory reserves a pre-defined number of elements for you which you can claim or release during runtime. Just check if a new element can be claimed (is there a free lement available from the pool?), claim it, add to the list with AddElement( .. ), ready.
- 
+  You could opt to implement dynamic Elements 'on the fly' through use of a pre-claimed dynamic memory pool factory class. This factory reserves a pre-defined number of elements for you which you can claim or release during runtime. Just check if a new element can be claimed (is there a free lement available from the pool?), claim it, add to the list with AddElement( .. ), done.
+  Advantage of this type of pool is that the compiler still needs reserve the pool memory during compile phase and thus the controller does not assign dynamic memory during runtime. 
+  
 # Download
 **By downloading and using our software you abide by the [MIT License](https://forge.codesys.com/lib/cobolt/code/HEAD/tree/license.txt?format=raw)**

@@ -179,9 +190,9 @@
 # Requirements
 System requirements and restrictions | Info 
 ---------- | ---------- 
-Programming System      | CODESYS Development System Version 3.5.9.0 or higher
-Runtime System      | CODESYS Control Version 3.5.9.0 or higher
-Licensing   | -
+Programming System      | CODESYS Development System Version >= 3.5.9.0
+Runtime System      | CODESYS Control Version >= 3.5.9.0
+Licensing   | open source
 Required Accessories | -

Home modified by h-hermsen

h-hermsen — Sun, 17 Apr 2022 23:01:42 -0000

--- v45
+++ v46
@@ -18,7 +18,7 @@
 * Insert the Library Reference in your program's library manager.
 * Declare a new FB named FB_ExtendedElement
 * We need to either to
-    * 1) extend ~~~ FB_Element ~~~ since it has been decorated as ~~~ ABSTRACT ~~~ or 
+    * 1) extend ~FB_Element~ since it has been decorated as ~~~ ABSTRACT ~~~ or 
     * 2) implement interface ~~~ LinkedList.IElement ~~~

Home modified by h-hermsen

h-hermsen — Fri, 18 Feb 2022 00:48:36 -0000

--- v44
+++ v45
@@ -17,11 +17,14 @@
 # Usage
 * Insert the Library Reference in your program's library manager.
 * Declare a new FB named FB_ExtendedElement
-* We need to either 1) extend at least one FB_Element since it has been decorated as ABSTRACT.
-                 or 2) implement interface: LinkedList.IElement. 
+* We need to either to
+    * 1) extend ~~~ FB_Element ~~~ since it has been decorated as ~~~ ABSTRACT ~~~ or 
+    * 2) implement interface ~~~ LinkedList.IElement ~~~
+

  > **Pro Tip**
-   Any new FB that will be a part of the List should *preferably* use method 2) implement interface. This way FB_ExtendElement will act as a baseclass for your Element without being itself of type "FB_ELEMENT" (EXTENDS means "IS OF CLASS .. ", while IMPLEMENTS means "MAKES USE OF INTERFACE .. "). If you use encapsulation and composition for the appropriate interface, as a bonus it will provide you with more freedom and more flexibility as your FB is not inflicted with the dependancy inversion principle. However, as a penalty it will demand more programming effort since all methods and properties need to be implemented for the interface need to be implemented. 
+   Any new FB that will be a part of the List should *preferably* use method 2) implement interface. This way FB_ExtendElement will act as a baseclass for your Element without being itself of type "FB_ELEMENT". EXTENDS means "IS OF CLASS .. ", while IMPLEMENTS means "MAKES USE OF INTERFACE .. ". 
+   If you use encapsulation and composition for the appropriate interface, as a bonus you gain more freedom and more flexibility, it isn't a CLASS of! However, the penalty is that it will demand more programming effort since the Interface needs to be implemented.

 ~~~
 FUNCTION_BLOCK FB_MyElement IMPLEMENTS LinkedList.IElement // We choose implement interface here

Home modified by h-hermsen

h-hermsen — Fri, 18 Feb 2022 00:41:55 -0000

--- v43
+++ v44
@@ -1,6 +1,6 @@
 [[startpage]]
 [[members]]
-[[section bgcolor=darkgrey color=white align=right]]
+[[section bgcolor=white color=black align=right]]
 [[img src=https://forge.codesys.com/svn/lib,counit,code/trunk/www/logo_codesys_forge.png height=96p align=left]][[img src=https://forge.codesys.com/lib/colist/screenshot/coLink%20logo%20round%20blue%20inverted.png height=96p align=left]]
 [[section bgcolor=darkgrey color=white align=center]]
 # co🔗e: Linked List

Home modified by h-hermsen

h-hermsen — Fri, 18 Feb 2022 00:41:19 -0000

--- v42
+++ v43
@@ -1,9 +1,7 @@
 [[startpage]]
 [[members]]
-[[section bgcolor=white color=white align=right]]
+[[section bgcolor=darkgrey color=white align=right]]
 [[img src=https://forge.codesys.com/svn/lib,counit,code/trunk/www/logo_codesys_forge.png height=96p align=left]][[img src=https://forge.codesys.com/lib/colist/screenshot/coLink%20logo%20round%20blue%20inverted.png height=96p align=left]]
-An opensource LinkedList Solution
-
 [[section bgcolor=darkgrey color=white align=center]]
 # co🔗e: Linked List
 **This Page**

Home modified by h-hermsen

h-hermsen — Fri, 18 Feb 2022 00:40:44 -0000

--- v41
+++ v42
@@ -1,6 +1,6 @@
 [[startpage]]
 [[members]]
-[[section bgcolor=darkgrey color=black align=right]]
+[[section bgcolor=white color=white align=right]]
 [[img src=https://forge.codesys.com/svn/lib,counit,code/trunk/www/logo_codesys_forge.png height=96p align=left]][[img src=https://forge.codesys.com/lib/colist/screenshot/coLink%20logo%20round%20blue%20inverted.png height=96p align=left]]
 An opensource LinkedList Solution

Home modified by h-hermsen

h-hermsen — Fri, 18 Feb 2022 00:40:08 -0000

--- v40
+++ v41
@@ -1,9 +1,10 @@
 [[startpage]]
 [[members]]
-[[section bgcolor=white color=black align=right]]
+[[section bgcolor=darkgrey color=black align=right]]
 [[img src=https://forge.codesys.com/svn/lib,counit,code/trunk/www/logo_codesys_forge.png height=96p align=left]][[img src=https://forge.codesys.com/lib/colist/screenshot/coLink%20logo%20round%20blue%20inverted.png height=96p align=left]]
+An opensource LinkedList Solution

-[[section bgcolor=grey color=white align=center]]
+[[section bgcolor=darkgrey color=white align=center]]
 # co🔗e: Linked List
 **This Page**
 [Introduction](#introduction) | [Usage](#usage) | [Download](#download) | [Requirements](#requirements) | [Acknowledgements](#acknowledgements)

Home modified by h-hermsen

h-hermsen — Tue, 15 Feb 2022 22:53:47 -0000

--- v39
+++ v40
@@ -25,7 +25,7 @@
    Any new FB that will be a part of the List should *preferably* use method 2) implement interface. This way FB_ExtendElement will act as a baseclass for your Element without being itself of type "FB_ELEMENT" (EXTENDS means "IS OF CLASS .. ", while IMPLEMENTS means "MAKES USE OF INTERFACE .. "). If you use encapsulation and composition for the appropriate interface, as a bonus it will provide you with more freedom and more flexibility as your FB is not inflicted with the dependancy inversion principle. However, as a penalty it will demand more programming effort since all methods and properties need to be implemented for the interface need to be implemented.

 ~~~
-FUNCTION_BLOCK FB_ExtendedElement EXTENDS Element // Element is decorated with ABSTRACT!
+FUNCTION_BLOCK FB_MyElement IMPLEMENTS LinkedList.IElement // We choose implement interface here
 VAR
     _itfPrev : IElement;
     _itfNext : IElement;
@@ -34,7 +34,6 @@
 END_VAR

 // Body
-SUPER^();


 METHOD IsListMemberOf : BOOL // xMember
@@ -92,7 +91,7 @@
 _itfPrev := PrevElem;


-METHOD ReturnInstance : POINTER TO FB_ExtendedElement
+METHOD ReturnInstance : POINTER TO FB_MyElement

 // Body
 ReturnInstance := THIS;
@@ -112,32 +111,41 @@
 ~~~

 * Declare an instance of LIST
-* Declare an instance of FB_ExtendedElement;
+* Declare an instance of FB_MyElement;
 ~~~
 VAR
-    BuildList : Bool;
+    BuildList : BOOL;
+    RemoveElem: BOOL;
     List : LinkedList.List;
-    Extended1: FB_ExtendedElement;
-    Extended2: FB_ExtendedElement;
-    Extended3: FB_ExtendedElement;
-    Extended4: FB_ExtendedElement;     
+    El1: FB_MyElement;
+    El2: FB_MyElement;
+    El3: FB_MyElement;
+    El4: FB_MyElement;     
     ListSize : UDINT := 0;
     itfCurElement : IElement;
 END_VAR

 // Body
-IF BuildList THEN
-   List.AppendElement( Extended1 );
-   List.AppendElement( Extended2 );
-   List.AppendElement( Extended3 );
-   List.AppendElement( Extended4 );
+IF BuildList THEN // Add all elements
+   List.AppendElement( El1 );
+   List.AppendElement( El2 );
+   List.AppendElement( El3 );
+   List.AppendElement( El4 );
    BuildList := FALSE;       
 END_IF

-ListSize := List.ListSize;            
+IF RemoveElem THEN // Removes the latest valid accessed element
+   IF itfCurElement <> 0 THEN
+      List.RemoveElement( itfCurElement );
+   END_IF
+   RemoveElem := FALSE;
+END_IF;
+
+ListSize := List.ListSize;
+
 IF ListSize <> 0 THEN // not empty

-    itfCurElement := List.HeadElem; // Point itfCurElement to the first element the list was initialised with
+    itfCurElement := List.HeadElem;

     WHILE itfCurElement <> 0 DO

@@ -153,15 +161,14 @@
     END_WHILE

 END_IF
-
-
 ~~~


 > PRO TIPS
   Always obtain access to elements via the functionblock instance of List.
-  Element require more burnerplate-code when compared to array's but are also more flexible due to their dynamic nature. 
-
+  Element require some burnerplate-code when compared to array's but they also more flexible due to their dynamic nature.
+  You can even claim dynamic Elements on the fly through use of the pre claimed dynamic memory pool factory class. This factory reserves a pre-defined number of elements for you which you can claim or release during runtime. Just check if a new element can be claimed (is there a free lement available from the pool?), claim it, add to the list with AddElement( .. ), ready.
+ 
 # Download
 **By downloading and using our software you abide by the [MIT License](https://forge.codesys.com/lib/cobolt/code/HEAD/tree/license.txt?format=raw)**