| Interface | Description |
|---|---|
| ErrorHandler |
Mapper.run() reports errors by taking the registered error handler and
invoking the respective method of this inteferace. |
| Class | Description |
|---|---|
| Argument |
A translated path.
|
| Conversion |
Convert, wrap/unwrap, re-arrange.
|
| Definition |
Definition of an attribute,
Other possible names: seed, join, attachment, association, representation.
|
| ExceptionErrorHandler | |
| Import |
Java class with a name.
|
| Internal |
Reference to internal constructor.
|
| Library |
A set of types.
|
| Mapper |
Maps streams into Objects by scanning.
|
| Path |
Visibility of some Definition, kind of an Argument builder.
|
| PrintWriterErrorHandler |
ErrorHandler that prints messages to the PrintWriter specified in the constructor.
|
| RelatedArgument |
To sort arguments.
|
| ToArray |
Invokation creates an array initialized with the List passed as an
argument.
|
| Transport |
Singleton class (one instance per Mapping) to create functions for transport attribution.
|
Implements the mapping concept. Constantly changing.
In map files, I use the term "constructor"; a constructor is implemented by a function.
TODO
o ways to represent transport/derivation/paths
o derivation
o the biggest data structure
- seems big and complex, especially split
+ free combination
+ solves type computation and transport attribution
+ other data structures are special cases
o in between
o view
o visibility between two symbols
o what about
s ::= a | a a
split?
o "core"
o the smallest data structure, just on path
-> to small, the number is huge
o String symbols in paths
o nested definitions?
o useful for terminals
o library improvements
o compose functions
o function modifiers
o dynamic function definition:
o selection fields in awt example
Copyright © 1998–2017 1&1. All rights reserved.