TeaScript 0.10.0 Release, changed license to AGPL-3.0

Author: Florian Thake

CONTRIBUTING.md

@@ -0,0 +1,12 @@
+This is the contributor license agreement. If you are looking for the usage license, see COPYRIGHT.TXT
+
+## TeaScript C++ Library Contributor License Agreement
+
+By contributing content to this repository (TeaScript-Cpp-Library) (i.e., submitting a pull request for inclusion in this repository):
+- You warrant that your material is original and owned by you.
+- With your contribution(s) you grant a sublicensable, irrevocable, perpetual, worldwide, non-exclusive, royalty-free and fully paid-up copyright and trade secret license to reproduce, adapt, translate, modify, and prepare derivative works of, publicly display, publicly perform, sublicense, make available and distribute your contribution(s) and any derivative works thereof under license terms of Florian Thake’s choosing.
+- For the avoidance of doubt, I, Florian Thake, have the right, but no obligation whatsoever to utilize any contribution.
+
+## Important
+I don't want waste your work and time. So, please before you start to program major changes / extensions or whatever, reach out to me first.
+I am most likely not accepting major changes or extensions which we have not agreed before hand.

COPYRIGHT.TXT

@@ -1,15 +1,34 @@
 Except where otherwise noted all files included are copyrighted by Florian Thake.
 
-Copyright (c) 2023 Florian Thake <support |at| tea-age.solutions>. All rights reserved.
+Copyright (c) 2023 Florian Thake <contact |at| tea-age.solutions>.
 
 
-See included LICENSE.TXT for usage conditions and permissions.
+All source files of the TeaScript C++ Library are dual licensed.
+This copy is licensed under the GNU AFFERO GENERAL PUBLIC LICENSE Version 3
+See included LICENSE.TXT or <https://www.gnu.org/licenses/>.
+If you cannot or don't want use this AGPL version, 
+you can ask for a different license via the contact information below.
+
+
+Additionally:
+
+All files marked with 
+SPDX-License-Identifier: AGPL-3.0-only 
+are licensed under the GNU AFFERO GENERAL PUBLIC LICENSE Version 3
+
+See included LICENSE.TXT or <https://www.gnu.org/licenses/>.
+
+
+All files marked with 
+SPDX-License-Identifier: MIT
+are licensed under the MIT License.
+See included MIT_LICENSE.TXT 
 
 
 Florian Thake
 TeaAge Solutions
 https://tea-age.solutions 
 
-Email: support |at| tea-age.solutions
+Email: contact |at| tea-age.solutions
 Alternative: tea.age.solutions |at| email.de
 

Known_Issues.txt

@@ -26,11 +26,7 @@ Beside feature incompleteness there are the following known issues which will be
     For convert i64 to f64 you can either use to_f64 or simply add 0.0 for f64 promotion.
 
 
-4.) [PLATFORM: any]
-    Actually only the last statement/expression inside an expression formed with parantheses will be evaluated!
-    (a := 4, b := 5) // the assignment to a will not be done!
-    This is because actually parenthesis with more than one expression are reserved for build tuples.
-    But tuples are not implemented yet.
+4.) [PLATFORM: any] : Solved! (Tuples are implemented now.)
 
 
 5.) [PLATFORM: Windows]
@@ -65,4 +61,15 @@ Beside feature incompleteness there are the following known issues which will be
 
 8.) [PLATFORM: Linux]
     CoreLibrary function clock_utc() will return UTC time _without_ leap seconds.
+    
+9.) [PLATFORM: Linux]
+    The readline functionality (e.g. for the REPL) lacks history and nice editing support as it is present on Windows.
+    
+10.) [PLATFORM: any]
+     Accessing nested tuples via index must be surrounded with parenthesis like this:
+     (tup.0).1  // access index 1 of the tuple at index 0 of the tuple 'tup'.
+     note: tup.0.1 is parsed to ID: tup, dot-op, f64( 0.1 ) which results only in index 0 of tup.
 
+11.) [PLATFORM: any]
+     the 'debug' operator displays a dot (.) instead of the name for tuple elements 
+     although the element itself is displayed correct.

LICENSE.TXT

@@ -15,7 +15,7 @@ in a non backwards compatible or a non upgradeable way without prior notice with
 
 If you encounter bugs or problems, have feature wishes or any other question you may try to contact:
 
-support |at| tea-age.solutions
+contact |at| tea-age.solutions
 
 
 Florian Thake

NO_WARRANTY.TXT

@@ -0,0 +1,29 @@
+#!/opt/TeaAgeSolutions/TeaScript/bin/TeaScript
+/*
+ * SPDX-FileCopyrightText:  Copyright (C) 2023 Florian Thake, <contact |at| tea-age.solutions>.
+ * SPDX-License-Identifier: MIT
+ * see included file MIT_LICENSE.txt
+ */
+
+// this script prints all files of given dir (or current working dir if invoked without arguments)
+
+not is_defined arg1 and (def arg1 := ".")
+
+def cur := readdirfirst( arg1 )
+println( "file listing of %(cur.path): ")
+if( not cur.valid ) {
+    if( cur.error > 0 ) {
+        println( "error: %(cur.error)" )
+    }
+}
+repeat {
+    if( not cur.valid ) { stop }
+    
+    if( cur.is_file ) {
+        println( "file: %(cur.name), size: %(cur.size), last modified: %(cur.last_modified)" )
+    } else if( cur.is_dir ) {
+        println( "dir: %(cur.name), last modified: %(cur.last_modified)" )
+    }
+    
+    cur := readdirnext( cur )
+}

demo/dir.tea

@@ -0,0 +1,65 @@
+#!/opt/TeaAgeSolutions/TeaScript/bin/TeaScript
+/*
+ * SPDX-FileCopyrightText:  Copyright (C) 2023 Florian Thake, <contact |at| tea-age.solutions>.
+ * SPDX-License-Identifier: MIT
+ * see included file MIT_LICENSE.txt
+ */
+ 
+// This is a demo script for showing a double linked list with the help of named tuples.
+
+// NOTE: If you need a list, using an index based tuple together with the following helper functions is a common alternative:
+//       _tuple_append, _tuple_insert, _tuple_remove, _tuple_swap + the ordinary other tuple functions.
+
+
+// factory function for a new node with payload data
+func create_node( data )
+{
+    def node      := _tuple_create()   // empty tuple
+    def node.prev := _tuple_create()   // empty tuple
+    def node.next := _tuple_create()   // empty tuple
+    def node.data := data
+    node
+}
+
+
+// insert a new node with given data right after the given node.
+func insert( node @=, data )
+{
+    def new := create_node( data )
+
+    if( node.next ) { // checks for not empty tuple
+        new.next @= node.next
+        node.next.prev @= new
+    }
+    node.next @= new
+    new.prev  @= node
+
+    void
+}
+
+
+// create the head of the list
+
+def head := create_node( 1 )
+
+// insert some data....
+insert( head, 4 )
+insert( head, 3 )
+insert( head, 2 )
+
+// iterate over the list and print the data 
+def cur @= head
+repeat {
+    if( cur ) { // checks for not empty tuple
+        println( cur.data )
+        cur @= cur.next
+    } else {
+        stop
+    }
+}
+
+// NOTE: for longer running scripts it could be necessary to manual cleanup the list
+//       after it is not needed anymore due to the cyclic references formed by prev/next.
+//       But for short running scripts like this it is not necessary.
+
+println( "END!" )