Red-Black Trees are now used for duplicate detection, and planned

to be used for unordered map storage. This is because AAs still
don't work correctly and even if they did, require the user to
define both toHash and opCmp/opEquals for every YAML
struct/class. Now only opCmp needs to be defined.
Documentation/tutorials/examples have been updated accordingly.

examples/constructor/main.d

@@ -8,6 +8,14 @@ struct Color
    ubyte red;
    ubyte green;
    ubyte blue;
+
+   const int opCmp(ref const Color c)
+   {
+       if(red   != c.red)  {return red   - c.red;}
+       if(green != c.green){return green - c.green;}
+       if(blue  != c.blue) {return blue  - c.blue;}
+       return 0;
+   }
 }
 
 Color constructColorScalar(ref Node node)

examples/representer/main.d

@@ -6,6 +6,14 @@ struct Color
    ubyte red;
    ubyte green;
    ubyte blue;
+
+   const int opCmp(ref const Color c)
+   {
+       if(red   != c.red)  {return red   - c.red;}
+       if(green != c.green){return green - c.green;}
+       if(blue  != c.blue) {return blue  - c.blue;}
+       return 0;
+   }
 }
 
 Node representColor(ref Node node, Representer representer)

examples/resolver/main.d

@@ -8,6 +8,14 @@ struct Color
    ubyte red;
    ubyte green;
    ubyte blue;
+
+   const int opCmp(ref const Color c)
+   {
+       if(red   != c.red)  {return red   - c.red;}
+       if(green != c.green){return green - c.green;}
+       if(blue  != c.blue) {return blue  - c.blue;}
+       return 0;
+   }
 }
 
 Color constructColorScalar(ref Node node)