/ 
PMLTQ-3.0.1
River stage one • 5 direct dependents • 5 total dependents
/ PMLTQ::Relation::DepthFirstRangeIterator

NAME

PMLTQ::Relation::DepthFirstRangeIterator - Iterates tree using depth first search in given boundaries

VERSION

version 3.0.1

SYNOPSIS

This iterator returns nodes preceding the start node if their depth-first- order distance from it falls into the range [-LMAX,-LMIN] and following the start node in their depth-first-order distance from it falls into the range [RMIN,RMAX]; note that the arguments for LMIN,LMAX must be negative values. For example, given (LMIN,LMAX,RMIN,RMAX) = (-1,-3,1,4), the iterator returns first three nodes preceding and first four nodes following the start node

AUTHORS

  • Petr Pajas <pajas@ufal.mff.cuni.cz>

  • Jan Štěpánek <stepanek@ufal.mff.cuni.cz>

  • Michal Sedlák <sedlak@ufal.mff.cuni.cz>

  • Matyáš Kopp <matyas.kopp@gmail.com>

COPYRIGHT AND LICENSE

This software is copyright (c) 2015 by Institute of Formal and Applied Linguistics (http://ufal.mff.cuni.cz).

This is free software; you can redistribute it and/or modify it under the same terms as the Perl 5 programming language system itself.