Table::ParentChild 0.05

Table::ParentChild implements a cross-linked list in two dimensions. It is ideal for describing the parent-child relationships of large numbers of entities. For maximum speed, Table::ParentChild uses hashes to get access to the table row/column headers, and then traverses a linked- list written in XS. The emphasis of development was on speed first, small memory footprint second, ease-of-use third, and flexibility be damned :^)>.<br /><br />To populate a table, simply build an array of arrays. The first element in the sub-array is the id of the parent. The second element of the sub-array is the id of the child. The third (and optional) element of the sub-array is the quantity. Table::ParentChild will automatically build appropriate headers for the table and populate the table, returning a table object for your lookup pleasure.<br /><br />Be forewarned that ids are implemented as unsigned long integers and quantities are implemented as floating point values. The values you feed the table will be coerced into the appropriate data type, which may cause a failure in translation of the data.

Requirements:	No special requirements
Platforms:	*nix, Linux
Keyword:	Build,  Child,  Coerced,  Element,  Headers,  Implemented,  Optional,  Parent,  Point,  Populate,  Speed,  Subarray,  Table,  Tableparentchild,  Translation,  Values
Users rating:	0/10