This is a living document - delete things when done. Avoid discussion.
-Current version (Jamison Creek)
-- global consts
+Current version (Cataract Creek)
+- functions to return type with 'use'
+- functions to return structure with name assignment - bare 'use'?
+- '?' prefix operator returns Boolean
+- reference to struct (@foo), with @new, @free, @nil
+- more number types, no units yet
+
+Later
+- string manipulation
+- file i/o
+- enum
+- basic methods
- structs
- - const or variable fields
- - initial value
+ - const fields ... what does that mean? Assign once as initialization?
+ Can be used for array size? What else?
- anonymous field - array or struct (or pointer to these)
- - [] can apply to anon array field
- - anon struct field gets fields interpolated
+ multiple anon struct are allowed if they don't conflict
+ no - transparent fields! They still have a name, but you can
+ look through it.
+ - [] can apply to transparent array field
+ - transparent struct field gets fields interpolated
-Next version ??
+ - How to give attributes? just say the word?
+ struct foobar:
+ x:content transparent
+ size:number
-- change 'labels' to only be created for 'use'
-- handle syntax errors better - recover quickly.
- manifest values for arrays and structs [a,b,c]
+ or [.foo=a, .bar=b] or [ [1]=a, [2]=b]
+ That last doesn't parse easily, unless we require tags... not a good idea.
+ [ .[1] = a, .[2] = b ] ?? Maybe.
+ or () to group, [] for index. To (.foo=a) ( [1] = b )
+
+ I think that last works. () might almost be optional
+ .foo=a
+ is an expression means a structure with a .foo field assined to 'a'
+ [3] = 2
+ is an array for at least 4 elements with 4th set to 2.
+
- yet more operators
<< >> #
bit-ops & | ~ &~
op=
-- split values so I can have an array of just the value (1 byte for u8)
-- integers, unsigned, bitfield, float
+- integers, unsigned, bitfield, float, double?
- pointers
- owned or borrowed
- - overloaded or pure
+ - pure, loaded, overloaded, augmented
+ - owned: once, counted, collected
+ - shared or thread-local
- array slice
- array buffer - can be added to and grows.
- char, string search, regexp search
+- allow "do stuff" as a stand-alone statement (scope)
+- 'use' labels *must* appear in case statements.
-Much later
+Next version (Govetts Creek):
- functions and procedures
+- Finalize what a "main" program looks like.
+
+Much later
- per-field attributes
+ constant, stable, add-only, read-only, mutable, owned, borrowed, dependant, pure
- records
-- enum
+- enum / set
- classes
+ - constructors and destructors - or "after" ??
+ destructors, which can be declared inline
+ - vtables, fat pointers, list of approaches
- operators as interface methods
+ + - * / etc make an arith interface add sub mult div
- interfaces, inheritance
- modules, imports and exports
-- closures, threads, co-routines
-- introspection?
+ public(version) on types, fields etc
+- closures, threads, co-routines, generators
+- generics/templates. These should be just a compile-time
+ decision. Same code can be called with suitable methods passed, or
+ recompiled in the new context and then optimised.
+- introspection / reflection ?
+ e.g. support serialization
+ find function given a string holding the name
+ measure coverage, adjust based on performance metrics
+ auto-create mock objects
+ Is this just parsing the details in the obj file?
+- % formatting
+- string / slice / strbuf
+- parsing library - sscanf equiv, regexp, LALR
+- FFI
+- GTK
+- sockets / http / HTML
+- parameterised types, and dependant types
+- message passing primitives
+- overloading for numbers
+- exceptions ??
+- ensure list_head type concept can work
+- "union" type ??
+- pattern matching for destructuring??
+- casts??
+- typeswitch?
+- iso suffixes for number?
+- foreach?
+- case fall-through or go-to
+- break/continue or "next","last"
+- algebraic types
code / ocean-D / blobdiff