Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 123]
  siena | Name space for Siena |
   MatchHandler | Hook for the output function for matching interfaces |
| FIB | Basic services of a forwarding table |
| AttributesFIB | A forwarding table for the attribute-based, single-tree model |
| TagsFIB | A forwarding table for the tag-based, single-tree model |
| String | Binary string type |
| Value | Interface of a generic value in the attribute-based data model |
| Attribute | Interface of a generic attribute in the attribute-based data model |
| Constraint | Interface of a generic constraint in the attribute-based data model |
| BadConstraint | Error condition for an invalid constraint |
 Message | Interface of a generic message in the attribute-based data model |
  Iterator | Interface of a generic message iterator |
| Filter | Interface of a generic filter in the attribute-based data model |
| Iterator | Interface of a generic filter iterator |
| Predicate | Interface of a generic predicate in the attribute-based data model |
| Iterator | Interface of a generic predicate iterator |
| FwdTable | Implementation of a forwarding table based on an improved "counting" algorithm |
| BTable | Implementation of the forwarding table based on Bloom filters |
| SortedBTable | Implementation of the forwarding table based on Bloom filters |
| BCTable | Implementation of the forwarding table based on Bloom filters and counting algorithm |
| BVTable | Implementation of the forwarding table based on Bloom filters and a data structure used for matching called XDD |
| BXTable | Implementation of the forwarding table based on Bloom filters and a data structure used for matching called XDD |
| BDDBTable | Implementation of the forwarding table based on Bloom filters. This implementation consolidates each predicate into a binary decision diagram (BDD) that is then used for matching |
| ZDDBTable | Implementation of the forwarding table based on Bloom filters. This implementation consolidates each predicate into a zero-suppressed decision diagram (ZDD), which is then used for matching |
| BTrieTable | Implementation of TagsFIB based on an encoding of tag sets as Bloom filters represented as a trie |
| Tag | Interface of a generic tag in the Siena data model |
| TagSet | Interface of a generic tag set in the tag-based data model |
| Iterator | Iterator for a tag set |
| TagSetList | Interface of a generic predicate in the "tagset" Siena data model |
| Iterator | Interface of a generic reference to a tagset in a tagset list |
| TagsTable | Implementation of TagsFIB based on an encoding of tag sets as Bloom filters represented as a trie |
| TTable | Very simple implementation of a TagsFIB |