@@ -107,8 +107,73 @@
+
+- void
+set
+
+
+(string i, Layer lay, Value v);
+
+
+
+
+- Set the value v to the index i of layer lay
+
+
+
+
+- const bool
+has
+
+
+(string i, Layer lay);
+
+
+
+
+- True if index i
+has
+
+
+ value in layer lay
+
+
+
+
+- Value
+get
+
+
+(string i, Layer lay, LexPosition pos = null);
+
+
+
+
+- Return the value of index i at layer lay. Throws if it is not set
+
+
+
+
+- T
+access
+
+
+(T, S...)(Layer lay, string path, S rest);
+
+
+
+
+- t.
+access
+
+
+!T(lay,a,b,...) returns t.get(a,lay).get(b,lay).... if exists
+ and has type T. Returns null otherwise
+
+
+
- bool
empty
@@ -151,8 +216,40 @@
- Regard table as a cons-list and convert to an array
+
+
+
+- Tuple!(string,string,Value)[]
+direct_entries
+
+
+();
+
+
+
+
+- Get the list of direct entries ignoring prototypes in sorted order
+
+
+
+
+- Tuple!(string,string,Value)[]
+entries
+
+
+();
+
+
+
+
+- Get the whole list of observable
+entries
+
+
+ in unspecified order
+
@@ -165,9 +262,9 @@
|
- on Wed Nov 24 21:12:49 2010
+ on Thu Nov 25 12:15:07 2010