Hi,
I spent this afternoon playing with n-tuples, pointers, data model interfaces,
and bytecode instructions.
https://gist.github.com/okram/25d50724da89452853a3f4fa894bcbe8
<https://gist.github.com/okram/25d50724da89452853a3f4fa894bcbe8>
*** Kuppitz: They are tuples :). A Map<K,V> extends Tuple<Pair<K,V>>. Tada!
What I like about this is that it combines the best of both worlds (Josh+Marko).
* just flat tuples of arbitrary length.
* pattern matching for arbitrary joins. (k1=k2 AND k3=k4 …)
* pointers chasing for direct links. (edges, foreign keys,
document _id references, URI resolutions, …)
* sequences are a special type of tuple used for multi-valued entries.
* has()/values()/etc. work on all tuple types! (maps, lists, tuples,
vertices, edges, rows, statements, documents, etc.)
Thoughts?,
Marko.
http://rredux.com <http://rredux.com/>
