Sam Crawley
and 1 contributors


PRANG::Graph::Quantity - a bounded quantity of graph nodes


See PRANG::Graph::Meta::Element source and PRANG::Graph::Node for examples and information.


This graph node specifies that the XML graph at this point has a quantity of text nodes, elements or element choices depending on the type of entries in the child property.

If the quantity is always 1, that is, the element is required and may only appear one, then the element does not have one of these objects in their graph.


PRANG::Graph::Node child

The child property provides the next portion of the XML Graph. Depending on the type of entry, it will accept and emit nodes in a particular way.

Entries must be one of PRANG::Graph::Choice, PRANG::Graph::Element, or PRANG::Graph::Text.

Int min
Int max

Bounds on the number of times this graph node will match.


Used when emitting; specifies the method to call to retrieve the item to be output.


PRANG::Graph::Meta::Class, PRANG::Graph::Meta::Element, PRANG::Graph::Context, PRANG::Graph::Node

Lower order PRANG::Graph::Node types:

PRANG::Graph::Choice, PRANG::Graph::Element, PRANG::Graph::Text


Development commissioned by NZ Registry Services, and carried out by Catalyst IT -

Copyright 2009, 2010, NZ Registry Services. This module is licensed under the Artistic License v2.0, which permits relicensing under other Free Software licenses.