summaryrefslogtreecommitdiff
path: root/graphics/pgf/contrib/forest
diff options
context:
space:
mode:
authorNorbert Preining <norbert@preining.info>2019-09-02 13:46:59 +0900
committerNorbert Preining <norbert@preining.info>2019-09-02 13:46:59 +0900
commite0c6872cf40896c7be36b11dcc744620f10adf1d (patch)
tree60335e10d2f4354b0674ec22d7b53f0f8abee672 /graphics/pgf/contrib/forest
Initial commit
Diffstat (limited to 'graphics/pgf/contrib/forest')
-rw-r--r--graphics/pgf/contrib/forest/LICENCE416
-rw-r--r--graphics/pgf/contrib/forest/README37
-rw-r--r--graphics/pgf/contrib/forest/forest-compat.sty271
-rw-r--r--graphics/pgf/contrib/forest/forest-doc.ins26
-rw-r--r--graphics/pgf/contrib/forest/forest-doc.ist25
-rw-r--r--graphics/pgf/contrib/forest/forest-doc.pdfbin0 -> 1318520 bytes
-rw-r--r--graphics/pgf/contrib/forest/forest-doc.sty244
-rw-r--r--graphics/pgf/contrib/forest/forest-doc.tex6949
-rw-r--r--graphics/pgf/contrib/forest/forest-index.dtx911
-rw-r--r--graphics/pgf/contrib/forest/forest-libs.dtx528
-rw-r--r--graphics/pgf/contrib/forest/forest.dtx10913
-rw-r--r--graphics/pgf/contrib/forest/forest.ins28
-rw-r--r--graphics/pgf/contrib/forest/forest.pdfbin0 -> 498670 bytes
-rw-r--r--graphics/pgf/contrib/forest/tex.bib20
14 files changed, 20368 insertions, 0 deletions
diff --git a/graphics/pgf/contrib/forest/LICENCE b/graphics/pgf/contrib/forest/LICENCE
new file mode 100644
index 0000000000..2244313901
--- /dev/null
+++ b/graphics/pgf/contrib/forest/LICENCE
@@ -0,0 +1,416 @@
+The LaTeX Project Public License
+=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
+
+LPPL Version 1.3c 2008-05-04
+
+Copyright 1999 2002-2008 LaTeX3 Project
+ Everyone is allowed to distribute verbatim copies of this
+ license document, but modification of it is not allowed.
+
+
+PREAMBLE
+========
+
+The LaTeX Project Public License (LPPL) is the primary license under
+which the LaTeX kernel and the base LaTeX packages are distributed.
+
+You may use this license for any work of which you hold the copyright
+and which you wish to distribute. This license may be particularly
+suitable if your work is TeX-related (such as a LaTeX package), but
+it is written in such a way that you can use it even if your work is
+unrelated to TeX.
+
+The section `WHETHER AND HOW TO DISTRIBUTE WORKS UNDER THIS LICENSE',
+below, gives instructions, examples, and recommendations for authors
+who are considering distributing their works under this license.
+
+This license gives conditions under which a work may be distributed
+and modified, as well as conditions under which modified versions of
+that work may be distributed.
+
+We, the LaTeX3 Project, believe that the conditions below give you
+the freedom to make and distribute modified versions of your work
+that conform with whatever technical specifications you wish while
+maintaining the availability, integrity, and reliability of
+that work. If you do not see how to achieve your goal while
+meeting these conditions, then read the document `cfgguide.tex'
+and `modguide.tex' in the base LaTeX distribution for suggestions.
+
+
+DEFINITIONS
+===========
+
+In this license document the following terms are used:
+
+ `Work'
+ Any work being distributed under this License.
+
+ `Derived Work'
+ Any work that under any applicable law is derived from the Work.
+
+ `Modification'
+ Any procedure that produces a Derived Work under any applicable
+ law -- for example, the production of a file containing an
+ original file associated with the Work or a significant portion of
+ such a file, either verbatim or with modifications and/or
+ translated into another language.
+
+ `Modify'
+ To apply any procedure that produces a Derived Work under any
+ applicable law.
+
+ `Distribution'
+ Making copies of the Work available from one person to another, in
+ whole or in part. Distribution includes (but is not limited to)
+ making any electronic components of the Work accessible by
+ file transfer protocols such as FTP or HTTP or by shared file
+ systems such as Sun's Network File System (NFS).
+
+ `Compiled Work'
+ A version of the Work that has been processed into a form where it
+ is directly usable on a computer system. This processing may
+ include using installation facilities provided by the Work,
+ transformations of the Work, copying of components of the Work, or
+ other activities. Note that modification of any installation
+ facilities provided by the Work constitutes modification of the Work.
+
+ `Current Maintainer'
+ A person or persons nominated as such within the Work. If there is
+ no such explicit nomination then it is the `Copyright Holder' under
+ any applicable law.
+
+ `Base Interpreter'
+ A program or process that is normally needed for running or
+ interpreting a part or the whole of the Work.
+
+ A Base Interpreter may depend on external components but these
+ are not considered part of the Base Interpreter provided that each
+ external component clearly identifies itself whenever it is used
+ interactively. Unless explicitly specified when applying the
+ license to the Work, the only applicable Base Interpreter is a
+ `LaTeX-Format' or in the case of files belonging to the
+ `LaTeX-format' a program implementing the `TeX language'.
+
+
+
+CONDITIONS ON DISTRIBUTION AND MODIFICATION
+===========================================
+
+1. Activities other than distribution and/or modification of the Work
+are not covered by this license; they are outside its scope. In
+particular, the act of running the Work is not restricted and no
+requirements are made concerning any offers of support for the Work.
+
+2. You may distribute a complete, unmodified copy of the Work as you
+received it. Distribution of only part of the Work is considered
+modification of the Work, and no right to distribute such a Derived
+Work may be assumed under the terms of this clause.
+
+3. You may distribute a Compiled Work that has been generated from a
+complete, unmodified copy of the Work as distributed under Clause 2
+above, as long as that Compiled Work is distributed in such a way that
+the recipients may install the Compiled Work on their system exactly
+as it would have been installed if they generated a Compiled Work
+directly from the Work.
+
+4. If you are the Current Maintainer of the Work, you may, without
+restriction, modify the Work, thus creating a Derived Work. You may
+also distribute the Derived Work without restriction, including
+Compiled Works generated from the Derived Work. Derived Works
+distributed in this manner by the Current Maintainer are considered to
+be updated versions of the Work.
+
+5. If you are not the Current Maintainer of the Work, you may modify
+your copy of the Work, thus creating a Derived Work based on the Work,
+and compile this Derived Work, thus creating a Compiled Work based on
+the Derived Work.
+
+6. If you are not the Current Maintainer of the Work, you may
+distribute a Derived Work provided the following conditions are met
+for every component of the Work unless that component clearly states
+in the copyright notice that it is exempt from that condition. Only
+the Current Maintainer is allowed to add such statements of exemption
+to a component of the Work.
+
+ a. If a component of this Derived Work can be a direct replacement
+ for a component of the Work when that component is used with the
+ Base Interpreter, then, wherever this component of the Work
+ identifies itself to the user when used interactively with that
+ Base Interpreter, the replacement component of this Derived Work
+ clearly and unambiguously identifies itself as a modified version
+ of this component to the user when used interactively with that
+ Base Interpreter.
+
+ b. Every component of the Derived Work contains prominent notices
+ detailing the nature of the changes to that component, or a
+ prominent reference to another file that is distributed as part
+ of the Derived Work and that contains a complete and accurate log
+ of the changes.
+
+ c. No information in the Derived Work implies that any persons,
+ including (but not limited to) the authors of the original version
+ of the Work, provide any support, including (but not limited to)
+ the reporting and handling of errors, to recipients of the
+ Derived Work unless those persons have stated explicitly that
+ they do provide such support for the Derived Work.
+
+ d. You distribute at least one of the following with the Derived Work:
+
+ 1. A complete, unmodified copy of the Work;
+ if your distribution of a modified component is made by
+ offering access to copy the modified component from a
+ designated place, then offering equivalent access to copy
+ the Work from the same or some similar place meets this
+ condition, even though third parties are not compelled to
+ copy the Work along with the modified component;
+
+ 2. Information that is sufficient to obtain a complete,
+ unmodified copy of the Work.
+
+7. If you are not the Current Maintainer of the Work, you may
+distribute a Compiled Work generated from a Derived Work, as long as
+the Derived Work is distributed to all recipients of the Compiled
+Work, and as long as the conditions of Clause 6, above, are met with
+regard to the Derived Work.
+
+8. The conditions above are not intended to prohibit, and hence do not
+apply to, the modification, by any method, of any component so that it
+becomes identical to an updated version of that component of the Work as
+it is distributed by the Current Maintainer under Clause 4, above.
+
+9. Distribution of the Work or any Derived Work in an alternative
+format, where the Work or that Derived Work (in whole or in part) is
+then produced by applying some process to that format, does not relax or
+nullify any sections of this license as they pertain to the results of
+applying that process.
+
+10. a. A Derived Work may be distributed under a different license
+ provided that license itself honors the conditions listed in
+ Clause 6 above, in regard to the Work, though it does not have
+ to honor the rest of the conditions in this license.
+
+ b. If a Derived Work is distributed under a different license, that
+ Derived Work must provide sufficient documentation as part of
+ itself to allow each recipient of that Derived Work to honor the
+ restrictions in Clause 6 above, concerning changes from the Work.
+
+11. This license places no restrictions on works that are unrelated to
+the Work, nor does this license place any restrictions on aggregating
+such works with the Work by any means.
+
+12. Nothing in this license is intended to, or may be used to, prevent
+complete compliance by all parties with all applicable laws.
+
+
+NO WARRANTY
+===========
+
+There is no warranty for the Work. Except when otherwise stated in
+writing, the Copyright Holder provides the Work `as is', without
+warranty of any kind, either expressed or implied, including, but not
+limited to, the implied warranties of merchantability and fitness for a
+particular purpose. The entire risk as to the quality and performance
+of the Work is with you. Should the Work prove defective, you assume
+the cost of all necessary servicing, repair, or correction.
+
+In no event unless required by applicable law or agreed to in writing
+will The Copyright Holder, or any author named in the components of the
+Work, or any other party who may distribute and/or modify the Work as
+permitted above, be liable to you for damages, including any general,
+special, incidental or consequential damages arising out of any use of
+the Work or out of inability to use the Work (including, but not limited
+to, loss of data, data being rendered inaccurate, or losses sustained by
+anyone as a result of any failure of the Work to operate with any other
+programs), even if the Copyright Holder or said author or said other
+party has been advised of the possibility of such damages.
+
+
+MAINTENANCE OF THE WORK
+=======================
+
+The Work has the status `author-maintained' if the Copyright Holder
+explicitly and prominently states near the primary copyright notice in
+the Work that the Work can only be maintained by the Copyright Holder
+or simply that it is `author-maintained'.
+
+The Work has the status `maintained' if there is a Current Maintainer
+who has indicated in the Work that they are willing to receive error
+reports for the Work (for example, by supplying a valid e-mail
+address). It is not required for the Current Maintainer to acknowledge
+or act upon these error reports.
+
+The Work changes from status `maintained' to `unmaintained' if there
+is no Current Maintainer, or the person stated to be Current
+Maintainer of the work cannot be reached through the indicated means
+of communication for a period of six months, and there are no other
+significant signs of active maintenance.
+
+You can become the Current Maintainer of the Work by agreement with
+any existing Current Maintainer to take over this role.
+
+If the Work is unmaintained, you can become the Current Maintainer of
+the Work through the following steps:
+
+ 1. Make a reasonable attempt to trace the Current Maintainer (and
+ the Copyright Holder, if the two differ) through the means of
+ an Internet or similar search.
+
+ 2. If this search is successful, then enquire whether the Work
+ is still maintained.
+
+ a. If it is being maintained, then ask the Current Maintainer
+ to update their communication data within one month.
+
+ b. If the search is unsuccessful or no action to resume active
+ maintenance is taken by the Current Maintainer, then announce
+ within the pertinent community your intention to take over
+ maintenance. (If the Work is a LaTeX work, this could be
+ done, for example, by posting to comp.text.tex.)
+
+ 3a. If the Current Maintainer is reachable and agrees to pass
+ maintenance of the Work to you, then this takes effect
+ immediately upon announcement.
+
+ b. If the Current Maintainer is not reachable and the Copyright
+ Holder agrees that maintenance of the Work be passed to you,
+ then this takes effect immediately upon announcement.
+
+ 4. If you make an `intention announcement' as described in 2b. above
+ and after three months your intention is challenged neither by
+ the Current Maintainer nor by the Copyright Holder nor by other
+ people, then you may arrange for the Work to be changed so as
+ to name you as the (new) Current Maintainer.
+
+ 5. If the previously unreachable Current Maintainer becomes
+ reachable once more within three months of a change completed
+ under the terms of 3b) or 4), then that Current Maintainer must
+ become or remain the Current Maintainer upon request provided
+ they then update their communication data within one month.
+
+A change in the Current Maintainer does not, of itself, alter the fact
+that the Work is distributed under the LPPL license.
+
+If you become the Current Maintainer of the Work, you should
+immediately provide, within the Work, a prominent and unambiguous
+statement of your status as Current Maintainer. You should also
+announce your new status to the same pertinent community as
+in 2b) above.
+
+
+WHETHER AND HOW TO DISTRIBUTE WORKS UNDER THIS LICENSE
+======================================================
+
+This section contains important instructions, examples, and
+recommendations for authors who are considering distributing their
+works under this license. These authors are addressed as `you' in
+this section.
+
+Choosing This License or Another License
+----------------------------------------
+
+If for any part of your work you want or need to use *distribution*
+conditions that differ significantly from those in this license, then
+do not refer to this license anywhere in your work but, instead,
+distribute your work under a different license. You may use the text
+of this license as a model for your own license, but your license
+should not refer to the LPPL or otherwise give the impression that
+your work is distributed under the LPPL.
+
+The document `modguide.tex' in the base LaTeX distribution explains
+the motivation behind the conditions of this license. It explains,
+for example, why distributing LaTeX under the GNU General Public
+License (GPL) was considered inappropriate. Even if your work is
+unrelated to LaTeX, the discussion in `modguide.tex' may still be
+relevant, and authors intending to distribute their works under any
+license are encouraged to read it.
+
+A Recommendation on Modification Without Distribution
+-----------------------------------------------------
+
+It is wise never to modify a component of the Work, even for your own
+personal use, without also meeting the above conditions for
+distributing the modified component. While you might intend that such
+modifications will never be distributed, often this will happen by
+accident -- you may forget that you have modified that component; or
+it may not occur to you when allowing others to access the modified
+version that you are thus distributing it and violating the conditions
+of this license in ways that could have legal implications and, worse,
+cause problems for the community. It is therefore usually in your
+best interest to keep your copy of the Work identical with the public
+one. Many works provide ways to control the behavior of that work
+without altering any of its licensed components.
+
+How to Use This License
+-----------------------
+
+To use this license, place in each of the components of your work both
+an explicit copyright notice including your name and the year the work
+was authored and/or last substantially modified. Include also a
+statement that the distribution and/or modification of that
+component is constrained by the conditions in this license.
+
+Here is an example of such a notice and statement:
+
+ %% pig.dtx
+ %% Copyright 2005 M. Y. Name
+ %
+ % This work may be distributed and/or modified under the
+ % conditions of the LaTeX Project Public License, either version 1.3
+ % of this license or (at your option) any later version.
+ % The latest version of this license is in
+ % http://www.latex-project.org/lppl.txt
+ % and version 1.3 or later is part of all distributions of LaTeX
+ % version 2005/12/01 or later.
+ %
+ % This work has the LPPL maintenance status `maintained'.
+ %
+ % The Current Maintainer of this work is M. Y. Name.
+ %
+ % This work consists of the files pig.dtx and pig.ins
+ % and the derived file pig.sty.
+
+Given such a notice and statement in a file, the conditions
+given in this license document would apply, with the `Work' referring
+to the three files `pig.dtx', `pig.ins', and `pig.sty' (the last being
+generated from `pig.dtx' using `pig.ins'), the `Base Interpreter'
+referring to any `LaTeX-Format', and both `Copyright Holder' and
+`Current Maintainer' referring to the person `M. Y. Name'.
+
+If you do not want the Maintenance section of LPPL to apply to your
+Work, change `maintained' above into `author-maintained'.
+However, we recommend that you use `maintained', as the Maintenance
+section was added in order to ensure that your Work remains useful to
+the community even when you can no longer maintain and support it
+yourself.
+
+Derived Works That Are Not Replacements
+---------------------------------------
+
+Several clauses of the LPPL specify means to provide reliability and
+stability for the user community. They therefore concern themselves
+with the case that a Derived Work is intended to be used as a
+(compatible or incompatible) replacement of the original Work. If
+this is not the case (e.g., if a few lines of code are reused for a
+completely different task), then clauses 6b and 6d shall not apply.
+
+
+Important Recommendations
+-------------------------
+
+ Defining What Constitutes the Work
+
+ The LPPL requires that distributions of the Work contain all the
+ files of the Work. It is therefore important that you provide a
+ way for the licensee to determine which files constitute the Work.
+ This could, for example, be achieved by explicitly listing all the
+ files of the Work near the copyright notice of each file or by
+ using a line such as:
+
+ % This work consists of all files listed in manifest.txt.
+
+ in that place. In the absence of an unequivocal list it might be
+ impossible for the licensee to determine what is considered by you
+ to comprise the Work and, in such a case, the licensee would be
+ entitled to make reasonable conjectures as to which files comprise
+ the Work.
+
diff --git a/graphics/pgf/contrib/forest/README b/graphics/pgf/contrib/forest/README
new file mode 100644
index 0000000000..75702e750e
--- /dev/null
+++ b/graphics/pgf/contrib/forest/README
@@ -0,0 +1,37 @@
+LaTeX package: forest [2017/07/14 v2.1.5 Drawing (linguistic) trees]
+
+Copyright (c) 2012-2017 Saso Zivanovic
+ (Sa\v{s}o \v{Z}ivanovi\'{c})
+saso.zivanovic@guest.arnes.si
+
+
+ABSTRACT
+
+`forest' is a pgf/tikz-based package for drawing linguistic (and other
+kinds of) trees. Its main features are:
+- a packing algorithm which can produce very compact trees;
+- a user-friendly interface consisting of the familiar bracket
+encoding of trees plus the key--value interface to option-setting;
+- many tree-formatting options, with control over option values of
+individual nodes and mechanisms for their manipulation;
+- a powerful mechanism for traversing the tree;
+- the possibility to decorate the tree using the full power of pgf/tikz;
+- an externalization mechanism sensitive to code-changes.
+
+
+LICENSE
+
+This work may be distributed and/or modified under the
+conditions of the LaTeX Project Public License, either version 1.3
+of this license or (at your option) any later version.
+The latest version of this license is in
+
+http://www.latex-project.org/lppl.txt
+
+and version 1.3 or later is part of all distributions of LaTeX
+version 2005/12/01 or later.
+
+
+For the list of files constituting the work see the main source file
+of the package, `forest.dtx', or the derived `forest.sty'.
+
diff --git a/graphics/pgf/contrib/forest/forest-compat.sty b/graphics/pgf/contrib/forest/forest-compat.sty
new file mode 100644
index 0000000000..c69220844c
--- /dev/null
+++ b/graphics/pgf/contrib/forest/forest-compat.sty
@@ -0,0 +1,271 @@
+% \CheckSum{12884}
+% \iffalse meta-comment
+% forest-index.dtx
+%% `forest-compat' defines a compatibility layer of package `forest'.
+%%
+%% Copyright (c) 2012-2017 Saso Zivanovic
+%% (Sa\v{s}o \v{Z}ivanovi\'{c})
+%% saso.zivanovic@guest.arnes.si
+%%
+%% This work may be distributed and/or modified under the
+%% conditions of the LaTeX Project Public License, either version 1.3
+%% of this license or (at your option) any later version.
+%% The latest version of this license is in
+%%
+%% http://www.latex-project.org/lppl.txt
+%%
+%% and version 1.3 or later is part of all distributions of LaTeX
+%% version 2005/12/01 or later.
+%%
+%% This work has the LPPL maintenance status `author-maintained'.
+%%
+%% This file is a part of package `forest'. For the list of files
+%% constituting the package see main source file of the package,
+%% `forest.dtx', or the derived `forest.sty'.
+
+\ProvidesPackage{forest-compat}[2016/12/31]
+
+\def\forest@deprecated#1{%
+ \PackageWarning{forest}{Compatibility mode for #1}%
+}
+\forestset{@@deprecated/.code={\forest@deprecated{#1}}}
+\def\forestcompat#1{\pgfqkeys{/forest/@compat}{#1}}
+\def\forestcompat@patchfailed{%
+ \pgfkeys@split@path
+ \PackageError{forest}{Patching in compat=\pgfkeyscurrentname\space failed}{}%
+}
+\forestcompat{
+ silent/.code={\def\forest@deprecated##1{}},
+ %%% begin listing region: compat_keys
+ most/.style={1.0-most},
+ all/.style={1.0-all},
+ none/.style={},
+ 1.0-harmless/.style={
+ 1.0-triangle,1.0-linear,1.0-nodewalk,1.0-ancestors,
+ 1.0-fittotree,1.0-for,1.0-forall,
+ },
+ 1.0-most/.style={1.0-harmless,2.0.2-most},
+ 1.0-all/.style={1.0-harmless,
+ 1.0-forstep,1.0-rotate,1.0-stages,1.0-name,
+ 2.0.2-all,
+ },
+ 2.0.2-most/.style={2.0-most},
+ 2.0.2-all/.style={
+ 2.0.2-delayn,2.0.2-wrapnpgfmathargs,
+ 2.0-all,
+ },
+ 2.0-edges/.style={2.0-anchors,2.0-forkededge,2.0-folder},
+ 2.0-most/.style={2.1.1-most},
+ 2.0-all/.style={
+ 2.0-delayn,
+ 2.0-edges,
+ 2.1.1-all,
+ },
+ 2.1.1-most/.style={},
+ 2.1.1-all/.style={2.1.1-loops},
+ %%% end listing region: compat_keys
+ 1.0-triangle/.style={
+ /forest/triangle/.style={
+ @@deprecated={key "triangle" from v1.0.x. Use key "roof" from library "linguistics" instead},
+ edge path'={%
+ (.north west)--(!u.south)--(.north east)--cycle
+ }
+ }
+ },
+ 1.0-linear/.style={
+ /forest/define long step={linear next}{autostep}{%
+ \forest@deprecated{nodewalk step "linear next" from v1.0. Use key "next node" instead.}%
+ \edef\forest@cn{\forest@node@linearnextid}},
+ /forest/define long step={linear previous}{autostep}{%
+ \forest@deprecated{nodewalk step "linear previous" from v1.0. Use key "previous node" instead.}%
+ \edef\forest@cn{\forest@node@linearpreviousid}},
+ },
+ 1.0-nodewalk/.style={
+ /forest/node walk/before walk/.style={},
+ /forest/node walk/every step/.style={},
+ /forest/node walk/after walk/.style={},
+ /forest/node walk/.style={
+ @@deprecated={key "node walk" from v1.0. Use key "nodewalk" instead.},
+ /forest/node walk/before walk,
+ /forest/nodewalk/before walk/.style={/forest/node walk/before walk},
+ /forest/nodewalk/every step/.style={/forest/node walk/every step},
+ /forest/nodewalk/after walk/.style={/forest/node walk/after walk},
+ /forest/nodewalk/node walk/.style={before walk,for nodewalk={####1,options={/forest/nodewalk/after walk}}{/forest/nodewalk/every step}},
+ for nodewalk={##1,options={/forest/nodewalk/after walk}}{/forest/nodewalk/every step},
+ },
+ },
+ 1.0-ancestors/.style={
+ /forest/for ancestors'/.style={
+ @@deprecated={key "for ancestors'" from v1.0.x. Use key "for current and ancestors" instead.},
+ for current and ancestors={##1}},
+ },
+ 1.0-fittotree/.style={%
+ /tikz/fit to tree/.style={
+ /forest/@@deprecated={key "/tikz/fit to tree" from v1.0.x. Use "/tikz/fit to=tree" instead.},
+ inner sep=0pt,fit to=tree
+ }
+ },
+ 1.0-for/.style={
+ /forest/for/.code 2 args={% #1 = nodewalk, #2 = after walk keylist
+ \forest@deprecated{Key "for" from v1.0.x. Use key "for group" instead.}%
+ \forest@forthis{\forest@nodewalk{##1,options={##2}}{}}%
+ }
+ },
+ 1.0-forall/.style={
+ /forest/for all next/.style={
+ @@deprecated={Key "for all next" from v1.0.x. Use key "for following siblings" instead.},
+ for following siblings={##1}},
+ /forest/for all previous/.style={
+ @@deprecated={Key "for all previous" from v1.0.x. Use key "for preceding siblings" instead.},
+ for preceding siblings={##1}},
+ },
+ 1.0-forstep/.code={%
+ \def\forest@forstepwrapper##1##2{%
+ \forest@forthis{%
+ \forest@configured@nodewalk{independent}{independent}{compatfake}{##1}{##2}%
+ }%
+ }%
+ \def\forest@relatednode@option@compat@ignoreinvalidsteps##1{%
+ \forest@saveandrestoremacro\forest@nodewalk@oninvalid{%
+ \def\forest@nodewalk@oninvalid{compatfake}%
+ ##1%
+ }%
+ }%
+ },
+ 1.0-rotate/.style={
+ /forest/undef option=rotate,
+ rotate/.style={
+ @@deprecate={Using non-autoforwarded key "rotate". Some keys, like "forked edges" and "folder", might produce a wrong result.},
+ node options={rotate={##1}},
+ },
+ },
+ 1.0-stages/.style={
+ /forest/@@deprecated={Using v1.0.x "stages" style},
+ /forest/stages/.style={
+ process keylist=before typesetting nodes,
+ typeset nodes stage,
+ process keylist=before packing,
+ pack stage,
+ process keylist=before computing xy,
+ compute xy stage,
+ process keylist=before drawing tree,
+ draw tree stage,
+ },
+ /forest/TeX={%
+ \def\forest@defstages##1{%
+ \def\forest@stages{%
+ begin forest,
+ for root'={
+ process keylist register=default preamble,
+ process keylist register=preamble
+ },
+ process keylist=given options,
+ ##1,
+ end forest
+ }%
+ }%
+ },
+ },
+ 1.0-name/.code={%
+ \forest@deprecated{key "name": using key "name" from v1.0.x, which does not enforce uniqueness. If you really need this, you're doing something wrong.}%
+ \def\forest@node@setname##1{%
+ \ifstrempty{##1}{}{%
+ \forestoeset{name}{##1}%
+ \csedef{forest@id@of@##1}{\forest@cn}%
+ }%
+ }%
+ \def\forest@node@setalias##1{%
+ \ifstrempty{##1}{}{%
+ \csedef{forest@id@of@##1}{\forest@cn}%
+ }%
+ }%
+ },
+ 2.0.2-delayn/.style={
+ /forest/delay@n/.style 2 args={
+ @@deprecated={propagator "delay n" (it introduces two levels of hash doubling reevaluates the first argument (the desired number of cycles) at every cycle)},
+ if={##1==1}{delay={##2}}{delay={delay@n/.wrap pgfmath arg={{####1}{##2}}{##1-1}}}
+ },
+ 2.0-delayn/.style={}, % this key would patch the same thing!
+ },
+ 2.0.2-wrapnpgfmathargs/.code={%
+ \def\forest@wrap@pgfmath@args@@@wrapandpasson{%
+ \forest@deprecated{handler "wrap n pgfmath args" (it introduces two levels of hash doubling)}%
+ \expandafter\expandafter\expandafter\def
+ \expandafter\expandafter\expandafter\forest@wrapped
+ \expandafter\expandafter\expandafter{%
+ \expandafter\forest@wrap@code\forest@wrap@args}%
+ \expandafter\pgfkeysalso\expandafter{\expandafter\pgfkeyscurrentpath\expandafter=\expandafter{\forest@wrapped}}%
+ }%
+ },
+ 2.0-delayn/.style={
+ /forest/delay n/.style 2 args={
+ @@deprecated={propagator "delay n" (it reevaluates the first argument (the desired number of cycles) at every cycle)},
+ if={##1==0}{##2}{delay@n={##1}{##2}}
+ },
+ /forest/delay@n/.style 2 args={
+ if={##1==1}{delay={##2}}{delay={delay@n/.process={P}{##1-1}{##2}}}
+ },
+ },
+ 2.0-anchors/.code={%
+ \csdef{forest@anchor@@parent'}{%
+ \forest@anchor@isbordertrue
+ \edef\forest@temp@anchor{\number\numexpr\forestove{grow}-\forestove{rotate}+180}%
+ }
+ \csdef{forest@anchor@@parent first'}{%
+ \forest@anchor@isbordertrue
+ \edef\forest@temp@anchor@parent{\number\numexpr\forestove{grow}-\forestove{rotate}+180}%
+ \edef\forest@temp@anchor@first{\number\numexpr\forestove{grow}-\forestove{rotate}\ifnum\forestove{reversed}=0 -\else+\fi90}%
+ \forest@getaverageangle{\forest@temp@anchor@parent}{\forest@temp@anchor@first}\forest@temp@anchor
+ }
+ \csdef{forest@anchor@@parent last'}{%
+ \forest@anchor@isbordertrue
+ \edef\forest@temp@anchor@parent{\number\numexpr\forestove{grow}-\forestove{rotate}+180}%
+ \edef\forest@temp@anchor@last{\number\numexpr\forestove{grow}-\forestove{rotate}\ifnum\forestove{reversed}=0 +\else-\fi90}%
+ \forest@getaverageangle{\forest@temp@anchor@parent}{\forest@temp@anchor@last}\forest@temp@anchor
+ }
+ },
+ 2.0-forkededge/.code={%
+ \forest@iflibraryloaded{edges}{%
+ \forestset{
+ forked edge/.style={
+ edge={rotate/.pgfmath=grow()},
+ edge path'={(!u.parent anchor) -- ++(\forestoption{fork sep},0) |- (.child anchor)},
+ },
+ forked edges/.style={
+ for tree={parent anchor=children},
+ for descendants={child anchor=parent,forked edge}
+ },
+ }%
+ }{%
+ \appto\forest@compat@libraries@edges{\forestcompat{2.0-forkededge}}%
+ }%
+ },
+ 2.0-folder/.code={%
+ \forest@iflibraryloaded{edges}{%
+ \expandafter\patchcmd\csname pgfk@/forest/folder/.@cmd\endcsname
+ {parent anchor=-children last}
+ {parent anchor=parent last}
+ {}{\forestcompat@patchfailed}%
+ \expandafter\patchcmd\csname pgfk@/forest/folder/.@cmd\endcsname
+ {edge={rotate/.option=!parent.grow},}
+ {edge={rotate/.pgfmath=grow()}}
+ {}{\forestcompat@patchfailed}%
+ }{%
+ \appto\forest@compat@libraries@edges{\forestcompat{2.0-folder}}%
+ }%
+ },
+ 2.1.1-loops/.code={%
+ \patchcmd\newsafeRKloop % pre-{##1}
+ {\forest@temp@toks}%
+ {%
+ \forest@deprecated{hash-doubling loops from pre-2.1.2}%
+ \def\forest@temp
+ }%
+ {}{\forestcompat@patchfailed}%
+ \patchcmd\newsafeRKloop % post-{##1}
+ {\csedef}%
+ {\forest@temp@toks\expandafter{\forest@temp}\csedef}%
+ {}{\forestcompat@patchfailed}%
+ },
+}
+\expandafter\forestcompat\expandafter{\forest@compat}
diff --git a/graphics/pgf/contrib/forest/forest-doc.ins b/graphics/pgf/contrib/forest/forest-doc.ins
new file mode 100644
index 0000000000..41e872e40b
--- /dev/null
+++ b/graphics/pgf/contrib/forest/forest-doc.ins
@@ -0,0 +1,26 @@
+%% forest-doc.ins
+%%
+%% Copyright (c) 2015 Saso Zivanovic
+%% saso.zivanovic@guest.arnes.si
+%%
+%% This work may be distributed and/or modified under the
+%% conditions of the LaTeX Project Public License, either version 1.3
+%% of this license or (at your option) any later version.
+%% The latest version of this license is in
+%%
+%% http://www.latex-project.org/lppl.txt
+%%
+%% and version 1.3 or later is part of all distributions of LaTeX
+%% version 2005/12/01 or later.
+%%
+%% This file is a part of package `forest'. For the list of files
+%% constituting the package see main source file of the package,
+%% `forest.dtx', or the derived `forest.sty'.
+%%
+\input docstrip.tex
+\keepsilent
+\preamble
+\endpreamble
+\askforoverwritefalse
+\generate{\file{forest-index.sty}{\from{forest-index.dtx}{}}}
+\endbatchfile
diff --git a/graphics/pgf/contrib/forest/forest-doc.ist b/graphics/pgf/contrib/forest/forest-doc.ist
new file mode 100644
index 0000000000..8d3fec14b0
--- /dev/null
+++ b/graphics/pgf/contrib/forest/forest-doc.ist
@@ -0,0 +1,25 @@
+%% This file is based on `gind.ist'.
+
+actual '='
+quote '&'
+level '>'
+preamble
+"\n \\begin{theindex} \n \\makeatletter\\scan@allowedfalse\n"
+postamble
+"\n\n \\end{theindex}\n"
+item_x1 "\\efill \n \\subitem "
+item_x2 "\\efill \n \\subsubitem "
+delim_0 "\\pfill "
+delim_1 "\\pfill "
+delim_2 "\\pfill "
+% The next lines will produce some warnings when
+% running Makeindex as they try to cover two different
+% versions of the program:
+lethead_prefix "{\\bfseries\\hfil\\indexlettertotoc "
+lethead_suffix "\\relax\\hfil}\\nopagebreak\n"
+lethead_flag 1
+heading_prefix "{\\bfseries\\hfil\\indexlettertotoc "
+heading_suffix "\\relax\\hfil}\\nopagebreak\n"
+% heading_prefix "{\\bfseries\\hfil "
+% heading_suffix "\\hfil}\\nopagebreak\n"
+headings_flag 1
diff --git a/graphics/pgf/contrib/forest/forest-doc.pdf b/graphics/pgf/contrib/forest/forest-doc.pdf
new file mode 100644
index 0000000000..e9651a7fa3
--- /dev/null
+++ b/graphics/pgf/contrib/forest/forest-doc.pdf
Binary files differ
diff --git a/graphics/pgf/contrib/forest/forest-doc.sty b/graphics/pgf/contrib/forest/forest-doc.sty
new file mode 100644
index 0000000000..865ed8bc1c
--- /dev/null
+++ b/graphics/pgf/contrib/forest/forest-doc.sty
@@ -0,0 +1,244 @@
+%% forest-doc.sty
+%%
+%% `forest-doc.sty` is an auxiliary package needed to compile the documentation of package
+%% `forest`. (It is not needed to use the package.)
+%%
+%% Copyright (c) 2012-2017 Saso Zivanovic
+%% (Sa\v{s}o \v{Z}ivanovi\'{c})
+%% saso.zivanovic@guest.arnes.si
+%%
+%% This work may be distributed and/or modified under the
+%% conditions of the LaTeX Project Public License, either version 1.3
+%% of this license or (at your option) any later version.
+%% The latest version of this license is in
+%%
+%% http://www.latex-project.org/lppl.txt
+%%
+%% and version 1.3 or later is part of all distributions of LaTeX
+%% version 2005/12/01 or later.
+%%
+%% This work has the LPPL maintenance status `author-maintained'.
+%%
+%% This file is a part of package `forest'. For the list of files
+%% constituting the package see main source file of the package,
+%% `forest.dtx', or the derived `forest.sty'.
+%%
+\ProvidesPackage{forest-doc}
+\RequirePackage{lstdoc}
+\RequirePackage{pgfkeys}
+\RequirePackage{forest-index}
+% if you want index support, load package "forest-index", but later
+
+\lstset{language={[LaTeX]TeX},tabsize=4,gobble=2,%
+ basicstyle=\small\ttfamily,basewidth=0.51em,boxpos=c,pointstyle=\pstyle,moredelim=[is][\pstyle]{~}{~}}
+%\lst@InstallKeywords{p}{point}{pointstyle}\relax{keywordstyle}{}ld
+\def\pstyle{\color{darkgreen}}
+\newcommand\itemnosep[1][0pt]{\vspace{\the\dimexpr-1.4ex+#1}}
+\lstset{
+ rangebeginprefix=\ \ \%\%\%\ begin\ listing\ region:\ ,
+ rangebeginsuffix=,
+ rangeendprefix=\ \ \%\%\%\ end\ listing\ region:\ ,
+ rangeendsuffix=,
+ includerangemarker=false,
+ keepspaces=true,
+}
+\newcommand\lstinputregion[3][]{\lstinputlisting[linerange=#3-#3,#1]{#2}}
+\def\lst@outputspace{{\ifx\lst@bkgcolor\empty\color{white}\else\lst@bkgcolor\fi\lst@visiblespace}}% this works for acroread, but not for atril :-(
+
+\lstnewenvironment{forestexample}[1][]{%
+ \PackageWarning{forest-doc}{Compiling example}{}%
+ \global\let\lst@intname\@empty
+ \gdef\lst@sample{}%
+ \def\forestexample@layout{tree on left}%
+ \def\forestexample@treebin{box}%
+ \pgfqkeys{/forestexample}{label format,#1}%
+ \pgfkeysgetvalue{/forestexample/counter}\forestexample@temp
+ \ifdefempty\forestexample@temp{}{\addtocounter{\forestexample@temp}{1}}%
+ \setbox\lst@samplebox=\hbox\bgroup
+ \pgfkeysvalueof{/forestexample/tree prefix}%
+ \lst@BeginAlsoWriteFile{\jobname.tmp}%
+}{%
+ \lst@EndWriteFile
+ \pgfkeysvalueof{/forestexample/tree suffix}%
+ \egroup
+ \global\setbox\codebox=\box\lst@samplebox
+ \global\setbox
+ \treebox
+ \csname forestexample@treebin@\forestexample@treebin\endcsname
+ \pgfkeys{/forestexample/do layout/.expanded=\forestexample@layout}%
+}
+\pgfqkeys{/forestexample}{%
+ .unknown/.code={\lstset{\pgfkeyscurrentname={#1}}},
+ index/.code={\indexex[not print]{#1}},
+ index>/.code={\indexex[not print]>{#1}},
+ code prefix/.code={\gdef\lst@sample{#1}},
+ tree prefix/.initial={},
+ tree suffix/.initial={},
+ counter/.initial=lstlisting,
+ no label/.style={counter={}},
+ label format/.store in=\@currentlabel,
+ label format/.default={\arabic{\pgfkeysvalueof{/forestexample/counter}}},
+ tree width/.initial={\dimexpr\linewidth-\wd\codebox-
+ \glueexpr\pgfkeysvalueof{/forestexample/center skip}\relax\relax},
+ layout/.store in=\forestexample@layout,
+ tree bin/.store in=\forestexample@treebin,
+ do layout/.is choice,
+ do layout/export/.code={%
+ \pgfkeysgetvalue{/forestexample/counter}\forestexample@temp
+ \ifdefempty\forestexample@temp{}{\addtocounter{\forestexample@temp}{-1}}%
+ },
+ left skip/.initial={\glueexpr 0pt plus .4\linewidth minus \marginparsep + 0pt minus \@totalleftmargin + 0pt minus .75\marginparwidth},
+ center skip/.initial={3em plus 0.1\linewidth minus 2em},
+ right skip/.initial={0pt plus .4\linewidth},
+ tree left skip/.initial=0pt,
+ tree right skip/.initial=0pt,
+ code left skip/.initial=0pt,
+ code right skip/.initial=0pt,
+ label y offset/.initial={\height-1ex}, % looks better to me this way
+ do layout/tree on left/.code={%
+ \begin{list}{}{\leftmargin 0pt}
+ \item
+ \@tempdima=\ifdim\totalht\treebox>\totalht\codebox
+ \dimexpr0.5 \totalht\treebox\relax
+ \else
+ \dimexpr0.5 \totalht\codebox\relax
+ \fi
+ \mbox{%
+ \mbox{\hbox to \linewidth{%
+ \hskip\pgfkeysvalueof{/forestexample/left skip}\relax
+ \textvcenter{\box\treebox}%
+ \hskip\pgfkeysvalueof{/forestexample/center skip}\relax
+ \hbox{\hskip-\@totalleftmargin\box\codebox\hskip\@totalleftmargin}%
+ \hskip\pgfkeysvalueof{/forestexample/right skip}\relax
+ }}%
+ \forestexample@label
+ }%
+ \end{list}
+ },
+ v sep/.initial={1ex},
+ align/.initial=center,
+ do layout/tree on top/.code={%
+ \begin{list}{}{\leftmargin 0pt \parsep 0pt \itemsep \pgfkeysvalueof{/forestexample/v sep}\relax}
+ \item \forestexample@align{tree}\forestexample@label
+ \item \forestexample@align{code}
+ \end{list}
+ },
+ do layout/tree on bottom/.code={%
+ \begin{list}{}{\leftmargin 0pt \parsep 0pt \itemsep \pgfkeysvalueof{/forestexample/v sep}\relax}
+ \item \forestexample@align{code}\forestexample@label
+ \item \forestexample@align{tree}
+ \end{list}
+ },
+ do layout/only tree/.code={%
+ \forestexample@align{tree}\forestexample@label
+ },
+ do layout/only code/.code={%
+ \forestexample@align{code}\forestexample@label
+ },
+}
+\newbox\treebox
+\newbox\codebox
+\def\forestexample@treebin@box{%
+ \hbox{\lst@sampleInput}%
+}
+\def\forestexample@treebin@minipage{%
+ \hbox{%
+ \begin{minipage}{\pgfkeysvalueof{/forestexample/tree width}}%
+ \lst@sampleInput
+ \end{minipage}%
+ }%
+}
+\def\forestexample@label{%
+ \pgfkeysgetvalue{/forestexample/counter}\forestexample@temp
+ \ifdefempty\forestexample@temp{}{%
+ \makebox[0pt][l]{%
+ \hskip-\linewidth
+ \hskip-\@totalleftmargin
+ \hskip\textwidth
+ \hskip\marginparsep
+ \raisebox
+ {\dimexpr\@tempdima+\depth-\pgfkeysvalueof{/forestexample/label y offset}}%
+ {\hbox to 0pt{\scriptsize(\@currentlabel)}}%
+ }%
+ }%
+}
+\def\forestexample@align#1{%
+ \pgfkeysgetvalue{/forestexample/align}\forestexample@temp
+ \mbox{\hbox to \linewidth{%
+ \csname forestexample@align@left@\forestexample@temp\endcsname
+ \hspace*{\pgfkeysvalueof{/forestexample/#1 left skip}}%
+ \mbox{\expandafter\box\csname #1box\endcsname}%
+ \hspace*{\pgfkeysvalueof{/forestexample/#1 right skip}}%
+ \csname forestexample@align@right@\forestexample@temp\endcsname
+ }}%
+}
+\def\forestexample@align@left@left{}
+\def\forestexample@align@right@left{}
+\def\forestexample@align@left@right{\hfill}
+\def\forestexample@align@right@right{}
+\def\forestexample@align@left@center{\hfill}
+\def\forestexample@align@right@center{\hfill}
+\newcommand\forestexampleimport[1][]{%
+ \def\forestexample@layout{tree on left}%
+ \pgfkeysgetvalue{/forestexample/counter}\forestexample@temp
+ \ifdefempty\forestexample@temp{}{\addtocounter{\forestexample@temp}{1}}%
+ \pgfqkeys{/forestexample}{%
+ label format,
+ do layout/.expanded=\forestexample@layout
+ }%
+}
+
+\def\totalht#1{\dimexpr\ht#1 + \dp#1\relax}
+\def\textvcenter#1{\raisebox{\dimexpr .5\depth-.5\height}{#1}}
+
+% For some reason, lstdoc's version kills all spaces in defaults ...
+\def\lst@syntaxlabel@#1>#2\relax
+ %{\edef\lst@temp{\zap@space#2 \@empty}}
+ {\edef\lst@temp{#2}}
+
+
+
+
+\def\getforestversion#1/#2/#3 v#4 #5\getforestversion{v#4}
+\edef\forestversion{%
+\expandafter\expandafter\expandafter\getforestversion
+ \csname ver@forest.sty\endcsname\getforestversion}
+
+\def\settodayfromforestdateA#1/#2/#3 v#4 #5\settodayfromforestdateA{\def\year{#1}\def\month{#2}\def\day{#3}}
+\def\settodayfromforestdate{\expandafter\expandafter\expandafter\settodayfromforestdateA\csname ver@forest.sty\endcsname\settodayfromforestdateA}
+
+\def\TikZ;{{\rm Ti\emph{k}Z}}
+\def\PGF;{\textsc{pgf}}
+\def\foRest;{\textsc{Forest}}
+\def\FoRest;{\textsc{Forest}}
+
+\let\keyname\texttt
+\newcommand\cmdname[1]{\texttt{\char\escapechar#1}}
+
+\gdef\greaterthan{>}
+\def\gobbleone#1{}
+
+\newcommand{\Repeat}[1]{% from tex.se http://tex.stackexchange.com/a/16194/16819
+ \expandafter\@Repeat\expandafter{\the\numexpr #1\relax}%
+}
+\def\@Repeat#1{%
+ \ifnum#1>0
+ \expandafter\@@Repeat\expandafter{\the\numexpr #1-1\expandafter\relax\expandafter}%
+ \else
+ \expandafter\@gobble
+ \fi
+}
+\def\@@Repeat#1#2{%
+ \@Repeat{#1}{#2}#2%
+}
+\def\spaces#1{\Repeat{#1}\space}
+
+\RequirePackage{dingbat}
+
+
+%%% Local Variables:
+%%% mode: latex
+%%% fill-column: 100
+%%% TeX-command-default: "Make PDF"
+%%% TeX-master: "forest-doc"
+%%% End:
diff --git a/graphics/pgf/contrib/forest/forest-doc.tex b/graphics/pgf/contrib/forest/forest-doc.tex
new file mode 100644
index 0000000000..53410b697f
--- /dev/null
+++ b/graphics/pgf/contrib/forest/forest-doc.tex
@@ -0,0 +1,6949 @@
+%% forest-doc.tex
+%% `forest-doc.tex` is a main documentation source of package `forest`.
+%%
+%% Copyright (c) 2012-2017 Saso Zivanovic
+%% (Sa\v{s}o \v{Z}ivanovi\'{c})
+%% saso.zivanovic@guest.arnes.si
+%%
+%% This work may be distributed and/or modified under the
+%% conditions of the LaTeX Project Public License, either version 1.3
+%% of this license or (at your option) any later version.
+%% The latest versionx of this license is in
+%%
+%% http://www.latex-project.org/lppl.txt
+%%
+%% and version 1.3 or later is part of all distributions of LaTeX
+%% version 2005/12/01 or later.
+%%
+%% This work has the LPPL maintenance status `author-maintained'.
+%%
+%% This file is a part of package `forest'. For the list of files
+%% constituting the package see main source file of the package,
+%% `forest.dtx', or the derived `forest.sty'.
+%%
+\documentclass{ltxdoc}
+\usepackage[a4paper,
+ top=2cm,bottom=2.5cm,
+ reversemarginpar,marginparwidth=2cm,
+ right=1.5cm,
+ nohead
+]{geometry}
+
+\immediate\write18{makeindex -s forest-doc.ist forest-doc}
+\def\indexlettertotoc#1\relax{%
+ \phantomsection\addcontentsline{toc}{subsection}{#1}%
+ #1%
+}
+\makeatletter
+\c@IndexColumns=2 \makeatother
+\IndexPrologue{Color legend: \textcolor{red}{definition}, \textcolor{darkgreen}{example}, \textcolor{blue}{other}. If an entry belongs to a library, the library name is given in parenthesis. All page numbers are hyperlinks, and definitions in text are hyperlinked to this index.}
+\makeindex
+
+\makeatletter
+\def\bigbadforlist{}
+\def\forest@@doc@@hook@bigbadforlist{\aftergroup\forest@@doc@@hook@bigbadforlist@}
+\def\forest@@doc@@hook@bigbadforlist@{%
+ \forestset{define long step/.append code={%
+ \ifforest@nodewalkstephandler@makefor
+ \appto\bigbadforlist{[##1]}%
+ \fi
+ }%
+ }%
+}
+\def\bigbadprocesslist{}
+\makeatother
+\usepackage[external]{forest}
+\useforestlibrary{edges}
+\useforestlibrary{linguistics}
+% \tikzexternalize
+% forest-tikzexternalize either contains \tikzexternalize or not ... make adjusts this
+\IfFileExists{forest-doc.tex-externalize.tex}{%
+ \input forest-doc.tex-externalize\relax
+}{}
+\tikzset{
+ external/prefix={forest.for.dir/},
+ external/system call={
+ pdflatex \tikzexternalcheckshellescape -halt-on-error -interaction=nonstopmode -jobname "\image" "\texsource"},
+ external/up to date check=simple,
+}
+
+\usepackage{forest-doc}
+% \usepackage{patchpgf}
+% \newcommand\pgfprofilenewforcommandcs[2]{%
+% \expandafter\pgfprofilenewforcommand\expandafter{\csname #1\endcsname}{#2}}
+% \newcommand\pgfprofilenewforpgfkey[1]{%
+% \edef\marshal{%
+% \noexpand\pgfprofilenewforcommandpattern[#1]{\expandonce{\csname pgfk@#1/.@cmd\endcsname}}{####1\noexpand\pgfeov}{####1\noexpand\pgfeov}
+% }\marshal
+% }
+% \usetikzlibrary{profiler}
+% \makeatletter
+% \pgfprofilenewforcommand{\forestindex@index}{3}
+% \pgfprofilenewforcommand{\pgfmathparse}{1}
+% \pgfprofilenewforpgfkey{/forest/split}
+% \pgfprofilenewforpgfkey{/forest/nodewalk/reverse}
+% \pgfprofilenewforcommand{\forest@Nodewalk}{2}
+% \pgfprofilenewforcommand{\pgfkeysalso}{1}
+% \makeatother
+
+\usepackage{hyperref}
+\hypersetup{unicode=true,colorlinks=true,linkcolor=blue,citecolor=blue,hyperindex=false}
+\usepackage{url}
+\usepackage[numbers]{natbib}
+\usepackage[multiple]{footmisc}
+\usepackage{tipa}
+\usepackage[inline,shortlabels]{enumitem}
+\newlist{compactitem}{itemize}{2}
+\setlist[compactitem]{nosep,label=\textbullet}
+\newlist{arguments}{enumerate}{1}
+\setlist[arguments]{nosep,label=\textbf{\#\arabic*}}
+\renewcommand\DescribeMacro[1]{\texttt{\detokenize{#1}}\marginpar{\hfill\small\strut\texttt{\detokenize{#1}}}}
+\usepackage{printlen}
+\usepackage{tabularx}
+\DeleteShortVerb\|
+\newcommand\OR{\ensuremath{\,|\,}}%
+\usepackage{multicol}
+
+%\usepackage[silent]{trace-pgfkeys} % silent, stack, trace, verbose
+%\pgfkeystracelevel{trace}
+
+ %%% begin listing region: index_macro_style
+\forestset{
+ detokenize/.style={result=\protect\detokenize{##1}},
+ tt/.style={result=\protect\texttt{##1}},
+ macro/.style={detokenize, +result={\char\escapechar}, tt, print in color, hyper},
+}
+ %%% end listing region: index_macro_style
+\forestset{
+ pgfkey/.style={tt,print in color,hyper},
+ path/.style={+result={/},pgfkey},
+ handler/.style={+result={.},pgfkey},
+ option value/.style={
+ format={tt,result+={ value}},
+ for first={format=pgfkey},
+ },
+ environment/.style={
+ detokenize,
+ tt,
+ print in color,
+ if stage={index}{}{
+ if index entry type={definition}{
+ temptoksa/.register=result,
+ hyper,
+ result/.process=ROw2{result}{argument}{%
+ \texttt{\string\begin\char`\{##1\char`\}}%
+ ##2%
+ \texttt{\string\end\char`\{##1\char`\}}%
+ }
+ }{
+ hyper
+ }
+ }
+ },
+ empty/.style={result={{}}},
+ meta/.style={result=\protect\meta{##1},print in color,hyper},
+ index library/.style={
+ if index entry type={definition}{
+ for first leaf'={
+ index format+={
+ result+'={\space
+ {\protect\scriptsize
+ (\protect\texttt{\protect\hyperrefnocolor[sec:library-#1]{#1}})%
+ }%
+ }
+ }
+ },
+ }{}
+ },
+ margin/.style={print format={result=\marginpar{\strut##1}}},
+ also margin/.style={print format={result=##1\marginpar{\strut##1}}},
+}
+
+\let\origmeta\meta
+\renewcommand\meta[1]{\origmeta{\rm\ignorespaces#1}}
+\renewcommand\rstyle{\color{red}}
+\newcommand\hyperrefnocolor[2][]{{\hypersetup{linkcolor=black}\hyperref[#1]{#2}}}
+\newcommand\librarysection[1]{%
+ \subsection{\protect\texttt{#1}}%
+ \label{sec:library-#1}%
+ \forestset{every index end/.style={set={index library={#1}}}}%
+}
+\newcommand\reflibrary[1]{\hyperref[sec:library-#1]{\texttt{#1}}}
+
+\index[not print,not index,set={
+ index key=unknown,
+ form={\textbf{unknown!!}},
+ for first={format={
+ result/.expanded=\noexpand\textbf{\forestregister{result}??},
+ print in color}}}
+ ]>{@unknown}
+
+\indexset
+ [print form={},for first={format=pgfkey}]
+ >{node key}
+
+\indexset
+ [for first={format={+result={/tikz/},pgfkey}}]
+ >{tikz key}
+
+\indexset
+ [for first={format=pgfkey}]
+ >{option,readonly option,bracket key,nodewalk key,register,propagator,style,nodewalk style,stage,dynamic tree,step,loop,conditional,anchor,package option}
+
+ %%% begin listing region: index_macro_category
+\indexset
+ [for first={format=macro}]
+ >{macro}
+ %%% end listing region: index_macro_category
+
+\indexset
+ [for first={format=environment}]
+ >{environment}
+
+\indexset
+ [format=empty]>{empty}
+
+\indexset
+ [index form={type (of options and registers)},for first={format=meta}]
+ >{type}
+
+\indexset
+ [for first={format=handler}]
+ >{handler}
+
+\indexset
+ [format={aggregate function},for first={format=handler}]
+ >{aggregate}
+
+\indexset
+ [form={\texttt{pgfmath} function},for first={format={detokenize,pgfkey}}]
+ >{pgfmath}
+
+\indexset
+ [for first={format=path}]
+ >{path}
+
+\indexset[
+ form={},
+ index key={},
+ for first={
+ for first={
+ key+/.option=!parent.argument,
+ index format={
+ result+/.process={Ow1} {!parent.argument} {\protect\meta{##1 option}},
+ },
+ print format={
+ if argument={}{}{
+ result+/.option=argument
+ },
+ },
+ format={
+ pgfkey
+ },
+ }
+ }
+ ]>{prefix}
+
+\indexset[
+ form={},
+ index key={},
+ for first={
+ for first={
+ +key/.option=!parent.argument,
+ index format={
+ +result/.process={Ow1} {!parent.argument} {\protect\meta{##1 option}},
+ },
+ print format={
+ if argument={}{}{
+ +result/.option=argument
+ },
+ },
+ format={
+ pgfkey
+ },
+ }
+ }
+ ]>{suffix}
+
+\indexset[
+ form={},
+ index key={},
+ for first={
+ for first={
+ key/.process={OOw2} {key} {!parent,parent.argument} {##1 ##2},
+ index format={
+ result+/.process={Ow1} {!parent,parent.argument} {\space\protect\meta{##1}},
+ },
+ print format={
+ if argument={}{}{
+ result+={\space},
+ result+/.option=argument
+ }
+ },
+ format={
+ pgfkey
+ },
+ }
+ }
+ ]>{word prefix}
+
+\indexset[
+ form={},
+ index key={},
+ for first={
+ for first={
+ key/.process={OOw2} {key} {!parent,parent.argument} {##2 ##1},
+ index format={
+ +result/.process={Ow1} {!parent,parent.argument} {\protect\meta{##1}\space},
+ },
+ print format={
+ if argument={}{}{
+ +result={\space},
+ +result/.option=argument
+ }
+ },
+ format={
+ pgfkey
+ },
+ }
+ }
+ ]>{word suffix}
+
+\indexset[%option values
+ index key format={result/.expanded=\forestoption{argument} value},
+ format={result/.expanded=\noexpand\texttt{\forestoption{argument}} value},
+ for first={format=pgfkey}
+ ]>{value of}
+
+\indexset[
+ index key format={result/.expanded=\forestoption{argument} option},
+ format={result/.expanded=\noexpand\texttt{\forestoption{argument}} option},
+ for first={format=pgfkey}
+ ]>{option of}
+
+\indexset
+ [form={},for first={
+ print format={if argument={}{}{
+ result+={:\ },
+ result+/.option=argument,
+ }},
+ format=meta,
+ }]>{meta}
+
+\indexset[
+ for first={+key={{cs }},format={pgfkey}}
+ ]>{forest cs}
+
+\indexset[
+ for first={+key={{ss }},format={pgfkey}}
+ ]>{short step}
+
+\indexset
+ [for first={format=pgfkey}]
+ >{named nodewalk}
+
+\indexset[
+ format={result/.expanded=\noexpand\texttt{process instruction}},
+ for first={format=pgfkey}
+ ]>{processor}
+
+{\makeatletter % an dirty patch: \lst@nolig can sneak in the name...
+\gdef\myexampleindex#1{{\def\lst@nolig{}\lstaspectindex{#1}{}}}
+}
+\lstset{indexstyle={[1]\myexampleindex}}
+%%% end lst-related stuff
+
+\EnableCrossrefs
+\setlength\hfuzz{15pt} % dont make so many
+\hbadness=7000 % over and under full box warnings
+
+\usetikzlibrary{intersections}
+\tikzset{>=latex}
+\forestset{
+ background tree/.style={
+ for tree={text opacity=0.2,draw opacity=0.2,edge={draw opacity=0.2}}}
+}
+
+\title{\FoRest;: a \PGF;/\TikZ;-based package for drawing linguistic trees\\\normalsize\forestversion}
+\author{Sa\v so \v Zivanovi\'c\footnote{e-mail:
+ \href{mailto:saso.zivanovic@guest.arnes.si}{saso.zivanovic@guest.arnes.si};
+ web:
+ \href{http://spj.ff.uni-lj.si/zivanovic/}{http://spj.ff.uni-lj.si/zivanovic/}}}
+
+%\usepackage[verbose]{trace-pgfkeys} % silent, stack, trace, verbose
+%\pgfkeystracelevel{trace}
+
+\begin{document}
+
+\typeout{)}% hacking auctex's error finding routing
+
+% short verbatim: | (changes spaces into _)
+\DeleteShortVerb\|
+\def\indexpipe{|}
+{\catcode`\_=12 \def\marshal{%
+\lstMakeShortInline[basicstyle=\ttfamily,literate={_}{ }1 {__}{_}1]}%
+\expandafter}\marshal |
+
+\IfFileExists{forest-doc-test.tex}{%
+ \input forest-doc-test\relax
+}{}
+
+\newbox\treebox
+\newbox\codebox
+
+{\settodayfromforestdate\maketitle}
+
+\begin{abstract}
+\FoRest; is a \PGF;/\TikZ;-based package for drawing linguistic (and
+other kinds of) trees. Its main features are
+\begin{enumerate*}[(i)]
+\item a packing algorithm which can produce very compact trees;
+\item a user-friendly interface consisting of the familiar bracket encoding of trees plus the
+ key--value interface to option-setting;
+\item many tree-formatting options, with control over option values of individual nodes and
+ mechanisms for their manipulation;
+\item a powerful mechanism for traversing the tree;
+\item the possibility to decorate the tree using the full power of \PGF;/\TikZ;;
+\item an externalization mechanism sensitive to code-changes.
+\end{enumerate*}
+\end{abstract}
+
+\vspace{1cm}
+
+\begin{forestexample}[basicstyle=\ttfamily\scriptsize,layout=tree on top,no label,v sep=1cm,index={content,pgfmath,conditional>if,repeat,append,before drawing tree,y,alias,for step,step>children,edge,before typesetting nodes,tree,s sep,dimen+,option>l,ancestors,typeset node,nodewalk,readonly option>level,sort by,step>min}]
+ \pgfmathsetseed{14285}
+ \begin{forest}
+ random tree/.style n args={3}{% #1 = max levels, #2 = max children, #3 = max content
+ content/.pgfmath={random(0,#3)},
+ if={#1>0}{repeat={random(0,#2)}{append={[,random tree={#1-1}{#2}{#3}]}}}{}},
+ before typesetting nodes={for tree={draw,s sep=2pt,rotate={int(30*rand)},l+={5*rand},
+ if={isodd(level())}{fill=green}{fill=yellow}}},
+ important/.style={draw=red,line width=1.5pt,edge={red,line width=1.5pt}},
+ before drawing tree={sort by=y, for nodewalk={min=tree,ancestors}{important,typeset node}}
+ [,random tree={9}{3}{100}]
+ \end{forest}
+ \end{forestexample}%
+ \begin{center}\mbox{}\box\treebox\\\box\codebox\end{center}
+
+\newpage
+{%
+ \parskip 0pt
+ \begin{multicols}{2}
+ \tableofcontents
+ \end{multicols}
+}
+
+\newpage
+
+\section{Introduction}
+
+Over several years, I had been a grateful user of various packages
+for typesetting linguistic trees. My main experience was with
+|qtree| and |synttree|, but as far as I can tell, all of the tools
+on the market had the same problem: sometimes, the trees were just
+too wide. They looked something like the tree on the left,
+while I wanted something like the tree on the right.
+\begin{center}
+ \begin{forest}
+ baseline,
+ for tree={parent anchor=south,child anchor=north,l=7ex,s sep=10pt},
+ for children={fit=rectangle}
+ [CP
+ [DP
+ [D][NP[N][CP[C][TP[T][vP[v][VP[DP][V'[V][DP]]]]]]]]
+ [TP
+ [T][vP[v][VP[DP][V'[V][DP]]]]]
+ ]
+ \end{forest}
+ \hfill
+ \begin{forest}
+ baseline,
+ for tree={parent anchor=south,child anchor=north,l=7ex,s sep=10pt},
+ [CP
+ [DP
+ [D][NP[N][CP[C][TP[T][vP[v][VP[DP][V'[V][DP]]]]]]]]
+ [TP
+ [T][vP[v][VP[DP][V'[V][DP]]]]]
+ ]
+ \end{forest}
+\end{center}
+
+Luckily, it was possible to tweak some parameters by hand to get a
+narrower tree, but as I quite dislike constant manual adjustments, I
+eventually started to develop \foRest;. It started out as
+|xyforest|, but lost the |xy| prefix as I became increasingly fond
+of \PGF;/\TikZ;, which offered not only a drawing package but also a
+`programming paradigm.' It is due to the awesome power of the
+supplementary facilities of \PGF;/\TikZ; that \foRest; is now, I
+believe, the most flexible tree typesetting package for \LaTeX\ you can get.
+
+The latest stable version of \FoRest; is \href{http://www.ctan.org/pkg/forest}{available at CTAN}.
+Development version(s) can be found \href{https://github.com/sasozivanovic/forest}{at GitHub}.
+Comments, criticism, suggestions and code are all very welcome! If you find the package useful, you
+can show your appreciation by making a PayPal donation to \url{saso.zivanovic@guest.arnes.si}.
+
+
+\section{Tutorial}
+\label{sec:tutorial}
+
+This short tutorial progresses from basic through useful to obscure \dots fortunately, it is not the
+only newcomer's source of information on \foRest;: check out
+\href{http://mirrors.ctan.org/info/forest-quickstart/ForestQuickstart.pdf}{Forest Quickstart Guide
+ for Linguists}. Another very useful source of information (and help!) about \foRest; and \TeX\ in
+general is \href{http://tex.stackexchange.com}{\TeX\ StackExchange}. Check out the questions tagged
+\href{http://tex.stackexchange.com/questions/tagged/forest}{\texttt{forest}}!
+
+
+\subsection{Basic usage}
+\label{tut:basic-usage}
+
+A tree is input by enclosing its specification in a \index{forest}
+environment. The tree is encoded by \emph{the bracket syntax}:
+every node is enclosed in square brackets; the children of a
+node are given within its brackets, after its content.
+{\lstdefinelanguage[my]{TeX}[LaTeX]{TeX}{keywords=forest,
+ otherkeywords={[,]},keywordstyle=\pstyle,texcsstyle={}}%
+\lstset{language={[my]TeX}}%
+\begin{forestexample}
+ \begin{forest}
+ [VP
+ [DP]
+ [V'
+ [V]
+ [DP]
+ ]
+ ]
+ \end{forest}
+\end{forestexample}}
+Binary trees are nice, but not the only thing this package can draw.
+Note that by default, the children are vertically centered with
+respect to their parent, i.e.\ the parent is vertically aligned with the midpoint between the
+first and the last child.
+\begin{forestexample}
+ \begin{forest}
+ [VP
+ [DP[John]]
+ [V'
+ [V[sent]]
+ [DP[Mary]]
+ [DP[D[a]][NP[letter]]]
+ ]
+ ]
+ \end{forest}
+\end{forestexample}
+Spaces around brackets are ignored --- format your code as you
+desire!
+\begin{forestexample}
+ \begin{forest}
+ [VP[DP][V'[V][DP]]]
+ \end{forest}
+ \quad
+ \begin{forest}[VP
+ [DP ] [ V'[V][ DP]]
+ ]\end{forest}
+\end{forestexample}
+If you need a square bracket as part of a node's content, use
+braces. The same is true for the other characters which have a
+special meaning in the \foRest; package, like comma
+|,| and equality sign |=|.
+\begin{forestexample}
+ \begin{forest}
+ [V{P,}
+ [{[DP]}]
+ [V'
+ [V]
+ [{===DP===}]]]
+ \end{forest}
+\end{forestexample}
+Macros in a node specification will be expanded when the node is
+drawn --- you can freely use formatting commands inside nodes!
+\begin{forestexample}
+ \begin{forest}
+ [VP
+ [{~\textbf~{DP}}]
+ [V'
+ [V]
+ [DP]]]
+ \end{forest}
+\end{forestexample}
+
+All the examples given above produced top-down trees with centered children. The other sections
+of this manual explain how various properties of a tree can be changed, making it possible to
+typeset radically different-looking trees. However, you don't have to learn everything about this
+package to profit from its power. Using styles, you can draw predefined types of trees with ease.
+For example, a phonologist can use the \index{GP1} style from library \reflibrary{linguistics} to easily
+typeset (Government Phonology) phonological representations. The style is applied simply by
+writing its name before the first (opening) bracket of the tree.
+\begin{forestexample}[label=ex:gp1-frost,code prefix={\def\usepackage[##1]##2{}}]
+ \usepackage[~linguistics~]{forest}
+ % ...
+ \begin{forest} ~GP1~ [
+ [O[x[f]][x[r]]]
+ [R[N[x[o]]][x[s]]]
+ [O[x[t]]]
+ [R[N[x]]]
+ ]\end{forest}
+\end{forestexample}
+Of course, someone needs to develop the style --- you, me, your local \TeX nician \dots\@
+Fortunately, designing styles is not very difficult once you get the hang of \foRest;, if you
+write one, please contribute! Some macros relating to various fields are collected in
+\emph{libraries} that are distributed alongside the main package. This is the case for the
+\index{GP1} style used above, which is defined in the |linguistics| library. The simplest way to
+load a library is as shown in the example, by loading the package with an optional argument. For
+more information on loading libraries, see \S\ref{ref:package-options}.
+
+
+\subsection{Options}
+\label{tut:options}
+
+A node can be given various options, which control various
+properties of the node and the tree. For example, at the end of
+section~\ref{tut:basic-usage}, we have seen that the \index{GP1} style
+vertically aligns the parent with the first
+child. This is achieved by setting option \index{calign} (for
+\emph{c}hild-\emph{align}ment) to \index{value of=calign>first} (child).
+
+Let's try. Options are given inside the brackets, following the
+content, but separated from it by a comma. (If multiple options are
+given, they are also separated by commas.) A single option
+assignment takes the form \meta{option name}|=|\meta{option value}. (There are
+also options which do not require a value or have a default value:
+these are given simply as \meta{option name}.)
+\begin{forestexample}[label=ex:numerals-simple,index={calign,value of=align>first}]
+ \begin{forest}
+ [\LaTeX\ numerals, ~calign=first~
+ [arabic[1][2][3][4]]
+ [roman[i][ii][iii][iv]]
+ [alph[a][b][c][d]]
+ ]
+ \end{forest}
+\end{forestexample}
+
+The experiment has succeeded only partially. The root node's
+children are aligned as desired (so \index{calign}|=|\index{value of=calign>first} applied to the
+root node), but the value of the \index{calign} option didn't get
+automatically assigned to the root's children! \emph{An option given
+at some node applies only to that node.} In \foRest;, the options
+are passed to the node's relatives via special keys, called
+\emph{propagators}. What we need above is the \index{for step=\index{tree}}
+propagator. Observe:
+
+\begin{forestexample}[label=ex:numerals-manual]
+ \begin{forest}
+ [\LaTeX\ numerals,
+ ~for tree~={calign=first}
+ [arabic[1][2][3][4]]
+ [roman[i][ii][iii][iv]]
+ [alph[a][b][c][d]]
+ ]
+ \end{forest}
+\end{forestexample}
+The value of propagator \index{for step=\index{tree}} is a list of keys that we
+want to process. This keylist is propagated to all the nodes in
+the subtree\footnote{It might be more precise to call \index{for step=\index{tree}}
+\texttt{for subtree} \dots\@ but this name at least saves some typing.}
+rooted in the current node (i.e.\ the node where \index{for step=\index{tree}} was
+given), including the node itself. (Propagator \index{for step=\index{descendants}} is
+just like \index{for step=\index{tree}}, only that it excludes the node itself. There
+are many other \index{for step=\meta{step}} propagators; for the complete list, see
+sections~\ref{ref:spatial-propagators} and \ref{ref:nodewalks}.)
+
+Some other useful options are \index{option>parent anchor}, \index{option>child anchor} and
+\index{tier}. The \index{option>parent anchor} and \index{option>child anchor} options tell
+where the parent's and child's endpoint of the edge between them should be, respectively: usually,
+the value is either empty (meaning a smartly determined border point
+\citep[see][\S16.11]{tikzpgf2.10}; this is the default) or a compass direction
+\citep[see][\S16.5.1]{tikzpgf2.10}. (Note: the \index{option>parent anchor} determines where the edge
+from the child will arrive to this node, not where the node's edge to its parent will start!)
+
+Option \index{tier} is what makes the
+skeletal points $\times$ in example (\ref{ex:gp1-frost}) align horizontally although they
+occur at different levels in the logical structure of the tree.
+Using option \index{tier} is very simple: just set |tier=tier_name| at
+all the nodes that you want to align horizontally. Any tier name
+will do, as long as the tier names of different tiers are
+different \dots\@ (Yes, you can have multiple tiers!)
+\begin{forestexample}[point={tier},index={option>parent anchor,option>child anchor,tier},label=ex:tier-manual]
+ \begin{forest}
+ [VP, for tree={~parent anchor~=south, ~child anchor~=north}
+ [DP[John,tier=word]]
+ [V'
+ [V[sent,tier=word]]
+ [DP[Mary,tier=word]]
+ [DP[D[a,tier=word]][NP[letter,tier=word]]]
+ ]
+ ]
+ \end{forest}
+\end{forestexample}
+Before discussing the variety of \foRest;'s options, it is worth
+mentioning that \foRest;'s node accepts all options \citep[see
+\S16]{tikzpgf2.10} that \TikZ;'s node does --- mostly, it just passes
+them on to \TikZ;. For example, you can easily encircle a node like
+this:\footnote{If option \texttt{draw} was not given, the shape of the node
+would still be circular, but the edge would not be drawn. For
+details, see \cite[\S16]{tikzpgf2.10}.}
+\begin{forestexample}
+ \begin{forest}
+ [VP,~circle~,~draw~
+ [DP][V'[V][DP]]
+ ]
+ \end{forest}
+\end{forestexample}
+
+Let's have another look at example (\ref{ex:gp1-frost}). You will note that the skeletal
+positions were input by typing |x|s, while the result looks like
+this: $\times$ (input as |\times| in math mode). Obviously, the
+content of the node can be changed. Even more, it can be
+manipulated: added to, doubled, boldened, emphasized, etc. We will
+demonstrate this by making example (\ref{ex:numerals-manual}) a bit
+fancier: we'll write the input in the arabic numbers and have
+\LaTeX\ convert it to the other formats. We'll start with the
+easiest case of roman numerals: to get them, we can use the (plain)
+\TeX\ command |\romannumeral|. To change the content of the node,
+we use option \index{content}. When specifying its new value, we can use
+|#1| to insert the current content.\footnote{This mechanism is called
+ \emph{wrapping}. By default, \index{content} is the only \index{autowrapped toks} option,
+ i.e.\ option where wrapping works implicitely (simply
+because I assume that wrapping will be almost exclusively used with this option). To wrap values
+of other options, use handler \index{wrap value}; see~\S\ref{ref:handlers}.}
+\begin{forestexample}[point={content,delay},index={for step,step>children,content,delay},label=ex:romannumeral]
+ \begin{forest}
+ [roman, delay={for children={content=\romannumeral#1}}
+ [1][2][3][4]
+ ]
+ \end{forest}
+\end{forestexample}
+This example introduces another option: \index{delay}. Without it, the example wouldn't work: we
+would get arabic numerals. This is so because of the order in which the options are processed.
+First, the processing proceeds through the tree in a depth-first, parent-first fashion (first the
+parent is processed, and then its children, recursively; but see \index{processing order}). Next,
+the option string of a node is processed linearly, in the order they were given. Option
+\index{content} is specified implicitely and is always the first. If a propagator is encountered,
+the options given as its value are propagated \emph{immediately}. The net effect is that if the
+above example contained simply |roman,for_children={content=...}|, the \index{content} option
+given there would be processed \emph{before} the implicit content options given to the children
+(i.e.\ numbers |1|, |2|, |3| and |4|). Thus, there would be nothing for the |\romannumeral| to
+change --- it would actually crash; more generally, the content assigned in such a way would get
+overridden by the implicit content. Key \index{delay} is true to its name. It delays the
+processing of the keylist given as its argument until the whole tree was processed. In other words, it
+introduces cyclical option processing. Whatever is delayed in one cycle, gets processed in the next
+one. The number of cycles is not limited --- you can nest \index{delay}s as deep as you need.
+
+Unlike \index{for step=\meta{step}} keys we have met before, \index{delay} is not a
+spatial, but a temporal propagator. Several other temporal propagators options exist, see
+\S\ref{ref:stages}.
+
+We are now ready to learn about simple conditionals.\footnote{See \S\ref{ref:conditionals} for
+ further information on conditionals, including the generic \index{if} and \index{where}.} Every
+node option has the corresponding \index{if option=\meta{option}} and \index{where
+ option=\meta{option}} keys. \index{if option=\meta{option}}|=|\meta{value}\meta{true
+ options}\meta{false options} checks whether the value of \meta{option} equals \meta{value}. If
+so, \meta{true options} are processed, otherwise \meta{false options}. The \index{where
+ option=\meta{option}} keys are the same, but do this for the every node in the subtree; informally
+speaking, |where| = |for_tree| + |if|. To see this in action, consider the rewrite of the
+\index{tier} example (\ref{ex:tier-manual}) from above. We don't set the tiers manually, but rather
+put the terminal nodes (option \index{n children} is a read-only option containing the number of
+children) on tier \keyname{word}.\footnote{We could omit the braces around \texttt{0} because it is
+ a single character. If we were hunting for nodes with 42 children, we'd have to write
+ \texttt{where n children=\{42\}...}.}
+\begin{forestexample}[index={tier,where option,n children}]
+ \begin{forest}
+ ~where n children~=0{tier=word}{}
+ [VP
+ [DP[John]]
+ [V'
+ [V[sent]]
+ [DP[Mary]]
+ [DP[D[a]][NP[letter]]]
+ ]
+ ]
+ \end{forest}
+\end{forestexample}
+
+\begin{advise}
+\item Note that you usually don't want to embed a \index{where option=...} conditional in a \index{for
+ step=\index{tree}}, as this will lead to a multiple traversal of many nodes, resulting in a
+ slower execution. If you're inside a \index{for step=\index{tree}}, you probably want to use
+ \index{if}.
+\end{advise}
+
+
+Finally, let's talk about styles.
+(They are not actually defined in the \foRest; package, but rather
+inherited from |pgfkeys|.)
+
+
+
+
+At the first approximation, styles are abbreviations: if you
+often want to have non-default parent/child anchors, say south/north as in example
+(\ref{ex:tier-manual}), you could save some typing by defining a style. Styles are defined using
+\PGF;'s handler |.style|, like shown below.\footnote{Style \index{sn edges} is actually already
+ defined by library \reflibrary{linguistics}. The definition there is a bit more generic.}
+\begin{forestexample}[index={tier,option>parent anchor,option>child anchor}]
+ \begin{forest}
+ ~sn edges~/~.style~={for tree={
+ parent anchor=south, child anchor=north}},
+ ~sn edges~
+ [VP,
+ [DP[John,tier=word]]
+ [V'
+ [V[sent,tier=word]]
+ [DP[Mary,tier=word]]
+ [DP[D[a,tier=word]][NP[letter,tier=word]]]]]
+ \end{forest}
+\end{forestexample}
+If you want to use a style in more than one tree, you have to define it outside the \index{forest}
+environment. Use macro \index{forestset} to do this.
+\begin{lstlisting}
+ ~\forestset~{
+ sn edges/.style={for tree={parent anchor=south, child anchor=north}},
+ background tree/.style={for tree={
+ text opacity=0.2,draw opacity=0.2,edge={draw opacity=0.2}}}
+ }
+\end{lstlisting}
+
+You might have noticed that in the last two examples, some keys occurred even before the
+first opening bracket, contradicting was said at the beginning of this section. This is mainly
+just syntactic sugar (it can separate the design and the content): such \emph{preamble}
+keys behave as if they were given in the root node, the only difference (which often does not
+matter) being that they get processed before all other root node options, even the implicit
+\index{content}.
+
+If you find yourself writing the same preamble for every tree in your document,
+consider modifying \index{default preamble}, which is implicitely included at the beginning
+of every preamble.
+
+\begin{forestexample}[index={default preamble}]
+ \forestset{
+ ~default preamble~={
+ font=\Huge,
+ for tree={circle,draw}
+ }
+ }
+ \begin{forest} [A[B][C]] \end{forest}
+ \begin{forest} red [D[E][F]] \end{forest}
+ \begin{forest} for tree={dotted} [G[H][I]] \end{forest}
+\end{forestexample}
+
+\subsection{Decorating the tree}
+\label{tut:decorating}
+
+The tree can be decorated (think movement arrows) with arbitrary
+\TikZ; code.
+\begin{forestexample}
+ \begin{forest}
+ [XP
+ [specifier]
+ [X$'$
+ [X$^0$]
+ [complement]
+ ]
+ ]
+ ~\node at (current bounding box.south)
+ [below=1ex,draw,cloud,aspect=6,cloud puffs=30]
+ {\emph{Figure 1: The X' template}};~
+ \end{forest}
+\end{forestexample}
+
+However, decorating the tree would make little sense if one could
+not refer to the nodes. The simplest way to do so is to give them a
+\TikZ; name using the \index{option>name} option, and then use this name in \TikZ;
+code as any other (\TikZ;) node name.
+\begin{forestexample}[point=name,index={option>phantom,option>name}]
+ \begin{forest}
+ [CP
+ [DP,name=spec CP]
+ [\dots
+ [,phantom]
+ [VP
+ [DP]
+ [V'
+ [V]
+ [DP,name=object]]]]]
+ \draw[->,dotted] ~(object)~ to[out=south west,in=south] ~(spec CP)~;
+ \end{forest}
+\end{forestexample}
+
+It gets better than this, however! In the previous examples, we put
+the \TikZ; code after the tree specification, i.e.\ after the closing
+bracket of the root node. In fact, you can put \TikZ; code after
+\emph{any} closing bracket, and \foRest; will know what the current
+node is. (Putting the code after a node's bracket is actually just a
+special way to provide a value for option \index{tikz} of that node.) To
+refer to the current node, simply use an empty node name. This works both with and without
+anchors \citep[see][\S16.11]{tikzpgf2.10}: below, |(.south east)| and |()|.
+\begin{forestexample}[index={option>phantom,option>name}]
+ \begin{forest}
+ [CP
+ [DP,name=spec CP]
+ [\dots
+ [,phantom]
+ [VP
+ [DP]
+ [V'
+ [V]
+ [DP,draw] ~{~
+ \draw[->,dotted] ~()~ to[out=south west,in=south] (spec CP);
+ \draw[<-,red] ~(.south east)~--++(0em,-4ex)--++(-2em,0pt)
+ node[anchor=east,align=center]{This guy\\has moved!};
+ ~}~
+ ]]]]
+ \end{forest}
+\end{forestexample}
+
+Important: \emph{the \TikZ; code should usually be enclosed in braces} to hide
+it from the bracket parser. You don't want all the bracketed code
+(e.g.\ |[->,dotted]|) to become tree nodes, right? (Well, they
+probably wouldn't anyway, because \TeX\ would spit out a thousand
+errors.)
+
+\bigskip
+
+Finally, the most powerful tool in the node reference toolbox:
+\emph{relative nodes}. It is possible to refer to other nodes which stand
+in some (most often geometrical) relation to the current node. To
+do this, follow the node's name with a \index>{!} and a \emph{nodewalk}
+specification.
+
+A nodewalk is a concise\footnote{Actually, \foRest; distinguishes two kinds of steps in node walks:
+ long-form and short-form steps. This section introduces only short-form steps. See
+ \S\ref{ref:nodewalks}.} way of expressing node relations. It is simply a string of steps, which
+are represented by single characters, where: \index{ss u} stands for the parent node (up); \index{ss
+ p} for the previous sibling; \index{ss n} for the next sibling; \index{ss s} for \emph{the}
+sibling (useful only in binary trees); \index{ss 1}, \index{ss 2}, \index[not print]{ss 3,ss 4,ss
+ 5,ss 6,ss 7,ss 8}\dots\ \index{ss 9} for first, second, \dots\ ninth child; \index{ss l}, for the
+last child, etc. For the complete specification, see section~\ref{ref:short-form-steps}.
+
+To see the nodewalk in action, consider the following examples.
+In the first example, the agree arrow connects the V node, specified
+simply as |()|, since the \TikZ; code follows |[V]|, and the DP node,
+which is described as ``a sister of V's parent'': |!us| = up +
+sibling.
+\begin{forestexample}[index>={!}]
+ \begin{forest}
+ [VP
+ [DP]
+ [V'
+ [V] {\draw[<->] ~()~
+ .. controls +(left:1cm) and +(south west:0.4cm) ..
+ node[very near start,below,sloped]{\tiny agree}
+ ~(!us)~;}
+ [DP]
+ ]
+ ]
+ \end{forest}
+\end{forestexample}
+
+\begingroup
+\footnotesize
+\begin{forestexample}[index={option>phantom,tikz,fit to,tree},layout=export,basicstyle=\footnotesize\ttfamily]
+ \begin{forest}
+ [CP
+ [DP$_1$]
+ [\dots
+ [,phantom]
+ [VP,tikz={\node [draw,red,inner sep=0,~fit to~=tree]{};}
+ [DP$_2$]
+ [V'
+ [V]
+ [DP$_3$]
+ ]]]]
+ \end{forest}
+\end{forestexample}%
+\endgroup
+
+The second example uses \TikZ;'s fitting library (automatically loaded by \foRest;) to compute the
+smallest rectangle containing node VP, its first child (DP$_2$) and its last grandchild (DP$_3$).
+The example also illustrates that the \TikZ; code
+can be specified via the ``normal'' option syntax, i.e.\ as a value
+to option \index{tikz}.\footnote{\label{fn:fit-to-tree}Actually, there's a simpler way to do this: use \index{fit to}\keyname{=}\index{tree}!\forestexampleimport}
+\begin{forestexample}[point=tikz,index={option>phantom,tikz},index>={!}]
+ \begin{forest}
+ [CP
+ [DP$_1$]
+ [\dots
+ [,phantom]
+ [VP,tikz={\node [draw,red,fit=~()(!1)(!ll)~] {};}
+ [DP$_2$]
+ [V'
+ [V]
+ [DP$_3$]
+ ]]]]
+ \end{forest}
+\end{forestexample}
+
+
+\subsection{Node positioning}
+\label{tut:node-positioning}
+
+\FoRest; positions the nodes by a recursive bottom-up algorithm which, for every non-terminal node,
+computes the positions of the node's children relative to their parent. By default, all the
+children will be aligned horizontally some distance down from their parent: the ``normal'' tree
+grows down. More generally, however, the direction of growth can change from node to node; this is
+controlled by option \index{grow}=\meta{direction}.\footnote{The direction can be specified either in
+ degrees (following the standard mathematical convention that $0$ degrees is to the right, and that
+ degrees increase counter-clockwise) or by the compass directions: \texttt{east}, \texttt{north east},
+ \texttt{north}, etc.} The system computes and stores the positions of children using a
+coordinate system dependent on the parent, called an \emph{ls-coordinate system}: the origin is the
+parent's anchor; l-axis is in the direction of growth in the parent; s-axis is orthogonal to the
+l-axis (positive side in the counter-clockwise direction from $l$-axis); l stands for \emph{l}evel,
+s for \emph{s}ibling. The example shows the ls-coordinate system for a node with
+|grow=45|.\footnote{The axes are drawn using coordinates given in \texttt{forest cs} coordinate
+ system; the ``manually'' given polar coordinate equivalent is shown in the comment.}
+
+\begin{forestexample}[point=grow,index={grow}]
+ \begin{forest} background tree
+ [parent, grow=45
+ [child 1][child 2][child 3][child 4][child 5]
+ ]
+ %\draw[,->](-135:1cm)--(45:3cm) node[below]{$l$};
+ \draw[,->](forest cs:l=-1cm,s=0)--(forest cs:l=3cm,s=0) node[below]{$l$};
+ %\draw[,->](-45:1cm)--(135:3cm) node[right]{$s$};
+ \draw[,->](forest cs:s=-1cm,l=0)--(forest cs:s=3cm,l=0) node[right]{$s$};
+ \end{forest}
+\end{forestexample}
+
+\begin{forestexample}[basicstyle=\scriptsize\ttfamily,layout=export]
+ \newcommand\measurexdistance[5][####1]{\measurexorydistance{#2}{#3}{#4}{#5}{\x}{-|}{(5pt,0)}{#1}}
+ \newcommand\measureydistance[5][####1]{\measurexorydistance{#2}{#3}{#4}{#5}{\y}{|-}{(0,5pt)}{#1}}
+ \tikzset{dimension/.style={<->,>=latex,thin,every rectangle node/.style={midway,font=\scriptsize}},
+ guideline/.style=dotted}
+ \newdimen\absmd
+ \def\measurexorydistance#1#2#3#4#5#6#7#8{%
+ \path #1 #3 #6 coordinate(md1) #1; \draw[guideline] #1 -- (md1);
+ \path (md1) #6 coordinate(md2) #2; \draw[guideline] #2 -- (md2);
+ \path let \p1=($(md1)-(md2)$), \n1={abs(#51)} in \pgfextra{\xdef\md{#51}\global\absmd=\n1\relax};
+ \def\distancelabelwrapper##1{#8}%
+ \ifdim\absmd>5mm
+ \draw[dimension] (md1)--(md2) node[#4]{\distancelabelwrapper{\uselengthunit{mm}\rndprintlength\absmd}};
+ \else
+ \ifdim\md>0pt
+ \draw[dimension,<-] (md1)--+#7; \draw[dimension,<-] let \p1=($(0,0)-#7$) in (md2)--+(\p1);
+ \else
+ \draw[dimension,<-] let \p1=($(0,0)-#7$) in (md1)--+(\p1); \draw[dimension,<-] (md2)--+#7;
+ \fi
+ \draw[dimension,-] (md1)--(md2) node[#4]{\distancelabelwrapper{\uselengthunit{mm}\rndprintlength\absmd}};
+ \fi}
+\end{forestexample}
+\input{\jobname.tmp}
+
+
+The l-coordinate of children is (almost) completely under your control, i.e.\ you set what is often
+called the level distance by yourself. Simply set option \index{option>l} to change the distance of
+a node from its parent.\footnote{If setting \index{option>l} seems to have no effect, read about
+ \index{l sep} further down this section.} More precisely, \index{option>l}, and the related option
+\index{option>s}, control the distance between the (node) anchors of a node and its parent. The
+anchor of a node can be changed using option \index{option>anchor}: by default, nodes are anchored
+at their base; see \cite[\S16.5.1]{tikzpgf2.10}.) In the example below, positions of the anchors
+are shown by dots: observe that anchors of nodes with the same \index{option>l} are aligned and that
+the distances between the anchors of the children and the parent are as specified in the
+code.\footnote{Here are the definitons of the macros for measuring distances. Args: the x or y
+ distance between points \#2 and \#3 is measured; \#4 is where the distance line starts (given as
+ an absolute coordinate or an offset to \#2); \#5 are node options; the optional arg \#1 is the
+ format of label. (Lengths are printed using package \texttt{printlen}.)
+
+\box\codebox}
+\begin{forestexample}[layout=tree on top,index={for step,tree,tikz,option>l,option>anchor},index>={!}]
+ \begin{forest} background tree,
+ for tree={draw,tikz={\fill[](.anchor)circle[radius=1pt];}}
+ [parent
+ [child 1, ~l~=10mm, ~anchor~=north west]
+ [child 2, ~l~=10mm, ~anchor~=south west]
+ [child 3, ~l~=12mm, ~anchor~=south]
+ [child 4, ~l~=12mm, ~anchor~=base east]
+ ]
+ \measureydistance[\texttt{l(child)}=#1]{(!2.anchor)}{(.anchor)}{(!1.anchor)+(-5mm,0)}{left}
+ \measureydistance[\texttt{l(child)}=#1]{(!3.anchor)}{(.anchor)}{(!4.anchor)+(5mm,0)}{right}
+ \measurexdistance[\texttt{s sep(parent)}=#1]{(!1.south east)}{(!2.south west)}{+(0,-5mm)}{below}
+ \measurexdistance[\texttt{s sep(parent)}=#1]{(!2.south east)}{(!3.south west)}{+(0,-5mm)}{below}
+ \measurexdistance[\texttt{s sep(parent)}=#1]{(!3.south east)}{(!4.south west)}{+(0,-8mm)}{below}
+ \end{forest}
+\end{forestexample}
+
+Positioning the chilren in the s-dimension is the job and \emph{raison d'etre} of the package. As a
+first approximation: the children are positioned so that the distance between them is at least the
+value of option \index{s sep} (s-separation), which defaults to double \PGF;'s |inner_xsep| (and this
+is 0.3333em by default). As you can see from the example above, s-separation is the distance
+between the borders of the nodes, not their anchors!
+
+A fuller story is that \index{s sep} does not control the s-distance between two siblings, but rather
+the distance between the subtrees rooted in the siblings. When the green and the yellow child of
+the white node are s-positioned in the example below, the horizontal
+distance between the green and the yellow subtree is computed. It can be seen with the naked eye
+that the closest nodes of the subtrees are the TP and the DP with a red border. Thus, the children
+of the root CP (top green DP and top yellow TP) are positioned so that the horizontal distance
+between the red-bordered TP and DP equals \index{s sep}.
+\begin{forestexample}[index={for step,tree,s sep}]
+ \begin{forest}
+ important/.style={name=#1,draw={red,thick}}
+ [CP, ~s sep~=3mm, for tree=draw
+ [DP, for tree={fill=green}
+ [D][NP[N][CP[C][TP,important=left
+ [T][vP[v][VP[DP][V'[V][DP]]]]]]]]
+ [TP,for tree={fill=yellow}
+ [T][vP[v][VP[DP,important=right][V'[V][DP]]]]]
+ ]
+ \measurexdistance[\texttt{s sep(root)}=#1]
+ {(left.north east)}{(right.north west)}{(.north)+(0,3mm)}{above}
+ \end{forest}
+\end{forestexample}
+
+Note that \foRest; computes the same distances between nodes
+regardless of whether the nodes are filled or not, or whether their
+border is drawn or not. Filling the node or drawing its border does
+not change its size. You can change the size by adjusting \TikZ;'s
+|inner_sep| and |outer_sep| \citep[\S16.2.2]{tikzpgf2.10}, as shown
+below:
+\begin{forestexample}[index={for step,tree,s sep}]
+ \begin{forest}
+ important/.style={name=#1,draw={red,thick}}
+ [CP, s sep=3mm, for tree=draw
+ [DP, for tree={fill=green,~inner sep~=0}
+ [D][NP,important=left[N][CP[C][TP[T][vP[v]
+ [VP[DP][V'[V][DP]]]]]]]]
+ [TP,for tree={fill=yellow,~outer sep~=2pt}
+ [T,important=right][vP[v][VP[DP][V'[V][DP]]]]]
+ ]
+ \measurexdistance[\texttt{s sep(root)}=#1]
+ {(left.north east)}{(right.north west)}{(.north)+(0,3mm)}{above}
+ \end{forest}
+\end{forestexample}
+(This looks ugly!) Observe that having increased |outer sep| makes the edges stop touching
+borders of the nodes. By (\PGF;'s) default, the |outer sep| is exactly half of the border
+line width, so that the edges start and finish precisely at the border.
+
+Let's play a bit and change the \index{option>l} of the root of the yellow subtree. Below, we set the
+vertical
+distance of the yellow TP to its parent to 3\,cm: and the yellow submarine sinks diagonally \dots\@
+Now, the closest nodes are the higher yellow DP and the green VP.
+\begin{forestexample}[index={option>l,s sep,for step,tree}]
+ \begin{forest}
+ important/.style={name=#1,draw={red,thick}}
+ [CP, s sep=3mm, for tree=draw
+ [DP, for tree={fill=green}
+ [D][NP[N][CP[C][TP
+ [T][vP[v][VP,important=left[DP][V'[V][DP]]]]]]]]
+ [TP,for tree={fill=yellow}, l=3cm
+ [T][vP[v][VP[DP,important=right][V'[V][DP]]]]]
+ ]
+ \measurexdistance[\texttt{s sep(root)}=#1]
+ {(left.north east)}{(right.north west)}{(.north)+(0,3mm)}{above}
+ \end{forest}
+\end{forestexample}
+
+Note that the yellow and green nodes are not vertically aligned anymore. The positioning algorithm
+has no problem with that. But you, as a user, might have, so here's a neat trick. (This only works
+in the ``normal'' circumstances, which are easier to see than describe.)
+\begin{forestexample}[label=ex:l*,index={dimen*=l,option>phantom,for step,tree}]
+ \begin{forest}
+ [CP, for tree=draw
+ [DP, for tree={fill=green},~l*~=3
+ [D][NP]]
+ [TP,for tree={fill=yellow}
+ [T][VP[DP][V'[V][DP]]]]
+ ]
+ \end{forest}
+\end{forestexample}
+We have changed DP's \index{option>l}'s value via ``augmented assignment'' known from
+many programming languages: above, we have used |l*=3| to triple
+\index{option>l}'s value; we could have also said |l+=5mm| or |l-=5mm| to
+increase or decrease its value by 5\,mm, respectively. This
+mechanism works for every numeric and dimensional option in \foRest;.
+
+Let's now play with option \index{s sep}.
+\begin{forestexample}[index={s sep,option>l,dimen*=l,for step,tree}]
+ \begin{forest}
+ [CP, for tree=draw, ~s sep~=0
+ [DP, for tree={fill=green},l*=3
+ [D][NP]]
+ [TP,for tree={fill=yellow}
+ [T][VP[DP][V'[V][DP]]]]
+ ]
+ \end{forest}
+\end{forestexample}
+Surprised? You shouldn't be. The value of \index{s sep} at a given node controls the s-distance
+\emph{between the subtrees rooted in the children of that node}! It has no influence over the
+internal geometry of these subtrees. In the above example, we have set |s_sep=0| only for the root
+node, so the green and the yellow subtree are touching, although internally, their nodes are not.
+Let's play a bit more. In the following example, we set the \index{s sep} to: $0$ at the last
+branching level (level 3; the root is level 0), to 2\,mm at level 2, to 4\,mm at level 1 and to
+6\,mm at level 0.
+
+\begin{forestexample}[label=ex:spread-s,point={level},index={readonly option>level,for step,tree,s sep},index>={!}]
+ \begin{forest}
+ for tree={~s sep~=(3-level)*2mm}
+ [CP, for tree=draw
+ [DP, for tree={fill=green},l*=3
+ [D][NP]]
+ [TP,for tree={fill=yellow}
+ [T][VP[DP][V'[V][DP]]]]
+ ]
+ \measurexdistance{(!11.south east)}{(!12.south west)}{+(0,-5mm)}{below}
+ \path(md2)-|coordinate(md)(!221.south east);
+ \measurexdistance{(!221.south east)}{(!222.south west)}{(md)}{below}
+ \measurexdistance{(!21.north east)}{(!22.north west)}{+(0,2cm)}{above}
+ \measurexdistance{(!1.north east)}{(!221.north west)}{+(0,-2.4cm)}{below}
+ \end{forest}
+\end{forestexample}
+As we go up the tree, the nodes ``spread.'' At the lowest level, V and DP are touching. In the
+third level, the \index{s sep} of level 2 applies, so DP and V' are 2\,mm apart. At the second
+level we
+have two pairs of nodes, D and NP, and T and TP: they are 4\,mm apart. Finally, at level 1, the
+\index{s sep} of level 0 applies, so the green and yellow DP are 6\,mm apart. (Note that D and NP are
+at level 2, not 4! Level is a matter of structure, not geometry.)
+
+As you have probably noticed, this example also demostrated that we can compute the value of an
+option using an (arbitrarily complex) formula. This is thanks to \PGF;'s module |pgfmath|.
+\FoRest; provides an interface to |pgfmath| by defining |pgfmath| functions for every node option,
+and some other information, like the \index{readonly option>level} we have used above, the number of children
+\index{n children}, the sequential number of the child \index{readonly option>n}, etc. For details, see
+\S\ref{ref:pgfmath}.
+
+The final separation parameter is \index{l sep}. It determines the minimal
+separation of a
+node from its descendants. It the value of \index{option>l} is too small, then \emph{all} the
+children (and thus their subtrees)
+are pushed
+away from the parent (by increasing their \index{option>l}s), so that the distance between the node's
+and each child's subtree
+boundary is at least \index{l sep}. The initial \index{option>l} can be too small for
+two reasons: either
+some child is too high, or the parent is too deep. The first problem is easier to see: we force the
+situation using a bottom-aligned multiline node. (Multiline nodes can be easily created using |\\|
+as a line-separator. However, you must first specify the horizontal alignment using option
+\index{align} (see \S\ref{ref:node-appearance}).
+Bottom vertical alignment is achieved by setting \index{base}|=|\index{value of=base>bottom};
+the default, unlike in \TikZ;, is \index{base}|=|\index{value of=base>top}).
+\begin{forestexample}[point={align,base},index={align,base}]
+ \begin{forest}
+ [parent
+ [child]
+ [child]
+ [a very\\tall\\child, align=center, base=bottom]
+ ]
+ \end{forest}
+\end{forestexample}
+
+The defaults for \index{option>l} and \index{l sep} are set so that they ``cooperate.''
+What this
+means and why it is necessary is a complex issue explained in \S\ref{tut:defaults}, which you will
+hopefully never have to read \dots\@ You might be out of luck, however. What if you
+needed to decrease the level distance? And nothing happened, like below on the left? Or, what if
+you used lots of parenthesis in your nodes? And got a strange vertical misalignment, like below
+on the right? Then rest assured that these (at least) are features not bugs and read
+\S\ref{tut:defaults}.
+\begin{forestexample}[layout=tree on top,v sep=-55ex,code left skip=-3cm,label=ex:misalignments,index={option>phantom,for step,step>children,fit,baseline,edge,descendants,content,pgfmath,ss 1}]
+ \begin{forest}
+ [,phantom,for children={l sep=1ex,fit=band,
+ for 1={edge'=,l=0},baseline}
+ [{l+=5mm},for descendants/.pgfmath=content
+ [AdjP[AdvP][Adj'[Adj][PP]]]]
+ [default
+ [AdjP[AdvP][Adj'[Adj][PP]]]]
+ [{l-=5mm},for descendants/.pgfmath=content
+ [AdjP[AdvP][Adj'[Adj][PP]]]]
+ ]
+ \path (current bounding box.west)|-coordinate(l1)(!212.base);
+ \path (current bounding box.west)|-coordinate(l2)(!2121.base);
+ \path (current bounding box.east)|-coordinate(r1)(!212.base);
+ \path (current bounding box.east)|-coordinate(r2)(!2121.base);
+ \draw[dotted] (l1)--(r1) (l2)--(r2);
+ \end{forest}
+ \hspace{5cm}
+ \begin{forest}
+ [x forest, baseline
+ [x[x[x[x[x[x[x[x[x[x[x[x[x]]]]]]]]]]]]]
+ [(x)[(x)[(x)[(x)[(x)[(x)[(x)[(x)[(x)[(x)[(x)[(x)[(x)]]]]]]]]]]]]]
+ ]
+ \end{forest}
+\end{forestexample}
+
+\subsubsection{The defaults, or the hairy details of vertical alignment}
+\label{tut:defaults}
+
+In this section we discuss the default values of options controlling the l-alignment of the nodes.
+The defaults are set with top-down trees in mind, so l-alignment is actually vertical alignment.
+There are two desired effects of the defaults. First, the spacing between the nodes of a tree
+should adjust to the current font size. Second, the nodes of a given level should be vertically
+aligned (at the base), if possible.
+
+Let us start with the base alignment: \TikZ;'s default is to anchor the nodes at their center,
+while \foRest;, given the usual content of nodes in linguistic representations, rather anchors them
+at the base \cite[\S16.5.1]{tikzpgf2.10}. The difference is particularly clear for a ``phonological''
+representation:
+\begin{forestexample}[index={for step,tree,option>anchor}]
+ \begin{forest} for tree={anchor=center}
+ [maybe[m][a][y][b][e]]
+ \end{forest}\quad
+ \begin{forest}
+ [maybe[m][a][y][b][e]]
+ \end{forest}
+\end{forestexample}
+The following example shows that the vertical distance between nodes depends on the current font size.
+\begin{forestexample}
+ \hbox{\small A small tree
+ \begin{forest} baseline
+ [VP[DP][V'[V][DP]]]
+ \end{forest}
+ \normalsize and
+ \large
+ a large tree
+ \begin{forest} baseline
+ [VP[DP][V'[V][DP]]]
+ \end{forest}}
+\end{forestexample}
+Furthermore, the distance between nodes also depends on the value of \PGF;'s |inner_sep| (which
+also depends on the font size by default: it equals 0.3333\,em).
+\[\index{l sep}=\mbox{height}(\mbox{strut})+\mbox{\texttt{inner ysep}}\]
+The default value of \index{s sep} depends on |inner_xsep|: more precisely, it equals double
+|inner_xsep|).
+\begin{forestexample}[index={baseline,for step,tree}]
+ \begin{forest} baseline,for tree=draw
+ [VP[DP][V'[V][DP]]]
+ \end{forest}
+ \pgfkeys{/pgf/inner sep=0.6666em}
+ \begin{forest} baseline,for tree=draw
+ [VP[DP][V'[V][DP]]]
+ \end{forest}
+\end{forestexample}
+Now a hairy detail: the formula for the default \index{option>l}.
+\[\index{option>l}=\index{l sep}+2\cdot\mbox{\texttt{outer ysep}}+\mbox{total
+height}(\mbox{`dj'})\]
+
+To understand what this is all about we must first explain why it is necessary to set the default
+\index{option>l} at all? Wouldn't it be enough to simply set \index{l sep} (leaving
+\index{option>l} at 0)?
+The problem is that not all letters have the same height and depth. A tree where the vertical
+position of the nodes would be controlled solely by (a constant) \index{l sep} could
+result in a ragged tree (although the height of the child--parent edges would be constant).
+\begin{forestexample}[index={baseline,for step,step>children,no edge,option>name,descendants,option>l}]
+ \begin{forest}
+ [default,baseline,for children={no edge}
+ [DP
+ [AdjP[Adj]]
+ [D'[D][NP,name=np]]]]
+ \path (current bounding box.west)|-coordinate(l)(np.base);
+ \path (current bounding box.east)|-coordinate(r)(np.base);
+ \draw[dotted] (l)--(r);
+ \end{forest}
+ \begin{forest}
+ [{l=0},baseline,for children={no edge}
+ [DP,for descendants={l=0}
+ [AdjP[Adj]]
+ [D'[D][NP,name=np]]]]
+ \path (current bounding box.west)|-coordinate(l)(np.base);
+ \path (current bounding box.east)|-coordinate(r)(np.base);
+ \draw[dotted] (l)--(r);
+ \end{forest}
+\end{forestexample}
+The vertical misalignment of Adj in the right tree is a consequence of the fact that letter j is the
+only letter with non-zero depth in the tree. Since only \index{l sep} (which is constant
+throughout the tree) controls the vertical positioning, Adj, child of Ad\emph{j}P, is pushed lower
+than the other nodes on level 2. If the content of the nodes is variable enough (various heights
+and depths), the cumulative effect can be quite strong, see the right tree of example
+(\ref{ex:misalignments}).
+
+Setting only a default \index{l sep} thus does not work well enough in general. The same
+is true for the reverse possibility, setting a default \index{option>l} (and leaving \index{l sep} at 0). In the example below, the depth of the multiline node (anchored at the top
+line) is such that the child--parent edges are just too short if the level distance is kept constant.
+Sometimes, misalignment is much preferred \dots
+\begin{forestexample}[index={align,{value of=align>center},for step,tree,l sep}]
+ \mbox{}\begin{forest}
+ [default,baseline
+ [first child[a][b][c]]
+ [{second child\\[-1ex]\scriptsize(a copy)},
+ align=center[a][b][c]]
+ ]
+ \end{forest}\quad
+ \begin{forest} for tree={l sep=0}
+ [{\texttt{l sep}=0},baseline
+ [first child[a][b][c]]
+ [{second child\\[-1ex]\scriptsize(a copy)},
+ align=center[a][b][c]]
+ ]
+ \end{forest}
+\end{forestexample}
+
+Thus, the idea is to make \index{option>l} and \index{l sep} work as a team:
+\index{option>l} prevents
+misalignments, if possible, while \index{l sep} determines the minimal vertical distance
+between levels. Each of the two options deals with a certain kind of a ``deviant'' node, i.e.\ a
+node which is too high or too deep, or a node which is not high or deep enough, so we need to
+postulate what a \emph{standard} node is, and synchronize them so that their effect on standard
+nodes is the same.
+
+By default, \foRest; sets the standard node to be a node containing letters d and j. Linguistic
+representations consist mainly of letters, and in the \TeX's default Computer Modern font, d is the
+highest letter (not character!), and j the deepest, so this decision guarantees that trees
+containing only letters will look nice. If the tree contains many parentheses, like the right
+tree of example (\ref{ex:misalignments}), the default will of course fail
+and the standard node needs to be modified. But for many applications, including nodes with
+indices, the default works.
+
+The standard node can be changed using macro \index{forestStandardNode};
+see \ref{ref:standard-node}.
+% TODO: primer? ali raje po spremembi interfaceja
+
+\subsection{Advanced option setting}
+\label{tut:advanced-option-setting}
+
+We have already seen that the value of options can be manipulated: in (\ref{ex:romannumeral}), we
+have converted numeric content from arabic into roman numerals using the \emph{wrapping} mechanism
+|content=\romannumeral#1|; in (\ref{ex:l*}), we have tripled the value of |l| by saying |l*=3|. In
+this section, we will learn more about the mechanisms for setting options and referring to their
+values.
+
+One other way to access an option value is using macro \index{forestoption}. The macro takes a
+single argument: an option name. In the
+following example, the node's child sequence number is appended to the existing content. (This is
+therefore also an example of wrapping.)
+\begin{forestexample}[label=ex:forestoption,index={option>phantom,delay,for step,descendants,content,readonly option>n,forestoption}]
+ \begin{forest}
+ [,phantom,delay={for descendants={
+ content=#1$_{~\forestoption~{n}}$}}
+ [c][o][u][n][t]]
+ \end{forest}
+\end{forestexample}
+
+However, only options of the current node can be accessed using \index{forestoption}. Possibly the simplest way to
+access option values of other nodes is to use \foRest;'s extensions to the \PGF;'s mathematical library
+|pgfmath|, documented in \citep[part VI]{tikzpgf2.10}. To see |pgfmath| in action,
+first take a look at the crazy tree on the title page, and observe how the nodes are
+rotated: the value given to option \index{rotate} is a full-fledged |pgfmath| expression
+yielding an integer
+in the range from $-30$ to $30$. Similiarly, \index{dimen+=l} adds a random float
+in the $[-5,5]$ range to the current value of \index{option>l}.
+
+Example (\ref{ex:spread-s}) demonstrated that information about
+the node, like the node's level, can be accessed within |pgfmath| expressions. All
+options are accessible in this way, i.e.\ every option has a corresponding |pgfmath| function.
+For example, we could rotate the node based on its content:
+\begin{forestexample}[index={delay,for step,tree,content}]
+ \begin{forest}
+ delay={for tree={~rotate=content~}}
+ [30[-10[5][0]][-90[180]][90[-60][90]]]
+ \end{forest}
+\end{forestexample}
+
+All numeric, dimensional and boolean options of \foRest; automatically pass the given value
+through |pgfmath|. If you need pass the value through |pgfmath|
+for a string option, use the \index{pgfmath} handler. The following example sets the node's
+content to its child sequence number (the root has child sequence number 0).
+\begin{forestexample}[index={delay,for step,tree,content,readonly option>n,pgfmath}]
+ \begin{forest}
+ delay={for tree={content/~.pgfmath~=int(n)}}
+ [[[][][]][[][]]]
+ \end{forest}
+\end{forestexample}
+
+As mentioned above, using |pgfmath| it is possible to access options of non-current nodes. This
+is achieved by providing the option function with a \index{relative node name}
+(see~\S\ref{ref:relative-node-names}) argument.\footnote{The form without
+parentheses \texttt{option\string_name} that we have been using until now to refer to an option of
+the
+current node is just a short-hand notation for \texttt{option\string_name()} --- note that in some
+contexts, like preceding \texttt{+} or \texttt{-}, the short form does not work! (The same
+seems to be true for all pgfmath functions with ``optional'' arguments.)} In the next example, we
+rotate the node based on the content of its parent (\index{short step>u} means `up').
+\begin{forestexample}[index={delay,for step,descendants,content,ss u},index>={!}]
+ \begin{forest}
+ delay={for descendants={rotate=content~("!u")~}}
+ [30[-10[5][0]][-90[180]][90[-60][90]]]
+ \end{forest}
+\end{forestexample}
+Note that the argument of the option function is surrounded by double quotation marks: this is
+to prevent evaluation of the relative node name as a |pgfmath| function --- which it is not.
+
+For further ways to access option values, see \S\ref{tut:wrapping}. Here, we continue by introducing
+\emph{relative node setting}: write \index{relative node name}|.|\meta{option}|=|\meta{value} to set
+the value of \meta{option} of the specified relative node. Important: computation of the value is
+done in the context of the original node. The following example defines style \keyname{move} which
+not only draws an arrow from the source (the current node) to the target, but also moves the content
+of the source to the target (leaving a trace). Note the difference between |#1| and |##1|: |#1| is
+the argument of the style \keyname{move} (a node walk determining the target), while |##1| is the
+original option (in this case, \indexex{option>content}) value.
+\begin{forestexample}[index={for step,tree,calign,tikz,delay,content},index>={!}]
+ \begin{forest}
+ for tree={calign=fixed edge angles},
+ move/.style={
+ tikz={\draw[->] () to[out=south west,in=south] (#1);},
+ delay={~#1.content~={##1},content=$t$}},
+ [CP[][C'[C][\dots[,phantom][VP[DP][V'[V][DP,move=!r1]]]]]]
+ \end{forest}
+\end{forestexample}
+
+\begin{forestexample}[index={if option,n children,content,for step,step>children,delay,pgfmath},index>={!},basicstyle=\scriptsize\ttfamily,layout=export]
+ \begin{forest}
+ calc/.style={if n children={0}{}{content=0,for children={calc,~!u.content~/.pgfmath=int(content("!u")+content())}}},
+ delay=calc,
+ [[[3][4][5]][[3][9]][8][[[1][2][3]]]]
+ \end{forest}
+\end{forestexample}
+
+In the following example, the content of the branching nodes is computed by \foRest;: a branching
+node is a sum of its children. The algorithm visits each node (but the root node) and adds its
+content to the content of the parent. Note that as the computation must proceed bottom-up,
+\index{for step=\index{descendants children-first}} propagator is used to walk through the
+tree.\footnote{It would be possible to emulate \index{for step=\index{descendants children-first}}
+ by defining a recursive style, as was done in this manual for versions of the package prior to
+ introduction of the bottom-up propagator. The following code produces identical result as the code
+ in the main text.
+
+ \box\codebox}
+
+\begin{forestexample}[index={if option,n children,content,for step,step>children,delay,pgfmath},index>={!}]
+ \begin{forest}
+ delay={
+ where n children={0}{}{content=0},
+ for descendants children-first={
+ ~!u.content~/.pgfmath=int(content("!u")+content())}
+ }
+ [[[3][4][5]][[3][9]][8][[[1][2][3]]]]
+ \end{forest}
+\end{forestexample}
+
+Actually, for common computations such as summing things up, \foRest; provides an easier way to do it: aggregate functions (\S\ref{ref:aggregate-functions}). Below, aggregate function \index{sum}, defined as |pgfkeys| handler, walks through the \index{step>children} (second argument) of the current node, summing up their \index{content} (first argument) and stores the result as the \index{content} of the current node (because \index{content} is the handled key).
+
+\begin{forestexample}[index={sum,aggregate postparse,for step,tree children-first,delay,n children,if option,content,step>children}]
+ \begin{forest}
+ delay={
+ aggregate postparse=int,
+ for tree children-first={
+ if n children={0}{}{
+ content/~.sum~={content}{children}
+ }
+ }
+ }
+ [[[3][4][5]][[3][9]][8][[[1][2][3]]]]
+ \end{forest}
+\end{forestexample}
+
+\subsection{Wrapping}
+\label{tut:wrapping}
+
+We have already seen examples of inserting option values into other expressions. In example
+(\ref{ex:romannumeral}), we have wrapped the value of the option being assigned to (|#1| stood for
+the current value of option \index{content}); example (\ref{ex:forestoption}) additionally wrapped
+the value of option \index{readonly option>n} (of the current node) using macro \index{forestoption}. In general,
+\foRest; offers two ways to perform computations (from simple option value lookups to
+complicated formulas) and insert their results into another expression (of any kind: \TeX\ code,
+|pgfkeys| keylist, |pgfmath| expression, etc.).
+
+Historically, the first \foRest;'s mechanism that offered wrapping of computed values were handlers
+\index{wrap pgfmath arg} and \index{wrap $n$ pgfmath args} (for $n=2,\dots,8$), which combine the
+wrapping mechanism with the |pgfmath| evaluation. The idea is to compute (most often, just access
+option values) arguments using |pgfmath| and then wrap them into the given macro body (marked below)
+using \TeX's parameters (|#1| etc.). Below, this is used to subscript the contents of a node with
+its sequential number and the number of parent's children.
+\begin{forestexample}[index={option>phantom,delay,for step,descendants,content,readonly option>n,n children,wrap $n$ pgfmath args},index>={!},label=ex:pgfmathwrap]
+ \begin{forest} [,phantom,delay={for descendants={
+ content/.wrap 3 pgfmath args=
+ ~{#1$_{#2/#3}$}~
+ {content}{n}{n_children("!u")}}}
+ [c][o][u][n][t]]
+ \end{forest}
+\end{forestexample}
+Note the underscore |__| character in |n__children|: in |pgfmath| function names, spaces,
+apostrophes and other non-alphanumeric characters from option names are all replaced by
+underscores.
+
+As another example, let's make the numerals example (\ref{ex:numerals-simple}) a bit fancier.
+The numeral type is read off the parent's content and used to construct the appropriate control
+sequence (|\@arabic|, |\@roman| and |\@alph|). (The numbers are not specified in content
+anymore: we simply read the sequence number \index{readonly option>n}.)
+\begin{forestexample}[index={delay,where option,readonly option>level,content,readonly option>n,for step,step>children,option>l,wrap $n$ pgfmath args},index>={!}]
+ \begin{forest}
+ delay={where level={2}{content/.wrap 2 pgfmath args=
+ {\csname @#1\endcsname{#2}}
+ {content("!u")}{n}}{}},
+ for children={l*=n},
+ [\LaTeX\ numerals,
+ [arabic[][][][]]
+ [roman[][][][]]
+ [alph[][][][]]
+ ]
+ \end{forest}
+\end{forestexample}
+
+Invoking |pgfmath| is fairly time consuming and using it to do nothing but retrieve an option value
+seems a bit of an overkill. To remedy the situation, argument processor
+(\S\ref{ref:argument-processor}) was introduced in \FoRest; v2.0 and considerably expanded in v2.1.
+One way to invoke it is using handler \index{handler>process}.
+
+The argument processor takes a sequence of instructions and an arbitrary number of arguments,
+transforms the given arguments according to the instructions, and feeds the resulting list of
+arguments into the handled key.
+
+An instruction is given by a single-character code. The simplest instructions are:
+\index{processor>O}, which expects its argument to be an option name (possibly preceded by a
+\index{relative node name}|.| to access the option value of a non-current node) and returns the
+value of the option; \index{processor>R}, which does the same for registers; and \index{processor>noop}, which
+leaves the argument unchanged.
+
+In the following example, we define style |test| taking four arguments and call it by providing
+the arguments via \index{handler>process}. The instruction string |ROO__| tells the argument processor that
+the first argument is the value of (scratch) register \indexex{temptoksa}, the second the value of
+option \indexex{n children} at the current node, the third the value of option \indexex{content} of
+the second child of the current node, and the fourth just a plain string. Macro |test| is thus
+actually invoked with argument list |{Hello}{3}{Jane}{Goodbye}|.
+
+\begin{forestexample}[index={handler>process,processor>noop,processor>R,processor>O,delay,content,n
+children,temptoksa}]
+ \begin{forest}
+ test/.style n args={4}{align=center,
+ content={#1!\\I have #2 children.\\One of them is #3.\\#4!}}
+ [,delay={temptoksa=Hello,
+ test/.process={~ROO_~}{temptoksa}{n children}{!2.content}{Goodbye}}
+ [John][Jane][Joe]]
+ \end{forest}
+\end{forestexample}
+
+To wrap using the argument processor, use instruction \index{processor>w}. Unless wrapping a single
+argument, this instruction should be followed by a number indicating the number of arguments
+consumed. \index{processor>w} will take the required number of arguments from the list of already
+processed arguments and wrap them in the macro body given as the next (yet unprocessed) argument.
+
+The following example has the same result as example (\ref{ex:pgfmathwrap}). Note that the
+order of the wrapper-macro body and the arguments is different for \index{handler>process} and \index{wrap
+ $n$ pgfmath args}. (Experience shows that \index{handler>process}'s order is easier on the eyes.) The
+example also illustrates that (i) the instructions need not be enclosed in braces and (ii) that
+repetition of an argument processor instruction can be indicated by appending a number to the
+instruction: thus |O3| below means the same as |OOO|.
+
+\begin{forestexample}[index={option>phantom,delay,for step,descendants,content,readonly option>n,n children},index>={!}]
+ \begin{forest} [,phantom,delay={for descendants={
+ content/.process=~O3 w3~
+ {content}{n}{!u.n children}
+ {#1$_{#2/#3}$}
+ }}
+ [c][o][u][n][t]]
+ \end{forest}
+\end{forestexample}
+
+Note that the order of the wrapper-macro body and the arguments is different for
+\index{handler>process} and \index{wrap $n$ pgfmath args}. Experience shows that
+\index{handler>process}'s order is easier on the eyes. The example also illustrates that the
+instructions need not be enclosed in braces and that repetition of an argument processor instruction
+can be indicated by appending a number to the instruction: |O3| above is equivalent to |OOO|.
+
+% \begin{forestexample}[index={process,processor>w}]
+% \begin{forest}
+% [root,delay={align=center,
+% content/.process={OO ~w2~}
+% {n children}{content}
+% {This node has #1 children.\\It's original content is ``#2''.}
+% }]
+% \end{forest}
+% \end{forestexample}
+
+\index{wrap $n$ pgfmath args} always returns a single braced expression and is thus a bit cumbersome
+to use when the handled key expects multiple arguments: the trick is to enclose the expected
+argument list in extra braces (marked in the code below). As \index{handler>process} can return multiple
+arguments, there is no need for such a workaround. See the following example for comparison of the
+two methods.
+
+\begin{forestexample}[index={for step,step>name,handler>process,processor>O,processor>w,wrap $n$ pgfmath args}]
+ \begin{forest}
+ [,phantom
+ [pgfmath[2,delay={for n/.wrap 2 pgfmath args=
+ ~{~{#1}{content=#2,draw}~}~
+ {content}{content("!u")}
+ } [x][x][x][x]]]
+ [process[3, delay={for n/.process=
+ {O Ow1}{content}
+ {!u.content}{content=#1,draw}
+ } [x][x][x][x]]]
+ ]
+ \end{forest}
+\end{forestexample}
+
+A single \index{handler>process} invocation can perform multiple wrappings. The numbering of arguments of
+each wrapping starts at |#1|. In the example below, \index{for step=\index{nodewalk}} takes two
+arguments, a nodewalk and a list of nodekeys. Each is produced by an independent wrapping (wrap bodies
+are marked in the code).
+
+\begin{forestexample}[index={handler>process,processor>R,processor>w,for step,nodewalk,+toks,content}]
+ \begin{forest}
+ declare toks register=prefix,
+ declare count register=level to prefix,
+ prefix=X-,
+ level to prefix=1,
+ delay={
+ for nodewalk/.process=Rw Rw
+ {level to prefix}{~level=#1~}
+ {prefix}{~+content=#1~}
+ }
+ [0[1[2]][3[4][5]][6[7][8][9]]]
+ \end{forest}
+\end{forestexample}
+
+
+
+
+\subsection{Externalization}
+\label{tut:externalization}
+
+\FoRest; can be quite slow, due to the slowness of both \PGF;/\TikZ; and its own computations.
+However, using \emph{externalization}, the amount of time spent in \foRest; in everyday life can
+be reduced dramatically. The idea is to typeset the trees only once, saving them in separate
+PDFs, and then, on the subsequent compilations of the document, simply include these PDFs instead
+of doing the lenghty tree-typesetting all over again.
+
+\FoRest;'s externalization mechanism is built on top of \TikZ;'s |external| library. It
+enhances it by automatically detecting the code and context changes: the tree is recompiled if and
+only if either the code in the \index{forest} environment or the context (arbitrary parameters; by
+default, the parameters of the standard node) changes.
+
+To use \foRest;'s externalization facilities, say:\footnote{When you switch on
+the externalization for a document containing many \keyname{forest} environments, the first
+compilation can take quite a while, much more than the compilation without externalization. (For
+example, more than ten minutes for the document you are reading!) Subsequent compilations,
+however, will be very fast.}\index[not print]{external}
+\begin{lstlisting}[point=external]
+ \usepackage[external]{forest}
+ ~\tikzexternalize~
+\end{lstlisting}
+
+If your \index{forest} environment contains some macro, you will probably want the externalized
+tree to be recompiled when the definition of the macro changes. To achieve this, use
+\index{forestset}|{|\index{external/depends on macro}|=|\cmdname{macro}|}|. The effect is
+local to the \TeX\ group.
+
+\TikZ;'s externalization library promises a |\label| inside the externalized graphics to work
+out-of-box, while |\ref| inside the externalized graphics should work only if the externalization
+is run manually or by |make| \citep[\S32.4.1]{tikzpgf2.10}. A bit surprisingly perhaps, the
+situation is roughly reversed in \foRest;. |\ref| inside the externalized graphics will work
+out-of-box. |\label| inside the externalized graphics will not work at all. Sorry. (The reason
+is that \foRest; prepares the node content in advance, before merging it in the whole tree, which
+is when \TikZ;'s externalization is used.)
+
+\subsection{Expansion control in the bracket parser}
+\label{tut:bracket}
+
+By default, macros in the bracket encoding of a tree are not
+expanded until nodes are being drawn --- this way, node
+specification can contain formatting instructions, as illustrated in
+section~\ref{tut:basic-usage}. However, sometimes it is useful to
+expand macros while parsing the bracket representation, for example to
+define tree templates such as the X-bar template, familiar
+to generative grammarians:\footnote{Honestly, dynamic node creation might be a better way to do
+this; see~\S\ref{ref:dynamic}.}
+\begin{forestexample}[index={bracketset,action character}]
+ ~\bracketset{action character=@}~
+ \def\XP#1#2#3{#1P[#2][#1'[#1][#3]]}
+ \begin{forest}
+ [~@~\XP T{DP}{~@~\XP V{DP}{DP}}]
+ \end{forest}
+\end{forestexample}
+In the above example, the |\XP| macro is preceded by the \emph{action character} |@|: as
+the result, the token following the action character was expanded before the parsing proceeded.
+
+The action character is not hard coded into \foRest;. Actually, there is no action character by
+default. (There's enough special characters in \foRest; already, anyway, and the situations where
+controlling the expansion is preferable to using the |pgfkeys| interface are not numerous.) It is
+defined at the top of the example by processing key \index{action character} in the
+|/bracket| path; the definition is local to the \TeX\ group.
+
+Let us continue with the description of the expansion control facilities of the bracket parser.
+The expandable token following the
+action character is expanded only once. Thus, if one defined macro
+|\VP| in terms of the general |\XP| and tried to use it in the same
+fashion as |\XP| above, he would fail. The correct way is to follow
+the action character by a braced expression: the braced expression
+is fully expanded before bracket-parsing is resumed.
+\begin{forestexample}[index={bracketset,action character}]
+ \bracketset{action character=@}
+ \def\XP#1#2#3{#1P[#2][#1'[#1][#3]]}
+ \def\VP#1#2{\XP V{#1}{#2}}
+ \begin{forest}
+ [@\XP T{DP}{~@{~\VP{DP}{DP}~}~}]
+ \end{forest}
+\end{forestexample}
+
+In some applications, the need for macro expansion might be much
+more common than the need to embed formatting instructions.
+Therefore, the bracket parser provides commands |@+| and |@-|: |@+|
+switches to full expansion mode --- all tokens are fully expanded
+before parsing them; |@-| switches back to the default mode, where
+nothing is automatically expanded.
+\begin{forestexample}[index={bracketset,action character}]
+ \bracketset{action character=@}
+ \def\XP#1#2#3{#1P[#2][#1'[#1][#3]]}
+ \def\VP#1#2{\XP V{#1}{#2}}
+ \begin{forest} ~@+~
+ [\XP T{DP}{\VP{DP}{DP}}]
+ \end{forest}
+\end{forestexample}
+
+All the action commands discussed above were dealing only with
+\TeX's macro expansion. There is one final action command, |@@|,
+which yields control to the user code and expects it to call
+|\bracketResume| to resume parsing. This is useful to e.g.\
+implement automatic node enumeration:
+\begin{forestexample}[index={bracketset,action character,option>phantom,delay,where option,readonly option>level,content}]
+ \bracketset{action character=@}
+ \newcount\xcount
+ \def\x#1{~@@~\advance\xcount1
+ \edef\xtemp{[$\noexpand\times_{\the\xcount}$[#1]]}%
+ \expandafter\bracketResume\xtemp
+ }
+ \begin{forest}
+ phantom,
+ delay={where level=1{content={\strut #1}}{}}
+ ~@+~
+ [\x{f}\x{o}\x{r}\x{e}\x{s}\x{t}]
+ \end{forest}
+\end{forestexample}
+This example is fairly complex, so let's discuss how it works. |@+| switches to the full
+expansion mode, so that macro |\x| can be easily run. The real magic hides in this macro. In
+order to be able to advance the node counter |\xcount|, the macro takes control from \foRest; by
+the |@@| command. Since we're already in control, we can use |\edef| to define the node content.
+Finally, the |\xtemp| macro containing the node specification is expanded with the resume command
+sticked in front of the expansion.
+
+
+
+\section{Reference}
+\label{sec:reference}
+
+This section documents all publicly exposed keys and macros defined by the core package. All other
+commands defined by the package (see the implementation typeset in |forest.pdf|) are considered
+internal and might change without prior notice or compatibility support.
+
+\subsection{Package loading and options}
+\label{ref:package-options}
+
+Load the package by writing |\usepackage{forest}| in the document preamble.
+
+Field-specific definitions and defaults are stored in separate libraries. Use
+|\usepackage[|\meta{library name}|]{forest}| to load library \meta{library name} and its defaults
+alongside the main package. Loading several libraries in this way is allowed: however, if you need
+more control over loading the defaults, use the following macros.
+
+\begin{syntax}
+\indexitem{macro>useforestlibrary}[|*|][|[|\meta{options}|]|]|{|\meta{library}|,...}|
+Loads the given libraries.
+
+The starred version applies their defaults as well, while the starless does not. Multiple library
+names can be given, separated by commas. Libraries can receive \meta{options}. This macro can only
+be used in the preamble.
+
+\indexitem{macro>forestapplylibrarydefaults}|{|\meta{library name},...|}|
+Loads the default settings of \meta{library}.
+
+Multiple library names can be given, separated by commas. This macro can be used either in the
+preamble or in the document body. Its effect is local to the current \TeX\ scope.
+\end{syntax}
+
+For example, the |linguistics| library defines c-command related nodewalks, changes the default
+parent--child edges to south--north (the main package default is border--border) and sets the
+baseline to the root\footnote{For details, see \S\ref{sec:library-linguistics}.} node. Thus, if you write |\usepackage[linguistics]{forest}| in your preamble,
+or use macro \cmdname{forestapplylibrarydefaults} like below, you get the following:
+
+\begin{forestexample}[tree bin=minipage,index={for step,c-commanded}]
+ package defaults:
+ \begin{forest}
+ [VP % cannot use "for c-commanded" below!
+ [DP, for sibling={for tree=red}]
+ [V'[V][DP]]
+ ]
+ \end{forest}\\[1ex]
+ |linguistics| library defaults:
+ ~\forestapplylibrarydefaults{linguistics}~
+ \begin{forest}
+ [VP
+ [DP, ~for c-commanded~={red}]
+ [V'[V][DP]]
+ ]
+ \end{forest}
+\end{forestexample}
+
+\begin{syntax}
+\indexitem(false){package option>external}|=|\alternative{true,false}
+
+ Enable/disable externalization, see \S\ref{ref:externalization}.
+
+\indexitem(most){package option>compat}|=|\meta{keylist}
+Enter compatibility mode with previous versions of the package.
+
+If at all possible, each backwards incompatible change is given a key in the |compat| path, e.g.\
+|compat=|\index{1.0-forstep} reverts to the old behaviour of spatial propagators \index{for
+ step=\meta{step}}, where a propagator could not fail.
+
+While each compatibility feature can be enabled individually, they are grouped for ease of use. To
+load compatibility features since the last version of form
+|x|[|.y|[|.z|]], write |compat=x|[|.y|[|.z|]]|-all| or
+|compat=x|[|.y|[|.z|]]|-most|. The former enables all compatibility features since that release, the
+latter only those that are guaranteed to not disrupt any new functionality of the package.
+
+To load all compatibility features since the last major release (|x| in |x.y.z|), write
+|compat=|\indexdef{value of=compat>all}; to load most of them, write |compat=|\indexdef{value of=compat>most} or simply |compat|.
+
+To enable multiple compatibility features, either use this option multiple times, or provide it with
+a comma-separated list of compatibility features. (Surround the list by braces.)
+
+Specifying this option also defines macro \indexdef{macro>forestcompat} (taking the same arguments
+as the package option) which can be used to enable compatibility features locally, within the
+document body. To enable compatibility mode but not enable any specific compatibility feature for
+the entire document, write |compat=|\indexdef{value of=compat>none} as a package option.
+
+For a list of compatibility features, see \S\ref{sec:changelog}.
+
+By default, the package warns when a compatibility feature is used. Disable this behaviour by
+|compat=|\indexdef{value of=compat>silent}.
+
+\indexitem(true){package option>tikzcshack}|=|\alternative{true,false}
+
+ Enable/disable the hack into \TikZ;'s implicit coordinate syntax, see
+ \S\ref{ref:relative-node-names}.
+
+\indexitem(true){package option>tikzinstallkeys}|=|\alternative{true,false}
+
+ Install certain keys into the \keyname{/tikz} path. Currently: \index{fit to}.
+
+\indexitem{package option>debug}|=|\meta{debug category}[, \meta{debug category}]*
+
+Prints out some debugging info to the log file. When given no argument, prints out all the
+available information, otherwise only the information on the listed (comma-separated) debug categories. The available categories are listed below.
+
+\begin{syntax}
+ \indexitem{value of=debug>nodewalks}
+ \indexitem{value of=debug>dynamics}
+ \indexitem{value of=debug>process}
+\end{syntax}
+
+\end{syntax}
+
+\subsection{Invocation}
+\label{sec:invocation}
+
+\begin{syntax}
+ %%% begin listing region: forest_environment_doc
+\indexitem{environment>forest={[\texttt{(}\meta{config}\texttt{)}]\meta{tree}}}
+ %%% end listing region: forest_environment_doc
+\indexitem{macro>Forest}[*][|(|\meta{config}|)|]\marg{tree}
+
+ The environment and the starless version of the macro introduce a group; the starred macro does
+ not, so the created nodes can be used afterwards, like in the example below. (Note that this will
+ leave a lot of temporary macros lying around. This shouldn't be a problem, however, since all of
+ them reside in the |\forest| ``namespace''.)
+
+{\tikzexternaldisable
+\begin{forestexample}
+ We create a
+ ~\Forest*~{
+ [DP,name=DP,baseline
+ [D]
+ [NP]
+ ]
+ }
+ and merge it into a
+ ~\Forest*~{
+ [VP,baseline
+ [V]
+ [,replace by=DP
+ ]
+ ]
+ }
+\end{forestexample}}
+
+\meta{config} is a keylist that configures the behaviour of the environment/macro. The
+configuration is the first operation that the environment/macro does; it precedes even the reading
+of the tree specification. Currently, \meta{config} accepts only one key:
+ \begin{syntax}
+ \indexitem{option of=forest>stages}|=|\meta{keylist}
+
+ By default, after reading the tree specification, \foRest; executes style \index{style>stages}.
+ If key |stages| is used in \meta{config}, \meta{keylist} is executed instead.
+ \end{syntax}
+
+\indexitem{macro>forestset}\marg{keylist}
+
+ Execute \meta{keylist} (of node keys) with the default path set to \keyname{/forest}.
+ \begin{advise}
+ \item This macro is usually used to define \foRest; styles.
+ \item Usually, no current node is set when this macro is called. Thus, executing most node keys
+ in this place will fail. However, if you have some nodes lying around, you can use
+ propagator \index{for step=\index{option>name}}|=|\meta{node name} to set the node with the given name as
+ current.
+ \end{advise}
+\end{syntax}
+
+
+\subsection{The bracket representation}
+\label{ref:bracket}
+
+A bracket representation of a tree is a token list with the following syntax:
+\begin{eqnarray*}
+ \meta{tree}&=&\left[\meta{preamble}\right]\meta{node}\\
+ \meta{node}&=&\texttt{[}\left[\meta{content}\right]\left[\texttt{,}\meta{keylist}\right]
+ \left[\meta{children}\right]\texttt{]}\meta{afterthought}\\
+ \meta{preamble}&=&\meta{keylist}\\
+ \meta{keylist}&=&\meta{key--value}\left[,\meta{keylist}\right]\\
+ \meta{key--value}&=&\meta{key}\OR\meta{key}\texttt{=}\meta{value}\\
+ \meta{children}&=&\meta{node}\left[\meta{children}\right]
+\end{eqnarray*}
+
+The \meta{preamble} keylist is stored into keylist register \index{preamble}. The \meta{keylist} of
+a \meta{node} is stored into keylist option \index{given options}. \meta{content} and
+\meta{afterthought} are normally stored by prepending and appending
+\index{content}|'=|\meta{content} and \index{afterthought}|=|\meta{afterthought} to \index{given
+ options}, respectively; this is customizable via \index{content to} and redefining style
+\index{afterthought}.
+
+Normally, the tokens in the bracket representation are not expanded while the input is parsed.
+However, it is possible to control expansion. Expansion control sequences of \foRest;'s bracket
+parser are shown below. Note that by default, there is no \index{action character}.
+\begin{center}
+ \begin{tabular}{ll}
+ \rstyle\meta{action character}\texttt{-}&no-expansion mode (default): nothing is expanded\\
+ \rstyle\meta{action character}\texttt{+}&expansion mode: everything is fully expanded\\
+ \rstyle\meta{action character}\texttt{}\meta{token}&expand \meta{token}\\
+ \rstyle\meta{action character}\texttt{}\meta{\TeX-group}&fully expand \meta{\TeX-group}\\
+ \rstyle\meta{action character}\meta{action character}&yield control;\\&upon finishing its job,
+ user's code should call \indexdef{macro>bracketResume}
+ \end{tabular}
+\end{center}
+
+To customize the bracket parser, call
+\indexdef{macro>bracketset}\meta{keylist}, where the keys can be the following.
+\begin{syntax}
+\indexitem({{[%]
+ }}){bracket key>opening bracket}|=|\meta{character}
+\indexitem({{{{%[
+ ]}}}}){bracket key>closing bracket}|=|\meta{character}
+\indexitem(none){bracket key>action character}|=|\meta{character}
+\end{syntax}
+
+\begin{advise}
+\item Careful when setting the \index{opening bracket} to |(|, %)
+ as an initial |(| %)
+ is understood as the delimiter of the optional \meta{config} argument of the
+ \index{environment>forest} environment or \index{macro>Forest} macro. The workaround is to either
+ provide an empty \meta{config} argument |()|, or put some whitespace (e.g.\ a newline) before the
+ tree specification.
+\end{advise}
+
+By redefining the following two keys, the bracket parser can be used outside \foRest;.
+\begin{syntax}
+\indexitem{bracket key>new node}|=|\meta{preamble}\meta{node specification}\meta{csname}.
+ Required semantics: create a new node given the preamble (in the case of a new
+ root node) and the node specification and store the new node's id into \meta{csname}.
+\indexitem{bracket key>set afterthought}|=|\meta{afterthought}\meta{node id}.
+ Required semantics: store the afterthought in the node with given id.
+\end{syntax}
+
+\subsection{The workflow}
+\label{sec:workflow}
+
+\subsubsection{Stages}
+\label{ref:stages}
+
+\FoRest; does its job in several stages. The default course of events is the following:
+\begin{enumerate}
+\item\label{step:parsing-bracket} The bracket representation of the tree (\S\ref{ref:bracket}) is
+ parsed and stored in a data structure.
+\item\label{step:given-options} The keys given in the bracket representation are processed. In
+ detail, \index{default preamble} is processed first, then the given \index{preamble} (both in the
+ context of the (formal) root node) and finally the keylists given to individual nodes. The latter
+ are processed recursively, in a depth-first, parent-first fashion.
+\item\label{step:typeset-nodes} Each node is typeset in its own |tikzpicture| environment, saved
+ in a box and its measures are taken.
+\item\label{step:pack} The nodes of the tree are \emph{packed}, i.e.\ the relative positions of the nodes are
+ computed so that the nodes don't overlap. That's difficult. The result: option \index{option>s} is
+ set for all nodes. (Sometimes, the value of \index{option>l} is adjusted as well.)
+\item\label{step:compute-xy} Absolute positions, or rather, positions of the nodes relative to the
+ root node are computed. That's easy. The result: options \index{option>x} and \index{y} are
+ set.
+\item\label{step:draw-tree} The \TikZ; code that will draw the tree is produced and executed. (The nodes are
+ drawn by using the boxes typeset in step~\ref{step:typeset-nodes}.)
+\end{enumerate}
+
+Stage~\ref{step:parsing-bracket} collects user input and is thus ``fixed''. However, the other
+stages, which do the actual work, are under user's control.
+
+First, hooks exist between the individual stages which make it possible (and easy) to change the
+properties of the tree between the processing stages. For a simple example, see
+example~(\ref{ex:adjustxy}): the manual adjustment of \index{y} can only be done after the absolute
+positions have been computed, so the processing of this option is deferred by \index{before drawing
+ tree}. For a more realistic example, see the definition of style \index{GP1}: before packing,
+\texttt{outer xsep} is set to a high (user determined) value to keep the $\times$s uniformly spaced;
+before drawing the tree, the \texttt{outer xsep} is set to \texttt{0pt} to make the arrows look
+better.
+
+Second, the execution of the processing stages \ref{step:given-options}--\ref{step:draw-tree} is
+\emph{completely} under user's control. To facilitate adjusting the processing flow, the approach
+is twofold. The outer level: \foRest; initiates the processing by executing style \index{style>stages},
+which by default executes the processing stages \ref{step:given-options}--\ref{step:draw-tree},
+preceding the execution of each but the first stage by processing the keys embedded in temporal
+propagators \keyname{before ...} (see \S\ref{ref:temporal-propagators}). The inner level: each
+processing step is the sole resident of a stage-style, which makes it easy to adjust the workings of
+a single step. What follows is the default content of style \keyname{stages}, including the default
+content of the individual stage-styles. Both nicely readable and ready to copy-paste versions are given.
+\begin{syntax}
+ \indexitem{style>stages}
+ \begin{syntax}
+ \item \index{for step=\index{root'}}|={|
+ \item | |\index{process keylist register}|=|\index{default preamble}|,|
+ \item | |\index{process keylist register}|=|\index{preamble}
+ \item |}|
+ \item \index{process keylist}|=|\index{given options}
+ \item \index{process keylist}|=|\index{before typesetting nodes}
+ \indexitem{style>typeset nodes stage}\hfill
+ |{|\index{for step=\index{root'}}|=|\index{typeset nodes}|}|
+ \item \index{process keylist}|=|\index{before packing}
+ \indexitem{style>pack stage}\hfill
+ |{|\index{for step=\index{root'}}|=|\index{pack}|}|
+ \item \index{process keylist}|=|\index{before computing xy}
+ \indexitem{style>compute xy stage}\hfill
+ |{|\index{for step=\index{root'}}|=|\index{compute xy}|}|
+ \item \index{process keylist}|=|\index{before drawing tree}
+ \indexitem{style>draw tree stage}\hfill
+ |{|\index{for step=\index{root'}}|=|\index{draw tree}|}|
+ \end{syntax}
+\end{syntax}
+\lstinputregion{forest.dtx}{stages}
+
+Both style \keyname{stages} and the individual stage-styles may be freely modified by the user.
+Obviously, as a style must be redefined before it is processed, |stages| should be redefined (using
+macro \index{forestset}) outside the \index{forest} environment; alternatively, stages can be given
+as the (parenthesized) optional argument of the environment (see~\S\ref{sec:invocation}). A stage
+style can also be redefined in the preamble or in any of the keylists processed prior to entering
+that stage.
+
+Here's the list of keys used either in the default processing or useful in an alternative
+processing flow.
+\begin{syntax}
+ \indexitem{stage>typeset nodes}
+ \itemnosep
+ \indexitem{stage>typeset nodes'}
+
+ Typesets each node of the current node's subtree in its own |tikzpicture| environment. The result
+ is saved in a box (which is used later, in the \index{draw tree stage}) and its measures are
+ taken.
+
+ In the |typeset_nodes'| variant, the node box's content is not overwritten if the box already
+ exists.
+
+ The order in which the nodes are typeset is controlled by nodewalk style \indexdef{nodewalk
+ style>typeset nodes processing order} or, if this style is not defined, by \index{processing
+ order}.
+
+\indexitem{node key>typeset node} Typesets the \emph{current} node, saving the result in the node box.
+
+ This key can be useful also in the default \index{style>stages}. If, for example, the node's content
+ is changed and the node retypeset just before drawing the tree, the node will be positioned as if
+ it contained the ``old'' content, but have the new content: this is how the constant distance
+ between $\times$s is implemented in the \index{GP1} style.
+
+\indexitem{stage>pack} The nodes of the tree are \emph{packed}, i.e.\ the relative positions of
+ the nodes are computed so that the nodes don't overlap. The result: option \index{option>s} is set
+ for all nodes; sometimes (in tier alignment and for some values of \index{calign}), the value
+ of some nodes' \index{option>l} is adjusted as well.
+
+\indexitem{node key>pack'} ``Non-recursive'' packing: packs the children of the current node only.
+ (Experimental, use with care, especially when combining with tier alignment.)
+
+\indexitem{stage>compute xy} Computes the positions of the nodes in the subtree relative to the
+ current node. The results are stored into options \index{option>x} and \index{y}. The current node's
+ \index{option>x} and \index{y} remain unchanged.
+
+\indexitem{stage>draw tree}
+\itemnosep
+\indexitem{stage>draw tree'}
+ Produces and executes the \TikZ; code that draws the (sub)tree rooted in the current node.
+
+ The procedure uses the node boxes typeset by \index{typeset nodes} or friends. The |'| variant
+ includes the node boxes in the picture using \cmdname{copy}, not \cmdname{box}, thereby preserving
+ them.
+
+ For details and customization, see \S\ref{sec:draw-tree}.
+
+\indexitem{node key>draw tree box}|=|[\meta{\TeX\ box}] The picture drawn by the subsequent
+ invocations of \index{draw tree} and \index{draw tree'} is put into \meta{\TeX\ box}. If
+ the argument is omitted, the subsequent pictures are typeset normally (the default).
+
+ \indexitem{node key>process keylist}|=|\meta{keylist option}
+ For each node in the entire tree, the keylist saved in \meta{keylist option} of the node is
+ processed (in the context of that node).
+
+ Note that this key is not sensitive to the current node: it processes the keylists for the whole
+ tree. Actually, it is possible to control which nodes are visited: \index{keylist option
+ processing order=\meta{keylist option}} is walked if it is defined, otherwise \index{processing
+ order}. In both cases, the processing nodewalk starts at the formal root of the tree (see
+ \index{root'} and \index{set root}), which is reevaluated at the beginning of each internal cycle
+ (see below). By default, \index{keylist option processing order=\meta{keylist option}} is indeed
+ undefined, while the \index{processing order} defauls to \index{tree}, which means that \emph{all
+ the nodes in the entire tree} are processed.
+
+ Keylist-processing proceeds in cycles. In a given cycle, the value of option \meta{keylist option
+ name} is processed for every node visited by the processing nodewalk. During a cycle, keys may
+ be \emph{delayed} using key \index{delay}. Keys delayed in a cycle are processed in the next
+ cycle. The number of cycles in unlimited.
+
+ Dynamic creation of nodes happens between the cycles. The options given to the dynamically
+ created nodes are implicitely delayed and thus processed at the end of the next cycle.
+
+ This key is primarily intended for use within \index{style>stages}.
+ The calls of this key should \emph{not} be nested, and it should not be embedded under
+ \index{process keylist'} or \index{process keylist register}.
+
+ When changing the processing nodewalk, note that delayed keys will be executed only for nodes
+ visited by the processing nodewalk. Delayed spatially propagated keys will be remembered,
+ though, and executed when the given keylist is processed for the target node. Using spatial
+ propagators without delaying cannot result in a non-processed key.
+
+\indexitem{node key>process keylist'}|=|\meta{keylist option}\meta{nodewalk}
+
+ This key is a variant of \index{process keylist}. The differences are as follows.
+
+ The processing nodewalk is given explicitely (by \meta{nodewalk}) and starts at the current node
+ (in each internal cycle).
+
+ There is no dynamic creation of nodes between the delay cycles. Any dynamic node
+ instructions will be remembered and executed after the next cycle of \index{process keylist}, or
+ an explicit call to \index{do dynamics}.
+
+ It is safe to embed this key within \index{process keylist} and (all) friends.
+
+\indexitem{node key>process keylist''}|=|\meta{keylist option}\meta{nodewalk}
+
+This key is a variant of \index{process keylist} which executes neither dynamic node operations nor
+delayed keys (there are thus no internal cycles). Any delayed keys will not be processed
+during the execution of this key. They will be remembered and executed at the end of the next cycle
+of \index{process keylist} or \index{process keylist'}.
+
+As for \index{process keylist'}, the processing nodewalk is given explicitely (by \meta{nodewalk})
+and starts at the current node.
+
+It is safe to embed this key within \index{process keylist} and (all) friends.
+
+\indexitem{node key>process keylist register}|=|\meta{register}
+
+ Process the keylist saved in \meta{register} in the context of the current node.
+
+ Any delayed keys will not be processed during the execution of this key. They will be
+ remembered and executed at the end of the next cycle of \index{process keylist} or
+ \index{process keylist'}.
+
+ It is safe to embed this key within \index{process keylist} or \index{process keylist'}.
+
+\indexitem{node key>process delayed}|=|\meta{nodewalk} Process delayed keys.
+
+ Keylist \index{delay} cannot be processed using \index{process keylist} or \index{process
+ keylist'}. Thus this key.
+
+ Like \index{process keylist} or \index{process keylist'}, this key uses internal cycles. Thus,
+ any embedded \index{delay}s will be processed.
+
+ There is no dynamic creation of nodes between the delay cycles. Any dynamic node instructions will
+ be remembered and executed after the next cycle of \index{process keylist} or \index{process
+ keylist'}, or an explicit call to \index{do dynamics}.
+
+ This key is safe to use within \index{process keylist}, \index{process keylist'} and
+ \index{process keylist register}.
+
+\indexitem(tree){nodewalk style>processing order}|/.nodewalk style=|\meta{nodewalk}
+
+Redefine this style to change the default order in which \index{process keylist} processes a keylist
+option. For example, to process the nodes in a child-first fashion, write
+\begin{lstlisting}
+ processing order/.nodewalk style=tree children first
+\end{lstlisting}
+Note that this is a \emph{nodewalk} style, so it must be defined either using |.style| handler
+during a nodewalk or using \index{nodewalk style}.
+
+\indexitem(processing order)[form={processing order}]{word suffix=keylist option>nodewalk style>processing order=\meta{keylist option}}|/.nodewalk style=|\meta{nodewalk}
+
+Redefine this style to change the \index{process keylist} processing order for a specific
+\meta{keylist option}. For example, to process \index{before drawing tree} options in the
+child-first fashion, leaving the processing of other |before ...| keylists untouched, write
+\begin{lstlisting}
+ before drawing tree processing order/.nodewalk style=tree children first
+\end{lstlisting}
+
+\indexitem{node key>do dynamics} Experimental. Perform pending dynamic tree operations.
+
+ Do not use this key within \index{process keylist} or \index{process keylist'}.
+
+\end{syntax}
+
+\subsubsection{Temporal propagators}
+\label{ref:temporal-propagators}
+
+Temporal propagators delay processing of given keys until some other point in the processing of the
+tree. There are three kinds of temporal propagators. Most of the propagators have the form
+|before_...| and defer the processing of the given keys to a hook just before some stage in the
+workflow (\S\ref{ref:stages}). \index{before packing node} and \index{after packing node} are
+special as they fire \emph{during} the packing stage. The \index{delay} propagator is
+``internal'' to the current hook: the keys in the hook are processed cyclically, and \keyname{delay}
+delays the processing of the given keys until the next cycle.
+
+Formally, temporal propagators are keylist options (except \index{delay n}, which is a style), so
+augmented assignments are possible (\S\ref{sec:option-setting}).
+
+All temporal propagators can be nested without limit.
+
+\begin{advise}
+\item A note on typos.
+
+ By default, all keys unknown to \foRest; are appended to keylist option \index{node options} The
+ value of \index{node options} is fed to \TikZ; when typesetting a node, so any typos are caught by
+ \TikZ;. However, as nodes are normally typeset in stage \index{typeset nodes stage}, any typos in
+ keys temporally propagated past that stage will not be noticed, simply because noone will use the
+ value of \index{node options} where they end up (the exception being nodes which are explicitely
+ retypeset by the user using \index{typeset node}).
+
+ To sum up, typos in any keys temporally propagated by \index{before packing}, \index{before
+ packing node}, \index{after packing node}, \index{before computing xy} and \index{before drawing
+ tree} will be silently ignored. This is probably not what you want, so double-check everything
+ you write there.
+
+ Using \index{unknown to}|=|\index{unknown key error}, it is possible to change the default
+ behaviour. You will catch all typos if you append the command to \index{pack stage}, as shown
+ below. This can be done either in the tree or by \index{forestset}.
+
+\begin{lstlisting}
+ typeset nodes stage/.append style={unknown to=unknown key error}
+\end{lstlisting}
+
+ Of course, this makes it impossible to write simply
+ |before_drawing_tree={inner_sep=5pt,_typeset_node}|. Any |tikz|'s options must be given
+ explicitely via \index{node options}:
+ |before_drawing_tree={node_options={inner_sep=5pt},_typeset_node}|.
+\end{advise}
+
+\begin{syntax}
+\indexitem{propagator>delay}|=|\meta{keylist} Defers the processing of the \meta{keylist} until the next
+ cycle.
+
+ Internally, |delay| is a keylist option, so augmented operators of the \index{keylist} type can be
+ used.
+
+ To check whether any keys were delayed, use conditional \index{if have delayed}.
+\indexitem{propagator>delay n}|=|\meta{integer}\meta{keylist} Defers the processing of the
+ \meta{keylist} for $n$ cycles. $n$ may be $0$, and it may be given as a |pgfmath| expression.
+
+\indexitem{propagator>given options}
+
+ When \index{style>stages} processing starts, this list holds the keys given by the user in the
+ bracket representation.
+
+\indexitem{propagator>before typesetting nodes}|=|\meta{keylist} Defers the processing of the
+ \meta{keylist} to until just before the nodes are typeset.
+
+\indexitem{propagator>before packing}|=|\meta{keylist}
+
+\indexitem{propagator>before packing node}|=|\meta{keylist}
+
+ Defers the processing of the \meta{keylist} given to the node to until just before/after the
+ subtree of \emph{this specific node} is packed. Even before packing node, the (subtrees of the)
+ children of the node have already been packed.\footnote{\FoRest; employs two variants of the
+ packing algorithm: the faster one is used for (parts of) trees with uniform growth, i.e.\
+ subtrees where \index{grow} does not change; the slower, generic variant is used in where this
+ is not the case. Now, the fast method works by dealing with l and s dimension separately, and
+ it is able to do this for the entire (sub)tree, without needing to invoke the packing method for
+ its constituents. The consequence is that there is no place where \index{before packing node}
+ could be called meaningfully, as the node's constituents are not packed individually, ``just
+ before packing the current node'' is the same as ``just before packing the tree'', and for many
+ nodes packing is not called anyway in the fast method. As the rationale behind \index{before
+ packing node} is to be able to adjust the options of the subtree based on the information
+ gained by packing its constituents, specifying \index{before packing node} automatically
+ switches to the generic method.} \indexitem{propagator>after packing node}|=|\meta{keylist} Defers
+ the processing of the \meta{keylist} given to the node to until just after \emph{this specific
+ node} is packed.
+
+\begin{forestexample}[index={after packing node,no edge,calign,value of=calign>first,option>l,l sep,content format,content,if option,n children,pgfmath,option>s,max x,min x,for step,step>children,wrap pgfmath arg,typeset node,dimen+=s}]
+ \forestset{box/.style={
+ draw, no edge, l=0, l sep=1.5ex,
+ calign=first, anchor=base west,
+ content format={\strut\forestoption{content}},
+ if n children=0{}{
+ ~after packing node~={
+ minimum width/.pgfmath=
+ {s("!l")+max_x("!l")-s("!1")-min_x("!1")},
+ for children/.wrap pgfmath arg={s+={##1}}{0},
+ typeset node}}}}
+ \begin{forest} for tree={box} [/
+ [home[saso[Download][TeX]][alja][joe]]
+ [usr[bin][share]]]
+ \end{forest}
+\end{forestexample}
+
+ \begin{advise}
+ \item Remember to typeset or pack the node using \index{pack'} if you have changed options
+ influencing the typesetting or packing process.
+ \end{advise}
+
+\indexitem{propagator>before computing xy}|=|\meta{keylist} Defers the processing of the
+ \meta{keylist} to until just before the absolute positions of the nodes are computed.
+\indexitem{propagator>before drawing tree}|=|\meta{keylist} Defers the processing of the
+ \meta{keylist} to until just before the tree is drawn.
+\end{syntax}
+
+
+\subsubsection{Drawing the tree}
+\label{sec:draw-tree}
+
+This section provides a detailed description of how \index{draw tree} and friends draw the tree.
+
+First, here's the default course of events. \index{draw tree} is called from style \index{draw tree
+ stage} in the context of the formal root node. It does not draw the tree directly, but rather
+produces \TikZ; code that actually does the drawing. The tree-drawing instructions are enclosed in
+a |tikzpicture| environment and come in three parts: the (non-phantom) nodes are drawn first,
+followed by edges between the drawn nodes and finally the custom \TikZ; code (of all, including
+phantom nodes). Each of those is drawn for the entire (sub)tree of the current node, in recursive,
+depth-first parent-first first-child-first order.
+
+Most parts of the tree drawing procedure are customizable. Zooming in from the invocation of
+\index{draw tree} to the keys that produce the drawing code, the customization options are as
+follows.
+
+There are two ways the invocation of \index{draw tree} can differ from the default. First,
+\index{draw tree} can be called within the context of any node. As a first approximation, that node
+will become the root of the tree that is being drawn; for the whole truth, see \index{draw tree
+ method}. Second, \index{draw tree} can be called not only at \index{draw tree stage}, but any
+time after the nodes to be drawn have been typeset (see \index{typeset nodes stage}) and their
+absolute coordinates (\index{option>x} and \index{option>y}) computed (see \index{compute xy stage}).
+
+
+\begin{syntax}
+\indexitem(\begin{tikzpicture}){node key>begin draw}|/.code=|\meta{toks: \TeX\ code} \vspace{-\parskip}
+\indexitem(\end{tikzpicture}){node key>end draw}|/.code=|\meta{toks: \TeX\ code}
+
+The code produced by \index{draw tree} is put in the environment specified by \keyname{begin
+draw} and \keyname{end draw}. Thus, it is this environment, normally a |tikzpicture|, that does
+the actual drawing.
+
+A common use of these keys might be to enclose the |tikzpicture| environment in a |center|
+environment, thereby automatically centering all trees; or, to provide the \TikZ; code to execute
+at the beginning and/or end of the picture.
+
+Note that \keyname{begin draw} and \keyname{end draw} are \emph{not} node options: they are
+|\pgfkeys|' code-storing keys \citep[\S55.4.3--4]{tikzpgf2.10}.
+
+\end{syntax}
+
+Repeating from (\S\ref{ref:stages}), there are two variants of \index{draw tree}, which differ in
+how they use the node boxes created by \index{typeset nodes}: \index{draw tree} includes them using
+\cmdname{box}, so they are gone; \index{draw tree'} uses \cmdname{copy}, so they are preserved.
+Next, setting \index{draw tree box} will cause the tree to be drawn in the given \TeX\ box.
+
+
+\begin{syntax}
+
+ \indexitem{style>draw tree method}
+
+ This is the heart of the tree-drawing procedure: it determines which parts of the tree are drawn
+ and in what order. What this style does by default was already described above, but is actually
+ best seen from the definition itself:
+
+\lstinputregion{forest.dtx}{draw_tree_method}
+
+This style may be modified by the user, but it is and should be invoked only within \index{draw
+ tree}, by the package: \emph{do not execute this style directly!}
+
+The nodewalks occurring in the default definition of this style are, with the exception of
+\index{processing order}, not used anywhere else in the package.
+
+ \indexitem{nodewalk style>draw tree nodes processing order}
+ \itemnosep
+ \indexitem{nodewalk style>draw tree edges processing order}
+ \itemnosep
+ \indexitem{nodewalk style>draw tree tikz processing order}
+
+ For each of these nodewalk styles the following holds. If it is defined, it determines which nodes
+ / edges / pieces of \index{tikz} code are drawn and in which order. If any of these styles is not
+ defined, its function is taken over by \index{draw tree processing order}. By default, none of
+ them are defined.
+
+ \indexitem{nodewalk style>draw tree processing order}
+
+ If this nodewalk is defined, it functions as a fallback for node-, edge- and tikz-code-specific
+ nodewalks. If it is not defined (the default situation), it has its own fallback:
+ \index{processing order} (which defaults to \index{tree}).
+
+\indexitem{node key>draw tree node}
+\itemnosep
+\indexitem{node key>draw tree node'}
+
+Draws the current node at location specified by \index{option>x} and \index{option>y}. The |'|
+variant draws the node even if it's \index{phantom}.
+
+These keys should only be used only within the definition of \index{draw tree method}.
+
+\indexitem{conditional>if node drawn}|=|\meta{nodewalk}\meta{true keylist}\meta{false keylist}
+
+Execute \meta{true keylist} if the node at the end of \meta{nodewalk} was already drawn in the
+current invocation of \index{draw tree}; otherwise, execute \meta{false keylist}.
+
+
+\indexitem{node key>draw tree edge}
+\itemnosep
+\indexitem{node key>draw tree edge'}
+
+Draws the edge from the current node to its parent, using the information in \index{edge path} and
+\index{edge}.
+
+The variant without |'| variant tries to be smart: it draws the edge only if both the current node
+and its parent have been drawn in the current invocation of \index{draw tree}. (This prevents
+drawing the edge from the root node and edges from or to phantom nodes.) The |'| variant is dumb.
+
+These keys should only be used only within the definition of \index{draw tree method}.
+
+\indexitem(draw tree tikz'){style>draw tree tikz}
+\itemnosep
+\indexitem{node key>draw tree tikz'}
+
+Executes the custom code stored in option \index{tikz} of the current node.
+
+By default, both keys execute the code without performing any checks. Specifically, \index{tikz}
+code of phantom nodes is executed. To change this behaviour easily, the user can redefine
+\index{draw tree tikz}, which is a style; probably, the definition will employ \index{draw tree
+ tikz'}. For example, to execute \index{tikz} code only if the node is not \index{phantom}, write
+
+\begin{lstlisting}
+ draw tree tikz/.style={if phantom={draw tree tikz'}{}}
+\end{lstlisting}
+
+These keys should only be used only within the definition of \index{draw tree method}.
+
+\end{syntax}
+
+
+
+\subsection{Node keys}
+\label{ref:node-keys}
+
+\FoRest; is mostly controlled using \PGF;'s key management utility |pgfkeys|
+\citep[\S55]{tikzpgf2.10}. Most of the keys can be given next to the content in the bracket
+representation of a tree (\S\ref{ref:bracket}): we call these \emph{node keys}. Some keys,
+notably \emph{nodewalk steps} (\S\ref{ref:nodewalks}), must be used as arguments of specific
+commands.
+
+Most node keys perform some operation on the \emph{current node}. When the keylist given after the
+content of a node is processed, the current node is set to that node. However, the current node can
+be temporarily changed, for example by spatial propagators (\S\ref{ref:spatial-propagators}) or,
+more genarally, nodewalks (\S\ref{ref:nodewalks}).
+
+The most common function that node keys perform is to set or modify an \emph{option} of the current
+node (\S\ref{sec:options-and-registers}), usually to determine the appearance or position of the
+node and its edge (\S\ref{sec:formatting-tree}), but there are also several kinds of more exotic
+keys like spatial (\S\ref{ref:spatial-propagators}) propagators, which temporarily change the
+current node, temporal (\S\ref{ref:temporal-propagators}) propagators, which delay the processing of
+the keylist until some other stage in the workflow, keys that dynamically create and move nodes
+(\S\ref{ref:dynamic}), keys that control the way \foRest; processes the tree (\S\ref{ref:stages})
+etc. Finally, users can also define their own keys, either by defining |pgfkeys| styles\footnote{%
+ Styles are a feature of the \keyname{pgfkeys} package. They are named keylists, whose usage
+ ranges from mere abbreviations through templates to devices implementing recursion. To define a
+ style, use \PGF;'s handler \keyname{.style} \citep[\S55.4.4]{tikzpgf2.10}: \meta{style
+ name}\keyname{/.style=}\meta{keylist}.} \citep[\S55.4.4]{tikzpgf2.10} or using \foRest;'s option
+declaration mechanism (\S\ref{sec:option-declaring}).
+
+\begin{advise}
+\item The style definitions and option declarations given among the other keys in the bracket
+ specification are local to the current tree (but note that \foRest;'s keylist processing,
+ including temporal and spatial propagation, introduces no groups). To define globally accessible
+ styles and options (well, they are always local to the current \TeX\ group), use
+ macro \cmdname{forestset} outside the \index{forest} environment, e.g.\ in the preamble of the
+ document. (Although \index{forestset}\meta{keylist} is currently equivalent to
+ \cmdname{pgfkeys}\texttt{\{/forest,}\meta{keylist}\texttt{\}}, don't rely on this as it will
+ change in some (near) future version of the package, as there is a plan to introduce namespaces
+ \dots)
+\end{advise}
+
+By default, unknown keys are assumed to be \TikZ; keys and are forwarded to \index{node options}.
+This behaviour can be changed using \index{unknown to}.
+
+The following subsections list the node keys which are not described elsewhere (see above): spatial
+propagators (\S\ref{ref:spatial-propagators}) and general-purpose node keys, i.e.\ those which don't
+deal with tree formatting (\S\ref{sec:node-keys-various}).
+
+
+\subsubsection{Spatial propagators}
+\label{ref:spatial-propagators}
+
+Spatial propagators pass the given \meta{keylist} to other node(s) in the tree.
+
+Spatial propagation does not change the current node: after visiting the nodes the keys are
+propagated to, a spatial propagator (silently, using a so-called fake step) returns to the origin of
+the embedded nodewalk.
+
+\FoRest; provides many spatial propagators. Almost all of them are built from long-form nodewalk
+steps using prefix \index{for step}. This is why the list below is so short: it only documents this
+prefix and the exceptions. For the list of nodewalk steps, see \S\ref{ref:nodewalks}, in particular
+\S\ref{ref:single-step-keys} for single-step keys and \S\ref{ref:multi-step-keys} for multi-step
+keys.
+
+
+\begin{syntax}
+\indexitem{word prefix=step>propagator>for=\meta{step}}|=|\meta{arg$_1$}|...|\meta{arg$_n$}\meta{keylist: every-step}
+\itemnosep
+\indexitem[not short]{word prefix=step>propagator>for=\index{nodewalk}}|=|\meta{nodewalk}\meta{keylist: every-step}
+\itemnosep
+\indexitem[not short]{word prefix=step>propagator>for=\index{nodewalk key>Nodewalk}}|=|\meta{keylist: config}\meta{nodewalk}\meta{keylist: every-step}
+
+ Walks the (single- or multi-step) \meta{step} from the current node and executes the given
+ \meta{keylist} at every visited node. The current node remains unchanged.
+
+ \meta{step} must be a long-form nodewalk step. If it has any arguments, they
+ (\meta{arg$_1$}|...|\meta{arg$_n$}) should be given before every-step \meta{keylist}, with two
+ exceptions: embedded nodewalk steps (\index{step>Nodewalk} and \index{nodewalk}) already require
+ the \meta{keylist: every-step} argument, so it should be omitted, as it makes no sense to provide
+ the every-step keylist twice.
+
+ Examples:
+ \begin{itemize}
+ \item |for_parent={l_sep+=3mm}|
+ \item |for_n=2{circle,draw}|
+ \item |for_nodewalk={uu2}{blue}|
+ \item |for_tree={s_sep+=1em}|
+ \end{itemize}
+
+\long\def\printbigbadforlist#1{%
+ {%
+ \tikzexternaldisable
+ \bracketset{action character=!}%
+ \begin{forest}(stages={
+ process keylist=given options,
+ for root'={
+ sort by={>O+t+c{content}},
+ %sort=children,
+ temptoksa={},
+ for sort={children}{
+ TeX and memoize/.process=ROw2{temptoksa}{content}{####1\texttt{for\space}\index{step>####2}},
+ temptoksa={,\space},
+ },
+ }
+ })
+ [!\bigbadforlist[nodewalk][nodewalk'][Nodewalk]]
+ \end{forest}%
+ }%
+}%
+\makeatletter
+\forest@memoize\printbigbadforlist
+\makeatother
+
+{\tolerance=10000
+Here's the big list of all spatial propagators built with prefix |for|:
+% to update,
+% - uncomment \appto\bigbadforlist{[#1]} in define long step in forest.dtx
+% - delete line \forest@memo@load {forest@memo@\printbigbadforlist ... in forest-doc.memo
+\printbigbadforlist{}.
+For details on nodewalk steps, see \S\ref{ref:nodewalks}.
+
+}
+
+\indexitem{propagator>for tree'}|=|\meta{keylist 1}\meta{keylist 2} A ``combination'' of
+ \index{for step=\index{tree children-first}} and \index{for step=\index{tree}}.
+
+ Passes the keylists to the current node and its the descendants. At each node, the \meta{keylist
+ 1} is processed first; then, children are processed recursively; finally, \meta{keylist 2}
+ is processed.
+
+ For an example, see the definition of \index{draw brackets} from \reflibrary{linguistics}.
+
+\indexitem{propagator>for 1}, \dots\indexdef[not print]{propagator>for 2}\indexdef[not print]{propagator>for 3}\indexdef[not print]{propagator>for 4}\indexdef[not print]{propagator>for 5}\indexdef[not print]{propagator>for 6}\indexdef[not print]{propagator>for 7}\indexdef[not print]{propagator>for 8}, \indexdef{propagator>for 9}|=|\meta{keylist}
+ \itemnosep
+\indexitem{propagator>for -1}, \dots\indexdef[not print]{propagator>for -2}\indexdef[not print]{propagator>for -3}\indexdef[not print]{propagator>for -4}\indexdef[not print]{propagator>for -5}\indexdef[not print]{propagator>for -6}\indexdef[not print]{propagator>for -7}\indexdef[not print]{propagator>for -8}, \indexdef{propagator>for -9}|=|\meta{keylist}
+
+ Although \index{for step} normally cannot precede short forms of steps, an exception is made
+ for \index{ss 1}\index[not print]{ss 2,ss 3,ss 4,ss 5,ss 6,ss 7,ss 8}, \dots, \index{ss 9}. (These keys will work even if the short steps are redefined.)
+
+ |for |$n$ passes the \meta{keylist} to the $n$th child of the current node. |for -|$n$ starts counting at the last child.
+\indexitem{node key>Nodewalk}|=|\meta{keylist: config}\meta{nodewalk}\meta{keylist: every-step}
+
+Configures and executes the \meta{nodewalk}. This key is a nodekey-space copy of nodewalk step
+\index{step>Nodewalk}.
+
+ \begin{advise}
+ \item Use this key carefully as it can change the current node!
+ \item The envisioned purpose of this key is to change the current node within the every-step
+ keylist of (an outer) nodewalk, where only node keys are accepted. The config defaults
+ (independent every-step, shared history) are set to facilitate that purpose. But it can also be
+ used as a simple node key, of course.
+ \end{advise}
+
+\indexitem{node key>node walk}|=|\meta{node walk} \textbf{Deprecated!!!} Requires
+ \index{compat}|=1.0-nodewalk|. Please use \index{for step=\index{nodewalk}} in new code. From the
+ old documentation:
+
+ \begin{quote}
+ This is the most general way to use a \meta{node walk}.
+
+ Before starting the \meta{node walk}, key \indexdef{node key>node walk/before walk} is processed.
+ Then, the \meta{step}s composing the \meta{node walk} are processed: making a step (normally)
+ changes the current node. After every step, key \indexdef{node key>node walk/every step} is
+ processed. After the walk, key \indexdef{node key>node walk/after walk} is processed.
+
+ \keyname{node walk/before walk}, \keyname{node walk/every step} and \keyname{node walk/after
+ walk} are processed with \keyname{/forest} as the default path: thus, \foRest;'s node keys can
+ be used normally inside their definitions.
+
+ \begin{advise}
+ \item Node walks can be tail-recursive, i.e.\ you can call another node walk from \keyname{node
+ walk/after walk} --- embedding another node walk in \keyname{node walk/before walk} or
+ \keyname{node walk/every step} will probably fail, because the three node walk styles are not
+ saved and restored (a node walk doesn't create a \TeX\ group).
+ \item \keyname{every step} and \keyname{after walk} can be redefined even during the walk.
+ Obviously, redefining \keyname{before walk} during the walk has no effect (in the current
+ walk).
+ \end{advise}
+ \end{quote}
+\end{syntax}
+
+
+\subsubsection{Various}
+\label{sec:node-keys-various}
+
+\begin{syntax}
+
+\indexitem{style>afterthought}|=|\meta{toks} Provides the afterthought explicitely.
+
+ This key is normally not used by the end-user, but rather called by the bracket parser. By
+ default, this key is a style defined by |afterthought/.style={tikz+={#1}}|: afterthoughts are
+ interpreted as (cumulative) \TikZ; code. If you'd like to use afterthoughts for some other
+ purpose, redefine this style --- this will take effect even if you do it in the tree preamble.
+
+\indexitem{node key>also}|=|\meta{keylist} Execute the keys in the given \meta{keylist}.
+
+If we are currently processing node keys, \meta{keylist} should contain node keys. If we are
+in a nodewalk, \meta{keylist} should (or rather, may also) contain nodewalk keys.
+
+For example, to execute, during a nodewalk, a nodewalk keylist stored in register |tempkeylista|,
+write |also/.register=|\indexex{tempkeylista}. Note that no embedded nodewalk will be introduced.
+
+\indexitem{node key>autoforward}|=|\meta{option}\meta{keylist}, \indexdef{node key>autoforward register}|=|\meta{register}\meta{keylist}
+\itemnosep
+\indexitem{node key>autoforward'}|=|\meta{option}\meta{keylist}, \indexdef{node key>autoforward register'}|=|\meta{register}\meta{keylist}
+
+Whenever the value of an autoforwarded option or register is given or changed (via an augmented
+assignment), \meta{option}|=|\meta{new value} or \meta{register}|=|\meta{new value} is appended to
+\meta{keylist}. This can be used to ``intercept and remember'' \TikZ; options, like \index{option>anchor}
+and \index{rotate}.
+
+ The |autoforward'| variant keeps only a single instance of \meta{option} in \meta{keylist}.
+
+ If you ever need to use the non-forwarded version of the key, prefix it with word |autoforwarded|,
+ e.g.\ |autoforwarded_rotate|. Autoforwarding is limited to the current \TeX\ group.
+
+\indexitem{node key>Autoforward}|=|\meta{option}\meta{style definition}, \indexdef{node key>Autoforward register}|=|\meta{register}\meta{style definition}
+
+This is a more generic variant of autoforwarding. After the value of an option or register
+autoforwarded with this key is changed, the style defined by \meta{style definition} is called with
+the new option/register value as its argument.
+
+\begin{forestexample}[index={Autoforward,content,node options}]
+ \forestset{~Autoforward~={content}{node options={#1}}}
+ \begin{forest}
+ [red[blue][green]]
+ \end{forest}
+\end{forestexample}
+
+\indexitem{node key>unautoforward}|=|\meta{option or register} Undoes the autoforwarding of the
+option or register made by any of the autoforwarding keys.
+
+\indexitem{node key>content to}|=|\meta{key} When parsing the bracket representation of the tree,
+store the given content using \meta{key}|=|\meta{content}.
+
+\indexitem{node key>copy command key}|=|\meta{pgfkey: source}\meta{pgfkey: destination}
+
+ Copies the |pgf| key in a way that |.add code| and |.add style| handlers still work.
+
+\indexitem({{{{{}}}}}){register>default preamble}|=|\meta{keylist}
+ \itemnosep
+\indexitem{register>preamble}|=|\meta{keylist}
+
+ These registers hold the content of the default preamble and the preamble of the current tree.
+
+ |preamble| is set by the bracket parser. Set |default preamble| outside the \index{forest}
+ environment using \index{forestset}.
+
+ As |default preamble| and |preamble| are not styles but keylist registers, the |#| characters do
+ not need to be doubled: you can freely copy and paste your keylists between the node options of
+ the root node, the preamble and the default preamble. The only difference will be the order of
+ execution: first default preamble, then preamble, and finally the root node's options.
+
+\indexitem{node key>save and restore register}|=|\meta{register}\meta{keylist}
+
+Restores the current value of \meta{register} after executing the \meta{keylist}.
+
+\indexitem{node key>split}|=|\meta{toks}\meta{separator}\meta{keylist}
+ \itemnosep
+\indexitem{node key>split option}|=|\meta{option}\meta{separator}\meta{keylist}
+ \itemnosep
+\indexitem{node key>split register}|=|\meta{register}\meta{separator}\meta{keylist}
+
+Split \meta{toks} or the value of \meta{option} or \meta{register} at occurrences of
+\meta{separator} (which must be a single token), and process the keys in \meta{keylist} with the
+pieces of the split token list as arguments, in the order given.
+
+\meta{option} can be either a simple \meta{option name} or a \meta{relative node name}\texttt{.}\meta{option name}.
+
+ The difference in the number of split values and given keys is handled gracefully. If there is
+ not enough values, the superfluous keys are not processed; if there are too many values, the last
+ key is called repeatedly.
+
+ The keys in \meta{keylist} can be any valid keys, including augmented assignments, non-current
+ option assignments, even \index{TeX} or user-defined styles. Actually, as |split| works by simply
+ appending |={|\meta{current value}|}| to the relevant given key, it is possible for the key to be
+ a (sub)keylist ending in a simple, non-valued key, like shown below.
+
+ \begin{advise}
+ \item Pay attention to |%| characters around the subkeylist. In order for it to actually function
+ as a sublist, its braces should be stripped, but this can only happen if no spaces surround it.
+ \end{advise}
+
+\begin{forestexample}[point=split option,index={delay,content,split option,process args},label=ex:split option]
+ \begin{forest}
+ [
+ {1,2,3,4}
+ [,delay={
+ ~split option~=
+ {!parent.content}
+ {,}
+ {
+ content',%
+ {content+={+},content+}%
+ },
+ tempcounta'/.process={O+n}{content},
+ content+={=},
+ content+/.register=tempcounta,
+ }
+ ]
+ ]
+ \end{forest}
+\end{forestexample}
+
+\indexitem{node key>TeX}|=|\meta{toks: \TeX\ code} The given code is executed immediately.
+
+ This can be used for e.g.\ enumerating nodes:
+\begin{forestexample}[point=TeX,index={TeX,delay,where option,tier,content,GP1},label=ex:enumerate]
+ \newcount\xcount
+ \begin{forest} GP1,
+ delay={TeX={\xcount=0},
+ where tier={x}{TeX={\advance\xcount1},
+ content/.expanded={##1$_{\the\xcount}$}}{}}
+ [
+ [O[x[f]]]
+ [R[N[x[o]]]]
+ [O[x[r]]]
+ [R[N[x[e]]][x[s]]]
+ [O[x[t]]]
+ [R[N[x]]]
+ ]
+ \end{forest}
+\end{forestexample}
+
+\indexitem{node key>TeX'}|=|\meta{toks: \TeX\ code} This key is a combination of keys \index{TeX}
+and \index{TeX''}: the given code is both executed and externalized.
+
+\indexitem{node key>TeX''}|=|\meta{toks: \TeX\ code} The given code is externalized, i.e.\ it will be
+executed when the externalized images are loaded.
+
+The image-loading and \keyname{TeX'(')} produced code are intertwined.
+
+\indexitem{node key>typeout}|=|\meta{toks} A \foRest; version of \LaTeX\ macro |\typeout|. Useful
+for debugging, trust me on this one.
+
+\indexitem(node options){node key>unknown to}|=|\meta{key} Forward unknown keys to \meta{key}.
+
+\begin{advise}
+\item Do \emph{not} use handler |.unknown| to deal with unknown keys, as it is used internally by
+\foRest;, and is set up to make it possible to set options of non-current nodes (see
+\S\ref{sec:option-setting}).
+\end{advise}
+
+\indexitem{node key>unknown key error}|=|\meta{keyval} Produces an error.
+
+Write \index{unknown to}|=unknown key error| to produce an error when a key unknown to \foRest; is
+used.
+
+\end{syntax}
+
+
+
+\subsection{Options and registers}
+\label{sec:options-and-registers}
+
+\FoRest; introduces two types of data storage: \emph{node options} (or just \emph{options} for
+short) and \emph{registers}.
+
+Options store data related to particular nodes. Each node has its own set of option values, i.e.\
+the value of an option at some node is independent of its value at other nodes: in particular,
+setting an option of a node does \emph{not} set this option for the node's descendants. Register
+values are not associated to nodes.
+
+Note that option and register keys share the same ``namespace'' (|pgfkeys| path and |pgfmath|
+function names) so it is not possible to have an option and a register of the same name!
+
+\subsubsection{Setting}
+\label{sec:option-setting}
+
+The simplest way to set the value of an option or a register is to use the key of the same name.
+\begin{syntax}
+ \indexitem[index key={@@@opt},form={}]{prefix>assignment>current node=\meta{option}}|=|\meta{value}
+ Sets the value of \meta{option} of the current node to \meta{value}.
+
+ Note that option types \index{keylist} and \index{autowrapped toks} redefine this basic key.
+
+ \indexitem[index key={@@@reg},form={}]{prefix>assignment>current node=\meta{register}}|=|\meta{value}
+ Sets the value of \meta{register} to \meta{value}.
+
+ Note that register types \index{keylist} and \index{autowrapped toks} redefine this basic key.
+\end{syntax}
+
+Options can also be set for the non-current node:
+\begin{syntax}
+ % \indexitem[index key={@@@.},form={.},+print format={+result={\index(not print){relative node name}\index(not index)[+print format=definition]{relative node name}}},+index format={+result={\meta{relative node name}}}]{prefix>assignment>relative node=\meta{option}}|=|\meta{value}
+ \indexitem[index key={@@@.},form={.},+print format={+result={\index{relative node name}}},+index format={+result={\meta{relative node name}}}]{prefix>assignment>relative node=\meta{option}}|=|\meta{value}
+
+ Sets the value of \meta{option} of the node specified by \meta{relative node name} to \meta{value}.
+
+ Notes: \begin{enumerate*}[(i)]
+ \item\emph{\meta{value} is evaluated in the context of the current node.}
+ \item In general, the resolution of \meta{relative node name} depends on the
+ current node; see \S\ref{ref:relative-node-names}.
+ \item \meta{option} can also be an ``augmented assignment operator'' (see below) or, indeed, any
+ node key.
+ \end{enumerate*}
+\end{syntax}
+
+Additional keys for setting and modifying the value of an option or a register exist, depending on
+its data type. Informally, you can think of these keys as \emph{augmented operators} known from
+various programming languages.
+
+\begin{syntax}
+\indexitem{type>toks} contains \TeX's \meta{balanced text} \citep[275]{texbook}.
+
+ A toks \meta{option} additionally defines the following keys:
+ \begin{syntax}
+ \indexitem{suffix>augmented assignment=toks>+=\meta{option}}|=|\meta{toks} appends the given \meta{toks} to the
+ current value of the option.
+
+ \indexitem{prefix>augmented assignment=toks>+=\meta{option}}|=|\meta{toks} prepends the given \meta{toks} to the
+ current value of the option.
+
+ % \item \index{if in toks option=\meta{toks option}}| =|\meta{toks}\meta{true
+ % keylist}\meta{false keylist} checks if \meta{toks} occurs in the option value; if it does,
+ % \meta{true keylist} are executed, otherwise \meta{false keylist}.
+
+ % \item \index{where in toks option=\meta{toks option}}| =|\meta{toks}\meta{true
+ % keylist}\meta{false keylist} is a style equivalent to \index{for step=\index{tree}}|={|\keyname{if in }\meta{option}=\meta{toks}\meta{true keylist}\meta{false keylist}|}|: for every node in
+ % the subtree rooted in the current node, \keyname{if in }\meta{option} is executed in
+ % the context of that node.
+ \end{syntax}
+
+\indexitem{type>autowrapped toks} is a subtype of \index{toks} and contains \TeX's \meta{balanced
+text} \citep[275]{texbook}.
+
+ {\rstyle\meta{option}}|=|\meta{toks} of an autowrapped \meta{option} is redefined to
+ \meta{option}|/|\index{wrap value}|=|\meta{toks} of a normal \meta{toks} option.
+
+ Keyvals \indexdef{suffix>augmented assignment=autowrapped toks>+=\meta{option}}|=|\meta{toks} and
+ \indexdef{prefix>augmented assignment=autowrapped toks>+=\meta{option}}|=|\meta{toks} are redefined to
+ \index{toks+=\meta{option}}|/|\index{wrap value}|=|\meta{toks} and
+ \index{+toks=\meta{option}}|/|\index{wrap value}|=|\meta{toks}, respectively. The normal toks
+ behaviour can be accessed via keys \indexdef{suffix>augmented assignment=autowrapped toks>'=\meta{option}},
+ \indexdef{suffix>augmented assignment=autowrapped toks>+'=\meta{option}}, and
+ \indexdef[set={print format={result/.expanded=+\forestoption{argument}',pgfkey},index form=+\meta{autowrapped toks option}',index format=pgfkey,index key=+'}]{augmented assignment>+autowrapped toks'=\meta{option}}.
+
+\indexitem{type>keylist} is a subtype of \index{toks} and contains a comma-separated list of
+ \meta{key}[|=|\meta{value}] pairs.
+
+ Augmented assignment operators \indexdef{suffix>augmented assignment=keylist>+=\meta{option}} and
+ \indexdef{prefix>augmented assignment=keylist>+=\meta{option}} automatically insert a comma
+ before/after the appended/prepended material.
+
+ Augmented assignment operator \indexdef{suffix>augmented assignment=keylist>-=\meta{option}}|=|\meta{keylist} deletes the keys
+ from keylist \meta{option}. \meta{keylist} specifies which keys to delete. If a key is given no
+ value, all occurrences of that key will be deleted. If a key is given a value, only occurrences
+ with that value will be deleted. To delete occurrences without value, use special value
+ \indexdef{macro>forestnovalue}. (Note: if you include a key in \meta{keylist} more than once,
+ only the last occurrence counts.)
+
+ {\rstyle\meta{option}}|=|\meta{keylist} of a keylist option is redefined to
+ \meta{option}\keyname{+}|=|\meta{keylist}. In other words, keylists behave additively by
+ default. The rationale is that one usually wants to add keys to a keylist. The usual,
+ non-additive behaviour can be accessed by \indexdef{suffix>augmented assignment=keylist>'=\meta{option}}|=|\meta{keylist}.
+
+ Manipulating the keylist option using augmented assignments might have the side-effect of adding
+ an empty key to the list.
+
+\indexitem{type>dimen} contains a dimension.
+
+ The value given to a dimension option is automatically evaluated by |pgfmath|. In other words,
+ {\rstyle\meta{option}}|=|\meta{value} is implicitly understood as
+ \meta{option}|/|\index{pgfmath}|=|\meta{value}.
+
+ For a \meta{dimen} option \meta{option}, the following additional keys (``augmented
+ assignments'') are defined:
+ \begin{syntax}
+ \indexitem{suffix>augmented assignment=dimen>+=\meta{option}}|=|\meta{value} is equivalent to \meta{option}|=|\meta{option}|()+|\meta{value}
+ \indexitem{suffix>augmented assignment=dimen>-=\meta{option}}|=|\meta{value} is equivalent to \meta{option}|=|\meta{option}|()-|\meta{value}
+ \indexitem{suffix>augmented assignment=dimen>*=\meta{option}}|=|\meta{value} is equivalent to \meta{option}|=|\meta{option}|()*|\meta{value}
+ \indexitem{suffix>augmented assignment=dimen>:=\meta{option}}|=|\meta{value} is equivalent to \meta{option}|=|\meta{option}|()/|\meta{value}
+ \end{syntax}
+
+ The evaluation of \meta{pgfmath} can be quite slow. There are two tricks to speed things up
+ \emph{if} the \meta{pgfmath} expression is simple, i.e.\ just a \TeX\ \meta{dimen}:
+ \begin{enumerate}
+ \item |pgfmath| evaluation of simple values can be sped up by prepending |+| to the value
+ \citep[\S62.1]{tikzpgf2.10};
+ \item use the key \indexdef{suffix>augmented assignment=dimen>'=\meta{option}}|=|\meta{value} to invoke a normal \TeX\ assignment.
+ \end{enumerate}
+
+ The two above-mentioned speed-up tricks work for the augmented assignments as well. The keys for
+ the second, \TeX-only trick are: \indexdef{suffix>augmented assignment=dimen>'+}, \indexdef{suffix>augmented assignment=dimen>'-}, \indexdef{suffix>augmented assignment=dimen>'*}, \indexdef{suffix>augmented assignment=dimen>':} --- note that for the latter two,
+ the value should be an integer.
+
+\indexitem{type>count} contains an integer.
+
+ The additional keys and their behaviour are the same as for the \meta{dimen} options.%
+ \indexdef[not print]{suffix>augmented assignment=count>+}%
+ \indexdef[not print]{suffix>augmented assignment=count>-}%
+ \indexdef[not print]{suffix>augmented assignment=count>*}%
+ \indexdef[not print]{suffix>augmented assignment=count>:}%
+ \indexdef[not print]{suffix>augmented assignment=count>'}%
+ \indexdef[not print]{suffix>augmented assignment=count>'+}%
+ \indexdef[not print]{suffix>augmented assignment=count>'-}%
+ \indexdef[not print]{suffix>augmented assignment=count>'*}%
+ \indexdef[not print]{suffix>augmented assignment=count>':}%
+
+\indexitem{type>boolean} contains $0$ (false) or $1$ (true).
+
+ In the general case, the value given to a \meta{boolean} option is automatically
+ parsed by |pgfmath| (just as for \meta{count} and \meta{dimen}): if the computed value is
+ non-zero, $1$ is stored; otherwise, $0$ is stored. Note that |pgfmath| recognizes constants
+ |true| and |false|, so it is possible to write \meta{option}|=true| and
+ \meta{option}|=false|.
+
+ If key \meta{option} is given no argument, pgfmath evaluation does not apply and a true value is
+ set. To quickly set a false value, use key \indexdef{word prefix=boolean option>>not=\meta{option}} (with no arguments).
+\end{syntax}
+
+\subsubsection{Reading}
+\label{sec:option-reading}
+
+Option and register values can be accessed using the four macros listed below, handlers
+\index{handler>option} and \index{handler>register} (\S\ref{ref:handlers}) and |pgfmath| functions
+(\ref{ref:pgfmath}).
+
+\begin{syntax}
+ \indexitem{macro>forestoption}|{|\meta{option}|}|
+ \itemnosep
+ \indexitem{macro>foresteoption}|{|\meta{option}|}|
+ \itemnosep
+ \indexitem{macro>forestregister}|{|\meta{register}|}|
+ \itemnosep
+ \indexitem{macro>foresteregister}|{|\meta{register}|}|
+
+ These macros expand to the value of the given option or register. Note that
+ \index{macro>forestoption} and \index{macro>foresteoption} expand to the value of the given option
+ of the \emph{current node}; to access option values of a non-current node, use |pgfmath|
+ functions.
+
+ In the context of |\edef|, \cmdname{forestoption} and \cmdname{forestregister} expand precisely to
+ the token list of the option value, while \cmdname{foresteoption} and \cmdname{foresteregister}
+ fully expand the value.
+
+ \begin{advise}
+ \item These macros can be useful in \TeX\ code introduced by \index{TeX} or \PGF;'s handler
+ |.expanded| \citep[\S55.4.6]{tikzpgf2.10}.
+ \end{advise}
+\end{syntax}
+
+
+\subsubsection{Declaring}
+\label{sec:option-declaring}
+
+Using the following keys, users can also declare their own options and registers. The new options
+and registers will behave exactly like the predefined ones.
+
+Note that the declaration of an option must provide a default value, while the declaration of a
+register must not do that (registers are initialized to the empty string, |0pt| or |0|, as
+appropriate for the type). The default value of an option will be assigned to any newly created
+nodes; the existing nodes are not affected.
+
+\begin{syntax}
+ \indexitem{node key>declare toks}|=|\meta{option name}\meta{default value}
+ Declares a \meta{toks} option.
+
+ \indexitem{node key>declare autowrapped toks}|=|\meta{option name}\meta{default value}
+ Declares an \meta{autowrapped toks} option.
+
+ \indexitem{node key>declare keylist}|=|\meta{option name}\meta{default value}
+ Declares a \meta{keylist} option.
+
+ \indexitem{node key>declare dimen}|=|\meta{option name}\meta{default value}
+ Declares a \meta{dimen} option. The default value is processed by \index{forestmath}.
+
+ \indexitem{node key>declare count}|=|\meta{option name}\meta{default value}
+ Declares a \meta{count} option. The default value is processed by \index{forestmath}.
+
+ \indexitem{node key>declare boolean}|=|\meta{option name}\meta{default value}
+ Declares a \meta{boolean} option. The default value is processed by \index{forestmath}.
+
+ \indexitem{node key>declare toks register}|=|\meta{register name}
+ Declares a \meta{toks} register.
+
+ \indexitem{node key>declare autowrapped toks register}|=|\meta{register name}
+ Declares an \meta{autowrapped toks} register.
+
+ \indexitem{node key>declare keylist register}|=|\meta{register name}
+ Declares a \meta{keylist} register.
+
+ \indexitem{node key>declare dimen register}|=|\meta{register name}
+ Declares a \meta{dimen} register.
+
+ \indexitem{node key>declare count register}|=|\meta{register name}
+ Declares a \meta{count} register.
+
+ \indexitem{node key>declare boolean register}|=|\meta{register name}
+ Declares a \meta{boolean} register.
+\end{syntax}
+
+Several scratch registers are predefined:
+\begin{syntax}
+ \indexitem{register>temptoksa}, \indexdef{register>temptoksb}, \indexdef{register>temptoksc}, \indexdef{register>temptoksd} Predefined \meta{toks} registers.
+
+ \indexitem{register>tempkeylista}, \indexdef{register>tempkeylistb}, \indexdef{register>tempkeylistc}, \indexdef{register>tempkeylistd} Predefined \meta{keylist} registers.
+
+ \indexitem{register>tempdima}, \indexdef{register>tempdimb}, \indexdef{register>tempdimc}, \indexdef{register>tempdimd}, \indexdef{register>tempdimx}, \indexdef{register>tempdimy}, \indexdef{register>tempdiml}, \indexdef{register>tempdims}, \indexdef{register>tempdimxa}, \indexdef{register>tempdimya}, \indexdef{register>tempdimla}, \indexdef{register>tempdimsa}, \indexdef{register>tempdimxb}, \indexdef{register>tempdimyb}, \indexdef{register>tempdimlb}, \indexdef{register>tempdimsb} Predefined \meta{dimen} registers.
+
+ \indexitem{register>tempcounta}, \indexdef{register>tempcountb}, \indexdef{register>tempcountc}, \indexdef{register>tempcountd} Predefined \meta{count} registers.
+
+ \indexitem{register>tempboola}, \indexdef{register>tempboolb}, \indexdef{register>tempboolc}, \indexdef{register>tempboold} Predefined \meta{boolean} registers.
+\end{syntax}
+
+
+
+\subsection{Formatting the tree}
+\label{sec:formatting-tree}
+
+
+\subsubsection{Node appearance}
+\label{ref:node-appearance}
+
+The following options apply at stage \index{typeset nodes}. Changing them
+afterwards has no effect in the normal course of events.
+
+\begin{syntax}
+\indexitem({{{{{}}}}}){option>align}|=|\index{value of=align>left}\OR\index{value of=align>center}\OR\index{value of=align>right}\OR\meta{toks: tabular header}
+
+ Creates a left/center/right-aligned multiline node, or a tabular node. In the
+ \index{content} option, the lines of the node should separated by |\\| and the columns (if
+ any) by |&|, as usual.
+
+ The vertical alignment of the multiline/tabular node can be specified by option \index{base}.
+
+\begin{forestexample}[index={l sep,align,base}]
+ \begin{forest} l sep+=2ex
+ [special value&actual value\\\hline
+ \indexdef{value of=align>left}&||\texttt{@\{\}l@\{\}}\\
+ \indexdef{value of=align>center}&||\texttt{@\{\}c@\{\}}\\
+ \indexdef{value of=align>right}&||\texttt{@\{\}r@\{\}}\\
+ ,~align~=ll,draw
+ [top base\\right aligned, ~align~=right,~base~=top]
+ [left aligned\\bottom base, ~align~=left,~base~=bottom]
+ ]
+ \end{forest}
+\end{forestexample}
+
+ Internally, setting this option has two effects:
+ \begin{enumerate}
+ \item The option value (a |tabular| environment header specification) is set. The special
+ values \keyname{left}, \keyname{center} and \keyname{right} invoke styles setting the actual
+ header to the value shown in the above example.
+ \begin{advise}
+ \item If you know that the \keyname{align} was set with a special value, you can easily check
+ the value using \index{if in toks option=\index{align}}.
+ \end{advise}
+ \item Option \index{content format} is set to the following value:
+ \begin{lstlisting}
+ \noexpand\begin{tabular}[\forestoption{base}]{\forestoption{align}}%
+ \forestoption{content}%
+ \noexpand\end{tabular}%
+ \end{lstlisting}
+ As you can see, it is this value that determines that options \keyname{base}, \keyname{align} and
+ \keyname{content} specify the vertical alignment, header and content of the table.
+ \end{enumerate}
+
+\indexitem(t){option>base}|=|\meta{toks: vertical alignment}
+
+This option controls the vertical alignment of multiline (and in general, \texttt{tabular}) nodes
+created with \index{align}. Its value becomes the optional argument to the \texttt{tabular}
+environment. Thus, sensible values are \indexdef{value of=base>t} (the top line of the table will
+be the baseline) and \indexdef{value of=base>b} (the bottom line of the table will be the baseline).
+Note that this will only have effect if the node is anchored on a baseline, like in the default
+case of \index{option>anchor}|=base|.
+
+For readability, you can use \indexdef{value of=base>top} and \indexdef{value of=base>bottom} instead
+of \keyname{t} and \keyname{b}. (\keyname{top} and \keyname{bottom} are still stored as
+\keyname{t} and \keyname{b}.)
+
+ \indexitem({{{{{}}}}}){option>content}|=|\meta{autowrapped toks} The content of the node.
+
+ Normally, the value of option \keyname{content} is given implicitely by virtue of the special
+ (initial) position of content in the bracket representation (see~\S\ref{ref:bracket}). However,
+ the option also be set explicitely, as any other option.
+
+\begin{forestexample}[index={for step,tree,if option,readonly option>n,readonly option>n'},point={content,delay},index={content,delay}]
+ \begin{forest}
+ delay={for tree={
+ if n=1{content=L}
+ {if n'=1{content=R}
+ {content=C}}}}
+ [[[][][]][[][][]]]
+ \end{forest}
+\end{forestexample}
+ Note that the execution of the \keyname{content} option should usually be delayed: otherwise, the
+ implicitely given content (in the example below, the empty string) will override the explicitely
+ given content.
+
+\begin{forestexample}[index={for step,tree,if option,readonly option>n,readonly option>n',content},point={content}]
+ \begin{forest}
+ for tree={
+ if n=1{content=L}
+ {if n'=1{content=R}
+ {content=C}}}
+ [[[][][]][[][][]]]
+ \end{forest}
+\end{forestexample}
+
+ \indexitem(\forestoption{content}){option>content format}|=|\meta{toks}
+
+ When typesetting the node under the default conditions (see option \index{node format}), the
+ value of this option is passed to the \TikZ; \texttt{node} operation as its \meta{text} argument
+ \citep[\S16.2]{tikzpgf2.10}. The default value of the option simply puts the content in the
+ node.
+
+ This is a fairly low level option, but sometimes you might still want to change its value. If
+ you do so, take care of what is expanded when. Most importantly, if you use a formatting
+ command such as |\textbf| in the default setting of \index{node format}, be sure to precede
+ it with |\noexpand|. For details, read the documentation of option \index{node format} and
+ macros \index{forestoption} and \index{foresteoption}; for an example, see option
+ \index{align}.
+
+\indexitem{node key>math content} Changes \index{content format} so that the content of the node
+ will be typeset in a math environment.
+
+\indexitem{node key>plain content} Resets \index{content format} to the default value.
+
+\indexitem{option>node format}|=|\meta{toks}
+ \hfill|\noexpand\node(\forestoption{name})|\\
+ \mbox{}\hfill|[\forestoption{node options}]{\foresteoption{content format}};|
+
+ The node is typeset by executing the expansion of this option's value in a |tikzpicture|
+ environment.
+
+ Important: the value of this option is first expanded using |\edef| and only then executed. Note
+ that in its default value, \index{content format} is fully expanded using
+ \index{foresteoption}: this is necessary for complex content formats, such as |tabular|
+ environments.
+
+ This is a low level option. Ideally, there should be no need to change its value. If you do,
+ note that the \TikZ; node you create should be named using the value of option \index{option>name};
+ otherwise, parent--child edges can't be drawn, see option \index{edge path}.
+
+\indexitem{node key>node format'}|=|\meta{toks}
+
+Sets \index{node format}, automatically wrapping the given \meta{toks} by
+|\noexpand\node(\forestoption{name})| and |;|. Only the node options and content must therefore be
+given.
+
+\indexitem(anchor=base){option>node options}|=|\meta{keylist}
+
+ When the node is being typeset under the default conditions (see option \index{node format}),
+ the content of this option is passed to \TikZ; as options to the
+ \TikZ; |node| operation \citep[\S16]{tikzpgf2.10}.
+
+ This option is rarely manipulated manually: almost all options unknown to \foRest; are
+ automatically appended to \keyname{node options}. Exceptions are (i) \index{label} and
+ \index{pin}, which require special attention in order to work; and (ii) \index{option>anchor},
+ which is saved in order to retain the information about the selected anchor.
+
+\begin{forestexample}[index={for step,descendants,option>anchor,option>child anchor,option>parent anchor,grow,l sep,tree,propagator>where,delay,content,node options,pgfmath}]
+ \begin{forest}
+ for descendants={anchor=east,child anchor=east},
+ grow=west,anchor=north,parent anchor=north,
+ l sep=1cm,
+ for tree={~fill=yellow~},where={n()<=3}{~draw=red~}{},
+ delay={for tree={content/.pgfmath=~node_options~}}
+ [root,rotate=90,
+ [,~fill=white~]
+ [,~node options'~]
+ []
+ []
+ [,~node options~={~ellipse~}]
+ ]
+ \end{forest}
+\end{forestexample}
+
+\indexitem(false){option>phantom}|=|\meta{boolean}
+
+ A phantom node and its surrounding edges are taken into account when packing, but not
+ drawn. (This option applies in stage \index{draw tree}.)
+\begin{forestexample}[point=phantom,index={option>phantom}]
+ \begin{forest}
+ [VP[DP][V',phantom[V][DP]]]
+ \end{forest}
+\end{forestexample}
+
+\end{syntax}
+
+
+
+\subsubsection{Node position}
+\label{ref:ref-node-position}
+
+Most of the following options apply at stage \index{pack}. Changing them afterwards has no effect
+in the normal course of events. (Options \index{option>l}, \index{option>s}, \index{option>x}, \index{y} and
+\index{option>anchor} are exceptions; see their documentation for details).
+
+\begin{syntax}
+
+ \indexitem(base){option>anchor}|=|\meta{toks: \foRest; anchor}
+
+ While this option is saved by \foRest;, it is essentially an option of \TikZ;'s |\node| command
+ \citep[see][\S16.5.1]{tikzpgf2.10}. \FoRest; \index{autoforward}s it to keylist option
+ \index{node options}, which is passed on to \TikZ;'s |\node| command when the node is typeset.
+ (Option |anchor| thus normally applies in stage \index{typeset nodes}.)
+
+ In the \TikZ; code, you can refer to the node's anchor using \FoRest;'s anchor
+ \index{anchor>anchor}; this anchor is sometimes also called the node anchor in this
+ documentation, to distinguish it clearly from parent and child anchors.
+
+ \meta{toks: \foRest; anchor} can be any \TikZ; anchor. Additionally, \FoRest; defines several
+ tree hierarchy related anchors; for details, see \S\ref{sec:anchors}.
+
+ The effect of setting the node anchor is twofold:
+ \begin{itemize}
+ \item during packing, the anchors of all siblings are \index{option>l}-aligned;
+ \item some \index{calign} methods use node anchors (of the parent and/or certain children) to
+ \index{option>s}-align the block of children to the parent.
+ \end{itemize}
+
+ \indexitem(center){option>calign}|=|\alternative{child,child edge,midpoint,edge midpoint,fixed
+ angles,fixed edge angles}\\\alternative{first,last,center}.
+
+ The packing algorithm positions the children so that they don't overlap, effectively computing
+ the minimal distances between the node anchors of the children. This option (\keyname{calign}
+ stands for child alignment) specifies how the children are positioned
+ with respect to the parent (while respecting the above-mentioned minimal distances).
+
+ The child alignment methods refer to the primary and the secondary child, and to the primary and
+ the secondary angle. These are set using the keys described just after \keyname{calign}.
+
+ \let\outerleftmargin\leftmargin
+ \begin{syntax}
+ \item\keyname{calign}|=|\indexdef{value of=calign>child} s-aligns the node anchors of the parent and
+ the primary child.
+ \item\keyname{calign}|=|\indexdef{value of=calign>child edge} s-aligns the parent anchor of the parent
+ and the child anchor of the primary child.
+ \item \keyname{calign}|=|\indexdef{value of=calign>first} is an abbreviation for
+ |calign=child,calign_child=1|.
+ \item \keyname{calign}|=|\indexdef{value of=calign>last} is an abbreviation for
+ |calign=child,calign_child=-1|.
+ \item\keyname{calign}|=|\indexdef{value of=calign>midpoint} s-aligns the parent's node anchor and the
+ midpoint between the primary and the secondary child's node anchor.
+ \item\keyname{calign}|=|\indexdef{value of=calign>edge midpoint} s-aligns the parent's parent anchor
+ and the midpoint between the primary and the secondary child's child anchor.
+ \item \keyname{calign}|=|\indexdef{value of=calign>center} is an abbreviation for\\
+ |calign=midpoint,| |calign_primary_child=1,| |calign_secondary_child=-1|.
+\begin{forestexample}
+ \begin{forest}
+ [center,calign=center[1]
+ [first,calign=first[A][B][C]][3][4][5][6]
+ [last,calign=last[A][B][C]][8]]
+ \end{forest}
+\end{forestexample}
+ \item\keyname{calign}|=|\indexdef{value of=calign>fixed angles}: The angle between the direction of
+ growth at the current node (specified by option \index{grow}) and the line through the node
+ anchors of the parent and the primary/secondary child will equal the primary/secondary angle.
+
+ To achieve this, the block of children might be spread or further distanced from the parent.
+ \item\keyname{calign}|=|\indexdef{value of=calign>fixed edge angles}: The angle between the direction of
+ growth at the current node (specified by option \index{grow}) and the line through the
+ parent's parent anchor and the primary/secondary child's child anchor will equal the
+ primary/secondary angle.
+
+ To achieve this, the block of children might be spread or further distanced from the parent.
+\begin{forestexample}[point=calign,index={calign,fixed edge angles,calign primary angle,calign secondary angle,for step,tree,option>l},index>={!}]
+ \begin{forest}
+ calign=fixed edge angles,
+ calign primary angle=-30,calign secondary angle=60,
+ for tree={l=2cm}
+ [CP[C][TP]]
+ \draw[dotted] (!1) -| coordinate(p) () (!2) -| ();
+ \path ()--(p) node[pos=0.4,left,inner sep=1pt]{-30};
+ \path ()--(p) node[pos=0.1,right,inner sep=1pt]{60};
+ \end{forest}
+\end{forestexample}
+ \end{syntax}
+\indexitem{node key>calign child}|=|\meta{count} is an abbreviation for \index{calign primary
+ child}|=|\meta{count}.
+\indexitem(1){option>calign primary child}|=|\meta{count} Sets the primary child.
+ (See \index{calign}.)
+
+ \meta{count} is the child's sequence number. Negative numbers start counting at the last child.
+\indexitem(-1){option>calign secondary child}|=|\meta{count} Sets the secondary child.
+ (See \index{calign}.)
+
+ \meta{count} is the child's sequence number. Negative numbers start counting at the last child.
+\indexitem{node key>calign angle}|=|\meta{count} is an abbreviation for: \index{calign primary
+ angle}|=-|\meta{count}, \index{calign secondary angle}|=|\meta{count}.
+\indexitem(-35){option>calign primary angle}|=|\meta{count} Sets the primary angle.
+ (See \index{calign}.)
+\indexitem(35){option>calign secondary angle}|=|\meta{count} Sets the secondary angle.
+ (See \index{calign}.)
+\indexitem{node key>calign with current} s-aligns the node anchors of the current node and its
+ parent. This key is an abbreviation for:\indexex[not print]{wrap pgfmath arg,calign,child,calign primary child}
+\begin{lstlisting}
+ for parent/.wrap pgfmath arg={calign=child,calign primary child=##1}{n}.
+\end{lstlisting}
+\indexitem{node key>calign with current edge} s-aligns the child anchor of the current node and the
+ parent anchor of its parent. This key is an abbreviation for:\indexex[not print]{wrap pgfmath arg,calign,child edge,calign primary child}
+\begin{lstlisting}
+ for parent/.wrap pgfmath arg={calign=child edge,calign primary child=##1}{n}
+\end{lstlisting}
+
+ \indexitem(tight){option>fit}|=|\alternative{tight,rectangle,band}
+
+\begin{forestexample}[layout=export,basicstyle=\footnotesize\ttfamily]
+ \makeatletter\tikzset{use path/.code={\tikz@addmode{\pgfsyssoftpath@setcurrentpath#1}
+ \appto\tikz@preactions{\let\tikz@actions@path#1}}}\makeatother
+ \forestset{show boundary/.style={
+ before drawing tree={get min s tree boundary=\minboundary, get max s tree boundary=\maxboundary},
+ tikz+={\draw[red,use path=\minboundary]; \draw[red,use path=\maxboundary];}}}
+\end{forestexample}
+\input{\jobname.tmp}
+
+This option sets the type of the (s-)boundary that will be computed for the subtree rooted in the
+node, thereby determining how it will be packed into the subtree rooted in the node's parent.
+There are three choices:\footnote{Below is the definition of style \keyname{show boundary}. The
+\keyname{use path} trick is adjusted from \TeX\ Stackexchange question
+\href{http://tex.stackexchange.com/questions/26382/calling-a-previously-named-path-in-tikz}{Calling
+a previously named path in tikz}.
+
+\box\codebox}
+ \begin{itemize}
+ \item\keyname{fit}|=|\indexdef{value of=fit>tight}: an exact boundary of the node's subtree is computed,
+ resulting in a compactly packed tree. Below, the boundary of subtree L is drawn.
+\begin{forestexample}[point={fit,tight},index={fit,{value of=fit>tight},delay,for step,tree,option>name,content,pgfmath}]
+ \begin{forest}
+ delay={for tree={name/.pgfmath=content}}
+ [root
+ [L,fit=tight, % default
+ show boundary
+ [L1][L2][L3]]
+ [R]
+ ]
+ \end{forest}
+\end{forestexample}
+\makeatletter\tikzset{use path/.code={%
+ \tikz@addmode{\pgfsyssoftpath@setcurrentpath#1}%
+ \appto\tikz@preactions{\let\tikz@actions@path#1}%
+ }}\makeatother
+\item\keyname{fit}|=|\indexdef{value of=fit>rectangle}: puts the node's subtree in a rectangle and effectively
+ packs this rectangle; the resulting tree will usually be wider.
+\begin{forestexample}[point={fit,rectangle},index={fit,{value of=fit>rectangle},delay,for step,tree,option>name,content,pgfmath}]
+ \begin{forest}
+ delay={for tree={name/.pgfmath=content}}
+ [root
+ [L,fit=rectangle,
+ show boundary
+ [L1][L2][L3]]
+ [R]
+ ]
+ \end{forest}
+\end{forestexample}
+\item\keyname{fit}|=|\indexdef{value of=fit>band}: puts the node's subtree in a rectangle of ``infinite
+ depth'': the space under the node and its descendants will be kept clear.
+\begin{forestexample}[point={fit,band},index={fit,{value of=fit>band},delay,for step,tree,option>name,content,pgfmath}]
+ \begin{forest}
+ delay={for tree={name/.pgfmath=content}}
+ [root
+ [L[L1][L2][L3]]
+ [C,fit=band]
+ [R[R1][R2][R3]]
+ ]
+ \draw[thin,red]
+ (C.south west)--(C.north west)
+ (C.north east)--(C.south east);
+ \draw[thin,red,dotted]
+ (C.south west)--+(0,-1)
+ (C.south east)--+(0,-1);
+ \end{forest}
+\end{forestexample}
+ \end{itemize}
+
+\indexitem(270){option>grow}|=|\meta{count}, \indexdef{node key>grow'}|=|\meta{count},
+ \indexdef{node key>grow''}|=|\meta{count}
+
+ The direction of the tree's growth at the node.
+
+ The growth direction is understood as in \TikZ;'s tree library \citep[\S18.5.2]{tikzpgf2.10}
+ when using the default growth method: the (node anchor's of the) children of the node are placed
+ on a line orthogonal to the current direction of growth. (The final result might be different,
+ however, if \index{option>l} is changed after packing or if some child undergoes tier alignment.)
+
+ This option is essentially numeric (|pgfmath| function \keyname{grow} will always return an
+ integer), but there are some twists. The growth direction can be specified either numerically
+ or as a compass direction (|east|, |north east|, \dots). Furthermore, like in \TikZ;, setting
+ the growth direction using key \keyname{grow} additionally sets the value of option
+ \index{reversed} to |false|, while setting it with \keyname{grow'} sets it to |true|; to
+ change the growth direction without influencing \index{reversed}, use key \index{grow''}.
+
+ Between stages \index{pack} and \index{compute xy}, the value of \keyname{grow} should not
+ be changed.
+
+\begin{forestexample}[index={delay,where in toks option,content,for step,current,grow,grow',grow'',pgfmath}]
+ \begin{forest}
+ delay={where in content={~grow~}{
+ for current/.pgfmath=content,
+ content=\texttt{#1}
+ }{}
+ }
+ [{~grow~=south}
+ [{~grow'~=west}[1][2][3]
+ [{~grow''~=90}[1][2][3]]]
+ [2][3][4]
+ [{~grow~=east}[1][2][3]
+ [{~grow''~=90}[1][2][3]]]]
+ \end{forest}
+\end{forestexample}
+
+\indexitem(false){option>ignore}|=|\meta{boolean}
+
+If this option is set, the packing mechanism ignores the node, i.e.\ it pretends that the node has
+no boundary. Note: this only applies to the node, not to the tree.
+
+Maybe someone will even find this option useful for some reason \dots
+
+\indexitem(false){option>ignore edge}|=|\meta{boolean}
+
+If this option is set, the packing mechanism ignores the edge from the node to the parent, i.e.\
+nodes and other edges can overlap it. (See \S\ref{sec:bugs} for some problematic situations.)
+
+\begin{forestexample}[index={ignore edge,option>l,dimen*=l}]
+ \begin{forest}
+ [A[B[B][B][B][B]][C
+ [\texttt{not ignore edge},l*=2]]]
+ \end{forest}
+ \begin{forest}
+ [A[B[B][B][B][B]][C
+ [\texttt{ignore edge},l*=2,~ignore edge~]]]
+ \end{forest}
+\end{forestexample}
+
+\indexitem{option>l}|=|\meta{dimen} The l-position of the node, in the parent's ls-coordinate system. (The
+origin of a node's ls-coordinate system is at its (node) anchor. The l-axis points in the
+direction of the tree growth at the node, which is given by option \index{grow}. The s-axis is
+orthogonal to the l-axis; the positive side is in the counter-clockwise direction from |l| axis.)
+
+The initial value of \keyname{l} is set from the standard node. By default, it equals:
+\[\index{l sep}+2\cdot\mbox{\texttt{outer ysep}}+\mbox{total
+height(standard node)}\]
+
+The value of \keyname{l} can be changed at any point, with different effects.
+\begin{itemize}
+\item The value of \keyname{l} at the beginning of stage \index{pack} determines the minimal
+ l-distance between the anchors of the node and its parent. Thus, changing \keyname{l} before
+ packing will influence this process. (During packing, \keyname{l} can be increased due to
+ parent's \index{l sep}, tier alignment, or \index{calign} methods
+ \index{fixed angles} and \index{fixed edge angles}.
+
+\item Changing \keyname{l} after packing but before stage \index{compute xy} will result in a
+ manual adjustment of the computed position. (The augmented assignment operators can be useful here.)
+
+\item Changing \keyname{l} after the absolute positions have been computed has no effect in the
+ normal course of events.
+\end{itemize}
+
+\indexitem{option>l sep}|=|\meta{dimen} The minimal l-distance between the node and its
+descendants.
+
+This option determines the l-distance between the \emph{boundaries} of the node and its descendants,
+not node anchors. The final effect is that there will be a \keyname{l sep} wide band,
+in the l-dimension, between the node and all its descendants.
+
+The initial value of \keyname{l sep} is set from the standard node and equals
+\[\mbox{height}(\mbox{strut})+\mbox{\texttt{inner ysep}}\]
+
+Note that despite the similar name, the semantics of \keyname{l sep} and \keyname{s sep} are
+quite different.
+
+\indexitem(false){option>reversed}|=|\meta{boolean}
+
+If |false|, the children are positioned around the node in the counter-clockwise direction; if
+|true|, in the clockwise direction. See also \index{grow}.
+
+\indexitem(0){option>rotate}|=|\meta{count}
+
+This option is saved and \index{autoforward}ed to \TikZ;'s |\node| command via \index{node options}.
+
+\indexitem{option>s}|=|\meta{dimen} The s-position of the node, in the parent's ls-coordinate system.
+(The origin of a node's ls-coordinate system is at its (node) anchor. The l-axis points in the
+direction of the tree growth at the node, which is given by option \index{grow}. The s-axis is
+orthogonal to the l-axis; the positive side is in the counter-clockwise direction from |l| axis.)
+
+The value of \keyname{s} is computed in stage \index{pack stage} and used in stage \index{compute xy
+ stage}, so it only makes sense to (inspect and) change it in \index{before computing xy} and
+during packing (\index{before packing node} and \index{after packing node}). \emph{Any value given
+ before packing is overridden, and changing the value after computing xy has no effect.}
+
+For example, consider the manual correction below. By default, B is closer to A than C because
+packing proceeds from the first to the last child --- the position of B would be the same if there
+was no C. Adjusting \keyname{s} at the right moment, it is easy to center B between A and C.
+\begin{forestexample}[tree bin=minipage,point=s,index={before computing xy,option>s}]
+ \begin{forest}
+ [no manual correction of B
+ [A[1][2][3][4]]
+ [B]
+ [C[1][2][3][4]]
+ ]
+ \end{forest}
+
+ \begin{forest}
+ [manual correction of B
+ [A[1][2][3][4]]
+ [B,before computing xy={s/.average={s}{siblings}}]
+ [C[1][2][3][4]]
+ ]
+ \end{forest}
+\end{forestexample}
+
+\indexitem{option>s sep}|=|\meta{dimen}
+
+The subtrees rooted in the node's children will be kept at least \keyname{s sep} apart in the
+s-dimension. Note that \keyname{s sep} is about the minimal distance between node
+\emph{boundaries}, not node anchors.
+
+The initial value of \keyname{s sep} is set from the standard node and equals
+$2\cdot\mbox{\texttt{inner xsep}}$.
+
+Note that despite the similar name, the semantics of \keyname{s sep} and \keyname{l sep} are
+quite different.
+
+\indexitem({{{{{}}}}}){option>tier}|=|\meta{toks}
+
+Setting this option to something non-empty ``puts a node on a tier.'' All the nodes on the same
+tier are aligned in the l-dimension.
+
+Tier alignment across changes in growth direction is impossible. In the case of incompatible
+options, \foRest; will yield an error.
+
+Tier alignment also does not work well with \index{calign}|=|\index{fixed angles} and \index{calign}|=|\index{fixed edge angles}, because these child alignment methods may change the
+l-position of the children. When this might happen, \foRest; will yield a warning.
+
+\indexitem{option>x}=\meta{dimen}
+\vspace{-\parskip}
+\indexitem{option>y}=\meta{dimen}
+
+\keyname{x} and \keyname{y} are the coordinates of the node in the ``normal'' (paper) coordinate
+system, relative to the root of the tree that is being drawn. So, essentially, they are absolute
+coordinates.
+
+The values of \keyname{x} and \keyname{y} are computed in stage \index{compute xy}. It only
+makes sense to inspect and change them (for manual adjustments) afterwards (normally, in the
+\index{before drawing tree} hook, see \S\ref{ref:stages}.) \keyname{x} and \keyname{y} of the
+(formal) root node are exceptions, as they are not changed in stage \index{compute xy}.
+\begin{forestexample}[label=ex:adjustxy,index={y,dimen-,grow',option>l,for step,tree,before drawing tree}]
+ \begin{forest}
+ for tree={grow'=45,l=1.5cm}
+ [A[B][C][D,before drawing tree={~y-~=4mm}[1][2][3][4][5]][E][F]]
+ \end{forest}
+\end{forestexample}
+
+\end{syntax}
+
+\subsubsection{Edges}
+\label{ref:ref-edge}
+
+These options determine the shape and position of the edge from a node to its parent. They apply
+at stage \index{draw tree}.
+
+\begin{syntax}
+\indexitem({{{{{}}}}}){option>child anchor}|=|\meta{toks: \foRest; anchor} See \index{option>parent anchor}.
+
+\indexitem(draw){option>edge}|=|\meta{keylist}
+
+ When \index{edge path} has its default value, the value of this option is passed as options to
+ the \TikZ; |\path| expression used to draw the edge between the node and its parent.
+
+ Also see key \index{no edge}.
+
+\begin{forestexample}[point=edge,index={edge,no edge,for step,tree,grow',option>l,option>anchor,option>child anchor}]
+ \begin{forest} for tree={grow'=0,l=2cm,anchor=west,child anchor=west},
+ [root
+ [normal]
+ [none,~no~ edge]
+ [dotted,edge=dotted]
+ [dashed,edge=dashed]
+ [dashed,edge={dashed,red}]
+ ]
+ \end{forest}
+\end{forestexample}
+
+\indexitem({{{{{}}}}}){option>edge label}|=|\meta{toks: \TikZ; code}
+
+When \index{edge path} has its default value, the value of this option is used at the end of
+the edge path specification to typeset a node (or nodes) along the edge.
+
+The packing mechanism is not sensitive to edge labels.
+
+\begin{forestexample}[index={edge label}]
+ \begin{forest}
+ [VP
+ [V,~edge label~={node[midway,left,font=\scriptsize]{head}}]
+ [DP,~edge label~={node[midway,right,font=\scriptsize]{complement}}]
+ ]
+ \end{forest}
+\end{forestexample}
+
+\indexitem{option>edge path}|=|\meta{toks: \TikZ; code}
+ \hfill |\noexpand\path[|\index{forestoption}|{|\index{edge}|}]|\\
+ \mbox{}\hfill |(|\index>{!}|u.|\index{anchor>parent anchor}|)--(.|\index{anchor>child anchor}|)|\index{forestoption}|{|\index{edge label}|};|
+
+This option contains the code that draws the edge from the node to its parent. By default, it
+creates a path consisting of a single line segment between the node's \index{option>child anchor} and
+its parent's \index{option>parent anchor}. Options given by \index{edge} are passed to the path; by
+default, the path is simply drawn. Contents of \index{edge label} are used to potentially place
+a node (or nodes) along the edge.
+
+When specifying the edge path, the values of options \index{edge} and \index{edge label} can be
+used. Furthermore, two anchors, \index{anchor>parent anchor} and \index{anchor>child anchor}, are defined,
+to facilitate access to options \index{option>parent anchor} and \index{option>child anchor} from the \TikZ; code.
+
+The node positioning algorithm is sensitive to edges, i.e.\ it will avoid a node overlapping an
+edge or two edges overlapping. However, the positioning algorithm always behaves as if the
+\keyname{edge path} had the default value --- \emph{changing the \keyname{edge path} does not
+influence the packing!} Sorry. (Parent--child edges can be ignored, however: see option
+\index{ignore edge}.)
+
+\indexitem{node key>edge path'}|=|\meta{toks: \TikZ; code}
+
+Sets \index{edge path}, automatically wrapping the given path by
+|\noexpand\path[\forestoption{edge}]| and |\forestoption{edge label};|.
+
+\indexitem({{{{{}}}}}){option>parent anchor}|=|\meta{toks: \foRest; anchor} (Information also applies to
+option \index{option>child anchor}.)
+
+\FoRest; defines anchors \index{anchor>parent anchor} and
+\index{anchor>child anchor} (which work only for \foRest; and not also \TikZ;
+nodes, of course) to facilitate reference to the desired endpoints of child--parent edges.
+Whenever one of these anchors is invoked, it looks up the value of the \keyname{parent anchor} or
+\keyname{child anchor} of the node named in the coordinate specification, and forwards the request
+to the (\TikZ;) anchor given as the value.
+
+The intended use of the two anchors is chiefly in \index{edge path} specification, but they can
+used in any \TikZ; code.
+\begin{forestexample}[index={anchor>parent anchor,anchor>child anchor,for step,tree},index>={!}]
+ \begin{forest}
+ for tree={~parent anchor~=south,~child anchor~=north}
+ [VP[V][DP]]
+ \path[fill=red] (.parent anchor) circle[radius=2pt];
+ \path[fill=blue] (!1.child anchor) circle[radius=2pt]
+ (!2.child anchor) circle[radius=2pt];
+ \end{forest}
+\end{forestexample}
+
+The empty value (which is the default) is interpreted as in \TikZ;: as an edge to the appropriate
+border point. See also \S\ref{sec:anchors} for a list of additional anchors defined by \foRest;.
+
+\indexitem{node key>no edge} Clears the edge options (\index{edge}|'={}|) and sets \index{ignore
+edge}.
+
+\end{syntax}
+
+\subsubsection{Information about node}
+\label{ref:node-info}
+\label{ref:readonly-options}
+
+The values of these options provide various information about the tree and its nodes.
+
+\begin{syntax}
+\indexitem{node key>alias}|=|\meta{toks}
+\itemnosep
+\indexitem{node key>alias'}|=|\meta{toks} Sets the alias for the node's name.
+
+ Unlike \index{option>name}, \keyname{alias} is \emph{not} an option: you cannot e.g.\ query it's
+ value via a |pgfmath| expression.
+
+ If the given alias clashes with an existing node name, |alias| will yield an error, while |alias'|
+ will silently rename the node with this name to its default value (|node@|\meta{id}).
+
+ Aliases can be used as the \meta{forest node name} part of a relative node name and as the
+ argument to the \index{step>name} step of a node walk. The latter includes the usage
+ as the argument of the \index{for step=\index{step>name}} propagator.
+
+ Technically speaking, \foRest; alias is \emph{not} a \TikZ; alias! However, you can still use
+ it as a ``node name'' in \TikZ; coordinates, since \foRest; hacks \TikZ;'s implicit node
+ coordinate system to accept relative node names; see \S\ref{ref:forest-cs}.
+
+\indexitem{readonly option>id}|=|\meta{count} The internal id of the node.
+
+\indexitem{readonly option>level}|=|\meta{count} The hierarchical level of the node. The root is on level $0$.
+
+\indexitem{readonly option>max x}|=|\meta{dimen} \vspace{-\parskip}
+\indexitem{readonly option>max y}|=|\meta{dimen} \vspace{-\parskip}
+\indexitem{readonly option>min x}|=|\meta{dimen} \vspace{-\parskip}
+\indexitem{readonly option>min y}|=|\meta{dimen}
+ Measures of the node, in the shape's coordinate system
+ \citep[see][\S16.2,\S48,\S75]{tikzpgf2.10} shifted so that the node anchor is at the origin.
+
+ In |pgfmath| expressions, these options are accessible as |max__x|, |max__y|, |min__x| and |min__y|.
+
+\indexitem{readonly option>n}|=|\meta{count} The child's sequence number in the list of its parent's
+ children.
+
+ The enumeration starts with 1. For a geometric root, \keyname{n} equals $0$.
+
+\indexitem{readonly option>n'}|=|\meta{count} Like \index{readonly option>n}, but starts counting at the last child.
+
+ In |pgfmath| expressions, this option is accessible as |n__|.
+
+\indexitem{option>name}|=|\meta{toks} \hfill \texttt{node@}\meta{id}
+\itemnosep
+\indexitem{node key>name'}|=|\meta{toks} Sets the name of the node.
+
+The expansion of \meta{toks} becomes the \meta{forest node name} of the node. The \TikZ; node
+created from the \foRest; node will get the name specified by this option.
+
+Node names must be unique. If a node with the given name already exists, |name| will yield an
+error, while |name'| will silently rename the node with this name to its default (|node@|\meta{id})
+value. Use an empty argument to reset the node's name to its default value.
+
+
+\indexitem{readonly option>n children}|=|\meta{count} The number of children of the node.
+
+ In |pgfmath| expressions, this option is accessible as |n__children|.
+\end{syntax}
+
+
+\subsubsection{Various}
+
+\begin{syntax}
+\indexitem{node key>baseline} The node's anchor becomes the baseline of the whole tree
+ \citep[cf.][\S69.3.1]{tikzpgf2.10}.
+
+ In plain language, when the tree is inserted in your (normal \TeX) text, it will be vertically
+ aligned to the anchor of the current node.
+
+ Behind the scenes, this style sets the alias of the current node to \keyname{forest@baseline@node}.
+ {\tikzexternaldisable
+\begin{forestexample}[index={baseline,use as bounding box'}]
+ Baseline at the
+ \begin{forest}
+ [parent,~baseline~,use as bounding box'
+ [child]]
+ \end{forest}
+ and baseline at the
+ \begin{forest}
+ [parent
+ [child,~baseline~,use as bounding box']]
+ \end{forest}.
+\end{forestexample}}
+
+\indexitem>{tikz key>fit to}|=|\meta{nodewalk} Fits the \TikZ; node to the nodes in the given
+ \meta{nodewalk}.
+
+This key should be used like \keyname{/tikz/fit} of the \TikZ;'s fitting library
+\citep[see][\S34]{tikzpgf2.10}: as an option to \emph{\TikZ;'s} |node| operation, the obvious
+restriction being that \keyname{fit to} must be used in the context of some \foRest; node.
+For an example, see footnote~\ref{fn:fit-to-tree}.
+
+This key works by calling \keyname{/tikz/fit} and providing it with the the coordinates of the
+subtree's boundary.
+
+The \meta{nodewalk} inherits its history from the outer nodewalk (if there is one). Its every-step
+keylist is empty.
+
+\indexitem{node key>get min s tree boundary}|=|\meta{cs} \vspace{-\parskip}
+\indexitem{node key>get max s tree boundary}|=|\meta{cs}
+
+Puts the boundary computed during the packing process into the given \meta{cs}. The boundary is
+in the form of \PGF; path. The |min| and |max| versions give the two sides of the node. For an
+example, see how the boundaries in the discussion of \index{fit} were drawn.
+
+\indexitem{option>label}|=|\meta{toks: \TikZ; node} The current node is labelled by a \TikZ; node.
+
+ The label is specified as a \TikZ; option \texttt{label} \citep[\S16.10]{tikzpgf2.10}.
+ Technically, the value of this option is passed to \TikZ;'s as a late option
+ \citep[\S16.14]{tikzpgf2.10}. (This is so because \foRest; must first typeset the nodes
+ separately to measure them (stage \index{typeset nodes}); the preconstructed nodes are inserted
+ in the big picture later, at stage \index{draw tree}.) Another option with the same
+ technicality is \index{pin}.
+
+\indexitem{option>pin}|=|\meta{toks: \TikZ; node} The current node gets a pin, see
+ \citep[\S16.10]{tikzpgf2.10}.
+¸
+ The technical details are the same as for \index{label}.
+
+
+\indexitem{node key>use as bounding box} The current node's box is used as a bounding box for the
+ whole tree.
+
+ \indexitem{node key>use as bounding box'} Like \index{use as bounding box}, but subtracts the
+ (current) inner and outer sep from the node's box. For an example, see \index{baseline}.
+
+ \indexitem({{{{{}}}}}){option>tikz}|=|\meta{toks: \TikZ; code} ``Decorations.''
+
+ The code given as the value of this option will be included in the |tikzpicture| environment used
+ to draw the tree. By default, the code is included after all nodes of the tree have been drawn,
+ so it can refer to any node of the tree (furthermore, relative node names can be used to refer to
+ nodes of the tree, see \S\ref{ref:relative-node-names}) and the code given to various nodes is
+ appended in a depth-first, parent-first fashion. See \S\ref{sec:draw-tree} for details and
+ customization.
+
+ By default, bracket parser's afterthoughts feed the value of this option. See
+ \index{afterthought}.
+
+\end{syntax}
+
+
+
+\subsection{Nodewalks}
+\label{ref:nodewalks}
+
+A \emph{nodewalk} is a sequence of \emph{steps} describing a path through the tree. Most steps
+are defined relative to the current node, for example \index{step>parent} steps to the parent of the
+current node, and \index{step>n}|=2| steps to the second child of the current node, where ``to make a
+step'' means to change the current node. Thus, nodewalk |parent,_parent,_n=2| describes the path
+which first steps to the parent of the \emph{origin} node, then to its grandparent and finally to
+the second child of the origin's grandparent.
+
+The origin of the nodewalk depends on how the nodewalk is invoked. When used after the \index>{!}
+in a relative node name (\S\ref{ref:relative-node-names}), the origin is the node with the name
+given before \index>{!}; when invoked by a spatial propagator such as \index{for
+ step=\index{nodewalk}} (\S\ref{ref:spatial-propagators}), the origin is the current node; when
+invoked within another (outer) nodewalk, the origin is the current node of the outer nodewalk.
+
+Formally, a \meta{nodewalk} is a list of |pgfkeys| key--value pairs. Steps in a nodewalk are thus
+separated by commas. However, \foRest; also recognizes \emph{short-form} steps, whose names consist
+of a single character and which do not need to be separated by a comma. For example, nodewalk
+|parent,_parent,_n=2| can be concisely written as |uu2|. Long and short forms can be mixed freely,
+like this: |next,_uu2,_previous|.
+
+Besides nodewalk keys, a \meta{nodewalk} can also contain node keys (or
+even \TikZ; keys).\footnote{The precise algorithm for keyname resulotion in nodewalks is as follows.
+\begin{itemize}
+\item First, \foRest; searches for the given \meta{keyname} in the \index{path>forest/nodewalk}
+ path. If found (a long-form step or a nodewalk style), it is executed.
+\item Next, it is checked whether \meta{keyname} is a sequence of short-form steps; is so, they are
+ executed.
+\item Otherwise, \meta{key} is executed in the \keyname{/forest} path. This includes both
+ \foRest;'s and \TikZ;'s keys. The latter are usually forwarded to \TikZ; via \index{node
+ options}.
+\end{itemize}
+There are some clashes between node key and nodewalk step names. For example, \keyname{l} is both a
+\meta{dimen} option and a short form of the step to the last child. According to the rules above,
+the nodewalk step will take precedence in case of a clash. Use nodewalk key \index{options} to
+execute a clashing node key.} These keys do their usual function, but within the context of the
+current node of the nodewalk: |parent, s=2em,| |parent, text=red| sets the parent's |s| to 2em and
+the grandparent's text color to red. It is worth noting that node keys include \index{TeX}, which
+makes it possible to execute any \TeX\ code while nodewalking.
+
+Some steps target a single node, like above-mentioned \index{step>parent} and \index{step>n}.
+Others, called multi-steps, describe mini-walks themselves: for example \index{step>children} visits
+each child of the node in turn, and \index{tree} visits each of the node's descendants (including
+the node itself). The path of many steps is determined by the geometric relations of the tree, or
+the value of some option. However, there are also keys for embedding nodewalks (\index{nodewalk
+ key>nodewalk}, \index{branch}, etc.), saving and loading nodewalks, sorting them, or even
+re-walking the history of steps made (like in a web browser).\footnote{Note that nesting operation
+ (\S\ref{ref:nodewalk-operations}) and history (\S\ref{ref:nodewalk-history}) steps, or embedding
+ nodewalks under these steps doesn't work, for most combinations, as many of them internally
+ manipulate nodewalk history.} Finally, if all this is not enough, you can define your own steps,
+see \S\ref{ref:defining-steps}.
+
+Each nodewalk has an associated \emph{every-step keylist}: a keylist of node keys\footnote{When
+ executing the \index{register>every step} keylist, \foRest; switches into the
+ \index{path>forest} path, which makes it impossible to directly include a nodewalk into the
+ every-step keylist. The reason is performance. Every time a \index{path>forest/nodewalk} key
+ is not found, the short-form nodewalk recognition algorithm is executed, and this algorithm is
+ slow. As \index{register>every step} is used a lot (it is for example used every invocation of
+ every spatial propagator) and the keys in \index{register>every step} are usually node options
+ from \index{path>forest} path, \foRest; would spend way too much time checking if a given node
+ option is actually a short-form nodewalk.
+
+ If you need to execute nodewalk keys within the every-step keylist, use node key \index{node
+ key>Nodewalk}.} which get executed after each step of the nodewalk. The every-step keylist of
+the current nodewalk is contained in register \index{register>every step} and can be changed at any
+point during the nodewalk. Its value at the start of the nodewalk depends on how the nodewalk was
+invoked. In most cases (e.g.\ \index{step>nodewalk} or prefix \index{for step}-based spatial
+propagators), it is given explicitely as an argument to the key that executes the nodewalk.
+However, see \index{step>Nodewalk} option \index{option of=Nodewalk>every step} for information on
+how the every-step keylist of an embedded nodewalk can interact with the every-step keylist of its
+parent nodewalk.
+
+Each nodewalk step can be either \emph{real} or \emph{fake}. Fake steps only change the current
+node. Real steps also trigger execution of the every-step keylist and update of history. Fake
+steps are sometimes useful as a ``computational tool''. They can be introduced explicitely using
+\index{nodewalk key>fake}; some other keys (like several history nodewalk keys,
+\S\ref{ref:nodewalk-history}) introduce fake steps implicitely.
+
+In some cases, the nodewalk might step ``out of the tree''. (Imagine using \index{step>parent} at the
+root of the tree, or \index{readonly option>n}|=42| at a node with less that 42 children.) Our official term will
+be that the nodewalk stepped on an \emph{invalid node}; what happens formally is that the current
+node is changed to the node with \index{readonly option>id}|=0|. Normally, such an event raises an
+error. However, the full story is told by \index{nodewalk key>on invalid}.
+
+Nodewalks can be hard to follow, especially when designing styles. \FoRest; does its best to
+help. First, it logs the nodewalk stack in case of error. Second, if package option
+\index{debug}|=|\index{option of=debug>nodewalks} is given, it logs every step made.
+
+
+\subsubsection{Invoking (embedded) nodewalks}
+\label{ref:embedded-walks}
+
+There are many ways to invoke a nodewalk. For example, several keys, like \index{fit to}, and
+aggregate functions (\S\ref{ref:aggregate-functions}) expect a \meta{nodewalk} argument. This
+section lists keys which can be used to explicitely invoke a nodewalk.
+
+The keys in this section can be used not only as node keys (in fact, not all of them can be used
+so), but also as nodewalk keys. The latter fact means that they can be used to introduce embedded
+nodewalks, which (can) have its own every-step keylist, history and on-invalid mode; for details on
+how these properties of outer and embedded nodewalk can interact, see \index{step>Nodewalk}. There
+is no limit to the depth of nodewalks embedding (nodewalk within nodewalk within nodewalk \dots).
+
+An embedded nodewalk functions as a single, fake step of the outer nodewalk. Specifically, this
+means that, while stepping through the embedded nodewalk, the every-step keylist of the outer
+nodewalk is not executed. Furthermore, by default, modifying the every-step keylist of the inner
+walk (by manipulating register \index{register>every step}) does not influence the outer nodewalk
+(but see option \index{option of=Nodewalk>every step}).
+
+An embedded nodewalk does not count as a (real, every-step keyslist invoking) step of the outer
+nodewalk. After it is finished, there are two options with respect to the new current node of the
+outer nodewalk,\footnote{Even the outermost explicitly invoked nodewalks actually have the outer
+ nodewalk. It is ``static'' in the sense that no real step is ever made in it, but it has all the
+ nodewalk properties --- the current node, \index{register>every step} keylist register, \index{option
+ of=Nodewalk>history} and \index{option of=Nodewalk>on invalid} mode (error) --- which can
+ interact with the embedded nodewalk.} depending on whether the embedded nodewalk was invoked using
+a variant of the key with or without the \index{for step} prefix (all keys in this section have the
+\index{for step} variant).
+\begin{itemize}
+\item For keys \emph{without} the \index{for step} prefix, the current node of the outer nodewalk
+ changes, \emph{via a fake step}, to the final node visited by the embedded nodewalk. This holds
+ even if the final node was reached as a fake step and even if it is invalid
+ (\index{option>id}|=0|). The fake step in the outer nodewalk cannot be made real, not even by
+ \index{nodewalk key>real}: if you want to execute the every-step keylist of the outer nodewalk at
+ the finishing node of the embedded nodewalk, follow the latter by step \index{current}.
+\item For keys \emph{with} the \index{for step} prefix, the current node of the outer nodewalk
+ remains unchanged. For this reason, the \index{for step}-prefixed keys are available as node keys
+ (we call them spatial propagators, \S\ref{ref:spatial-propagators}), while the steps without this
+ prefix are generally not, with the sole exception of \index{step>Nodewalk}, which I advise to use
+ carefully.
+\end{itemize}
+
+All steps described in this section can be prefixed by \index{for step}. All of them, with or
+without this prefix, are available as nodewalk keys. The list of keys from this section which are
+available as node keys: \index{step>Nodewalk}, \index{for step=\index{step>Nodewalk}}, \index{for
+ step=\index{nodewalk}}; you will most often want to use the latter.
+
+
+\begin{syntax}
+\indexitem{step>Nodewalk}|=|\meta{keylist: config}\meta{nodewalk}\meta{keylist: every-step}
+
+ Walks an \meta{nodewalk} starting at the current node.
+
+ This is the most generic form of embedding a nodewalk. Unlike other keys described in this
+ subsection, it can also be used as a node key even without the \index{for step} prefix, but take
+ care as it will, in general, change the current node.
+
+ The \meta{config} argument serves to specify the interaction between the outer and embedded
+ nodewalk. It can contain the following keys:
+
+ \let\outerleftmargin\leftmargin
+ \begin{syntax}
+ \indexitem(independent){option of=Nodewalk>every step}|={|\alternative{independent,inherited,shared}|}|
+ \indexitem(shared){option of=Nodewalk>history}|={|\alternative{independent,inherited,shared}|}|
+
+ The following table shows what happens to the every-step keylist and history depending on the
+ value of \keyname{every step} and \keyname{history}, respectively. State B is \meta{every-step}
+ for every step and empty for history.
+
+ \begin{tabular}{l|ccc}
+ &\keyname{independent}&\keyname{inherited}&\keyname{shared}\\\hline
+ state of the outer nodewalk&A&A&A\\
+ initial state of the inner nodewalk&B&A&A\\
+ \dots\\
+ final state of the inner nodewalk&C&C&C\\
+ state of the outer nodewalk&A&A&C
+ \end{tabular}
+ \end{syntax}
+
+ As shown in the table above, argument \meta{every-step} is used to initialize the
+ embedded nodewalk's every-step keylist when it is independent of the outer nodewalk. In other
+ cases, this argument is ignored (use |{}|).
+
+ \begin{syntax}
+ \indexitem(inherited){option of=Nodewalk>on invalid}|={|\alternative{error,fake,error in real,last valid,inherited}|}|
+
+ Like \index{nodewalk key>on invalid}, but local to this nodewalk. The additional alternative
+ \indexdef{value of=on invalid>inherited} (which is the default) means to retain the current
+ value, regardless of how it was set (by an outer nodewalk, explicit \index{nodewalk key>on
+ invalid}, or the package default, \index{value of=on invalid>error}).
+ \end{syntax}
+
+ \begin{advise}
+ \item Use \index{node key>Nodewalk} if you need to execute nodewalk keys within the every-step
+ keylist.
+ \end{advise}
+
+\begin{forestexample}[index={register>every step}]
+ \begin{forest}
+ for 2=calign with current, for children={for descendants={circle,draw}}
+ [every step,
+ [independent,for nodewalk={
+ 1,Nodewalk={~every step=independent~}{1,every step=fill,1}{},1
+ }{draw=red},
+ [[[[]]]]]
+ [inherited,for nodewalk={
+ 1,Nodewalk={~every step=inherited~}{1,every step=fill,1}{},1
+ }{draw=red},
+ [[[[]]]]]
+ [shared,for nodewalk={
+ 1,Nodewalk={~every step=shared~}{1,every step=fill,1}{},1
+ }{draw=red},
+ [[[[]]]]]]
+ \end{forest}
+\end{forestexample}
+
+
+\begin{forestexample}[index={history,walk back}]
+ \begin{forest}
+ mark/.style={tempcounta+=1,content+/.register=tempcounta,content+={,}},
+ [history:\\effect on the,align=center
+ [inner nodewalk
+ % uncommenting this would result in an error:
+ % [independent, delay={for nodewalk={
+ % tempcounta=0,111,
+ % Nodewalk={history=independent}{walk back=2}{mark,fill=yellow}
+ % }{mark,draw=red}},
+ % [[[]]]]
+ [inherited\\or\\shared, align=center,delay={for nodewalk={
+ tempcounta=0,111,
+ Nodewalk={~history=inherited~}{walk back=2}{mark,fill=yellow}
+ }{mark,draw=red}},
+ [[[]]]]]
+ [outer nodewalk
+ [inherited,delay={for nodewalk={
+ tempcounta=0,111,
+ Nodewalk={~history=inherited~}{11}{mark,fill=yellow},
+ walk back=2
+ }{mark,draw=red}},
+ [[[[[]]]]]]
+ [shared,delay={for nodewalk={
+ tempcounta=0,111,
+ Nodewalk={~history=shared~}{11}{mark,fill=yellow},
+ walk back=2
+ }{mark,draw=red}},
+ [[[[[]]]]]]]]
+ \end{forest}
+\end{forestexample}
+
+\indexitem{step>nodewalk}|=|\meta{nodewalk}\meta{keylist: every-step}
+
+ This key is a shorthand for
+
+ \begin{center}
+ \index{step>Nodewalk}|={|\index{option of=Nodewalk>every step}|=independent,|\index{option
+ of=Nodewalk>history}|=independent,|\index{option of=Nodewalk>on
+ invalid}|=inherited}|\meta{nodewalk}\meta{keylist: every-step}
+ \end{center}
+
+ \begin{advise}
+ \item \index{for step=\index{nodewalk}} is the most common way to explicitely invoke a nodewalk from a
+ node keylist (the keylist immediately following the content of the node).
+ \end{advise}
+
+\indexitem{step>nodewalk'}|=|\meta{nodewalk}
+
+ This key is a shorthand for
+
+ \begin{center}
+ \index{step>Nodewalk}|={|\index{option of=Nodewalk>every step}|=inherited,|\index{option
+ of=Nodewalk>history}|=independent,|\index{option of=Nodewalk>on
+ invalid}|=inherited}|\meta{nodewalk}|{}|
+ \end{center}
+
+ \begin{advise}
+ \item Using this key, it is easy to ``\emph{temporarily} change'' the \index{register>every step}
+ keylist of a nodewalk.
+ \item Using \index{for step=\index{nodewalk'}} is probably the easiest way to make a ``trip''
+ within a nodewalk, i.e.\ walk some steps but return to their origin afterwards.
+ \item This key (with or without the \index{for step} prefix) is not available as a node key --- it
+ would make little sense there, as it has no every-step keylist argument.
+ \end{advise}
+
+\end{syntax}
+
+
+\subsubsection{Single-step keys}
+\label{ref:single-step-keys}
+
+Single-step nodewalk keys visit a single node. The behaviour in the situation when the target node
+does not exist is determined by \index{nodewalk key>on invalid}.
+
+For each single-step key, spatial propagator \index{for step=\meta{step}} is also defined.
+\index{for step=\meta{step}}|=|\meta{keylist} is equivalent to
+\index{for step=\index{nodewalk}}|={|\meta{step}|}{|\meta{keylist}|}|. If the step takes an argument, then its
+\index{for step=\meta{step}} propagator takes two and the argument of the step precedes the
+\meta{keylist}. See also \S\ref{ref:spatial-propagators}.
+
+Linear order below means the order of nodes in the bracket representation, i.e.\ depth-first
+parent-first first-child-first.
+
+\begin{syntax}
+\indexitem{step>current} an ``empty'' step: the current node remains the same\footnote{While it
+ might at first sight seem stupid to have an empty step, this is not the case. For example,
+ using propagator \index{for step=\index{current}} derived from this step, one can process a \meta{keylist} constructed using \index[not index,print format+={result+={\index[not print]{wrap pgfmath arg}\index[not print]{wrap $n$ pgfmath args}}}]{handler>wrap ($n$) pgfmath arg(s)} or \index{wrap value}.}
+\indexitem{step>first} the first child
+\indexitem{step>first leaf}, \indexdef{step>first leaf'} the first leaf (terminal node) of the
+ current node's descendants (|first leaf|) or subtree (|first leaf'|), in the linear order
+\indexitem{step>id}|=|\meta{id} the node with the given id; this step does not depend on the current node
+\indexitem{step>last} the last child
+\indexitem{step>last dynamic node} the last non-integrated (created/removed/replaced) node; see \S\ref{ref:dynamic}
+\indexitem{step>last leaf}, \indexdef{step>last leaf'} the last leaf (terminal node) of the
+ current node's descendants (|last leaf|) or subtree (|last leaf'|), in the linear order
+\indexitem{step>n}|=|$n$ the $n$th child; counting starts at $1$\footnote{Note that \keyname{n}
+ \emph{without} an argument is a short form of \keyname{next}.}
+\indexitem{step>n'}|=|$n$ the $n$th child, starting the count from the last child
+\indexitem{step>name}|=|\meta{name} the node with the given name or alias; this step does not depend on the current node
+\indexitem{step>next} the next sibling
+\indexitem{step>next leaf} the next node (in the linear order) which is a leaf (the current node need not be a leaf)
+\indexitem{step>next node} the next node of the entire tree, in the linear order
+\indexitem{step>next on tier}|=|\meta{tier} the next node (in the linear order) on the given tier; if no tier is given, assume the tier of the current node
+\indexitem{step>origin} the starting node of the nodewalk; note that the starting point does not automatically count as a step: if you want to step on it, use this key (or \index{current}, at the beginning of the nodewalk)
+\indexitem{step>parent} the parent
+\indexitem{step>previous} the previous sibling
+\indexitem{step>previous leaf} the previous node (in the linear order) which is a leaf (the current node need not be a leaf)
+\indexitem{step>previous node} the previous node of the entire tree, in the linear order
+\indexitem{step>previous on tier}|=|\meta{tier} the previous node (in the linear order) on the given tier; if no tier is given, assume the tier of the current node
+\indexitem{step>root} the root node, i.e.\ the ancestor of the current node without the parent; note that this key \emph{does} depend on the current node
+\indexitem{step>root'} the formal root node (see \index{set root} in \S\ref{ref:dynamic}); this key does not depend on the current node
+\indexitem{step>sibling} the sibling
+
+(don't use if the parent doesn't have exactly two children \dots)
+\indexitem{step>to tier}|=|\meta{tier} the first ancestor of the current node (or the node itself) on the given \meta{tier}
+\end{syntax}
+
+
+\subsubsection{Multi-step keys}
+\label{ref:multi-step-keys}
+
+Multi-step keys visit several nodes, in general. If a multi-step key visits no nodes, the current
+node remains unchanged.
+
+For each multi-step key, spatial propagator \index{for step=\meta{step}} is also defined, see
+\S\ref{ref:spatial-propagators}.
+
+Many of the keys below have a |reversed| variant. Those keys reverse the order of \emph{children}.
+Note that in general, this differs from operation key \index{reverse}, which reverses the order of
+the entire embedded nodewalk.
+
+Linear order below means the order of nodes in the bracket representation, i.e.\ depth-first
+parent-first first-child-first.
+
+\begin{syntax}
+ \indexitem{step>children}, \indexdef{step>children reversed}
+
+ Visit all the children of the current
+ node.
+
+\indexitem{step>tree}, \indexdef{step>tree reversed}
+ \itemnosep
+\indexitem{step>tree children-first}, \indexdef{step>tree children-first reversed}
+ \itemnosep
+\indexitem{step>tree breadth-first}, \indexdef{step>tree breadth-first reversed}
+
+ Visit the current node and all its descendants.
+
+ The above keys differ in the order the nodes are visited. The basic key, \keyname{tree},
+ traverses the nodes in the depth-first, parent-first first-child-first order, i.e.\ the order in
+ which they are given in the bracket representation: so it visits the parent before its children and
+ it visits the children from the first to the last.
+
+ |reversed| variants reverse the order of \emph{children}, visiting them from the last to the first
+ (from the viewpoint of the bracket representation).
+
+ |children-first| variants visit the children before the parent.
+
+ |breadth-first| variants behave like |level| steps below: they first visit level |0| nodes, then
+ level |1| nodes etc.
+
+ \begin{forestexample}[index={}]
+ \forestset{
+ enumerate/.style={
+ tempcounta=1,
+ for #1={
+ content/.pgfmath=tempcounta,
+ tempcounta+=1
+ }
+ }
+ }
+ \newcommand\enumtree[1]{%
+ \begin{forest}
+ [#1,l sep=0,for n=1{
+ l=0,no edge,delay={enumerate=#1}}
+ [[[[][]][[][]]][[[][]]]]
+ ]
+ \end{forest}
+ }
+ \renewcommand\arraystretch{2}
+ \begin{tabular}{cc}
+ \enumtree{tree}&
+ \enumtree{tree reversed}\\
+ \enumtree{tree children-first}&
+ \enumtree{tree children-first reversed}\\
+ \enumtree{tree breadth-first}&
+ \enumtree{tree breadth-first reversed}
+ \end{tabular}
+ \end{forestexample}
+
+\indexitem{step>descendants}, \indexdef{step>descendants reversed}
+ \itemnosep
+\indexitem{step>descendants children-first}, \indexdef{step>descendants children-first reversed}
+ \itemnosep
+\indexitem{step>descendants breadth-first}, \indexdef{step>descendants breadth-first reversed}
+
+ Visit all the descendants of the current node.
+
+ Like the |tree| keys, but the current node is not visited.
+
+\indexitem[print form+=\spaces{9}]{step>relative level<},
+ \indexdef[print form+=\spaces{9}]{step>relative level},
+ \indexdef[set={form=relative level\protect\greaterthan}]{step>relative levelGT}\texttt{\spaces{9}}|=|\meta{count}
+ \itemnosep
+\indexitem{step>relative level reversed<},
+ \indexdef{step>relative level reversed},
+ \indexdef[set={form=relative level reversed\protect\greaterthan}]{step>relative level reversedGT}|=|\meta{count}
+ \itemnosep
+\indexitem[print form+=\spaces{9},+print form=\spaces{9}]{step>level<},
+ \indexdef[print form+=\spaces{9},+print form=\spaces{9}]{step>level},
+ \indexdef[set={form=level\protect\greaterthan},+print form=\spaces{9}]{step>levelGT}\texttt{\spaces{9}}|=|\meta{count}
+ \itemnosep
+\indexitem[+print form=\spaces{9}]{step>level reversed<},
+ \indexdef[+print form=\spaces{9}]{step>level reversed},
+ \indexdef[set={form=level reversed\protect\greaterthan},+print form=\spaces{9}]{step>level reversedGT}|=|\meta{count}
+
+ Visits the nodes in the subtree of the current node whose level (depth) is less than \emph{or
+ equal to}, equal to, or greater than \emph{or equal to} the given level.
+
+ The |relative| variants consider the level as relative to the current node: relative level of the
+ current node is $0$; relative level of its children is $1$, of its grandchildren $2$, etc. The
+ absolute variants consider the depth with respect to the (geometric) root, i.e.\ as returned by
+ node option \index{readonly option>level}.
+
+ The nodes are traversed in the breadth-first order. The |reversed| variants reverse the order of
+ the children within each level, but the levels are still traversed from the highest to the
+ deepest.
+
+\indexitem{step>leaves}
+
+ Visits all the leaves in the current node's subtree.
+
+\indexitem[index key={level-}]{step>-level}|=|\meta{count}
+\itemnosep
+\indexitem[index key={level-'}]{step>-level'}|=|\meta{count}
+
+Visits all the nodes \meta{count} levels above the leaves in the current node's subtree.
+
+\indexitem[+print form=\spaces{12},print form+=\spaces{9}]{step>preceding siblings}\quad\quad
+ \indexdef[+print form=\spaces{12}]{step>following siblings}%
+ \itemnosep
+\indexitem[print form+=\spaces{9}]{step>current and preceding siblings}\quad\quad
+ \indexdef{step>current and following siblings}%
+ \itemnosep
+\indexitem[+print form=\spaces{12}]{step>preceding siblings reversed}\quad\quad
+ \indexdef[+print form=\spaces{12}]{step>following siblings reversed}%
+ \itemnosep
+\indexitem{step>current and preceding siblings reversed}\quad\quad
+ \indexdef{step>current and following siblings reversed}%
+ \itemnosep
+\indexitem[+print form=\spaces{22},print form+=\spaces{9}]{step>siblings}%
+ \itemnosep
+\indexitem[print form={current and \spaces{9} siblings\spaces{9}}]{step>current and siblings}%
+ \itemnosep
+\indexitem[+print form=\spaces{22},print form+=\spaces{9}]{step>siblings reversed}%
+ \itemnosep
+\indexitem[print form={current and \spaces{9} siblings reversed}]{step>current and siblings reversed}%
+
+Visit preceding, following or all siblings; visit the current node as well or not; visit in normal
+or reversed order.
+
+\indexitem{step>ancestors}
+ \itemnosep
+\indexitem{step>current and ancestors}
+
+Visit the ancestors of the current node, starting from the parent/current node, ending at the root node.
+
+\indexitem[+print form=\spaces{12}]{step>preceding nodes}\quad\quad
+ \indexdef[+print form=\spaces{12}]{step>following nodes}%
+ \itemnosep
+\indexitem{step>current and preceding nodes}\quad\quad
+ \indexdef{step>current and following nodes}%
+
+Visit all preceding or following nodes of the entire tree, in the linear order; visit the current node as well or not.
+
+\end{syntax}
+
+
+\subsubsection{Operations}
+\label{ref:nodewalk-operations}
+
+Generally speaking, nodewalk operations take an \emph{input nodewalk} and transform it into
+an \emph{output nodewalk}, while possibly also having side effects.
+
+The most important categorization of operations is in terms of the input nodewalk:
+\begin{itemize}
+\item ``Normal'' keys execute the input nodewalk ``invisibly'', i.e.\ with a every-step keylist that
+ is initially empty. However, even such an ``invisible'' nodewalk might not always be completely
+ without effect. For example, the effects of any node keys contained in the input nodewalk or
+ modifications of its (initially empty) every-step keylist will be felt.
+\item Most of the operation keys have the |walk_and_...| variant, where input given nodewalk is meant to
+ be ``visible'': it is walked directly in the context of the invoking nodewalk (specifically, with
+ its every-step keylist in effect).
+\item Some operation keys have the |..._in_nodewalk| variant, which operates on the portion of the
+ current nodewalk that was already walked.
+\item \index{load} has no input nodewalk.
+\end{itemize}
+All operation keys except |..._in_nodewalk| variants can be prefixed by \index{for step} to create a
+spatial propagator (\S\ref{ref:spatial-propagators}).
+
+The output nodewalk is always walked in the context of the invoking nodewalk. However, note that,
+as mentioned above, in the case of |walk_and_...| variants, that context can be changed during the
+execution of the input nodewalk.
+
+Trivia: \index{save} is the only operation with no output nodewalk and also the only operation with
+a ``side effect'' (of saving the nodewalk, obviously).
+
+For some operations (\index{filter} and \index{branch}), the every-step keylist contains instructions
+on how collect the relevant information. While you can safely append and prepend to
+\index{register>every step} keylist of their input nodewalk, you should not completely rewrite
+it. If you want the operations to actually work, of course.
+
+\begin{syntax}
+\indexitem{step>group}|=|\meta{nodewalk}
+
+ Treat \meta{nodewalk} as a single step of the (outer) nodewalk, i.e.\ the outer every-step keylist
+ is executed only at the end of the embedded nodewalk. The embedded \meta{nodewalk} inherits
+ history from the outer nodewalk. Using this key is equivalent to writing
+ \begin{center}
+ \index{step>Nodewalk}|={|\index{option of=Nodewalk>every step}|=independent,|\index{option
+ of=Nodewalk>history}|=inherited}|\meta{nodewalk}|{}, current|
+ \end{center}
+
+
+ \indexitem{step>reverse}|=|\meta{nodewalk}
+ \itemnosep
+ \indexitem{step>walk and reverse}|=|\meta{nodewalk}
+
+ Visits the nodes of the given \meta{nodewalk} in the reversed order.
+
+
+ \indexitem{step>unique}|=|\meta{nodewalk}
+
+ Walks the \meta{nodewalk}, but visits each node at most once.
+
+
+\indexitem{step>filter}|=|\meta{nodewalk}\index{forestmath=condition}
+
+Visit the nodes of the given \meta{nodewalk} for which the given \meta{condition} is true.
+
+ \begin{advise}
+ \item You can safely append and prepend to \index{register>every step} keylist during the input
+ \meta{nodewalk}, but you should not completely rewrite it.
+ \end{advise}
+
+
+\indexitem{step>branch}|={|\meta{nodewalk$_1$}|,...,|\meta{nodewalk$_n$}|}|
+ \itemnosep
+\indexitem{step>branch'}|={|\meta{nodewalk$_1$}|,...,|\meta{nodewalk$_n$}|}|
+
+Visit the nodes in a ``cartesian product'' of any number of nodewalks, where a cartesian product is
+defined as a nodewalk where at every step of \meta{nodewalk$_i$} ($1\leq i<n$),
+\meta{nodewalk$_{i+1}$} is executed.
+
+The |branch| variant visits only the nodes visited by the innermost nodewalk, \meta{nodewalk$_n$}.
+The |branch'| variant visits the nodes visited by all the nodewalks of the product,
+\meta{nodewalk$_1$} \dots\ \meta{nodewalk$_n$}.
+
+For an example of each, see \index{c-commanded} and \index{c-commanders} from the
+\reflibrary{linguistics} library.
+
+ \begin{advise}
+ \item You can safely append and prepend to \index{register>every step} keylists during the input
+ \meta{nodewalk}s, but you should not completely rewrite them.
+ \end{advise}
+
+
+ \indexitem{step>save}|=|\meta{toks: name}\meta{nodewalk}
+ \itemnosep
+ \indexitem{step>walk and save}|=|\meta{toks: name}\meta{nodewalk}
+
+ Saves the given \meta{nodewalk} under the given name.
+
+ \indexitem{step>save append}|=|\meta{toks: name}\meta{nodewalk}
+ \itemnosep
+ \indexitem{step>save prepend}|=|\meta{toks: name}\meta{nodewalk}
+ \itemnosep
+ \indexitem{step>walk and save append}|=|\meta{toks: name}\meta{nodewalk}
+ \itemnosep
+ \indexitem{step>walk and save prepend}|=|\meta{toks: name}\meta{nodewalk}
+
+ Appends/prepends the given \meta{nodewalk} to nodewalk \meta{name}.
+
+ \indexitem{step>load}|=|\meta{toks: name} Walks the nodewalk saved under the given name.
+
+ Note that it is node \index{readonly option>id}s that are saved: loading a named nodewalk with in a context of
+ a different current node, or even with a tree whose geometry has changed (see \S\ref{ref:dynamic})
+ will still visit exactly the nodes that were visited when the nodewalk was saved.
+
+
+ \indexitem{step>sort}|=|\meta{nodewalk}
+ \itemnosep
+ \indexitem{step>sort'}|=|\meta{nodewalk}
+ \itemnosep
+ \indexitem{step>walk and sort}|=|\meta{nodewalk}
+ \itemnosep
+ \indexitem{step>walk and sort'}|=|\meta{nodewalk}
+
+ Walks the nodes of the nodewalk in the order specified by the last invokation of \index{sort
+ by}. The \keyname{sort} variants sort in the ascending order, the \keyname{sort'} variants in
+ the descending order. The \keyname{walk and sort} variants first visit the nodes in the order
+ specified by the given \meta{nodewalk}.
+
+ \indexitem{node key>sort by}|={|\index{forestmath}|,|\dots|,|\index{forestmath}|}|
+
+ Sets the sorting order used by all keys comparing nodes: \index{step>sort}, \index{step>min}
+ and \index{step>max} key families in the nodewalk namespace, and the \index{dynamic
+ tree>sort} key family in the option namespace (dynamic tree).
+
+ For each node being ordered, an ``$n$-dimensional coordinate'' is computed by evaluating the given
+ list of |pgfmath| expressions in the context of that node.\footnote{Don't worry, lazy evaluation
+ is used.} Nodes are then ordered by the usual sort order for multi-dimensional arrays: the
+ first item is the most important, the second item is the second most important, etc.
+
+ Simply put, if you want to sort first by the number of children and then by content, say
+ |sort_by={|\index[+print format=pgfmath]{n children}|,_|\index{content}|}|.
+
+ In the simplest case, the given \index{forestmath} expressions are simply node options. However, as
+ any |pgfmath| expression is allowed in the sort key, you can easily sort by the product of the
+ content of the current node and the content of its first child:
+ |sort_by={|\index{content}|()*|\index{content}|("|\index>{!}|1")|.
+
+ To sort alphabetically, one must use the argument processor (\S\ref{ref:argument-processor}) to
+ specify the sort order. In particular, the key must be marked as text using \index{processor>t}.
+ The first example below shows a simple alphabetical sort by content; the second sorts the
+ filenames by suffix first (in the ascending order) and then by the basename (in the descending
+ order, see \index{processor>-}).
+
+\begin{forestexample}
+ \begin{forest}
+ [,phantom,grow'=0,for children={anchor=west,child anchor=west},s sep=0,
+ delay={~sort by=>O+t{content},sort~}
+ [example.tex][example.pdf][example.log][example.aux]
+ [thesis.tex][thesis.pdf][thesis.log][thesis.aux][thesis.toc]
+ ]
+ \end{forest}
+\end{forestexample}
+
+\begin{forestexample}
+ \begin{forest}
+ declare toks={basename}{},
+ declare toks={extension}{},
+ [,phantom,grow'=0,for children={anchor=east},s sep=0,
+ delay={
+ for children={split option={content}{.}{basename,extension}},
+ ~sort by={>O+t{extension},>O+t-{basename}}~,
+ ~sort~,
+ }
+ [example.tex][example.pdf][example.log][example.aux]
+ [thesis.tex][thesis.pdf][thesis.log][thesis.aux][thesis.toc]
+ ]
+ \end{forest}
+\end{forestexample}
+
+\indexitem{step>min}|=|\meta{nodewalk}, \indexdef{step>max}|=|\meta{nodewalk}
+ \itemnosep
+ \indexitem{step>walk and min}|=|\meta{nodewalk}, \indexdef{step>walk and max}|=|\meta{nodewalk}
+ \itemnosep
+ \indexitem{step>mins}|=|\meta{nodewalk}, \indexdef{step>maxs}|=|\meta{nodewalk}
+ \itemnosep
+ \indexitem{step>walk and mins}|=|\meta{nodewalk}, \indexdef{step>walk and maxs}|=|\meta{nodewalk}
+
+
+ Visit the node(s) in the given \meta{nodewalk} with a minimum/maximum value with
+ respect to the sort order previously specified by \index{sort by}.
+
+ Variants \keyname{mins}/\keyname{maxs} visit all the nodes that with the minimum/maximum value of
+ the sorting key; variants \keyname{min}/\keyname{max} visit only the first such node (first in the order specified by the given nodewalk).
+
+ \indexitem{step>min in nodewalk}, \indexdef{step>max in nodewalk}
+ \itemnosep
+ \indexitem{step>mins in nodewalk}, \indexdef{step>maxs in nodewalk}
+ \itemnosep
+ \indexitem{step>min in nodewalk'}, \indexdef{step>max in nodewalk'}
+
+ These keys search for the minimum/maximum among the nodes that were already visited in the current
+ nodewalk.
+
+ Keys \keyname{mins in nodewalk} and \keyname{maxs in nodewalk} visits all nodes that reach the minimum/maximum, while keys \keyname{min in nodewalk} and \keyname{max in nodewalk} variants visit only the first such node.
+
+ Keys \keyname{min in nodewalk'} and \keyname{max in nodewalk'} visit the first minimal/maximal
+ node by moving back in the history, see \index{back}.
+
+
+\end{syntax}
+
+\subsubsection{History}
+\label{ref:nodewalk-history}
+
+\FoRest; keeps track of nodes visited in a nodewalk and makes it possible to revisit them, in a
+fashion similar to clicking the back and forward button in a web browser.
+
+These keys cannot be prefixed by \index{for step}.
+
+\begin{syntax}
+ \indexitem{step>back}|=|\meta{count: n}
+ \itemnosep
+ \indexitem{step>jump back}|=|\meta{count: n}
+ \itemnosep
+ \indexitem{step>walk back}|=|\meta{count: n}
+
+ Move $n$ steps back in the history. In the \keyname{back} variant, all steps are fake; in
+ the \keyname{jump back} variant, the final step is real; and in the \keyname{walk back} variant,
+ all steps are real.
+
+ Note that as the origin is not a part of the history, these keys will \emph{not} step there
+ (unless \index{current} was the first step of your nodewalk). (Use \index{origin} to move
+ to the origin of the nodewalk.)
+
+ \indexitem{step>forward}|=|\meta{count: n}
+ \itemnosep
+ \indexitem{step>jump forward}|=|\meta{count: n}
+ \itemnosep
+ \indexitem{step>walk forward}|=|\meta{count: n}
+
+ Move $n$ steps forward in the history. In the \keyname{forward} variant, all steps are fake; in
+ the \keyname{jump forward} variant, the final step is real; and in the \keyname{walk forward} variant,
+ all steps are real.
+
+\indexitem{node key>save history}|=|\meta{toks: back name}\meta{toks: forward name}
+
+Saves the backwards and forwards history under the given names. (Load them using \index{load}.) The
+backwards history is saved in the reverse order of how it was walked, i.e.\ outward from the
+perspective of the current position in the nodewalk.
+\end{syntax}
+
+
+\subsubsection{Miscellaneous}
+\label{ref:nodewalk-miscellaneous}
+
+The following nodewalk keys are not steps. Rather, they influence the behaviour of nodewalk steps in
+various ways. The keys in this section having \meta{nodewalk} arguments do not start a new nodewalk
+in the sense of \S\ref{ref:embedded-walks}; the given nodewalk steps rather become a part of the
+current nodewalk.
+
+\begin{syntax}
+\indexitem{register>every step}|=|\meta{keylist} Contains the every-step keylist of the current
+ nodewalk.
+
+\indexitem{nodewalk key>fake}|=|\meta{nodewalk}
+ \itemnosep
+\indexitem{nodewalk key>real}|=|\meta{nodewalk}
+
+ The \meta{nodewalk} embedded under |fake| consists of ``fake'' steps: while
+ the current node is changed, every-step keylist is not executed and the history is not updated.
+
+ Note that these keys do not introduce an embedded nodewalk. The given \meta{nodewalk} will not
+ have its own history and every-step keylist.
+
+ |real| undoes the effect of |fake|, but cannot make real the implicitely fake steps, such as the
+ return to the origin in spatial propagators like \index{for step=\index{nodewalk}}.
+ |fake| and |real| can be nested without limit.
+
+\indexitem{step>last valid}
+ \itemnosep
+\indexitem{step>last valid'}
+
+ If the current node is valid, these keys do nothing. If the current node of the nodewalk is
+ invalid (i.e.\ its \index{readonly option>id} is $0$), they step to the last valid visited node. If
+ there was no such node, they step to the origin of the nodewalk.
+
+ The variant \emph{without} |'| makes a fake step. More precisely, it behaves as if both
+ \index{nodewalk key>fake} and \index{nodewalk key>on invalid}|=fake| are in effect.
+
+\indexitem{nodewalk key>on invalid}|={|\alternative{error,fake,step}|}|\meta{nodewalk}
+
+ This key determines what should happen if a nodewalk step landed on the invalid node, i.e.\ the node
+ with \index{readonly option>id}|=0|.
+
+ There is a moment within the step when the current node is changed but the step itself is not yet
+ really done, is ``still fake'', i.e.\ the history is not yet updated and the every-step keylist is
+ not yet executed. If the new current node is invalid, this key determines what should happen next.
+
+ \let\outerleftmargin\leftmargin
+ \begin{syntax}
+ \item |on invalid={|\indexdef{value of=on invalid>error}|}|\meta{nodewalk} produces an error;
+ \item |on invalid={|\indexdef{value of=on invalid>fake}|}|\meta{nodewalk} does nothing: history is
+ not updated and the every-step keylist is not executed, thus making the step essentialy fake;
+ \item |on invalid={|\indexdef{value of=on invalid>error if real}|}|\meta{nodewalk} produces an
+ error unless \index{nodewalk key>fake} is in effect.
+ \item |on invalid={|\indexdef{value of=on invalid>last valid}|}|\meta{nodewalk} returns to the
+ last valid node, by making a fake step, like \index{step>last valid}.
+ \end{syntax}
+
+ Loops with the implicit |id=0| condition (\S\ref{ref:loops}) automatically switch to
+ |on_invalid=fake| mode.
+
+ See also \index{step>Nodewalk} option \index{option of=Nodewalk>on invalid}.
+
+\indexitem{nodewalk key>options}=\meta{keylist: node keys}
+
+ Execute the given node options in the context of the current node.
+
+ There is not much need to use this key, as any keys that are not (long) steps or sequences of
+ short steps are automatically used as \foRest; node options any way, but there are still usage
+ cases, for example whenever the names of node options and (long) steps are the same, or in a style
+ that wants to ensure there is no overlap.
+
+\indexitem{nodewalk key>strip fake steps}|=|\meta{nodewalk}
+
+ If \meta{nodewalk} ends with fake steps, return to the last node current before those steps were made. For details, see \index{define long step}.
+
+\end{syntax}
+
+
+\subsubsection{Short-form steps}
+\label{ref:short-form-steps}
+
+All short forms of steps are one token long. When using them, there is no need to separate them by
+commas. Here's the list of predefined short steps and their corresponding long-form steps.
+
+\begin{syntax}
+\indexitem{short step>1}, \indexdef{short step>2}, \indexdef{short step>3}, \indexdef{short step>4}, \indexdef{short step>5}, \indexdef{short step>6}, \indexdef{short step>7}, \indexdef{short step>8}, \indexdef{short step>9} the first, \dots, ninth child --- \index{readonly option>n}|=1|,\dots,|,9|
+\indexitem{short step>l} the last child --- \index{step>last}
+\indexitem{short step>u} the parent (up) --- \index{step>parent}
+\indexitem{short step>p} the previous sibling --- \index{previous}
+\indexitem{short step>n} the next sibling --- \index{next}
+\indexitem{short step>s} the sibling --- \index{sibling}
+\indexitem{short step>P} the previous leaf --- \index{previous leaf}
+\indexitem{short step>N} the next leaf --- \index{next leaf}
+\indexitem{short step>F} the first leaf --- \index{first leaf}
+\indexitem{short step>L} the last leaf --- \index{last leaf}
+\indexitem[set={index key={<GT},form=\protect\greaterthan}]{short step>GT}
+ the next node on the current tier --- \index{next on tier}
+\indexitem{short step><} the previous node on the current tier --- \index{previous on tier}
+\indexitem{short step>c} the current node --- \index{current}
+\indexitem{short step>o} the origin --- \index{origin}
+\indexitem{short step>r} the root node --- \index{root}
+\indexitem{short step>R} the formal root node --- \index{root'}
+\indexitem{short step>b} back one fake step in history --- \index{back}|=1|
+\indexitem{short step>f} forward one fake step in history --- \index{forward}|=1|
+\indexitem{short step>v} last valid node in the current nodewalk, fake version --- \index{step>last valid}
+\indexitem{short step>*}\meta{count: n}\meta{keylist} repeat keylist $n$ times --- \index{repeat}|=|\meta{count: n}\meta{keylist}
+\item {\rstyle $\{$}\meta{keylist}{\rstyle $\}$} put keylist in a group --- \index{group}|=|\meta{keylist}
+\end{syntax}
+
+\subsubsection{Defining steps}
+\label{ref:defining-steps}
+
+You can define your own steps, both long and short, or even redefine predefined steps. Note,
+though, that it is not advisable to redefine long steps, as their definitions are interdependent;
+redefining short steps is always ok, however, as they are never used in the code of the package.
+
+\begin{syntax}
+\indexitem{node key>define long step}|=|\meta{name}\meta{options}\meta{nodewalk}
+
+ Define a long-form step named \meta{name} as equivalent to \meta{nodewalk}. \meta{options} control the exact behaviour or the defined step.
+
+ \let\outerleftmargin\leftmargin
+ \begin{syntax}
+ \item\indexdef{option of=define long step>n args}|=|\meta{number}\hfill |0|
+ \item\indexdef{option of=define long step>make for}|=|\meta{boolean}\hfill |true|
+
+ Should we make a \index{for step} prefix for the step?
+ \item\indexdef{option of=define long step>strip fake steps}|=|\meta{boolean}\hfill |true|
+
+ Imagine that \meta{nodewalk} ends with fake steps. Now, fake steps are usually just a computational tool, so we normally wouldn't want the current node after the walk to be one of them. As far as the outer world is concerned, we want the node to end at the last real step. However, simply appending \index{step>last valid} to our style will not work. Imagine that the nodewalk results in no steps. In this case, we'd want to remain at the origin of our empty nodewalk. However, imagine further that the (outer) step just before the empty nodewalk was fake. Then \index{step>last valid} will not step to the correct node: instead of staying at the origin, it will go to the node that the last real step prior to our nodewalk stepped to. In case there was no such real step, we'd even step to the invalid node (normally getting an error).
+
+ Defining the step using |strip fake steps| ensures the correct behaviour described
+ above. Set |strip fake steps=false| only when the fake steps at the end of the nodewalk are
+ important to you.
+
+ \begin{advise}
+ \item See also nodewalk key \index{nodewalk key>strip fake steps}.
+ \end{advise}
+
+ \end{syntax}
+
+\begin{forestexample}[index={define long step,option of=define long step>n args,conditional>if,step>n,while,readonly option>n,next}]
+ \forestset{
+ ~define long step~={children from to}{n args=2}{
+ if={#1>#2}{}{n=#1,while={n()<#2}{next}}
+ }
+ }
+ \begin{forest}
+ for children from to={2}{5}{draw}
+ [root[1][2][3][4][5][6]]
+ \end{forest}
+\end{forestexample}
+
+
+\indexitem{node key>define short step}|=|\meta{token: short step}\meta{n args}\meta{nodewalk}
+
+Define short step taking $n$ arguments as the given \meta{nodewalk}. Refer to the arguments in the usual way, via |#1|, \dots.
+
+To (re)define braces, |{}|, write |define short step={group}{1}{...}|.
+
+\indexitem{handler>nodewalk style}|=|\meta{nodewalk}
+
+\meta{nodewalk key}|/.nodewalk style=|\meta{nodewalk} is a shorthand for\\
+|for_nodewalk={|\meta{nodewalk key}|/.style=|\meta{nodewalk}|}{}|.
+
+\end{syntax}
+
+
+\subsection{Conditionals}
+\label{ref:conditionals}
+
+All conditionals take arguments \meta{true keylist} and \meta{false keylist}. The interpretation of
+the keys in these keylists depends on the environment the conditional appears in. If it is a part
+of a nodewalk specification, the keys are taken to be nodewalk keys (\S\ref{ref:nodewalks}),
+otherwise node keys (\S\ref{ref:node-keys}).
+
+All the conditionals can be nested safely.
+
+\begin{syntax}
+\indexitem{conditional>if}|=|\index{forestmath=condition}\meta{true keylist}\meta{false keylist}
+
+ If \index{forestmath=condition} evaluates to |true| (non-zero), \meta{true keylist} is processed (in
+ the context of the current node); otherwise, \meta{false keylist} is processed.
+
+ For a detailed description of |pgfmath| expressions, see \cite[part VI]{tikzpgf2.10}. (In short:
+ write the usual mathematical expressions.)
+
+ In the following example, \index{conditional>if} is used to orient the arrows from the smaller
+ number to the greater, and to color the odd and even numbers differently. (Style |random_tree| is
+ defined in the front page example.)
+
+\forestset{random tree/.style n args={3}{% #1=max levels, #2=max children, #3=max content
+ content/.pgfmath={random(0,#3)},
+ if={#1>0}{repeat={random(0,#2)}{append={[,random tree={#1-1}{#2}{#3}]}}}{}}}
+\begin{forestexample}[index={before typesetting nodes,for step,descendants,conditional>if,content,edge,edge label,tree},index>={!},point=if]
+ \pgfmathsetseed{314159}
+ \begin{forest}
+ before typesetting nodes={
+ for descendants={
+ if={content()>content("!u")}{edge=->}{
+ if={content()<content("!u")}{edge=<-}{}},
+ edge label/.wrap pgfmath arg=
+ {node[midway,above,sloped,font=\scriptsize]{+#1}}
+ {int(abs(content()-content("!u")))}
+ },
+ for tree={circle,if={mod(content(),2)==0}
+ {fill=yellow}{fill=green}}
+ }
+ [,random tree={3}{3}{100}]
+ \end{forest}
+\end{forestexample}
+
+
+
+
+\indexitem{word prefix=option>conditional>if=\meta{option}}|=|\meta{value}\meta{true keylist}\meta{false keylist}
+
+This simple conditional is defined for every \meta{option} (except boolean options, see below): if
+\meta{value} equals the value of the option at the current node, \meta{true keylist} is executed;
+otherwise, \meta{false keylist}.
+
+\indexitem{word prefix=boolean option>conditional>if=\meta{boolean option}}|=|\meta{true keylist}\meta{false keylist}
+
+ Execute \meta{true keylist} if \meta{boolean option} is true; otherwise, execute \meta{false
+ keylist}.
+
+\indexitem{word prefix=toks option>conditional>if in=\meta{toks option}}|=|\meta{toks}\meta{true keylist}\meta{false
+ keylist}
+
+ Checks if \meta{toks} occurs in the option value; if it does, \meta{true keylist} are executed,
+ otherwise \meta{false keylist}.
+
+ This conditional is defined only for \meta{toks} options, see \S\ref{sec:option-setting}.
+
+
+
+\indexitem[set={
+ index format={result=if \protect\meta{dimen option}\protect\greaterthan,pgfkey},
+ print format={result/.option=argument,+result={if\ },result+={>}, pgfkey},
+}]{conditional>if dimen GT=\protect\meta{dimen option}}|=|\meta{value}\meta{true keylist}\meta{false keylist}
+\itemnosep
+\indexitem[set={
+ index format={result=if \protect\meta{dimen option}<,pgfkey},
+ print format={result/.option=argument,+result={if\ },result+={<}, pgfkey},
+}]{conditional>if dimen LT=\protect\meta{dimen option}}|=|\meta{value}\meta{true keylist}\meta{false keylist}
+\itemnosep
+\indexitem[set={
+ index format={result=if \protect\meta{count option}\protect\greaterthan,pgfkey},
+ print format={result/.option=argument,+result={if\ },result+={>}, pgfkey},
+}]{conditional>if count GT=\protect\meta{count option}}|=|\meta{value}\meta{true keylist}\meta{false keylist}
+\itemnosep
+\indexitem[set={
+ index format={result=if \protect\meta{count option}<,pgfkey},
+ print format={result/.option=argument,+result={if\ },result+={<}, pgfkey},
+}]{conditional>if count LT=\protect\meta{count option}}|=|\meta{value}\meta{true keylist}\meta{false keylist}
+\itemnosep
+\indexitem[set={
+ index format={result=if \protect\meta{dimen register}\protect\greaterthan,pgfkey},
+ print format={result/.option=argument,+result={if\ },result+={>}, pgfkey},
+}]{conditional>if dimen register GT=\protect\meta{dimen register}}|=|\meta{value}\meta{true keylist}\meta{false keylist}
+\itemnosep
+\indexitem[set={
+ index format={result=if \protect\meta{dimen register}<,pgfkey},
+ print format={result/.option=argument,+result={if\ },result+={<}, pgfkey},
+}]{conditional>if dimen register LT=\protect\meta{dimen register}}|=|\meta{value}\meta{true keylist}\meta{false keylist}
+\itemnosep
+\indexitem[set={
+ index format={result=if \protect\meta{count register}\protect\greaterthan,pgfkey},
+ print format={result/.option=argument,+result={if\ },result+={>}, pgfkey},
+}]{conditional>if count register GT=\protect\meta{count register}}|=|\meta{value}\meta{true keylist}\meta{false keylist}
+\itemnosep
+\indexitem[set={
+ index format={result=if \protect\meta{count register}<,pgfkey},
+ print format={result/.option=argument,+result={if\ },result+={<}, pgfkey},
+}]{conditional>if count register LT=\protect\meta{count register}}|=|\meta{value}\meta{true keylist}\meta{false keylist}
+
+If the current value of the dimen/count option/register is greater/less than or equal to
+\meta{value}, execute \meta{true keylist}; else, execute \meta{false keylist}.
+
+
+\indexitem{conditional>if nodewalk valid}|=|\meta{keylist: test nodewalk}\meta{true keylist}\meta{false keylist}
+
+ If the test nodewalk finished on a valid node, \meta{true keylist} is processed (in the context of
+ the current node); otherwise, \meta{false keylist} is processed.
+
+\indexitem{conditional>if nodewalk empty}|=|\meta{keylist: test nodewalk}\meta{true keylist}\meta{false keylist}
+
+ If the test nodewalk contains no (real) steps, \meta{true keylist} is processed (in the context of
+ the current node); otherwise, \meta{false keylist} is processed.
+
+\indexitem{conditional>if current nodewalk empty}|=|\meta{true keylist}\meta{false keylist}
+
+ If the current nodewalk contains no (real) steps, \meta{true keylist} is processed (in the context of
+ the current node); otherwise, \meta{false keylist} is processed.
+
+ \indexitem{conditional>if in saved nodewalk}|=|\meta{nodewalk}\meta{toks: nodewalk name}\meta{true keylist}\meta{false keylist}
+
+If the node at the end of \meta{nodewalk} occurs in the saved nodewalk, \meta{true keylist} is
+processed (in the context of the current node); otherwise, \meta{false keylist} is processed.
+
+\indexitem{propagator>if have delayed}|=|\meta{true keylist}\meta{false keylist} If any options were
+ delayed in the current cycle (more precisely, up to the point of the execution of this key),
+ process \meta{true keylist}, otherwise process \meta{false keylist}. (\index{delay n} will
+ trigger ``true'' for the intermediate cycles.)
+
+ This key assumes that the processing order of the innermost invocation of \index{process
+ keylist} or \index{process keylist'} is given by \index{processing order}. If this is not
+ the case, explicitely supply the processing order using \index{if have delayed'}.
+
+\indexitem{propagator>if have delayed'}|=|\meta{nodewalk}\meta{true keylist}\meta{false keylist}
+ Like \index{if have delayed}, but assume the processing order given by \meta{nodewalk}.
+
+\end{syntax}
+
+
+
+The following keys are shortcuts: they execute their corresponding |if ...| conditional for every
+node in the subtree of the current node (including the node itself). In other words:
+
+\begin{center}
+ |where ...|\meta{arg$_1$}\dots\meta{arg$_n$}|/.style={for tree={if ...=|\meta{arg$_1$}\dots\meta{arg$_n$}|}}|
+\end{center}
+
+\begin{advise}
+\item Except in special circumstances, you probably don't want to embed keys from the \index{where
+ option} family within a \index{for step=\index{tree}}, as this results in two nested loops. It
+ is more usual to use an \index{conditional>if} family key there. For an example where using
+ \index{where option} actually does the wrong thing, see question
+ \href{http://tex.stackexchange.com/questions/167978/smaller-roofs-for-forest}{Smaller roofs for
+ forest} on \TeX\ Stackexchange.
+\end{advise}
+
+\begin{syntax}
+\indexitem{conditional>where}|=|\meta{value}\meta{true keylist}\meta{false keylist}
+\itemnosep
+\indexitem{word prefix=option>conditional>where=\meta{option}}|=|\meta{value}\meta{true keylist}\meta{false keylist}
+\itemnosep
+\indexitem{word prefix=boolean option>conditional>where=\meta{boolean option}}|=|\meta{true keylist}\meta{false keylist}
+\itemnosep
+\indexitem{word prefix=toks option>conditional>where in=\meta{toks option}}|=|\meta{toks}\meta{true keylist}\meta{false keylist}
+\itemnosep
+\indexitem[set={
+ index format={result=where \protect\meta{dimen option}\protect\greaterthan,pgfkey},
+ print format={result/.option=argument,+result={where\ },result+={>}, pgfkey},
+}]{conditional>where dimen GT=\protect\meta{dimen option}}|=|\meta{value}\meta{true keylist}\meta{false keylist}
+\itemnosep
+\indexitem[set={
+ index format={result=where \protect\meta{dimen option}<,pgfkey},
+ print format={result/.option=argument,+result={where\ },result+={<}, pgfkey},
+}]{conditional>where dimen LT=\protect\meta{dimen option}}|=|\meta{value}\meta{true keylist}\meta{false keylist}
+\itemnosep
+\indexitem[set={
+ index format={result=where \protect\meta{count option}\protect\greaterthan,pgfkey},
+ print format={result/.option=argument,+result={where\ },result+={>}, pgfkey},
+}]{conditional>where count GT=\protect\meta{count option}}|=|\meta{value}\meta{true keylist}\meta{false keylist}
+\itemnosep
+\indexitem[set={
+ index format={result=where \protect\meta{count option}<,pgfkey},
+ print format={result/.option=argument,+result={where\ },result+={<}, pgfkey},
+}]{conditional>where count LT=\protect\meta{count option}}|=|\meta{value}\meta{true keylist}\meta{false keylist}
+\itemnosep
+\indexitem[set={
+ index format={result=where \protect\meta{dimen register}\protect\greaterthan,pgfkey},
+ print format={result/.option=argument,+result={where\ },result+={>}, pgfkey},
+}]{conditional>where dimen register GT=\protect\meta{dimen register}}|=|\meta{value}\meta{true keylist}\meta{false keylist}
+\itemnosep
+\indexitem[set={
+ index format={result=where \protect\meta{dimen register}<,pgfkey},
+ print format={result/.option=argument,+result={where\ },result+={<}, pgfkey},
+}]{conditional>where dimen register LT=\protect\meta{dimen register}}|=|\meta{value}\meta{true keylist}\meta{false keylist}
+\itemnosep
+\indexitem[set={
+ index format={result=where \protect\meta{count register}\protect\greaterthan,pgfkey},
+ print format={result/.option=argument,+result={where\ },result+={>}, pgfkey},
+}]{conditional>where count register GT=\protect\meta{count register}}|=|\meta{value}\meta{true keylist}\meta{false keylist}
+\itemnosep
+\indexitem[set={
+ index format={result=where \protect\meta{count register}<,pgfkey},
+ print format={result/.option=argument,+result={where\ },result+={<}, pgfkey},
+}]{conditional>where count register LT=\protect\meta{count register}}|=|\meta{value}\meta{true keylist}\meta{false keylist}
+\itemnosep
+\indexitem{conditional>where nodewalk valid}|=|\meta{toks: nodewalk name}\meta{true keylist}\meta{false keylist}
+\itemnosep
+\indexitem{conditional>where nodewalk empty}|=|\meta{toks: nodewalk name}\meta{true keylist}\meta{false keylist}
+\itemnosep
+\indexitem{conditional>where in saved nodewalk}|=|\meta{nodewalk}\meta{toks: nodewalk name}\meta{true keylist}\meta{false keylist}
+\end{syntax}
+
+
+\subsection{Loops}
+\label{ref:loops}
+
+All loops take a \meta{keylist} argument. The interpretation of the keys in these keylists depends
+on the environment the loop appears in. If it is a part of a nodewalk specification,
+the keys are taken to be nodewalk keys (\S\ref{ref:nodewalks}), otherwise node keys
+(\S\ref{ref:node-keys}).
+
+All loops can be nested safely.
+
+
+\begin{syntax}
+
+\indexitem{loop>repeat}|=|\meta{number}\meta{keylist}
+
+ The \meta{keylist} is processed \meta{number} times.
+
+ The \meta{number} expression is evaluated using |pgfmath|.
+
+\indexitem{loop>while}|=|\index{forestmath=condition}\meta{keylist}
+ \itemnosep
+\indexitem{loop>do while}|=|\index{forestmath=condition}\meta{keylist}
+ \itemnosep
+\indexitem{loop>until}|=|\index{forestmath=condition}\meta{keylist}
+ \itemnosep
+\indexitem{loop>do until}|=|\index{forestmath=condition}\meta{keylist}
+
+ \keyname{while} loops cycle while the condition is true, \keyname{until} loops terminate when the
+ condition becomes true.
+
+ The \keyname{do} variants check the condition after processing the \meta{keylist}; thus, the
+ keylist is executed at least once. The variants without the \keyname{do} prefix check the
+ condition before processing the \meta{keylist}, which might therefore not be processed at all.
+
+ When \index{forestmath=condition} is an empty string, condition \index{valid} is implicitely used,
+ and \meta{keylist} is implicitely embedded in \index{nodewalk key>on invalid}|=fake|. Thus, the |while|
+ loops will cycle until they ``walk out of the tree'', and |until| loops will cycle until they
+ ``walk into the tree.''
+
+ \begin{advise}
+ \item If a loop ``walks out of the tree'', you can get it back in using \index{step>last valid} or
+ \index{nodewalk key>strip fake steps}.
+ \end{advise}
+
+
+\begin{forestexample}[index={root',content,step>n,delay,for step,nodewalk,do until}]
+ \pgfmathsetseed{1234}
+ \begin{forest}
+ try/.style={root',content+={#1,\ },n=#1},
+ delay={
+ for nodewalk={~do until~={}{try/.pgfmath={random(1,20)}},draw}{},
+ },
+ [tried:\ [1][2][3][4][5]]
+ \end{forest}
+\end{forestexample}
+
+\indexitem{loop>while nodewalk valid}|=|\meta{nodewalk}\meta{keylist}
+ \itemnosep
+\indexitem{loop>do while nodewalk valid}|=|\meta{nodewalk}\meta{keylist}
+ \itemnosep
+\indexitem{loop>until nodewalk valid}|=|\meta{nodewalk}\meta{keylist}
+ \itemnosep
+\indexitem{loop>do until nodewalk valid}|=|\meta{nodewalk}\meta{keylist}
+ \itemnosep
+\indexitem{loop>while nodewalk empty}|=|\meta{nodewalk}\meta{keylist}
+ \itemnosep
+\indexitem{loop>do while nodewalk empty}|=|\meta{nodewalk}\meta{keylist}
+ \itemnosep
+\indexitem{loop>until nodewalk empty}|=|\meta{nodewalk}\meta{keylist}
+ \itemnosep
+\indexitem{loop>do until nodewalk empty}|=|\meta{nodewalk}\meta{keylist}
+
+ \meta{nodewalk} is embedded within \index{nodewalk key>on invalid}|=fake|.
+
+
+\indexitem(0){node key>break}|=|$n$ Break out of the loop.
+
+ The loop is only exited after all the keys in the current cycle have been processed.
+
+ The optional argument $n$ ($n\geq0$) specifies which level of embedding to break from; the default
+ is to break out of the innermost loop.
+
+\indexitem(0){pgfmath>forestloopcount}([$n$])
+
+ How many times has the loop repeated until now?
+
+ The optional argument $n$ ($n\geq0$) specifies the level of embedding to provide information for;
+ the default is to count the repetitions of the current, most deeply embedded loop.
+
+\end{syntax}
+
+
+\subsection{Dynamic tree}
+\label{ref:dynamic}
+
+The following keys can be used to change the geometry of the tree by creating new nodes and
+integrating them into the tree, moving and copying nodes around the tree, and removing nodes from
+the tree.
+
+The \meta{node} that will be (re)integrated into the tree can be specified in the following ways:
+\begin{syntax}
+\item \meta{empty}: uses the last non-integrated (i.e.\ created/removed/replaced) node.
+ \begin{advise}
+ \item This node can also be referred to using nodewalk step \index{last dynamic node}.
+ \item The list of all such nodes is automatically saved in named nodewalk \indexdef{named
+ nodewalk>dynamic nodes}, to be \index{load}ed when needed.
+ \end{advise}
+\item \meta{node}: a new node is created using the given bracket representation (the node may
+ contain children, i.e.\ a tree may be specified), and used as the argument to the key.
+
+ The bracket representation must be enclosed in brackets, which will usually be enclosed in
+ braces to prevent them being parsed while parsing the ``host tree.''
+ \begin{advise}
+ \item Unlike the bracket representation in a \index{environment>forest} environment, the bracket
+ representation of a dynamically created node \emph{must} start with |[|. Specifically, it cannot
+ begin with a preamble or the action character.
+ \end{advise}
+\item \index{relative node name}: the node \meta{relative node name} resolves to will be used.
+\end{syntax}
+
+A dynamic tree operation is made in two steps:
+\begin{itemize}
+\item If the argument is given by a \meta{node} argument, the new node is created immediately,
+ i.e.\ while the dynamic tree key is being processed. Any options of the new node are
+ implicitely \index{delay}ed.
+\item The requested changes in the tree structure are actually made between the cycles of keylist
+ processing.
+\end{itemize}
+
+\begin{advise}
+\item Such a two-stage approach is employed because changing the tree structure during the dynamic
+ tree key processing would lead to an unmanageable order of keylist processing.
+\item A consequence of this approach is that nested dynamic tree keys take several cycles to
+ complete. Therefore, be careful when using \index{delay} and dynamic tree keys simultaneously: in
+ such a case, it is often safer to use \index{before typesetting nodes} instead of \index{delay},
+ see example (\ref{ex:append}), and it is also possible to define additional stages, see
+ \S\ref{sec:workflow}.
+\item Examples: title page (in style |random tree|) and (\ref{ex:niceemptynodes}) (in style
+ |xlist|).
+\end{advise}
+
+Here is the list of dynamic tree keys:
+
+\begin{syntax}
+\indexitem{dynamic tree>append}|=|\meta{empty}\OR|[|\meta{node}|]|\OR\meta{relative node name}
+
+ The specified node becomes the new final child of the current node. If the specified node had a
+ parent, it is first removed from its old position.
+
+\begin{forestexample}[label=ex:append,point=append,index={append,delay,for step,tree,readonly option>n,content,readonly option>n',repeat}]
+ \begin{forest}
+ before typesetting nodes={for tree={
+ if n=1{content=L}
+ {if n'=1{content=R}
+ {content=C}}}}
+ [,repeat=2{append={[
+ ,repeat=3{append={[]}}
+ ]}}]
+ \end{forest}
+\end{forestexample}
+
+\indexitem{dynamic tree>create}|=[|\meta{node}|]|
+
+Create a new node. The new node becomes the last node.
+
+\indexitem{dynamic tree>create'}|=[|\meta{node}|]|
+
+Create a new node and process its given options immediately. The new node becomes the last node.
+
+\indexitem{dynamic tree>insert after}|=|\meta{empty}\OR|[|\meta{node}|]|\OR\meta{relative node name}
+
+ The specified node becomes the new following sibling of the current node. If the specified node had a
+ parent, it is first removed from its old position.
+
+\indexitem{dynamic tree>insert before}|=|\meta{empty}\OR|[|\meta{node}|]|\OR\meta{relative node name}
+
+ The specified node becomes the new previous sibling of the current node. If the specified node had a
+ parent, it is first removed from its old position.
+
+\indexitem{dynamic tree>prepend}|=|\meta{empty}\OR|[|\meta{node}|]|\OR\meta{relative node name}
+
+ The specified node becomes the new first child of the current node. If the specified node had a
+ parent, it is first removed from its old position.
+
+\indexitem{dynamic tree>remove}
+
+The current node is removed from the tree and becomes the last node.
+
+The node itself is not deleted: it is just not integrated in the tree anymore. Removing the root
+node has no effect.
+
+\indexitem{dynamic tree>replace by}|=|\meta{empty}\OR|[|\meta{node}|]|\OR\meta{relative node name}
+
+ The current node is replaced by the specified node. The current node becomes the last node.
+
+ If the specified node is a new node containing a dynamic tree key, it can refer to the replaced
+ node by the \meta{empty} specification. This works even if multiple replacements are made.
+
+ If \keyname{replace by} is used on the root node, the ``replacement'' becomes the root node
+ (\index{set root} is used).
+
+\end{syntax}
+
+If given an existing node, most of the above keys \emph{move} this node
+(and its subtree, of course). Below are the versions of these operations which rather \emph{copy}
+the node: either the whole subtree (|'|) or just the node itself (|''|).
+\begin{syntax}
+\indexitem{dynamic tree>append'}, \indexdef{dynamic tree>insert after'}, \indexdef{dynamic tree>insert before'}, \indexdef{dynamic tree>prepend'},
+ \indexdef{dynamic tree>replace by'}
+
+ Same as versions without |'| (also the same arguments), but it is the copy of the specified node
+ and its subtree that is integrated in the new place.
+\indexitem{dynamic tree>append''}, \indexdef{dynamic tree>insert after''}, \indexdef{dynamic tree>insert before''}, \indexdef{dynamic tree>prepend''},
+ \indexdef{dynamic tree>replace by''}
+
+ Same as versions without |''| (also the same arguments), but it is the copy of the specified node
+ (without its subtree) that is integrated in the new place.
+
+\begin{advise}
+\item You might want to \index{delay} the processing of the copying operations, giving the
+ original nodes the chance to process their keys first!
+\end{advise}
+
+\indexitem{dynamic tree>copy name template}|=|\meta{empty}\OR\meta{macro definition} \hfill\meta{empty}
+
+Defines a template for constructing the \index{option>name} of the copy from the name of the
+original. \meta{macro definition} should be either empty (then, the \index{option>name} is
+constructed from the \index{readonly option>id}, as usual), or an expandable macro taking one argument (the
+name of the original).
+
+\begin{forestexample}
+ \begin{forest}
+ copy name template={copy of #1}
+ [CP,delay={prepend'=subject}
+ [VP[DP,name=subject[D][NP]][V'[V][DP]]]]
+ \draw[->,dotted] (subject)--(copy of subject);
+ \end{forest}
+\end{forestexample}
+
+\indexitem{dynamic tree>set root}|=|\meta{empty}\OR|[|\meta{node}|]|\OR\meta{relative node name}
+
+The specified node becomes the new \emph{formal} root of the tree.
+
+Note: If the specified node has a parent, it is \emph{not} removed from it. The node becomes the
+root only in the sense that the default implementation of stage-processing will consider it a
+root, and thus typeset/pack/draw the (sub)tree rooted in this root. The processing of keys such
+as \index{for step=\index{step>parent}} and \index{for step=\index{root}} is not affected: \index{for step=\index{root}} finds the
+real, geometric root of the current node. To access the formal root, use nodewalk step
+\index{root'}, or the corresponding propagator \index{for step=\index{root'}}.
+
+\indexitem{dynamic tree>sort}, \indexdef{dynamic tree>sort'} Sort the children of the current node,
+ using the currently active sort key specified in \index{sort by} (see
+ \S\ref{ref:nodewalk-operations}). |sort| sorts in ascending and |sort'| in descending order.
+
+\end{syntax}
+
+
+\subsection{Handlers}
+\label{ref:handlers}
+
+Handlers are a powerful mechanism of |pgfkeys|, documented in \citep[\S82.3.5]{tikzpgf3.0.0}.
+Handlers defined by \foRest; perform a computation and invoke the handled key with its result. The
+simple handlers are documented in this section: for \index{handler>process}, see
+\S\ref{ref:argument-processor}; for aggregate function handlers, see
+\S\ref{ref:aggregate-functions}.
+
+\begin{syntax}
+\indexitem{handler>option}|=|\meta{option}
+
+The result is the value of \meta{option} at the current node.
+
+\indexitem{handler>register}|=|\meta{register}
+
+The result is the value of \meta{register}.
+
+\indexitem{handler>pgfmath}|=|\meta{pgfmath expression}
+
+The result is the evaluation of \meta{pgfmath expression} in the context of the current node.
+
+\begin{advise}
+\item
+ If you only need to access an option or register value, using \index{handler>option} or
+ \index{handler>register} is much faster than using \keyname{.pgfmath}.
+\end{advise}
+
+\indexitem{handler>wrap value}|=|\meta{macro definition}
+
+The result is the (single) expansion of the given
+ \meta{macro definition}. The defined macro takes one parameter. The current value of the
+ handled option will be passed as that parameter.
+
+\indexitem{handler>wrap $n$ pgfmath args}|=|\meta{macro definition}\meta{arg $1$}\dots\meta{arg $n$}
+
+ The result is the (single) expansion of the given \meta{macro definition}. The defined macro
+ takes $n$ parameters, where $n\in\{2,\dots,8\}$. Expressions \meta{arg $1$} to \meta{arg $n$}
+ are evaluated using |pgfmath| and passed as arguments to the defined macro.
+
+\indexitem{handler>wrap pgfmath arg}|=|\meta{macro definition}\meta{arg}
+
+ Like \index{wrap $n$ pgfmath args} would work for $n=1$.
+
+
+\end{syntax}
+
+\subsection{Argument processor}
+\label{ref:argument-processor}
+
+For a gentle(r) introduction to the argument processor, see \S\ref{tut:wrapping}.
+
+The argument processor takes a sequence of instructions and an arbitrary number of arguments and
+transforms the given arguments according to the instructions. This is the generic form of a process
+expression:
+
+\begin{syntax}
+ \item \indexdef{meta>process} = \meta{instructions}\meta{arg $1$}\dots\meta{arg $n$}
+\end{syntax}
+
+There are three ways to invoke the argument processor: via handler \index{handler>process}, as one
+of the two alternatives of a \index{forestmath} expression and recursively, by its instruction
+\index{processor>P}.
+
+\begin{syntax}
+
+\indexitem{handler>process}|=|\index{meta>process}
+
+The result of the computation is passed on to the handled key as a sequence of arguments. When the
+argument processor is invoked this way, any number of items can be returned.\footnote{For backward
+ compatibility, \index{handler>process} is also available as \indexdef{handler>process args}.}
+
+\item \indexdef{meta>forestmath} = \meta{pgfmath}\OR|>|\index{meta>process}
+
+ In words, a \index{forestmath} expression is either a \meta{pgfmath} expression or an argument
+ processor expression (\index{meta>process}) prefixed by |>|.
+
+ In other words, \FoRest; accepts an argument processor expression anywhere it accepts a
+ \meta{pgfmath} expression.\footnote{The only exceptions to the above rule are handler
+ \index{pgfmath} and argument processor instruction \index{processor>P}.} To indicate that we're
+ providing an argument processor expression, we prefix it with |>|.
+
+ When the argument processor is invoked this way, it should return a single item.
+
+\end{syntax}
+
+
+\begin{table}
+ \centering
+ \tikzexternaldisable
+ \bracketset{action character=!}%
+ \begin{forest}
+ phantom,
+ for tree={
+ grow'=0, no edge, inner sep=0, outer sep=0,
+ },
+ delay={
+ sort by={>O+t+c{content}},
+ sort,
+ },
+ before typesetting nodes={
+ for children={
+ content={\index{processor>#1}},
+ for children={
+ content+={\phantom{(%)
+ }}}}},
+ define long step={from to}{n args=2}{
+ tempcounta=#2,
+ n=#1,
+ while/.process=Rw{tempcounta}{n()<##1}{next}
+ },
+ draw tree stage/.style={
+ for root'={
+ if n children=0{% so that we don't get an error on the first run
+ }{
+ draw tree processing order/.nodewalk style={branch={{from to={1}{round(n_children()/3)}},tree}}, draw tree, TeX={~~},
+ draw tree processing order/.nodewalk style={branch={{from to={1+round(n_children()/3)}{2*round(n_children()/3)}},tree}}, draw tree, TeX={~~},
+ draw tree processing order/.nodewalk style={branch={{from to={1+2*round(n_children()/3)}{n_children()}},tree}}, draw tree,
+ }
+ }
+ }
+ [!\bigbadprocesslist]
+ \end{forest}%
+ \caption{Argument processor instructions}
+ \label{tab:allargprocins}
+\end{table}
+
+
+The syntax of argument processor is a cross between |expl3|'s function argument specification and a
+Turing machine, spiced with a bit of reversed Polish notation. ;-)
+
+Think of \meta{instructions} as a program and \meta{arg $1$}\dots\meta{arg $n$} as the data that
+this program operates on.
+
+If you're familiar with Turing machines: like a Turing machine, the argument processor has a notion
+of a head; unlike a Turing machine, the argument processor head is positioned not over some
+argument, but between two arguments. If you're not familiar with Turing machines: imagine the
+arguments as items on a tape and the argument processor as a head that is always located between
+some two items. As the head is between two arguments, we can talk about the arguments on the left
+and the arguments on the right.
+
+In general, an instruction will take some items from the left and some from the right (deleting them
+from the tape), perform some computation and insert the result on the tape, some result items to the
+left and some to the right. However, most instructions simply take an item from the right, do
+something with it, and put the (single-item) result to the left; in effect, the head is moved one
+item to the right. At the beggining, all the arguments are always on the right, so the general idea
+is that the program will walk through the given arguments, processing them in order.
+
+Descriptions of individual instructions, given below, contain (at the right edge of the page) the
+argument specification, which tells us about the number of input and output items and the movement
+of the head. The input and output are separated by an arrow ($\longrightarrow$), and the green eye
+(\textcolor{darkgreen}{\eye}) signifies the position of the head with respect to the (input or
+output) items.
+
+For example, instruction \index{processor>O}, which converts an option name into the option value,
+exemplifies the most common scenario: it takes one argument from the right and puts the result to
+the left (in other words, the head moves one item to the right). Wrapping instrucion
+\index{processor>w} is more complicated. Given instruction \index{processor>w}$n$, the argument
+processor takes one argument from the right (the wrapping macro body) and $n$ items from the left
+(which become the arguments of the wrapping macro), and puts the resulting item to the left.
+Comparisons and boolean operations are the instructions resembling the reverse Polish notation: they
+take the arguments from the left and put the result to the left, as well. Finally, it is worth
+mentioning instructions \index{processor>noop} and \index{processor>+}, which simply move the head
+to the right and left, respectively; given that the usual movement of the head is to the right,
+\index{processor>+} can be thought of as a process-the-argument-again instruction.
+
+
+Before we finally list the available instructions, some notes:
+\begin{itemize}
+\item \meta{Instructions} may be given in braces or not. If not, everything until the first opening
+ brace is considered to be an instruction.
+\item An argument item (\meta{arg$_k$}) is a standard \TeX\ macro argument: either a token or a
+ braced token list. (The obvious exception: \meta{arg$_1$} needs to be braced if it follows
+ braceless instructions.)
+\item Spaces in \meta{instructions} and between arguments are ignored. Format your \index{handler>process}
+ as you wish!
+\item Instructions followed by [$n$] below take an optional numeric modifier.
+ \begin{itemize}
+ \item The modifier should be given within the instruction string itself, immediately following the
+ instruction. In particular, no spaces are allowed there. (Sorry for the little white lie
+ above.) The number should not be enclosed in braces, even if it is more than one digit long.
+ \item This modifier is always optional: its default value varies from instruction to instruction.
+ (Providing $0$ means to use the default.)
+ \item Unless noted otherwise, the optional numerical argument $n$ instruct the argument processor
+ to repeat the previous instruction $n$ times (by default, 1). For example,
+ \index{processor>O}|3| is equivalent to
+ \index{processor>O}\index{processor>O}\index{processor>O}.
+ \end{itemize}
+\end{itemize}
+
+\makeatletter
+\NewDocumentEnvironment{indexitemprocessinstruction}{
+ D(){} % default
+ O{} % \index []
+ m % instruction char
+ o % form of instruction char, if different from #3
+ D(){} % instruction modifiers
+ m % first line
+ >{\ReverseBoolean} s % typeset processor signature?
+ >{\SplitArgument {3} {&} } m % processor signature
+}{%
+ \write\@auxout{\unexpanded{\gappto\bigbadprocesslist{[{#3}[{#6}]]}}}%
+ \IfValueTF{#4}{%
+ \indexitem(#1)[set={form={#4},index form={#4{\protect\ \protect\rm\protect\scriptsize (#6)}},#2}]{processor>#3}#5 #6%
+ }{%
+ \indexitem(#1)[set={index form={#3{\protect\ \protect\rm\protect\scriptsize (#6)}},#2}]{processor>#3}#5 #6%
+ }%
+ \IfBooleanT{#7}{\hfill\processorsignature#8}%
+
+}{}
+\makeatother
+
+\newcommand\processorsignature[4]{%
+ #1 \textcolor{darkgreen}{\eye} #2
+ $\longrightarrow$
+ #3 \textcolor{darkgreen}{\eye} #4%
+}
+
+
+\begin{syntax}
+
+\begin{indexitemprocessinstruction}[index key=_]{noop}[\_]([$n$]){no-op}
+ {&\meta{arg}&\meta{arg}&}
+
+ The argument is not processed, but simply skipped over. In other words, this instruction only
+ moves the head one item to the right. (This is like |expl3|'s argument specifier |n|.)
+
+ $n$ means repetition.
+
+ When the end of the instructions is reached, any remaining arguments on the right are processed
+ using this no-op instruction.
+
+\end{indexitemprocessinstruction}
+
+\begin{indexitemprocessinstruction}{o}([$n$]){expand \protect\emph{o}nce}
+ {&\meta{arg}&\meta{result}&}
+
+ \meta{arg} is expanded once. (This is like |expl3|'s argument specifier |o|).
+
+ The operation is repeated $n$ times (default, one) without moving the head between the
+ repetition. For example, |o3| expands the argument three times (and then moves the head right).
+\end{indexitemprocessinstruction}
+
+\begin{indexitemprocessinstruction}{x}{fully e\protect\emph{x}pand}
+ {&\meta{arg}&\meta{result}&}
+
+ \meta{arg} is fully expanded using |\edef|. (This is like |expl3|'s argument specifier |x|.)
+\end{indexitemprocessinstruction}
+
+\begin{indexitemprocessinstruction}{O}([$n$]){\protect\emph{o}ption}
+ {&\meta{option}&\meta{result}&}
+
+ \meta{option}=\alternative{\meta{option name},\meta{relative node name}\texttt{.}\meta{option name}}
+
+ In the former case, \meta{result} is the value of option at the current node, in the latter, the
+ value of option at the node referred to by \meta{relative node name}.
+
+ $n$ means repetition.
+
+\end{indexitemprocessinstruction}
+
+\begin{indexitemprocessinstruction}{R}([$n$]){\protect\emph{r}egister}
+ {&\meta{register}&\meta{result}&}
+
+ \meta{result} is the value of register \meta{register}.
+
+ $n$ means repetition.
+
+\end{indexitemprocessinstruction}
+
+\begin{indexitemprocessinstruction}{p}([$n$]){\protect\emph{p}rocess}
+ {&\index{meta>process}&\meta{result}&}
+
+ Execute an embedded call of the argument processor.
+ The embedded argument processor may return any number of items.
+
+ $n$ means repetition.
+
+\begin{forestexample}[index={processor>p,processor>O,processor>w,processor>noop,grow',forked edges,content,handler>process}]
+ \begin{forest}
+ grow'=0, phantom,
+ delay={for children={
+ content/.process={_O= ? ~p~}
+ {}{content}
+ {_{No content was given, so there's nothing to do.}}
+ {Ow1{content}{We have content (##1), so we compute:
+ $##1+42=\the\numexpr ##1+42$}}
+ }}
+ [[][3][][5]]
+ \end{forest}
+\end{forestexample}
+
+
+\end{indexitemprocessinstruction}
+
+\begin{indexitemprocessinstruction}{P}([$n$]){\protect\emph{p}gfmath}
+ {&\meta{pgfmath}&\meta{result}&}
+
+ \meta{result} is the result of evaluating \meta{pgfmath expr} using |\pgfmathparse|.
+
+ $n$ means repetition.
+
+ Combining \index{processor>P} and \index{processor>w}, \index{handler>process} is capable of anything
+ \index{wrap $n$ pgfmath args} can do. Even better, as we can combine pgfmath and non-pgfmath
+ methods, computations that use \index{handler>process} can be (much!) faster. Study the following
+ examples to see how less and less pgfmath is used to achieve the same result --- but note that
+ such extreme antipgfmathism probably only makes sense for style/package developers in computations
+ that get performed many times.
+
+\begin{forestexample}[index={handler>process,processor>w,processor>O,processor>W,processor>P,processor>+}]
+ \begin{forest}
+ [,grow'=east, where level=1{}{phantom,ignore,ignore edge}
+ [(a),delay={content/.wrap 4 pgfmath args={#1 $#2*#3=#4$}
+ {content}{content("!1")}{content("!2")}{int(content("!1")*content("!2"))}}
+ [6][7]]
+ [(b),delay={content/.process={O OO~P~ w4}
+ {content}
+ {!1.content}{!2.content}{int(content("!1")*content("!2"))}
+ {#1 $#2*#3=#4$}}
+ [6][7]]
+ [(c),delay={content/.process={O OO ~W2+P~ w4}
+ {content}
+ {!1.content}{!2.content}{int(#1*#2)}
+ {#1 $#2*#3=#4$}}
+ [6][7]]
+ [(d),delay={content/.process={O OO ~W2+n~ w4}
+ {content}
+ {!1.content}{!2.content}{#1*#2}
+ {#1 $#2*#3=#4$}}
+ [6][7]]
+ ]
+ \end{forest}
+\end{forestexample}
+
+
+\end{indexitemprocessinstruction}
+
+\begin{indexitemprocessinstruction}{n}([$n$]){\protect\emph{n}umexpr}
+ {&\meta{numexpr}&\meta{result}&}
+
+ \meta{result} is the result of evaluating \meta{dimexpr} using e\TeX's |\number\numexpr|.
+
+ $n$ means repetition.
+
+\end{indexitemprocessinstruction}
+
+\begin{indexitemprocessinstruction}{d}([$n$]){\protect\emph{d}imexpr}
+ {&\meta{dimexpr}&\meta{result}&}
+
+ \meta{result} is the result of evaluating \meta{dimexpr} using e\TeX's |\the\dimexpr|.
+
+ $n$ means repetition.
+
+\end{indexitemprocessinstruction}
+
+\begin{indexitemprocessinstruction}{+}([$n$]){chain instructions}
+ {\meta{arg}&&&\meta{arg}}
+
+ This action allows one to ``process the same argument more than once''. It does not process the
+ current argument (in fact, there need not be any current argument), but rather moves the last
+ result back in the argument queue. In other words, our machine's head moves one step left. You
+ can also imagine it as an inverse of \index{processor>noop}.
+
+ $n$ means repetition.
+
+\end{indexitemprocessinstruction}
+
+\begin{forestexample}[index={handler>process,processor>O,processor>noop}]
+ \begin{forest}
+ test/.style n args={3}{align=center,
+ content={The value of my option \texttt{#1} is \texttt{#2}.\\#3}}
+ [~fit~,delay={test/.process={O ~O+O~}{content}~{content}~{Yes it is!}}]
+ \end{forest}
+\end{forestexample}
+
+
+\begin{indexitemprocessinstruction}{w}([$n$]){(consuming) \protect\emph{w}rap}
+ {\meta{arg$_{1}$}\dots\meta{arg$_{n}$}&\meta{macro body}&\meta{result}&}
+\end{indexitemprocessinstruction}
+\itemnosep[2pt]
+\begin{indexitemprocessinstruction}{W}([$n$]){(non-consuming) \protect\emph{w}rap}
+ {\meta{arg$_{1}$}\dots\meta{arg$_{n}$}&\meta{macro body}&
+ \meta{arg$_{1}$}\dots\meta{arg$_{n}$}\meta{result}&}
+
+ Defines a temporary macro with $n$ undelimited arguments using the \meta{macro body} given on the
+ right and expands it (once). The arguments given to the temporary macro are taken from the left:
+ \meta{arg$_{1}$}\dots\meta{arg$_{n}$}. The result of the expansion is stored as \meta{result} to
+ the right.
+
+ With |w|, \meta{arg$_{1}$}\dots\meta{arg$_{n}$} are ``consumed'', i.e.\ they are removed from the
+ result list on the left. |W| keeps \meta{arg$_{1}$}\dots\meta{arg$_{n}$} in the result list.
+
+ Default $n$ is 1. (Specifying $n>9$ raises an error.)
+\end{indexitemprocessinstruction}
+
+\begin{indexitemprocessinstruction}[index key=\&]{and}[\&]([$n$]){boolean ``and''}*{}
+\end{indexitemprocessinstruction}
+\itemnosep[2pt]
+\begin{indexitemprocessinstruction}[index key=\&or]{or}[\protect\indexpipe]([$n$]){boolean ``or''}
+ {\protect\meta{arg$_{1}$}\protect\meta{arg$_{2}$}&&\meta{result}&}
+
+ \meta{result} is a boolean conjunction/disjunction of $n$ arguments. The arguments are taken from
+ the left. They should be numbers (positive integers): |0| means false, any other number means
+ true. The \meta{result} is always |0| or |1|.
+
+ Default $n$ is 2.
+\end{indexitemprocessinstruction}
+
+\begin{indexitemprocessinstruction}[index key=!]{not}[!]{boolean ``not''}
+ {\meta{arg}&&\meta{result}&}
+
+ \meta{result} is a boolean negation of the argument. The argument is taken from the left. It
+ should be a number (positive integer): |0| means false, any other number means true. The
+ \meta{result} is always |0| or |1|.
+\end{indexitemprocessinstruction}
+
+\begin{indexitemprocessinstruction}{?}{conditional (if \protect\dots\ then \protect\dots\ else)}
+ {\meta{condition}&\meta{true arg}\meta{false arg}&&\meta{result}}
+
+ \meta{result} is \meta{true arg} is \meta{condition} is true (non-zero), otherwise \meta{false
+ arg}.
+
+ The condition is taken from the left. The true and false arguments are expected on the right,
+ where the winner is left as well.
+\end{indexitemprocessinstruction}
+
+\begin{indexitemprocessinstruction}[index key={=}]{equal}[=]{comparison: $\protect\meta{arg$_{1}$}=\protect\meta{arg$_{2}$}$?}*{}
+\end{indexitemprocessinstruction}
+\itemnosep[1pt]
+\begin{indexitemprocessinstruction}[index key={<}]{lt}[<]{comparison: $\protect\meta{arg$_{1}$}<\protect\meta{arg$_{2}$}$?}*{}
+\end{indexitemprocessinstruction}
+\itemnosep[1pt]
+\begin{indexitemprocessinstruction}[index key={<<}]{gt}[\protect\greaterthan]{comparison: $\protect\meta{arg$_{1}$}\protect\greaterthan\protect\meta{arg$_{2}$}$?}
+ {\meta{arg$_{1}$}\meta{arg$_{2}$}&&\meta{result}&}
+
+ Compare \meta{arg$_{1}$} and \meta{arg$_{2}$}, returning |1| (true) if \meta{arg$_{1}$} is equal
+ to / less than / greater than \meta{arg$_{2}$}, |0| (false) otherwise.
+
+ The arguments are taken from the left. They can be either numbers, dimensions, text or token
+ lists. Both arguments are expected to be of the same type. The type of comparison is determined
+ by the type of the result returned by the last instruction.
+ \index{processor>O}/\index{processor>R} look up the type of option/register to determine the type
+ (booleans are numbers and keylists are toks). Text type must be marked explicitely using
+ \index{processor>t}.
+
+ Comparison is carried out using |\ifnum| for numbers, |\ifdim| for dimensions (this includes
+ unitless decimals returned by pgfmath) and |\pdfstrcmp|\footnote{\texttt{\string\pdfstrcmp}
+ expands its arguments.} for text --- for these three types, all three comparison operators are
+ supported. For generic token lists, only |=| makes sense and is carried out using |\ifx|.
+
+ In the following example, (a) performs lexicographical comparison because we have marked |21| as
+ text; (b) and (c) perform numeric comparison: in (b), the type is automatically determined from
+ the type of register \indexex{tempcounta}, in (c) |21| is marked manually using \index{processor>n}.
+
+\begin{forestexample}[index={if,processor>gt,processor>lt}]
+ \forestset{
+ tempcounta=100,
+ TeX/.process={Rw1}{tempcounta}{$#1>21$?\ },
+ TeX={(a)\ }, if={>{Rt>}{tempcounta}{21}}{TeX=yes}{TeX=no},TeX={,\ },
+ TeX={(b)\ }, if={>{_R<}{21}{tempcounta}}{TeX=yes}{TeX=no},TeX={,\ },
+ TeX={(c)\ }, if={>{Rn>}{tempcounta}{21}}{TeX=yes}{TeX=no},
+ }
+\end{forestexample}
+
+\end{indexitemprocessinstruction}
+
+\begin{indexitemprocessinstruction}{t}{mark as \protect\emph{t}ext}
+ {&\meta{arg}&\meta{arg}&}
+
+ The result is not changed, only its type is changed to text. This is relevant only for
+ comparisons --- both argument processor's comparisons \index{processor>equal}, \index{processor>gt}
+ and \index{processor>lt} and sort keys (see \index{sort by}).
+\end{indexitemprocessinstruction}
+
+\begin{indexitemprocessinstruction}{c}{to lowercase}
+ {&\meta{arg}&\meta{result}&}
+\end{indexitemprocessinstruction}
+
+\begin{indexitemprocessinstruction}{C}{to uppercase}
+ {&\meta{arg}&\meta{result}&}
+\end{indexitemprocessinstruction}
+
+\begin{indexitemprocessinstruction}{-}{toggle ascending/descending order (negate)}
+ {\meta{arg}&&\meta{result}&}
+
+ If the argument is of the text type, its sorting order is changed from ascending to descending or
+ vice versa.
+
+ For any numerical argument type (number, dimension, unitless dimension), the argument is actually
+ negated, which obviously has the same effect on sorting.
+
+ For generic type arguments, this operation is a no-op.
+\end{indexitemprocessinstruction}
+
+\begin{indexitemprocessinstruction}{u}{\protect\emph{u}ngroup}
+ {&\meta{arg}&&\meta{item$_1$}\dots\meta{item$_n$}}
+
+ As every \TeX\ undelimited macro argument, \meta{arg} is a list of tokens or braced token lists.
+ This instruction puts those items back to the right as ``separate arguments''.
+\end{indexitemprocessinstruction}
+
+\begin{indexitemprocessinstruction}{s}([$n$]){(consuming) \protect\emph{s}ave}
+ {\meta{arg$_{1}$}\dots\meta{arg$_{n}$}&&&}
+\end{indexitemprocessinstruction}
+\itemnosep[2pt]
+\begin{indexitemprocessinstruction}{S}([$n$]){(non-consuming) \protect\emph{s}ave}
+ {\meta{arg$_{1}$}\dots\meta{arg$_{n}$}&&\meta{arg$_{1}$}\dots\meta{arg$_{n}$}&}
+
+ Saves the last $n$ arguments from the left into a ``special place''.
+
+ With |s|, \meta{arg$_{1}$}\dots\meta{arg$_{n}$} are ``consumed'', i.e.\ they are removed from the
+ result list on the left. |S| keeps \meta{arg$_{1}$}\dots\meta{arg$_{n}$} in the result list.
+
+ Default $n$ is 1.
+\end{indexitemprocessinstruction}
+
+\begin{indexitemprocessinstruction}{l}([$n$]){(consuming) \protect\emph{l}oad}
+ {&&\meta{arg$_{1}$}\dots\meta{arg$_{n}$}&}
+\end{indexitemprocessinstruction}
+\itemnosep[2pt]
+\begin{indexitemprocessinstruction}{L}([$n$]){(non-consuming) \protect\emph{l}oad}
+ {&&\meta{arg$_{1}$}\dots\meta{arg$_{n}$}&}
+
+ Loads last $n$ arguments from the ``special place'' to the left.
+
+ With |l|, \meta{arg$_{1}$}\dots\meta{arg$_{n}$} are ``consumed'', i.e.\ they are removed from the
+ special place. |S| keeps \meta{arg$_{1}$}\dots\meta{arg$_{n}$} in the special place.
+
+ The default $n$ is 0 and indicates that the entire special place should be loaded.
+\end{indexitemprocessinstruction}
+
+\begin{indexitemprocessinstruction}{r}{\protect\emph{r}everse (key)list}
+ {&\meta{list}&\meta{result}&}
+
+ \meta{list} should be a comma-separated list (\emph{not} a name of a keylist option or register).
+ \meta{result} contains the same elements in the reverse order.
+\end{indexitemprocessinstruction}
+
+\end{syntax}
+
+
+
+
+
+\subsection{Aggregate functions}
+\label{ref:aggregate-functions}
+
+Aggregate functions walk a nodewalk and use the information found in the visited nodes to calculate
+something.
+
+All aggregate functions are available both as key handlers and |pgfmath| functions.
+
+
+
+\begin{syntax}
+ \indexitem{aggregate>count}|=|\meta{nodewalk},
+ \indexdef[form={aggregate_count}]{pgfmath>aggregate count}|("|\meta{nodewalk}|")|
+
+ Store the number of nodes visited in the nodewalk into the handled option.
+
+\indexitem{aggregate>sum}|=|\index{forestmath}\meta{nodewalk},
+\indexdef[form={aggregate_sum}]{pgfmath>aggregate sum}|("|\index{forestmath}|","|\meta{nodewalk}|")|
+\itemnosep
+
+\indexitem{aggregate>average}|=|\index{forestmath}\meta{nodewalk},
+\indexdef[form={aggregate_average}]{pgfmath>aggregate average}|("|\index{forestmath}|","|\meta{nodewalk}|")|
+\itemnosep
+
+\indexitem{aggregate>product}|=|\index{forestmath}\meta{nodewalk},
+\indexdef[form={aggregate_product}]{pgfmath>aggregate product}|("|\index{forestmath}|","|\meta{nodewalk}|")|
+\itemnosep
+
+\indexitem{aggregate>min}|=|\index{forestmath}\meta{nodewalk},
+\indexdef[form={aggregate_min}]{pgfmath>aggregate min}|("|\index{forestmath}|","|\meta{nodewalk}|")|
+\itemnosep
+
+\indexitem{aggregate>max}|=|\index{forestmath}\meta{nodewalk},
+\indexdef[form={aggregate_max}]{pgfmath>aggregate max}|("|\index{forestmath}|","|\meta{nodewalk}|")|
+
+Calculate the value of the given \index{forestmath} expression at each visited node. Store the sum /
+average / product / minimum / maximum of these values into the handled option (handlers) or return
+it (pgfmath functions).
+
+\indexitem{aggregate>aggregate}|=|\index{forestmath=start value}\index{forestmath=every
+ step}\index{forestmath=after walk}\meta{nodewalk}
+\itemnosep
+\indexitem{pgfmath>aggregate}|("|\index{forestmath=start value}|","|\index{forestmath=every step}|","|\index{forestmath=after walk}|","|\meta{nodewalk}|")|
+
+The generic aggregate function. First, register \index{aggregate result} is set to
+\index{forestmath=start value}. Then, the given nodewalk is walked. After each step of the
+\meta{nodewalk}, \index{forestmath=every step} expression is evaluated in the context of the new
+current node and stored into \index{aggregate result}. After the walk, the current node is reset to
+the origin. \index{forestmath=after walk} expression is then evaluated in its context and stored
+into \index{aggregate result} as the final result.
+
+Use \index{aggregate result} and \index{aggregate n} in the \index{forestmath} expressions to refer to
+the current result value and step number.
+
+\indexitem{register>aggregate n}|=|\meta{count} the current step number
+
+In the every-step expression of an aggregate function, refers to the (real) step number in the
+aggregate's \meta{nodewalk}. In the after-walk expression, refers to the total number of (real)
+steps made.
+
+\indexitem{register>aggregate result}|=|\meta{toks} the current value of the result
+
+ This register is where the intermediate results are stored.
+
+\indexitem{register>aggregate value}|=|\meta{toks} the value of the expression at the current node
+
+This only applies to special aggregates like \index{aggregate>sum}, not to the generic
+\index{aggregate>aggregate}.
+
+\indexitem{node key>aggregate postparse}|=|\alternative{none,int,print,macro}
+
+Roughly speaking, how should the result be formatted? For details, see \citep[\S89]{tikzpgf3.0.0}.
+Applies only to |pgfmath| versions of aggregate functions, i.e.\ not to the |'| variants.
+
+ \begin{syntax}
+ \item\indexdef{value of=aggregate postparse>none}
+ No formatting.
+ \item\indexdef{value of=aggregate postparse>int}
+ The result is an integer.
+ \item\indexdef{value of=aggregate postparse>print}
+ Use |pgf|'s number printing extension, see \citep[\S93]{tikzpgf3.0.0}.
+ \item\indexdef{value of=aggregate postparse>macro}
+ Use a custom macro. Specify the macro using \indexdef{node key>aggregate postparse macro}|=|\meta{cs}.
+ \end{syntax}
+
+\end{syntax}
+
+Example 1. Randomly generate the content of leaves. The content of a parent is the sum of its
+children's content. Note how we use \indexex{tree children-first} to proceed in a bottom-up
+fashion.
+
+\begin{forestexample}[index={delay,aggregate postparse,for step,tree children-first,if option,n children,content,pgfmath,sum,step>children}]
+ \begin{forest}
+ delay={
+ aggregate postparse=int,
+ for tree children-first={
+ if n children=0
+ {content/.pgfmath={random(0,100)}}
+ {content/~.sum~={content}{children}}
+ }
+ }
+ [[[[][]][]][[][][[][][]]][[][[][]]]]
+ \end{forest}
+\end{forestexample}
+
+ Example 2: nested aggregate functions. We are given the black numbers. The inner aggregate, the
+ sum of children, is applied at every blue node. (See how we actually display the blue numbers by
+ storing \index{aggregate value} to \index{content}.) The outer aggregate stores the maximum blue
+ number into the red root.
+
+\begin{forestexample}
+ \begin{forest}
+ delay={
+ aggregate postparse=int,
+ content/~.max~=%
+ {~aggregate_sum~("content","children")}%
+ {every step={content/.register=~aggregate value~},children}%
+ } [ [[1][2][3]] [[3][4][5]] [[2][3][4]] ]
+ \end{forest}
+\end{forestexample}
+
+Example 3: calculate root mean square of children using the generic \index{aggregate>aggregate} handler.
+
+\begin{forestexample}
+ \begin{forest}
+ delay={
+ content/~.aggregate~=
+ {0}{~aggregate_result~()+content()^2}{sqrt(~aggregate_result~/~aggregate_n~)}
+ {children}
+ }
+ [[0][1][2][3][4]]
+ \end{forest}
+\end{forestexample}
+
+\subsection{Relative node names}
+\label{ref:relative-node-names}
+
+\begin{syntax}
+\indexitem{meta>relative node name}|=|[\meta{forest node name}][\indexdef[set={code}]>{!}\meta{nodewalk}]
+
+ \meta{relative node name} refers to the \foRest; node at the end of the \meta{nodewalk}
+ starting at node named \meta{forest node name}. If \meta{forest node name} is omitted, the walk
+ starts at the current node. If \meta{nodewalk} is omitted, the ``walk'' ends at the start
+ node. (Thus, an empty \meta{relative node name} refers to the current node.)
+
+ The \meta{nodewalk} inherits its history from the outer nodewalk (if there is one). Its every-step
+ keylist is empty.
+\end{syntax}
+
+Relative node names can be used in the following contexts:
+\begin{itemize}
+\item \FoRest;'s |pgfmath| option functions (\S\ref{ref:pgfmath}) take a relative node name as
+ their argument, e.g.\ |content("!u")| and |content("!parent")| refer to the content of the
+ parent node.
+\item An option of a non-current node can be set by \meta{relative node name}|.|\meta{option
+ name}|=|\meta{value}, see \S\ref{sec:option-setting}.
+\item The |forest| coordinate system, both explicit and implicit; see \S\ref{ref:forest-cs}.
+\end{itemize}
+
+\subsection{The \texttt{forest} coordinate system}
+\label{ref:forest-cs}
+
+Unless package options \index{tikzcshack} is set to |false|, \TikZ;'s implicit node coordinate
+system \citep[\S13.2.3]{tikzpgf2.10} is hacked to accept relative node names.\footnote{Actually,
+the hack can be switched on and off on the fly, using \cmdname{i}\keyname{foresttikzcshack}.}.
+
+The explicit \texttt{forest} coordinate system is called simply |forest| and used like this:
+|(forest_cs:|\meta{forest cs spec}|)|; see \citep[\S13.2.5]{tikzpgf2.10}. \meta{forest cs spec}
+is a keylist; the following keys are accepted.
+
+\begin{syntax}
+\indexitem{forest cs>name}|=|\meta{node name} The node with the given name becomes the current node. The
+resulting point is its (node) anchor.
+\indexitem{forest cs>id}|=|\meta{node id} The node with the given name becomes the current node. The
+resulting point is its (node) anchor.
+\indexitem{forest cs>go}|=|\meta{nodewalk} Walk the given nodewalk, starting at the current node. The
+ node at the end of the walk becomes the current node. The resulting point is its (node) anchor.
+ The embedded \meta{nodewalk} inherits history from the outer nodewalk.
+\indexitem{forest cs>anchor}|=|\meta{anchor} The resulting point is the given anchor of the current node.
+\indexitem{forest cs>l}|=|\meta{dimen} \vspace{-\parskip}
+\indexitem{forest cs>s}|=|\meta{dimen} Specify the \index{option>l} and \index{option>s}
+coordinate of the resulting point.
+
+The coordinate system is the node's ls-coordinate system: its origin is at its (node) anchor; the
+l-axis points in the direction of the tree growth at the node, which is given by option
+\index{grow}; the s-axis is orthogonal to the l-axis; the positive side is in the
+counter-clockwise direction from |l| axis.
+
+The resulting point is computed only after both \index{option>l} and \index{option>s} were given.
+\item Any other key is interpreted as a \index{relative node name}[.\meta{anchor}].
+\end{syntax}
+
+
+\subsection{Anchors}
+\label{sec:anchors}
+
+\FoRest; defines several anchors which can be used with any \TikZ; node belonging to a \FoRest;
+tree (manually added \TikZ; nodes are thus excluded).
+
+\newcommand\indexdefneganchor[1]{\indexdef[index key=#1]{anchor>-#1}}
+\begin{syntax}
+\indexitem{anchor>parent anchor}\itemnosep
+\indexitem{anchor>child anchor}\itemnosep
+\indexitem{anchor>anchor}
+
+ These anchors point to coordinates determined by node options \index{option>parent anchor},
+ \index{option>child anchor} and \index{option>anchor}.
+
+\indexitem{anchor>parent}, \indexdef{anchor>parent'}, \indexdefneganchor{parent}, \indexdefneganchor{parent'}\itemnosep
+\indexitem{anchor>parent first}, \indexdef{anchor>parent first'}, \indexdefneganchor{parent first}, \indexdefneganchor{parent first'}\itemnosep
+\indexitem{anchor>first}, \indexdef{anchor>first'}\itemnosep
+\indexitem{anchor>children first}, \indexdef{anchor>children first'}, \indexdefneganchor{children first}, \indexdefneganchor{children first'}\itemnosep
+\indexitem{anchor>children}, \indexdef{anchor>children'}, \indexdefneganchor{children}, \indexdefneganchor{children'}\itemnosep
+\indexitem{anchor>children last}, \indexdef{anchor>children last'}, \indexdefneganchor{children last}, \indexdefneganchor{children last'}\itemnosep
+\indexitem{anchor>last}, \indexdef{anchor>last'}\itemnosep
+\indexitem{anchor>parent last}, \indexdef{anchor>parent}, \indexdefneganchor{parent last},\indexdefneganchor{parent last'}
+
+Growth direction based anchors.
+
+ \TikZ;'s ``compass anchors'' |east|, |north| etc.\ resolve to coordinates on the border of the
+ node facing east, north etc.\ (for the shapes that define these anchors). The above \FoRest;'s
+ anchors are similar in that they also resolve to coordinates on the border of the node. However,
+ the ``cardinal directions'' are determined by the \index{grow}th direction of the tree in the node
+ and its parent:
+
+ \begin{itemize}
+ \item anchor |parent| faces the parent node (or, in case of the root, where the parent would be);
+ \item anchor |children| faces the children (or, in case of a node without children, where the children would be);
+ \item anchor |first| faces the first child (or \dots\ you get it, right?);
+ \item anchor |last| faces the last child (or \dots\ you know!).
+ \end{itemize}
+ Combinations like |children_first| work like combinations of compass directions, e.g.\
+ |north_west|, but note that
+ \begin{itemize}
+ \item when |first| and |last| are combined with |parent| into |parent_first| and |parent_last|,
+ they refer to the first and last child of the parent node, i.e.\ siblings of the current node.
+ \end{itemize}
+
+ While |first| and |last| always point in opposite directions, |parent| and |children| do not do so
+ if the \index{grow}th direction of the tree changes in the node, i.e.\ if the node's \index{grow}
+ differs from it's parent's \index{grow}. Thus in general, it is useful to have anchors |-parent|
+ and |-children|, which point in the opposite directions as |parent| and |children|, respectively,
+ and their combinations with |first| and |last|.
+
+ The |'| variants refer precisely to
+ the point where the cardinal growth direction intersects the border. Variants without |'| snap to
+ the closest compass anchor of the node.
+
+ These anchors work as expected even if the node is \index{rotate}d, or if the
+ children are \index{reversed}.
+
+ For simple examples, see definitions of \index{sn edges} and \index{roof}; for more involved
+ examples, see the \reflibrary{edges} library.
+\end{syntax}
+
+\begin{forestexample}[layout=tree on top]
+ \def\redorblue#1{\expandafter\redorbluei#1\END}%
+ \def\redorbluei#1#2\END{\expandafter\ifx#1-red\else blue\fi}%
+ \forestset{
+ draw anchors/.style n args=3{% #1=above, #2=below, #3='-variant of anchor?
+ tikz={
+ \foreach \a in {first,last,parent first,parent last,children,children last,#1}
+ {\fill[](.\a#3)circle[radius=1pt] node[above,font=\tiny,color=\redorblue\a]{\a#3};}
+ \foreach \a in {-parent first,-parent,-parent last,-children,-children first,#2}
+ {\fill[](.\a#3)circle[radius=1pt] node[below,font=\tiny,color=\redorblue\a]{\a#3};}
+ }
+ },
+ draw anchors/.default={parent,children first}{-children last}{},
+ }
+ \begin{forest}
+ for tree={
+ minimum width=10em, minimum height=13ex, s sep+=5em,
+ draw, draw anchors,
+ font=\tt, delay={content/.process=OOw2{grow}{reversed}{grow\ifnum#2=1'\fi=#1}}
+ }
+ [
+ [,rotate=20,draw anchors={parent,children first}{-children last}{'}]
+ [,for tree={grow'=0}, l sep+=5em, draw anchors={-children last}{parent,children first}{}
+ [,rotate=-60]
+ []
+ ]
+ ]
+ \end{forest}
+\end{forestexample}
+
+\subsection{Additional \texttt{pgfmath} functions}
+\label{ref:pgfmath}
+
+For every option and register, \foRest; defines a |pgfmath| function with the same name, with the
+proviso that the name might be mangled in order to conform to |pgfmath|'s naming rules. Specifically,
+all non-alphanumeric characters in the option/register name and the initial number, if
+the name starts with one, are replaced by an underscore |__| in the |pgfmath| function name.
+
+Pgfmath functions corresponding to options take one argument, a \index{relative node name}
+(see~\S\ref{ref:relative-node-names}) expression, making it possible to refer to option values of
+non-current nodes. The \meta{relative node name} expression must be enclosed in double quotes in
+order to
+prevent pgfmath evaluation: for example, to refer to the content of the parent, write
+\index{content}|("|\index>{!}|u")|. To refer to the option of the current node, use empty parentheses:
+\index{content}|()|.\footnote{In most cases, the parentheses are optional, so \texttt{content}
+is ok. A known case where this doesn't work is preceding an operator: \texttt{l+1cm} will fail.}
+
+If the \index{relative node name} resolves to the invalid node, these functions will an return empty
+token list (for \meta{toks} options), 0pt (for \meta{dimen} options) or 0 (for \meta{count}
+options).
+
+Note that the nodewalk in the relative node name inherits its history from the outer nodewalk (if
+there is one), so strange but useful constructions like the following are possible.
+
+\begin{forestexample}[index={tikz,wrap pgfmath arg,nodewalk,back,b,ancestors,register>every step}]
+ \begin{forest}
+ for tree={no edge},
+ before typesetting nodes={
+ for nodewalk={
+ c,
+ every step={
+ tikz/.wrap pgfmath arg=
+ {\draw[<-] ()--(#1);}
+ {name("~!b~")}
+ },
+ 21{up1},ancestors
+ }{}
+ },
+ [1[2[3]][4[5]]]
+ \end{forest}
+\end{forestexample}
+
+Boolean function \indexdef{pgfmath>valid} returns true if the node's \index{readonly option>id}$\neq0$, i.e.\ if the node is a real, valid node; see \S\ref{ref:spatial-propagators} and \S\ref{ref:nodewalks}. Boolean function \indexdef{pgfmath>invalid} is a negation of |valid|.
+
+\begin{syntax}
+\indexitem{pgfmath>min_l}|=(|\meta{nodewalk: node}|,|\meta{nodewalk: context node}|)| \itemnosep
+\indexitem{pgfmath>min_s}|=(|\meta{nodewalk: node}|,|\meta{nodewalk: context node}|)| \itemnosep
+\indexitem{pgfmath>max_l}|=(|\meta{nodewalk: node}|,|\meta{nodewalk: context node}|)| \itemnosep
+\indexitem{pgfmath>max_s}|=(|\meta{nodewalk: node}|,|\meta{nodewalk: context node}|)|
+
+ These functions return the minimum/maximum value of \index{option>l}/\index{option>s} of node at the end of \meta{nodewalk:
+ node} in the context (i.e.\ growth direction) of node at the end of \meta{nodewalk: context
+ node}.
+\end{syntax}
+
+Three string functions are also added to |pgfmath|: \indexdef{pgfmath>strequal} tests the equality of
+its two arguments; \indexdef{pgfmath>instr} tests if the first string is a substring of the second one;
+\indexdef{pgfmath>strcat} joins an arbitrary number of strings.
+
+\bigskip
+
+Some random notes on |pgfmath|: \begin{enumerate*}[(i)]
+\item |&&|, \verb!||! and |!| are boolean ``and'', ``or'' and ``not'', respectively.
+\item The equality operator (for numbers and dimensions) is |==|, \emph{not} |=|.
+\end{enumerate*} And some examples:
+
+\begin{forestexample}[layout=tree on top,index={for step,tree,grow',calign,option>l,l sep,option>child
+anchor,option>anchor,fit,tier,readonly option>level,delay,before typesetting nodes,content,wrap $n$ pgfmath args,pgfmath},index>={!}]
+ \begin{forest}
+ for tree={grow'=0,calign=first,l=0,l sep=2em,child anchor=west,anchor=base
+ west,fit=band,tier/.pgfmath=~level~()},
+ fullpath/.style={if n=0{}{content/.wrap 2
+ pgfmath args={##1/##2}{~content~("!u")}{~content~()}}},
+ delay={for tree=fullpath,content=/},
+ before typesetting nodes={for tree={content=\strut#1}}
+ [
+ [home
+ [joe
+ [\TeX]]
+ [saso
+ [\TeX]]
+ [a user with a long name
+ [\TeX]]]
+ [usr]]
+ \end{forest}
+\end{forestexample}
+
+\begin{forestexample}[point=instr,index={delay,for step,tree,conditional>if,content,n children}]
+ % mark non-phrasal terminal nodes
+ \begin{forest}
+ delay={for tree={if=
+ {!instr("P",~content~) && ~n_children~==0}
+ {fill=yellow}
+ {}
+ }}
+ [CP[DP][C'[C][TP[DP][T'[T][VP[DP][V'[V][DP]]]]]]]
+ \end{forest}
+\end{forestexample}
+
+{\def\useforestlibrary#1{}%
+\begin{forestexample}[point=instr,index={where option,n children,tier,content,no edge,tikz},index>={!}]
+ % roof terminal phrases
+ \useforestlibrary{linguistics}
+ % ...
+ \begin{forest}
+ delay={where n children=0{tier=word,
+ if={~instr~("P",~content~("!u"))}{roof}{}
+ }{}},
+ [VP[DP[Mary]][V'[V[loves]][DP[her cat]]]]
+ \end{forest}
+\end{forestexample}}
+
+
+\subsection{Standard node}
+\label{ref:standard-node}
+
+\begin{syntax}
+\indexitem{macro>forestStandardNode}\meta{node}\meta{environment fingerprint}\meta{calibration
+ procedure}\meta{exported options}
+
+ This macro defines the current \emph{standard node}. The standard node declares some options as
+ \emph{exported}. When a new node is created, the values of the exported options are initialized
+ from the standard node. At the beginning of every \index{forest} environment, it is checked whether
+ the \emph{environment fingerprint} of the standard node has changed. If it did, the standard
+ node is \emph{calibrated}, adjusting the values of exported options. The \emph{raison d'etre} for
+ such a system is given in \S\ref{tut:defaults}.
+
+ In \meta{node}, the standard node's content and possibly other options are specified, using the
+ usual bracket representation. The \meta{node}, however, \emph{must not contain children}. The
+ default: \texttt{[dj]}.
+
+ The \meta{environment fingerprint} must be an expandable macro definition. It's expansion
+ should change whenever the calibration is necessary.
+
+ \meta{calibration procedure} is a keylist (processed in the |/forest| path) which calculates the
+ values of exported options.
+
+ \meta{exported options} is a comma-separated list of exported options.
+
+ This is how the default standard node is created:
+\begin{lstlisting}
+ \forestStandardNode[dj]
+ {%
+ \forestOve{\csname forest@id@of@standard node\endcsname}{content},%
+ \the\ht\strutbox,\the\pgflinewidth,%
+ \pgfkeysvalueof{/pgf/inner ysep},\pgfkeysvalueof{/pgf/outer ysep},%
+ \pgfkeysvalueof{/pgf/inner xsep},\pgfkeysvalueof{/pgf/outer xsep}%
+ }
+ {
+ l sep={\the\ht\strutbox+\pgfkeysvalueof{/pgf/inner ysep}},
+ l={l_sep()+abs(max_y()-min_y())+2*\pgfkeysvalueof{/pgf/outer ysep}},
+ s sep={2*\pgfkeysvalueof{/pgf/inner xsep}}
+ }
+ {l sep,l,s sep}
+ \end{lstlisting}
+\end{syntax}
+
+\subsection{Externalization}
+\label{ref:externalization}
+
+Externalized tree pictures are compiled only once. The result of the compilation is saved into a
+separate |.pdf| file and reused on subsequent compilations of the document. If the code of the
+tree (or the context, see below) is changed, the tree is automatically recompiled.
+
+Externalization is enabled by:
+\begin{lstlisting}
+ \usepackage[~external~]{forest}
+ ~\tikzexternalize~
+\end{lstlisting}
+Both lines are necessary. \TikZ;'s externalization library is automatically loaded if necessary.
+
+\begin{syntax}
+\indexitem{node key>external/optimize} Parallels \keyname{/tikz/external/optimize}: if |true| (the
+default), the processing of non-current trees is skipped during the embedded compilation.
+\indexitem{node key>external/context} If the expansion of the macro stored in
+this option changes, the tree is recompiled.
+\indexitem{node key>external/depends on macro}|=|\meta{cs} Adds the definition of macro \meta{cs} to
+\keyname{external/context}. Thus, if the definition of \meta{cs} is changed, the tree will be
+recompiled.
+\end{syntax}
+
+\foRest; respects or is compatible with several (not all) keys and commands of \TikZ;'s
+externalization library. In particular, the following keys and commands might be useful; see
+\cite[\S32]{tikzpgf2.10}.
+\begin{itemize}
+\item\keyname{/tikz/external/remake next}
+\item\keyname{/tikz/external/prefix}
+\item\keyname{/tikz/external/system call}
+\item\cmdname{tikzexternalize}
+\item\cmdname{tikzexternalenable}
+\item\cmdname{tikzexternaldisable}
+\end{itemize}
+\FoRest; does not disturbe the externalization of non-\foRest; pictures. (At least it
+shouldn't \dots)
+
+The main auxiliary file for externalization has suffix |.for|. The externalized pictures have
+suffices |-forest-|$n$ (their prefix can be set by \keyname{/tikz/external/prefix}, e.g.\ to a
+subdirectory). Information on all trees that were ever externalized in the document (even if
+they were changed or deleted) is kept. If you need a ``clean'' |.for| file, delete it and
+recompile. Deleting |-forest-|$n$|.pdf| will result in recompilation of a specific tree.
+
+Using \keyname{draw tree} and \keyname{draw tree'} multiple times \emph{is} compatible with
+externalization, as is drawing the tree in the box (see \index{draw tree box}). If you are
+trying to externalize a \index{forest} environment which utilizes \index{TeX} to produce a
+visible effect, you will probably need to use \index{TeX'} and/or \index{TeX''}.
+
+\setcounter{CodelineNo}{0}
+\DocInput{forest-libs.dtx}
+
+\section{Gallery}
+\label{sec:gallery}
+
+\subsection{Decision tree}
+\label{sec:example-decision-tree}
+
+The following example was inspired by a question on \TeX\ Stackexchange:
+\href{http://tex.stackexchange.com/questions/39103/how-to-change-the-level-distance-in-tikz-qtree-for-one-level-only}{How to change the level distance in tikz-qtree for one level only?}. The question is about |tikz-qtree|: how to adjust the level distance for the first level only, in order to avoid first-level labels crossing the parent--child edge. While this example solves the problem (by manually shifting the offending labels; see \texttt{elo} below), it does more: the preamble is setup so that inputing the tree is very easy.
+
+\begin{forestexample}[layout=tree on top,index={if option,readonly option>n,no edge,tikz,strequal,strcat,option>child anchor,option>parent
+anchor,option>anchor,anchor>anchor,calign,for step,tree,s sep,option>l,n children,declare toks,delay,content,before typesetting nodes,descendants,keylist+=tikz,wrap pgfmath arg,wrap $n$ pgfmath args,split option},index>={!}]
+ \forestset{
+ declare toks={elo}{}, % Edge Label Options
+ anchors/.style={anchor=#1,child anchor=#1,parent anchor=#1},
+ dot/.style={tikz+={\fill (.child anchor) circle[radius=#1];}},
+ dot/.default=2pt,
+ decision edge label/.style n args=3{
+ edge label/.expanded={node[midway,auto=#1,anchor=#2,\forestoption{elo}]{\strut$\unexpanded{#3}$}}
+ },
+ decision/.style={if n=1
+ {decision edge label={left}{east}{#1}}
+ {decision edge label={right}{west}{#1}}
+ },
+ decision tree/.style={
+ for tree={
+ s sep=0.5em,l=8ex,
+ if n children=0{anchors=north}{
+ if n=1{anchors=south east}{anchors=south west}},
+ math content,
+ },
+ anchors=south, outer sep=2pt,
+ dot=3pt,for descendants=dot,
+ delay={for descendants={~split option~={content}{;}{content,decision}}},
+ }
+ }
+ \begin{forest} decision tree
+ [N,plain content
+ [I;{p_1=0.5},plain content,elo={yshift=4pt}
+ [{5,1};a]
+ [II;b,plain content
+ [{1,2};m]
+ [{2,3};n]
+ ]
+ ]
+ [II;{p_2=0.5},plain content,elo={yshift=4pt}
+ [;c
+ [{1,0};z]
+ [{2,2};t]
+ ]
+ [;d
+ [{3,1};z]
+ [{0,0};t]
+ ]
+ ] {\draw[dashed](!1.anchor)--(!2.anchor) node[pos=0.5,above]{I};}
+ ]
+ \end{forest}
+\end{forestexample}
+
+\setcounter{CodelineNo}{0}
+\DocInput{forest-index.dtx}
+
+\section{Past, present and future}
+\label{sec:changes}
+
+\paragraph{Roadmap} What's planned for future releases?
+\begin{itemize}
+\item filling up the libraries
+\item faster externalization
+\item custom-edge aware packing algorithm and a more flexible (successor of) \index{calign}
+\item support for specialized |forest| environments, including:
+ \begin{itemize}
+ \item selectable input parser,
+ \item namespaces (different function, different options),
+ \item better support for different output types.
+ \end{itemize}
+ In short, everything you need to make \foRest; your favourite spreadsheet! ;-)
+\item code cleanup and extraction of sub-packages possibly useful to other package writers
+\end{itemize}
+
+\subsection{Changelog}
+\label{sec:changelog}
+
+First of all, the list of all \index{compat} key values for backward compatibility, and their
+groupings. Remember, compat values that reside in styles with suffix |-most| are harmless: they will
+not disrupt the new functionality of the package. But take care when using stuff which only resides
+in |-all| styles.
+
+\lstinputregion{forest-compat.sty}{compat_keys}
+
+\newcommand\compatitem[2]{\item[,,in \texttt{-#1}]\texttt{compat=}\indexdef{value of=compat>#2}}
+
+\subsubsection{v2.1}
+
+\begin{description}
+\item[v2.1.5 (2017/07/14)] \mbox{}
+ Minor improvements:
+ \begin{itemize}
+ \item Smarter \index{baseline} defaults for the \reflibrary{linguistics} library.
+ \item Yield warning when the \index{baseline} is set to a node that is not drawn (e.g.\ a
+ \index{phantom} node).
+ \end{itemize}
+
+\item[v2.1.4 (2017/02/02)] \mbox{}
+
+ Performance:
+ \begin{itemize}
+ \item Reimplement some internals of the packing algorithm to avoid consuming the string pool in
+ documents with many trees. (We're about 10\% slower now, but (depending on the document) the
+ memory usage can drop up to five times!)
+ \end{itemize}
+
+ Bugfixes:
+ \begin{itemize}
+ \item Fix aggregate function \index{aggregate>count}.
+ \item Provide a workaround for a PGF bug: for coordinate-shaped nodes, |\positionnodelater|
+ provides dimensions with |pt| in a wrong catcode, so \index{max y} and friends did not work for
+ such nodes.
+ \end{itemize}
+
+\item[v2.1.3 (2017/01/27)] \mbox{}
+
+ Bugfixes:
+ \begin{itemize}
+ \item Update \index{nice empty nodes} to use \index{for step=\index{current and siblings}}.
+ \end{itemize}
+
+\item[v2.1.2 (2016/12/31)] \mbox{}
+
+ Bugfixes:
+ \begin{syntax}
+ \compatitem{all}{2.1.1-loops}
+ A level of hash doubling was unnecessarily introduced for the \meta{keylist} argument of all
+ loops (\S\ref{ref:loops}), and the \meta{nodewalk} argument of \index{process keylist'} and
+ \index{process delayed}. Use this key to revert to the old behaviour.
+ \end{syntax}
+
+ Minor improvements:
+ \begin{itemize}
+ \item Implemented key \index{also}.
+ \end{itemize}
+
+\item[v2.1.1 (2016/12/18)] \mbox{}
+
+ Minor improvements:
+ \begin{itemize}
+ \item Implemented argument processor instruction \index{processor>p}.
+ \end{itemize}
+
+ Bugfixes:
+ \begin{itemize}
+ \item Argument processor instruction \index{processor>u} introduced an extra layer of braces
+ around each result item.
+ \item Argument processor instructions \index{processor>l} and \index{processor>L} did not always
+ load the desided number of arguments.
+ \item Argument processor instructions \index{processor>and} and \index{processor>or} were taking
+ the arguments from the start of the left side instead of its end.
+ \end{itemize}
+
+\item[v2.1 (2016/12/05)] \mbox{}
+
+ Backward incompatible changes (with a \index{compat} key):
+ \begin{syntax}
+ \compatitem{all}{2.0-edges}
+ This compat key groups the three changes listed below: the final two depend on the first, so you
+ will probably want to revert them all or none.
+ \begin{syntax}
+ \compatitem{all}{2.0-anchors}
+ This is really a bugfix. Growth direction based anchors \index{anchor>parent},
+ \index{anchor>parent first} and \index{anchor>parent last} were not facing to the direction of the
+ parent if the growth direction of the tree changed at the node.
+ \compatitem{all}{2.0-forkededge}
+ \compatitem{all}{2.0-folder}
+ Update the code of keys \index{forked edge} (and friends) and \index{folder} from the
+ \reflibrary{edges} library to reflect the above bugfix.
+ \end{syntax}
+ \compatitem{all}{2.0-delayn} Fixing yet another bug in \index{delay n}! The number of cycles was
+ reevaluated at each cycle. Now it is computed immediately, and fixed. Use this key to revert to
+ the old behaviour.
+ \end{syntax}
+
+ Performance:
+ \begin{itemize}
+ \item Substantially enhance the argument processor (\S\ref{ref:argument-processor}), including the
+ ability to use it as a drop-in replacement for |pgfmath|.
+ \item Internally, avoid using |\pgfmathparse| and friends whereever possible.
+ \item Implement a fast set of macros to determine if a |pgfmath| expression is just a \meta{count}
+ or \meta{dimen} expression.
+ \item Optimize \index{split option} and \index{split register}.
+ \end{itemize}
+ Minor improvements:
+ \begin{itemize}
+ \item Allow \index{relative node name}s in \index{handler>option}.
+ \item Make aggregate functions (\S\ref{ref:aggregate-functions}) nestable and implement their
+ |pgfmath| versions.
+ \item Implement
+ \index{if dimen GT=\meta{dimen option}}, \index{if dimen LT=\meta{dimen option}},
+ \index{if count GT=\meta{count option}}, \index{if count LT=\meta{count option}},
+ \index{where dimen GT=\meta{dimen option}}, \index{where dimen LT=\meta{dimen option}},
+ \index{where count GT=\meta{count option}} and \index{where count LT=\meta{count option}},
+ \item Implement \index{if current nodewalk empty}.
+ \item Implement nodewalk steps \index{leaves}, \index{-level} and \index{-level'}.
+ \item Implement nodewalk operation \index{unique}.
+ \item Implement \index{nodewalk key>on invalid} values \index{value of=on invalid>error if real} and \index{value of=on invalid>last valid}, remove value |step| (no \index{compat} key, as it was broken and useless).
+ \item Implement `-` anchors (\index{anchor>-parent} etc.).
+ \item Implement \index{save and restore register}.
+ \item Implement \index{handler>nodewalk style}.
+ \item Implement \index{forestloopcount}.
+ \item Allow multiple occurrences of package option \index{compat}.
+ %\item Implement \index{foresttypeouttrees}.
+ %\item Implement \index{show register}.
+ \end{itemize}
+
+ Bugfixes:
+ \begin{itemize}
+ \item Fix a bug in externalization (|\forest@file@copy| set |\endlinechar| to |-1|, which caused
+ problems for several packages, e.g. |biblatex|).
+ \item Fix a bug in \index{delay n}: the number of cycles was reevaluated at each cycle.
+ \item Fix a bug in \index{fixed edge angles}.
+ \item Fix \index{compat} key values \index{value of=compat>silent}, \index{value of=compat>1.0-forstep} and \index{value of=compat>1.0-stages}.
+ \item Fix invocations of spatial propagators \index{for step=\index{step>nodewalk}} and \index{for step=\index{step>Nodewalk}} and \index{node key>Nodewalk}.
+ \item Fix invocations of \index{for step=group}, \index{for step=next on tier} and \index{for step=previous on tier}.
+ \item Fix behaviour of \index{for step=next on tier}, \index{for step=previous on tier} and \index{for step=to tier} on arrival to the invalid node.
+ \item Fix problems with interaction between \index{folder} and \index{forked edges}.
+ \end{itemize}
+
+\end{description}
+
+\subsubsection{v2.0}
+
+
+\begin{description}
+\item[v2.0.3 (2016/04/03)] \mbox{}
+
+ Backward incompatible changes (with a \index{compat} key):
+ \begin{syntax}
+ \compatitem{all}{2.0.2-delayn}
+ \compatitem{all}{2.0.2-wrapnpgfmathargs}
+
+ This is really a bugfix: keys \index{delay n} and \index{wrap $n$ pgfmath args} (for $n\geq 2$)
+ were introducing two layers of hash doubling. Now this confusing behaviour is gone, but as
+ finding the correct number of hashes is always a tough job, \index{compat} keys are provided.
+ \end{syntax}
+
+ Improvements:
+
+ \begin{itemize}
+ \item Rework \index{draw tree edge} so that by default, an edge is drawn only it both its node and
+ its node's parent are drawn. And yes, implement \index{if node drawn}.
+ \item Implement circularity detection in dynamic node operations.
+ \item Implement debug categories and debugging of dynamic node operations.
+ \item Declare some further |tempdim...| registers.
+ \item Make option \index{readonly option>id} accessible via \index{forestoption}.
+ \end{itemize}
+
+ Bugfixes:
+
+ \begin{itemize}
+ \item Execute \index{tikz} code for all (including phantom) nodes. (The feature of ignoring
+ phantom nodes was introduced in v2.0.2, but turns out it was a bad idea: for example, having a
+ phantom root with some tikz code is not uncommon.)
+ \item Keys \index{label} and \index{pin} now \emph{append} to option \index{tikz}, as makes sense.
+ \item Fix nodewalk steps \index{filter} and \index{branch} so that they can be embedded under
+ nodewalk operations. (Uh, and recategorize them as operations themselves.)
+ \item Execute \index{before packing node} even when the node has no children.
+ \item \index{step>level}|<={0}{...}| now works as expected.
+ \item Re-setting the node name to the same value doesn't yield an error anymore.
+ \item Don't add the separator when adding the first element to a keylist option or register.
+ \item Copy externalization files in TeX (don't rely on |\write18|).
+ \item Consistently store dimen options and registers with |pt|s of catcode other.
+ \item Properly initialize readonly count options (\index{readonly option>n}, \index{readonly option>n'}, \index{n children} and
+ \index{readonly option>level}).
+ \item Fix some typos.
+ \end{itemize}
+
+\item[v2.0.2 (2016/03/04)] \mbox{}
+
+ Backward incompatible changes:
+ \begin{itemize}
+ \item The semantics of the parenthesized optional argument to \index{forest} environment and
+ \index{Forest} macro has changed. The argument was introduced in v2.0.0: if present, it
+ redefined \index{style>stages} style for the current environment/macro. This argument is now
+ generalized to allow further (pre-\index{style>stages}) customization in future versions of the
+ package. To temporarily redefine \index{style>stages}, write |(|\index{option of=forest>stages}|={...})|.
+ \end{itemize}
+
+ New functionality:
+ \begin{itemize}
+ \item Key \index{last dynamic node} and named nodewalk \index{dynamic nodes}.
+ \item An optional argument to \index{useforestlibrary} to pass package options to libraries.
+ \item Handler \index{nodewalk style}.
+ \item Keys \index{draw tree node'}, \index{draw tree edge'} and \index{draw tree tikz'}.
+ \end{itemize}
+
+ Bugfixes:
+ \begin{itemize}
+ \item Fixed \index{replace by} when applied to the root node.
+ \item Registers are now initialized to an empty string, 0pt, or 0.
+ \item Packing doesn't destroy the current pgfpath anymore.
+ \item \index{forestStandardNode} now uses \index{name'}.
+ \item \index{draw tree edge} now respects \index{phantom}.
+ \end{itemize}
+
+\item[v2.0.1 (2016/02/20)] \mbox{}
+
+ New functionality:
+ \begin{itemize}
+ \item \index{current and siblings}, \index{current and siblings reversed}
+ \item Add |*| argument to \index{useforestlibrary}.
+ \end{itemize}
+
+ Bugfixes:
+ \begin{itemize}
+ \item Correctly mangle option/register names to pgfmath names (\S\ref{ref:pgfmath}).
+ \item Refer to parent (not node) anchor in \index{calign}|=|\index{edge midpoint}.
+ \item Accept key \index{history} in \index{step>Nodewalk} config.
+ \end{itemize}
+\item[v2.0.0 (2016/01/30)] \mbox{}\footnote{The year of the release date in the package was wrong \dots \ 2015.}
+
+ Backwards incompatible changes (\emph{without} a \index{compat} key --- sorry!):
+ \begin{itemize}
+ \item The unintended and undocumented way to specify defaults using |\forestset{.style={...}}|
+ (see question
+ \href{http://tex.stackexchange.com/questions/167972/making-a-certain-tree-style-the-default-for-forest}{Making
+ a certain tree style the default for forest} at \TeX\ SE) does not work anymore. (Actually, it
+ has never truly worked, and that's why it has not \index{compat} key.) Use \index{default
+ preamble}.
+ \item Renamed augmented assignment operator \meta{option}|-| for prepending to \meta{toks} and
+ \meta{keylist} options \index{+toks=\meta{option}}\index[not print]{+keylist}. A new
+ \index{keylist-=\meta{option}} is defined for keylist options and means ``delete key from keylist.''
+ \item Short nodewalk steps are not simply styles anymore: use \index{define short step} to
+ define them.
+ \end{itemize}
+
+ Backwards incompatible changes with a \index{compat} key:
+
+ \begin{syntax}
+ \compatitem{all}{1.0-stages}
+
+ Processing of \index{given options}, which is now exposed, and the new keylists \index{default
+ preamble} and \index{preamble} is now included at the start of the default \index{style>stages}
+ style. When changing \index{style>stages}, the instruction to process these keylists must now be
+ given explicitely.
+
+ \compatitem{all}{1.0-forstep}
+
+ In v1.0, a spatial propagator \index{for step=\meta{step}} could never fail. This turned out to
+ be difficult to debug. In this version, when a propagator steps ``out of the tree'', an error
+ is raised by default. Check out \index{option of=Nodewalk>on invalid} to learn how to simulate
+ the old behaviour without using this compatibility key.
+
+ \compatitem{all}{1.0-rotate}
+
+ This version of the package introduces
+ option \index{rotate} and \index{autoforward}s it to \index{node options}. This is needed to
+ handle the new \foRest; anchors (\S\ref{sec:anchors}). However, in some rare cases (like the
+ tree on the title page of this manual) it can lead to a discrepancy between the versions, as the
+ time when the value given to \index{rotate} is processed is different. |1.0-rotate| removes
+ option \index{rotate}.
+
+ \compatitem{all}{1.0-name}
+
+ Documentation of v1.0 requested that node names be unique, but this was not enforced by the
+ package, sometimes leading to errors. v2.0 enforces node name uniqueness. If this causes
+ problems, use this compatibility key. In most cases using \index{name'} instead of
+ \index{option>name} should fix the problem without using compatibility mode.
+
+ \item These keys have been renamed:
+
+ \begin{tabularx}{\linewidth}{lll}
+ old&new&\index{compat} key {\small (all but the last are in \texttt{-most})}\\\hline
+ \keyname{node walk}&\index{for step=nodewalk}\footnote{Nodewalks are much improved in v2.0, so some syntax and keys are different than in v1.0!}&\indexdef{value of=compat>1.0-nodewalk}\\
+ \keyname{for}&\index{for step=\index{group}}&\indexdef{value of=compat>1.0-for}\\
+ \keyname{for all next}&\index{for step=\index{following siblings}}&\indexdef{value of=compat>1.0-forall}\\
+ \keyname{for all previous}&\index{for step=\index{preceding siblings}}&\indexdef{value of=compat>1.0-forall}\\
+ \keyname{for ancestors'}&\index{for step=\index{current and ancestors}}&\indexdef{value of=compat>1.0-ancestors}\\
+ (\keyname{for}) \keyname{linear next}&(\index{for step}) \index{next node}&\indexdef{value of=compat>1.0-linear}\\
+ (\keyname{for}) \keyname{linear previous}&(\index{for step}) \index{previous node}&\indexdef{value of=compat>1.0-linear}\\
+ \keyname{triangle}&\index{roof} (library \reflibrary{linguistics})&\indexdef{value of=compat>1.0-triangle}\\
+ \keyname{/tikz/fit to tree}&\index{fit to}\keyname{=}\index{tree}\footnote{The v1.0 key \keyname{/tikz/fit to tree} also set \keyname{inner sep=0}; the v2.0 key \index{fit to} does not do that.}&\indexdef{value of=compat>1.0-fittotree}\\
+ \keyname{begin forest}, \keyname{end forest}&none (use \index{style>stages})&\index{1.0-stages}\\
+ \keyname{end forest}, \keyname{end forest}&none (use \index{style>stages})&\index{1.0-stages}\\
+ \end{tabularx}
+ \end{syntax}
+
+ Good news:
+ \begin{itemize}
+ \item Added temporal propagators \index{before packing node} and \index{after packing node}.
+ \item \emph{Much} improved nodewalks, see \S\ref{ref:nodewalks} and \S\ref{ref:spatial-propagators}.
+ \item Implemented looping mechanisms and more conditionals, see \S\ref{ref:conditionals}.
+ \item Implemented library support and started filling up the libraries:
+ \begin{itemize}
+ \item \reflibrary{linguistics}: \index{sn edges}, \index{nice empty nodes}, \index{draw
+ brackets}, \index{c-commanded} and \index{c-commanders}
+ \item \reflibrary{edges}: \index{forked edges} and \index{folder}
+ \end{itemize}
+ \item Implemented aggregate functions, see \S\ref{ref:aggregate-functions}.
+ \item Added key \index{default preamble}.
+ \item Implemented anchors \index{anchor>parent}, \index{anchor>children}, \index{anchor>first},
+ \index{anchor>last}, etc.
+ \item Added key \index{split} and friends.
+ \item Implemented sorting of children, see \S\ref{ref:dynamic}.
+ \item Introduced registers, see \S\ref{sec:options-and-registers}.
+ \item Implemented handlers \index{handler>option}, \index{handler>register} and \index{process args}.
+ \item Implemented several friends to \index{process keylist}, introduced \index{processing order}s
+ and \index{draw tree method}.
+ \item Added the optional argument |(|\meta{stages}|)| to the \index{forest} environment and
+ \index{Forest} macro.
+ \item Implemented \index{autoforward}ing.
+ \item Implemented flexible handling of unknown keys using \index{unknown to}.
+ \item Implemented |pgfmath| functions \index{pgfmath>min_l}, \index{pgfmath>max_l}, \index{pgfmath>min_s}, \index{pgfmath>max_s}.
+ \item Implemented augmented assignment operator \index{keylist-=\meta{keylist option}} for removing keys from keylists.
+ \item Implemented a generalized \index{fit to} key.
+ \item Implemented a very slow \foRest;-based indexing system (used to index this documentation)
+ and included it in the gallery (\S\ref{sec:forest-index}).
+ \item Added some minor keys: \index{edge path'}, \index{node format'}, \index{create'} and \index{plain content}.
+ \item Added some developer keys: \index{copy command key}, \index{typeout}.
+ \end{itemize}
+
+ Bugfixes:
+ \begin{itemize}
+ \item In computation of numeric tree-structure info, when called for a non-root node.
+ \item \TikZ;'s externalization internals (signature of
+ |\tikzexternal@externalizefig@systemcall@uptodatecheck|) have changed: keep up to date,
+ though only formally.
+ \item \index{delay} was not behaving additively.
+ \item \index{option>name}, \index{alias} and \index{baseline} didn't work properly when
+ setting them for a non-current node.
+ \item Augmented assignments for count options were leaking `.0pt'.
+ \item \index{create} didn't work properly in some cases.
+ \item \keyname{triangle} (now \index{roof} in \reflibrary{linguistics}) didn't use |cycle| in the edge path
+ \end{itemize}
+
+\end{description}
+
+\subsubsection{v1.0}
+
+\begin{description}
+\item[v1.0.10 (2015/07/22)] \mbox{}
+ \begin{compactitem}
+ \item Bugfix: a left-over debugging |\typeout| command was interfering with a |forest| within |tabular|, see \href{http://tex.stackexchange.com/questions/256509/odd-incompatibility-between-multi-line-forest-nodes-and-tabular}{this question on TeX.SE}.
+ \item A somewhat changed versioning scheme \dots
+ \end{compactitem}
+\item[v1.09 (2015/07/15)] \mbox{}
+ \begin{compactitem}
+ \item Bugfix: child alignment was not done in nodes with a single child, see \href{http://tex.stackexchange.com/questions/255309/elementary-forest-question-meaning-of-calign-parent-anchor-and-child-anchor}{this question on TeX.SE}.
+ \end{compactitem}
+\item[v1.08 (2015/07/10)] \mbox{}
+ \begin{compactitem}
+ \item Fix externalization (compatibility with new |tikz| features).
+ \end{compactitem}
+\item[v1.07 (2015/05/29)] \mbox{}
+ \begin{compactitem}
+ \item Require package |elocalloc| for local boxes, which were previously defined by package |etex|.
+ \end{compactitem}
+\item[v1.06 (2015/05/04)] \mbox{}
+ \begin{compactitem}
+ \item Load |etex| package: since v2.1a, |etoolbox| doesn't do it anymore.
+ \end{compactitem}
+\item[v1.05 (2014/03/07)] \mbox{}
+ \begin{compactitem}
+ \item Fix the node boundary code for rounded rectangle. (Patch contributed by Paul Gaborit.)
+ \end{compactitem}
+\item[v1.04 (2013/10/17)] \mbox{}
+ \begin{compactitem}
+ \item Fixed an \href{http://tex.stackexchange.com/questions/138986/error-using-tikzexternalize-with-forest/139145}{externalization bug}.
+ \end{compactitem}
+\item[v1.03 (2013/01/28)] \mbox{}
+ \begin{compactitem}
+ \item Bugfix: options of dynamically created nodes didn't get processed.
+ \item Bugfix: the bracket parser was losing spaces before opening braces.
+ \item Bugfix: a family of utility macros dealing with affixing token lists was not expanding
+ content correctly.
+ \item Added style \index{math content}.
+ \item Replace key \keyname{tikz preamble} with more general \index{begin draw} and
+ \index{end draw}.
+ \item Add keys \keyname{begin forest} and \keyname{end forest}.
+ \end{compactitem}
+\item[v1.02 (2013/01/20)] \mbox{}
+ \begin{compactitem}
+ \item Reworked style \index{style>stages}: it's easier to modify the processing flow now.
+ \item Individual stages must now be explicitely called in the context of some (usually root)
+ node.
+ \item Added \index{delay n} and \index{if have delayed}.
+ \item Added (experimental) \index{pack'}.
+ \item Added reference to the \href{https://github.com/sasozivanovic/forest-styles}{style
+ repository}.
+ \end{compactitem}
+\item[v1.01 (2012/11/14)] \mbox{}
+
+ \begin{compactitem}
+ \item Compatibility with the |standalone| package: temporarily disable the effect of
+ |standalone|'s package option |tikz| while typesetting nodes.
+ \item Require at least the [2010/08/21] (v2.0) release of package |etoolbox|.
+ \item Require version [2010/10/13] (v2.10, rcs-revision 1.76) of \PGF;/\TikZ;. Future
+ compatibility: adjust to the change of the ``not yet positioned'' node name (2.10 |@|
+ $\rightarrow$ 2.10-csv |PGFINTERNAL|).
+ \item Add this changelog.
+ \end{compactitem}
+\item[v1.0 (2012/10/31)] First public version
+\end{description}
+
+
+
+\subsection{Known bugs}
+\label{sec:bugs}
+
+If you find a bug (there are bound to be some \dots), please contact
+me at \href{mailto:saso.zivanovic@guest.arnes.si}{saso.zivanovic@guest.arnes.si}.
+
+\subsubsection*{System requirements}
+
+This package requires \LaTeX\ and e\TeX. If you use something
+else: sorry.
+
+The requirement for \LaTeX\ might be dropped in the future, when I get some time and energy for a
+code-cleanup (read: to remedy the consequences of my bad programming practices and general
+disorganization).
+
+The requirement for e\TeX\ will probably stay. If nothing else, \foRest; is heavy on boxes: every
+node requires its own \dots\ and consequently, I have freely used e\TeX\ constructs in the code
+\dots
+
+\subsubsection*{\PGF; internals}
+
+\FoRest; relies on some details of \PGF; implementation, like the name
+of the ``not yet positioned'' nodes. Thus, a new bug might appear with the development of \PGF;.
+If you notice one, please let me know.
+
+\subsubsection*{Edges cutting through sibling nodes}
+\label{sec:cutting-edge}
+
+In the following example, the R--B edge crosses the AAA node, although \index{ignore edge} is
+set to the default |false|.
+\begin{forestexample}[index={calign,{value of=calign>first},align,{value of=align>center},base,{value of=base>bottom}}]
+ \begin{forest}
+ calign=first
+ [R[AAAAAAAAAA\\AAAAAAAAAA\\AAAAAAAAAA,align=center,base=bottom][B]]
+ \end{forest}
+\end{forestexample}
+This happens because s-distances between the adjacent children are
+computed before child alignment (which is obviously the correct order in the general case), but
+child alignment non-linearly influences the edges. Observe that the with a different value of
+\index{calign}, the problem does not arise.
+\begin{forestexample}[index={calign,{value of=calign>last},align,{value of=align>center},base,{value of=base>bottom}}]
+ \begin{forest}
+ calign=last
+ [R[AAAAAAAAAA\\AAAAAAAAAA\\AAAAAAAAAA,align=center,base=bottom][B]]
+ \end{forest}
+\end{forestexample}
+While it would be possible to fix the situation after child alignment (at least for some child
+alignment methods), I have decided against that, since the distances between siblings would soon
+become too large. If the AAA node in the example above was large enough, B could easily be pushed
+off the paper. The bottomline is, please use manual adjustment to fix such situations.
+
+\subsubsection*{Orphans}
+\label{sec:orphans}
+
+If the \index{option>l} coordinates of adjacent children are too different (as a result of manual adjustment or
+tier alignment), the packing algorithm might have nothing so say about the desired distance
+between them: in this sense, node C below is an ``orphan.''
+\begin{forestexample}[index={for step,tree,s sep,option>l,dimen*}]
+ \begin{forest}
+ for tree={s sep=0,draw},
+ [R[A][B][C,l*=2][D][E]]
+ \end{forest}
+\end{forestexample}
+To prevent orphans from ending up just anywhere, I have decided to vertically align them with
+their preceding sibling --- although I'm not certain that's really the best solution. In other
+words, you can rely that the sequence of s-coordinates of siblings is non-decreasing.
+
+The decision also influences a similar situation illustrated below. The packing algorithm puts
+node E immediately next to B (i.e.\ under C): however, the monotonicity-retaining mechanism then
+vertically aligns it with its preceding sibling, D.
+\begin{forestexample}[index={for step,tree,s sep,tier}]
+ \begin{forest}
+ for tree={s sep=0,draw},
+ [R[A[B,tier=bottom]][C][D][E,tier=bottom]]
+ \end{forest}
+\end{forestexample}
+
+Obviously, both examples also create the situation of an edge crossing some sibling node(s).
+Again, I don't think anything sensible can be done about this, in general.
+
+
+\subsection{Acknowledgements}
+
+This package has turned out to be much more successful and widespread than I could have ever
+imagined and I want to thank all the users for the trust. Many of you have also contributed to the
+package in some way: by providing comments and ideas, sending patches, reporting bugs and so on. To
+you, I'm doubly grateful! I will not even try to list you all here, as the list is getting too long
+for me to maintain, but I do want to mention one person, a member of the friendly community at the
+excellent and indispensable \href{http://tex.stackexchange.com}{\TeX\ -- \LaTeX\ Stack Exchange} and
+the author of the very first \foRest;-based package,
+\href{http://ctan.org/pkg/prooftrees}{Prooftrees}: without |cfr|'s uncountable questions, answers,
+bug reports and ideas, \foRest; would be a much poorer package indeed.
+
+
+
+\addcontentsline{toc}{section}{References}
+\bibliography{tex}
+\bibliographystyle{plain}
+
+\newpage
+\phantomsection
+\addcontentsline{toc}{section}{\indexname}
+\addtocontents{toc}{\protect\setbox0=\protect\vbox{\protect\iffalse}\protect\fi}
+\PrintIndex
+%\addtocontents{toc}{\protect\iffalse{\protect\fi}}
+%http://tex.stackexchange.com/questions/10291/addtocontents-at-end-of-document-not-getting-written-to-toc-file
+\makeatletter
+\immediate\write\@auxout{\noexpand\@writefile{toc}{\noexpand\iffalse{\noexpand\fi}}}
+\makeatother
+
+
+
+\end{document}
+
+%%% Local Variables:
+%%% mode: latex
+%%% fill-column: 100
+%%% TeX-command-default: "Make PDF"
+%%% TeX-master: t
+%%% End:
diff --git a/graphics/pgf/contrib/forest/forest-index.dtx b/graphics/pgf/contrib/forest/forest-index.dtx
new file mode 100644
index 0000000000..df2979690a
--- /dev/null
+++ b/graphics/pgf/contrib/forest/forest-index.dtx
@@ -0,0 +1,911 @@
+% \CheckSum{755}
+% \iffalse meta-comment
+% forest-index.dtx
+%% `forest-index' is an indexing system for the documentation of package
+%% `forest', using the package itself. (The derived `forest-index.sty' is not
+%% needed to use the package.)
+%%
+%% Copyright (c) 2012-2017 Saso Zivanovic
+%% (Sa\v{s}o \v{Z}ivanovi\'{c})
+%% saso.zivanovic@guest.arnes.si
+%%
+%% This work may be distributed and/or modified under the
+%% conditions of the LaTeX Project Public License, either version 1.3
+%% of this license or (at your option) any later version.
+%% The latest version of this license is in
+%%
+%% http://www.latex-project.org/lppl.txt
+%%
+%% and version 1.3 or later is part of all distributions of LaTeX
+%% version 2005/12/01 or later.
+%%
+%% This work has the LPPL maintenance status `author-maintained'.
+%%
+%% This file is a part of package `forest'. For the list of files
+%% constituting the package see main source file of the package,
+%% `forest.dtx', or the derived `forest.sty'.
+%%
+% \fi
+%
+% \newcommand\entry[1]{{``#1''}}
+%
+% \subsection{\protect{\texttt{forest-index}}}
+% \label{sec:forest-index}
+%
+% The indexing system used to document the \foRest; package uses the
+% package itself quite heavily. While this might be a bit surprising
+% at first sight, as indexing draws no trees, the indexing package
+% illustrates the usage of some of the more exotic features and
+% usage-cases of the \foRest; package, which is why its source is
+% included in this documentation.\footnote{Indexing with this package
+% makes the compilation very slow, so I cannot whole-heartedly
+% recommend it, but I still hope that it will make a useful example.}
+%
+% This package has three main functions:
+% \begin{itemize}
+% \item It is possible to index subentries using a \emph{short form}
+% of their index key, i.e.\ without referring to their ancestor
+% entries. For example, instead of writing |\index{option>content}|
+% one can simply write |\index{content}|. (Obviously, the subentry
+% must \entry{content} be defined as belonging to entry
+% \entry{option} first. This is done using
+% |\indexdef{option>content}|.) This works for all keys which are a
+% subentry of a single entry.
+% \item All subentries are automatically entered as main entries as
+% well, with a qualificator of which entry they belong to. So,
+% |\index{option>content}| produces two index entries: entry
+% \entry{option} with subentry \entry{content} and entry
+% \entry{content \scriptsize option}. This works for an arbitrary
+% number of subentry levels.
+% \item Entries can be given options that format the appearance of the
+% entry and/or its descendants in both text and index. (Entries that
+% format the appearance of their descendants are called categories
+% below.)
+% \item If |hyperref| package is loaded, the following hyperlinks are
+% created besides the standard ones linking the page numbers in
+% index to text:
+% \begin{enumerate*}[(i)]
+% \item entries in text link to the definition in text,
+% \item definitions in the text link to the index entry,
+% \item categories in index are cross-linked.
+% \end{enumerate*}
+%
+% \end{itemize}
+%
+% The \foRest; package mainly enters the picture with respect to the
+% entry formatting. A simple (narrow) tree is built containing an entry
+% and all its ancestors. Formatting instructions are then processed
+% using \foRest;'s option processing mechanisms.
+%
+% Finally, note that this package might change without retaining
+% backwards compatibility, and that changes of this package will not
+% be entered into the changelog.
+%
+% Identification.
+% \begin{macrocode}
+\ProvidesPackage{forest-index}
+\RequirePackage{forest}
+% \end{macrocode}
+% Remember the original \LaTeX's |\index| command.
+% \begin{macrocode}
+\let\forestindex@LaTeX@index\index
+% \end{macrocode}
+%
+% \subsubsection*{The user interface macros}
+%
+% \DescribeMacro{\index} is the general purpose macro.
+% \DescribeMacro{\indexdef} and \DescribeMacro{\indexex} are
+% shorthands for indexing definitions and
+% examples. \DescribeMacro{\indexitem} is a combination of |\indexdef|
+% and the |\item| of the |lstdoc| package. It automatically indexes
+% the command being documented. \DescribeMacro{\indexset} neither
+% typesets or indexes the entry, but only configures it; it is usually
+% used to configure categories. All these macros parse their
+% arguments using |xparse|. The arguments, listed in the reverse
+% order:
+% \begin{itemize}
+% \item The final argument, which is the only mandatory argument, is a
+% comma-separated list of index keys.
+% \item The boolean switch |>| just before the mandatory argument
+% signals that the keys are given in the full form. Otherwise, keys
+% without a level separator are considered short.
+% \item Indexing options are given by the |[|optional |]| argument.
+% \item The first |(|optional|)| argument of:
+% \begin{compactitem}
+% \item |\indexitem|: specifies the default value of the command.
+% \item |\index|: is used to
+% provide ``early'' options.
+% \end{compactitem}
+% \end{itemize}
+%
+% Among the options of these commands, three keylists are of special
+% importance: |index_key_format|, |index_form_format| and
+% |print_format|. These hold instructions on how to format the index
+% key, the form of the entry in the index and the form of the entry in
+% the main text. They work by modifying the contents of an
+% \indexex{autowrapped toks} register |result|.
+%
+% An example: how macros are indexed in this documentation. Style
+% |macro| defined below does everything needed to format a macro name:
+% it detokenizes the given name (in case the name contains some funny
+% characters), prefixes the backslash, wraps in in the typewriter
+% font, adds color and hyperlink (the final two styles are defined in
+% below this package). Note the usage of |\protect|: it is needed
+% because we want to use these styles to format entries not just in
+% the main next, but also in the index.
+% \lstinputregion{forest-doc.tex}{index_macro_style} Then, we
+% configure the main level entry \entry{macro}: the child of this
+% entry will be formatted (both in index and in the main text) using
+% the previously defined style.
+% \lstinputregion{forest-doc.tex}{index_macro_category} Usage is then
+% simple: we write |\indexex{macro>forestoption}| (or simply
+% |\indexex{forestoption}| to get \indexex{forestoption}.
+%
+% \begin{macrocode}
+\DeclareDocumentCommand\indexdef{O{} t> m}{%
+ \IfBooleanTF{#2}
+ {\let\forestindex@resolvekey\forestindex@resolvekey@long}
+ {\let\forestindex@resolvekey\forestindex@resolvekey@shortorlong}%
+ \forestindex@index{definition}{#1}{#3}}
+\DeclareDocumentCommand\indexex{O{} t> m}{%
+ \IfBooleanTF{#2}
+ {\let\forestindex@resolvekey\forestindex@resolvekey@long}
+ {\let\forestindex@resolvekey\forestindex@resolvekey@shortorlong}%
+ \forestindex@index{example}{#1}{#3}}
+% \DeclareDocumentCommand\indexitem{D(){} O{} t> m}{%
+% \IfBooleanTF{#3}
+% {\let\forestindex@resolvekey\forestindex@resolvekey@long}
+% {\let\forestindex@resolvekey\forestindex@resolvekey@shortorlong}%
+% \forestindex@index{definition}{default={#1},print format=item,#2}{#4}}
+\DeclareDocumentCommand\indexitem{D(){} O{} t> m}{%
+ \let\forestindex@resolvekey\forestindex@resolvekey@long
+ \forestindex@index{definition}{default={#1},#2,print format+=item}{#4}}
+\DeclareDocumentCommand\indexset{O{} t> m}{%
+ \IfBooleanTF{#2}
+ {\let\forestindex@resolvekey\forestindex@resolvekey@long}
+ {\let\forestindex@resolvekey\forestindex@resolvekey@shortorlong}%
+ \forestindex@index{not print,not index,definition}{set={#1}}{#3}}
+\DeclareDocumentCommand\index{D(){} O{} t> m}{%
+ \IfBooleanTF{#3}
+ {\let\forestindex@resolvekey\forestindex@resolvekey@long}
+ {\let\forestindex@resolvekey\forestindex@resolvekey@shortorlong}%
+ \forestindex@index{#1}{#2}{#4}%
+}
+% \end{macrocode}
+% All UI macros call this macro.
+% \begin{arguments}
+% \item early option keylist
+% \item late option keylist
+% \item a comma-sep list of forest index key (full or short form). A
+% key can be given an argument using |key=argument| syntax. How the
+% argument is used is up to the user. For example, the
+% \entry{environment} entry of the \foRest; documentation uses it to
+% typeset the contents of the environment:
+% \lstinputregion{forest-doc.tex}{forest_environment_doc}
+% \end{arguments}
+% \begin{macrocode}
+\def\forestindex@index#1#2#3{%
+% \end{macrocode}
+% Partition the index keylist into single keys. And put it all in a group: the
+% persistent stuff is saved globally.
+% \begin{macrocode}
+ {\forcsvlist{\forestindex@forkey{#1}{#2}}{#3}}%
+}
+\def\forestindex@forkey#1#2#3{%
+% \end{macrocode}
+% Short-key resolution. The result is stored into |\forestindex@fullkey|.
+% \begin{macrocode}
+ \forestindex@resolvekey{#3}%
+% \end{macrocode}
+% Manipulate arguments a bit, so that we can use our quick-and-dirty one-arg
+% memoization.
+% \begin{macrocode}
+ %\forestset{@index/.process={__o}{#1}{#2}{\forestindex@fullkey}}
+ \edef\forest@marshal{%
+ \noexpand\forestindex@index@{%
+ {\unexpanded{#1}}%
+ {\unexpanded{#2}}%
+ {\expandonce{\forestindex@fullkey}}%
+ }%
+ }\forest@marshal
+}
+% \end{macrocode}
+% Call the central processing command, style |@index|. See how
+% \indexex{handler>process} is used to expand (once) the last argument.
+% \begin{macrocode}
+\def\forestindex@index@#1{\forestset{@index/.process={__o}#1}}
+\forestset{
+% \end{macrocode}
+% \subsubsection*{Declarations}
+%
+% Should we print and/or index the entry? For example,
+% |\index[not_print]{...}| will index silently (as \LaTeX's |\index|
+% command does).
+% \begin{macrocode}
+ declare boolean register=print,
+ declare boolean register=index,
+ declare boolean register=short,
+% \end{macrocode}
+% Options |name|, |content|, |key| and |argument| hold info about the
+% current entry. We need to declare only the latter two, the former
+% two we steal from \foRest;.
+% \begin{macrocode}
+ declare toks={key}{},
+ declare toks={argument}{},
+% \end{macrocode}
+% These options will hold first the initial, and then the calculated
+% values of the index key, index form and the form in text. When
+% (late) options are executed, these options are initialized to the
+% value of option |key|; it is safe to modify them at this point.
+% Afterwards, they will be further processed by keylists
+% |index_key_format|, |index_form_format| and |print_format|,
+% respectively.
+% \begin{macrocode}
+ declare toks={index key}{},
+ declare toks={index form}{},
+ declare toks={print form}{},
+% \end{macrocode}
+% The customization of entries' appearance is done by specifying the
+% following three keylists. The keylists work by modifying register
+% |result|.
+% \begin{macrocode}
+ declare keylist={index key format}{},
+ declare keylist={index format}{},
+ declare keylist={print format}{},
+ declare autowrapped toks register=result,
+% \end{macrocode}
+% Some shorthands.
+% \begin{macrocode}
+ format'/.style={print format'={#1}, index format'={#1}},
+ format/.style={print format={#1}, index format={#1}},
+ format+/.style={print format+={#1}, index format+={#1}},
+ +format/.style={+print format={#1}, +index format={#1}},
+ form/.style={print form={#1},index form={#1}},
+ form+/.style={print form+={#1},index form+={#1}},
+ +form/.style={+print form={#1},+index form={#1}},
+% \end{macrocode}
+% Entry types are normal (default), definition, example. Only
+% definitions are special, as their options are automatically saved.
+% \begin{macrocode}
+ declare toks register=index entry type,
+ definition/.style={index entry type=definition},
+ normal/.style={index entry type=normal},
+ example/.style={index entry type=example},
+ normal,
+% \end{macrocode}
+% This option is used internally to store the hyper ids.
+% \begin{macrocode}
+ declare toks={index@hypertarget}{},
+ every index begin/.style={},
+ every index end/.style={},
+% \end{macrocode}
+% Some formatting tools need to know whether we're typesetting text or
+% index: this info is stored in the |stage| register.\indexex[margin]{declare toks register}
+% \begin{macrocode}
+ declare toks register=stage,
+% \end{macrocode}
+%
+% \subsubsection*{The central processing command}
+% \begin{arguments}
+% \item early option keylist (these are only used to define category
+% ``@unknown'' at the end of this package)
+% \item late option keylist
+% \item index key (full form)
+% \end{arguments}
+% \begin{macrocode}
+ @index/.style n args={3}{
+% \end{macrocode}
+% Set the defaults.
+% \begin{macrocode}
+ print, index, index entry type=normal, set'={}, short,
+% \end{macrocode}
+% Create the tree structure:
+% |[entry[subentry[subsubentry...]]]|. Three options of every node
+% created:
+% \begin{compactitem}
+% \item |key| contains the key of the (sub)entry
+% \item |name| contains the full path to the (sub)entry
+% \item |arguments| contains the arguments given to the (sub)entry's key
+% \item |content| contains the full key, with arguments for all but
+% the most deeply embedded subentry
+% \end{compactitem}
+% \indexex{for step=\indexex{nodewalk}} is used because
+% |create@subentry@node| walks down the created tree. At |if n=0|
+% below, we're thus positioned at the lowest node.\indexex[margin]{step>nodewalk}
+% \begin{macrocode}
+ for nodewalk={
+% \end{macrocode}
+% The components of the full key are separated using \indexex{split},
+% with different keys being executed for the first component and the
+% rest.
+% \begin{macrocode}
+ split={#3}{>}{create@main@entry@node, create@subentry@node},
+% \end{macrocode}
+% Remove the argument from the most deeply embedded subentry.
+% \begin{macrocode}
+ if n=0{
+ content/.option=key,
+ }{
+ content/.process={OOw2} {!parent.content} {key} {##1>##2},
+ }
+ }{},
+ for root'={
+% \end{macrocode}
+% Don't memoize if the key is of an unknown category.
+% \begin{macrocode}
+ if strequal/.process={O}{!root.name}{@unknown}{TeX=\global\forest@memoizing@ok@false}{},
+% \end{macrocode}
+% Option |print_form| is what will be typeset in the text. Option
+% |index_key| is the key that will be used for sorting the
+% index. Option |index_form| is what will be typeset in the index. All
+% these are initialized to the |key|. See how
+% \indexex{handler>option} is used to assign an option value to
+% another option.
+% \begin{macrocode}
+ for tree={
+ print form/.option=key,
+ index key/.option=key,
+ index form/.option=key,
+ },
+% \end{macrocode}
+% Below, \indexex{node key>on invalid} is set to \indexex{value of=on invalid>fake} at four points.
+% This is so we won't get in trouble when |\indexset|ting the
+% categories: when the category formatting code will try to step into
+% the child, it will fail as the child does not exist when |\indexset|
+% is called for the category; but we ignore the failure.
+%
+% Go to the the most deeply embedded subentry.\indexex[margin]{first leaf'}
+% \begin{macrocode}
+ for first leaf'={
+% \end{macrocode}
+% Execute every index options and the given early options.
+% \begin{macrocode}
+ on invalid={fake}{
+ every index begin,
+ #1,
+ },
+% \end{macrocode}
+% Ancestors are walked in the \indexex{reverse} order (top down). At
+% every node, the saved configuration is executed (if it exists).
+% \begin{macrocode}
+ for reverse={current and ancestors}{on invalid={fake}{@@index/\forestoption{name}/.try}},
+% \end{macrocode}
+% We don't execute the saved configuration for definitions, as
+% definitions are where the configuration is set.
+% \begin{macrocode}
+ if index entry type={definition}{}{%
+ on invalid={fake}{@@index/\forestoption{name}/.try},
+ },
+% \end{macrocode}
+% Execute late (well, normal) options. See the discussion about early
+% options above.
+% \begin{macrocode}
+ on invalid={fake}{
+ #2,
+ every index end
+ },
+% \end{macrocode}
+% Remember the given config for the rest of the document.
+% \begin{macrocode}
+ if set={}{}{save@session},
+% \end{macrocode}
+% If we're at a definition, save the config into the auxiliary file.
+% \begin{macrocode}
+ if index entry type={definition}{save@foridx}{},
+ },
+ stage={},
+% \end{macrocode}
+% Create hyperlink targets of the form |.entry.subentry.subsubentry...|.
+%
+% \FoRest; points:
+% \begin{enumerate*}[(i)]
+% \item the generic conditional \indexex{if},
+% \item handler \index{handler>process},
+% \end{enumerate*}
+% \begin{macrocode}
+ if index={
+ index@hypertarget/.process={OS_= ? l_ w2}
+ {index key}
+ {}
+ {}{.}
+ {##2##1},
+ for descendants={
+ index@hypertarget/.process={OO S _l1= ? w2 }
+ {!parent.index@hypertarget}{index key}
+ {}
+ {##1} % empty index key
+ {##1.##2} % otherwise
+ },
+ }{},
+% \end{macrocode}
+% Index.
+% \begin{macrocode}
+ if index={
+ begingroup,
+ stage=index,
+% \end{macrocode}
+% For each (sub)entry, format the |index_key| using the instructions
+% in |index_key_format|.
+% \begin{macrocode}
+ for tree={
+ result/.option=index key,
+ process keylist'={index key format}{current},
+ index key/.register=result,
+ },
+% \end{macrocode}
+% For each (sub)entry, format the |index_form| using the instructions
+% in |index_form_format|.
+% \begin{macrocode}
+ for tree={
+ result/.option=index form,
+ process keylist'={index format}{current},
+ index form/.register=result,
+ },
+% \end{macrocode}
+% Create an index entry for all nodes where |index_form| is non-empty.
+% \begin{macrocode}
+ where index form={}{}{
+% \end{macrocode}
+% All the ancestor nodes with an non-empty |index_form| will be
+% appended (in script size, as a hyperlink) to the |index_form| of the
+% current node.
+% \begin{macrocode}
+ if n=0{
+ temptoksb={},
+ }{
+ temptoksc={},
+ for ancestors={
+ if index form={}{}{
+ temptoksb+/.expanded={\forestregister{temptoksc}%
+ \noexpand\protect\noexpand\hyperlinknocolor{%
+ \forestoption{index@hypertarget}}{\forestoption{index form}}},
+ temptoksc={,\space},
+ },
+ },
+ if temptoksb={}{}{
+ +temptoksb={\protect\space\begingroup\protect\scriptsize},
+ temptoksb+={\endgroup},
+ },
+ },
+ temptoksa={},
+ result'={},
+ if n children=0{tempboola}{not tempboola},
+ where index form={}{}{
+% \end{macrocode}
+% Create the hypertarget that the definitions in text and other index entries
+% will point to.
+% \begin{macrocode}
+ temptoksd/.expanded={\noexpand\protect\noexpand\hypertarget{%
+ \forestoption{index@hypertarget}}{}},
+% \end{macrocode}
+% Add the (inner) current node to the index entry of the (outer) current node.
+% \begin{macrocode}
+ result+/.expanded={%
+ \forestregister{temptoksa}%
+ \forestoption{index key}%
+ =\forestoption{index form}%
+ \forestregister{temptoksd}%
+ \forestregister{temptoksb}%
+ },
+ temptoksa={>},
+ temptoksb={},
+ },
+% \end{macrocode}
+% Do the actual indexing.
+% \begin{macrocode}
+ result+/.expanded={|indexpagenumber\forestregister{index entry type}},
+ TeX and memoize/.expanded={\noexpand\forestindex@LaTeX@index{\forestregister{result}}},
+ },
+ endgroup
+ }{},
+ if print={
+ begingroup,
+ stage=print,
+% \end{macrocode}
+% For each (sub)entry, format the |print_form| using the instructions
+% in |print_form_format|.
+% \begin{macrocode}
+ for tree={
+ result/.option=print form,
+ process keylist'={print format}{current},
+ print form/.register=result,
+ },
+% \end{macrocode}
+% Typeset the entry in the text.
+% \begin{macrocode}
+ for first leaf'={TeX and memoize/.expanded={\forestoption{print form}}},
+ endgroup,
+ }{},
+ }
+ },
+% \end{macrocode}
+% Create the main entry node and set to be the root.
+% \begin{macrocode}
+ create@main@entry@node/.style={% #1 = subentry
+ set root={[]},
+ do dynamics, for root'={process delayed=tree},
+ root',
+ setup@entry@node={#1}
+ },
+% \end{macrocode}
+% Create a subentry node and move into it.
+% \begin{macrocode}
+ create@subentry@node/.style={
+ append={[]},
+ do dynamics, for root'={process delayed=tree},
+ n=1,
+ setup@entry@node={#1}
+ },
+% \end{macrocode}
+% Parse \#1 into |key| and |argument|, and assign |name| and |content|.
+% \begin{macrocode}
+ setup@entry@node/.style={
+ options={
+ split={#1}{=}{key,argument},
+ if n=0{
+ name'/.option=key,
+ content={#1},
+ }{
+ name'/.process={OOw2} {!parent.name} {key} {##1>##2},
+ content/.process={Ow1} {!parent.content} {##1>#1},
+ },
+ }
+ },
+}
+% \end{macrocode}
+% \subsubsection*{Saving and loading the options}
+% \begin{macrocode}
+\forestset{
+% \end{macrocode}
+% This register holds whatever we need to remember.
+% \begin{macrocode}
+ declare keylist register=set,
+% \end{macrocode}
+% Besides storing the keylist in the register, also immediately
+% execute it.\indexex[margin]{Autoforward register}.
+% \begin{macrocode}
+ Autoforward register={set}{##1},
+% \end{macrocode}
+% Remember things by saving them in a global style.
+% \begin{macrocode}
+ save@session/.style={@@index/\forestoption{name}/.global style/.register=set},
+% \end{macrocode}
+% Save thinks to the auxiliary file.
+% \begin{macrocode}
+ save@foridx/.style={
+% \end{macrocode}
+% Don't save entries of unknown category.
+% \begin{macrocode}
+ if strequal/.process={O}{!root.name}{@unknown}{}{
+% \end{macrocode}
+% Don't save if nothing is set.
+% \begin{macrocode}
+ if set={}{}{
+ TeX and memoize/.expanded={%
+ \noexpand\immediate\noexpand\write\noexpand\forestindex@out{%
+ \noexpand\string\noexpand\indexloadsettings\noexpand\unexpanded{{\forestoption{name}}{\forestregister{set}}}%
+ }%
+ },
+ },
+ },
+% \end{macrocode}
+% Save the full form of the key in the auxiliary file. Obviously, do
+% it only for subentries. The full form contains whatever arguments
+% were given to the non-last component.
+% \begin{macrocode}
+ if key/.process={O}{content} {} {%
+ if short={
+ TeX and memoize/.expanded={%
+ \noexpand\immediate\noexpand\write\noexpand\forestindex@out{%
+ \noexpand\string\noexpand\indexdefineshortkey\noexpand\unexpanded{{\forestoption{key}}{\forestoption{content}}}%
+ }%
+ }%
+ }{}
+ }
+ }
+}
+% \end{macrocode}
+% Load settings from the auxiliary file into the global style. Warn
+% if anything was configured more than once (e.g.\ by |\indexdef|ing
+% the same key twice).
+% \begin{macrocode}
+\def\indexloadsettings#1#2{%
+ \pgfkeysifdefined{/forest/@@index/#1/.@cmd}{%
+ \forestindex@loadsettings@warning{#1}%
+ }{}%
+ % #s in #2 are doubled; the following \def removes one layer of doubling
+ \def\forest@temp{#2}%
+ \forestset{@@index/#1/.global style/.expand once=\forest@temp}%
+}
+\def\forestindex@loadsettings@warning#1{%
+ \PackageWarning{forest-index}{Forest index key "#1" was configured more than once!
+ I'm using the last configuration.}%
+}
+% \end{macrocode}
+% Load the full form of a short key from the auxiliary file. Out of
+% kindness for the end user, remember all the full keys corresponding
+% to a short key: this will make a more informative warning below.
+% \begin{macrocode}
+\def\indexdefineshortkey#1#2{%
+ \def\forestindex@temp@short{#1}%
+ \def\forestindex@temp@long{#2}%
+ \ifx\forestindex@temp@short\forestindex@temp@long
+ \else
+ \ifcsdef{index@long@#1}{%
+ \global\cslet{index@long@#1}\relax
+ \csgappto{index@alllong@#1}{,#2}%
+ }{%
+ \global\csgdef{index@long@#1}{#2}%
+ \global\csgdef{index@alllong@#1}{#2}%
+ }%
+ \fi
+}
+% \end{macrocode}
+% \subsubsection*{Short key resolution}
+%
+% Nothing to do for a long key.
+% \begin{macrocode}
+\def\forestindex@resolvekey@long#1{\def\forestindex@fullkey{#1}}
+% \end{macrocode}
+% Decide whether a key is short or long based on the absence or
+% presence of the level separator |>|.
+% \begin{macrocode}
+\def\forestindex@resolvekey@shortorlong#1{%
+ \pgfutil@in@>{#1}%
+ \ifpgfutil@in@
+ \expandafter\def\expandafter\forestindex@fullkey
+ \else
+ \expandafter\forestindex@resolvekey@short
+ \fi
+ {#1}%
+}
+% \end{macrocode}
+% Before resolving the short key, we need to split the user input into
+% the key and the argument. The latter is then appended to the full
+% key (which can, in principle, contain arguments for other components
+% as well).
+% \begin{macrocode}
+\def\forestindex@resolvekey@short#1{%
+ \forestset{split={#1}{=}{index@resolveshortkey@key,index@resolveshortkey@arg}}%
+}
+\forestset{
+ index@resolveshortkey@key/.code={%
+ \ifcsvoid{index@long@#1}{%
+ \forestindex@resolveshortkey@warning{#1}%
+ \def\forestindex@fullkey{@unknown>#1}%
+ }{%
+ \letcs\forestindex@fullkey{index@long@#1}%
+ }%
+ },
+ index@resolveshortkey@arg/.code={%
+ \appto\forestindex@fullkey{=#1}%
+ },
+}
+\def\forestindex@resolveshortkey@warning#1{%
+ \PackageWarning{forest-index}{Cannot resolve short forest index key "#1".
+ These are the definitions I found (from the previous run):
+ "\csuse{index@alllong@#1}"}%
+}
+% \end{macrocode}
+% \subsubsection*{Formatting styles}
+%
+% Define default colors for index entry types and provide a style that
+% typesets the entry in text (but not index) in the desired color.
+% \begin{macrocode}
+\forestset{
+ normal color/.initial=blue,
+ definition color/.initial=red,
+ example color/.initial=darkgreen,
+ print in color/.style={if stage={print}{result/.expanded=\noexpand\protect\noexpand\textcolor{%
+ \pgfkeysvalueof{/forest/#1 color}}{\unexpanded{##1}}}{}},
+ print in color/.default=\forestregister{index entry type},
+% \end{macrocode}
+% Use this style in |..._format| keylists if you want the index
+% entries to be hyperlinks to the definition, and the definition to be
+% a hyperlink to the index.
+% \begin{macrocode}
+ hyper/.style={
+ if stage={index}{}{
+ if index entry type={definition}{
+ result/.expanded={\noexpand\hypertarget{\forestoption{name}}%
+ {\noexpand\hyperlink{\forestoption{index@hypertarget}}{\forestregister{result}}}}
+ }{
+ result/.expanded=\noexpand\hyperlink{\forestoption{name}}{\forestregister{result}}
+ }
+ }
+ },
+}
+% \end{macrocode}
+% Color page numbers in the index, with or without |hyperref| package.
+% \begin{macrocode}
+\ifdef\hyperpage{%
+ \newcommand\indexpagenumbernormal[1]{{%
+ \hypersetup{linkcolor=\pgfkeysvalueof{/forest/normal color}}\hyperpage{#1}}}
+ \newcommand\indexpagenumberdefinition[1]{{%
+ \hypersetup{linkcolor=\pgfkeysvalueof{/forest/definition color}}\hyperpage{#1}}}
+ \newcommand\indexpagenumberexample[1]{{%
+ \hypersetup{linkcolor=\pgfkeysvalueof{/forest/example color}}\hyperpage{#1}}}
+}{
+ \newcommand\indexpagenumbernormal[1]{%
+ \textcolor{\pgfkeysvalueof{/forest/normal color}}{#1}}
+ \newcommand\indexpagenumberdefinition[1]{%
+ \textcolor{\pgfkeysvalueof{/forest/definition color}}{#1}}
+ \newcommand\indexpagenumberexample[1]{%
+ \textcolor{\pgfkeysvalueof{/forest/example color}}{#1}}
+}
+% \end{macrocode}
+% Provide dummy |\hyper...| commands if |hyperref| is not loaded.
+% \begin{macrocode}
+\providecommand\hyperlink[2]{#2}
+\providecommand\hypertarget[2]{#2}
+\providecommand\hypersetup[1]{}
+% \end{macrocode}
+% This is used by entry qualifiers: we want them to be hyperlinks, but black.
+% \begin{macrocode}
+\newcommand\hyperlinknocolor[2]{{\hypersetup{linkcolor=black}\hyperlink{#1}{#2}}}
+% \end{macrocode}
+%
+% Use style |item| to have the index entry (in text) function as the
+% |\item| of a |lstdoc|'s |syntax| environment.
+% \begin{macrocode}
+\forestset{
+ declare toks register=default,
+ default={},
+ item/.style={
+ result/.process= {_RORw4}
+ {} {default} {!parent.print form} {result}
+ {\item[,##2,##3]{##4}},
+ },
+}
+% \end{macrocode}
+%
+% \subsubsection*{Utilities}
+%
+% We will need a global version of several |pgfkeys| commands.
+% \begin{macrocode}
+\pgfkeys{/handlers/.global style/.code=\pgfkeys{\pgfkeyscurrentpath/.global code=\pgfkeysalso{#1}}}
+\pgfkeysdef{/handlers/.global code}{\pgfkeysglobaldef{\pgfkeyscurrentpath}{#1}}
+\long\def\pgfkeysglobaldef#1#2{%
+ \long\def\pgfkeys@temp##1\pgfeov{#2}%
+ \pgfkeysgloballet{#1/.@cmd}{\pgfkeys@temp}%
+ \pgfkeysglobalsetvalue{#1/.@body}{#2}%
+}
+\def\pgfkeysgloballet#1#2{%
+ \expandafter\global\expandafter\let\csname pgfk@#1\endcsname#2%
+}
+\long\def\pgfkeysglobalsetvalue#1#2{%
+ \pgfkeys@temptoks{#2}\expandafter\xdef\csname pgfk@#1\endcsname{\the\pgfkeys@temptoks}%
+}
+\forestset{
+ % unlike pgfmath function strequal, |if strequal| does not expand the compared args!
+ if strequal/.code n args={4}{\ifstrequal{#1}{#2}{\pgfkeysalso{#3}}{\pgfkeysalso{#4}}},
+}
+% \end{macrocode}
+% Begin and end group, \foRest;-style:
+% \begin{macrocode}
+\forestset{
+ begingroup/.code={\begingroup},
+ endgroup/.code={\endgroup},
+}
+% \end{macrocode}
+%
+% \subsubsection{Memoize}
+%
+% Quick and dirty memoization. Single argument macros only. Does not support nesting.
+%
+% \begin{macrocode}
+\newtoks\forest@memo@key
+\newtoks\forest@memo
+\newif\ifforest@memoizing@now@
+\newif\ifforest@memoizing@ok@
+\newif\ifforest@execandmemoize@
+\def\forest@memoize#1{% #1 = \cs
+ \cslet{forest@memo@orig@\string#1}#1%
+ \def#1##1{%
+ \ifforest@memoizing@now@
+ \forest@globalsaveandrestoreifcs{forest@execandmemoize@}{%
+ \global\forest@execandmemoize@false
+ \csname forest@memo@orig@\string#1\endcsname{##1}%
+ }%
+ \else
+ \expandafter\global\expandafter\forest@memo@key\expandafter{\detokenize{forest@memo@#1{##1}}}%
+ \ifcsname\the\forest@memo@key\endcsname
+ \@escapeifif{\csname\the\forest@memo@key\endcsname}%
+ \else
+ \@escapeifif{%
+ \global\forest@memo{}%
+ \global\forest@memoizing@ok@true
+ \global\forest@memoizing@now@true
+ \global\forest@execandmemoize@true
+ \csname forest@memo@orig@\string#1\endcsname{##1}%
+ \global\forest@execandmemoize@false
+ \global\forest@memoizing@now@false
+ \ifforest@memoizing@ok@
+ \csxdef{\the\forest@memo@key}{\the\forest@memo}%
+ \immediate\write\forest@memo@out{%
+ \noexpand\forest@memo@load{\the\forest@memo@key}{\the\forest@memo}%
+ }%
+ \fi
+ }%
+ \fi
+ \fi
+ }%
+}
+\def\forest@memo@load#1#2{%
+% \end{macrocode}
+% The following two |\def|s remove one level of hash-doubling from the
+% arguments, introduced by |\write|.
+% \begin{macrocode}
+ \def\forest@temp@key{#1}%
+ \def\forest@temp@value{#2}%
+ \csxdef{\detokenize\expandafter{\forest@temp@key}}{\expandonce\forest@temp@value}%
+ \immediate\write\forest@memo@out{%
+ \noexpand\forest@memo@load{\detokenize\expandafter{\forest@temp@key}}{\detokenize\expandafter{\forest@temp@value}}%
+ }%
+}
+\forestset{
+ TeX and memoize/.code={\forest@execandmemoize{#1}},
+}
+\def\forest@execandmemoize#1{%
+ \ifforest@execandmemoize@
+ \let\forest@memo@next\forest@execandmemoize@
+ \else
+ \let\forest@memo@next\@gobble
+ \fi
+ \forest@memo@next{#1}%
+ #1%
+}
+\def\forest@execandmemoize@#1{%
+ \gapptotoks\forest@memo{#1}%
+}
+\def\forest@memo@filename{\jobname.memo}
+\newwrite\forest@memo@out
+\immediate\openout\forest@memo@out=\forest@memo@filename.tmp
+\IfFileExists{\forest@memo@filename}{%
+ \input\forest@memo@filename\relax
+}{}%
+\AtEndDocument{%
+ \immediate\closeout\forest@memo@out
+ \forest@file@copy{\forest@memo@filename.tmp}{\forest@memo@filename}%
+}
+% \end{macrocode}
+% Commenting the following line turns off memoization.
+% \begin{macrocode}
+\forest@memoize\forestindex@index@
+% \end{macrocode}
+%
+% \subsubsection*{Initialize}
+%
+% Declare category ``@unknown''.
+% \begin{macrocode}
+\index(not print,not index)[%
+ set={
+ index key=unknown,
+ form={\textbf{unknown!!}},
+ for first={format={result/.expanded=\noexpand\textbf{\forestregister{result}??}}}
+ },
+ ]>{@unknown}
+% \end{macrocode}
+% Load the auxiliary file made in the previous compilation, and open
+% it for writing to save data from this compilation.
+% \begin{macrocode}
+\def\forestindex@filename{\jobname.foridx}
+\IfFileExists{\forestindex@filename}{%
+ \input\forestindex@filename\relax
+}{}%
+\newwrite\forestindex@out
+\immediate\openout\forestindex@out=\forestindex@filename.tmp
+\AtEndDocument{%
+ \immediate\closeout\forestindex@out
+ \forest@file@copy{\forestindex@filename.tmp}{\forestindex@filename}%
+}
+\endinput
+% \end{macrocode}
+%
+%%% \iffalse
+%%% Local Variables:
+%%% mode: doctex
+%%% TeX-master: "forest-doc"
+%%% TeX-command-default: "sty"
+%%% End:
+%%% \fi
diff --git a/graphics/pgf/contrib/forest/forest-libs.dtx b/graphics/pgf/contrib/forest/forest-libs.dtx
new file mode 100644
index 0000000000..9873abfa54
--- /dev/null
+++ b/graphics/pgf/contrib/forest/forest-libs.dtx
@@ -0,0 +1,528 @@
+% \CheckSum{236}
+% \iffalse meta-comment
+% forest-libs.dtx
+%% `forest-libs' is a collection of libraries for package `forest'.
+%%
+%% Copyright (c) 2012-2017 Saso Zivanovic
+%% (Sa\v{s}o \v{Z}ivanovi\'{c})
+%% saso.zivanovic@guest.arnes.si
+%%
+%% This work may be distributed and/or modified under the
+%% conditions of the LaTeX Project Public License, either version 1.3
+%% of this license or (at your option) any later version.
+%% The latest version of this license is in
+%%
+%% http://www.latex-project.org/lppl.txt
+%%
+%% and version 1.3 or later is part of all distributions of LaTeX
+%% version 2005/12/01 or later.
+%%
+%% This work has the LPPL maintenance status `author-maintained'.
+%%
+%% This file is a part of package `forest'. For the list of files
+%% constituting the package see main source file of the package,
+%% `forest.dtx', or the derived `forest.sty'.
+%%
+% \fi
+%
+% \section{Libraries}
+%
+% This chapter contains not only the reference of commands found in libraries and some examples of
+% their usage, but also their definitions. This is done in the hope that these definitions, being
+% mostly styles, will be useful as examples of the core features of the package. I even managed to
+% comment them a bit \dots
+%
+% \paragraph{Disclaimer.} At least in the initial stages of a library's development, the function
+% and interface of macros and keys defined in a library might change without backwards compatibility
+% support! Though I'll try to keep this from happening \dots
+%
+% \begin{macrocode}
+\RequirePackage{forest}
+% \end{macrocode}
+%
+%\iffalse
+%<*linguistics>
+%\fi
+% \librarysection{linguistics}
+% \begin{macrocode}
+\ProvidesForestLibrary{linguistics}[2017/07/14 v0.1.2]
+% \end{macrocode}
+%
+% Defaults:
+% \begin{macrocode}
+\forestset{
+ linguistics@set@baseline/.style={
+ if phantom={for next node=linguistics@set@baseline}{baseline}
+ },
+ libraries/linguistics/defaults/.style={
+ default preamble={
+% \end{macrocode}
+% Edges of the children will ``meet'' under the node:
+% \begin{macrocode}
+ sn edges,
+% \end{macrocode}
+% The root of the tree will be aligned with the text \dots\ or, more commonly, the example number.
+% More precisely, we actually align the first (in linear order) non-phantom node. This covers the
+% common case of side-by-side trees joined with a phantom root.
+% \begin{macrocode}
+ before drawing tree={
+ if nodewalk valid={name=forest@baseline@node}{}{linguistics@set@baseline},
+ },
+% \end{macrocode}
+% Enable (centered) multi-line nodes.
+% \begin{macrocode}
+ for tree={align=center},
+ },
+ },
+}
+% \end{macrocode}
+%
+% There's no linguistics without c-command\footnote{The definition of c-command is as follows: a node c-commands its siblings and their descendants.} \dots
+% \begin{syntax}
+% \indexitem{step>c-commanded} Visit all the nodes c-commanded by the current node.
+% \indexitem{step>c-commanders} Visit all the c-commanders of the current node, starting from the closest.
+%
+% \begin{forestexample}[tree bin=minipage,index={branch',c-commanded}]
+% \begin{forest}
+% [VP
+% [DP[John]]
+% [V'
+% [V, draw, for c-commanded={draw,circle}
+% [sent]
+% ]
+% [DP[Mary]]
+% [DP[D[a]][NP[letter]]]
+% ]
+% ]
+% \end{forest}
+% \end{forestexample}
+%
+% See how \indexex{branch'} is used to define |c-commanded|, and how \indexex{while nodewalk valid} and \indexex{nodewalk key>fake} are combined in the definition of |c-commanders|.
+% \begin{macrocode}
+\forestset{
+ define long step={c-commanded}{style}{branch'={siblings,descendants}},
+ define long step={c-commanders}{style}{while nodewalk valid={parent}{siblings,fake=parent}},
+}
+% \end{macrocode}
+%
+% |c-commanders| could also be defined using \indexex{branch}:
+% \begin{lstlisting}
+% branch={current and ancestors, siblings}
+% \end{lstlisting}
+%
+% \indexitem{node key>sn edges}
+%
+% In linguistics, most people want the parent-child edge to go from the \emph{s}outh of the parent
+% to the \emph{n}orth of the child. This is achieved by this (badly named) style, which makes the
+% entire (sub)tree have such edges.
+%
+% \begin{forestexample}
+% \begin{forest}
+% sn edges
+% [VP
+% [DP]
+% [V'
+% [V]
+% [DP]
+% ]
+% ]
+% \end{forest}
+% \end{forestexample}
+%
+% \begin{macrocode}
+\forestset{
+ sn edges/.style={
+ for tree={
+ parent anchor=children, child anchor=parent
+ }
+ },
+}
+% \end{macrocode}
+%
+% A note on implementation. Despite its name, this style does not refer to the |south| and |north|
+% anchor of the parent and the child node directly. If it did so, it would only work for trees with
+% standard linguistic \index{grow}|=-90|. So we rather use \FoRest;'s growth direction based
+% anchors: \index{anchor>children} always faces the children and \index{anchor>parent} always faces
+% the parent, so the edge will always be between them, and the normal, upward growing trees will
+% look good as well.
+%
+% \begin{forestexample}[index={anchor>south,anchor>north,option>parent anchor,option>child anchor}]
+% \begin{forest}
+% [bad![VP,no edge, for tree={grow=90, edge=red},
+% for tree={parent anchor=south, child anchor=north} % bad
+% [DP][V'[V][DP]]]]
+% \end{forest}
+% \begin{forest}
+% [good![VP, no edge, for tree={grow=90, edge=green},
+% ~sn edges~ % good!
+% [DP][V'[V][DP]]]]
+% \end{forest}
+% \end{forestexample}
+%
+% \indexitem{node key>roof} Makes the edge to parent a triangular roof.
+% \begin{macrocode}
+\forestset{
+ roof/.style={edge path'={%
+ (.parent first)--(!u.children)--(.parent last)--cycle
+ }
+ },
+}
+% \end{macrocode}
+%
+% \indexitem{node key>nice empty nodes}
+%
+% We often need empty nodes: tree (\ref{ex:niceemptynodes}a) shows how they look like by default:
+% ugly.
+%
+% First, we don't want the gaps: we change the shape of empty nodes to coordinate. We get tree
+% (\ref{ex:niceemptynodes}b).
+%
+% Second, the empty nodes seem too close
+% to the other (especially empty) nodes (this is a result of a small
+% default |s_sep|). We could use a greater \index{s sep}, but a better solution seems
+% to be to use |calign=fixed_angles|. The result is shown in (\ref{ex:niceemptynodes}c).
+%
+% However, at the transitions from empty to non-empty nodes, tree (\ref{ex:niceemptynodes}c)
+% seems to zigzag (although the base points of the spine nodes
+% are perfectly in line), and the edge to the empty node left to VP
+% seems too long (it reaches to the level of VP's base, while we'd
+% prefer it to stop at the same level as the edge to VP itself). The
+% first problem is solved by substituting |fixed_angles| for
+% |fixed_edge_angles|; the second one, by anchoring siblings of
+% empty nodes at north. Voilà, (\ref{ex:niceemptynodes}d)!
+%
+% \begin{forestexample}[label=ex:niceemptynodes,layout=tree on bottom,index={fixed angles,fixed edge angles,calign,tree,delay,where option,content,for step,step>parent,step>children,option>anchor}]
+% \forestset{
+% xlist/.style={
+% phantom,
+% for children={no edge,replace by={[,append,
+% delay={content/.wrap pgfmath arg={\csname @alph\endcsname{##1}.}{n()+#1}}
+% ]}}
+% },
+% xlist/.default=0
+% }
+% \begin{forest}
+% [,~xlist~,
+% for tree={after packing node={s+=0.1pt}}, % hack!!!
+% [CP, %(a)
+% [][[][[][VP[DP[John]][V'[V[loves]][DP[Mary]]]]]]]
+% [CP, delay={where content={}{shape=coordinate}{}} %(b)
+% [][[][[][VP[DP[John]][V'[V[loves]][DP[Mary]]]]]]]
+% [CP, for tree={calign=fixed angles}, %(c)
+% delay={where content={}{shape=coordinate}{}}
+% [][[][[][VP[DP[John]][V'[V[loves]][DP[Mary]]]]]]]
+% [CP, ~nice empty nodes~ %(d)
+% [][[][[][VP[DP[John]][V'[V[loves]][DP[Mary]]]]]]]
+% ]
+% \end{forest}
+% \end{forestexample}
+%
+% \begin{macrocode}
+\forestset{
+ nice empty nodes/.style={
+ for tree={calign=fixed edge angles},
+ delay={where content={}{shape=coordinate,
+ for current and siblings={anchor=north}}{}}
+ },
+}
+% \end{macrocode}
+%
+% \indexitem{node key>draw brackets} Outputs the bracket representation of the tree.
+% \indexitem{node key>draw brackets compact}
+% \itemnosep
+% \indexitem{node key>draw brackets wide} These keys control whether the brackets have extra
+% spaces around them (|wide|) or not (|compact|).
+% \begin{macrocode}
+\providecommand\text[1]{\mbox{\scriptsize#1}}
+\forestset{
+ draw brackets compact/.code={\let\drawbracketsspace\relax},
+ draw brackets wide/.code={\let\drawbracketsspace\space},
+ draw brackets/.style={
+% \end{macrocode}
+% There's stuff to do both before (output the opening bracket and the content) and after (output the
+% closing bracket) processing the children, so we use \indexex{for tree'}.
+% \begin{macrocode}
+ for tree'={
+ TeX={[%
+% \end{macrocode}
+% Complication: \index{content format} must be expanded in advance, to correctly process tabular environments implicitely loaded by \index{align}|=|\index{value of=align>center}, which is the default in this library. (Not that one would want a multiline output in the bracket representation, but it's better than crashing.)
+% \begin{macrocode}
+ \edef\forestdrawbracketscontentformat{\foresteoption{content format}}%
+ },
+ if n children=0{
+ TeX={\drawbracketsspace\forestdrawbracketscontentformat\drawbracketsspace}
+ }{
+ TeX={\textsubscript{\text{\forestdrawbracketscontentformat}}\drawbracketsspace}
+ },
+ }{
+ TeX={]\drawbracketsspace},
+ }
+ },
+ draw brackets wide
+}
+% \end{macrocode}
+% \end{syntax}
+%
+% \subsubsection{GP1}
+%
+% \begin{syntax}
+% \indexitem{node key>GP1}
+%
+% For Government Phonology (v1) representations. Here, the big trick
+% is to evenly space $\times$s by having a large enough |outer_xsep|
+% (adjustable), and then, before drawing (timing control option
+% |before_drawing_tree|), setting |outer_xsep| back to 0pt. The last step
+% is important, otherwise the arrows between $\times$s won't draw!
+%
+% An example of an ``embedded'' |GP1| style:
+% \begin{forestexample}[layout=tree on bottom,index={where option,tier,for step,step>children,content,tikz,option>l,dimen+,no edge},index>={!}]
+% \begin{forest}
+% myGP1/.style={
+% ~GP1~,
+% delay={where tier={x}{
+% for children={content=\textipa{##1}}}{}},
+% tikz={\draw[dotted](.south)--
+% (!1.north west)--(!l.north east)--cycle;},
+% for children={l+=5mm,no edge}
+% }
+% [VP[DP[John,tier=word,myGP1
+% [O[x[dZ]]]
+% [R[N[x[6]]]]
+% [O[x[n]]]
+% [R[N[x]]]
+% ]][V'[V[loves,tier=word,myGP1
+% [O[x[l]]]
+% [R[N[x[a]]]]
+% [O[x[v]]]
+% [R[N[x]]]
+% [O[x[z]]]
+% [R[N[x]]]
+% ]][DP[Mary,tier=word,myGP1
+% [O[x[m]]]
+% [R[N[x[e]]]]
+% [O[x[r]]]
+% [R[N[x[i]]]]
+% ]]]]
+% \end{forest}%
+% \end{forestexample}
+%
+% And an example of annotations.
+% \begin{forestexample}
+% \begin{forest}[,phantom,s sep=1cm
+% [{[ei]}, GP1
+% [R[N[x[A,~el~[I,~head~,~associate=N~]]][x]]]
+% ]
+% [{[mars]}, GP1
+% [O[x[m]]]
+% [R[N[x[a]]][x,~encircle~,densely dotted[r]]]
+% [O[x,~encircle~,~govern=<~[s]]]
+% [R,~fen~[N[x]]]
+% ]
+% ]\end{forest}
+% \end{forestexample}
+%
+% \begin{macrocode}
+\newbox\standardnodestrutbox
+\setbox\standardnodestrutbox=\hbox to 0pt{\phantom{\forestOve{standard node}{content}}}
+\def\standardnodestrut{\copy\standardnodestrutbox}
+\forestset{
+ GP1/.style 2 args={
+ for n={1}{baseline},
+ s sep=0pt, l sep=0pt,
+ for descendants={
+ l sep=0pt, l={#1},
+ anchor=base,calign=first,child anchor=north,
+ inner xsep=1pt,inner ysep=2pt,outer sep=0pt,s sep=0pt,
+ },
+ delay={
+ if content={}{phantom}{for children={no edge}},
+ for tree={
+ if content={O}{tier=OR}{},
+ if content={R}{tier=OR}{},
+ if content={N}{tier=N}{},
+ if content={x}{
+ tier=x,content={$\times$},outer xsep={#2},
+ for tree={calign=center},
+ for descendants={content format={\noexpand\standardnodestrut\forestoption{content}}},
+ before drawing tree={outer xsep=0pt,delay={typeset node}},
+ s sep=4pt
+ }{},
+ },
+ },
+ before drawing tree={where content={}{parent anchor=center,child anchor=center}{}},
+ },
+ GP1/.default={5ex}{8.0pt},
+ associate/.style={%
+ tikz+={\draw[densely dotted](!)--(!#1);}},
+ spread/.style={
+ before drawing tree={tikz+={\draw[dotted](!)--(!#1);}}},
+ govern/.style={
+ before drawing tree={tikz+={\draw[->](!)--(!#1);}}},
+ p-govern/.style={
+ before drawing tree={tikz+={\draw[->](.north) to[out=150,in=30] (!#1.north);}}},
+ no p-govern/.style={
+ before drawing tree={tikz+={\draw[->,loosely dashed](.north) to[out=150,in=30] (!#1.north);}}},
+ encircle/.style={before drawing tree={circle,draw,inner sep=0pt}},
+ fen/.style={pin={[font=\footnotesize,inner sep=1pt,pin edge=<-]10:\textsc{Fen}}},
+ el/.style={content=\textsc{\textbf{##1}}},
+ head/.style={content=\textsc{\textbf{\underline{##1}}}}
+}
+% \end{macrocode}
+% \end{syntax}
+%\iffalse
+%</linguistics>
+%\fi
+%
+%
+%
+%\iffalse
+%<*edges>
+%\fi
+% \librarysection{edges}
+% \begin{macrocode}
+\ProvidesForestLibrary{edges}[2016/12/05 v0.1.1]
+% \end{macrocode}
+%
+% \begin{syntax}
+%
+% \indexitem{node key>forked edge'}
+%
+% Sets a forked edge to the current node. Arbitrary growth direction and node rotation are
+% supported.
+%
+% \indexitem{node key>forked edge}
+%
+% Like \index{forked edge'}, but it also sets \index{option>parent anchor} and \index{option>child
+% anchor} to the likely values of \index{anchor>children} and \index{anchor>parent}, respectively.
+%
+% \indexitem(tree){node key>forked edges}|=|\meta{nodewalk}
+%
+% Invokes \index{forked edge} for all nodes in the \meta{nodewalk}, by default the entire (sub)tree
+% rooted in the current node.
+%
+% \indexitem{option>fork sep} The \index{forest cs>l}-distance between the parent anchor and the
+% fork.
+%
+% \end{syntax}
+%
+% \begin{forestexample}[index={for step,tree,grow',forked edges}]
+% \begin{forest}
+% for tree={grow'=0,draw},
+% forked edges,
+% [/
+% [home
+% [saso
+% [Download]
+% [TeX]
+% ]
+% [alja]
+% [joe]
+% ]
+% [usr
+% [bin]
+% [share]
+% ]
+% ]
+% \end{forest}
+% \end{forestexample}
+%
+% See how growth direction based anchors \indexex{anchor>children} and \indexex{anchor>parent} are
+% used in the definition below to easily take care of arbitrary \index{grow} and
+% \index{rotate}.
+% \begin{macrocode}
+\forestset{
+ declare dimen={fork sep}{0.5em},
+ forked edge'/.style={
+ edge={rotate/.option=!parent.grow},
+ edge path'={(!u.parent anchor) -- ++(\forestoption{fork sep},0) |- (.child anchor)},
+ },
+ forked edge/.style={
+ on invalid={fake}{!parent.parent anchor=children},
+ child anchor=parent,
+ forked edge',
+ },
+ forked edges/.style={for nodewalk={#1}{forked edge}},
+ forked edges/.default=tree,
+}
+% \end{macrocode}
+%
+% \begin{syntax}
+% \indexitem{node key>folder} The children of the node are drawn like folders.
+%
+% All growth directions are supported (well, cardinal directions work perfectly; the others await
+% the sensitivity of packing to \index{edge path}), as well as node rotation and \index{reversed}
+% order of children.
+%
+% The outlook of the folder can be influenced by setting standard \foRest;'s options \index{l sep}
+% and \index{s sep} any time before packing, or \index{option>l} and \index{option>s} after
+% packing. Setting \index{option>l} and \index{option>s} before packing will have no influence on
+% the layout of the tree.
+%
+% \begin{syntax}
+% \indexitem(.45em){register>folder indent}|=|\meta{dimen}
+%
+% Specifies the shift of the parent's side of the edge in the \index{forest cs>l}-direction.
+% \end{syntax}
+%
+% \end{syntax}
+%
+% \begin{forestexample}[index={for step,tree,grow',folder}]
+% \begin{forest}
+% for tree={grow'=0,~folder~,draw}
+% [/
+% [home
+% [saso
+% [Download]
+% [TeX]
+% ]
+% [alja]
+% [joe]
+% ]
+% [usr
+% [bin]
+% [share]
+% ]
+% ]
+% \end{forest}
+% \end{forestexample}
+% \begin{macrocode}
+\forestset{
+ declare dimen register=folder indent,
+ folder indent=.45em,
+ folder/.style={
+ parent anchor=-children last,
+ anchor=parent first,
+ calign=child,
+ calign primary child=1,
+ for children={
+ child anchor=parent,
+ anchor=parent first,
+ edge={rotate/.option=!parent.grow},
+ edge path'/.expanded={
+ ([xshift=\forestregister{folder indent}]!u.parent anchor) |- (.child anchor)
+ },
+ },
+ after packing node={
+ if n children=0{}{
+ tempdiml=l_sep()-l("!1"),
+ tempdims={-abs(max_s("","")-min_s("",""))-s_sep()},
+ for children={
+ l+=tempdiml,
+ s+=tempdims()*(reversed()-0.5)*2,
+ },
+ },
+ },
+ }
+}
+% \end{macrocode}
+%\iffalse
+%</edges>
+%\fi
+% \forestset{every index end/.style={}}
+% \endinput
+% Local Variables:
+% mode: doctex
+% TeX-command-default: "sty"
+% fill-column: 100
+% TeX-master: "forest"
+% End:
diff --git a/graphics/pgf/contrib/forest/forest.dtx b/graphics/pgf/contrib/forest/forest.dtx
new file mode 100644
index 0000000000..4b136615db
--- /dev/null
+++ b/graphics/pgf/contrib/forest/forest.dtx
@@ -0,0 +1,10913 @@
+% \CheckSum{16651}
+% \iffalse meta-comment
+% forest.dtx
+%% `forest' is a `pgf/tikz'-based package for drawing (linguistic) trees.
+%%
+%% Copyright (c) 2012-2017 Saso Zivanovic
+%% (Sa\v{s}o \v{Z}ivanovi\'{c})
+%% saso.zivanovic@guest.arnes.si
+%%
+%% This work may be distributed and/or modified under the
+%% conditions of the LaTeX Project Public License, either version 1.3
+%% of this license or (at your option) any later version.
+%% The latest version of this license is in
+%%
+%% http://www.latex-project.org/lppl.txt
+%%
+%% and version 1.3 or later is part of all distributions of LaTeX
+%% version 2005/12/01 or later.
+%%
+%% This work has the LPPL maintenance status `author-maintained'.
+%%
+%% This work consists of the following files:
+%% - forest.dtx: central sources (with rudimentary implementation documentation)
+%% - forest-libs.dtx: sources and documentation for libraries
+%% + forest-compat.sty: sources/runtime for compatibility mode
+%% - forest.ins: produces derived runtime .sty files
+%% + forest.sty: main package
+%% + forest-lib-*.sty: libraries (for the list, see forest.ins)
+%% - forest-doc.tex: central documentation
+%% - forest-doc.sty: private package needed to compile the documentation
+%% - forest-index.dtx: sources of indexing package used in the documentation,
+%% and also part of the documentation itself
+%% - forest-doc.ins: produces derived .sty files needed to compile the documentation
+%% - forest-index.sty
+%% - forest-doc.ist: index style file needed to compile the documentation
+%% - forest.pdf: documentation of core package implementation
+%% - forest-doc.pdf: user's guide
+%% - README
+%% - LICENCE
+%% To use the package, only the files marked with + need to be installed.
+%%
+%<*driver>
+\documentclass[a4paper]{ltxdoc}
+
+\usepackage{forest}
+\usepackage{forest-doc}
+
+\usepackage{fullpage}
+\usepackage{hyperref}
+\hypersetup{colorlinks=true,linkcolor=blue,citecolor=blue,hyperindex=false}
+\usepackage{url}
+
+%\input forest-common
+
+\begin{document}
+ \DocInput{forest.dtx}
+\end{document}
+%</driver>
+% \fi
+%
+% \title{Implementation of \FoRest;, a \PGF;/\TikZ;-based package for drawing linguistic
+% trees\\\normalsize\forestversion}
+%
+% \author{Sa\v so \v Zivanovi\'c\footnote{e-mail:
+% \href{mailto:saso.zivanovic@guest.arnes.si}{saso.zivanovic@guest.arnes.si}; web:
+% \href{http://spj.ff.uni-lj.si/zivanovic/}{http://spj.ff.uni-lj.si/zivanovic/}}}
+%
+% \settodayfromforestdate
+%
+% \maketitle
+%
+% This file contains the documented source of \foRest;. If you are searching for the manual, follow
+% this link to \href{http://mirrors.ctan.org/graphics/pgf/contrib/forest/forest-doc.pdf}{forest-doc.pdf}.
+%
+% The latest release of the package, including the sources, can be found on
+% \href{http://ctan.org/pkg/forest}{CTAN}. For all versions of the package, including any
+% non-yet-released work in progress, visit \href{https://github.com/sasozivanovic/forest}{\foRest;'s
+% GitHub repo}. Contributions are welcome.
+%
+% A disclaimer: the code could've been much cleaner and better-documented \dots
+%
+% \tableofcontents
+%
+% \section{Identification}
+% \begin{macrocode}
+\ProvidesPackage{forest}[2017/07/14 v2.1.5 Drawing (linguistic) trees]
+
+\RequirePackage{tikz}[2013/12/13]
+\usetikzlibrary{shapes}
+\usetikzlibrary{fit}
+\usetikzlibrary{calc}
+\usepgflibrary{intersections}
+
+\RequirePackage{pgfopts}
+\RequirePackage{etoolbox}[2010/08/21]
+\RequirePackage{elocalloc}% for \locbox
+\RequirePackage{environ}
+\RequirePackage{xparse}
+
+\RequirePackage{inlinedef}
+\newtoks\ID@usercommands{}
+\newcommand\NewInlineCommand[3][0]{%
+ \newcommand#2[#1]{#3}%
+ \ID@usercommands\xa{%
+ \the\ID@usercommands
+ \ifx\@foo#2%
+ \def\next{\ID@expandunsafe#2}%
+ \fi
+ }%
+}
+\def\@ExpandIfTF#1{%
+ \csname
+ % I'm not 100% sure if this plays well in every situation
+ \csname if#1\endcsname
+ @firstoftwo%
+ \else
+ @secondoftwo%
+ \fi
+ \endcsname
+}
+\patchcmd{\ID@switch}
+ {\ifcat\noexpand\@foo\space}
+ {\the\ID@usercommands\ifcat\noexpand\@foo\space}
+ {%
+ \NewInlineCommand[2]\ExpandIfT{%
+ \MultiExpand{3}{%
+ \@ExpandIfTF{#1}{#2}{}%
+ }%
+ }
+ \NewInlineCommand[2]\ExpandIfF{%
+ \MultiExpand{3}{%
+ \@ExpandIfTF{#1}{}{#2}%
+ }%
+ }
+ \NewInlineCommand[3]\ExpandIfTF{%
+ \MultiExpand{3}{%
+ \@ExpandIfTF{#1}{#2}{#3}%
+ }%
+ }%
+ \newcommand\InlineNoDef[1]{%
+ \begingroup
+ % Define a few ``quarks''
+ \def\Expand{\Expand}\def\Super{\Super}%
+ \def\UnsafeExpand{\UnsafeExpand}\def\MultiExpand{\MultiExpand}%
+ \def\Recurse{\Recurse}\def\NoExpand{\NoExpand}%
+ \def\Q@END{\Q@END}%
+ % Define a toks register
+ \ID@toks{}%
+ % Signal that we need to look for a star
+ \@testtrue\ID@starfalse\ID@starstarfalse\ID@bangfalse
+ % Start scanning for \def or \gdef
+ \ID@scan#1\Q@END{}%
+ \expandafter\endgroup
+ %\expandafter\@firstofone
+ \the\ID@toks
+ }%
+ }%
+ {%
+ \PackageWarning{forest}{Could not patch inlinedef! Disabling it. Except in some special situations (nested arrays), stuff will probably still work, but there's no guarantee. Please report this situation to the author (but check first if a new version already exists).}{}%
+ \let\Inline\relax
+ \def\Expand#1{#1}%
+ \def\MultiExpand#1#2{#2}%
+ \def\InlineNoDef#1{#1}%
+ \def\ExpandIfT#1#2{\@ExpandIfTF{#1}{#2}{}}%
+ \def\ExpandIfF#1#2{\@ExpandIfTF{#1}{}{#2}}%
+ \def\ExpandIfTF#1#2#3{\@ExpandIfTF{#1}{#2}{#3}}%
+ }
+% \end{macrocode}
+%
+% |/forest| is the root of the key hierarchy.
+% \begin{macrocode}
+\pgfkeys{/forest/.is family}
+\def\forestset#1{\pgfqkeys{/forest}{#1}}
+% \end{macrocode}
+%
+% \section{Package options}
+% \begin{macrocode}
+\newif\ifforest@external@
+\newif\ifforesttikzcshack
+\newif\ifforest@install@keys@to@tikz@path@
+\newif\ifforestdebugnodewalks
+\newif\ifforestdebugdynamics
+\newif\ifforestdebugprocess
+\newif\ifforestdebugtemp
+\newif\ifforestdebug
+\def\forest@compat{}
+\forestset{package@options/.cd,
+ external/.is if=forest@external@,
+ tikzcshack/.is if=foresttikzcshack,
+ tikzinstallkeys/.is if=forest@install@keys@to@tikz@path@,
+ compat/.code={\appto\forest@compat{,#1}},
+ compat/.default=most,
+ .unknown/.code={% load library
+ \eappto\forest@loadlibrarieslater{%
+ \noexpand\useforestlibrary{\pgfkeyscurrentname}%
+ \noexpand\forestapplylibrarydefaults{\pgfkeyscurrentname}%
+ }%
+ },
+ debug/.code={\forestdebugtrue\pgfqkeys{/forest/package@options/debug}{#1}},
+ debug/.default={nodewalks,dynamics,process},
+ debug/nodewalks/.is if=forestdebugnodewalks,
+ debug/dynamics/.is if=forestdebugdynamics,
+ debug/process/.is if=forestdebugprocess,
+}
+\forest@install@keys@to@tikz@path@true
+\foresttikzcshacktrue
+\def\forest@loadlibrarieslater{}
+\AtEndOfPackage{\forest@loadlibrarieslater}
+\NewDocumentCommand\useforestlibrary{s O{} m}{%
+ \def\useforestlibrary@@##1{\useforestlibrary@{#2}{##1}}%
+ \forcsvlist\useforestlibrary@@{#3}%
+ \IfBooleanT{#1}{\forestapplylibrarydefaults{#3}}%
+}
+\def\useforestlibrary@#1#2{%
+ \RequirePackage[#1]{forest-lib-#2}%
+ \csuse{forest@compat@libraries@#2}%
+}
+\def\forestapplylibrarydefaults#1{\forcsvlist\forestapplylibrarydefaults@{#1}}
+\def\forestapplylibrarydefaults@#1{\forestset{libraries/#1/defaults/.try}}
+\NewDocumentCommand\ProvidesForestLibrary{m O{}}{%
+ \ProvidesPackage{forest-lib-#1}[#2]%
+ \csdef{forest@libraries@loaded@#1}{}%
+}
+\def\forest@iflibraryloaded#1#2#3{\ifcsdef{forest@libraries@loaded@#1}{#2}{#3}}
+\ProcessPgfPackageOptions{/forest/package@options}
+% \end{macrocode}
+% \section{Patches}
+%
+% This macro implements a fairly safe patching mechanism: the code is only patched if the original
+% hasn't changed. If it did change, a warning message is printed. (This produces a spurious warning
+% when the new version of the code fixes something else too, but what the heck.)
+%
+% \begin{macrocode}
+\def\forest@patch#1#2#3#4#5{%
+ % #1 = cs to be patched
+ % %2 = purpose of the patch
+ % #3 = macro arguments
+ % #4 = original code
+ % #5 = patched code
+ \csdef{forest@original@#1}#3{#4}%
+ \csdef{forest@patched@#1}#3{#5}%
+ \ifcsequal{#1}{forest@original@#1}{%
+ \csletcs{#1}{forest@patched@#1}%
+ }{%
+ \ifcsequal{#1}{forest@patched@#1}{% all is good, the patch is in!
+ }{%
+ \PackageWarning{forest}{Failed patching '\expandafter\string\csname #1\endcsname'. Purpose of the patch: #2}%
+ }%
+ }%
+}
+% \end{macrocode}
+%
+% Patches for \PGF; 3.0.0 --- required version is [2013/12/13].
+% \begin{macrocode}
+\forest@patch{pgfgettransform}{fix a leaking space}{#1}{%
+ \edef#1{{\pgf@pt@aa}{\pgf@pt@ab}{\pgf@pt@ba}{\pgf@pt@bb}{\the\pgf@pt@x}{\the\pgf@pt@y}}
+}{%
+ \edef#1{{\pgf@pt@aa}{\pgf@pt@ab}{\pgf@pt@ba}{\pgf@pt@bb}{\the\pgf@pt@x}{\the\pgf@pt@y}}%
+}
+% \end{macrocode}
+%
+% \section{Utilities}
+%
+% This is handy.
+% \begin{macrocode}
+\def\forest@empty{}
+% \end{macrocode}
+%
+% Escaping |\if|s.
+% \begin{macrocode}
+\long\def\@escapeif#1#2\fi{\fi#1}
+\long\def\@escapeifif#1#2\fi#3\fi{\fi\fi#1}
+\long\def\@escapeififif#1#2\fi#3\fi#4\fi{\fi\fi\fi#1}
+% \end{macrocode}
+%
+% \begin{macrocode}
+\def\forest@repeat@n@times#1{% #1=n, #2=code
+ \expandafter\forest@repeat@n@times@\expandafter{\the\numexpr#1}}
+\def\forest@repeat@n@times@#1{%
+ \ifnum#1>0
+ \@escapeif{%
+ \expandafter\forest@repeat@n@times@@\expandafter{\the\numexpr#1-1}%
+ }%
+ \else
+ \expandafter\@gobble
+ \fi
+}
+\def\forest@repeat@n@times@@#1#2{%
+ #2%
+ \forest@repeat@n@times@{#1}{#2}%
+}
+% \end{macrocode}
+%
+% A factory for creating |\...loop...| macros.
+% \begin{macrocode}
+\def\newloop#1{%
+ \count@=\escapechar
+ \escapechar=-1
+ \expandafter\newloop@parse@loopname\string#1\newloop@end
+ \escapechar=\count@
+}%
+{\lccode`7=`l \lccode`8=`o \lccode`9=`p
+ \lowercase{\gdef\newloop@parse@loopname#17889#2\newloop@end{%
+ \edef\newloop@marshal{%
+ \noexpand\csdef{#1loop#2}####1\expandafter\noexpand\csname #1repeat#2\endcsname{%
+ \noexpand\csdef{#1iterate#2}{####1\relax\noexpand\expandafter\expandafter\noexpand\csname#1iterate#2\endcsname\noexpand\fi}%
+ \expandafter\noexpand\csname#1iterate#2\endcsname
+ \let\expandafter\noexpand\csname#1iterate#2\endcsname\relax
+ }%
+ }%
+ \newloop@marshal
+ }%
+ }%
+}%
+% \end{macrocode}
+%
+% Loop that can be arbitrarily nested. (Not in the same macro, however: use another macro for the inner loop.) Usage: |\safeloop_code_\if..._code_\saferepeat|. |\safeloopn| expands to the current repetition number of the innermost group.
+% \begin{macrocode}
+\def\newsafeloop#1{%
+ \csdef{safeloop@#1}##1\saferepeat{%
+ \forest@temp@toks{##1}%
+ \csedef{safeiterate@#1}{%
+ \the\forest@temp@toks\relax
+ \noexpand\expandafter
+ \expandonce{\csname safeiterate@#1\endcsname}%
+ \noexpand\fi
+ }%
+ \csuse{safeiterate@#1}%
+ \advance\noexpand\safeloop@depth-1\relax
+ \cslet{safeiterate@#1}\relax
+ }%
+ \expandafter\newif\csname ifsafebreak@\the\safeloop@depth\endcsname
+}%
+\newcount\safeloop@depth
+\def\safeloop{%
+ \advance\safeloop@depth1
+ \ifcsdef{safeloop@\the\safeloop@depth}{}{\expandafter\newsafeloop\expandafter{\the\safeloop@depth}}%
+ \csdef{safeloopn@\the\safeloop@depth}{0}%
+ \csuse{safeloop@\the\safeloop@depth}%
+ \csedef{safeloopn@\the\safeloop@depth}{\number\numexpr\csuse{safeloopn@\the\safeloop@depth}+1}%
+}
+\let\saferepeat\fi
+\def\safeloopn{\csuse{safeloopn@\the\safeloop@depth}}%
+% \end{macrocode}
+%
+% Another safeloop for usage with ``repeat'' / ``while'' // ``until'' keys, so that the user can refer to loop $n$s for outer loops.
+% \begin{macrocode}
+\def\newsafeRKloop#1{%
+ \csdef{safeRKloop@#1}##1\safeRKrepeat{%
+ \forest@temp@toks{##1}%
+ \csedef{safeRKiterate@#1}{%
+ \the\forest@temp@toks\relax
+ \noexpand\expandafter
+ \expandonce{\csname safeRKiterate@#1\endcsname}%
+ \noexpand\fi
+ }%
+ \csuse{safeRKiterate@#1}%
+ \advance\noexpand\safeRKloop@depth-1\relax
+ \cslet{safeRKiterate@#1}\relax
+ }%
+ \expandafter\newif\csname ifsafeRKbreak@\the\safeRKloop@depth\endcsname
+}%
+\newcount\safeRKloop@depth
+\def\safeRKloop{%
+ \advance\safeRKloop@depth1
+ \ifcsdef{safeRKloop@\the\safeRKloop@depth}{}{\expandafter\newsafeRKloop\expandafter{\the\safeRKloop@depth}}%
+ \csdef{safeRKloopn@\the\safeRKloop@depth}{0}%
+ \csuse{safeRKbreak@\the\safeRKloop@depth false}%
+ \csuse{safeRKloop@\the\safeRKloop@depth}%
+ \csedef{safeRKloopn@\the\safeRKloop@depth}{\number\numexpr\csuse{safeRKloopn@\the\safeRKloop@depth}+1}%
+}
+\let\safeRKrepeat\fi
+\def\safeRKloopn{\csuse{safeRKloopn@\the\safeRKloop@depth}}%
+% \end{macrocode}
+%
+% Additional loops (for embedding).
+% \begin{macrocode}
+\newloop\forest@loop
+% \end{macrocode}
+% New counters, dimens, ifs.
+% \begin{macrocode}
+\newdimen\forest@temp@dimen
+\newcount\forest@temp@count
+\newcount\forest@n
+\newif\ifforest@temp
+\newcount\forest@temp@global@count
+\newtoks\forest@temp@toks
+% \end{macrocode}
+%
+% Appending and prepending to token lists.
+% \begin{macrocode}
+\def\etotoks#1#2{\edef\pot@temp{#2}\expandafter#1\expandafter{\pot@temp}}
+\def\apptotoks#1#2{\expandafter#1\expandafter{\the#1#2}}
+\long\def\lapptotoks#1#2{\expandafter#1\expandafter{\the#1#2}}
+\def\eapptotoks#1#2{\edef\pot@temp{#2}\expandafter\expandafter\expandafter#1\expandafter\expandafter\expandafter{\expandafter\the\expandafter#1\pot@temp}}
+\def\pretotoks#1#2{\toks@={#2}\expandafter\expandafter\expandafter#1\expandafter\expandafter\expandafter{\expandafter\the\expandafter\toks@\the#1}}
+\def\epretotoks#1#2{\edef\pot@temp{#2}\expandafter\expandafter\expandafter#1\expandafter\expandafter\expandafter{\expandafter\pot@temp\the#1}}
+\def\gapptotoks#1#2{\expandafter\global\expandafter#1\expandafter{\the#1#2}}
+\def\xapptotoks#1#2{\edef\pot@temp{#2}\expandafter\expandafter\expandafter\global\expandafter\expandafter\expandafter#1\expandafter\expandafter\expandafter{\expandafter\the\expandafter#1\pot@temp}}
+\def\gpretotoks#1#2{\toks@={#2}\expandafter\expandafter\expandafter\global\expandafter\expandafter\expandafter#1\expandafter\expandafter\expandafter{\expandafter\the\expandafter\toks@\the#1}}
+\def\xpretotoks#1#2{\edef\pot@temp{#2}\expandafter\expandafter\expandafter\global\expandafter\expandafter\expandafter#1\expandafter\expandafter\expandafter{\expandafter\pot@temp\the#1}}
+% \end{macrocode}
+%
+% Expanding number arguments.
+% \begin{macrocode}
+\def\expandnumberarg#1#2{\expandafter#1\expandafter{\number#2}}
+\def\expandtwonumberargs#1#2#3{%
+ \expandafter\expandtwonumberargs@\expandafter#1\expandafter{\number#3}{#2}}
+\def\expandtwonumberargs@#1#2#3{%
+ \expandafter#1\expandafter{\number#3}{#2}}
+\def\expandthreenumberargs#1#2#3#4{%
+ \expandafter\expandthreenumberargs@\expandafter#1\expandafter{\number#4}{#2}{#3}}
+\def\expandthreenumberargs@#1#2#3#4{%
+ \expandafter\expandthreenumberargs@@\expandafter#1\expandafter{\number#4}{#2}{#3}}
+\def\expandthreenumberargs@@#1#2#3#4{%
+ \expandafter#1\expandafter{\number#4}{#2}{#3}}
+% \end{macrocode}
+%
+% A macro converting all non-alphanumerics (and an initial number) in a string to |__|. |#1| =
+% string, |#2| = receiving macro. Used for declaring pgfmath functions.
+% \begin{macrocode}
+\def\forest@convert@others@to@underscores#1#2{%
+ \def\forest@cotu@result{}%
+ \forest@cotu@first#1\forest@end
+ \let#2\forest@cotu@result
+}
+\def\forest@cotu{%
+ \let\forest@cotu@have@num\forest@cotu@have@alpha
+ \futurelet\forest@cotu@nextchar\forest@cotu@checkforspace
+}
+\def\forest@cotu@first{%
+ \let\forest@cotu@have@num\forest@cotu@haveother
+ \futurelet\forest@cotu@nextchar\forest@cotu@checkforspace
+}
+\def\forest@cotu@checkforspace{%
+ \expandafter\ifx\space\forest@cotu@nextchar
+ \let\forest@cotu@next\forest@cotu@havespace
+ \else
+ \let\forest@cotu@next\forest@cotu@nospace
+ \fi
+ \forest@cotu@next
+}
+\def\forest@cotu@havespace#1{%
+ \appto\forest@cotu@result{_}%
+ \forest@cotu#1%
+}
+\def\forest@cotu@nospace{%
+ \ifx\forest@cotu@nextchar\forest@end
+ \@escapeif\@gobble
+ \else
+ \@escapeif\forest@cotu@nospaceB
+ \fi
+}
+\def\forest@cotu@nospaceB#1{%
+ \ifcat#1a%
+ \let\forest@cotu@next\forest@cotu@have@alpha
+ \else
+ \if!\ifnum9<1#1!\fi
+ \let\forest@cotu@next\forest@cotu@have@num
+ \else
+ \let\forest@cotu@next\forest@cotu@haveother
+ \fi
+ \fi
+ \forest@cotu@next#1%
+}
+\def\forest@cotu@have@alpha#1{%
+ \appto\forest@cotu@result{#1}%
+ \forest@cotu
+}
+\def\forest@cotu@haveother#1{%
+ \appto\forest@cotu@result{_}%
+ \forest@cotu
+}
+% \end{macrocode}
+%
+% Additional list macros.
+% \begin{macrocode}
+\def\forest@listedel#1#2{% #1 = list, #2 = item
+ \edef\forest@marshal{\noexpand\forest@listdel\noexpand#1{#2}}%
+ \forest@marshal
+}
+\def\forest@listcsdel#1#2{%
+ \expandafter\forest@listdel\csname #1\endcsname{#2}%
+}
+\def\forest@listcsedel#1#2{%
+ \expandafter\forest@listedel\csname #1\endcsname{#2}%
+}
+\edef\forest@restorelistsepcatcode{\noexpand\catcode`|\the\catcode`|\relax}%
+\catcode`\|=3
+\gdef\forest@listdel#1#2{%
+ \def\forest@listedel@A##1|#2|##2\forest@END{%
+ \forest@listedel@B##1|##2\forest@END%|
+ }%
+ \def\forest@listedel@B|##1\forest@END{%|
+ \def#1{##1}%
+ }%
+ \expandafter\forest@listedel@A\expandafter|#1\forest@END%|
+}
+\forest@restorelistsepcatcode
+% \end{macrocode}
+%
+% Strip (the first level of) braces from all the tokens in the argument.
+% \begin{macrocode}
+\def\forest@strip@braces#1{%
+ \forest@strip@braces@A#1\forest@strip@braces@preend\forest@strip@braces@end
+}
+\def\forest@strip@braces@A#1#2\forest@strip@braces@end{%
+ #1\ifx\forest@strip@braces@preend#2\else\@escapeif{\forest@strip@braces@A#2\forest@strip@braces@end}\fi
+}
+% \end{macrocode}
+%
+% Utilities dealing with pgfkeys.
+% \begin{macrocode}
+\def\forest@copycommandkey#1#2{% copies command of #1 into #2
+ \pgfkeysifdefined{#1/.@cmd}{}{%
+ \PackageError{forest}{Key #1 is not a command key}{}%
+ }%
+ \pgfkeysgetvalue{#1/.@cmd}\forest@temp
+ \pgfkeyslet{#2/.@cmd}\forest@temp
+ \pgfkeysifdefined{#1/.@args}{%
+ \pgfkeysgetvalue{#1/.@args}\forest@temp
+ \pgfkeyslet{#2/.@args}\forest@temp
+ }{}%
+ \pgfkeysifdefined{#1/.@body}{%
+ \pgfkeysgetvalue{#1/.@body}\forest@temp
+ \pgfkeyslet{#2/.@body}\forest@temp
+ }{}%
+ \pgfkeysifdefined{#1/.@@body}{%
+ \pgfkeysgetvalue{#1/.@@body}\forest@temp
+ \pgfkeyslet{#2/.@@body}\forest@temp
+ }{}%
+ \pgfkeysifdefined{#1/.@def}{%
+ \pgfkeysgetvalue{#1/.@def}\forest@temp
+ \pgfkeyslet{#2/.@def}\forest@temp
+ }{}%
+}
+\forestset{
+ copy command key/.code 2 args={\forest@copycommandkey{#1}{#2}},
+ autoforward/.code 2 args={\forest@autoforward{#1}{#2={#1={##1}}}{true}},
+ autoforward'/.code 2 args={\forest@autoforward{#1}{#2-=#1,#2={#1={##1}}}{true}},
+ Autoforward/.code 2 args={\forest@autoforward{#1}{#2}{true}},
+ autoforward register/.code 2 args={\forest@autoforward{#1}{#2={#1={##1}}}{false}},
+ autoforward register'/.code 2 args={\forest@autoforward{#1}{#2-=#1,#2={#1={##1}}}{false}},
+ Autoforward register/.code 2 args={\forest@autoforward{#1}{#2}{false}},
+ copy command key@if it exists/.code 2 args={%
+ \pgfkeysifdefined{#1/.@cmd}{%
+ \forest@copycommandkey{#1}{#2}%
+ }{}%
+ },
+ unautoforward/.style={
+ typeout={unautoforwarding #1},
+ copy command key@if it exists={/forest/autoforwarded #1}{/forest/#1},
+ copy command key@if it exists={/forest/autoforwarded #1+}{/forest/#1+},
+ copy command key@if it exists={/forest/autoforwarded #1-}{/forest/#1-},
+ copy command key@if it exists={/forest/autoforwarded #1*}{/forest/#1*},
+ copy command key@if it exists={/forest/autoforwarded #1:}{/forest/#1:},
+ copy command key@if it exists={/forest/autoforwarded #1'}{/forest/#1'},
+ copy command key@if it exists={/forest/autoforwarded #1+'}{/forest/#1+'},
+ copy command key@if it exists={/forest/autoforwarded #1-'}{/forest/#1-'},
+ copy command key@if it exists={/forest/autoforwarded #1*'}{/forest/#1*'},
+ copy command key@if it exists={/forest/autoforwarded #1:'}{/forest/#1:'},
+ copy command key@if it exists={/forest/autoforwarded +#1}{/forest/+#1},
+ },
+ /handlers/.undef/.code={\csundef{pgfk@\pgfkeyscurrentpath}},
+ undef option/.style={
+ /forest/#1/.undef,
+ /forest/#1/.@cmd/.undef,
+ /forest/#1+/.@cmd/.undef,
+ /forest/#1-/.@cmd/.undef,
+ /forest/#1*/.@cmd/.undef,
+ /forest/#1:/.@cmd/.undef,
+ /forest/#1'/.@cmd/.undef,
+ /forest/#1+'/.@cmd/.undef,
+ /forest/#1-'/.@cmd/.undef,
+ /forest/#1*'/.@cmd/.undef,
+ /forest/#1:'/.@cmd/.undef,
+ /forest/+#1/.@cmd/.undef,
+ /forest/TeX={\patchcmd{\forest@node@init}{\forestoinit{#1}}{}{}{}},
+ },
+ undef register/.style={undef option={#1}},
+}
+\def\forest@autoforward#1#2#3{%
+ % #1 = option name
+ % #2 = code of a style taking one arg (new option value),
+ % which expands to whatever should be done with the new value
+ % autoforward(') adds to the keylist (arg#2)
+ % #3 = true=option, false=register
+ \forest@autoforward@createforwarder{}{#1}{}{#2}{#3}%
+ \forest@autoforward@createforwarder{}{#1}{+}{#2}{#3}%
+ \forest@autoforward@createforwarder{}{#1}{-}{#2}{#3}%
+ \forest@autoforward@createforwarder{}{#1}{*}{#2}{#3}%
+ \forest@autoforward@createforwarder{}{#1}{:}{#2}{#3}%
+ \forest@autoforward@createforwarder{}{#1}{'}{#2}{#3}%
+ \forest@autoforward@createforwarder{}{#1}{+'}{#2}{#3}%
+ \forest@autoforward@createforwarder{}{#1}{-'}{#2}{#3}%
+ \forest@autoforward@createforwarder{}{#1}{*'}{#2}{#3}%
+ \forest@autoforward@createforwarder{}{#1}{:'}{#2}{#3}%
+ \forest@autoforward@createforwarder{+}{#1}{}{#2}{#3}%
+}
+\def\forest@autoforward@createforwarder#1#2#3#4#5{%
+ % #1=prefix, #2=option name, #3=suffix, #4=macro code (#2 above), #5=option or register
+ \pgfkeysifdefined{/forest/#1#2#3/.@cmd}{%
+ \forest@copycommandkey{/forest/#1#2#3}{/forest/autoforwarded #1#2#3}%
+ \pgfkeyssetvalue{/forest/autoforwarded #1#2#3/option@name}{#2}%
+ \pgfkeysdef{/forest/#1#2#3}{%
+ \pgfkeysalso{autoforwarded #1#2#3={##1}}%
+ \def\forest@temp@macro####1{#4}%
+ \csname forest@temp#5\endcsname
+ \edef\forest@temp@value{\ifforest@temp\expandafter\forestOv\expandafter{\expandafter\forest@setter@node\expandafter}\else\expandafter\forestrv\fi{#2}}%
+ %\expandafter\expandafter\expandafter\pgfkeysalso\expandafter\expandafter\expandafter{\expandafter\forest@temp@macro\expandafter{\forest@temp@value}}% ??? how many expansions are really needed?
+ \expandafter\expandafter\expandafter\expandafter\expandafter\expandafter\expandafter\pgfkeysalso\expandafter\expandafter\expandafter{\expandafter\forest@temp@macro\expandafter{\forest@temp@value}}%
+ }%
+ }{}%
+}
+\def\forest@node@removekeysfromkeylist#1#2{% #1 = keys to remove, #2 = option name
+ \edef\forest@marshal{%
+ \noexpand\forest@removekeysfromkeylist{\unexpanded{#1}}{\forestov{#2}}\noexpand\forest@temp@toks}\forest@marshal
+ \forestoeset{#2}{\the\forest@temp@toks}%
+}
+\def\forest@removekeysfromkeylist#1#2#3{%
+ % #1 = keys to remove (a keylist: an empty value means remove a key with any value)
+ % #2 = keylist
+ % #3 = toks cs for result
+ \forest@temp@toks{}%
+ \def\forestnovalue{\forestnovalue}%
+ \pgfqkeys{/forest/remove@key@installer}{#1}%
+ \let\forestnovalue\pgfkeysnovaluetext
+ \pgfqkeys{/forest/remove@key}{#2}%
+ \pgfqkeys{/forest/remove@key@uninstaller}{#1}%
+ #3\forest@temp@toks
+}
+\def\forest@remove@key@novalue{\forest@remove@key@novalue}%
+\forestset{
+ remove@key@installer/.unknown/.code={% #1 = (outer) value
+ \def\forest@temp{#1}%
+ \ifx\forest@temp\pgfkeysnovalue@text
+ \pgfkeysdef{/forest/remove@key/\pgfkeyscurrentname}{}%
+ \else
+ \ifx\forest@temp\forestnovalue
+ \expandafter\forest@remove@key@installer@defwithvalue\expandafter{\pgfkeyscurrentname}{\pgfkeysnovalue}%
+ \else
+ \expandafter\forest@remove@key@installer@defwithvalue\expandafter{\pgfkeyscurrentname}{#1}%
+ \fi
+ \fi
+ },
+ remove@key/.unknown/.code={% #1 = (inner) value
+ \expandafter\apptotoks\expandafter\forest@temp@toks\expandafter{\pgfkeyscurrentname={#1},}%
+ },
+ remove@key@uninstaller/.unknown/.code={%
+ \pgfkeyslet{/forest/remove@key/\pgfkeyscurrentname/.@cmd}\@undefined},
+}
+\def\forest@remove@key@installer@defwithvalue#1#2{% #1=key name, #2 = outer value
+ \pgfkeysdef{/forest/remove@key/#1}{% ##1 = inner value
+ \def\forest@temp@outer{#2}%
+ \def\forest@temp@inner{##1}%
+ \ifx\forest@temp@outer\forest@temp@inner
+ \else
+ \apptotoks\forest@temp@toks{#1={##1},}%
+ \fi
+ }%
+}
+\forestset{
+ show register/.code={%
+ \forestrget{#1}\foresttemp
+ \typeout{Forest register "#1"=\expandafter\detokenize\expandafter{\foresttemp}}%
+ },
+}
+% \end{macrocode}
+% \subsection{Arrays}
+%
+% \begin{macrocode}
+\def\forest@newarray#1{%
+ \forest@tempfalse % non-global
+ {%
+ \escapechar=-1
+ \expandafter\escapechar\expandafter\count@\expandafter
+ }%
+ \expandafter\forest@newarray@\expandafter{\string#1}%
+}
+\def\forest@newglobalarray#1{%
+ \forest@temptrue % global
+ {%
+ \escapechar=-1
+ \expandafter\escapechar\expandafter\count@\expandafter
+ }%
+ \expandafter\forest@newarray@\expandafter{\string#1}%
+}
+\def\forest@array@empty@error#1{%
+ \PackageError{forest}{Cannot pop from empty array "#1".}{}}%
+\def\forest@array@oub@error#1#2{%
+ \PackageError{forest}{#2 is out of bounds of array "#1"
+ (\the\csuse{#1M}--\the\csuse{#1N}).}{}}%
+% \end{macrocode}
+% Define array macros. For speed, we define most of them to be ``direct'', i.e.\ cointain the resolved control sequences specific to this array.
+% \begin{macrocode}
+\def\forest@newarray@#1{%
+ % array bounds: M <= i < N
+ \expandafter\newcount\csname#1M\endcsname
+ \expandafter\newcount\csname#1N\endcsname
+ \csedef{#1clear}{%
+ \ifforest@temp\global\fi\expandonce{\csname#1M\endcsname}0
+ \ifforest@temp\global\fi\expandonce{\csname#1N\endcsname}0
+ }%
+ \csedef{#1ifempty}{%
+ \noexpand\ifnum\expandonce{\csname#1M\endcsname}<\expandonce{\csname#1N\endcsname}\relax
+ \unexpanded{\expandafter\@secondoftwo
+ \else
+ \expandafter\@firstoftwo
+ \fi}%
+ }%
+ \csedef{#1length}{% a numexpr
+ \noexpand\numexpr\expandonce{\csname#1N\endcsname}-\expandonce{\csname#1M\endcsname}\relax
+ }%
+ \csedef{#1checkrange}##1##2{% args can be \numexprs
+ \noexpand\forest@tempfalse
+ \noexpand\ifnum\numexpr##1<\expandonce{\csname#1M\endcsname}\relax
+ \noexpand\forest@temptrue
+ \noexpand\fi
+ \noexpand\ifnum\numexpr##2>\expandonce{\csname#1N\endcsname}\relax
+ \noexpand\forest@temptrue
+ \noexpand\fi
+ \noexpand\ifforest@temp
+ \noexpand\forest@array@oub@error{#1}{Range "\noexpand\number\noexpand\numexpr##1\relax--\noexpand\number\noexpand\numexpr##2\relax"}%
+ \noexpand\fi
+ }%
+ \csedef{#1checkindex}##1{% arg can be a \numexpr
+ \noexpand\forest@tempfalse
+ \noexpand\ifnum\numexpr##1<\expandonce{\csname#1M\endcsname}\relax
+ \noexpand\forest@temptrue
+ \noexpand\fi
+ \noexpand\ifnum\numexpr##1<\expandonce{\csname#1N\endcsname}\relax
+ \noexpand\else
+ \noexpand\forest@temptrue
+ \noexpand\fi
+ \noexpand\ifforest@temp
+ \noexpand\forest@array@oub@error{#1}{Index "\noexpand\number\noexpand\numexpr##1\relax"}%
+ \noexpand\fi
+ }%
+ \csedef{#1get}##1##2{% ##1 = index, ##2 = receiving cs
+ \expandonce{\csname#1checkindex\endcsname}{##1}%
+ \noexpand\letcs##2{#1##1}%
+ }%
+ \csedef{#1get@}##1##2{% ##1 = index, ##2 = receiving cs (don't check bounds)
+ \noexpand\letcs##2{#1##1}%
+ }%
+ \csedef{#1toppop}##1{% ##1 = receiving cs
+ \expandonce{\csname#1ifempty\endcsname}{%
+ \noexpand\forest@array@empty@error{#1}%
+ }{%
+ \ifforest@temp\global\fi\advance\expandonce{\csname#1N\endcsname}-1
+ \noexpand\letcs\noexpand##1{#1\noexpand\the\expandonce{\csname#1N\endcsname}}%
+ }%
+ }%
+ \InlineNoDef{\csdef{#1bottompop}##1{% ##1 = receiving cs
+ \Expand{\csname#1ifempty\endcsname}{%
+ \forest@array@empty@error{#1}%
+ }{%
+ \letcs##1{#1\the\Expand{\csname#1M\endcsname}}%
+ \ExpandIfT{forest@temp}\global\advance\Expand{\csname#1M\endcsname 1}%
+ }%
+ }}%
+ % \csdef{#1bottompop}##1{}% we need this as \Inline chokes on \let\macro=\relax
+ % \expandafter\Inline\expandafter\def\csname#1bottompop\endcsname##1{% ##1 = receiving cs
+ % \Expand{\csname#1ifempty\endcsname}{%
+ % \forest@array@empty@error{#1}%
+ % }{%
+ % \letcs##1{#1\the\Expand{\csname#1M\endcsname}}%
+ % \ExpandIfT{forest@temp}\global\advance\Expand{\csname#1M\endcsname 1}%
+ % }%
+ % }%
+ % \csedef{#1bottompop}##1{% ##1 = receiving cs
+ % \expandonce{\csname#1ifempty\endcsname}{%
+ % \noexpand\forest@array@empty@error{#1}%
+ % }{%
+ % \noexpand\letcs\noexpand##1{#1\noexpand\the\expandonce{\csname#1M\endcsname}}%
+ % \ifforest@temp\global\fi\advance\expandonce{\csname#1M\endcsname}1
+ % }%
+ % }%
+ \csedef{#1setappend}##1{% ##1 = definition
+ \ifforest@temp\noexpand\csxdef\else\noexpand\csedef\fi
+ {#1\noexpand\the\expandonce{\csname#1N\endcsname}}%
+ {\noexpand\unexpanded{##1}}%
+ \ifforest@temp\global\fi\advance\expandonce{\csname#1N\endcsname}1
+ }%
+ \csedef{#1setappend@}##1##2{% ##1 = continue by, ##2 = definition
+ \ifforest@temp\noexpand\csxdef\else\noexpand\csedef\fi
+ {#1\noexpand\the\expandonce{\csname#1N\endcsname}}%
+ {\noexpand\unexpanded{##2}}%
+ \ifforest@temp\global\fi\advance\expandonce{\csname#1N\endcsname}1
+ ##1%
+ }%
+ \csedef{#1setprepend}##1{% ##1 = definition
+ \ifforest@temp\global\fi\advance\expandonce{\csname#1M\endcsname}-1
+ \ifforest@temp\noexpand\csxdef\else\noexpand\csedef\fi
+ {#1\noexpand\the\expandonce{\csname#1M\endcsname}}%
+ {\noexpand\unexpanded{##1}}%
+ }%
+ \csedef{#1esetappend}##1{% ##1 = definition
+ \ifforest@temp\noexpand\csxdef\else\noexpand\csedef\fi{#1\noexpand\the\expandonce{\csname#1N\endcsname}}{##1}%
+ \ifforest@temp\global\fi\advance\expandonce{\csname#1N\endcsname}1
+ }%
+ \csedef{#1esetprepend}##1{% ##1 = definition
+ \ifforest@temp\global\fi\advance\expandonce{\csname#1M\endcsname}-1
+ \ifforest@temp\noexpand\csxdef\else\noexpand\csedef\fi{#1\noexpand\the\expandonce{\csname#1M\endcsname}}{##1}%
+ }%
+ \csedef{#1letappend}##1{% ##1 = cs
+ \ifforest@temp\noexpand\expandafter\noexpand\global\fi\noexpand\expandafter\noexpand\let
+ \noexpand\csname#1\noexpand\the\expandonce{\csname#1N\endcsname}\noexpand\endcsname
+ ##1%
+ \ifforest@temp\global\fi\advance\expandonce{\csname#1N\endcsname}1
+ }%
+ \csedef{#1letprepend}##1{% ##1 = cs
+ \ifforest@temp\global\fi\advance\expandonce{\csname#1M\endcsname}-1
+ \ifforest@temp\noexpand\expandafter\noexpand\global\fi\noexpand\expandafter\noexpand\let
+ \noexpand\csname#1\noexpand\the\expandonce{\csname#1M\endcsname}\noexpand\endcsname
+ ##1%
+ }%
+% \end{macrocode}
+% I would love to define these only generically, as they will not be called often, but they need to be expandable. Argh.
+% right?
+% \begin{lstlisting}
+% \def\arrayvalues{% <-- \csedef{#1values}
+% \expandafter\expandafter\expandafter\arrayvaluesfromrange %\arrayvaluesfromrange <-- \expandonce{\csname#1valuesfromrange\endcsname}
+% \expandafter\expandafter\expandafter{%
+% \expandafter\the
+% \expandafter\arrayM %\arrayM <-- \expandonce{\csname#1M\endcsname}%
+% \expandafter}%
+% \expandafter{%
+% \the\arrayN %\arrayN <-- \expandonce{\csname#1N\endcsname}%
+% }%
+% }%
+% \end{lstlisting}
+% \begin{macrocode}
+ \csedef{#1values}{%
+ \noexpand\expandafter\noexpand\expandafter\noexpand\expandafter\expandonce{\csname#1valuesfromrange\endcsname}%
+ \noexpand\expandafter\noexpand\expandafter\noexpand\expandafter{%
+ \noexpand\expandafter\noexpand\the
+ \noexpand\expandafter\expandonce{\csname#1M\endcsname}%
+ \noexpand\expandafter}%
+ \noexpand\expandafter{\noexpand\the\expandonce{\csname#1N\endcsname}}%
+ }%
+% \end{macrocode}
+% \begin{lstlisting}
+% \def\arrayvaluesfromrange##1##2{% ##1/##2 = lower/upper bounds (we receive them expanded) <-- \csedef{#1vuesfromrange}
+% \ifnum##1<##2
+% {\expandafter\expandonce\expandafter{\csname#1##1\endcsname}}% here we add braces (for the general case, we might want an arbitrary prefix&suffix)
+% \expandafter\@escapeif\expandafter{\expandafter\arrayvaluesfromrange % <-- \expandonce{\csname#1valuesfromrange\endcsname}%
+% \expandafter{\number\numexpr##1+1}{##2}}%
+% \fi
+% }%
+% \end{lstlisting}
+% As we need this to be expandable, we cannot check the range within the macro. You need to to this on your own using |...checkrange| defined above.
+% \begin{macrocode}
+ \csedef{#1valuesfromrange}##1##2{% ##1/##2 = lower/upper bounds (we receive them expanded)
+ \noexpand\ifnum##1<##2
+ {\noexpand\expandafter\noexpand\expandonce\noexpand\expandafter{\noexpand\csname#1##1\noexpand\endcsname}}% here we add braces (for the general case, we might want an arbitrary prefix&suffix)
+ \noexpand\expandafter\noexpand\@escapeif\noexpand\expandafter{\noexpand\expandafter\expandonce{\csname#1valuesfromrange\endcsname}%
+ \noexpand\expandafter{\noexpand\number\noexpand\numexpr##1+1}{##2}}%
+ \noexpand\fi
+ }%
+% \end{macrocode}
+% Puts all items until |\forest@eov| into the array. After that is done, execute |\forest@topextend@next| (Why this macro? So that we can extend the array by tokens never seen before.). This code is difficult and not run often, so it doesn't need specialized control sequences.
+% \begin{macrocode}
+ \csdef{#1topextend}{\def\forest@array@currentarray{#1}\forest@array@topextend}%
+}
+\def\forest@array@topextend{\futurelet\forest@ate@next@token\forest@ate@checkforspace}
+\def\forest@ate@checkforspace{%
+ \expandafter\ifx\space\forest@ate@next@token
+ \expandafter\forest@ate@havespace
+ \else
+ \expandafter\forest@ate@checkforgroup
+ \fi
+}
+\def\forest@ate@havespace{\expandafter\forest@array@topextend\romannumeral-`0}%
+\def\forest@ate@checkforgroup{%
+ \ifx\forest@ate@next@token\bgroup
+ \expandafter\forest@ate@appendgroup
+ \else
+ \expandafter\forest@ate@checkforeov
+ \fi
+}
+\def\forest@ate@appendgroup{%
+ \expandonce{\csname\forest@array@currentarray setappend@\endcsname}\forest@array@topextend
+}
+\def\forest@ate@checkforeov{%
+ \ifx\forest@ate@next@token\forest@eov
+ \expandafter\forest@ate@finish
+ \else
+ \expandafter\forest@ate@appendtoken
+ \fi
+}
+\def\forest@ate@appendtoken#1{%
+ \expandonce{\csname\forest@array@currentarray setappend\endcsname}{#1}%
+ \forest@array@topextend
+}
+\def\forest@ate@finish\forest@eov{\forest@topextend@next}
+\let\forest@topextend@next\relax
+\forest@newarray\forest@temparray@
+\forest@newglobalarray\forest@global@temparray@
+% \end{macrocode}
+%
+%
+% \subsection{Testing for numbers and dimensions}
+% \label{sec:is-count-or-dimen}
+%
+% Test if the argument is an integer (only base 10) that can be assigned to a \TeX\ count register.
+% This is supposed to be a fast, not complete test, as anything not recognized as an integer will be
+% passed on to |pgfmath| (by the code that uses these macros).
+%
+% We support |+|s, |-|s and spaces before the number. We don't support count registers.
+%
+% Dillema? Should |0abc| be interpreted as \TeX\ style (decimal) or PGF style (octal)? We go for
+% \TeX\ style.
+%
+% The return value will hide in \TeX-style |\if|-macro |\forest@isnum| and counter |\forest@isnum@count|.
+%
+% \begin{macrocode}
+\def\forest@eon{ }
+\newif\ifforest@isnum@minus
+\newif\ifforest@isnum
+\def\forest@isnum#1{%
+ \forest@isnum@minusfalse
+ \let\forest@isnum@next\forest@isnum@finish
+% \end{macrocode}
+% Expand in advance, like pgfmath does.
+% \begin{macrocode}
+ \edef\forest@isnum@temp{#1}%
+% \end{macrocode}
+% Add two end-of-value markers. The first one might be eaten by count assignment: that's why there
+% are two and they expand to a space.
+% \begin{macrocode}
+ \expandafter\forest@isnum@a\forest@isnum@temp\forest@eon\forest@eon\forest@END
+ \ifforest@isnum
+ \expandafter\@firstoftwo
+ \else
+ \expandafter\@secondoftwo
+ \fi
+}
+\def\forest@isnum@a{\futurelet\forest@isnum@token\forest@isnum@b}
+% \end{macrocode}
+% Test for three special characters: |-|, |+|, and space.
+% \begin{macrocode}
+\def\forest@isnum@minustoggle{%
+ \ifforest@isnum@minus\forest@isnum@minusfalse\else\forest@isnum@minustrue\fi
+}
+\def\forest@isnum@b{%
+ \let\forest@next\forest@isnum@p
+ \ifx-\forest@isnum@token
+ \forest@isnum@minustoggle
+ \let\forest@next\forest@isnum@c
+ \else
+ \ifx+\forest@isnum@token
+ \let\forest@next\forest@isnum@c
+ \else
+ \expandafter\ifx\space\forest@isnum@token
+ \let\forest@next\forest@isnum@s
+ \fi
+ \fi
+ \fi
+ \forest@next
+}
+% \end{macrocode}
+% Eat |+| and |-|.
+% \begin{macrocode}
+\def\forest@isnum@c#1{\forest@isnum@a}%
+% \end{macrocode}
+% Eat the space!
+% \begin{macrocode}
+\def\forest@isnum@s#1{\forest@isnum@a#1}%
+\newcount\forest@isnum@count
+% \end{macrocode}
+% Check for |0|. Why? If we have one, we know that the initial argument started with a number, so
+% we have a chance that it is a number even if our assignment will yield $0$. If we have no |0| and the assignment yields $0$, we know we don't have a number.
+% \begin{macrocode}
+\def\forest@isnum@p{%
+ \ifx0\forest@isnum@token
+ \let\forest@next\forest@isnum@next
+ \else
+ \let\forest@next\forest@isnum@nz@
+ \fi
+ \forest@isnumtrue
+ \afterassignment\forest@isnum@q\forest@isnum@count\ifforest@isnum@minus-\fi0%
+}
+\def\forest@isnum@q{%
+ \futurelet\forest@isnum@token\forest@next
+}
+\def\forest@isnum@nz@{%
+ \ifnum\forest@isnum@count=0
+ \forest@isnumfalse
+ \fi
+ \forest@isnum@next
+}
+% \end{macrocode}
+% This is the end of testing for an integer. If we have left-over stuff (|#1|), this was not a number.
+% \begin{macrocode}
+\def\forest@isnum@finish#1\forest@END{%
+ \ifx\forest@isnum@token\forest@eon
+ \else
+ \forest@isnumfalse
+ \fi
+}
+% \end{macrocode}
+%
+% Is it a dimension? We support all \TeX's units but |true| units. Also supported are unitless
+% dimensions (i.e.\ decimal numbers), which are interpreted as |pt|s, as in pgfmath.
+%
+% The return value will hide in \TeX-style |\if|-macro |\forest@isdim| and counter |\forest@isdim@dimen|.
+%
+% \begin{macrocode}
+\newcount\forest@isdim@nonintpart
+\newif\ifforest@isdim
+\def\forest@isdim#1{%
+ \forest@isdimfalse
+ \forest@isnum@minusfalse
+ \def\forest@isdim@leadingzeros{}%
+ \forest@isdim@nonintpart=0
+ \def\forest@isdim@unit{pt}%
+ \let\forest@isnum@next\forest@isdim@checkfordot
+ \edef\forest@isnum@temp{#1}%
+% \end{macrocode}
+% 4 end-of-value markers (|forest@eon|): one can be eaten by number (after the dot), two by a non-existing unit.
+% \begin{macrocode}
+ \expandafter\forest@isnum@a\forest@isnum@temp\forest@eon\forest@eon\forest@eon\forest@eon\forest@END
+ \ifforest@isdim
+ \expandafter\@firstoftwo
+ \else
+ \expandafter\@secondoftwo
+ \fi
+}
+\def\forest@isdim@checkfordot{%
+ \ifx.\forest@isnum@token
+ \expandafter\forest@isdim@dot
+ \else
+ \ifx,\forest@isnum@token
+ \expandafter\expandafter\expandafter\forest@isdim@dot
+ \else
+ \expandafter\expandafter\expandafter\forest@isdim@nodot
+ \fi
+ \fi
+}
+\def\forest@isdim@nodot{%
+ \ifforest@isnum
+% \end{macrocode}
+% No number, no dot, so not a dimension.
+% \begin{macrocode}
+ \expandafter\forest@isdim@checkforunit
+ \else
+ \expandafter\forest@isdim@finish@nodim
+ \fi
+}
+\def\forest@isdim@dot#1{% #1=. or ,
+ \futurelet\forest@isnum@token\forest@isdim@collectzero
+}
+\def\forest@isdim@collectzero{%
+ \ifx0\forest@isnum@token
+ \expandafter\forest@isdim@collectzero@
+ \else
+ \expandafter\forest@isdim@getnonintpart
+ \fi
+}
+\def\forest@isdim@collectzero@#1{% #1 = 0
+ \appto\forest@isdim@leadingzeros{0}%
+ \futurelet\forest@isnum@token\forest@isdim@collectzero
+}
+\def\forest@isdim@getnonintpart{%
+ \afterassignment\forest@isdim@checkforunit\forest@isdim@nonintpart0%
+}
+% \end{macrocode}
+% Nothing else should be defined in |\forest@unit@| namespace.
+% \begin{macrocode}
+\def\forest@def@unit#1{\csdef{forest@unit@#1}{#1}}
+\forest@def@unit{em}
+\forest@def@unit{ex}
+\forest@def@unit{pt}
+\forest@def@unit{pc}
+\forest@def@unit{in}
+\forest@def@unit{bp}
+\forest@def@unit{cm}
+\forest@def@unit{mm}
+\forest@def@unit{dd}
+\forest@def@unit{cc}
+\forest@def@unit{sp}
+\def\forest@isdim@checkforunit#1#2{%
+ \lowercase{\edef\forest@isnum@temp{\detokenize{#1#2}}}%
+ \ifcsname forest@unit@\forest@isnum@temp\endcsname
+ \let\forest@isdim@next\forest@isdim@finish@dim
+ \edef\forest@isdim@unit{\csname forest@unit@\forest@isnum@temp\endcsname}%
+ \else
+ \ifx#1\forest@eon
+ \let\forest@isdim@next\forest@isdim@finish@dim
+ \else
+ \let\forest@isdim@next\forest@isdim@finish@nodim
+ \fi
+ \fi
+ \forest@isdim@next
+}
+\def\forest@isdim@finish@dim{%
+ \futurelet\forest@isnum@token\forest@isdim@finish@dim@a
+}
+\def\forest@isdim@finish@dim@a{%
+ \expandafter\ifx\space\forest@isnum@token
+ \expandafter\forest@isdim@finish@dim@b
+ \else
+ \expandafter\forest@isdim@finish@dim@c
+ \fi
+}
+\expandafter\def\expandafter\forest@isdim@finish@dim@b\space{% eat one space
+ \futurelet\forest@isnum@token\forest@isdim@finish@dim@c
+}
+\def\forest@isdim@finish@dim@c#1\forest@END{%
+ \ifx\forest@isnum@token\forest@eon
+ \forest@isdimtrue
+ \forest@isdim@dimen\the\forest@isnum@count.\forest@isdim@leadingzeros\the\forest@isdim@nonintpart\forest@isdim@unit\relax
+ \else
+ \forest@isdimfalse
+ \fi
+}
+\def\forest@isdim@finish@nodim#1\forest@END{%
+ \forest@isdimfalse
+}
+\newdimen\forest@isdim@dimen
+ % \long\def\@firstofthree#1#2#3{#3} % defined by LaTeX
+\long\def\@firstofthree#1#2#3{#1}
+\long\def\@secondofthree#1#2#3{#2}
+\def\forest@isnumdim#1{%
+ \forest@isdim{#1}{%
+ \forest@isnumdim@
+ }{%
+ \@thirdofthree
+ }%
+}
+\def\forest@isnumdim@{%
+ \ifforest@isnum
+ \expandafter\@firstofthree
+ \else
+ \expandafter\@secondofthree
+ \fi
+}
+% \end{macrocode}
+%
+%
+% \subsection{forestmath}
+%
+% We imitate |pgfmath| a lot, but we remember the type of the result so that we can use \TeX's
+% primitives when possible.
+% \begin{macrocode}
+\def\forestmathtype@generic{_} % generic (token list)
+\def\forestmathtype@count{n} % integer
+\def\forestmathtype@dimen{d} % a dimension: <decimal> pt
+\def\forestmathtype@unitless{P} % <decimal> (a unitless dimension) (P because pgfmath returns such numbers)
+\def\forestmathtype@textasc{t} % text (ascending)
+\def\forestmathtype@textdesc{T} % text (descending)
+\def\forestmathtype@none{} % internal (for requests - means whatever)
+\def\forestmathresult{}
+\let\forestmathresulttype\forestmathtype@generic
+% \end{macrocode}
+% |\forest@tryprocess| takes four ``arguments''. The first is a true/false switch telling whether
+% to return the full result array in case we have a |.process| expression. The second is a
+% forestmath expression, delimited by |\forest@spacegen|: if it starts with a |>|, we take it to be
+% a |.process| expression, evaluate it using |\forest@process|, and execute the third argument; it
+% it doesn't, we execute the fourth argument.
+% \begin{macrocode}
+\def\forest@tryprocess#1{%
+ \def\forest@tryprocess@returnarray{#1}%
+ \expandafter\forest@tryprocess@a\romannumeral-`0}
+\def\forest@tryprocess@a{\futurelet\forest@temp@token\forest@tryprocess@b}
+\def\forest@tryprocess@b{%
+ \ifx>\forest@temp@token
+ \expandafter\forest@tryprocess@yes
+ \else
+ \expandafter\forest@tryprocess@no
+ \fi
+}
+\def\forest@spacegen{ \forest@spacegen}
+\def\forest@tryprocess@yes#1#2\forest@spacegen{%
+ \expandafter\forest@process\expandafter{\forest@tryprocess@returnarray}#2\forest@eov
+ \@firstoftwo
+}
+\def\forest@tryprocess@no#1\forest@spacegen{\@secondoftwo}
+% \end{macrocode}
+% Forestmath versions of pgfmath macros. They accept process and pgfmath expressions, as described
+% above. In the case of a pgfmath expression, they use |\forest@isnum| and |\forest@isdim| for to
+% see if they can avoid pgfmath evaluation. (These checks are generally faster than pgfmath's fast
+% track.)
+% \begin{macrocode}
+\def\forestmathsetcount#1#2{%
+ \forest@tryprocess{false}#2\forest@spacegen{%
+ #1=\forest@process@result\relax
+ }{%
+ \forestmathsetcount@#1{#2}%
+ }%
+}
+\def\forestmathsetcount@#1#2{%
+ \forest@isnum{#2}{%
+ #1=\forest@isnum@count
+ }{%
+ \pgfmathsetcount#1{#2}%
+ }%
+}
+\def\forestmathsetlength#1#2{%
+ \forest@tryprocess{false}#2\forest@spacegen{%
+ #1=\forest@process@result\relax
+ }{%
+ \forestmathsetlength@#1{#2}%
+ }%
+}
+\def\forestmathsetlength@#1#2{%
+ \forest@isdim{#2}{%
+ #1=\forest@isdim@dimen
+ }{%
+ \pgfmathsetlength#1{#2}%
+ }%
+}
+\def\forestmathtruncatemacro#1#2{%
+ \forest@tryprocess{false}#2\forest@spacegen{%
+ \forest@temp@count=\forest@process@result\relax
+ \edef#1{\the\forest@temp@count}%
+ }{%
+ \forestmathtruncatemacro@#1{#2}%
+ }%
+}
+\def\forestmathtruncatemacro@#1#2{%
+ \forest@isnum{#2}{%
+ \edef#1{\the\forest@isnum@count}%
+ }{%
+ \pgfmathtruncatemacro#1{#2}%
+ }%
+}
+\def\forestmathsetlengthmacro#1#2{%
+ \forest@tryprocess{false}#2\forest@spacegen{%
+ \forest@temp@dimen=\forest@process@result\relax
+ \edef#1{\the\forest@temp@dimen}%
+ }{%
+ \forestmathsetlengthmacro@#1{#2}%
+ }%
+}
+\def\forestmathsetlengthmacro@#1#2{%
+ \forest@isdim{#2}{%
+ \edef#1{\the\forest@isdim@dimen}%
+ }{%
+ \pgfmathsetlengthmacro#1{#2}%
+ }%
+}
+\def\forestmathsetmacro#1#2{%
+ \forest@tryprocess{false}#2\forest@spacegen{%
+ \let#1\forest@process@result
+ \let\forestmathresulttype\forest@process@result@type
+ }{%
+ \forestmathsetmacro@#1{#2}%
+ \let\forestmathresulttype\forestmathtype@unitless
+ }%
+}
+\def\forestmathsetmacro@#1#2{%
+ \forest@isdim{#2}{%
+ \edef#1{\expandafter\Pgf@geT\the\forest@isdim@dimen}%
+ }{%
+ \pgfmathsetmacro#1{#2}%
+ }%
+}
+\def\forestmathparse#1{%
+ \forest@tryprocess{false}#1\forest@spacegen{%
+ \let\forestmathresult\forest@process@result
+ \let\forestmathresulttype\forest@process@result@type
+ }{%
+ \forestmathparse@{#1}%
+ \let\forestmathresulttype\forestmathtype@unitless
+ }%
+}
+\def\forestmathparse@#1{%
+ \forest@isdim{#1}{%
+ \edef\forestmathresult{\expandafter\Pgf@geT\the\forest@isdim@dimen}%
+ }{%
+ \pgfmathsetmacro\forestmathresult{#1}%
+ }%
+}
+% \end{macrocode}
+% The following macro, which is the only place that sets |\forest@tryprocess|'s |#1| to |true|, is
+% actually not used anywhere. It was meant for an argument processor instruction accepting
+% \meta{forestmath}, but that got separated into P and p. Not much harm is done by keeping it,
+% however, so we do, just in case.
+% \begin{macrocode}
+ %\def\forestmathparse@returnarray#1{% same as above, but returns the result as an array (used only internally)
+ % \forest@tryprocess{true}#1\forest@spacegen{}{%
+ % \forestmathparse@{#1}%
+ % \let\forest@process@result@type\forestmathtype@unitless
+ % \forest@process@result@clear
+ % \forest@process@result@letappend\forestmathresult
+ % }%
+ %}
+% \end{macrocode}
+% Evaluates |#1| to a boolean: if true execute |#2|, otherwise |#3|. |#2| and |#3| are \TeX\ code.
+% Includes a shortcut for some common values.
+% \begin{macrocode}
+\csdef{forest@bh@0}{0}
+\csdef{forest@bh@false}{0}
+\csdef{forest@bh@1}{1}
+\csdef{forest@bh@true}{1}
+\def\forestmath@if#1{%
+ \ifcsdef{forest@bh@\detokenize{#1}}{%
+ \let\forest@next\forestmath@if@fast
+ }{%
+ \let\forest@next\forestmath@if@slow
+ }%
+ \forest@next{#1}%
+ \ifnum\forest@temp=0
+ \expandafter\@secondoftwo
+ \else
+ \expandafter\@firstoftwo
+ \fi
+}
+\def\forestmath@if@fast#1{\letcs\forest@temp{forest@bh@\detokenize{#1}}}
+\def\forestmath@if@slow#1{\forestmathtruncatemacro\forest@temp{#1}}
+% \end{macrocode}
+% These macros expandably convert a num(n)/dim(d)/unitless dim(P) to a num(n)/dim(d)/unitless
+% dim(P).
+% \begin{macrocode}
+\def\forestmath@convert@fromto#1#2#3{%
+ \edef\forestmathresult{\csname forestmath@convert@from@#1@to@#2\endcsname{#3}}}
+\def\forestmath@convert@from#1{\forestmath@convert@fromto{#1}{\forestmathresulttype}}
+\def\forestmath@convert@to{\forestmath@convert@fromto{\forestmathresulttype}}
+\def\forestmath@convert@from@n@to@n#1{#1}
+\def\forestmath@convert@from@n@to@d#1{#1\pgfmath@pt}
+\def\forestmath@convert@from@n@to@P#1{#1}
+\def\forestmath@convert@from@d@to@n#1{%
+ \expandafter\forestmath@convert@uptodot\Pgf@geT#1.\forest@eov}
+\def\forestmath@convert@from@d@to@d#1{#1}
+\def\forestmath@convert@from@d@to@P#1{\Pgf@geT#1}
+\def\forestmath@convert@from@P@to@n#1{%
+ \forestmath@convert@uptodot#1.\forest@eov}
+\def\forestmath@convert@from@P@to@d#1{#1\pgfmath@pt}
+\def\forestmath@convert@from@P@to@P#1{#1}
+\def\forestmath@convert@uptodot#1.#2\forest@eov{#1}
+\def\forestmathzero{\forestmath@convert@from\forestmathtype@count{0}}
+% \end{macrocode}
+% These defer conversion (see aggregates).
+% \begin{macrocode}
+\csdef{forestmath@convert@from@n@to@_}#1{\unexpanded{#1}}
+\csdef{forestmath@convert@from@d@to@_}#1{\unexpanded{#1}}
+\csdef{forestmath@convert@from@P@to@_}#1{\unexpanded{#1}}
+% \end{macrocode}
+% Sets |\pgfmathresulttype| to the type of |#1|.
+% \begin{macrocode}
+\def\forestmathsettypefrom#1{%
+ \forest@isnumdim{%
+ \let\forestmathresulttype\forestmathtype@count
+ }{%
+ \let\forestmathresulttype\forestmathtype@dimen
+ }{%
+ \let\forestmathresulttype\forestmathtype@unitless
+ }%
+}
+% \end{macrocode}
+% The following functions expect numbers or (bare or specified) dimensions as their parameters. The
+% version ending in |@| should get the argument type as its first argument; the version without |@|
+% uses |\forestmathresulttype|. The result type doesn't need to be changed, obviously.
+% \begin{macrocode}
+\def\forestmathadd#1#2{\edef\forestmathresult{%
+ \csname forestmathadd@\forestmathresulttype\endcsname{#1}{#2}}}
+\def\forestmathadd@#1#2#3{\edef\forestmathresult{%
+ \csname forestmathadd@#1\endcsname{#2}{#3}}}
+\def\forestmathadd@n#1#2{\the\numexpr#1+#2\relax}
+\def\forestmathadd@d#1#2{\the\dimexpr#1+#2\relax}
+\def\forestmathadd@P#1#2{\expandafter\Pgf@geT\the\dimexpr#1pt+#2pt\relax}
+\def\forestmathmultiply#1#2{%
+ \csname forestmathmultiply@\forestmathresulttype\endcsname{#1}{#2}}
+\def\forestmathmultiply@#1#2#3{%
+ \csname forestmathmultiply@#1\endcsname{#2}{#3}}
+\def\forestmathmultiply@n#1#2{\edef\forestmathresult{%
+ \the\numexpr#1*#2\relax}}
+\def\forestmathmultiply@d#1#2{%
+ \edef\forestmath@marshal{\forestmathmultiply@d@{#1}{#2}}\forestmath@marshal
+}
+\def\forestmathmultiply@d@#1#2{%
+ \edef\forestmath@marshal{%
+ \noexpand\pgfmathmultiply@{\Pgf@geT#1}{\Pgf@geT#2}%
+ }\forestmath@marshal
+ \edef\forestmathresult{\pgfmathresult\pgfmath@pt}%
+}
+\def\forestmathmultiply@P#1#2{%
+ \pgfmathmultiply@{#1}{#2}%
+ \let\forestmathresult\pgfmathresult
+}
+% \end{macrocode}
+% The return type of |forestmathdivide| is the type of the dividend. So, |n| and |d| type can only
+% be divided by integers; as |\numexpr| and |\dimexpr| are used, the result is rounded.
+% \begin{macrocode}
+\def\forestmathdivide#1#2{%
+ \csname forestmathdivide@\forestmathresulttype\endcsname{#1}{#2}}
+\def\forestmathdivide@#1#2#3{%
+ \csname forestmathdivide@#1\endcsname{#2}{#3}}
+\def\forestmathdivide@n#1#2{\edef\forestmathresult{%
+ \the\numexpr#1/#2\relax}}
+\def\forestmathdivide@d#1#2{\edef\forestmathresult{%
+ \the\dimexpr#1/#2\relax}}
+\def\forestmathdivide@P#1#2{%
+ \edef\forest@marshal{%
+ \noexpand\pgfmathdivide{+#1}{+#2}%
+ }\forest@marshal
+ \let\forestmathresult\pgfmathresult
+}
+% \end{macrocode}
+% Booleans.
+% \begin{macrocode}
+\def\forestmathtrue{%
+ \def\forestmathresult{1}%
+ \let\forestmathresulttype\forestmathtype@count}
+\def\forestmathfalse{%
+ \def\forestmathresult{0}%
+ \let\forestmathresulttype\forestmathtype@count}
+% \end{macrocode}
+% Comparisons. |\pdfstrcmp| is used to compare text (types |t| and |T|); note that it expands its
+% arguments. |<| and |>| comparison of generic type obviously makes no sense; |=| comparison is
+% done using |\ifx|: this is also the reason why these macros are not fully expandable, as we need
+% to |\def| the arguments to |\ifx|.
+%
+% Low level |<|.
+% \begin{macrocode}
+\def\forestmath@if@lt@n#1#2{\ifnum#1<#2\relax
+ \expandafter\@firstoftwo\else\expandafter\@secondoftwo\fi}
+\def\forestmath@if@lt@d#1#2{\ifdim#1<#2\relax
+ \expandafter\@firstoftwo\else\expandafter\@secondoftwo\fi}
+\def\forestmath@if@lt@P#1#2{\ifdim#1pt<#2pt
+ \expandafter\@firstoftwo\else\expandafter\@secondoftwo\fi}
+\def\forestmath@if@lt@t#1#2{\ifnum\pdfstrcmp{#1}{#2}<0
+ \expandafter\@firstoftwo\else\expandafter\@secondoftwo\fi}
+\def\forestmath@if@lt@T#1#2{\ifnum\pdfstrcmp{#1}{#2}>0
+ \expandafter\@firstoftwo\else\expandafter\@secondoftwo\fi}
+\def\forest@cmp@error#1#2{\PackageError{forest}{Comparison
+ ("<" or ">") of generic type arguments "#1" and "#2"
+ makes no sense}{Use one of argument processor instructions
+ "n", "d", "P" or "t" to change the type. Use package option
+ "debug=process" to see what's happening here.}}
+\cslet{forestmath@if@lt@_}\forest@cmp@error
+% \end{macrocode}
+% Low level |=|.
+% \begin{macrocode}
+\def\forestmath@if@eq@n#1#2{\ifnum#1=#2\relax
+ \expandafter\@firstoftwo\else\expandafter\@secondoftwo\fi}
+\def\forestmath@if@eq@d#1#2{\ifdim#1=#2\relax
+ \expandafter\@firstoftwo\else\expandafter\@secondoftwo\fi}
+\def\forestmath@if@eq@P#1#2{\ifdim#1pt=#2pt
+ \expandafter\@firstoftwo\else\expandafter\@secondoftwo\fi}
+\def\forestmath@if@eq@t#1#2{\ifnum\pdfstrcmp{#1}{#2}=0
+ \expandafter\@firstoftwo\else\expandafter\@secondoftwo\fi}
+\let\forestmath@if@eq@T\forestmath@if@eq@t
+\csdef{forestmath@if@eq@_}#1#2{%
+ \def\forestmath@tempa{#1}%
+ \def\forestmath@tempb{#2}%
+ \ifx\forestmath@tempa\forestmath@tempb
+ \expandafter\@firstoftwo\else\expandafter\@secondoftwo\fi}
+% \end{macrocode}
+% High level |<|, |>| and |=|.
+% \begin{macrocode}
+\def\forestmathlt#1#2{%
+ \csname forestmath@if@lt@\forestmathresulttype\endcsname{#1}{#2}%
+ \forestmathtrue
+ \forestmathfalse}
+\def\forestmathlt@#1#2#3{%
+ \csname forestmath@if@lt@#1\endcsname{#2}{#3}%
+ \forestmathtrue
+ \forestmathfalse}
+\def\forestmathgt#1#2{%
+ \csname forestmath@if@lt@\forestmathresulttype\endcsname{#2}{#1}%
+ \forestmathtrue
+ \forestmathfalse}
+\def\forestmathgt@#1#2#3{%
+ \csname forestmath@if@lt@#1\endcsname{#3}{#2}%
+ \forestmathtrue
+ \forestmathfalse}
+\def\forestmatheq#1#2{%
+ \csname forestmath@if@eq@\forestmathresulttype\endcsname{#1}{#2}%
+ \forestmathtrue
+ \forestmathfalse}
+\def\forestmatheq@#1#2#3{%
+ \csname forestmath@if@eq@#1\endcsname{#2}{#3}%
+ \forestmathtrue
+ \forestmathfalse}
+% \end{macrocode}
+% Min and max. The complication here is that for numeric/dimension types, we want the empty value to
+% signal ``no argument'', i.e.\ the other argument should be the result; this is used in
+% aggregates. (For text types, the empty value is obviously the lesser one.) The arguments are expanded.
+% \begin{macrocode}
+\def\forestmathmin{\forestmath@minmax{min}{\forestmathresulttype}}
+\def\forestmathmax{\forestmath@minmax{max}{\forestmathresulttype}}
+\def\forestmathmin@{\forestmath@minmax{min}}
+\def\forestmathmax@{\forestmath@minmax{max}}
+\def\forestmath@minmax#1#2#3#4{% #1=min/max, #2=type, #3,#4=args
+ \edef\forestmath@tempa{#3}%
+ \edef\forestmath@tempb{#4}%
+ \if\relax\detokenize\expandafter{\forestmath@tempa}\relax
+ \forestmath@minmax@one{#1}{#2}\forestmath@tempb
+ \else
+ \if\relax\detokenize\expandafter{\forestmath@tempb}\relax
+ \forestmath@minmax@one{#1}{#2}\forestmath@tempa
+ \else
+ \csname forestmath@#1\endcsname{#2}%
+ \fi
+ \fi
+}
+\def\forestmath@minmax@one#1#2#3{% #1=min/max, #2=type, #3 = the (possibly) non-empty arg
+ \ifcsname forestmath@#1@one@#2\endcsname
+ \csname forestmath@#1@one@#2\endcsname#3%
+ \else
+ \let\forestmathresult#3%
+ \fi
+}
+\def\forestmath@min@one@t#1{\let\forestmathresult\forest@empty}
+\def\forestmath@max@one@t#1{\let\forestmathresult#1}
+\def\forestmath@min@one@T#1{\let\forestmathresult#1}
+\def\forestmath@max@one@T#1{\let\forestmathresult\forest@empty}
+
+\def\forestmath@min#1{% #1 = type
+ \csname forestmath@if@lt@#1\endcsname\forestmath@tempa\forestmath@tempb
+ {\let\forestmathresult\forestmath@tempa}%
+ {\let\forestmathresult\forestmath@tempb}%
+}
+\def\forestmath@max#1{% #1 = type
+ \csname forestmath@if@lt@#1\endcsname\forestmath@tempa\forestmath@tempb
+ {\let\forestmathresult\forestmath@tempb}%
+ {\let\forestmathresult\forestmath@tempa}%
+}
+% \end{macrocode}
+%
+% \subsection{Sorting}
+%
+% Macro |\forest@sort| is the user interface to sorting.
+%
+% The user should prepare the data in an arbitrarily encoded
+% array,\footnote{In forest, arrays are encoded as families of
+% macros. An array-macro name consists of the (optional, but
+% recommended) prefix, the index, and the (optional) suffix (e.g.\
+% \texttt{$\backslash$forest@42x}). Prefix establishes the ``namespace'',
+% while using more than one suffix simulates an array of named tuples.
+% The length of the array is stored in macro \texttt{$\backslash$<prefix>n}.}
+% and provide the sorting macro (given in |#1|) and the array let
+% macro (given in |#2|): these are the only ways in which sorting
+% algorithms access the data. Both user-given macros should take two
+% parameters, which expand to array indices. The comparison macro
+% should compare the given array items and call |\forest@sort@cmp@gt|,
+% |\forest@sort@cmp@lt| or |\forest@sort@cmp@eq| to signal that the
+% first item is greater than, less than, or equal to the second item.
+% The let macro should ``copy'' the contents of the second item onto
+% the first item.
+%
+% The sorting direction is be given in |#3|: it can one of
+% |\forest@sort@ascending| and |\forest@sort@descending|. |#4| and
+% |#5| must expand to the lower and upper (both inclusive) indices of
+% the array to be sorted.
+%
+% |\forest@sort| is just a wrapper for the central sorting macro
+% |\forest@@sort|, storing the comparison macro, the array let macro
+% and the direction. The central sorting macro and the
+% algorithm-specific macros take only two arguments: the array bounds.
+% \begin{macrocode}
+\def\forest@sort#1#2#3#4#5{%
+ \let\forest@sort@cmp#1\relax
+ \let\forest@sort@let#2\relax
+ \let\forest@sort@direction#3\relax
+ \forest@@sort{#4}{#5}%
+}
+% \end{macrocode}
+% The central sorting macro. Here it is decided which sorting
+% algorithm will be used: for arrays at least
+% |\forest@quicksort@minarraylength| long, quicksort is used;
+% otherwise, insertion sort.
+% \begin{macrocode}
+\def\forest@quicksort@minarraylength{10000}
+\def\forest@@sort#1#2{%
+ \ifnum#1<#2\relax\@escapeif{%
+ \forest@sort@m=#2
+ \advance\forest@sort@m -#1
+ \ifnum\forest@sort@m>\forest@quicksort@minarraylength\relax\@escapeif{%
+ \forest@quicksort{#1}{#2}%
+ }\else\@escapeif{%
+ \forest@insertionsort{#1}{#2}%
+ }\fi
+ }\fi
+}
+% \end{macrocode}
+% Various counters and macros needed by the sorting algorithms.
+% \begin{macrocode}
+\newcount\forest@sort@m\newcount\forest@sort@k\newcount\forest@sort@p
+\def\forest@sort@ascending{>}
+\def\forest@sort@descending{<}
+\def\forest@sort@cmp{%
+ \PackageError{sort}{You must define forest@sort@cmp function before calling
+ sort}{The macro must take two arguments, indices of the array
+ elements to be compared, and return '=' if the elements are equal
+ and '>'/'<' if the first is greater /less than the secong element.}%
+}
+\def\forest@sort@cmp@gt{\def\forest@sort@cmp@result{>}}
+\def\forest@sort@cmp@lt{\def\forest@sort@cmp@result{<}}
+\def\forest@sort@cmp@eq{\def\forest@sort@cmp@result{=}}
+\def\forest@sort@let{%
+ \PackageError{sort}{You must define forest@sort@let function before calling
+ sort}{The macro must take two arguments, indices of the array:
+ element 2 must be copied onto element 1.}%
+}
+% \end{macrocode}
+% Quick sort macro (adapted from
+% \href{http://www.ctan.org/pkg/laansort}{laansort}).
+% \begin{macrocode}
+\newloop\forest@sort@loop
+\newloop\forest@sort@loopA
+\def\forest@quicksort#1#2{%
+% \end{macrocode}
+% Compute the index of the middle element (|\forest@sort@m|).
+% \begin{macrocode}
+ \forest@sort@m=#2
+ \advance\forest@sort@m -#1
+ \ifodd\forest@sort@m\relax\advance\forest@sort@m1 \fi
+ \divide\forest@sort@m 2
+ \advance\forest@sort@m #1
+% \end{macrocode}
+% The pivot element is the median of the first, the middle and the
+% last element.
+% \begin{macrocode}
+ \forest@sort@cmp{#1}{#2}%
+ \if\forest@sort@cmp@result=%
+ \forest@sort@p=#1
+ \else
+ \if\forest@sort@cmp@result>%
+ \forest@sort@p=#1\relax
+ \else
+ \forest@sort@p=#2\relax
+ \fi
+ \forest@sort@cmp{\the\forest@sort@p}{\the\forest@sort@m}%
+ \if\forest@sort@cmp@result<%
+ \else
+ \forest@sort@p=\the\forest@sort@m
+ \fi
+ \fi
+% \end{macrocode}
+% Exchange the pivot and the first element.
+% \begin{macrocode}
+ \forest@sort@xch{#1}{\the\forest@sort@p}%
+% \end{macrocode}
+% Counter |\forest@sort@m| will hold the final location of the pivot
+% element.
+% \begin{macrocode}
+ \forest@sort@m=#1\relax
+% \end{macrocode}
+% Loop through the list.
+% \begin{macrocode}
+ \forest@sort@k=#1\relax
+ \forest@sort@loop
+ \ifnum\forest@sort@k<#2\relax
+ \advance\forest@sort@k 1
+% \end{macrocode}
+% Compare the pivot and the current element.
+% \begin{macrocode}
+ \forest@sort@cmp{#1}{\the\forest@sort@k}%
+% \end{macrocode}
+% If the current element is smaller (ascending) or greater
+% (descending) than the pivot element, move it into the first part of
+% the list, and adjust the final location of the pivot.
+% \begin{macrocode}
+ \ifx\forest@sort@direction\forest@sort@cmp@result
+ \advance\forest@sort@m 1
+ \forest@sort@xch{\the\forest@sort@m}{\the\forest@sort@k}
+ \fi
+ \forest@sort@repeat
+% \end{macrocode}
+% Move the pivot element into its final position.
+% \begin{macrocode}
+ \forest@sort@xch{#1}{\the\forest@sort@m}%
+% \end{macrocode}
+% Recursively call sort on the two parts of the list: elements before
+% the pivot are smaller (ascending order) / greater (descending order)
+% than the pivot; elements after the pivot are greater (ascending
+% order) / smaller (descending order) than the pivot.
+% \begin{macrocode}
+ \forest@sort@k=\forest@sort@m
+ \advance\forest@sort@k -1
+ \advance\forest@sort@m 1
+ \edef\forest@sort@marshal{%
+ \noexpand\forest@@sort{#1}{\the\forest@sort@k}%
+ \noexpand\forest@@sort{\the\forest@sort@m}{#2}%
+ }%
+ \forest@sort@marshal
+}
+% We defines the item-exchange macro in terms of the (user-provided)
+% array let macro.
+% \begin{macrocode}
+\def\forest@sort@aux{aux}
+\def\forest@sort@xch#1#2{%
+ \forest@sort@let{\forest@sort@aux}{#1}%
+ \forest@sort@let{#1}{#2}%
+ \forest@sort@let{#2}{\forest@sort@aux}%
+}
+% \end{macrocode}
+% Insertion sort.
+% \begin{macrocode}
+\def\forest@insertionsort#1#2{%
+ \forest@sort@m=#1
+ \edef\forest@insertionsort@low{#1}%
+ \forest@sort@loopA
+ \ifnum\forest@sort@m<#2
+ \advance\forest@sort@m 1
+ \forest@insertionsort@Qbody
+ \forest@sort@repeatA
+}
+\newif\ifforest@insertionsort@loop
+\def\forest@insertionsort@Qbody{%
+ \forest@sort@let{\forest@sort@aux}{\the\forest@sort@m}%
+ \forest@sort@k\forest@sort@m
+ \advance\forest@sort@k -1
+ \forest@insertionsort@looptrue
+ \forest@sort@loop
+ \ifforest@insertionsort@loop
+ \forest@insertionsort@qbody
+ \forest@sort@repeat
+ \advance\forest@sort@k 1
+ \forest@sort@let{\the\forest@sort@k}{\forest@sort@aux}%
+}
+\def\forest@insertionsort@qbody{%
+ \forest@sort@cmp{\the\forest@sort@k}{\forest@sort@aux}%
+ \ifx\forest@sort@direction\forest@sort@cmp@result\relax
+ \forest@sort@p=\forest@sort@k
+ \advance\forest@sort@p 1
+ \forest@sort@let{\the\forest@sort@p}{\the\forest@sort@k}%
+ \advance\forest@sort@k -1
+ \ifnum\forest@sort@k<\forest@insertionsort@low\relax
+ \forest@insertionsort@loopfalse
+ \fi
+ \else
+ \forest@insertionsort@loopfalse
+ \fi
+}
+% \end{macrocode}
+%
+% Below, several helpers for writing comparison macros are
+% provided. They take take two (pairs of) control sequence names and
+% compare their contents.
+%
+% Compare numbers.
+% \begin{macrocode}
+\def\forest@sort@cmpnumcs#1#2{%
+ \ifnum\csname#1\endcsname>\csname#2\endcsname\relax
+ \forest@sort@cmp@gt
+ \else
+ \ifnum\csname#1\endcsname<\csname#2\endcsname\relax
+ \forest@sort@cmp@lt
+ \else
+ \forest@sort@cmp@eq
+ \fi
+ \fi
+}
+% \end{macrocode}
+% Compare dimensions.
+% \begin{macrocode}
+\def\forest@sort@cmpdimcs#1#2{%
+ \ifdim\csname#1\endcsname>\csname#2\endcsname\relax
+ \forest@sort@cmp@gt
+ \else
+ \ifdim\csname#1\endcsname<\csname#2\endcsname\relax
+ \forest@sort@cmp@lt
+ \else
+ \forest@sort@cmp@eq
+ \fi
+ \fi
+}
+% \end{macrocode}
+% Compare points (pairs of dimension) |(#1,#2)| and |(#3,#4)|.
+% \begin{macrocode}
+\def\forest@sort@cmptwodimcs#1#2#3#4{%
+ \ifdim\csname#1\endcsname>\csname#3\endcsname\relax
+ \forest@sort@cmp@gt
+ \else
+ \ifdim\csname#1\endcsname<\csname#3\endcsname\relax
+ \forest@sort@cmp@lt
+ \else
+ \ifdim\csname#2\endcsname>\csname#4\endcsname\relax
+ \forest@sort@cmp@gt
+ \else
+ \ifdim\csname#2\endcsname<\csname#4\endcsname\relax
+ \forest@sort@cmp@lt
+ \else
+ \forest@sort@cmp@eq
+ \fi
+ \fi
+ \fi
+ \fi
+}
+% \end{macrocode}
+%
+% The following macro reverses an array. The arguments: |#1| is
+% the array let macro; |#2| is the start index (inclusive), and
+% |#3| is the end index (exclusive).
+% \begin{macrocode}
+\def\forest@reversearray#1#2#3{%
+ \let\forest@sort@let#1%
+ \c@pgf@countc=#2
+ \c@pgf@countd=#3
+ \advance\c@pgf@countd -1
+ \safeloop
+ \ifnum\c@pgf@countc<\c@pgf@countd\relax
+ \forest@sort@xch{\the\c@pgf@countc}{\the\c@pgf@countd}%
+ \advance\c@pgf@countc 1
+ \advance\c@pgf@countd -1
+ \saferepeat
+}
+% \end{macrocode}
+%
+% \section{The bracket representation parser}
+% \label{imp:bracket}
+%
+% \subsection{The user interface macros}
+%
+% Settings.
+% \begin{macrocode}
+\def\bracketset#1{\pgfqkeys{/bracket}{#1}}%
+\bracketset{%
+ /bracket/.is family,
+ /handlers/.let/.style={\pgfkeyscurrentpath/.code={\let#1##1}},
+ opening bracket/.let=\bracket@openingBracket,
+ closing bracket/.let=\bracket@closingBracket,
+ action character/.let=\bracket@actionCharacter,
+ opening bracket=[,
+ closing bracket=],
+ action character,
+ new node/.code n args={3}{% #1=preamble, #2=node spec, #3=cs receiving the id
+ \forest@node@new#3%
+ \forestOeset{#3}{given options}{\forest@contentto=\unexpanded{#2}}%
+ \ifblank{#1}{}{%
+ \forestrset{preamble}{#1}%
+ }%
+ },
+ set afterthought/.code 2 args={% #1=node id, #2=afterthought
+ \ifblank{#2}{}{\forestOappto{#1}{given options}{,afterthought={#2}}}%
+ }
+}
+% \end{macrocode}
+%
+% |\bracketParse| is the macro that should be called to parse a
+% balanced bracket representation. It takes two parameters: |#1| is the code that will be run
+% after parsing the bracket; |#2| is a control sequence that will receive the id of the root of the
+% created tree structure. (The bracket representation should follow (after optional spaces), but is
+% is not a formal parameter of the macro.)
+% \begin{macrocode}
+\newtoks\bracket@content
+\newtoks\bracket@afterthought
+\def\bracketParse#1#2={%
+ \def\bracketEndParsingHook{#1}%
+ \def\bracket@saveRootNodeTo{#2}%
+% \end{macrocode}
+% Content and afterthought will be appended to these macros. (The |\bracket@afterthought| toks register is
+% abused for storing the preamble as well --- that's ok, the preamble comes before any afterhoughts.)
+% \begin{macrocode}
+ \bracket@content={}%
+ \bracket@afterthought={}%
+% \end{macrocode}
+% The parser can be in three states: in content (0), in afterthought
+% (1), or starting (2). While in the content/afterthought state, the
+% parser appends all non-control tokens to the content/afterthought macro.
+% \begin{macrocode}
+ \let\bracket@state\bracket@state@starting
+ \bracket@ignorespacestrue
+% \end{macrocode}
+% By default, don't expand anything.
+% \begin{macrocode}
+ \bracket@expandtokensfalse
+% \end{macrocode}
+% We initialize several control sequences that are used to store some
+% nodes while parsing.
+% \begin{macrocode}
+ \def\bracket@parentNode{0}%
+ \def\bracket@rootNode{0}%
+ \def\bracket@newNode{0}%
+ \def\bracket@afterthoughtNode{0}%
+% \end{macrocode}
+% Finally, we start the parser.
+% \begin{macrocode}
+ \bracket@Parse
+}
+% \end{macrocode}
+% The other macro that an end user (actually a power user) can use, is
+% actually just a synonym for |\bracket@Parse|. It should be used to
+% resume parsing when the action code has finished its work.
+% \begin{macrocode}
+\def\bracketResume{\bracket@Parse}%
+% \end{macrocode}
+%
+% \subsection{Parsing}
+%
+% We first check if the next token is a space. Spaces need special
+% treatment because they are eaten by both the |\romannumeral| trick
+% and \TeX s (undelimited) argument parsing algorithm. If a space is
+% found, remember that, eat it up, and restart the parsing.
+% \begin{macrocode}
+\def\bracket@Parse{%
+ \futurelet\bracket@next@token\bracket@Parse@checkForSpace
+}
+\def\bracket@Parse@checkForSpace{%
+ \expandafter\ifx\space\bracket@next@token\@escapeif{%
+ \ifbracket@ignorespaces\else
+ \bracket@haveSpacetrue
+ \fi
+ \expandafter\bracket@Parse\romannumeral-`0%
+ }\else\@escapeif{%
+ \bracket@Parse@maybeexpand
+ }\fi
+}
+% \end{macrocode}
+%
+% We either fully expand the next token (using a popular \TeX nical
+% trick \dots) or don't expand it at all, depending on the state of
+% |\ifbracket@expandtokens|.
+% \begin{macrocode}
+\newif\ifbracket@expandtokens
+\def\bracket@Parse@maybeexpand{%
+ \ifbracket@expandtokens\@escapeif{%
+ \expandafter\bracket@Parse@peekAhead\romannumeral-`0%
+ }\else\@escapeif{%
+ \bracket@Parse@peekAhead
+ }\fi
+}
+% \end{macrocode}
+% We then look ahead to see what's coming.
+% \begin{macrocode}
+\def\bracket@Parse@peekAhead{%
+ \futurelet\bracket@next@token\bracket@Parse@checkForTeXGroup
+}
+% \end{macrocode}
+% If the next token is a begin-group token, we append the whole group to
+% the content or afterthought macro, depending on the state.
+% \begin{macrocode}
+\def\bracket@Parse@checkForTeXGroup{%
+ \ifx\bracket@next@token\bgroup%
+ \@escapeif{\bracket@Parse@appendGroup}%
+ \else
+ \@escapeif{\bracket@Parse@token}%
+ \fi
+}
+% \end{macrocode}
+% This is easy: if a control token is found, run the appropriate
+% macro; otherwise, append the token to the content or afterthought
+% macro, depending on the state.
+% \begin{macrocode}
+\long\def\bracket@Parse@token#1{%
+ \ifx#1\bracket@openingBracket
+ \@escapeif{\bracket@Parse@openingBracketFound}%
+ \else
+ \@escapeif{%
+ \ifx#1\bracket@closingBracket
+ \@escapeif{\bracket@Parse@closingBracketFound}%
+ \else
+ \@escapeif{%
+ \ifx#1\bracket@actionCharacter
+ \@escapeif{\futurelet\bracket@next@token\bracket@Parse@actionCharacterFound}%
+ \else
+ \@escapeif{\bracket@Parse@appendToken#1}%
+ \fi
+ }%
+ \fi
+ }%
+ \fi
+}
+% \end{macrocode}
+% Append the token or group to the content or afterthought macro. If a
+% space was found previously, append it as well.
+% \begin{macrocode}
+\newif\ifbracket@haveSpace
+\newif\ifbracket@ignorespaces
+\def\bracket@Parse@appendSpace{%
+ \ifbracket@haveSpace
+ \ifcase\bracket@state\relax
+ \eapptotoks\bracket@content\space
+ \or
+ \eapptotoks\bracket@afterthought\space
+ \or
+ \eapptotoks\bracket@afterthought\space
+ \fi
+ \bracket@haveSpacefalse
+ \fi
+}
+\long\def\bracket@Parse@appendToken#1{%
+ \bracket@Parse@appendSpace
+ \ifcase\bracket@state\relax
+ \lapptotoks\bracket@content{#1}%
+ \or
+ \lapptotoks\bracket@afterthought{#1}%
+ \or
+ \lapptotoks\bracket@afterthought{#1}%
+ \fi
+ \bracket@ignorespacesfalse
+ \bracket@Parse
+}
+\def\bracket@Parse@appendGroup#1{%
+ \bracket@Parse@appendSpace
+ \ifcase\bracket@state\relax
+ \apptotoks\bracket@content{{#1}}%
+ \or
+ \apptotoks\bracket@afterthought{{#1}}%
+ \or
+ \apptotoks\bracket@afterthought{{#1}}%
+ \fi
+ \bracket@ignorespacesfalse
+ \bracket@Parse
+}
+% \end{macrocode}
+% Declare states.
+% \begin{macrocode}
+\def\bracket@state@inContent{0}
+\def\bracket@state@inAfterthought{1}
+\def\bracket@state@starting{2}
+% \end{macrocode}
+%
+% Welcome to the jungle. In the following two macros, new nodes are
+% created, content and afterthought are sent to them, parents and
+% states are changed\dots\@ Altogether, we distinguish six cases, as
+% shown below: in the schemas, we have just crossed the symbol after
+% the dots. (In all cases, we reset the |\if| for spaces.)
+% \begin{macrocode}
+\def\bracket@Parse@openingBracketFound{%
+ \bracket@haveSpacefalse
+ \ifcase\bracket@state\relax% in content [ ... [
+% \end{macrocode}
+% |[...[|: we have just finished gathering the content and are about
+% to begin gathering the content of another node. We create a
+% new node (and put the content (\dots) into
+% it). Then, if there is a parent node, we append the new node to the
+% list of its children. Next, since we have just crossed an opening
+% bracket, we declare the newly created node to be the parent of the
+% coming node. The state does not change. Finally, we continue parsing.
+% \begin{macrocode}
+ \@escapeif{%
+ \bracket@createNode
+ \ifnum\bracket@parentNode=0 \else
+ \forest@node@Append{\bracket@parentNode}{\bracket@newNode}%
+ \fi
+ \let\bracket@parentNode\bracket@newNode
+ \bracket@Parse
+ }%
+ \or % in afterthought ] ... [
+% \end{macrocode}
+% |]...[|: we have just finished gathering the afterthought and are
+% about to begin gathering the content of another node. We add the
+% afterthought (\dots) to the ``afterthought node'' and change into the
+% content state. The parent does not change. Finally, we continue
+% parsing.
+% \begin{macrocode}
+ \@escapeif{%
+ \bracket@addAfterthought
+ \let\bracket@state\bracket@state@inContent
+ \bracket@Parse
+ }%
+ \else % starting
+% \end{macrocode}
+% |{start}...[|: we have just started. Nothing to do yet (we couldn't
+% have collected any content yet), just get into the content state and
+% continue parsing.
+% \begin{macrocode}
+ \@escapeif{%
+ \let\bracket@state\bracket@state@inContent
+ \bracket@Parse
+ }%
+ \fi
+}
+\def\bracket@Parse@closingBracketFound{%
+ \bracket@haveSpacefalse
+ \ifcase\bracket@state\relax % in content [ ... ]
+% \end{macrocode}
+% |[...]|: we have just finished gathering the content of a node and
+% are about to begin gathering its afterthought. We create a new node
+% (and put the content (\dots) into it). If there is no parent node,
+% we're done with parsing. Otherwise, we set the newly created
+% node to be the ``afterthought node'', i.e.\ the node that will
+% receive the next afterthought, change into the afterthought mode,
+% and continue parsing.
+% \begin{macrocode}
+ \@escapeif{%
+ \bracket@createNode
+ \ifnum\bracket@parentNode=0
+ \@escapeif\bracketEndParsingHook
+ \else
+ \@escapeif{%
+ \let\bracket@afterthoughtNode\bracket@newNode
+ \let\bracket@state\bracket@state@inAfterthought
+ \forest@node@Append{\bracket@parentNode}{\bracket@newNode}%
+ \bracket@Parse
+ }%
+ \fi
+ }%
+ \or % in afterthought ] ... ]
+% \end{macrocode}
+% |]...]|: we have finished gathering an afterthought of some node and
+% will begin gathering the afterthought of its parent. We first add
+% the afterthought to the afterthought node and set the current parent
+% to be the next afterthought node. We change the parent to the
+% current parent's parent and check if that node is null. If it is,
+% we're done with parsing (ignore the trailing spaces), otherwise we continue.
+% \begin{macrocode}
+ \@escapeif{%
+ \bracket@addAfterthought
+ \let\bracket@afterthoughtNode\bracket@parentNode
+ \edef\bracket@parentNode{\forestOve{\bracket@parentNode}{@parent}}%
+ \ifnum\bracket@parentNode=0
+ \expandafter\bracketEndParsingHook
+ \else
+ \expandafter\bracket@Parse
+ \fi
+ }%
+ \else % starting
+% \end{macrocode}
+% |{start}...]|: something's obviously wrong with the input here\dots
+% \begin{macrocode}
+ \PackageError{forest}{You're attempting to start a bracket representation
+ with a closing bracket}{}%
+ \fi
+}
+% \end{macrocode}
+%
+% The action character code. What happens is determined by the next token.
+% \begin{macrocode}
+\def\bracket@Parse@actionCharacterFound{%
+% \end{macrocode}
+% If a braced expression follows, its contents will be fully expanded.
+% \begin{macrocode}
+ \ifx\bracket@next@token\bgroup\@escapeif{%
+ \bracket@Parse@action@expandgroup
+ }\else\@escapeif{%
+ \bracket@Parse@action@notagroup
+ }\fi
+}
+\def\bracket@Parse@action@expandgroup#1{%
+ \edef\bracket@Parse@action@expandgroup@macro{#1}%
+ \expandafter\bracket@Parse\bracket@Parse@action@expandgroup@macro
+}
+\let\bracket@action@fullyexpandCharacter+
+\let\bracket@action@dontexpandCharacter-
+\let\bracket@action@executeCharacter!
+\def\bracket@Parse@action@notagroup#1{%
+% \end{macrocode}
+% If + follows, tokens will be fully expanded from this point on.
+% \begin{macrocode}
+ \ifx#1\bracket@action@fullyexpandCharacter\@escapeif{%
+ \bracket@expandtokenstrue\bracket@Parse
+ }\else\@escapeif{%
+% \end{macrocode}
+% If - follows, tokens will not be expanded from this point on. (This is the default behaviour.)
+% \begin{macrocode}
+ \ifx#1\bracket@action@dontexpandCharacter\@escapeif{%
+ \bracket@expandtokensfalse\bracket@Parse
+ }\else\@escapeif{%
+% \end{macrocode}
+% Inhibit expansion of the next token.
+% \begin{macrocode}
+ \ifx#10\@escapeif{%
+ \bracket@Parse@appendToken
+ }\else\@escapeif{%
+% \end{macrocode}
+% If another action characted follows, we yield the control. The user is
+% expected to resume the parser manually, using |\bracketResume|.
+% \begin{macrocode}
+ \ifx#1\bracket@actionCharacter
+ \else\@escapeif{%
+% \end{macrocode}
+% Anything else will be expanded once.
+% \begin{macrocode}
+ \expandafter\bracket@Parse#1%
+ }\fi
+ }\fi
+ }\fi
+ }\fi
+}
+% \end{macrocode}
+%
+% \subsection{The tree-structure interface}
+%
+% This macro creates a new node and sets its content (and preamble, if it's a root node). Bracket
+% user must define a 3-arg key |/bracket/new node=|\meta{preamble}\meta{node
+% specification}\meta{node cs}. User's key must define \meta{node cs} to be a macro holding the
+% node's id.
+% \begin{macrocode}
+\def\bracket@createNode{%
+ \ifnum\bracket@rootNode=0
+ % root node
+ \bracketset{new node/.expanded=%
+ {\the\bracket@afterthought}%
+ {\the\bracket@content}%
+ \noexpand\bracket@newNode
+ }%
+ \bracket@afterthought={}%
+ \let\bracket@rootNode\bracket@newNode
+ \expandafter\let\bracket@saveRootNodeTo\bracket@newNode
+ \else
+ % other nodes
+ \bracketset{new node/.expanded=%
+ {}%
+ {\the\bracket@content}%
+ \noexpand\bracket@newNode
+ }%
+ \fi
+ \bracket@content={}%
+}
+% \end{macrocode}
+%
+% This macro sets the afterthought. Bracket user must define a 2-arg key
+% |/bracket/set_afterthought=|\meta{node id}\meta{afterthought}.
+% \begin{macrocode}
+\def\bracket@addAfterthought{%
+ \bracketset{%
+ set afterthought/.expanded={\bracket@afterthoughtNode}{\the\bracket@afterthought}%
+ }%
+ \bracket@afterthought={}%
+}
+% \end{macrocode}
+%
+%
+% \section{Nodes}
+%
+% Nodes have numeric ids. The node option values of node $n$ are saved in the |\pgfkeys| tree in
+% path |/forest/@node/|$n$.
+%
+% \subsection{Option setting and retrieval}
+%
+% Macros for retrieving/setting node options of the current node.
+% \begin{macrocode}
+ % full expansion expands precisely to the value
+\def\forestov#1{\expandafter\expandonce\csname fRsT\forest@cn/#1\endcsname}
+ % full expansion expands all the way
+\def\forestove#1{\csname fRsT\forest@cn/#1\endcsname}
+ % full expansion expands to the cs holding the value
+\def\forestom#1{\expandonce{\csname fRsT\forest@cn/#1\endcsname}}
+\def\forestoget#1#2{\expandafter\let\expandafter#2\csname fRsT\forest@cn/#1\endcsname}
+\def\forestolet#1#2{\expandafter\let\csname fRsT\forest@cn/#1\endcsname#2}
+% \def\forestocslet#1#2{%
+% \edef\forest@marshal{%
+% \noexpand\pgfkeyslet{/forest/@node/\forest@cn/#1}{\expandonce{\csname#2\endcsname}}%
+% }\forest@marshal
+% }
+\def\forestoset#1#2{\expandafter\edef\csname fRsT\forest@cn/#1\endcsname{\unexpanded{#2}}}
+\def\forestoeset#1%#2
+ {\expandafter\edef\csname fRsT\forest@cn/#1\endcsname
+ %{#2}
+ }
+\def\forestoappto#1#2{%
+ \forestoeset{#1}{\forestov{#1}\unexpanded{#2}}%
+}
+\def\forestoifdefined#1%#2#3
+{%
+ \ifcsdef{fRsT\forest@cn/#1}%{#2}{#3}%
+}
+% \end{macrocode}
+% User macros for retrieving node options of the current node.
+% \begin{macrocode}
+\let\forestoption\forestov
+\let\foresteoption\forestove
+% \end{macrocode}
+% Macros for retrieving node options of a node given by its id.
+% \begin{macrocode}
+\def\forestOv#1#2{\expandafter\expandonce\csname fRsT#1/#2\endcsname}
+\def\forestOve#1#2{\csname fRsT#1/#2\endcsname}
+ % full expansion expands to the cs holding the value
+\def\forestOm#1#2{\expandonce{\csname fRsT#1/#2\endcsname}}
+\def\forestOget#1#2#3{\expandafter\let\expandafter#3\csname fRsT#1/#2\endcsname}
+\def\forestOlet#1#2#3{\expandafter\let\csname fRsT#1/#2\endcsname#3}
+% \def\forestOcslet#1#2#3{%
+% \edef\forest@marshal{%
+% \noexpand\pgfkeyslet{/forest/@node/#1/#2}{\expandonce{\csname#3\endcsname}}%
+% }\forest@marshal
+% }
+\def\forestOset#1#2#3{\expandafter\edef\csname fRsT#1/#2\endcsname{\unexpanded{#3}}}
+\def\forestOeset#1#2%#3
+{\expandafter\edef\csname fRsT#1/#2\endcsname
+ % {#3}
+}
+\def\forestOappto#1#2#3{%
+ \forestOeset{#1}{#2}{\forestOv{#1}{#2}\unexpanded{#3}}%
+}
+\def\forestOeappto#1#2#3{%
+ \forestOeset{#1}{#2}{\forestOv{#1}{#2}#3}%
+}
+\def\forestOpreto#1#2#3{%
+ \forestOeset{#1}{#2}{\unexpanded{#3}\forestOv{#1}{#2}}%
+}
+\def\forestOepreto#1#2#3{%
+ \forestOeset{#1}{#2}{#3\forestOv{#1}{#2}}%
+}
+\def\forestOifdefined#1#2%#3#4
+{%
+ \ifcsdef{fRsT#1/#2}%{#3}{#4}%
+}
+\def\forestOletO#1#2#3#4{% option #2 of node #1 <-- option #4 of node #3
+ \forestOget{#3}{#4}\forestoption@temp
+ \forestOlet{#1}{#2}\forestoption@temp}
+\def\forestOleto#1#2#3{%
+ \forestoget{#3}\forestoption@temp
+ \forestOlet{#1}{#2}\forestoption@temp}
+\def\forestoletO#1#2#3{%
+ \forestOget{#2}{#3}\forestoption@temp
+ \forestolet{#1}\forestoption@temp}
+\def\forestoleto#1#2{%
+ \forestoget{#2}\forestoption@temp
+ \forestolet{#1}\forestoption@temp}
+% \end{macrocode}
+% Macros for retrieving node options given by \meta{relative node name}|.|\meta{option}.
+% \begin{macrocode}
+\def\forestRNOget#1#2{% #1=rn!option, #2 = receiving cs
+ \pgfutil@in@{.}{#1}%
+ \ifpgfutil@in@
+ \forestRNOget@rn#2#1\forest@END
+ \else
+ \forestoget{#1}#2%
+ \fi
+}
+\def\forestRNOget@rn#1#2.#3\forest@END{%
+ \forest@forthis{%
+ \forest@nameandgo{#2}%
+ \forestoget{#3}#1%
+ }%
+}
+\def\forestRNO@getvalueandtype#1#2#3{% #1=rn.option, #2,#3 = receiving css
+ \pgfutil@in@{.}{#1}%
+ \ifpgfutil@in@
+ \forestRNO@getvalueandtype@rn#2#3#1\forest@END
+ \else
+ \forestoget{#1}#2%
+ \pgfkeysgetvalue{/forest/#1/@type}#3%
+ \fi
+}
+\def\forestRNO@getvalueandtype@rn#1#2#3.#4\forest@END{%
+ % #1,#2=receiving css, #3=relative node name, #4=option name
+ \forest@forthis{%
+ \forest@nameandgo{#3}%
+ \forestoget{#4}#1%
+ }%
+ \pgfkeysgetvalue{/forest/#4/@type}#2%
+}
+% \end{macrocode}
+% Macros for retrieving/setting registers.
+% \begin{macrocode}
+ % full expansion expands precisely to the value
+\def\forestrv#1{\expandafter\expandonce\csname fRsT/#1\endcsname}
+ % full expansion expands all the way
+\def\forestrve#1{\csname fRsT/#1\endcsname}
+ % full expansion expands to the cs holding the value
+\def\forestrm#1{\expandonce{\csname fRsT/#1\endcsname}}
+\def\forestrget#1#2{\expandafter\let\expandafter#2\csname fRsT/#1\endcsname}
+\def\forestrlet#1#2{\expandafter\let\csname fRsT/#1\endcsname#2}
+% \def\forestrcslet#1#2{%
+% \edef\forest@marshal{%
+% \noexpand\pgfkeyslet{/forest/@node/register/#1}{\expandonce{\csname#2\endcsname}}%
+% }\forest@marshal
+% }
+\def\forestrset#1#2{\expandafter\edef\csname fRsT/#1\endcsname{\unexpanded{#2}}}
+\def\forestreset#1%#2
+ {\expandafter\edef\csname fRsT/#1\endcsname}%{#2}
+\def\forestrappto#1#2{%
+ \forestreset{#1}{\forestrv{#1}\unexpanded{#2}}%
+}
+\def\forestrpreto#1#2{%
+ \forestreset{#1}{\unexpanded{#2}\forestrv{#1}}%
+}
+\def\forestrifdefined#1%#2#3
+{%
+ \ifcsdef{fRsT/#1}%{#2}{#3}%
+}
+% \end{macrocode}
+% User macros for retrieving node options of the current node.
+% \begin{macrocode}
+\def\forestregister#1{\forestrv{#1}}
+\def\foresteregister#1{\forestrve{#1}}
+% \end{macrocode}
+% Node initialization. Node option declarations append to |\forest@node@init|.
+% \begin{macrocode}
+\def\forest@node@init{%
+ \forestoset{@parent}{0}%
+ \forestoset{@previous}{0}% previous sibling
+ \forestoset{@next}{0}% next sibling
+ \forestoset{@first}{0}% primary child
+ \forestoset{@last}{0}% last child
+}
+\def\forestoinit#1{%
+ \pgfkeysgetvalue{/forest/#1}\forestoinit@temp
+ \forestolet{#1}\forestoinit@temp
+}
+\newcount\forest@node@maxid
+\def\forest@node@new#1{% #1 = cs receiving the new node id
+ \advance\forest@node@maxid1
+ \forest@fornode{\the\forest@node@maxid}{%
+ \forest@node@init
+ \forestoeset{id}{\forest@cn}%
+ \forest@node@setname{node@\forest@cn}%
+ \forest@initializefromstandardnode
+ \edef#1{\forest@cn}%
+ }%
+}
+\let\forestoinit@orig\forestoinit
+\def\forest@node@copy#1#2{% #1=from node id, cs receiving the new node id
+ \advance\forest@node@maxid1
+ \def\forestoinit##1{\ifstrequal{##1}{name}{\forestoset{name}{node@\forest@cn}}{\forestoletO{##1}{#1}{##1}}}%
+ \forest@fornode{\the\forest@node@maxid}{%
+ \forest@node@init
+ \forestoeset{id}{\forest@cn}%
+ \forest@node@setname{\forest@copy@name@template{\forestOve{#1}{name}}}%
+ \edef#2{\forest@cn}%
+ }%
+ \let\forestoinit\forestoinit@orig
+}
+\forestset{
+ copy name template/.code={\def\forest@copy@name@template##1{#1}},
+ copy name template/.default={node@\the\forest@node@maxid},
+ copy name template
+}
+\def\forest@tree@copy#1#2{% #1=from node id, #2=cs receiving the new node id
+ \forest@node@copy{#1}\forest@node@copy@temp@id
+ \forest@fornode{\forest@node@copy@temp@id}{%
+ \expandafter\forest@tree@copy@\expandafter{\forest@node@copy@temp@id}{#1}%
+ \edef#2{\forest@cn}%
+ }%
+}
+\def\forest@tree@copy@#1#2{%
+ \forest@node@Foreachchild{#2}{%
+ \expandafter\forest@tree@copy\expandafter{\forest@cn}\forest@node@copy@temp@childid
+ \forest@node@Append{#1}{\forest@node@copy@temp@childid}%
+ }%
+}
+% \end{macrocode}
+% Macro |\forest@cn| holds the current node id (a number). Node 0 is a special ``null'' node which
+% is used to signal the absence of a node.
+% \begin{macrocode}
+\def\forest@cn{0}
+\forest@node@init
+% \end{macrocode}
+%
+% \subsection{Tree structure}
+% Node insertion/removal.
+%
+% For the lowercase variants, |\forest@cn| is the parent/removed node. For the uppercase variants,
+% |#1| is the parent/removed node. For efficiency, the public macros all expand the arguments
+% before calling the internal macros.
+% \begin{macrocode}
+\def\forest@node@append#1{\expandtwonumberargs\forest@node@Append{\forest@cn}{#1}}
+\def\forest@node@prepend#1{\expandtwonumberargs\forest@node@Insertafter{\forest@cn}{#1}{0}}
+\def\forest@node@insertafter#1#2{%
+ \expandthreenumberargs\forest@node@Insertafter{\forest@cn}{#1}{#2}}
+\def\forest@node@insertbefore#1#2{%
+ \expandthreenumberargs\forest@node@Insertafter{\forest@cn}{#1}{\forestOve{#2}{@previous}}%
+}
+\def\forest@node@remove{\expandnumberarg\forest@node@Remove{\forest@cn}}
+\def\forest@node@Append#1#2{\expandtwonumberargs\forest@node@Append@{#1}{#2}}
+\def\forest@node@Prepend#1#2{\expandtwonumberargs\forest@node@Insertafter{#1}{#2}{0}}
+\def\forest@node@Insertafter#1#2#3{% #2 is inserted after #3
+ \expandthreenumberargs\forest@node@Insertafter@{#1}{#2}{#3}%
+}
+\def\forest@node@Insertbefore#1#2#3{% #2 is inserted before #3
+ \expandthreenumberargs\forest@node@Insertafter{#1}{#2}{\forestOve{#3}{@previous}}%
+}
+\def\forest@node@Remove#1{\expandnumberarg\forest@node@Remove@{#1}}
+\def\forest@node@Insertafter@#1#2#3{%
+ \ifnum\forestOve{#2}{@parent}=0
+ \else
+ \PackageError{forest}{Insertafter(#1,#2,#3):
+ node #2 already has a parent (\forestOve{#2}{@parent})}{}%
+ \fi
+ \ifnum#3=0
+ \else
+ \ifnum#1=\forestOve{#3}{@parent}
+ \else
+ \PackageError{forest}{Insertafter(#1,#2,#3): node #1 is not the parent of the
+ intended sibling #3 (with parent \forestOve{#3}{@parent})}{}%
+ \fi
+ \fi
+ \forestOeset{#2}{@parent}{#1}%
+ \forestOeset{#2}{@previous}{#3}%
+ \ifnum#3=0
+ \forestOget{#1}{@first}\forest@node@temp
+ \forestOeset{#1}{@first}{#2}%
+ \else
+ \forestOget{#3}{@next}\forest@node@temp
+ \forestOeset{#3}{@next}{#2}%
+ \fi
+ \forestOeset{#2}{@next}{\forest@node@temp}%
+ \ifnum\forest@node@temp=0
+ \forestOeset{#1}{@last}{#2}%
+ \else
+ \forestOeset{\forest@node@temp}{@previous}{#2}%
+ \fi
+}
+\def\forest@node@Append@#1#2{%
+ \ifnum\forestOve{#2}{@parent}=0
+ \else
+ \PackageError{forest}{Append(#1,#2):
+ node #2 already has a parent (\forestOve{#2}{@parent})}{}%
+ \fi
+ \forestOeset{#2}{@parent}{#1}%
+ \forestOget{#1}{@last}\forest@node@temp
+ \forestOeset{#1}{@last}{#2}%
+ \forestOeset{#2}{@previous}{\forest@node@temp}%
+ \ifnum\forest@node@temp=0
+ \forestOeset{#1}{@first}{#2}%
+ \else
+ \forestOeset{\forest@node@temp}{@next}{#2}%
+ \fi
+}
+\def\forest@node@Remove@#1{%
+ \forestOget{#1}{@parent}\forest@node@temp@parent
+ \ifnum\forest@node@temp@parent=0
+ \else
+ \forestOget{#1}{@previous}\forest@node@temp@previous
+ \forestOget{#1}{@next}\forest@node@temp@next
+ \ifnum\forest@node@temp@previous=0
+ \forestOeset{\forest@node@temp@parent}{@first}{\forest@node@temp@next}%
+ \else
+ \forestOeset{\forest@node@temp@previous}{@next}{\forest@node@temp@next}%
+ \fi
+ \ifnum\forest@node@temp@next=0
+ \forestOeset{\forest@node@temp@parent}{@last}{\forest@node@temp@previous}%
+ \else
+ \forestOeset{\forest@node@temp@next}{@previous}{\forest@node@temp@previous}%
+ \fi
+ \forestOset{#1}{@parent}{0}%
+ \forestOset{#1}{@previous}{0}%
+ \forestOset{#1}{@next}{0}%
+ \fi
+}
+% \end{macrocode}
+% Do some stuff and return to the current node.
+% \begin{macrocode}
+\def\forest@forthis#1{%
+ \edef\forest@node@marshal{\unexpanded{#1}\def\noexpand\forest@cn}%
+ \expandafter\forest@node@marshal\expandafter{\forest@cn}%
+}
+\def\forest@fornode#1#2{%
+ \edef\forest@node@marshal{\edef\noexpand\forest@cn{#1}\unexpanded{#2}\def\noexpand\forest@cn}%
+ \expandafter\forest@node@marshal\expandafter{\forest@cn}%
+}
+% \end{macrocode}
+% Looping methods: children.
+% \begin{macrocode}
+\def\forest@node@foreachchild#1{\forest@node@Foreachchild{\forest@cn}{#1}}
+\def\forest@node@Foreachchild#1#2{%
+ \forest@fornode{\forestOve{#1}{@first}}{\forest@node@@forselfandfollowingsiblings{#2}}%
+}
+\def\forest@node@@forselfandfollowingsiblings#1{%
+ \ifnum\forest@cn=0
+ \else
+ \forest@forthis{#1}%
+ \@escapeif{%
+ \edef\forest@cn{\forestove{@next}}%
+ \forest@node@@forselfandfollowingsiblings{#1}%
+ }%
+ \fi
+}
+\def\forest@node@@forselfandfollowingsiblings@reversed#1{%
+ \ifnum\forest@cn=0
+ \else
+ \@escapeif{%
+ \edef\forest@marshal{%
+ \noexpand\def\noexpand\forest@cn{\forestove{@next}}%
+ \noexpand\forest@node@@forselfandfollowingsiblings@reversed{\unexpanded{#1}}%
+ \noexpand\forest@fornode{\forest@cn}{\unexpanded{#1}}%
+ }\forest@marshal
+ }%
+ \fi
+}
+\def\forest@node@foreachchild@reversed#1{\forest@node@Foreachchild@reversed{\forest@cn}{#1}}
+\def\forest@node@Foreachchild@reversed#1#2{%
+ \forest@fornode{\forestOve{#1}{@last}}{\forest@node@@forselfandprecedingsiblings@reversed{#2}}%
+}
+\def\forest@node@@forselfandprecedingsiblings@reversed#1{%
+ \ifnum\forest@cn=0
+ \else
+ \forest@forthis{#1}%
+ \@escapeif{%
+ \edef\forest@cn{\forestove{@previous}}%
+ \forest@node@@forselfandprecedingsiblings@reversed{#1}%
+ }%
+ \fi
+}
+\def\forest@node@@forselfandprecedingsiblings#1{%
+ \ifnum\forest@cn=0
+ \else
+ \@escapeif{%
+ \edef\forest@marshal{%
+ \noexpand\def\noexpand\forest@cn{\forestove{@previous}}%
+ \noexpand\forest@node@@forselfandprecedingsiblings{\unexpanded{#1}}%
+ \noexpand\forest@fornode{\forest@cn}{\unexpanded{#1}}%
+ }\forest@marshal
+ }%
+ \fi
+}
+% \end{macrocode}
+% Looping methods: (sub)tree and descendants.
+% \begin{macrocode}
+\def\forest@node@@foreach#1#2#3#4{%
+ % #1 = do what
+ % #2 = do that -1=before,1=after processing children
+ % #3 & #4: normal or reversed order of children?
+ % #3 = @first/@last
+ % #4 = \forest@node@@forselfandfollowingsiblings / \forest@node@@forselfandprecedingsiblings@reversed
+ \ifnum#2<0 \forest@forthis{#1}\fi
+ \ifnum\forestove{#3}=0
+ \else\@escapeif{%
+ \forest@forthis{%
+ \edef\forest@cn{\forestove{#3}}%
+ #4{\forest@node@@foreach{#1}{#2}{#3}{#4}}%
+ }%
+ }\fi
+ \ifnum#2>0 \forest@forthis{#1}\fi
+}
+\def\forest@node@foreach#1{%
+ \forest@node@@foreach{#1}{-1}{@first}{\forest@node@@forselfandfollowingsiblings}}
+\def\forest@node@Foreach#1#2{%
+ \forest@fornode{#1}{\forest@node@@foreach{#2}{-1}{@first}{\forest@node@@forselfandfollowingsiblings}}}
+\def\forest@node@foreach@reversed#1{%
+ \forest@node@@foreach{#1}{-1}{@last}{\forest@node@@forselfandprecedingsiblings@reversed}}
+\def\forest@node@Foreach@reversed#1#2{%
+ \forest@fornode{#1}{\forest@node@@foreach{#2}{-1}{@last}{\forest@node@@forselfandprecedingsiblings@reversed}}}
+\def\forest@node@foreach@childrenfirst#1{%
+ \forest@node@@foreach{#1}{1}{@first}{\forest@node@@forselfandfollowingsiblings}}
+\def\forest@node@Foreach@childrenfirst#1#2{%
+ \forest@fornode{#1}{\forest@node@@foreach{#2}{1}{@first}{\forest@node@@forselfandfollowingsiblings}}}
+\def\forest@node@foreach@childrenfirst@reversed#1{%
+ \forest@node@@foreach{#1}{1}{@last}{\forest@node@@forselfandprecedingsiblings@reversed}}
+\def\forest@node@Foreach@childrenfirst@reversed#1#2{%
+ \forest@fornode{#1}{\forest@node@@foreach{#2}{1}{@last}{\forest@node@@forselfandprecedingsiblings@reversed}}}
+\def\forest@node@foreachdescendant#1{%
+ \forest@node@foreachchild{\forest@node@@foreach{#1}{-1}{@first}{\forest@node@@forselfandfollowingsiblings}}}
+\def\forest@node@Foreachdescendant#1#2{%
+ \forest@node@Foreachchild{#1}{\forest@node@@foreach{#2}{-1}{@first}{\forest@node@@forselfandfollowingsiblings}}}
+\def\forest@node@foreachdescendant@reversed#1{%
+ \forest@node@foreachchild@reversed{\forest@node@@foreach{#1}{-1}{@last}{\forest@node@@forselfandprecedingsiblings@reversed}}}
+\def\forest@node@Foreachdescendant@reversed#1#2{%
+ \forest@node@Foreachchild@reversed{#1}{\forest@node@@foreach{#2}{-1}{@last}{\forest@node@@forselfandprecedingsiblings@reversed}}}
+\def\forest@node@foreachdescendant@childrenfirst#1{%
+ \forest@node@foreachchild{\forest@node@@foreach{#1}{1}{@first}{\forest@node@@forselfandfollowingsiblings}}}
+\def\forest@node@Foreachdescendant@childrenfirst#1#2{%
+ \forest@node@Foreachchild{#1}{\forest@node@@foreach{#2}{1}{@first}{\forest@node@@forselfandfollowingsiblings}}}
+\def\forest@node@foreachdescendant@childrenfirst@reversed#1{%
+ \forest@node@foreachchild@reversed{\forest@node@@foreach{#1}{1}{@last}{\forest@node@@forselfandprecedingsiblings@reversed}}}
+\def\forest@node@Foreachdescendant@childrenfirst@reversed#1#2{%
+ \forest@node@Foreachchild@reversed{#1}{\forest@node@@foreach{#2}{1}{@last}{\forest@node@@forselfandprecedingsiblings@reversed}}}
+% \end{macrocode}
+% Looping methods: breadth-first.
+% \begin{macrocode}
+\def\forest@node@foreach@breadthfirst#1#2{% #1 = max level, #2 = code
+ \forest@node@Foreach@breadthfirst@{\forest@cn}{@first}{@next}{#1}{#2}}
+\def\forest@node@foreach@breadthfirst@reversed#1#2{% #1 = max level, #2 = code
+ \forest@node@Foreach@breadthfirst@{\forest@cn}{@last}{@previous}{#1}{#2}}
+\def\forest@node@Foreach@breadthfirst#1#2#3{% #1 = node id, #2 = max level, #3 = code
+ \forest@node@Foreach@breadthfirst@{#1}{@first}{@next}{#2}{#3}}
+\def\forest@node@Foreach@breadthfirst@reversed#1#2#3{% #1 = node id, #2 = max level, #3 = code
+ \forest@node@Foreach@breadthfirst@{#1}{@last}{@previous}{#2}{#3}}
+\def\forest@node@Foreach@breadthfirst@#1#2#3#4#5{%
+ % #1 = root node,
+ % #2 = @first/@last, #3 = @next/@previous (must be in sync with #2),
+ % #4 = max level (< 0 means infinite)
+ % #5 = code to execute at each node
+ \forest@node@Foreach@breadthfirst@processqueue{#1,}{#2}{#3}{#4}{#5}%
+}
+\def\forest@node@Foreach@breadthfirst@processqueue#1#2#3#4#5{%
+ % #1 = queue,
+ % #2 = @first/@last, #3 = @next/@previous (must be in sync with #2),
+ % #4 = max level (< 0 means infinite)
+ % #5 = code to execute at each node
+ \ifstrempty{#1}{}{%
+ \forest@node@Foreach@breadthfirst@processqueue@#1\forest@node@Foreach@breadthfirst@processqueue@
+ {#2}{#3}{#4}{#5}%
+ }%
+}
+\def\forest@node@Foreach@breadthfirst@processqueue@#1,#2\forest@node@Foreach@breadthfirst@processqueue@#3#4#5#6{%
+ % #1 = first,
+ % #2 = rest,
+ % #3 = @first/@last, #4 = next/previous (must be in sync with #2),
+ % #5 = max level (< 0 means infinite)
+ % #6 = code to execute at each node
+ \forest@fornode{#1}{%
+ #6%
+ \ifnum#5<0
+ \forest@node@getlistofchildren\forest@temp{#3}{#4}%
+ \else
+ \ifnum\forestove{level}>#5\relax
+ \def\forest@temp{}%
+ \else
+ \forest@node@getlistofchildren\forest@temp{#3}{#4}%
+ \fi
+ \fi
+ \edef\forest@marshal{%
+ \noexpand\forest@node@Foreach@breadthfirst@processqueue{\unexpanded{#2}\forest@temp}%
+ {#3}{#4}{#5}{\unexpanded{#6}}%
+ }\forest@marshal
+ }%
+}
+\def\forest@node@getlistofchildren#1#2#3{% #1 = list cs, #2 = @first/@last, #3 = @next/@previous
+ \forest@node@Getlistofchildren{\forest@cn}{#1}{#2}{#3}%
+}
+\def\forest@node@Getlistofchildren#1#2#3#4{% #1 = node, #2 = list cs, #3 = @first/@last, #4 = @next/@previous
+ \def#2{}%
+ \ifnum\forestove{#3}=0
+ \else
+ \eappto#2{\forestOve{#1}{#3},}%
+ \@escapeif{%
+ \edef\forest@marshal{%
+ \noexpand\forest@node@Getlistofchildren@{\forestOve{#1}{#3}}\noexpand#2{#4}%
+ }\forest@marshal
+ }%
+ \fi
+}
+\def\forest@node@Getlistofchildren@#1#2#3{% #1 = node, #2 = list cs, #3 = @next/@previous
+ \ifnum\forestOve{#1}{#3}=0
+ \else
+ \eappto#2{\forestOve{#1}{#3},}%
+ \@escapeif{%
+ \edef\forest@marshal{%
+ \noexpand\forest@node@Getlistofchildren@{\forestOve{#1}{#3}}\noexpand#2{#3}%
+ }\forest@marshal
+ }%
+ \fi
+}
+% \end{macrocode}
+%
+% Compute |n|, |n'|, |n children| and |level|.
+% \begin{macrocode}
+\def\forest@node@Compute@numeric@ts@info@#1{%
+ \forest@node@Foreach{#1}{\forest@node@@compute@numeric@ts@info}%
+ \ifnum\forestOve{#1}{@parent}=0
+ \else
+ \forest@fornode{#1}{\forest@node@@compute@numeric@ts@info@nbar}%
+ % hack: the parent of the node we called the update for gets +1 for n_children
+ \edef\forest@node@temp{\forestOve{#1}{@parent}}%
+ \forestOeset{\forest@node@temp}{n children}{%
+ \number\numexpr\forestOve{\forest@node@temp}{n children}-1%
+ }%
+ \fi
+ \forest@node@Foreachdescendant{#1}{\forest@node@@compute@numeric@ts@info@nbar}%
+}
+\def\forest@node@@compute@numeric@ts@info{%
+ \forestoset{n children}{0}%
+ %
+ \edef\forest@node@temp{\forestove{@previous}}%
+ \ifnum\forest@node@temp=0
+ \forestoset{n}{1}%
+ \else
+ \forestoeset{n}{\number\numexpr\forestOve{\forest@node@temp}{n}+1}%
+ \fi
+ %
+ \edef\forest@node@temp{\forestove{@parent}}%
+ \ifnum\forest@node@temp=0
+ \forestoset{n}{0}%
+ \forestoset{n'}{0}%
+ \forestoset{level}{0}%
+ \else
+ \forestOeset{\forest@node@temp}{n children}{%
+ \number\numexpr\forestOve{\forest@node@temp}{n children}+1%
+ }%
+ \forestoeset{level}{%
+ \number\numexpr\forestOve{\forest@node@temp}{level}+1%
+ }%
+ \fi
+}
+\def\forest@node@@compute@numeric@ts@info@nbar{%
+ \forestoeset{n'}{\number\numexpr\forestOve{\forestove{@parent}}{n children}-\forestove{n}+1}%
+}
+\def\forest@node@compute@numeric@ts@info#1{%
+ \expandnumberarg\forest@node@Compute@numeric@ts@info@{\forest@cn}%
+}
+\def\forest@node@Compute@numeric@ts@info#1{%
+ \expandnumberarg\forest@node@Compute@numeric@ts@info@{#1}%
+}
+% \end{macrocode}
+%
+% Tree structure queries.
+% \begin{macrocode}
+\def\forest@node@rootid{%
+ \expandnumberarg\forest@node@Rootid{\forest@cn}%
+}
+\def\forest@node@Rootid#1{% #1=node
+ \ifnum\forestOve{#1}{@parent}=0
+ #1%
+ \else
+ \@escapeif{\expandnumberarg\forest@node@Rootid{\forestOve{#1}{@parent}}}%
+ \fi
+}
+\def\forest@node@nthchildid#1{% #1=n
+ \ifnum#1<1
+ 0%
+ \else
+ \expandnumberarg\forest@node@nthchildid@{\number\forestove{@first}}{#1}%
+ \fi
+}
+\def\forest@node@nthchildid@#1#2{%
+ \ifnum#1=0
+ 0%
+ \else
+ \ifnum#2>1
+ \@escapeifif{\expandtwonumberargs
+ \forest@node@nthchildid@{\forestOve{#1}{@next}}{\numexpr#2-1}}%
+ \else
+ #1%
+ \fi
+ \fi
+}
+\def\forest@node@nbarthchildid#1{% #1=n
+ \expandnumberarg\forest@node@nbarthchildid@{\number\forestove{@last}}{#1}%
+}
+\def\forest@node@nbarthchildid@#1#2{%
+ \ifnum#1=0
+ 0%
+ \else
+ \ifnum#2>1
+ \@escapeifif{\expandtwonumberargs
+ \forest@node@nbarthchildid@{\forestOve{#1}{@previous}}{\numexpr#2-1}}%
+ \else
+ #1%
+ \fi
+ \fi
+}
+\def\forest@node@nornbarthchildid#1{%
+ \ifnum#1>0
+ \forest@node@nthchildid{#1}%
+ \else
+ \ifnum#1<0
+ \forest@node@nbarthchildid{-#1}%
+ \else
+ \forest@node@nornbarthchildid@error
+ \fi
+ \fi
+}
+\def\forest@node@nornbarthchildid@error{%
+ \PackageError{forest}{In \string\forest@node@nornbarthchildid, n should !=0}{}%
+}
+\def\forest@node@previousleafid{%
+ \expandnumberarg\forest@node@Previousleafid{\forest@cn}%
+}
+\def\forest@node@Previousleafid#1{%
+ \ifnum\forestOve{#1}{@previous}=0
+ \@escapeif{\expandnumberarg\forest@node@previousleafid@Goup{#1}}%
+ \else
+ \expandnumberarg\forest@node@previousleafid@Godown{\forestOve{#1}{@previous}}%
+ \fi
+}
+\def\forest@node@previousleafid@Goup#1{%
+ \ifnum\forestOve{#1}{@parent}=0
+ \PackageError{forest}{get previous leaf: this is the first leaf}{}%
+ \else
+ \@escapeif{\expandnumberarg\forest@node@Previousleafid{\forestOve{#1}{@parent}}}%
+ \fi
+}
+\def\forest@node@previousleafid@Godown#1{%
+ \ifnum\forestOve{#1}{@last}=0
+ #1%
+ \else
+ \@escapeif{\expandnumberarg\forest@node@previousleafid@Godown{\forestOve{#1}{@last}}}%
+ \fi
+}
+\def\forest@node@nextleafid{%
+ \expandnumberarg\forest@node@Nextleafid{\forest@cn}%
+}
+\def\forest@node@Nextleafid#1{%
+ \ifnum\forestOve{#1}{@next}=0
+ \@escapeif{\expandnumberarg\forest@node@nextleafid@Goup{#1}}%
+ \else
+ \expandnumberarg\forest@node@nextleafid@Godown{\forestOve{#1}{@next}}%
+ \fi
+}
+\def\forest@node@nextleafid@Goup#1{%
+ \ifnum\forestOve{#1}{@parent}=0
+ \PackageError{forest}{get next leaf: this is the last leaf}{}%
+ \else
+ \@escapeif{\expandnumberarg\forest@node@Nextleafid{\forestOve{#1}{@parent}}}%
+ \fi
+}
+\def\forest@node@nextleafid@Godown#1{%
+ \ifnum\forestOve{#1}{@first}=0
+ #1%
+ \else
+ \@escapeif{\expandnumberarg\forest@node@nextleafid@Godown{\forestOve{#1}{@first}}}%
+ \fi
+}
+
+
+
+\def\forest@node@linearnextid{%
+ \ifnum\forestove{@first}=0
+ \expandafter\forest@node@linearnextnotdescendantid
+ \else
+ \forestove{@first}%
+ \fi
+}
+\def\forest@node@linearnextnotdescendantid{%
+ \expandnumberarg\forest@node@Linearnextnotdescendantid{\forest@cn}%
+}
+\def\forest@node@Linearnextnotdescendantid#1{%
+ \ifnum\forestOve{#1}{@next}=0
+ \ifnum\forestOve{#1}{@parent}=0
+ 0%
+ \else
+ \@escapeifif{\expandnumberarg\forest@node@Linearnextnotdescendantid{\forestOve{#1}{@parent}}}%
+ \fi
+ \else
+ \forestOve{#1}{@next}%
+ \fi
+}
+\def\forest@node@linearpreviousid{%
+ \ifnum\forestove{@previous}=0
+ \forestove{@parent}%
+ \else
+ \forest@node@previousleafid
+ \fi
+}
+% \end{macrocode}
+% Test if the current node is an ancestor the node given by its id in the first argument. The code graciously deals with circular trees. The second and third argument (not formally present) are the true and the false case code.
+% \begin{macrocode}
+
+\def\forest@ifancestorof#1{% is the current node an ancestor of #1? Yes: #2, no: #3
+ \begingroup
+ \expandnumberarg\forest@ifancestorof@{\forestOve{#1}{@parent}}%
+}
+\def\forest@ifancestorof@#1{%
+ \ifnum#1=0
+ \def\forest@ifancestorof@next{\expandafter\endgroup\@secondoftwo}%
+ \else
+ \ifnum\forest@cn=#1
+ \def\forest@ifancestorof@next{\expandafter\endgroup\@firstoftwo}%
+ \else
+ \ifcsdef{forest@circularity@used#1}{%
+% \end{macrocode}
+% We have just detected circularity: the potential descendant is in fact an ancestor of itself. Our answer is ``false'': the current node is not an ancestor of the potential descendant.
+% \begin{macrocode}
+ \def\forest@ifancestorof@next{\expandafter\endgroup\@secondoftwo}%
+ }{%
+ \csdef{forest@circularity@used#1}{}%
+ \def\forest@ifancestorof@next{\expandnumberarg\forest@ifancestorof@{\forestOve{#1}{@parent}}}%
+ }%
+ \fi
+ \fi
+ \forest@ifancestorof@next
+}
+% \end{macrocode}
+% A debug tool which prints out the hierarchy of all nodes.
+% \begin{macrocode}
+\NewDocumentCommand\forestdebugtypeouttrees{o}{%
+ \forestdebug@typeouttrees\forest@temp
+ \typeout{%
+ \forestdebugtypeouttreesprefix
+ \IfValueTF{#1}{#1: }{}%
+ \detokenize\expandafter{\forest@temp}%
+ \forestdebugtypeouttreessuffix
+ }%
+}
+\def\forestdebug@typeouttrees#1{% #1 = cs to store the result
+ \begingroup
+ \edef\forest@temp@message{}%
+ \def\forestdebug@typeouttrees@n{0}%
+% \end{macrocode}
+% Loop through all known ids. When finding a node that has not been visited yet (probably as a part of a previous tree), find its root and typeout the root's tree.
+% \begin{macrocode}
+ \loop
+ \ifnum\forestdebug@typeouttrees@n<\forest@node@maxid
+ \edef\forestdebug@typeouttrees@n{\number\numexpr\forestdebug@typeouttrees@n+1}%
+ \ifcsdef{forestdebug@typeouttree@used@\forestdebug@typeouttrees@n}{}{%
+ \forest@fornode{\forestdebug@typeouttrees@n}{%
+% \end{macrocode}
+% After finding the root, we need to restore our notes about visited nodes.
+% \begin{macrocode}
+ \begingroup
+ \forestdebug@typeouttrees@findroot
+ \expandafter\endgroup
+ \expandafter\edef\expandafter\forest@cn\expandafter{\forest@cn}%
+ \forestdebug@typeouttree@build
+ \appto\forest@temp@message{ }%
+ }%
+ }%
+ \repeat
+ \expandafter\endgroup
+ \expandafter\def\expandafter#1\expandafter{\forest@temp@message}%
+}
+\def\forestdebug@typeouttrees@findroot{%
+ \let\forestdebug@typeouttrees@next\relax
+ \edef\forestdebug@typeouttrees@parent{\forestOve{\forest@cn}{@parent}}%
+ \ifnum\forestdebug@typeouttrees@parent=0
+ \else
+ \ifcsdef{forestdebug@typeouttree@used@\forest@cn}{}{%
+ \csdef{forestdebug@typeouttree@used@\forest@cn}{}%
+ \edef\forest@cn{\forestdebug@typeouttrees@parent}%
+ \let\forestdebug@typeouttrees@next\forestdebug@typeouttrees@findroot
+ }%
+ \fi
+ \forestdebug@typeouttrees@next
+}
+\def\forestdebug@typeouttree#1#2{% #1=root id, #2=cs to receive result
+ \begingroup
+ \edef\forest@temp@message{}%
+ \forest@fornode{#1}{\forestdebug@typeouttree@build}%
+ \expandafter\endgroup
+ \expandafter\edef\expandafter#2\expandafter{\forest@temp@message}%
+}
+\NewDocumentCommand\forestdebugtypeouttree{d() O{\forest@cn}}{%
+ \forestdebug@typeouttree{#2}\forest@temp
+ \typeout{\IfValueTF{#1}{#1: }{}\forest@temp}%
+}
+% \end{macrocode}
+% Recurse through the tree. If a circularity is detected, mark it with |*| and stop recursion.
+% \begin{macrocode}
+\def\forestdebug@typeouttree@build{%
+ \eappto\forest@temp@message{[\forestdebugtypeouttreenodeinfo%]
+ \ifcsdef{forestdebug@typeouttree@used@\forest@cn}{*}{}%
+ }%
+ \ifcsdef{forestdebug@typeouttree@used@\forest@cn}{}{%
+ \csdef{forestdebug@typeouttree@used@\forest@cn}{}%
+ \forest@node@foreachchild{\forestdebug@typeouttree@build}%
+ }%
+ \eappto\forest@temp@message{%[
+ ]}%
+}
+\def\forestdebugtypeouttreenodeinfo{\forest@cn}
+\def\forestdebugtypeouttreesprefix{}
+\def\forestdebugtypeouttreessuffix{}
+% \end{macrocode}
+%
+%
+% \subsection{Node options}
+%
+% \subsubsection{Option-declaration mechanism}
+%
+% Common code for declaring options.
+% \begin{macrocode}
+\def\forest@declarehandler#1#2#3{%#1=handler for specific type,#2=option name,#3=default value
+ \pgfkeyssetvalue{/forest/#2}{#3}%
+ \appto\forest@node@init{\forestoinit{#2}}%
+ \pgfkeyssetvalue{/forest/#2/node@or@reg}{\forest@cn}%
+ \forest@convert@others@to@underscores{#2}\forest@pgfmathoptionname
+ \edef\forest@marshal{%
+ \noexpand#1{/forest/#2}{/forest}{#2}{\forest@pgfmathoptionname}%
+ }\forest@marshal
+}
+\def\forest@def@with@pgfeov#1#2{% \pgfeov mustn't occur in the arg of the .code handler!!!
+ \long\def#1##1\pgfeov{#2}%
+}
+% \end{macrocode}
+% Option-declaration handlers.
+% \begin{macrocode}
+\def\forest@declaretoks@handler#1#2#3#4{% #1=key,#2=path,#3=name,#4=pgfmathname
+ \forest@declaretoks@handler@A{#1}{#2}{#3}{#4}{}%
+}
+\def\forest@declarekeylist@handler#1#2#3#4{% #1=key,#2=path,#3=name,#4=pgfmathname
+ \forest@declaretoks@handler@A{#1}{#2}{#3}{#4}{,}%
+ \forest@copycommandkey{#1}{#1'}%
+ \pgfkeyssetvalue{#1'/option@name}{#3}%
+ \forest@copycommandkey{#1+}{#1}%
+ \pgfkeysalso{#1-/.code={%
+ \forest@fornode{\forest@setter@node}{%
+ \forest@node@removekeysfromkeylist{##1}{#3}%
+ }}}%
+ \pgfkeyssetvalue{#1-/option@name}{#3}%
+}
+\def\forest@declaretoks@handler@A#1#2#3#4#5{% #1=key,#2=path,#3=name,#4=pgfmathname,#5=infix
+ \pgfkeysalso{%
+ #1/.code={\forestOset{\forest@setter@node}{#3}{##1}},
+ #2/if #3/.code n args={3}{%
+ \forestoget{#3}\forest@temp@option@value
+ \edef\forest@temp@compared@value{\unexpanded{##1}}%
+ \ifx\forest@temp@option@value\forest@temp@compared@value
+ \pgfkeysalso{##2}%
+ \else
+ \pgfkeysalso{##3}%
+ \fi
+ },
+ #2/if in #3/.code n args={3}{%
+ \forestoget{#3}\forest@temp@option@value
+ \edef\forest@temp@compared@value{\unexpanded{##1}}%
+ \expandafter\expandafter\expandafter\pgfutil@in@\expandafter\expandafter\expandafter{\expandafter\forest@temp@compared@value\expandafter}\expandafter{\forest@temp@option@value}%
+ \ifpgfutil@in@
+ \pgfkeysalso{##2}%
+ \else
+ \pgfkeysalso{##3}%
+ \fi
+ },
+ #2/where #3/.style n args={3}{for tree={#2/if #3={##1}{##2}{##3}}},
+ #2/where in #3/.style n args={3}{for tree={#2/if in #3={##1}{##2}{##3}}}
+ }%
+ \ifstrempty{#5}{%
+ \pgfkeysalso{%
+ #1+/.code={\forestOappto{\forest@setter@node}{#3}{#5##1}},
+ #2/+#3/.code={\forestOpreto{\forest@setter@node}{#3}{##1#5}},
+ }%
+ }{%
+ \pgfkeysalso{%
+ #1+/.code={%
+ \forestOget{\forest@setter@node}{#3}\forest@temp
+ \ifdefempty{\forest@temp}{%
+ \forestOset{\forest@setter@node}{#3}{##1}%
+ }{%
+ \forestOappto{\forest@setter@node}{#3}{#5##1}%
+ }%
+ },
+ #2/+#3/.code={%
+ \forestOget{\forest@setter@node}{#3}\forest@temp
+ \ifdefempty{\forest@temp}{%
+ \forestOset{\forest@setter@node}{#3}{##1}%
+ }{%
+ \forestOpreto{\forest@setter@node}{#3}{##1#5}%
+ }%
+ }%
+ }%
+ }%
+ \pgfkeyssetvalue{#1/option@name}{#3}%
+ \pgfkeyssetvalue{#1+/option@name}{#3}%
+ \pgfkeyssetvalue{#2/+#3/option@name}{#3}%
+ \pgfkeyslet{#1/@type}\forestmathtype@generic % for .process & co
+ \pgfmathdeclarefunction{#4}{1}{\forest@pgfmathhelper@attribute@toks{##1}{#3}}%
+}
+\def\forest@declareautowrappedtoks@handler#1#2#3#4{% #1=key,#2=path,#3=name,#4=pgfmathname,#5=infix
+ \forest@declaretoks@handler{#1}{#2}{#3}{#4}%
+ \forest@copycommandkey{#1}{#1'}%
+ \pgfkeysalso{#1/.style={#1'/.wrap value={##1}}}%
+ \pgfkeyssetvalue{#1'/option@name}{#3}%
+ \forest@copycommandkey{#1+}{#1+'}%
+ \pgfkeysalso{#1+/.style={#1+'/.wrap value={##1}}}%
+ \pgfkeyssetvalue{#1+'/option@name}{#3}%
+ \forest@copycommandkey{#2/+#3}{#2/+#3'}%
+ \pgfkeysalso{#2/+#3/.style={#2/+#3'/.wrap value={##1}}}%
+ \pgfkeyssetvalue{#2/+#3'/option@name}{#3}%
+}
+\def\forest@declarereadonlydimen@handler#1#2#3#4{% #1=key,#2=path,#3=name,#4=pgfmathname
+ % this is to have `pt` with the correct category code
+ \pgfutil@tempdima=\pgfkeysvalueof{/forest/#3}\relax
+ \edef\forest@marshal{%
+ \noexpand\pgfkeyssetvalue{/forest/#3}{\the\pgfutil@tempdima}%
+ }\forest@marshal
+ \pgfkeysalso{%
+ #2/if #3/.code n args={3}{%
+ \forestoget{#3}\forest@temp@option@value
+ \ifdim\forest@temp@option@value=##1\relax
+ \pgfkeysalso{##2}%
+ \else
+ \pgfkeysalso{##3}%
+ \fi
+ },
+ #2/if #3</.code n args={3}{%
+ \forestoget{#3}\forest@temp@option@value
+ \ifdim\forest@temp@option@value>##1\relax
+ \pgfkeysalso{##3}%
+ \else
+ \pgfkeysalso{##2}%
+ \fi
+ },
+ #2/if #3>/.code n args={3}{%
+ \forestoget{#3}\forest@temp@option@value
+ \ifdim\forest@temp@option@value<##1\relax
+ \pgfkeysalso{##3}%
+ \else
+ \pgfkeysalso{##2}%
+ \fi
+ },
+ #2/where #3/.style n args={3}{for tree={#2/if #3={##1}{##2}{##3}}},
+ #2/where #3</.style n args={3}{for tree={#2/if #3<={##1}{##2}{##3}}},
+ #2/where #3>/.style n args={3}{for tree={#2/if #3>={##1}{##2}{##3}}},
+ }%
+ \pgfkeyslet{#1/@type}\forestmathtype@dimen % for .process & co
+ \pgfmathdeclarefunction{#4}{1}{\forest@pgfmathhelper@attribute@dimen{##1}{#3}}%
+}
+\def\forest@declaredimen@handler#1#2#3#4{% #1=key,#2=path,#3=name,#4=pgfmathname
+ \forest@declarereadonlydimen@handler{#1}{#2}{#3}{#4}%
+ \pgfkeysalso{%
+ #1/.code={%
+ \forestmathsetlengthmacro\forest@temp{##1}%
+ \forestOlet{\forest@setter@node}{#3}\forest@temp
+ },
+ #1+/.code={%
+ \forestmathsetlengthmacro\forest@temp{##1}%
+ \pgfutil@tempdima=\forestove{#3}
+ \advance\pgfutil@tempdima\forest@temp\relax
+ \forestOeset{\forest@setter@node}{#3}{\the\pgfutil@tempdima}%
+ },
+ #1-/.code={%
+ \forestmathsetlengthmacro\forest@temp{##1}%
+ \pgfutil@tempdima=\forestove{#3}
+ \advance\pgfutil@tempdima-\forest@temp\relax
+ \forestOeset{\forest@setter@node}{#3}{\the\pgfutil@tempdima}%
+ },
+ #1*/.style={%
+ #1={#4()*(##1)}%
+ },
+ #1:/.style={%
+ #1={#4()/(##1)}%
+ },
+ #1'/.code={%
+ \pgfutil@tempdima=##1\relax
+ \forestOeset{\forest@setter@node}{#3}{\the\pgfutil@tempdima}%
+ },
+ #1'+/.code={%
+ \pgfutil@tempdima=\forestove{#3}\relax
+ \advance\pgfutil@tempdima##1\relax
+ \forestOeset{\forest@setter@node}{#3}{\the\pgfutil@tempdima}%
+ },
+ #1'-/.code={%
+ \pgfutil@tempdima=\forestove{#3}\relax
+ \advance\pgfutil@tempdima-##1\relax
+ \forestOeset{\forest@setter@node}{#3}{\the\pgfutil@tempdima}%
+ },
+ #1'*/.style={%
+ \pgfutil@tempdima=\forestove{#3}\relax
+ \multiply\pgfutil@tempdima##1\relax
+ \forestOeset{\forest@setter@node}{#3}{\the\pgfutil@tempdima}%
+ },
+ #1':/.style={%
+ \pgfutil@tempdima=\forestove{#3}\relax
+ \divide\pgfutil@tempdima##1\relax
+ \forestOeset{\forest@setter@node}{#3}{\the\pgfutil@tempdima}%
+ },
+ }%
+ \pgfkeyssetvalue{#1/option@name}{#3}%
+ \pgfkeyssetvalue{#1+/option@name}{#3}%
+ \pgfkeyssetvalue{#1-/option@name}{#3}%
+ \pgfkeyssetvalue{#1*/option@name}{#3}%
+ \pgfkeyssetvalue{#1:/option@name}{#3}%
+ \pgfkeyssetvalue{#1'/option@name}{#3}%
+ \pgfkeyssetvalue{#1'+/option@name}{#3}%
+ \pgfkeyssetvalue{#1'-/option@name}{#3}%
+ \pgfkeyssetvalue{#1'*/option@name}{#3}%
+ \pgfkeyssetvalue{#1':/option@name}{#3}%
+}
+\def\forest@declarereadonlycount@handler#1#2#3#4{% #1=key,#2=path,#3=name,#4=pgfmathname
+ \pgfkeysalso{
+ #2/if #3/.code n args={3}{%
+ \forestoget{#3}\forest@temp@option@value
+ \ifnum\forest@temp@option@value=##1\relax
+ \pgfkeysalso{##2}%
+ \else
+ \pgfkeysalso{##3}%
+ \fi
+ },
+ #2/if #3</.code n args={3}{%
+ \forestoget{#3}\forest@temp@option@value
+ \ifnum\forest@temp@option@value>##1\relax
+ \pgfkeysalso{##3}%
+ \else
+ \pgfkeysalso{##2}%
+ \fi
+ },
+ #2/if #3>/.code n args={3}{%
+ \forestoget{#3}\forest@temp@option@value
+ \ifnum\forest@temp@option@value<##1\relax
+ \pgfkeysalso{##3}%
+ \else
+ \pgfkeysalso{##2}%
+ \fi
+ },
+ #2/where #3/.style n args={3}{for tree={#2/if #3={##1}{##2}{##3}}},
+ #2/where #3</.style n args={3}{for tree={#2/if #3<={##1}{##2}{##3}}},
+ #2/where #3>/.style n args={3}{for tree={#2/if #3>={##1}{##2}{##3}}},
+ }%
+ \pgfkeyslet{#1/@type}\forestmathtype@count % for .process & co
+ \pgfmathdeclarefunction{#4}{1}{\forest@pgfmathhelper@attribute@count{##1}{#3}}%
+}
+\def\forest@declarecount@handler#1#2#3#4{% #1=key,#2=path,#3=name,#4=pgfmathname
+ \forest@declarereadonlycount@handler{#1}{#2}{#3}{#4}%
+ \pgfkeysalso{
+ #1/.code={%
+ \forestmathtruncatemacro\forest@temp{##1}%
+ \forestOlet{\forest@setter@node}{#3}\forest@temp
+ },
+ #1+/.code={%
+ \forestmathtruncatemacro\forest@temp{##1}%
+ \c@pgf@counta=\forestove{#3}\relax
+ \advance\c@pgf@counta\forest@temp\relax
+ \forestOeset{\forest@setter@node}{#3}{\the\c@pgf@counta}%
+ },
+ #1-/.code={%
+ \forestmathtruncatemacro\forest@temp{##1}%
+ \c@pgf@counta=\forestove{#3}\relax
+ \advance\c@pgf@counta-\forest@temp\relax
+ \forestOeset{\forest@setter@node}{#3}{\the\c@pgf@counta}%
+ },
+ #1*/.code={%
+ \forestmathtruncatemacro\forest@temp{##1}%
+ \c@pgf@counta=\forestove{#3}\relax
+ \multiply\c@pgf@counta\forest@temp\relax
+ \forestOeset{\forest@setter@node}{#3}{\the\c@pgf@counta}%
+ },
+ #1:/.code={%
+ \forestmathtruncatemacro\forest@temp{##1}%
+ \c@pgf@counta=\forestove{#3}\relax
+ \divide\c@pgf@counta\forest@temp\relax
+ \forestOeset{\forest@setter@node}{#3}{\the\c@pgf@counta}%
+ },
+ #1'/.code={%
+ \c@pgf@counta=##1\relax
+ \forestOeset{\forest@setter@node}{#3}{\the\c@pgf@counta}%
+ },
+ #1'+/.code={%
+ \c@pgf@counta=\forestove{#3}\relax
+ \advance\c@pgf@counta##1\relax
+ \forestOeset{\forest@setter@node}{#3}{\the\c@pgf@counta}%
+ },
+ #1'-/.code={%
+ \c@pgf@counta=\forestove{#3}\relax
+ \advance\c@pgf@counta-##1\relax
+ \forestOeset{\forest@setter@node}{#3}{\the\c@pgf@counta}%
+ },
+ #1'*/.style={%
+ \c@pgf@counta=\forestove{#3}\relax
+ \multiply\c@pgf@counta##1\relax
+ \forestOeset{\forest@setter@node}{#3}{\the\c@pgf@counta}%
+ },
+ #1':/.style={%
+ \c@pgf@counta=\forestove{#3}\relax
+ \divide\c@pgf@counta##1\relax
+ \forestOeset{\forest@setter@node}{#3}{\the\c@pgf@counta}%
+ },
+ }%
+ \pgfkeyssetvalue{#1/option@name}{#3}%
+ \pgfkeyssetvalue{#1+/option@name}{#3}%
+ \pgfkeyssetvalue{#1-/option@name}{#3}%
+ \pgfkeyssetvalue{#1*/option@name}{#3}%
+ \pgfkeyssetvalue{#1:/option@name}{#3}%
+ \pgfkeyssetvalue{#1'/option@name}{#3}%
+ \pgfkeyssetvalue{#1'+/option@name}{#3}%
+ \pgfkeyssetvalue{#1'-/option@name}{#3}%
+ \pgfkeyssetvalue{#1'*/option@name}{#3}%
+ \pgfkeyssetvalue{#1':/option@name}{#3}%
+}
+% \end{macrocode}
+% Nothing else should be defined in this namespace.
+% \begin{macrocode}
+\def\forest@declareboolean@handler#1#2#3#4{% #1=key,#2=path,#3=name,#4=pgfmathname
+ \pgfkeysalso{%
+ #1/.code={%
+ \forestmath@if{##1}{%
+ \def\forest@temp{1}%
+ }{%
+ \def\forest@temp{0}%
+ }%
+ \forestOlet{\forest@setter@node}{#3}\forest@temp
+ },
+ #1/.default=1,
+ #2/not #3/.code={\forestOset{\forest@setter@node}{#3}{0}},
+ #2/if #3/.code 2 args={%
+ \forestoget{#3}\forest@temp@option@value
+ \ifnum\forest@temp@option@value=0
+ \pgfkeysalso{##2}%
+ \else
+ \pgfkeysalso{##1}%
+ \fi
+ },
+ #2/where #3/.style 2 args={for tree={#2/if #3={##1}{##2}}}
+ }%
+ \pgfkeyssetvalue{#1/option@name}{#3}%
+ \pgfkeyslet{#1/@type}\forestmathtype@count % for .process & co
+ \pgfmathdeclarefunction{#4}{1}{\forest@pgfmathhelper@attribute@count{##1}{#3}}%
+}
+\forestset{
+ declare toks/.code 2 args={%
+ \forest@declarehandler\forest@declaretoks@handler{#1}{#2}%
+ },
+ declare autowrapped toks/.code 2 args={%
+ \forest@declarehandler\forest@declareautowrappedtoks@handler{#1}{#2}%
+ },
+ declare keylist/.code 2 args={%
+ \forest@declarehandler\forest@declarekeylist@handler{#1}{#2}%
+ },
+ declare readonly dimen/.code 2 args={%
+ \forestmathsetlengthmacro\forest@temp{#2}%
+ \edef\forest@marshal{%
+ \unexpanded{\forest@declarehandler\forest@declarereadonlydimen@handler{#1}}{\forest@temp}%
+ }\forest@marshal
+ },
+ declare dimen/.code 2 args={%
+ \forestmathsetlengthmacro\forest@temp{#2}%
+ \edef\forest@marshal{%
+ \unexpanded{\forest@declarehandler\forest@declaredimen@handler{#1}}{\forest@temp}%
+ }\forest@marshal
+ },
+ declare readonly count/.code 2 args={%
+ \forestmathtruncatemacro\forest@temp{#2}%
+ \edef\forest@marshal{%
+ \unexpanded{\forest@declarehandler\forest@declarereadonlycount@handler{#1}}{\forest@temp}%
+ }\forest@marshal
+ },
+ declare count/.code 2 args={%
+ \forestmathtruncatemacro\forest@temp{#2}%
+ \edef\forest@marshal{%
+ \unexpanded{\forest@declarehandler\forest@declarecount@handler{#1}}{\forest@temp}%
+ }\forest@marshal
+ },
+ declare boolean/.code 2 args={%
+ \forestmath@if{#2}{%
+ \def\forest@temp{1}%
+ }{%
+ \def\forest@temp{0}%
+ }%
+ \edef\forest@marshal{%
+ \unexpanded{\forest@declarehandler\forest@declareboolean@handler{#1}}{\forest@temp}%
+ }\forest@marshal
+ },
+% \end{macrocode}
+%
+% \section{Handlers}
+%
+% \begin{macrocode}
+ /handlers/.restore default value/.code={%
+ \edef\forest@handlers@currentpath{\pgfkeyscurrentpath}%
+ \pgfkeysgetvalue{\pgfkeyscurrentpath/option@name}\forest@currentoptionname
+ \pgfkeysgetvalue{/forest/\forest@currentoptionname}\forest@temp
+ \expandafter\pgfkeysalso\expandafter{\forest@handlers@currentpath/.expand once=\forest@temp}%
+ },
+ /handlers/.pgfmath/.code={%
+ \pgfmathparse{#1}%
+ \pgfkeysalso{\pgfkeyscurrentpath/.expand once=\pgfmathresult}%
+ },
+ /handlers/.wrap value/.code={%
+ \edef\forest@handlers@wrap@currentpath{\pgfkeyscurrentpath}%
+ \pgfkeysgetvalue{\forest@handlers@wrap@currentpath/option@name}\forest@currentoptionname
+ \forestOget{\pgfkeysvalueof{/forest/\forest@currentoptionname/node@or@reg}}{\forest@currentoptionname}\forest@option@value
+ \forest@def@with@pgfeov\forest@wrap@code{#1}%
+ \expandafter\edef\expandafter\forest@wrapped@value\expandafter{\expandafter\expandonce\expandafter{\expandafter\forest@wrap@code\forest@option@value\pgfeov}}%
+ \pgfkeysalso{\forest@handlers@wrap@currentpath/.expand once=\forest@wrapped@value}%
+ },
+ /handlers/.option/.code={%
+ \edef\forest@temp{\pgfkeyscurrentpath}%
+ \expandafter\forest@handlers@option\expandafter{\forest@temp}{#1}%
+ },
+}
+\def\forest@handlers@option#1#2{%#1=pgfkeyscurrentpath,#2=relative node name
+ \forestRNOget{#2}\forest@temp
+ \pgfkeysalso{#1/.expand once={\forest@temp}}%
+}%
+\forestset{
+ /handlers/.register/.code={%
+ \edef\forest@marshal{%
+ \noexpand\pgfkeysalso{\pgfkeyscurrentpath={\forestregister{#1}}}%
+ }\forest@marshal
+ },
+ /handlers/.wrap pgfmath arg/.code 2 args={%
+ \forestmathparse{#2}\let\forest@wrap@arg@i\forestmathresult
+ \edef\forest@wrap@args{{\expandonce\forest@wrap@arg@i}}%
+ \def\forest@wrap@code##1{#1}%
+ % here we don't call \forest@wrap@pgfmath@args@@@wrapandpasson, as compat-2.0.2-wrappgfmathargs changes that to achieve the old, confusing state of affairs, which *didn't* apply at *1*-arg pgfmath wrapping
+ \expandafter\expandafter\expandafter\forest@temp@toks\expandafter\expandafter\expandafter{\expandafter\forest@wrap@code\forest@wrap@args}%
+ \expandafter\pgfkeysalso\expandafter{\expandafter\pgfkeyscurrentpath\expandafter=\expandafter{\the\forest@temp@toks}}%
+ },
+ /handlers/.wrap 2 pgfmath args/.code n args={3}{%
+ \forestmathparse{#2}\let\forest@wrap@arg@i\forestmathresult
+ \forestmathparse{#3}\let\forest@wrap@arg@ii\forestmathresult
+ \edef\forest@wrap@args{{\expandonce\forest@wrap@arg@i}{\expandonce\forest@wrap@arg@ii}}%
+ \def\forest@wrap@code##1##2{#1}%
+ \forest@wrap@pgfmath@args@@@wrapandpasson
+ },
+ /handlers/.wrap 3 pgfmath args/.code n args={4}{%
+ \forest@wrap@n@pgfmath@args{#2}{#3}{#4}{}{}{}{}{}{3}%
+ \forest@wrap@n@pgfmath@do{#1}{3}},
+ /handlers/.wrap 4 pgfmath args/.code n args={5}{%
+ \forest@wrap@n@pgfmath@args{#2}{#3}{#4}{#5}{}{}{}{}{4}%
+ \forest@wrap@n@pgfmath@do{#1}{4}},
+ /handlers/.wrap 5 pgfmath args/.code n args={6}{%
+ \forest@wrap@n@pgfmath@args{#2}{#3}{#4}{#5}{#6}{}{}{}{5}%
+ \forest@wrap@n@pgfmath@do{#1}{5}},
+ /handlers/.wrap 6 pgfmath args/.code n args={7}{%
+ \forest@wrap@n@pgfmath@args{#2}{#3}{#4}{#5}{#6}{#7}{}{}{6}%
+ \forest@wrap@n@pgfmath@do{#1}{6}},
+ /handlers/.wrap 7 pgfmath args/.code n args={8}{%
+ \forest@wrap@n@pgfmath@args{#2}{#3}{#4}{#5}{#6}{#7}{#8}{}{7}%
+ \forest@wrap@n@pgfmath@do{#1}{7}},
+ /handlers/.wrap 8 pgfmath args/.code n args={9}{%
+ \forest@wrap@n@pgfmath@args{#2}{#3}{#4}{#5}{#6}{#7}{#8}{#9}{8}%
+ \forest@wrap@n@pgfmath@do{#1}{8}},
+}
+\def\forest@wrap@n@pgfmath@args#1#2#3#4#5#6#7#8#9{%
+ \forestmathparse{#1}\let\forest@wrap@arg@i\forestmathresult
+ \ifnum#9>1 \forestmathparse{#2}\let\forest@wrap@arg@ii\forestmathresult\fi
+ \ifnum#9>2 \forestmathparse{#3}\let\forest@wrap@arg@iii\forestmathresult\fi
+ \ifnum#9>3 \forestmathparse{#4}\let\forest@wrap@arg@iv\forestmathresult\fi
+ \ifnum#9>4 \forestmathparse{#5}\let\forest@wrap@arg@v\forestmathresult\fi
+ \ifnum#9>5 \forestmathparse{#6}\let\forest@wrap@arg@vi\forestmathresult\fi
+ \ifnum#9>6 \forestmathparse{#7}\let\forest@wrap@arg@vii\forestmathresult\fi
+ \ifnum#9>7 \forestmathparse{#8}\let\forest@wrap@arg@viii\forestmathresult\fi
+ \edef\forest@wrap@args{%
+ {\expandonce\forest@wrap@arg@i}
+ \ifnum#9>1 {\expandonce\forest@wrap@arg@ii}\fi
+ \ifnum#9>2 {\expandonce\forest@wrap@arg@iii}\fi
+ \ifnum#9>3 {\expandonce\forest@wrap@arg@iv}\fi
+ \ifnum#9>4 {\expandonce\forest@wrap@arg@v}\fi
+ \ifnum#9>5 {\expandonce\forest@wrap@arg@vi}\fi
+ \ifnum#9>6 {\expandonce\forest@wrap@arg@vii}\fi
+ \ifnum#9>7 {\expandonce\forest@wrap@arg@viii}\fi
+ }%
+}
+\def\forest@wrap@n@pgfmath@do#1#2{%
+ \ifcase#2\relax
+ \or\def\forest@wrap@code##1{#1}%
+ \or\def\forest@wrap@code##1##2{#1}%
+ \or\def\forest@wrap@code##1##2##3{#1}%
+ \or\def\forest@wrap@code##1##2##3##4{#1}%
+ \or\def\forest@wrap@code##1##2##3##4##5{#1}%
+ \or\def\forest@wrap@code##1##2##3##4##5##6{#1}%
+ \or\def\forest@wrap@code##1##2##3##4##5##6##7{#1}%
+ \or\def\forest@wrap@code##1##2##3##4##5##6##7##8{#1}%
+ \fi
+ \forest@wrap@pgfmath@args@@@wrapandpasson
+}
+% \end{macrocode}
+% The following macro is redefined by compat key |2.0.2-wrappgfmathargs|.
+% \begin{macrocode}
+\def\forest@wrap@pgfmath@args@@@wrapandpasson{%
+ \expandafter\expandafter\expandafter\forest@temp@toks
+ \expandafter\expandafter\expandafter{%
+ \expandafter\forest@wrap@code\forest@wrap@args}%
+ \expandafter\pgfkeysalso\expandafter{%
+ \expandafter\pgfkeyscurrentpath\expandafter=\expandafter{%
+ \the\forest@temp@toks}}%
+}
+% \end{macrocode}
+%
+% \subsection{.process}
+%
+% \begin{macrocode}
+\def\forest@process@catregime{} % filled by processor defs
+\forest@newarray\forest@process@left@ % processed args
+\forest@newarray\forest@process@right@ % unprocessed args
+\forest@newarray\forest@process@saved@ % used by instructions |S| and |U|
+\let\forest@process@savedtype\forestmathtype@none
+\forest@newglobalarray\forest@process@result@
+\newif\ifforest@process@returnarray@
+% \end{macrocode}
+% Processing instruction need not (but may) be enclosed in braces.
+% \begin{macrocode}
+\def\forest@process#1#2#{% #1 = true/false (should we return an array?)
+ % #2 = processing instructions (if non-empty),
+ % (initial) args follow
+ \ifblank{#2}{\forest@process@a{#1}}{\forest@process@a{#1}{#2}}%
+}
+\Inline\def\forest@process@a#1#2{%
+ \begingroup
+ \forest@process@left@clear
+ \forest@process@right@clear
+ \forest@process@saved@clear
+ \let\forest@process@savedtype\forestmathtype@generic
+ \csname forest@process@returnarray@#1\endcsname
+ \def\forest@topextend@next{%
+ \ExpandIfT{forestdebug}{%
+ \edef\forest@process@debug@args{\unexpanded{#2}}%
+ \forest@processor@debuginfo@template{Start "\unexpanded{#2}}%
+ }%
+ \forest@process@catregime
+ \endlinechar=-1
+ \scantokens{#2}%
+ \forest@process@finish
+ }%
+ \forest@process@right@topextend
+}
+\pgfkeys{%
+ /handlers/.process/.code={%
+ \forest@process{true}#1\forest@eov
+ \edef\forest@marshal{%
+ \noexpand\pgfkeysalso{\noexpand\pgfkeyscurrentpath=\forest@process@result@values}%
+ }\forest@marshal
+ },
+ /forest/copy command key={/handlers/.process}{/handlers/.process args},
+}
+\def\forest@process@finish{%
+ \ifforest@process@returnarray@
+ \forest@process@finish@array
+ \else
+ \forest@process@finish@single
+ \fi
+ \global\let\forest@process@result@type\forestmathresulttype
+ \ifforestdebugprocess\forest@process@debug@end\fi
+ \endgroup
+}
+\def\forest@process@finish@single{%
+ \edef\forest@temp{forest@process@finish@single@%
+ \the\numexpr\forest@process@left@N-\forest@process@left@M\relax
+ \the\numexpr\forest@process@right@N-\forest@process@right@M\relax
+ }%
+ \ifcsname\forest@temp\endcsname
+ \csname\forest@temp\endcsname
+ \global\let\forest@process@result\forest@temp
+ \else
+ \forest@process@lengtherror
+ \fi
+}
+\csdef{forest@process@finish@single@10}{\forest@process@left@toppop\forest@temp}
+\csdef{forest@process@finish@single@01}{\forest@process@right@toppop\forest@temp}
+\def\forest@process@finish@array{%
+ \forest@process@result@clear
+ \forest@temp@count\forest@process@left@M\relax
+ \forest@loop
+ \ifnum\forest@temp@count<\forest@process@left@N\relax
+ \forest@process@left@get@{\the\forest@temp@count}\forest@temp
+ \forest@process@result@letappend\forest@temp
+ \advance\forest@temp@count1
+ \forest@repeat
+ \forest@temp@count\forest@process@right@M\relax
+ \forest@loop
+ \ifnum\forest@temp@count<\forest@process@right@N\relax
+ \forest@process@right@get@{\the\forest@temp@count}\forest@temp
+ \forest@process@result@letappend\forest@temp
+ \advance\forest@temp@count1
+ \forest@repeat
+}
+% \end{macrocode}
+% Debugging and error messages.
+% \begin{macrocode}
+\ifforestdebug
+ \let\forest@process@d\forest@process@b
+ \def\forest@process@b#1\forest@eov{% save and print initial arguments
+ \edef\forest@process@debug@args{\unexpanded{#1}}%
+ \typeout{[forest .process] Start "\unexpanded{#1}"}%
+ \forest@process@d#1\forest@eov
+ }
+\fi
+\def\forest@process@debug@end{%
+ \typeout{[forest .process] End "\expandonce{\forest@process@debug@args}" -> "\forest@process@left@values\forest@process@right@values"}%
+}
+\def\forest@process@lengtherror{%
+ \PackageError{forest}{%
+ The ".process" expression was expected to evaluate to a single argument,
+ but the result is \the\forest@process@result@N
+ \space items long.}{}%
+}
+% \end{macrocode}
+% Define the definer of processors. First, deal with the catcode of the instruction char.
+% \begin{macrocode}
+\def\forest@def@processor#1{%
+ {%
+ \def\forest@dp@double##1{%
+ \gdef\forest@global@temp{\forest@def@processor@{#1}{##1}}%
+ }%
+ \let\\\forest@dp@double
+ \catcode`#1=13
+ \scantokens{\\#1}%
+ }%
+ \forest@global@temp
+}
+\def\forest@def@processor@#1#2{%
+ % #1 = instruction char (normal catcode), #2 = instruction char (active)
+ % #3 = default n (optional numeric arg, which precedes any other args;
+ % if the default is empty, this means no optional n)
+ % #4 = args spec,
+ % #5 = code
+ \eappto\forest@process@catregime{%
+ \unexpanded{\let#2}\expandonce{\csname forest@processor@#1\endcsname}%
+ \unexpanded{\catcode`#1=13 }%
+ }%
+ \def\forest@def@processor@inschar{#1}%
+ \forest@def@processor@@
+}
+% \end{macrocode}
+% If |#1| is non-empty, the processor accepts the optional numeric argument: |#1| is the default.
+% \begin{macrocode}
+\def\forest@def@processor@@#1{%
+ \ifstrempty{#1}{%
+ \forest@def@processor@@non
+ }{%
+ \def\forest@def@processor@@default@n{#1}%
+ \forest@def@processor@@n
+ }%
+}
+% \end{macrocode}
+% We need |\relax| below because the next instruction character might get expanded when assigning the optional numerical argument which is not there.
+%
+% No optional n:
+% \begin{macrocode}
+\def\forest@def@processor@@non#1#2{% #1=args spec, #2=code
+ \csedef{forest@processor@\forest@def@processor@inschar}#1{%
+ \relax %% we need this (see above)
+ \unexpanded{#2}%
+ \expandafter\forest@def@processor@debuginfo\expandafter{%
+ \expandafter"\forest@def@processor@inschar"\ifstrempty{#1}{}{(#1)}}%
+ \ignorespaces
+ }%
+}
+% \end{macrocode}
+% Optional n: |*| after the given default means that the operation should be repeated n times.
+% \begin{macrocode}
+\def\forest@def@processor@@n{%
+ \@ifnextchar*%
+ {\forest@temptrue\forest@def@processor@@n@}%
+ {\forest@tempfalse\forest@def@processor@@n@@}%
+}
+\def\forest@def@processor@@n@*{\forest@def@processor@@n@@}
+\def\forest@def@processor@@n@@#1#2{% #1=args spec, #2=code
+ \csedef{forest@processor@\forest@def@processor@inschar}{%
+ \relax %% we need this (see above)
+ \noexpand\forestprocess@get@n
+ {\forest@def@processor@@default@n}%
+ \expandonce{\csname forest@processor@\forest@def@processor@inschar @\endcsname}%
+ }%
+ \ifforest@temp
+ \csedef{forest@processor@\forest@def@processor@inschar @}{%
+ \noexpand\forest@repeat@n@times{\forest@process@n}{%
+ \expandonce{\csname forest@processor@\forest@def@processor@inschar @rep\endcsname}%
+ }%
+ }%
+ \fi
+ \edef\forest@temp{%
+ \forest@def@processor@inschar
+ \ifforest@temp\else\noexpand\the\forest@process@n\fi
+ "}%
+ \csedef{forest@processor@\forest@def@processor@inschar @\ifforest@temp rep\fi}#1{%
+ \unexpanded{#2}%
+ \expandafter\forest@def@processor@debuginfo\expandafter{%
+ \forest@temp
+ \ifstrempty{#1}{}{(#1)}}%
+ }%
+}
+\def\forest@def@processor@debuginfo#1{% #1 = instruction call
+ \ifforestdebug
+ \expandonce{\forest@processor@debuginfo@template{\space\space After #1}}%
+ \fi
+}
+\def\forest@processor@debuginfo@template#1{%
+ \ifforestdebugprocess
+ \edef\forest@temp@left{\forest@process@left@values}%
+ \edef\forest@temp@right{\forest@process@right@values}%
+ \edef\forest@temp@saved{\forest@process@saved@values}%
+ \typeout{[forest .process] #1: left="\expandonce{\forest@temp@left}", right="\expandonce{\forest@temp@right}", saved="\expandonce{\forest@temp@saved}", type=\forestmathresulttype}%
+ \fi
+}
+% \end{macrocode}
+% A helper macro which puts the optional numeric argument into count |\forest@process@n| (default being |#1|) and then executes control sequence |#2|.
+% \begin{macrocode}
+\newcount\forest@process@n
+\def\forestprocess@get@n#1#2{%
+ \def\forestprocess@default@n{#1}%
+ \let\forestprocess@after@get@n@#2%
+ \afterassignment\forestprocess@get@n@\forest@process@n=0%
+}
+\def\forestprocess@get@n@{%
+ \ifnum\forest@process@n=0
+ \forest@process@n\forestprocess@default@n\relax
+ \fi
+ \forestprocess@after@get@n@
+}
+% \end{macrocode}
+%
+% Definitions of processing instructions. Processors should be defined using |\forest@def@processor|. If they take arguments: yes, they follow, but they were scanned in |\forest@process@catregime|. Processors should manipulate arrays |\forest@process@left@| and |\forest@process@right|. They should set |\def\forestmathresulttype| to |_| not defined, |n| number, |d| dimension, |P| pgfmath or |t| text.
+% \begin{macrocode}
+\forest@def@processor{_}{1}*{}{% no processing, no type
+ \forest@process@right@bottompop\forest@temp
+ \forest@process@left@letappend\forest@temp
+}
+\forest@def@processor{n}{1}*{}{% numexpr
+ \forest@process@right@bottompop\forest@temp
+ \forest@process@left@esetappend{\number\numexpr\forest@temp}%
+ \let\forestmathresulttype\forestmathtype@count
+}
+\forest@def@processor{d}{1}*{}{% dimexpr
+ \forest@process@right@bottompop\forest@temp
+ \forest@process@left@esetappend{\the\dimexpr\forest@temp}%
+ \let\forestmathresulttype\forestmathtype@dimen
+}
+\forest@def@processor{P}{1}*{}{% pgfmath expression
+ \forest@process@right@bottompop\forest@temp
+ \pgfmathparse{\forest@temp}%
+ \forest@process@left@letappend\pgfmathresult
+ \let\forestmathresulttype\forestmathtype@unitless
+}
+\forest@def@processor{p}{1}*{}{% process expression
+ \forest@process@right@bottompop\forest@temp@a
+ \def\forest@temp{\forest@process{true}}%
+ \expandafter\forest@temp\forest@temp@a\forest@eov
+ \let\forest@topextend@next\relax
+ \edef\forest@temp{\forest@process@result@values}%
+ \expandafter\forest@process@left@topextend\forest@temp\forest@eov
+ \let\forestmathresulttype\forest@process@result@type
+}
+\forest@def@processor{t}{1}*{}{% text
+ \forest@process@right@bottompop\forest@temp
+ \forest@process@left@letappend\forest@temp
+ \let\forestmathresulttype\forestmathtype@textasc
+}
+\forest@def@processor{-}{}{}{% toggle ascending/descending
+ \forest@process@left@toppop\forestmathresult
+ \csname forest@processor@-@\forestmathresulttype\endcsname
+ \forest@process@left@letappend\forestmathresult
+}
+\cslet{forest@processor@-@\forestmathtype@generic}\relax
+\csdef{forest@processor@-@\forestmathtype@count}{%
+ \forestmathadd{\forestmathzero}{-\forestmathresult}}
+\csletcs{forest@processor@-@\forestmathtype@dimen}
+ {forest@processor@-@\forestmathtype@count}
+\csletcs{forest@processor@-@\forestmathtype@unitless}
+ {forest@processor@-@\forestmathtype@count}
+\csdef{forest@processor@-@\forestmathtype@textasc}{%
+ \let\forestmathresulttype\forestmathtype@textdesc}
+\csdef{forest@processor@-@\forestmathtype@textdesc}{%
+ \let\forestmathresulttype\forestmathtype@textasc}
+
+\forest@def@processor{c}{}{}{% to lowercase
+ \forest@process@right@bottompop\forest@temp
+ \expandafter\lowercase\expandafter{\expandafter\def\expandafter\forest@temp\expandafter{\forest@temp}}%
+ \forest@process@left@letappend\forest@temp
+}
+\forest@def@processor{C}{}{}{% to uppercase
+ \forest@process@right@bottompop\forest@temp
+ \expandafter\uppercase\expandafter{\expandafter\def\expandafter\forest@temp\expandafter{\forest@temp}}%
+ \forest@process@left@letappend\forest@temp
+}
+% \end{macrocode}
+% Expansions:
+% \begin{macrocode}
+\forest@def@processor{x}{}{}{% expand
+ \forest@process@right@bottompop\forest@temp
+ \forest@process@left@esetappend{\forest@temp}%
+ \let\forestmathresulttype\forestmathtype@generic
+}
+\forest@def@processor{o}{1}{}{% expand once (actually, \forest@count@n times)
+ \forest@process@right@bottompop\forest@temp
+ \forest@repeat@n@times{\forest@process@n}{%
+ \expandafter\expandafter\expandafter\def
+ \expandafter\expandafter\expandafter\forest@temp
+ \expandafter\expandafter\expandafter{\forest@temp}%
+ }%
+ \expandafter\forest@process@left@setappend\expandafter{\forest@temp}%
+ \let\forestmathresulttype\forestmathtype@generic
+}
+% \end{macrocode}
+% Access to \foRest; data.
+% \begin{macrocode}
+\forest@def@processor{O}{1}*{}{% option
+ \forest@process@right@bottompop\forest@temp
+ \expandafter\forestRNO@getvalueandtype\expandafter{\forest@temp}\forest@tempvalue\forest@temp@type
+ \let\forestmathresulttype\forest@temp@type
+ \forest@process@left@letappend\forest@tempvalue
+}
+\forest@def@processor{R}{1}*{}{% register
+ \forest@process@right@bottompop\forest@temp
+ \forestrget{\forest@temp}\forest@tempvalue
+ \forest@process@left@letappend\forest@tempvalue
+ \pgfkeysgetvalue{/forest/\forest@temp/@type}\forest@temp@type
+ \let\forestmathresulttype\forest@temp@type
+}
+% \end{macrocode}
+% The following processors muck about with the argument / result list.
+% \begin{macrocode}
+\forest@def@processor{+}{1}*{}{% join processors = pop one from result
+ \forest@process@left@toppop\forest@temp
+ \forest@process@right@letprepend\forest@temp
+}
+\forest@def@processor{u}{}{}{% ungroup: remove braces and leave in the argument list
+ \forest@process@right@bottompop\forest@temp
+ \forest@temparray@clear
+ \let\forestmathresulttype\forestmathtype@generic
+ \let\forest@topextend@next\forest@processor@u@
+ \expandafter\forest@temparray@topextend\forest@temp\forest@eov
+}
+\def\forest@processor@u@{%
+ \forest@loop
+ \ifnum\forest@temparray@N>0
+ \forest@temparray@toppop\forest@temp
+ \expandafter\forest@process@right@setprepend\expandafter{\forest@temp}%
+ \forest@repeat
+}
+\def\forest@process@check@mn#1#2#3#4{%
+ % #1 = processor, #2 = given n, #3/#4 = lower/upper bound (inclusive)
+ \ifnum#3>#2\relax
+ \forest@process@check@n@error{#1}{#2}{#3<=}{<=#4}%
+ \else
+ \ifnum#4<#2\relax
+ \forest@process@check@n@error{#1}{#2}{#3<=}{<=#4}%
+ \fi
+ \fi
+}
+\def\forest@process@check@m#1#2#3{%
+ % #1 = processor, #2 = given n, #3 = lower bound (inclusive)
+ \ifnum#2<#3\relax
+ \forest@process@check@n@error{#1}{#2}{#3<=}{}%
+ \fi
+}
+\def\forest@process@check@n@error#1#2#3#4{%
+ \PackageError{forest}{'.process' instruction '#1' requires a numeric modifier #3n#4, but n="#2" was given.}{}%
+}
+\newif\ifforest@process@W
+\forest@def@processor{w}{1}{}{% consuming wrap: first test 1<=#1<=9
+ \forest@process@Wtrue
+ \forest@process@check@mn{w}{0\the\forest@process@n}{1}{9}%
+ \expandafter\forest@processor@wW@\expandafter{\the\forest@process@n}%
+}
+\forest@def@processor{W}{1}{}{% nonconsuming wrap: first test 1<=#1<=9
+ \forest@process@Wfalse
+ \forest@process@check@mn{W}{0\the\forest@process@n}{1}{9}%
+ \expandafter\forest@processor@wW@\expandafter{\the\forest@process@n}%
+}
+\def\forest@processor@wW@#1{%
+ \forest@process@left@checkindex{\forest@process@left@N-#1}%
+ \edef\forest@marshal{%
+ \edef\noexpand\forest@temp@args{%
+ \noexpand\forest@process@left@valuesfromrange
+ {\number\numexpr\forest@process@left@N-#1}%
+ {\the\forest@process@left@N}%
+ }%
+ }\forest@marshal
+ \ifforest@process@W
+ \advance\forest@process@left@N-#1\relax
+ \fi
+ \forest@process@right@bottompop\forest@temp@macrobody
+ \expandafter\forest@def@n\expandafter\forest@process@temp@macro\expandafter{\expandafter#1\expandafter}\expandafter{\forest@temp@macrobody}%
+ \expandafter\expandafter\expandafter\forest@process@left@setappend\expandafter\expandafter\expandafter{\expandafter\forest@process@temp@macro\forest@temp@args}%
+ \let\forestmathresulttype\forestmathtype@generic
+}
+\def\forest@def@n#1#2{\csname forest@def@n@#2\endcsname#1}
+\csdef{forest@def@n@1}#1{\def#1##1}
+\csdef{forest@def@n@2}#1{\def#1##1##2}
+\csdef{forest@def@n@3}#1{\def#1##1##2##3}
+\csdef{forest@def@n@4}#1{\def#1##1##2##3##4}
+\csdef{forest@def@n@5}#1{\def#1##1##2##3##4##5}
+\csdef{forest@def@n@6}#1{\def#1##1##2##3##4##5##6}
+\csdef{forest@def@n@7}#1{\def#1##1##2##3##4##5##6##7}
+\csdef{forest@def@n@8}#1{\def#1##1##2##3##4##5##6##7##8}
+\csdef{forest@def@n@9}#1{\def#1##1##2##3##4##5##6##7##8##9}
+% \end{macrocode}
+% Save last |n| arguments from the left side into a special place. |s| deletes them from the left side, |S| keeps them there as well.
+% \begin{macrocode}
+\forest@def@processor{s}{1}{}{%
+ \forest@temptrue % delete the originals
+ \expandafter\forest@processor@save\expandafter{%
+ \the\numexpr\forest@process@left@N-\forest@process@n}}
+\forest@def@processor{S}{1}{}{%
+ \forest@tempfalse % keep the originals
+ \expandafter\forest@processor@save\expandafter{%
+ \the\numexpr\forest@process@left@N-\forest@process@n}}
+\def\forest@processor@save#1{%
+ \forest@process@left@checkindex{#1}%
+ \forest@temp@count#1
+ \forest@loop
+ \ifnum\forest@temp@count<\forest@process@left@N\relax
+ \forest@process@left@get@{\the\forest@temp@count}\forest@temp
+ \forest@process@saved@letappend\forest@temp
+ \advance\forest@temp@count+1
+ \forest@repeat
+ \let\forest@process@savedtype\forestmathresulttype
+ \ifforest@temp
+ \forest@process@left@N=#1
+ \fi
+}
+% \end{macrocode}
+% Load |n| arguments from the end of the special place to the left side. If $n=0$, load the entire special place. |l| deletes the args from the special place, |L| keeps them there as well.
+% \begin{macrocode}
+\forest@def@processor{l}{0}{}{%
+ \forest@temptrue
+ \forest@processor@U@@
+}
+\forest@def@processor{L}{0}{}{%
+ \forest@tempfalse
+ \forest@processor@U@@
+}
+
+\def\forest@processor@U@@{%
+ \ifnum\forest@process@n=0
+ \forest@process@n\forest@process@saved@N\relax
+ \fi
+ \expandafter\forest@processor@U@@@\expandafter{%
+ \the\numexpr\forest@process@saved@N-\forest@process@n}%
+}
+\def\forest@processor@U@@@#1{%
+ \forest@temp@count#1
+ \forest@loop
+ \ifnum\forest@temp@count<\forest@process@saved@N\relax
+ \forest@process@saved@get@{\the\forest@temp@count}\forest@temp
+ \forest@process@left@letappend\forest@temp
+ \advance\forest@temp@count1
+ \forest@repeat
+ \let\forestmathresulttype\forest@process@savedtype
+ \ifforest@temp
+ \let\forest@process@savedtype\forestmathtype@none
+ \forest@process@saved@N#1
+ \fi
+}
+% \end{macrocode}
+% Boolean operations:
+% \begin{macrocode}
+\forest@def@processor{&}{2}{}{% and
+ \def\forest@tempa{1}%
+ \forest@repeat@n@times{\forest@process@n}{%
+ \forest@process@left@toppop\forest@tempb
+ \edef\forest@tempa{\ifnum10<\forest@tempa\forest@tempb\space 1\else0\fi}%
+ }%
+ \forest@process@left@esetappend{\forest@tempa}%
+ \let\forestmathresulttype\forestmathtype@count
+}
+\forest@def@processor{|}{2}{}{% or
+ \def\forest@tempa{0}%
+ \forest@repeat@n@times{\forest@process@n}{%
+ \forest@process@left@toppop\forest@tempb
+ \edef\forest@tempa{\ifnum0=\forest@tempa\forest@tempb\space 0\else1\fi}%
+ }%
+ \forest@process@left@esetappend{\forest@tempa}%
+ \let\forestmathresulttype\forestmathtype@count
+}
+\forest@def@processor{!}{}{}{% not
+ \forest@process@left@toppop\forest@temp
+ \forest@process@left@esetappend{\ifnum0=\forest@temp\space 1\else0\fi}%
+ \let\forestmathresulttype\forestmathtype@count
+}
+\forest@def@processor{?}{}{}{%
+ \forest@process@left@toppop\forest@temp
+ \forest@process@right@bottompop\forest@tempa
+ \forest@process@right@bottompop\forest@tempb
+ \ifnum\forest@temp=0
+ \forest@process@right@letprepend\forest@tempb
+ \else
+ \forest@process@right@letprepend\forest@tempa
+ \fi
+ \let\forestmathresulttype\forestmathtype@generic
+}
+% \end{macrocode}
+% Comparisons. They automatically determine the type (number, dimen, other) of the arguments, by checking what the last processing instruction was.
+% \begin{macrocode}
+\forest@def@processor{=}{}{}{%
+ \forest@process@left@toppop\forest@tempa
+ \forest@process@left@toppop\forest@tempb
+ \forest@process@left@esetappend{\ifx\forest@tempa\forest@tempb 1\else0\fi}%
+ \let\forestmathresulttype\forestmathtype@count
+}
+\forest@def@processor{<}{}{}{%
+ \forest@process@left@toppop\forest@tempb
+ \forest@process@left@toppop\forest@tempa
+ \ifx\forestmathresulttype\forestmathtype@generic
+ \forest@cmp@error\forest@tempa\forest@tempb
+ \else
+ \forestmathlt{\forest@tempa}{\forest@tempb}%
+ \forest@process@left@esetappend{\forestmathresult}%
+ \fi
+}
+\forest@def@processor{>}{}{}{%
+ \forest@process@left@toppop\forest@tempb
+ \forest@process@left@toppop\forest@tempa
+ \ifx\forestmathresulttype\forestmathtype@generic
+ \forest@cmp@error\forest@tempa\forest@tempb
+ \else
+ \forestmathgt{\forest@tempa}{\forest@tempb}%
+ \forest@process@left@esetappend{\forestmathresult}%
+ \fi
+}
+% \end{macrocode}
+% Various.
+% \begin{macrocode}
+\forest@def@processor{r}{}{}{% reverse keylist
+ \forest@process@right@bottompop\forest@temp
+ \expandafter\forest@processor@r@\expandafter{\forest@temp}%
+}
+\def\forest@processor@r@#1{%
+ \forest@process@left@esetappend{}%
+ \def\forest@tempcomma{}%
+ \pgfqkeys{/forest}{split={#1}{,}{process@rk}}%
+ \let\forestmathresulttype\forestmathtype@generic
+}
+\forestset{%
+ process@rk/.code={%
+ \forest@process@left@toppop\forest@temp
+ \forest@temp@toks{#1}%
+ \forest@process@left@esetappend{\the\forest@temp@toks\forest@tempcomma\expandonce{\forest@temp}}%
+ \def\forest@tempcomma{,}%
+ }%
+}
+% \end{macrocode}
+%
+% \subsubsection{Registers}
+% Register declaration mechanism is an adjusted copy-paste of the option declaration mechanism.
+% \begin{macrocode}
+\def\forest@pgfmathhelper@register@toks#1#2{% #1 is discarded: it is present only for analogy with options
+ \forestrget{#2}\pgfmathresult
+}
+\def\forest@pgfmathhelper@register@dimen#1#2{%
+ \forestrget{#2}\forest@temp
+ \edef\pgfmathresult{\expandafter\Pgf@geT\forest@temp}%
+}
+\def\forest@pgfmathhelper@register@count#1#2{%
+ \forestrget{#2}\pgfmathresult
+}
+\def\forest@declareregisterhandler#1#2{%#1=handler for specific type,#2=option name
+ \pgfkeyssetvalue{/forest/#2/node@or@reg}{}% empty = register (node id=node)
+ \forest@convert@others@to@underscores{#2}\forest@pgfmathoptionname
+ \edef\forest@marshal{%
+ \noexpand#1{/forest/#2}{/forest}{#2}{\forest@pgfmathoptionname}%
+ }\forest@marshal
+}
+\def\forest@declaretoksregister@handler#1#2#3#4{% #1=key,#2=path,#3=name,#4=pgfmathname
+ \forest@declaretoksregister@handler@A{#1}{#2}{#3}{#4}{}%
+}
+\def\forest@declarekeylistregister@handler#1#2#3#4{% #1=key,#2=path,#3=name,#4=pgfmathname
+ \forest@declaretoksregister@handler@A{#1}{#2}{#3}{#4}{,}%
+ \forest@copycommandkey{#1}{#1'}%
+ \pgfkeyssetvalue{#1'/option@name}{#3}%
+ \forest@copycommandkey{#1+}{#1}%
+ \pgfkeysalso{#1-/.code={%
+ \forest@fornode{}{%
+ \forest@node@removekeysfromkeylist{##1}{#3}%
+ }}}%
+ \pgfkeyssetvalue{#1-/option@name}{#3}%
+}
+\def\forest@declaretoksregister@handler@A#1#2#3#4#5{% #1=key,#2=path,#3=name,#4=pgfmathname,#5=infix
+ \pgfkeysalso{%
+ #1/.code={\forestrset{#3}{##1}},
+ #2/if #3/.code n args={3}{%
+ \forestrget{#3}\forest@temp@option@value
+ \edef\forest@temp@compared@value{\unexpanded{##1}}%
+ \ifx\forest@temp@option@value\forest@temp@compared@value
+ \pgfkeysalso{##2}%
+ \else
+ \pgfkeysalso{##3}%
+ \fi
+ },
+ #2/if in #3/.code n args={3}{%
+ \forestrget{#3}\forest@temp@option@value
+ \edef\forest@temp@compared@value{\unexpanded{##1}}%
+ \expandafter\expandafter\expandafter\pgfutil@in@\expandafter\expandafter\expandafter{\expandafter\forest@temp@compared@value\expandafter}\expandafter{\forest@temp@option@value}%
+ \ifpgfutil@in@
+ \pgfkeysalso{##2}%
+ \else
+ \pgfkeysalso{##3}%
+ \fi
+ },
+ }%
+ \ifstrempty{#5}{%
+ \pgfkeysalso{%
+ #1+/.code={\forestrappto{#3}{#5##1}},
+ #2/+#3/.code={\forestrpreto{#3}{##1#5}},
+ }%
+ }{%
+ \pgfkeysalso{%
+ #1+/.code={%
+ \forestrget{#3}\forest@temp
+ \ifdefempty{\forest@temp}{%
+ \forestrset{#3}{##1}%
+ }{%
+ \forestrappto{#3}{#5##1}%
+ }%
+ },
+ #2/+#3/.code={%
+ \forestrget{#3}\forest@temp
+ \ifdefempty{\forest@temp}{%
+ \forestrset{#3}{##1}%
+ }{%
+ \forestrpreto{#3}{##1#5}%
+ }%
+ }%
+ }%
+ }%
+ \pgfkeyssetvalue{#1/option@name}{#3}%
+ \pgfkeyssetvalue{#1+/option@name}{#3}%
+ \pgfkeyssetvalue{#2/+#3/option@name}{#3}%
+ \pgfkeyslet{#1/@type}\forestmathtype@generic % for .process & co
+ \pgfmathdeclarefunction{#4}{1}{\forest@pgfmathhelper@register@toks{##1}{#3}}%
+}
+\def\forest@declareautowrappedtoksregister@handler#1#2#3#4{% #1=key,#2=path,#3=name,#4=pgfmathname,#5=infix
+ \forest@declaretoksregister@handler{#1}{#2}{#3}{#4}%
+ \forest@copycommandkey{#1}{#1'}%
+ \pgfkeysalso{#1/.style={#1'/.wrap value={##1}}}%
+ \pgfkeyssetvalue{#1'/option@name}{#3}%
+ \forest@copycommandkey{#1+}{#1+'}%
+ \pgfkeysalso{#1+/.style={#1+'/.wrap value={##1}}}%
+ \pgfkeyssetvalue{#1+'/option@name}{#3}%
+ \forest@copycommandkey{#2/+#3}{#2/+#3'}%
+ \pgfkeysalso{#2/+#3/.style={#2/+#3'/.wrap value={##1}}}%
+ \pgfkeyssetvalue{#2/+#3'/option@name}{#3}%
+}
+\def\forest@declarereadonlydimenregister@handler#1#2#3#4{% #1=key,#2=path,#3=name,#4=pgfmathname
+ \pgfkeysalso{%
+ #2/if #3/.code n args={3}{%
+ \forestrget{#3}\forest@temp@option@value
+ \ifdim\forest@temp@option@value=##1\relax
+ \pgfkeysalso{##2}%
+ \else
+ \pgfkeysalso{##3}%
+ \fi
+ },
+ #2/if #3</.code n args={3}{%
+ \forestrget{#3}\forest@temp@option@value
+ \ifdim\forest@temp@option@value>##1\relax
+ \pgfkeysalso{##3}%
+ \else
+ \pgfkeysalso{##2}%
+ \fi
+ },
+ #2/if #3>/.code n args={3}{%
+ \forestrget{#3}\forest@temp@option@value
+ \ifdim\forest@temp@option@value<##1\relax
+ \pgfkeysalso{##3}%
+ \else
+ \pgfkeysalso{##2}%
+ \fi
+ },
+ }%
+ \pgfkeyslet{#1/@type}\forestmathtype@dimen % for .process & co
+ \pgfmathdeclarefunction{#4}{1}{\forest@pgfmathhelper@register@dimen{##1}{#3}}%
+}
+\def\forest@declaredimenregister@handler#1#2#3#4{% #1=key,#2=path,#3=name,#4=pgfmathname
+ \forest@declarereadonlydimenregister@handler{#1}{#2}{#3}{#4}%
+ \pgfkeysalso{%
+ #1/.code={%
+ \forestmathsetlengthmacro\forest@temp{##1}%
+ \forestrlet{#3}\forest@temp
+ },
+ #1+/.code={%
+ \forestmathsetlengthmacro\forest@temp{##1}%
+ \pgfutil@tempdima=\forestrve{#3}
+ \advance\pgfutil@tempdima\forest@temp\relax
+ \forestreset{#3}{\the\pgfutil@tempdima}%
+ },
+ #1-/.code={%
+ \forestmathsetlengthmacro\forest@temp{##1}%
+ \pgfutil@tempdima=\forestrve{#3}
+ \advance\pgfutil@tempdima-\forest@temp\relax
+ \forestreset{#3}{\the\pgfutil@tempdima}%
+ },
+ #1*/.style={%
+ #1={#4()*(##1)}%
+ },
+ #1:/.style={%
+ #1={#4()/(##1)}%
+ },
+ #1'/.code={%
+ \pgfutil@tempdima=##1\relax
+ \forestreset{#3}{\the\pgfutil@tempdima}%
+ },
+ #1'+/.code={%
+ \pgfutil@tempdima=\forestrve{#3}\relax
+ \advance\pgfutil@tempdima##1\relax
+ \forestreset{#3}{\the\pgfutil@tempdima}%
+ },
+ #1'-/.code={%
+ \pgfutil@tempdima=\forestrve{#3}\relax
+ \advance\pgfutil@tempdima-##1\relax
+ \forestreset{#3}{\the\pgfutil@tempdima}%
+ },
+ #1'*/.style={%
+ \pgfutil@tempdima=\forestrve{#3}\relax
+ \multiply\pgfutil@tempdima##1\relax
+ \forestreset{#3}{\the\pgfutil@tempdima}%
+ },
+ #1':/.style={%
+ \pgfutil@tempdima=\forestrve{#3}\relax
+ \divide\pgfutil@tempdima##1\relax
+ \forestreset{#3}{\the\pgfutil@tempdima}%
+ },
+ }%
+ \pgfkeyssetvalue{#1/option@name}{#3}%
+ \pgfkeyssetvalue{#1+/option@name}{#3}%
+ \pgfkeyssetvalue{#1-/option@name}{#3}%
+ \pgfkeyssetvalue{#1*/option@name}{#3}%
+ \pgfkeyssetvalue{#1:/option@name}{#3}%
+ \pgfkeyssetvalue{#1'/option@name}{#3}%
+ \pgfkeyssetvalue{#1'+/option@name}{#3}%
+ \pgfkeyssetvalue{#1'-/option@name}{#3}%
+ \pgfkeyssetvalue{#1'*/option@name}{#3}%
+ \pgfkeyssetvalue{#1':/option@name}{#3}%
+}
+\def\forest@declarereadonlycountregister@handler#1#2#3#4{% #1=key,#2=path,#3=name,#4=pgfmathname
+ \pgfkeysalso{
+ #2/if #3/.code n args={3}{%
+ \forestrget{#3}\forest@temp@option@value
+ \ifnum\forest@temp@option@value=##1\relax
+ \pgfkeysalso{##2}%
+ \else
+ \pgfkeysalso{##3}%
+ \fi
+ },
+ #2/if #3</.code n args={3}{%
+ \forestrget{#3}\forest@temp@option@value
+ \ifnum\forest@temp@option@value>##1\relax
+ \pgfkeysalso{##3}%
+ \else
+ \pgfkeysalso{##2}%
+ \fi
+ },
+ #2/if #3>/.code n args={3}{%
+ \forestrget{#3}\forest@temp@option@value
+ \ifnum\forest@temp@option@value<##1\relax
+ \pgfkeysalso{##3}%
+ \else
+ \pgfkeysalso{##2}%
+ \fi
+ },
+ }%
+ \pgfkeyslet{#1/@type}\forestmathtype@count % for .process & co
+ \pgfmathdeclarefunction{#4}{1}{\forest@pgfmathhelper@register@count{##1}{#3}}%
+}
+\def\forest@declarecountregister@handler#1#2#3#4{% #1=key,#2=path,#3=name,#4=pgfmathname
+ \forest@declarereadonlycountregister@handler{#1}{#2}{#3}{#4}%
+ \pgfkeysalso{
+ #1/.code={%
+ \forestmathtruncatemacro\forest@temp{##1}%
+ \forestrlet{#3}\forest@temp
+ },
+ #1+/.code={%
+ \forestmathtruncatemacro\forest@temp{##1}%
+ \c@pgf@counta=\forestrve{#3}\relax
+ \advance\c@pgf@counta\forest@temp\relax
+ \forestreset{#3}{\the\c@pgf@counta}%
+ },
+ #1-/.code={%
+ \forestmathtruncatemacro\forest@temp{##1}%
+ \c@pgf@counta=\forestrve{#3}\relax
+ \advance\c@pgf@counta-\forest@temp\relax
+ \forestreset{#3}{\the\c@pgf@counta}%
+ },
+ #1*/.code={%
+ \forestmathtruncatemacro\forest@temp{##1}%
+ \c@pgf@counta=\forestrve{#3}\relax
+ \multiply\c@pgf@counta\forest@temp\relax
+ \forestreset{#3}{\the\c@pgf@counta}%
+ },
+ #1:/.code={%
+ \forestmathtruncatemacro\forest@temp{##1}%
+ \c@pgf@counta=\forestrve{#3}\relax
+ \divide\c@pgf@counta\forest@temp\relax
+ \forestreset{#3}{\the\c@pgf@counta}%
+ },
+ #1'/.code={%
+ \c@pgf@counta=##1\relax
+ \forestreset{#3}{\the\c@pgf@counta}%
+ },
+ #1'+/.code={%
+ \c@pgf@counta=\forestrve{#3}\relax
+ \advance\c@pgf@counta##1\relax
+ \forestreset{#3}{\the\c@pgf@counta}%
+ },
+ #1'-/.code={%
+ \c@pgf@counta=\forestrve{#3}\relax
+ \advance\c@pgf@counta-##1\relax
+ \forestreset{#3}{\the\c@pgf@counta}%
+ },
+ #1'*/.style={%
+ \c@pgf@counta=\forestrve{#3}\relax
+ \multiply\c@pgf@counta##1\relax
+ \forestreset{#3}{\the\c@pgf@counta}%
+ },
+ #1':/.style={%
+ \c@pgf@counta=\forestrve{#3}\relax
+ \divide\c@pgf@counta##1\relax
+ \forestreset{#3}{\the\c@pgf@counta}%
+ },
+ }%
+ \pgfkeyssetvalue{#1/option@name}{#3}%
+ \pgfkeyssetvalue{#1+/option@name}{#3}%
+ \pgfkeyssetvalue{#1-/option@name}{#3}%
+ \pgfkeyssetvalue{#1*/option@name}{#3}%
+ \pgfkeyssetvalue{#1:/option@name}{#3}%
+ \pgfkeyssetvalue{#1'/option@name}{#3}%
+ \pgfkeyssetvalue{#1'+/option@name}{#3}%
+ \pgfkeyssetvalue{#1'-/option@name}{#3}%
+ \pgfkeyssetvalue{#1'*/option@name}{#3}%
+ \pgfkeyssetvalue{#1':/option@name}{#3}%
+}
+\def\forest@declarebooleanregister@handler#1#2#3#4{% #1=key,#2=path,#3=name,#4=pgfmathname
+ \pgfkeysalso{%
+ #1/.code={%
+ \ifcsdef{forest@bh@\detokenize{##1}}{%
+ \letcs\forest@temp{forest@bh@\detokenize{##1}}%
+ }{%
+ \forestmathtruncatemacro\forest@temp{##1}%
+ \ifx\forest@temp0\else\def\forest@temp{1}\fi
+ }%
+ \forestrlet{#3}\forest@temp
+ },
+ #1/.default=1,
+ #2/not #3/.code={\forestrset{#3}{0}},
+ #2/if #3/.code 2 args={%
+ \forestrget{#3}\forest@temp@option@value
+ \ifnum\forest@temp@option@value=1
+ \pgfkeysalso{##1}%
+ \else
+ \pgfkeysalso{##2}%
+ \fi
+ },
+ }%
+ \pgfkeyssetvalue{#1/option@name}{#3}%
+ \pgfkeyslet{#1/@type}\forestmathtype@count % for .process & co
+ \pgfmathdeclarefunction{#4}{1}{\forest@pgfmathhelper@register@count{##1}{#3}}%
+}
+\forestset{
+ declare toks register/.code={%
+ \forest@declareregisterhandler\forest@declaretoksregister@handler{#1}%
+ \forestset{#1={}}%
+ },
+ declare autowrapped toks register/.code={%
+ \forest@declareregisterhandler\forest@declareautowrappedtoksregister@handler{#1}%
+ \forestset{#1={}}%
+ },
+ declare keylist register/.code={%
+ \forest@declareregisterhandler\forest@declarekeylistregister@handler{#1}%
+ \forestset{#1'={}}%
+ },
+ declare dimen register/.code={%
+ \forest@declareregisterhandler\forest@declaredimenregister@handler{#1}%
+ \forestset{#1'=0pt}%
+ },
+ declare count register/.code={%
+ \forest@declareregisterhandler\forest@declarecountregister@handler{#1}%
+ \forestset{#1'=0}%
+ },
+ declare boolean register/.code={%
+ \forest@declareregisterhandler\forest@declarebooleanregister@handler{#1}%
+ \forestset{#1=0}%
+ },
+}
+% \end{macrocode}
+% Declare some temporary registers.
+% \begin{macrocode}
+\forestset{
+ declare toks register=temptoksa,temptoksa={},
+ declare toks register=temptoksb,temptoksb={},
+ declare toks register=temptoksc,temptoksc={},
+ declare toks register=temptoksd,temptoksd={},
+ declare keylist register=tempkeylista,tempkeylista'={},
+ declare keylist register=tempkeylistb,tempkeylistb'={},
+ declare keylist register=tempkeylistc,tempkeylistc'={},
+ declare keylist register=tempkeylistd,tempkeylistd'={},
+ declare dimen register=tempdima,tempdima'={0pt},
+ declare dimen register=tempdimb,tempdimb'={0pt},
+ declare dimen register=tempdimc,tempdimc'={0pt},
+ declare dimen register=tempdimd,tempdimd'={0pt},
+ declare dimen register=tempdimx,tempdimx'={0pt},
+ declare dimen register=tempdimxa,tempdimxa'={0pt},
+ declare dimen register=tempdimxb,tempdimxb'={0pt},
+ declare dimen register=tempdimy,tempdimy'={0pt},
+ declare dimen register=tempdimya,tempdimya'={0pt},
+ declare dimen register=tempdimyb,tempdimyb'={0pt},
+ declare dimen register=tempdiml,tempdiml'={0pt},
+ declare dimen register=tempdimla,tempdimla'={0pt},
+ declare dimen register=tempdimlb,tempdimlb'={0pt},
+ declare dimen register=tempdims,tempdims'={0pt},
+ declare dimen register=tempdimsa,tempdimsa'={0pt},
+ declare dimen register=tempdimsb,tempdimsb'={0pt},
+ declare count register=tempcounta,tempcounta'={0},
+ declare count register=tempcountb,tempcountb'={0},
+ declare count register=tempcountc,tempcountc'={0},
+ declare count register=tempcountd,tempcountd'={0},
+ declare boolean register=tempboola,tempboola={0},
+ declare boolean register=tempboolb,tempboolb={0},
+ declare boolean register=tempboolc,tempboolc={0},
+ declare boolean register=tempboold,tempboold={0},
+}
+% \end{macrocode}
+% \subsubsection{Declaring options}
+%
+% \begin{macrocode}
+\def\forest@node@Nametoid#1{% #1 = name
+ \csname forest@id@of@#1\endcsname
+}
+\def\forest@node@Ifnamedefined#1#2#3{% #1 = name, #2=true,#3=false
+ \ifcsvoid{forest@id@of@#1}{#3}{#2}%
+}
+\def\forest@node@setname#1{%
+ \def\forest@temp@setname{y}%
+ \def\forest@temp@silent{n}%
+ \def\forest@temp@propagating{n}%
+ \forest@node@setnameoralias{#1}%
+}
+\def\forest@node@setname@silent#1{%
+ \def\forest@temp@setname{y}%
+ \def\forest@temp@silent{y}%
+ \def\forest@temp@propagating{n}%
+ \forest@node@setnameoralias{#1}%
+}
+\def\forest@node@setalias#1{%
+ \def\forest@temp@setname{n}%
+ \def\forest@temp@silent{n}%
+ \def\forest@temp@propagating{n}%
+ \forest@node@setnameoralias{#1}%
+}
+\def\forest@node@setalias@silent#1{%
+ \def\forest@temp@setname{n}%
+ \def\forest@temp@silent{y}%
+ \def\forest@temp@propagating{n}%
+ \forest@node@setnameoralias{#1}%
+}
+\def\forest@node@setnameoralias#1{%
+ \ifstrempty{#1}{%
+ \forest@node@setnameoralias{node@\forest@cn}%
+ }{%
+ \forest@node@Ifnamedefined{#1}{%
+ \if y\forest@temp@propagating
+ % this will find a unique name, eventually:
+ \@escapeif{\forest@node@setnameoralias{#1@\forest@cn}}%
+ \else\@escapeif{%
+ \if y\forest@temp@setname
+ \edef\forest@marshal{%
+ \ifstrequal{\forestove{name}}{#1}%
+ }\forest@marshal{%
+ % same name, no problem
+ }{%
+ \@escapeif{\forest@node@setnameoralias@nameclash{#1}}%
+ }%
+ \else\@escapeif{% setting an alias: clashing with alias is not a problem
+ \forestOget{\forest@node@Nametoid{#1}}{name}\forest@temp
+ \expandafter\ifstrequal\expandafter{\forest@temp}{#1}{%
+ \forest@node@setnameoralias@nameclash{#1}%
+ }{%
+ \forest@node@setnameoralias@do{#1}%
+ }%
+ }\fi
+ }\fi
+ }{%
+ \forest@node@setnameoralias@do{#1}%
+ }%
+ }%
+}
+\def\forest@node@setnameoralias@nameclash#1{%
+ \if y\forest@temp@silent
+ \forest@fornode{\forest@node@Nametoid{#1}}{%
+ \def\forest@temp@propagating{y}%
+ \forest@node@setnameoralias{}%
+ }%
+ \forest@node@setnameoralias@do{#1}%
+ \else
+ \PackageError{forest}{Node name "#1" is already used}{}%
+ \fi
+}
+\def\forest@node@setnameoralias@do#1{%
+ \if y\forest@temp@setname
+ \csdef{forest@id@of@\forestove{name}}{}%
+ \forestoeset{name}{#1}%
+ \fi
+ \csedef{forest@id@of@#1}{\forest@cn}%
+}
+\forestset{
+ TeX/.code={#1},
+ TeX'/.code={\appto\forest@externalize@loadimages{#1}#1},
+ TeX''/.code={\appto\forest@externalize@loadimages{#1}},
+ options/.code={\forestset{#1}},
+ also/.code={\pgfkeysalso{#1}},
+ typeout/.style={TeX={\typeout{#1}}},
+ declare toks={name}{},
+ name/.code={% override the default setter
+ \forest@fornode{\forest@setter@node}{\forest@node@setname{#1}}%
+ },
+ name/.default={},
+ name'/.code={% override the default setter
+ \forest@fornode{\forest@setter@node}{\forest@node@setname@silent{#1}}%
+ },
+ name'/.default={},
+ alias/.code={\forest@fornode{\forest@setter@node}{\forest@node@setalias{#1}}},
+ alias'/.code={\forest@fornode{\forest@setter@node}{\forest@node@setalias@silent{#1}}},
+ begin draw/.code={\begin{tikzpicture}},
+ end draw/.code={\end{tikzpicture}},
+ declare keylist register=default preamble,
+ default preamble'={},
+ declare keylist register=preamble,
+ preamble'={},
+ declare autowrapped toks={content}{},
+ % #1 = which option to split, #2 = separator (one char!), #3 = receiving options
+ split option/.code n args=3{%
+ \forestRNOget{#1}\forest@temp
+ \edef\forest@marshal{%
+ \noexpand\pgfkeysalso{split={\expandonce{\forest@temp}}\unexpanded{{#2}{#3}}}%
+ }\forest@marshal
+ },
+ split register/.code n args=3{% #1 = which register to split, #2 = separator (one char!), #3 = receiving options
+ \forestrget{#1}\forest@temp
+ \edef\forest@marshal{%
+ \noexpand\pgfkeysalso{split={\expandonce{\forest@temp}}\unexpanded{{#2}{#3}}}%
+ }\forest@marshal
+ },
+ TeX={%
+ \def\forest@split@sourcevalues{}%
+ \def\forest@split@sourcevalue{}%
+ \def\forest@split@receivingoptions{}%
+ \def\forest@split@receivingoption{}%
+ },
+ split/.code n args=3{% #1 = string to split, #2 = separator (one char!), #3 = receiving options
+ \forest@saveandrestoremacro\forest@split@sourcevalues{%
+ \forest@saveandrestoremacro\forest@split@sourcevalue{%
+ \forest@saveandrestoremacro\forest@split@receivingoptions{%
+ \forest@saveandrestoremacro\forest@split@receivingoption{%
+ \def\forest@split@sourcevalues{#1#2}%
+ \edef\forest@split@receivingoptions{#3,}%
+ \def\forest@split@receivingoption{}%
+ \safeloop
+ \expandafter\forest@split\expandafter{\forest@split@sourcevalues}{#2}\forest@split@sourcevalue\forest@split@sourcevalues
+ \ifdefempty\forest@split@receivingoptions{}{%
+ \expandafter\forest@split\expandafter{\forest@split@receivingoptions}{,}\forest@temp\forest@split@receivingoptions
+ \ifdefempty\forest@temp{}{\let\forest@split@receivingoption\forest@temp\def\forest@temp{}}%
+ }%
+ \edef\forest@marshal{%
+ \noexpand\pgfkeysalso{\forest@split@receivingoption={\expandonce{\forest@split@sourcevalue}}}%
+ }\forest@marshal
+ \ifdefempty\forest@split@sourcevalues{\forest@tempfalse}{\forest@temptrue}%
+ \ifforest@temp
+ \saferepeat
+ }}}}%
+ },
+ declare count={grow}{270},
+ TeX={% a hack for grow-reversed connection, and compass-based grow specification
+ \forest@copycommandkey{/forest/grow}{/forest/grow@@}%
+ %\pgfkeysgetvalue{/forest/grow/.@cmd}\forest@temp
+ %\pgfkeyslet{/forest/grow@@/.@cmd}\forest@temp
+ },
+ grow/.style={grow@={#1},reversed=0},
+ grow'/.style={grow@={#1},reversed=1},
+ grow''/.style={grow@={#1}},
+ grow@/.is choice,
+ grow@/east/.style={/forest/grow@@=0},
+ grow@/north east/.style={/forest/grow@@=45},
+ grow@/north/.style={/forest/grow@@=90},
+ grow@/north west/.style={/forest/grow@@=135},
+ grow@/west/.style={/forest/grow@@=180},
+ grow@/south west/.style={/forest/grow@@=225},
+ grow@/south/.style={/forest/grow@@=270},
+ grow@/south east/.style={/forest/grow@@=315},
+ grow@/.unknown/.code={\let\forest@temp@grow\pgfkeyscurrentname
+ \pgfkeysalso{/forest/grow@@/.expand once=\forest@temp@grow}},
+ declare boolean={reversed}{0},
+ declare toks={parent anchor}{},
+ declare toks={child anchor}{},
+ declare toks={anchor}{base},
+ Autoforward={anchor}{
+ node options-=anchor,
+ node options+={anchor={##1}}
+ },
+ anchor'/.style={anchor@no@compass=true,anchor=#1},
+ anchor+'/.style={anchor@no@compass=true,anchor+=#1},
+ anchor-'/.style={anchor@no@compass=true,anchor-=#1},
+ anchor*'/.style={anchor@no@compass=true,anchor*=#1},
+ anchor:'/.style={anchor@no@compass=true,anchor:=#1},
+ anchor'+'/.style={anchor@no@compass=true,anchor'+=#1},
+ anchor'-'/.style={anchor@no@compass=true,anchor'-=#1},
+ anchor'*'/.style={anchor@no@compass=true,anchor'*=#1},
+ anchor':'/.style={anchor@no@compass=true,anchor':=#1},
+ % /tikz/forest anchor/.style={
+ % /forest/TeX={\forestanchortotikzanchor{#1}\forest@temp@anchor},
+ % anchor/.expand once=\forest@temp@anchor
+ % },
+ declare toks={calign}{midpoint},
+ TeX={%
+ \forest@copycommandkey{/forest/calign}{/forest/calign'}%
+ },
+ calign/.is choice,
+ calign/child/.style={calign'=child},
+ calign/first/.style={calign'=child,calign primary child=1},
+ calign/last/.style={calign'=child,calign primary child=-1},
+ calign with current/.style={for parent/.wrap pgfmath arg={calign=child,calign primary child=##1}{n}},
+ calign with current edge/.style={for parent/.wrap pgfmath arg={calign=child edge,calign primary child=##1}{n}},
+ calign/child edge/.style={calign'=child edge},
+ calign/midpoint/.style={calign'=midpoint},
+ calign/center/.style={calign'=midpoint,calign primary child=1,calign secondary child=-1},
+ calign/edge midpoint/.style={calign'=edge midpoint},
+ calign/fixed angles/.style={calign'=fixed angles},
+ calign/fixed edge angles/.style={calign'=fixed edge angles},
+ calign/.unknown/.code={\PackageError{forest}{unknown calign '\pgfkeyscurrentname'}{}},
+ declare count={calign primary child}{1},
+ declare count={calign secondary child}{-1},
+ declare count={calign primary angle}{-35},
+ declare count={calign secondary angle}{35},
+ calign child/.style={calign primary child={#1}},
+ calign angle/.style={calign primary angle={-#1},calign secondary angle={#1}},
+ declare toks={tier}{},
+ declare toks={fit}{tight},
+ declare boolean={ignore}{0},
+ declare boolean={ignore edge}{0},
+ no edge/.style={edge'={},ignore edge},
+ declare keylist={edge}{draw},
+ declare toks={edge path}{%
+ \noexpand\path[\forestoption{edge}]%
+ (\forestOve{\forestove{@parent}}{name}.parent anchor)--(\forestove{name}.child anchor)
+ % =
+ % (!u.parent anchor)--(.child anchor)\forestoption{edge label};
+ \forestoption{edge label};%
+ },
+ edge path'/.style={
+ edge path={%
+ \noexpand\path[\forestoption{edge}]%
+ #1%
+ \forestoption{edge label};
+ }
+ },
+ declare toks={edge label}{},
+ declare boolean={phantom}{0},
+ baseline/.style={alias={forest@baseline@node}},
+ declare readonly count={id}{0},
+ declare readonly count={n}{0},
+ declare readonly count={n'}{0},
+ declare readonly count={n children}{-1},
+ declare readonly count={level}{-1},
+ declare dimen=x{0pt},
+ declare dimen=y{0pt},
+ declare dimen={s}{0pt},
+ declare dimen={l}{6ex}, % just in case: should be set by the calibration
+ declare dimen={s sep}{0.6666em},
+ declare dimen={l sep}{1ex}, % just in case: calibration!
+ declare keylist={node options}{anchor=base},
+ declare toks={tikz}{},
+ afterthought/.style={tikz+={#1}},
+ label/.style={tikz+={\path[late options={%
+ name=\forestoption{name},label={#1}}];}},
+ pin/.style={tikz+={\path[late options={%
+ name=\forestoption{name},pin={#1}}];}},
+ declare toks={content format}{\forestoption{content}},
+ plain content/.style={content format={\forestoption{content}}},
+ math content/.style={content format={\noexpand\ensuremath{\forestoption{content}}}},
+ declare toks={node format}{%
+ \noexpand\node
+ (\forestoption{name})%
+ [\forestoption{node options}]%
+ {\foresteoption{content format}};%
+ },
+ node format'/.style={
+ node format={\noexpand\node(\forestoption{name})#1;}
+ },
+ tabular@environment/.style={content format={%
+ \noexpand\begin{tabular}[\forestoption{base}]{\forestoption{align}}%
+ \forestoption{content}%
+ \noexpand\end{tabular}%
+ }},
+ declare toks={align}{},
+ TeX={%
+ \forest@copycommandkey{/forest/align}{/forest/align'}%
+ %\pgfkeysgetvalue{/forest/align/.@cmd}\forest@temp
+ %\pgfkeyslet{/forest/align'/.@cmd}\forest@temp
+ },
+ align/.is choice,
+ align/.unknown/.code={%
+ \edef\forest@marshal{%
+ \noexpand\pgfkeysalso{%
+ align'={\pgfkeyscurrentname},%
+ tabular@environment
+ }%
+ }\forest@marshal
+ },
+ align/center/.style={align'={@{}c@{}},tabular@environment},
+ align/left/.style={align'={@{}l@{}},tabular@environment},
+ align/right/.style={align'={@{}r@{}},tabular@environment},
+ declare toks={base}{t},
+ TeX={%
+ \forest@copycommandkey{/forest/base}{/forest/base'}%
+ %\pgfkeysgetvalue{/forest/base/.@cmd}\forest@temp
+ %\pgfkeyslet{/forest/base'/.@cmd}\forest@temp
+ },
+ base/.is choice,
+ base/top/.style={base'=t},
+ base/bottom/.style={base'=b},
+ base/.unknown/.style={base'/.expand once=\pgfkeyscurrentname},
+ unknown to/.store in=\forest@unknownto,
+ unknown to=node options,
+ unknown key error/.code={\PackageError{forest}{Unknown keyval: \detokenize{#1}}{}},
+ content to/.store in=\forest@contentto,
+ content to=content,
+ .unknown/.code={%
+ \expandafter\pgfutil@in@\expandafter.\expandafter{\pgfkeyscurrentname}%
+ \ifpgfutil@in@
+ \expandafter\forest@relatednode@option@setter\pgfkeyscurrentname=#1\forest@END
+ \else
+ \edef\forest@marshal{%
+ \noexpand\pgfkeysalso{\forest@unknownto={\pgfkeyscurrentname=\unexpanded{#1}}}%
+ }\forest@marshal
+ \fi
+ },
+ get node boundary/.code={%
+ \forestoget{@boundary}\forest@node@boundary
+ \def#1{}%
+ \forest@extendpath#1\forest@node@boundary{\pgfqpoint{\forestove{x}}{\forestove{y}}}%
+ },
+ % get min l tree boundary/.code={%
+ % \forest@get@tree@boundary{negative}{\the\numexpr\forestove{grow}-90\relax}#1},
+ % get max l tree boundary/.code={%
+ % \forest@get@tree@boundary{positive}{\the\numexpr\forestove{grow}-90\relax}#1},
+ get min s tree boundary/.code={%
+ \forest@get@tree@boundary{negative}{\forestove{grow}}#1},
+ get max s tree boundary/.code={%
+ \forest@get@tree@boundary{positive}{\forestove{grow}}#1},
+ use as bounding box/.style={%
+ before drawing tree={
+ tikz+/.expanded={%
+ \noexpand\pgfresetboundingbox
+ \noexpand\useasboundingbox
+ ($(.anchor)+(\forestoption{min x},\forestoption{min y})$)
+ rectangle
+ ($(.anchor)+(\forestoption{max x},\forestoption{max y})$)
+ ;
+ }
+ }
+ },
+ use as bounding box'/.style={%
+ before drawing tree={
+ tikz+/.expanded={%
+ \noexpand\pgfresetboundingbox
+ \noexpand\useasboundingbox
+ ($(.anchor)+(\forestoption{min x}+\pgfkeysvalueof{/pgf/outer xsep}/2+\pgfkeysvalueof{/pgf/inner xsep},\forestoption{min y}+\pgfkeysvalueof{/pgf/outer ysep}/2+\pgfkeysvalueof{/pgf/inner ysep})$)
+ rectangle
+ ($(.anchor)+(\forestoption{max x}-\pgfkeysvalueof{/pgf/outer xsep}/2-\pgfkeysvalueof{/pgf/inner xsep},\forestoption{max y}-\pgfkeysvalueof{/pgf/outer ysep}/2-\pgfkeysvalueof{/pgf/inner ysep})$)
+ ;
+ }
+ }
+ },
+}%
+\def\forest@iftikzkey#1#2#3{% #1 = key name, #2 = true code, #3 = false code
+ \forest@temptrue
+ \pgfkeysifdefined{/tikz/\pgfkeyscurrentname}{}{%
+ \pgfkeysifdefined{/tikz/\pgfkeyscurrentname/.@cmd}{}{%
+ \pgfkeysifdefined{/pgf/\pgfkeyscurrentname}{}{%
+ \pgfkeysifdefined{/pgf/\pgfkeyscurrentname/.@cmd}{}{%
+ \forest@tempfalse
+ }}}}%
+ \ifforest@temp\@escapeif{#2}\else\@escapeif{#3}\fi
+}
+\def\forest@ifoptionortikzkey#1#2#3{% #1 = key name, #2 = true code, #3 = false code
+ \forest@temptrue
+ \pgfkeysifdefined{/forest/\pgfkeyscurrentname}{}{%
+ \pgfkeysifdefined{/forest/\pgfkeyscurrentname/.@cmd}{}{%
+ \forest@iftikzkey{#1}{}{}%
+ }}%
+ \ifforest@temp\@escapeif{#2}\else\@escapeif{#3}\fi
+}
+\def\forest@get@tree@boundary#1#2#3{%#1=pos/neg,#2=grow,#3=receiving cs
+ \def#3{}%
+ \forest@node@getedge{#1}{#2}\forest@temp@boundary
+ \forest@extendpath#3\forest@temp@boundary{\pgfqpoint{\forestove{x}}{\forestove{y}}}%
+}
+\def\forest@setter@node{\forest@cn}%
+\def\forest@relatednode@option@compat@ignoreinvalidsteps#1{#1}
+\def\forest@relatednode@option@setter#1.#2=#3\forest@END{%
+ \forest@forthis{%
+ \forest@relatednode@option@compat@ignoreinvalidsteps{%
+ \forest@nameandgo{#1}%
+ \let\forest@setter@node\forest@cn
+ }%
+ }%
+ \ifnum\forest@setter@node=0
+ \else
+ \forestset{#2={#3}}%
+ \fi
+ \def\forest@setter@node{\forest@cn}%
+}%
+\def\forest@split#1#2#3#4{% #1=list (assuming that the list is nonempty and finishes with the separator), #2 = sep, #3 = cs receiving first, #4 = cs receiving last
+ \def\forest@split@@##1#2##2\forest@split@@##3##4{\def##3{##1}\def##4{##2}}%
+ \forest@split@@#1\forest@split@@{#3}{#4}}
+% \end{macrocode}
+%
+% \subsubsection{Option propagation}
+%
+% The propagators targeting single nodes are automatically defined by nodewalk steps definitions.
+%
+% \begin{macrocode}
+\forestset{
+ for tree'/.style 2 args={#1,for children={for tree'={#1}{#2}},#2},
+ if/.code n args={3}{%
+ \forestmathtruncatemacro\forest@temp{#1}%
+ \ifnum\forest@temp=0
+ \@escapeif{\pgfkeysalso{#3}}%
+ \else
+ \@escapeif{\pgfkeysalso{#2}}%
+ \fi
+ },
+ %LaTeX if/.code n args={3}{#1{\pgfkeysalso{#2}}{\pgfkeysalso{#3}}},
+ if nodewalk valid/.code n args={3}{%
+ \forest@forthis{%
+ \forest@configured@nodewalk{independent}{inherited}{fake}{%
+ #1,
+ TeX={\global\let\forest@global@temp\forest@cn}
+ }{}%
+ }%
+ \ifnum\forest@global@temp=0
+ \@escapeif{\pgfkeysalso{#3}}%
+ \else
+ \@escapeif{\pgfkeysalso{#2}}%
+ \fi
+ },
+ if nodewalk empty/.code n args={3}{%
+ \forest@forthis{%
+ \forest@configured@nodewalk{independent}{independent}{fake}{%
+ #1,
+ TeX={\global\let\forest@global@temp\forest@nodewalk@n},
+ }{}%
+ }%
+ \ifnum\forest@global@temp=0
+ \@escapeif{\pgfkeysalso{#2}}%
+ \else
+ \@escapeif{\pgfkeysalso{#3}}%
+ \fi
+ },
+ if current nodewalk empty/.code 2 args={%
+ \ifnum\forest@nodewalk@n=0
+ \@escapeif{\pgfkeysalso{#1}}%
+ \else
+ \@escapeif{\pgfkeysalso{#2}}%
+ \fi
+ },
+ where/.style n args={3}{for tree={if={#1}{#2}{#3}}},
+ where nodewalk valid/.style n args={3}{for tree={if nodewalk valid={#1}{#2}{#3}}},
+ where nodewalk empty/.style n args={3}{for tree={if nodewalk empty={#1}{#2}{#3}}},
+ repeat/.code 2 args={%
+ \forestmathtruncatemacro\forest@temp{#1}%
+ \expandafter\forest@repeatkey\expandafter{\forest@temp}{#2}%
+ },
+ until/.code 2 args={%
+ \ifstrempty{#1}{%
+ \forest@untilkey{\ifnum\forest@cn=0\else\relax\forestloopbreak\fi}{on invalid={fake}{#2}}%
+ }{%
+ \forest@untilkey{\forestmath@if{#1}{\forestloopbreak}{}}{#2}%
+ }%
+ },
+ while/.code 2 args={%
+ \ifstrempty{#1}{%
+ \forest@untilkey{\ifnum\forest@cn=0\relax\forestloopbreak\fi}{on invalid={fake}{#2}}%
+ }{%
+ \forest@untilkey{\forestmath@if{#1}{}{\forestloopbreak}}{#2}%
+ }%
+ },
+ do until/.code 2 args={%
+ \ifstrempty{#1}{%
+ \forest@dountilkey{\ifnum\forest@cn=0\else\relax\forestloopbreak\fi}{on invalid={fake}{#2}}%
+ }{%
+ \forest@dountilkey{\forestmath@if{#1}{\forestloopbreak}{}}{#2}%
+ }%
+ },
+ do while/.code 2 args={%
+ \ifstrempty{#1}{%
+ \forest@dountilkey{\ifnum\forest@cn=0\relax\forestloopbreak\fi}{on invalid={fake}{#2}}%
+ }{%
+ \forest@dountilkey{\forestmath@if{#1}{}{\forestloopbreak}}{#2}%
+ }%
+ },
+ until nodewalk valid/.code 2 args={%
+ \forest@untilkey{\forest@forthis{%
+ \forest@nodewalk{on invalid={fake}{#1},TeX={\ifnum\forest@cn=0\relax\else\forestloopbreak\fi}}{}}}{#2}%
+ },
+ while nodewalk valid/.code 2 args={%
+ \forest@untilkey{\forest@forthis{%
+ \forest@nodewalk{on invalid={fake}{#1},TeX={\ifnum\forest@cn=0\relax\forestloopbreak\fi}}{}}}{#2}%
+ },
+ do until nodewalk valid/.code 2 args={%
+ \forest@dountilkey{\forest@forthis{%
+ \forest@nodewalk{on invalid={fake}{#1},TeX={\ifnum\forest@cn=0\relax\else\forestloopbreak\fi}}{}}}{#2}%
+ },
+ do while nodewalk valid/.code 2 args={%
+ \forest@dountilkey{\forest@forthis{%
+ \forest@nodewalk{on invalid={fake}{#1},TeX={\ifnum\forest@cn=0\relax\forestloopbreak\fi}}{}}}{#2}%
+ },
+ until nodewalk empty/.code 2 args={%
+ \forest@untilkey{\forest@forthis{%
+ \forest@nodewalk{on invalid={fake}{#1},TeX={\ifnum\forest@nodewalk@n=0\relax\forestloopbreak\fi}}{}}}{#2}%
+ },
+ while nodewalk empty/.code 2 args={%
+ \forest@untilkey{\forest@forthis{%
+ \forest@nodewalk{on invalid={fake}{#1},TeX={\ifnum\forest@nodewalk@n=0\relax\else\forestloopbreak\fi}}{}}}{#2}%
+ },
+ do until nodewalk empty/.code 2 args={%
+ \forest@dountilkey{\forest@forthis{%
+ \forest@nodewalk{on invalid={fake}{#1},TeX={\ifnum\forest@nodewalk@n=0\relax\forestloopbreak\fi}}{}}}{#2}%
+ },
+ do while nodewalk empty/.code 2 args={%
+ \forest@dountilkey{\forest@forthis{%
+ \forest@nodewalk{on invalid={fake}{#1},TeX={\ifnum\forest@nodewalk@n=0\relax\else\forestloopbreak\fi}}{}}}{#2}%
+ },
+ break/.code={\forestloopBreak{#1}},
+ break/.default=0,
+}
+\def\forest@repeatkey#1#2{%
+ \safeRKloop
+ \ifnum\safeRKloopn>#1\relax
+ \csuse{safeRKbreak@\the\safeRKloop@depth true}%
+ \fi
+ \expandafter\unless\csname ifsafeRKbreak@\the\safeRKloop@depth\endcsname
+ \pgfkeysalso{#2}%
+ \safeRKrepeat
+}
+\def\forest@untilkey#1#2{% #1 = condition, #2 = keys
+ \safeRKloop
+ #1%
+ \expandafter\unless\csname ifsafeRKbreak@\the\safeRKloop@depth\endcsname
+ \pgfkeysalso{#2}%
+ \safeRKrepeat
+}
+\def\forest@dountilkey#1#2{% #1 = condition, #2 = keys
+ \safeRKloop
+ \pgfkeysalso{#2}%
+ #1%
+ \expandafter\unless\csname ifsafeRKbreak@\the\safeRKloop@depth\endcsname
+ \safeRKrepeat
+}
+\def\forestloopbreak{%
+ \csname safeRKbreak@\the\safeRKloop@depth true\endcsname
+}
+\def\forestloopBreak#1{%
+ \csname safeRKbreak@\number\numexpr\the\safeRKloop@depth-#1\relax true\endcsname
+}
+\def\forestloopcount{%
+ \csname safeRKloopn@\number\numexpr\the\safeRKloop@depth\endcsname
+}
+\def\forestloopCount#1{%
+ \csname safeRKloopn@\number\numexpr\the\safeRKloop@depth-#1\endcsname
+}
+\pgfmathdeclarefunction{forestloopcount}{1}{%
+ \edef\pgfmathresult{\forestloopCount{\ifstrempty{#1}{0}{#1}}}%
+}
+\forest@copycommandkey{/forest/repeat}{/forest/nodewalk/repeat}
+\forest@copycommandkey{/forest/while}{/forest/nodewalk/while}
+\forest@copycommandkey{/forest/do while}{/forest/nodewalk/do while}
+\forest@copycommandkey{/forest/until}{/forest/nodewalk/until}
+\forest@copycommandkey{/forest/do until}{/forest/nodewalk/do until}
+\forest@copycommandkey{/forest/if}{/forest/nodewalk/if}
+\forest@copycommandkey{/forest/if nodewalk valid}{/forest/nodewalk/if nodewalk valid}
+%
+% \end{macrocode}
+%
+% \subsection{Aggregate functions}
+%
+% \begin{macrocode}
+\forestset{
+ aggregate postparse/.is choice,
+ aggregate postparse/int/.code={%
+ \let\forest@aggregate@pgfmathpostparse\forest@aggregate@pgfmathpostparse@toint},
+ aggregate postparse/none/.code={%
+ \let\forest@aggregate@pgfmathpostparse\relax},
+ aggregate postparse/print/.code={%
+ \let\forest@aggregate@pgfmathpostparse\forest@aggregate@pgfmathpostparse@print},
+ aggregate postparse/macro/.code={%
+ \let\forest@aggregate@pgfmathpostparse\forest@aggregate@pgfmathpostparse@usemacro},
+ aggregate postparse macro/.store in=\forest@aggregate@pgfmathpostparse@macro,
+}
+\def\forest@aggregate@pgfmathpostparse@print{%
+ \pgfmathprintnumberto{\pgfmathresult}{\pgfmathresult}%
+}
+\def\forest@aggregate@pgfmathpostparse@toint{%
+ \expandafter\forest@split\expandafter{\pgfmathresult.}{.}\pgfmathresult\forest@temp
+}
+\def\forest@aggregate@pgfmathpostparse@usemacro{%
+ \forest@aggregate@pgfmathpostparse@macro
+}
+\let\forest@aggregate@pgfmathpostparse\relax
+\forestset{
+ /handlers/.aggregate/.code n args=4{%
+ % #1 = start value (forestmath)
+ % #2 = forestmath expression that calculates "aggregate result" at each step
+ % #3 = forestmath expression that calculates "aggregate result" at the end of the nodewalk
+ % #4 = nodewalk
+ \forest@aggregate@handler{\forest@aggregate@generic{#1}{#2}{#3}{#4}}%
+ },
+ /handlers/.sum/.code 2 args={% #1=forestmath, #2=nodewalk
+ \forest@aggregate@handler{\forest@aggregate@sum{#1}{#2}}%
+ },
+ /handlers/.count/.code={% #1=nodewalk
+ \forest@aggregate@handler{\forest@aggregate@count{#1}}%
+ },
+ /handlers/.average/.code 2 args={% #1=forestmath, #2=nodewalk
+ \forest@aggregate@handler{\forest@aggregate@average{#1}{#2}}%
+ },
+ /handlers/.product/.code 2 args={% #1=forestmath, #2=nodewalk
+ \forest@aggregate@handler{\forest@aggregate@product{#1}{#2}}%
+ },
+ /handlers/.min/.code 2 args={% #1=forestmath, #2=nodewalk
+ \forest@aggregate@handler{\forest@aggregate@min{#1}{#2}}%
+ },
+ /handlers/.max/.code 2 args={% #1=forestmath, #2=nodewalk
+ \forest@aggregate@handler{\forest@aggregate@max{#1}{#2}}%
+ },
+ declare count register={aggregate n},
+ declare toks register={aggregate value},
+ declare toks register={aggregate result},
+ aggregate result={},
+}
+\def\forest@aggregate@handler#1{%
+ \edef\forest@marshal{%
+ \unexpanded{%
+ #1%
+ }{%
+ \noexpand\pgfkeysalso{\pgfkeyscurrentpath/.register=aggregate result}%
+ }%
+ }\forest@marshal
+}
+\def\forest@aggregate@pgfmathfunction@finish{%
+ \forestrget{aggregate result}\pgfmathresult
+}
+\pgfmathdeclarefunction{aggregate}{4}{%
+ \forest@aggregate@generic{#1}{#2}{#3}{#4}%
+ \forest@aggregate@pgfmathfunction@finish
+}
+\pgfmathdeclarefunction{aggregate_count}{1}{%
+ \forest@aggregate@sum{#1}%
+ \forest@aggregate@pgfmathfunction@finish
+}
+\pgfmathdeclarefunction{aggregate_sum}{2}{%
+ \forest@aggregate@sum{#1}{#2}%
+ \forest@aggregate@pgfmathfunction@finish
+}
+\pgfmathdeclarefunction{aggregate_product}{2}{%
+ \forest@aggregate@product{#1}{#2}%
+ \forest@aggregate@pgfmathfunction@finish
+}
+\pgfmathdeclarefunction{aggregate_average}{2}{%
+ \forest@aggregate@average{#1}{#2}%
+ \forest@aggregate@pgfmathfunction@finish
+}
+\pgfmathdeclarefunction{aggregate_min}{2}{%
+ \forest@aggregate@min{#1}{#2}%
+ \forest@aggregate@pgfmathfunction@finish
+}
+\pgfmathdeclarefunction{aggregate_max}{2}{%
+ \forest@aggregate@max{#1}{#2}%
+ \forest@aggregate@pgfmathfunction@finish
+}
+% \end{macrocode}
+% Define particular aggregate functions.
+% \begin{macrocode}
+\def\forest@aggregate#1#2#3#4#5#6{% #1...#5=real args,
+ % #6=what to do with |aggregate result| register
+ % #1 = start value (forestmath)
+ % #2 = forestmath expression that calculates "aggregate current" at each step
+ % #3 = forestmath expression that calculates "aggregate result" at each step
+ % #4 = forestmath expression that calculates "aggregate result" at the end of the nodewalk
+ % #5 = nodewalk
+ \forest@saveandrestoreregister{aggregate result}{%
+ \forest@saveandrestoreregister{aggregate n}{%
+ \forest@aggregate@{#1}{#2}{#3}{#4}{#5}%
+ #6%
+ }%
+ }%
+}
+\def\forest@aggregate@generic#1#2#3#4{\forest@aggregate
+ {\forestmathparse{#1}}%
+ {}%
+ {\forestmathparse{#2}}%
+ {\forestmathparse{#3}}%
+ {#4}%
+}
+\def\forest@aggregate@sum#1#2{\forest@aggregate
+ {\forestmath@convert@fromto\forestmathtype@count\forestmathtype@generic{0}}%
+ {\forestmathparse{#1}}%
+ {\forestmathadd{\forestregister{aggregate value}}{\forestregister{aggregate result}}}%
+ {\forestrget{aggregate result}\forestmathresult}%
+ {#2}%
+}
+\def\forest@aggregate@count#1{\forest@aggregate
+ {\def\forestmathresult{0}\let\forestmathresulttype\forestmathtype@count}%
+ {\def\forestmathresult{1}\let\forestmathresulttype\forestmathtype@count}%
+ {\edef\forestmathresult{\the\numexpr\forestregister{aggregate result}+1}\let\forestmathresulttype\forestmathtype@count}%
+ {\forestrget{aggregate result}\forestmathresult\let\forestmathresulttype\forestmathtype@count}%
+ {#1}%
+}
+\def\forest@aggregate@average#1#2{\forest@aggregate
+ {\forestmath@convert@fromto\forestmathtype@count\forestmathtype@generic{0}}%
+ {\forestmathparse{#1}}%
+ {\forestmathadd{\forestregister{aggregate value}}{\forestregister{aggregate result}}}%
+ {\forestmathdivide@P{\forestregister{aggregate result}}{\forestregister{aggregate n}}}%
+ {#2}%
+}
+\def\forest@aggregate@product#1#2{\forest@aggregate
+ {\forestmath@convert@fromto\forestmathtype@count\forestmathtype@generic{1}}%
+ {\forestmathparse{#1}}%
+ {\forestmathmultiply{\forestregister{aggregate value}}{\forestregister{aggregate result}}}%
+ {\forestrget{aggregate result}\forestmathresult}%
+ {#2}%
+}
+\def\forest@aggregate@min#1#2{\forest@aggregate
+ {\def\forestmathresult{}}%
+ {\forestmathparse{#1}}%
+ {\forestmathmin{\forestregister{aggregate value}}{\forestregister{aggregate result}}}%
+ {\forestrget{aggregate result}\forestmathresult}%
+ {#2}%
+}
+\def\forest@aggregate@max#1#2{\forest@aggregate
+ {\def\forestmathresult{}}%
+ {\forestmathparse{#1}}%
+ {\forestmathmax{\forestregister{aggregate value}}{\forestregister{aggregate result}}}%
+ {\forestrget{aggregate result}\forestmathresult}%
+ {#2}%
+}
+% \end{macrocode}
+% Actual computation.
+% \begin{macrocode}
+\def\forest@aggregate@#1#2#3#4#5{%
+ % #1 = start value (forestmath)
+ % #2 = forestmath expression that calculates "aggregate current" at each step
+ % #3 = forestmath expression that calculates "aggregate result" at each step
+ % #4 = forestmath expression that calculates "aggregate result" at the end of the nodewalk
+ % #5 = nodewalk
+ #1%
+ \forestrlet{aggregate result}\forestmathresult
+ \forestrset{aggregate value}{}%
+ \forestrset{aggregate n}{0}%
+ \forest@forthis{%
+ \forest@nodewalk{#5}{%
+ TeX={%
+ \forestreset{aggregate n}{\number\numexpr\forestrv{aggregate n}+1}%
+ #2%
+ \forestrlet{aggregate value}\forestmathresult
+ #3%
+ \forestrlet{aggregate result}\forestmathresult
+ }%
+ }{}%
+ }%
+ #4%
+ \let\forest@temp@pgfmathpostparse\pgfmathpostparse
+ \let\pgfmathpostparse\forest@aggregate@pgfmathpostparse
+ \forestmath@convert@to\forestmathtype@dimen{\forestmathresult}%
+ \pgfmathqparse{\forestmathresult}%
+ \let\pgfmathpostparse\forest@temp@pgfmathpostparse
+ \forestrlet{aggregate result}\pgfmathresult
+}
+% \end{macrocode}
+% \subsubsection{\texttt{pgfmath} extensions}
+%
+% \begin{macrocode}
+\pgfmathdeclarefunction{strequal}{2}{%
+ \ifstrequal{#1}{#2}{\def\pgfmathresult{1}}{\def\pgfmathresult{0}}%
+}
+\pgfmathdeclarefunction{instr}{2}{%
+ \pgfutil@in@{#1}{#2}%
+ \ifpgfutil@in@\def\pgfmathresult{1}\else\def\pgfmathresult{0}\fi
+}
+\pgfmathdeclarefunction{strcat}{...}{%
+ \edef\pgfmathresult{\forest@strip@braces{#1}}%
+}
+\pgfmathdeclarefunction{min_s}{2}{% #1 = node, #2 = context node (for growth rotation)
+ \forest@forthis{%
+ \forest@nameandgo{#1}%
+ \forest@compute@minmax@ls{#2}%
+ \edef\forest@temp{\forestove{min@s}}%
+ \edef\pgfmathresult{\expandafter\Pgf@geT\forest@temp}%
+ }%
+}
+\pgfmathdeclarefunction{min_l}{2}{% #1 = node, #2 = context node (for growth rotation)
+ \forest@forthis{%
+ \forest@nameandgo{#1}%
+ \forest@compute@minmax@ls{#2}%
+ \edef\forest@temp{\forestove{min@l}}%
+ \edef\pgfmathresult{\expandafter\Pgf@geT\forest@temp}%
+ }%
+}
+\pgfmathdeclarefunction{max_s}{2}{% #1 = node, #2 = context node (for growth rotation)
+ \forest@forthis{%
+ \forest@nameandgo{#1}%
+ \forest@compute@minmax@ls{#2}%
+ \edef\forest@temp{\forestove{max@s}}%
+ \edef\pgfmathresult{\expandafter\Pgf@geT\forest@temp}%
+ }%
+}
+\pgfmathdeclarefunction{max_l}{2}{% #1 = node, #2 = context node (for growth rotation)
+ \forest@forthis{%
+ \forest@nameandgo{#1}%
+ \forest@compute@minmax@ls{#2}%
+ \edef\forest@temp{\forestove{max@l}}%
+ \edef\pgfmathresult{\expandafter\Pgf@geT\forest@temp}%
+ }%
+}
+\def\forest@compute@minmax@ls#1{% #1 = nodewalk; in the context of which node?
+ {%
+ \pgftransformreset
+ \forest@forthis{%
+ \forest@nameandgo{#1}%
+ \forest@pgfqtransformrotate{-\forestove{grow}}%
+ }%
+ \forestoget{min x}\forest@temp@minx
+ \forestoget{min y}\forest@temp@miny
+ \forestoget{max x}\forest@temp@maxx
+ \forestoget{max y}\forest@temp@maxy
+ \pgfpointtransformed{\pgfqpoint{\forest@temp@minx}{\forest@temp@miny}}%
+ \forestoeset{min@l}{\the\pgf@x}%
+ \forestoeset{min@s}{\the\pgf@y}%
+ \forestoeset{max@l}{\the\pgf@x}%
+ \forestoeset{max@s}{\the\pgf@y}%
+ \pgfpointtransformed{\pgfqpoint{\forest@temp@minx}{\forest@temp@maxy}}%
+ \ifdim\pgf@x<\forestove{min@l}\relax\forestoeset{min@l}{\the\pgf@x}\fi
+ \ifdim\pgf@y<\forestove{min@s}\relax\forestoeset{min@s}{\the\pgf@y}\fi
+ \ifdim\pgf@x>\forestove{max@l}\relax\forestoeset{max@l}{\the\pgf@x}\fi
+ \ifdim\pgf@y>\forestove{max@s}\relax\forestoeset{max@s}{\the\pgf@y}\fi
+ \pgfpointtransformed{\pgfqpoint{\forest@temp@maxx}{\forest@temp@miny}}%
+ \ifdim\pgf@x<\forestove{min@l}\relax\forestoeset{min@l}{\the\pgf@x}\fi
+ \ifdim\pgf@y<\forestove{min@s}\relax\forestoeset{min@s}{\the\pgf@y}\fi
+ \ifdim\pgf@x>\forestove{max@l}\relax\forestoeset{max@l}{\the\pgf@x}\fi
+ \ifdim\pgf@y>\forestove{max@s}\relax\forestoeset{max@s}{\the\pgf@y}\fi
+ \pgfpointtransformed{\pgfqpoint{\forest@temp@maxx}{\forest@temp@maxy}}%
+ \ifdim\pgf@x<\forestove{min@l}\relax\forestoeset{min@l}{\the\pgf@x}\fi
+ \ifdim\pgf@y<\forestove{min@s}\relax\forestoeset{min@s}{\the\pgf@y}\fi
+ \ifdim\pgf@x>\forestove{max@l}\relax\forestoeset{max@l}{\the\pgf@x}\fi
+ \ifdim\pgf@y>\forestove{max@s}\relax\forestoeset{max@s}{\the\pgf@y}\fi
+ % smuggle out
+ \edef\forest@marshal{%
+ \noexpand\forestoeset{min@l}{\forestove{min@l}}%
+ \noexpand\forestoeset{min@s}{\forestove{min@s}}%
+ \noexpand\forestoeset{max@l}{\forestove{max@l}}%
+ \noexpand\forestoeset{max@s}{\forestove{max@s}}%
+ }\expandafter
+ }\forest@marshal
+}
+\def\forest@pgfmathhelper@attribute@toks#1#2{%
+ \forest@forthis{%
+ \forest@nameandgo{#1}%
+ \ifnum\forest@cn=0
+ \def\pgfmathresult{}%
+ \else
+ \forestoget{#2}\pgfmathresult
+ \fi
+ }%
+}
+\def\forest@pgfmathhelper@attribute@dimen#1#2{%
+ \forest@forthis{%
+ \forest@nameandgo{#1}%
+ \ifnum\forest@cn=0
+ \def\pgfmathresult{0}%
+ \else
+ \forestoget{#2}\forest@temp
+ \edef\pgfmathresult{\expandafter\Pgf@geT\forest@temp}%
+ \fi
+ }%
+}
+\def\forest@pgfmathhelper@attribute@count#1#2{%
+ \forest@forthis{%
+ \forest@nameandgo{#1}%
+ \ifnum\forest@cn=0
+ \def\pgfmathresult{0}%
+ \else
+ \forestoget{#2}\pgfmathresult
+ \fi
+ }%
+}
+\pgfmathdeclarefunction*{id}{1}{%
+ \forest@forthis{%
+ \forest@nameandgo{#1}%
+ \let\pgfmathresult\forest@cn
+ }%
+}
+% \end{macrocode}
+%
+% \subsection{Nodewalk}
+%
+% Setup machinery.
+%
+% \begin{macrocode}
+\def\forest@nodewalk@n{0}
+\def\forest@nodewalk@historyback{0,}
+\def\forest@nodewalk@historyforward{0,}
+\def\forest@nodewalk@origin{0}
+\def\forest@nodewalk@config@everystep@independent@before#1{% #1 = every step keylist
+ \forestrset{every step}{#1}%
+}
+\def\forest@nodewalk@config@everystep@independent@after{%
+ \noexpand\forestrset{every step}{\forestrv{every step}}%
+}
+\def\forest@nodewalk@config@history@independent@before{%
+ \def\forest@nodewalk@n{0}%
+ \edef\forest@nodewalk@origin{\forest@cn}%
+ \def\forest@nodewalk@historyback{0,}%
+ \def\forest@nodewalk@historyforward{0,}%
+}
+\def\forest@nodewalk@config@history@independent@after{%
+ \edef\noexpand\forest@nodewalk@n{\expandonce{\forest@nodewalk@n}}%
+ \edef\noexpand\forest@nodewalk@origin{\expandonce{\forest@nodewalk@origin}}%
+ \edef\noexpand\forest@nodewalk@historyback{\expandonce{\forest@nodewalk@historyback}}%
+ \edef\noexpand\forest@nodewalk@historyforward{\expandonce{\forest@nodewalk@historyforward}}%
+}
+\def\forest@nodewalk@config@everystep@shared@before#1{}% #1 = every step keylist
+\def\forest@nodewalk@config@everystep@shared@after{}
+\def\forest@nodewalk@config@history@shared@before{}
+\def\forest@nodewalk@config@history@shared@after{}
+\def\forest@nodewalk@config@everystep@inherited@before#1{}% #1 = every step keylist
+\let\forest@nodewalk@config@everystep@inherited@after\forest@nodewalk@config@everystep@independent@after
+\def\forest@nodewalk@config@history@inherited@before{}
+\let\forest@nodewalk@config@history@inherited@after\forest@nodewalk@config@history@independent@after
+\def\forest@nodewalk#1#2{% #1 = nodewalk, #2 = every step keylist
+ \forest@configured@nodewalk{independent}{independent}{inherited}{#1}{#2}%
+}
+\def\forest@configured@nodewalk#1#2#3#4#5{%
+ % #1 = every step method, #2 = history method, #3 = on invalid
+ % #4 = nodewalk, #5 = every step keylist
+ \def\forest@nodewalk@config@everystep@method{#1}%
+ \def\forest@nodewalk@config@history@method{#2}%
+ \def\forest@nodewalk@config@oninvalid{#3}%
+ \forest@Nodewalk{#4}{#5}%
+}
+\def\forest@nodewalk@oninvalid@inherited@text{inherited}
+\def\forest@Nodewalk#1#2{% #1 = nodewalk, #2 = every step keylist
+ \ifx\forest@nodewalk@config@oninvalid\forest@nodewalk@oninvalid@inherited@text
+ \edef\forest@nodewalk@config@oninvalid{\forest@nodewalk@oninvalid}%
+ \fi
+ \edef\forest@nw@marshal{%
+ \noexpand\pgfqkeys{/forest/nodewalk}{\unexpanded{#1}}%
+ \csname forest@nodewalk@config@everystep@\forest@nodewalk@config@everystep@method @after\endcsname
+ \csname forest@nodewalk@config@history@\forest@nodewalk@config@history@method @after\endcsname
+ \edef\noexpand\forest@nodewalk@oninvalid{\forest@nodewalk@oninvalid}%
+ }%
+ \csname forest@nodewalk@config@everystep@\forest@nodewalk@config@everystep@method @before\endcsname{#2}%
+ \csname forest@nodewalk@config@history@\forest@nodewalk@config@history@method @before\endcsname
+ \edef\forest@nodewalk@oninvalid{\forest@nodewalk@config@oninvalid}%
+ \forest@saveandrestoreifcs{forest@nodewalk@fake}{%
+ \forest@nodewalk@fakefalse
+ \forest@nw@marshal
+ }%
+}
+\pgfmathdeclarefunction{valid}{1}{%
+ \forest@forthis{%
+ \forest@nameandgo{#1}%
+ \edef\pgfmathresult{\ifnum\forest@cn=0 0\else 1\fi}%
+ }%
+}
+\pgfmathdeclarefunction{invalid}{1}{%
+ \forest@forthis{%
+ \forest@nameandgo{#1}%
+ \edef\pgfmathresult{\ifnum\forest@cn=0 1\else 0\fi}%
+ }%
+}
+\newif\ifforest@nodewalk@fake
+\def\forest@nodewalk@oninvalid{error}
+\def\forest@nodewalk@makestep{%
+ \ifnum\forest@cn=0
+ \csname forest@nodewalk@makestep@oninvalid@\forest@nodewalk@oninvalid\endcsname
+ \else
+ \forest@nodewalk@makestep@
+ \fi
+}
+\csdef{forest@nodewalk@makestep@oninvalid@error if real}{\ifforest@nodewalk@fake\expandafter\forest@nodewalk@makestep@\else\expandafter\forest@nodewalk@makestep@oninvalid@error\fi}
+\csdef{forest@nodewalk@makestep@oninvalid@last valid}{%
+ \forest@nodewalk@tolastvalid
+ \ifforestdebugnodewalks\forest@nodewalk@makestep@invalidtolastvalid@debug\fi}%
+\def\forest@nodewalk@makestep@oninvalid@error{\PackageError{forest}{nodewalk stepped to the invalid node\MessageBreak nodewalk stack: "\forest@nodewalk@currentstepname"}{}}%
+\let\forest@nodewalk@makestep@oninvalid@fake\relax
+\def\forest@nodewalk@makestep@oninvalid@compatfake{%
+ \forest@deprecated{last step in stack "\forest@nodewalk@currentstepname", which stepped on an invalid node; enabled by "compat=1.0-forstep". Use "on invalid={fake}{...}" or "for Nodewalk={on invalid=fake}{...}{...}" instead.}%
+}%
+\def\forest@nodewalk@makestep@{%
+ \ifforestdebugnodewalks\forest@nodewalk@makestep@debug\fi
+ \ifforest@nodewalk@fake
+ \else
+ \edef\forest@nodewalk@n{\number\numexpr\forest@nodewalk@n+1}%
+ \epreto\forest@nodewalk@historyback{\forest@cn,}%
+ \def\forest@nodewalk@historyforward{0,}%
+ \forest@process@keylist@register{every step}%
+ \fi
+}
+\def\forest@nodewalk@makestep@debug{%
+ \edef\forest@marshal{%
+ \noexpand\typeout{\ifforest@nodewalk@fake fake \fi "\forest@nodewalk@currentstepname" step to node id=\forest@cn, content=\forestoption{content}}%
+ }\forest@marshal
+}%
+\def\forest@nodewalk@makestep@invalidtolastvalid@debug{%
+ \edef\forest@marshal{%
+ \noexpand\typeout{\ifforest@nodewalk@fake fake \fi "\forest@nodewalk@currentstepname" step to invalid node, (fake) return to last valid id=\forest@cn, content=\forestoption{content}}%
+ }\forest@marshal
+}%
+\def\forest@handlers@savecurrentpath{%
+ \edef\pgfkeyscurrentkey{\pgfkeyscurrentpath}%
+ \let\forest@currentkey\pgfkeyscurrentkey
+ \pgfkeys@split@path
+ \edef\forest@currentpath{\pgfkeyscurrentpath}%
+ \let\forest@currentname\pgfkeyscurrentname
+}
+\pgfkeys{/handlers/save current path/.code={\forest@handlers@savecurrentpath}}
+\newif\ifforest@nodewalkstephandler@style
+\newif\ifforest@nodewalkstephandler@autostep
+\newif\ifforest@nodewalkstephandler@stripfakesteps
+\newif\ifforest@nodewalkstephandler@muststartatvalidnode
+\newif\ifforest@nodewalkstephandler@makefor
+\let\forest@nodewalkstephandler@styletrueorfalse\forest@nodewalkstephandler@stylefalse
+\def\forest@nodewalk@currentstepname{}
+\forestset{
+ /forest/define@step/style/.is if=forest@nodewalkstephandler@style,
+ /forest/define@step/autostep/.is if=forest@nodewalkstephandler@autostep,
+ % the following is useful because some macros use grouping (by \forest@forthis or similar) and therefore, after making the last step, revert \forest@cn to the original value, essentially making a fake step
+ /forest/define@step/strip fake steps/.is if=forest@nodewalkstephandler@stripfakesteps,
+ % this can never happen with autosteps ...
+ /forest/define@step/autostep/.append code={%
+ \ifforest@nodewalkstephandler@autostep
+ \forest@nodewalkstephandler@stripfakestepsfalse
+ \fi
+ },
+ /forest/define@step/must start at valid node/.is if=forest@nodewalkstephandler@muststartatvalidnode,
+ /forest/define@step/n args/.store in=\forest@nodewalkstephandler@nargs,
+ /forest/define@step/make for/.is if=forest@nodewalkstephandler@makefor,
+ /forest/define@step/@bare/.style={strip fake steps=false,must start at valid node=false,make for=false},
+ define long step/.code n args=3{%
+ \forest@nodewalkstephandler@styletrueorfalse % true for end users; but in the package, most of steps are defined by .code
+ \forest@nodewalkstephandler@autostepfalse
+ \forest@nodewalkstephandler@stripfakestepstrue
+ \forest@nodewalkstephandler@muststartatvalidnodetrue % most steps can only start at a valid node
+ \forest@nodewalkstephandler@makefortrue % make for prefix?
+ \def\forest@nodewalkstephandler@nargs{0}%
+ \pgfqkeys{/forest/define@step}{#2}%
+ \forest@temp@toks{#3}% handler code
+ \ifforest@nodewalkstephandler@style
+ \expandafter\forest@temp@toks\expandafter{%
+ \expandafter\pgfkeysalso\expandafter{\the\forest@temp@toks}%
+ }%
+ \fi
+ \ifforest@nodewalkstephandler@autostep
+ \apptotoks\forest@temp@toks{\forest@nodewalk@makestep}%
+ \fi
+ \ifforest@nodewalkstephandler@stripfakesteps
+ \expandafter\forest@temp@toks\expandafter{\expandafter\forest@nodewalk@stripfakesteps\expandafter{\the\forest@temp@toks}}%
+ \fi
+ \ifforest@nodewalkstephandler@muststartatvalidnode
+ \edef\forest@marshal{%
+ \noexpand\forest@temp@toks{%
+ \unexpanded{%
+ \ifnum\forest@cn=0
+ \csname forest@nodewalk@start@oninvalid@\forest@nodewalk@oninvalid\endcsname{#1}%
+ \else
+ }%
+ \noexpand\@escapeif{\the\forest@temp@toks}%
+ \noexpand\fi
+ }%
+ }\forest@marshal
+ \fi
+ \pretotoks\forest@temp@toks{\appto\forest@nodewalk@currentstepname{,#1}}%
+ \expandafter\forest@temp@toks\expandafter{\expandafter\forest@saveandrestoremacro\expandafter\forest@nodewalk@currentstepname\expandafter{\the\forest@temp@toks}}%
+ \ifforestdebugnodewalks
+ \epretotoks\forest@temp@toks{\noexpand\typeout{Starting step "#1" from id=\noexpand\forest@cn
+ \ifnum\forest@nodewalkstephandler@nargs>0 \space with args \noexpand\unexpanded{####1}\fi
+ \ifnum\forest@nodewalkstephandler@nargs>1 ,\noexpand\unexpanded{####2}\fi
+ \ifnum\forest@nodewalkstephandler@nargs>2 ,\noexpand\unexpanded{####3}\fi
+ \ifnum\forest@nodewalkstephandler@nargs>3 ,\noexpand\unexpanded{####4}\fi
+ \ifnum\forest@nodewalkstephandler@nargs>4 ,\noexpand\unexpanded{####5}\fi
+ \ifnum\forest@nodewalkstephandler@nargs>5 ,\noexpand\unexpanded{####6}\fi
+ \ifnum\forest@nodewalkstephandler@nargs>6 ,\noexpand\unexpanded{####7}\fi
+ \ifnum\forest@nodewalkstephandler@nargs>7 ,\noexpand\unexpanded{####8}\fi
+ \ifnum\forest@nodewalkstephandler@nargs>8 ,\noexpand\unexpanded{####9}\fi
+ }}%
+ \fi
+ \def\forest@temp{/forest/nodewalk/#1/.code}%
+ \ifnum\forest@nodewalkstephandler@nargs<2
+ \eappto\forest@temp{=}%
+ \else\ifnum\forest@nodewalkstephandler@nargs=2
+ \eappto\forest@temp{ 2 args=}%
+ \else
+ \eappto\forest@temp{ n args={\forest@nodewalkstephandler@nargs}}%
+ \fi\fi
+ \eappto\forest@temp{{\the\forest@temp@toks}}%
+ \expandafter\pgfkeysalso\expandafter{\forest@temp}%
+ \ifforest@nodewalkstephandler@makefor
+ \ifnum\forest@nodewalkstephandler@nargs=0
+ \forestset{%
+ for #1/.code={\forest@forstepwrapper{#1}{##1}},
+ }%
+ \else\ifnum\forest@nodewalkstephandler@nargs=1
+ \forestset{%
+ for #1/.code 2 args={\forest@forstepwrapper{#1={##1}}{##2}},
+ }%
+ \else
+ \forestset{%
+ for #1/.code n args/.expanded=%
+ {\number\numexpr\forest@nodewalkstephandler@nargs+1}%
+ {\noexpand\forest@forstepwrapper{#1\ifnum\forest@nodewalkstephandler@nargs>0=\fi\forest@util@nargs{####}{\number\numexpr\forest@nodewalkstephandler@nargs}{0}}{####\number\numexpr\forest@nodewalkstephandler@nargs+1}},
+ }%
+ \fi\fi
+ \fi
+ },
+}
+{\csname forest@@doc@@hook@bigbadforlist\endcsname}%
+\pgfqkeys{/handlers}{
+ .nodewalk style/.code={\forest@handlers@savecurrentpath\pgfkeysalso{%
+ \forest@currentpath/nodewalk/\forest@currentname/.style={#1}%
+ }},
+}
+% \end{macrocode}
+% |\forest@forstepwrapper| is defined so that it can be changed by |compat| to create unfailable spatial propagators from v1.0.
+% \begin{macrocode}
+\def\forest@forstepwrapper#1#2{\forest@forthis{\forest@nodewalk{#1}{#2}}}
+\def\forest@util@nargs#1#2#3{% #1 = prefix (#, ##, ...), #2 = n args, #3=start; returns {#start+1}...{#start+n}
+ \ifnum#2>0 {#1\number\numexpr#3+1}\fi
+ \ifnum#2>1 {#1\number\numexpr#3+2}\fi
+ \ifnum#2>2 {#1\number\numexpr#3+3}\fi
+ \ifnum#2>3 {#1\number\numexpr#3+4}\fi
+ \ifnum#2>4 {#1\number\numexpr#3+5}\fi
+ \ifnum#2>5 {#1\number\numexpr#3+6}\fi
+ \ifnum#2>6 {#1\number\numexpr#3+7}\fi
+ \ifnum#2>7 {#1\number\numexpr#3+8}\fi
+ \ifnum#2>8 {#1\number\numexpr#3+9}\fi
+}
+\def\forest@nodewalk@start@oninvalid@fake#1{}
+\def\forest@nodewalk@start@oninvalid@compatfake#1{%
+ \forest@deprecated{last step in stack "\forest@nodewalk@currentstepname", which started from an invalid node; enabled by "compat=1.0-forstep". Use "on invalid={fake}{...}" or "for Nodewalk={on invalid=fake}{...}{...}" instead.}%
+}%
+\let\forest@nodewalk@start@oninvalid@errorifreal\forest@nodewalk@start@oninvalid@fake % the step will be to an invalid node anyway
+\let\forest@nodewalk@start@oninvalid@lastvalid\forest@nodewalk@start@oninvalid@fake
+\def\forest@nodewalk@start@oninvalid@error#1{\PackageError{forest}{nodewalk step "#1" cannot start at the invalid node}{}}
+% \end{macrocode}
+% Define long-form single-step walks.
+% \begin{macrocode}
+\forestset{
+ define long step={current}{autostep}{},
+ define long step={next}{autostep}{\edef\forest@cn{\forestove{@next}}},
+ define long step={previous}{autostep}{\edef\forest@cn{\forestove{@previous}}},
+ define long step={parent}{autostep}{\edef\forest@cn{\forestove{@parent}}},
+ define long step={first}{autostep}{\edef\forest@cn{\forestove{@first}}},
+ define long step={last}{autostep}{\edef\forest@cn{\forestove{@last}}},
+ define long step={sibling}{autostep}{%
+ \edef\forest@cn{%
+ \ifnum\forestove{@previous}=0
+ \forestove{@next}%
+ \else
+ \forestove{@previous}%
+ \fi
+ }%
+ },
+ define long step={next node}{autostep}{\edef\forest@cn{\forest@node@linearnextid}},
+ define long step={previous node}{autostep}{\edef\forest@cn{\forest@node@linearpreviousid}},
+ define long step={first leaf}{autostep}{%
+ \safeloop
+ \edef\forest@cn{\forestove{@first}}%
+ \unless\ifnum\forestove{@first}=0
+ \saferepeat
+ },
+ define long step={first leaf'}{autostep}{%
+ \safeloop
+ \unless\ifnum\forestove{@first}=0
+ \edef\forest@cn{\forestove{@first}}%
+ \saferepeat
+ },
+ define long step={last leaf}{autostep}{%
+ \safeloop
+ \edef\forest@cn{\forestove{@last}}%
+ \unless\ifnum\forestove{@last}=0
+ \saferepeat
+ },
+ define long step={last leaf'}{autostep}{%
+ \safeloop
+ \unless\ifnum\forestove{@last}=0
+ \edef\forest@cn{\forestove{@last}}%
+ \saferepeat
+ },
+ define long step={next leaf}{style,strip fake steps=false}{group={do until={n_children()==0}{next node}}},
+ define long step={previous leaf}{style,strip fake steps=false}{group={do until={n_children()==0}{previous node}}},
+ define long step={next on tier}{autostep,n args=1}{%
+ \def\forest@temp{#1}%
+ \ifx\forest@temp\pgfkeysnovalue@text
+ \forestoget{tier}\forest@nodewalk@giventier
+ \else
+ \def\forest@nodewalk@giventier{#1}%
+ \fi
+ \edef\forest@cn{\forest@node@linearnextid}%
+ \safeloop
+ \forest@nodewalk@gettier
+ \ifforest@temp
+ \edef\forest@cn{\forest@node@linearnextid}%
+ \saferepeat
+ },
+ define long step={previous on tier}{autostep,n args=1}{%
+ \def\forest@temp{#1}%
+ \ifx\forest@temp\pgfkeysnovalue@text
+ \forestoget{tier}\forest@nodewalk@giventier
+ \else
+ \def\forest@nodewalk@giventier{#1}%
+ \fi
+ \safeloop
+ \edef\forest@cn{\forest@node@linearpreviousid}%
+ \forest@nodewalk@gettier
+ \ifforest@temp
+ \saferepeat
+ },
+ TeX={%
+ \def\forest@nodewalk@gettier{%
+ \ifnum\forest@cn=0
+ \forest@tempfalse
+ \else
+ \forestoget{tier}\forest@temp
+ \ifx\forest@temp\forest@nodewalk@giventier
+ \forest@tempfalse
+ \else
+ \forest@temptrue
+ \fi
+ \fi
+ }%
+ },
+ %
+ define long step={root}{autostep,must start at valid node=false}{%
+ \edef\forest@cn{\forest@node@rootid}},
+ define long step={root'}{autostep,must start at valid node=false}{%
+ \forestOifdefined{\forest@root}{@parent}{\edef\forest@cn{\forest@root}}{\edef\forest@cn{0}}%
+ },
+ define long step={origin}{autostep,must start at valid node=false}{\edef\forest@cn{\forest@nodewalk@origin}},
+ %
+ define long step={n}{autostep,n args=1}{%
+ \forestmathtruncatemacro\forest@temp@n{#1}%
+ \edef\forest@cn{\forest@node@nthchildid{\forest@temp@n}}%
+ },
+ define long step={n}{autostep,make for=false,n args=1}{%
+ % Yes, twice. ;-)
+ % n=1 and n(ext)
+ \def\forest@nodewalk@temp{#1}%
+ \ifx\forest@nodewalk@temp\pgfkeysnovalue@text
+ \edef\forest@cn{\forestove{@next}}%
+ \else
+ \forestmathtruncatemacro\forest@temp@n{#1}%
+ \edef\forest@cn{\forest@node@nthchildid{\forest@temp@n}}%
+ \fi
+ },
+ define long step={n'}{autostep,n args=1}{%
+ \forestmathtruncatemacro\forest@temp@n{#1}%
+ \edef\forest@cn{\forest@node@nbarthchildid{\forest@temp@n}}%
+ },
+ define long step={to tier}{autostep,n args=1}{%
+ \def\forest@nodewalk@giventier{#1}%
+ \safeloop
+ \forest@nodewalk@gettier
+ \ifforest@temp
+ \forestoget{@parent}\forest@cn
+ \saferepeat
+ },
+ %
+ define long step={name}{autostep,n args=1,must start at valid node=false}{%
+ \edef\forest@cn{%
+ \forest@node@Ifnamedefined{#1}{\forest@node@Nametoid{#1}}{0}%
+ }%
+ },
+ define long step={id}{autostep,n args=1,must start at valid node=false}{%
+ \forestOifdefined{#1}{@parent}{\edef\forest@cn{#1}}{\edef\forest@cn{0}}%
+ },
+ define long step={Nodewalk}{n args=3,@bare}{% #1 = config, #2 = nodewalk
+ \def\forest@nodewalk@config@everystep@method{independent}%
+ \def\forest@nodewalk@config@history@method{shared}%
+ \def\forest@nodewalk@config@oninvalid{inherited}%
+ \pgfqkeys{/forest/nodewalk@config}{#1}%
+ \forest@Nodewalk{#2}{#3}%
+ },
+ define long step={nodewalk}{n args=2,@bare}{% #1 = nodewalk, #2 = every step
+ \forest@nodewalk{#1}{#2}%
+ },
+ define long step={nodewalk'}{n args=1,@bare}{% #1 = nodewalk
+ \forest@configured@nodewalk{inherited}{independent}{inherited}{#1}{}%
+ },
+ % these "for ..." keys must be defined explicitely
+ % (and copied into node keyspace manually),
+ % as prefix "for" normally introduces the every-step keylist
+ define long step={for nodewalk}{n args=2,@bare}{% #1 = nodewalk, #2 = every step
+ \forest@forthis{\forest@nodewalk{#1}{#2}}},
+ define long step={for nodewalk'}{n args=1,@bare}{% #1 = nodewalk
+ \forest@forthis{%
+ \forest@configured@nodewalk{inherited}{independent}{inherited}{#1}{}%
+ }%
+ },
+ define long step={for Nodewalk}{n args=3,@bare}{% #1 = config, #2 = nodewalk, #3 = every-step
+ \def\forest@nodewalk@config@everystep@method{independent}%
+ \def\forest@nodewalk@config@history@method{shared}%
+ \def\forest@nodewalk@config@oninvalid{inherited}%
+ \pgfqkeys{/forest/nodewalk@config}{#1}%
+ \forest@forthis{\forest@Nodewalk{#2}{#3}}%
+ },
+ copy command key={/forest/nodewalk/Nodewalk}{/forest/Nodewalk},
+ copy command key={/forest/nodewalk/for nodewalk}{/forest/for nodewalk},
+ copy command key={/forest/nodewalk/for Nodewalk}{/forest/for Nodewalk},
+ declare keylist register=every step,
+ every step'={},
+ %%% begin nodewalk config
+ nodewalk@config/.cd,
+ every@step/.is choice,
+ every@step/independent/.code={},
+ every@step/inherited/.code={},
+ every@step/shared/.code={},
+ every step/.store in=\forest@nodewalk@config@everystep@method,
+ every step/.prefix style={every@step=#1},
+ @history/.is choice,
+ @history/independent/.code={},
+ @history/inherited/.code={},
+ @history/shared/.code={},
+ history/.store in=\forest@nodewalk@config@history@method,
+ history/.prefix style={@history=#1},
+ on@invalid/.is choice,
+ on@invalid/error/.code={},
+ on@invalid/fake/.code={},
+ on@invalid/error if real/.code={},
+ on@invalid/last valid/.code={},
+ on@invalid/inherited/.code={},
+ on invalid/.store in=\forest@nodewalk@config@oninvalid,
+ on invalid/.prefix style={on@invalid=#1},
+ %%% end nodewalk config
+}
+\newtoks\forest@nodewalk@branch@toks
+\forestset{
+ declare toks register=branch@temp@toks,
+ branch@temp@toks={},
+ declare keylist register=branched@nodewalk,
+ branched@nodewalk={},
+ define long step={branch}{n args=1,@bare,make for,style}{@branch={#1}{branch@build@realstep,branch@build@fakestep}},
+ define long step={branch'}{n args=1,@bare,make for,style}{@branch={#1}{branch@build@realstep}},
+ @branch/.style 2 args={%
+ save and restore register={branched@nodewalk}{
+ branch@temp@toks={},
+ split/.process={r}{#1}{,}{#2},
+ also/.register=branch@temp@toks,
+ also/.register=branched@nodewalk,
+ }
+ },
+ nodewalk/branch@build@realstep/.style={% #1 = nodewalk for this branch
+ branch@temp@toks/.expanded={for nodewalk={\unexpanded{#1}}{
+ branched@nodewalk+/.expanded={id=\noexpand\forestoption{id}},
+ \forestregister{branch@temp@toks}}},
+ },
+ nodewalk/branch@build@fakestep/.style={% #1 = nodewalk for this branch
+ branch@temp@toks/.expanded={for nodewalk={\unexpanded{#1}}{
+ \forestregister{branch@temp@toks}}},
+ },
+ define long step={group}{autostep,n args=1}{\forest@go{#1}},
+ nodewalk/fake/.code={%
+ \forest@saveandrestoreifcs{forest@nodewalk@fake}{%
+ \forest@nodewalk@faketrue
+ \pgfkeysalso{#1}%
+ }%
+ },
+ nodewalk/real/.code={%
+ \forest@saveandrestoreifcs{forest@nodewalk@fake}{%
+ \forest@nodewalk@fakefalse
+ \pgfkeysalso{#1}%
+ }%
+ },
+ declare keylist register=filtered@nodewalk,
+ filtered@nodewalk={},
+ define long step={filter}{n args=2,@bare,make for,style}{% #1 = nodewalk, #2 = condition
+ save and restore register={filtered@nodewalk}{
+ filtered@nodewalk'={},
+ Nodewalk=%
+ {history=inherited}%
+ {#1}%
+ {if={#2}{filtered@nodewalk+/.expanded={id=\forestoption{id}}}{}},
+ filtered@nodewalk@style/.style/.register=filtered@nodewalk,
+ filtered@nodewalk@style
+ },
+ },
+ on@invalid/.is choice,
+ on@invalid/error/.code={},
+ on@invalid/fake/.code={},
+ on@invalid/error if real/.code={},
+ on@invalid/last valid/.code={},
+ on invalid/.code 2 args={%
+ \pgfkeysalso{/forest/on@invalid={#1}}%
+ \forest@saveandrestoremacro\forest@nodewalk@oninvalid{%
+ \def\forest@nodewalk@oninvalid{#1}%
+ \pgfkeysalso{#2}%
+ }%
+ },
+ define long step={strip fake steps}{n args=1,@bare}{%
+ \forest@nodewalk@stripfakesteps{\pgfkeysalso{#1}}},
+ define long step={unique}{n args=1}{%
+ \begingroup
+ \def\forest@nodewalk@unique@temp{}%
+ \forest@nodewalk{#1}{%
+ TeX={%
+ \forestoget{unique@visited}\forest@temp
+ \ifx\forest@temp\relax
+ \forestoset{unique@visited}{1}%
+ \eappto\forest@nodewalk@unique@temp{,id=\forest@cn}%
+ \fi
+ }%
+ }%
+ \global\let\forest@global@temp\forest@nodewalk@unique@temp
+ \endgroup
+ \pgfkeysalsofrom{\forest@global@temp}%
+ },
+ define long step={walk back}{n args=1,@bare}{%
+ \forestmathtruncatemacro\forest@temp@n{#1}%
+ \forest@nodewalk@walklist{\forest@nodewalk@historyforward}{\forest@nodewalk@historyback}{\ifnum\forest@cn=0 0\else1\fi}{\forest@temp@n+\ifnum\forest@cn=0 0\else1\fi}{\let\forest@cn\forest@nodewalk@cn\forest@nodewalk@makestep}%
+ \forest@nodewalk@back@updatehistory
+ },
+ nodewalk/walk back/.default=1,
+ define long step={jump back}{n args=1,@bare}{%
+ \forestmathtruncatemacro\forest@temp@n{(#1)+\ifnum\forest@cn=0 0\else1\fi}%
+ \forest@nodewalk@walklist{\forest@nodewalk@historyforward}{\forest@nodewalk@historyback}{\forest@temp@n-1}{\forest@temp@n}{\let\forest@cn\forest@nodewalk@cn\forest@nodewalk@makestep}%
+ \forest@nodewalk@back@updatehistory
+ },
+ nodewalk/jump back/.default=1,
+ define long step={back}{n args=1,@bare}{%
+ \forestmathtruncatemacro\forest@temp@n{#1}%
+ \forest@nodewalk@walklist{\forest@nodewalk@historyforward}{\forest@nodewalk@historyback}{\ifnum\forest@cn=0 0\else1\fi}{\forest@temp@n+\ifnum\forest@cn=0 0\else1\fi}{\let\forest@cn\forest@nodewalk@cn\forest@saveandrestoreifcs{forest@nodewalk@fake}{\forest@nodewalk@faketrue\forest@nodewalk@makestep}}%
+ \forest@nodewalk@back@updatehistory
+ },
+ nodewalk/back/.default=1,
+ define long step={walk forward}{n args=1,@bare}{%
+ \forestmathtruncatemacro\forest@temp@n{#1}%
+ \forest@nodewalk@walklist{\forest@nodewalk@historyback}{\forest@nodewalk@historyforward}{0}{\forest@temp@n}{\let\forest@cn\forest@nodewalk@cn\forest@nodewalk@makestep}%
+ \forest@nodewalk@forward@updatehistory
+ },
+ nodewalk/walk forward/.default=1,
+ define long step={jump forward}{n args=1,@bare}{%
+ \forestmathtruncatemacro\forest@temp@n{#1}%
+ \forest@nodewalk@walklist{\forest@nodewalk@historyback}{\forest@nodewalk@historyforward}{\forest@temp@n-1}{\forest@temp@n}{\let\forest@cn\forest@nodewalk@cn\forest@nodewalk@makestep}%
+ \forest@nodewalk@forward@updatehistory
+ },
+ nodewalk/jump forward/.default=1,
+ define long step={forward}{n args=1,@bare}{%
+ \forestmathtruncatemacro\forest@temp@n{#1}%
+ \forest@nodewalk@walklist{\forest@nodewalk@historyback}{\forest@nodewalk@historyforward}{0}{\forest@temp@n}{\let\forest@cn\forest@nodewalk@cn\forest@saveandrestoreifcs{forest@nodewalk@fake}{\forest@nodewalk@faketrue\forest@nodewalk@makestep}}%
+ \forest@nodewalk@forward@updatehistory
+ },
+ nodewalk/forward/.default=1,
+ define long step={last valid'}{@bare}{%
+ \ifnum\forest@cn=0
+ \forest@nodewalk@tolastvalid
+ \forest@nodewalk@makestep
+ \fi
+ },
+ define long step={last valid}{@bare}{%
+ \forest@nodewalk@tolastvalid
+ },
+ define long step={reverse}{n args=1,@bare,make for}{%
+ \forest@nodewalk{#1,TeX={%
+ \global\let\forest@global@temp\forest@nodewalk@historyback
+ \global\let\forest@global@tempn\forest@nodewalk@n
+ }}{}%
+ \forest@nodewalk@walklist{}{\forest@global@temp}{0}{\forest@global@tempn}{\let\forest@cn\forest@nodewalk@cn\forest@nodewalk@makestep}%
+ },
+ define long step={walk and reverse}{n args=1,@bare,make for}{%
+ \edef\forest@marshal{%
+ \noexpand\pgfkeysalso{\unexpanded{#1}}%
+ \noexpand\forest@nodewalk@walklist{}{\noexpand\forest@nodewalk@historyback}{0}{\noexpand\forest@nodewalk@n-\forest@nodewalk@n}{\let\noexpand\forest@cn\noexpand\forest@nodewalk@cn\noexpand\forest@nodewalk@makestep}%
+ }\forest@marshal
+ },
+ define long step={sort}{n args=1,@bare,make for}{%
+ \forest@nodewalk{#1,TeX={%
+ \global\let\forest@global@temp\forest@nodewalk@historyback
+ \global\let\forest@global@tempn\forest@nodewalk@n
+ }}{}%
+ \forest@nodewalk@sortlist{\forest@global@temp}{\forest@global@tempn}\forest@sort@ascending
+ },
+ define long step={sort'}{n args=1,@bare,make for}{%
+ \forest@nodewalk{#1,TeX={%
+ \global\let\forest@global@temp\forest@nodewalk@historyback
+ \global\let\forest@global@tempn\forest@nodewalk@n
+ }}{}%
+ \forest@nodewalk@sortlist{\forest@global@temp}{\forest@global@tempn}\forest@sort@descending
+ },
+ define long step={walk and sort}{n args=1,@bare,make for}{% walk as given, then walk sorted
+ \edef\forest@marshal{%
+ \noexpand\pgfkeysalso{\unexpanded{#1}}%
+ \noexpand\forest@nodewalk@sortlist{\noexpand\forest@nodewalk@historyback}{\noexpand\forest@nodewalk@n-\forest@nodewalk@n}\noexpand\forest@sort@ascending
+ }\forest@marshal
+ },
+ define long step={walk and sort'}{n args=1,@bare,make for}{%
+ \edef\forest@marshal{%
+ \noexpand\pgfkeysalso{\unexpanded{#1}}%
+ \noexpand\forest@nodewalk@sortlist{\noexpand\forest@nodewalk@historyback}{\noexpand\forest@nodewalk@n-\forest@nodewalk@n}\noexpand\forest@sort@descending
+ }\forest@marshal
+ },
+ declare keylist register=sort by,
+ copy command key={/forest/sort by'}{/forest/sort by},
+ sort by={},
+ define long step={save}{n args=2,@bare,make for}{% #1 = name, #2 = nodewalk
+ \forest@forthis{%
+ \forest@nodewalk{#2,TeX={%
+ \global\let\forest@global@temp\forest@nodewalk@historyback
+ \global\let\forest@global@tempn\forest@nodewalk@n
+ }}{}%
+ }%
+ \forest@nodewalk@walklist{}{\forest@global@temp}{0}{\forest@global@tempn}\relax
+ \csedef{forest@nodewalk@saved@#1}{\forest@nodewalk@walklist@walked}%
+ },
+ define long step={walk and save}{n args=2,@bare,make for}{% #1 = name, #2 = nodewalk
+ \edef\forest@marshal{%
+ \noexpand\pgfkeysalso{\unexpanded{#2}}%
+ \noexpand\forest@nodewalk@walklist{}{\noexpand\forest@nodewalk@historyback}{0}{\noexpand\forest@nodewalk@n-\forest@nodewalk@n}\relax
+ }\forest@marshal
+ \csedef{forest@nodewalk@saved@#1}{\forest@nodewalk@walklist@walked}%
+ },
+ define long step={save append}{style,n args=2,@bare,make for}{% #1 = nodewalk name, #2 = nodewalk
+ save@append@prepend={#1}{#2}{save}{\cseappto}},
+ define long step={save prepend}{style,n args=2,@bare,make for}{% #1 = nodewalk name, #2 = nodewalk
+ save@append@prepend={#1}{#2}{save}{\csepreto}},
+ define long step={walk and save append}{style,n args=2,@bare,make for}{% #1 = nodewalk name, #2 = nodewalk
+ save@append@prepend={#1}{#2}{walk and save}{\cseappto}},
+ define long step={walk and save prepend}{style,n args=2,@bare,make for}{% #1 = nodewalk name, #2 = nodewalk
+ save@append@prepend={#1}{#2}{walk and save}{\csepreto}},
+ nodewalk/save@append@prepend/.code n args=4{%
+ % #1 = nodewalk name, #2 = nodewalk
+ % #3 = "(walk and) save" #4 = \cseappto/\csepreto
+ \pgfkeysalso{#3={@temp}{#2}}%
+ \letcs\forest@temp{forest@nodewalk@saved@@temp}%
+ #4{forest@nodewalk@saved@#1}{\expandonce{\forest@temp}}%
+ },
+ nodewalk/save history/.code 2 args={% #1 = back, forward
+ \csedef{forest@nodewalk@saved@#1}{\forest@nodewalk@historyback}%
+ \csedef{forest@nodewalk@saved@#2}{\forest@nodewalk@historyforward}%
+ },
+ define long step={load}{n args=1,@bare,make for}{%
+ \forest@nodewalk@walklist{}{\csuse{forest@nodewalk@saved@#1}0,}{0}{-1}{\ifnum\forest@nodewalk@cn=0 \else\let\forest@cn\forest@nodewalk@cn\forest@nodewalk@makestep\fi}%
+ },
+ if in saved nodewalk/.code n args=4{% is node #1 in nodewalk #2; yes: #3, no: #4
+ \forest@forthis{%
+ \forest@go{#1}%
+ \edef\forest@marshal{%
+ \noexpand\pgfutil@in@{,\forest@cn,}{,\csuse{forest@nodewalk@saved@#2},}%
+ }\forest@marshal
+ }%
+ \ifpgfutil@in@
+ \@escapeif{\pgfkeysalso{#3}}%
+ \else
+ \@escapeif{\pgfkeysalso{#4}}%
+ \fi
+ },
+ where in saved nodewalk/.style n args=4{
+ for tree={if in saved nodewalk={#1}{#2}{#3}{#4}}
+ },
+ nodewalk/options/.code={\forestset{#1}},
+ nodewalk/TeX/.code={#1},
+ nodewalk/TeX'/.code={\appto\forest@externalize@loadimages{#1}#1},
+ nodewalk/TeX''/.code={\appto\forest@externalize@loadimages{#1}},
+ nodewalk/typeout/.style={TeX={\typeout{#1}}},
+ % repeat is taken later from /forest/repeat
+}
+\def\forest@nodewalk@walklist#1#2#3#4#5{%
+ % #1 = list of preceding, #2 = list to walk
+ % #3 = from, #4 = to
+ % #5 = every step code
+ \let\forest@nodewalk@cn\forest@cn
+ \edef\forest@marshal{%
+ \noexpand\forest@nodewalk@walklist@{#1}{#2}{\number\numexpr#3}{\number\numexpr#4}{1}{0}{\unexpanded{#5}}%
+ }\forest@marshal
+}
+\def\forest@nodewalk@walklist@#1#2#3#4#5#6#7{%
+ % #1 = list of walked, #2 = list to walk
+ % #3 = from, #4 = to
+ % #5 = current step n, #6 = steps made
+ % #7 = every step code
+ \def\forest@nodewalk@walklist@walked{#1}%
+ \def\forest@nodewalk@walklist@rest{#2}%
+ \edef\forest@nodewalk@walklist@stepsmade{#6}%
+ \ifnum#4<0
+ \forest@temptrue
+ \else
+ \ifnum#5>#4\relax
+ \forest@tempfalse
+ \else
+ \forest@temptrue
+ \fi
+ \fi
+ \ifforest@temp
+ \edef\forest@nodewalk@cn{\forest@csvlist@getfirst@{#2}}%
+ \ifnum\forest@nodewalk@cn=0
+ #7%
+ \else
+ \ifnum#5>#3\relax
+ #7%
+ \edef\forest@nodewalk@walklist@stepsmade{\number\numexpr#6+1}%
+ \fi
+ \forest@csvlist@getfirstrest@{#2}\forest@nodewalk@cn\forest@nodewalk@walklist@rest
+ \@escapeifif{%
+ \edef\forest@marshal{%
+ \noexpand\forest@nodewalk@walklist@
+ {\forest@nodewalk@cn,#1}{\forest@nodewalk@walklist@rest}{#3}{#4}{\number\numexpr#5+1}{\forest@nodewalk@walklist@stepsmade}{\unexpanded{#7}}%
+ }\forest@marshal
+ }%
+ \fi
+ \fi
+}
+
+\def\forest@nodewalk@back@updatehistory{%
+ \ifnum\forest@cn=0
+ \let\forest@nodewalk@historyback\forest@nodewalk@walklist@rest
+ \let\forest@nodewalk@historyforward\forest@nodewalk@walklist@walked
+ \else
+ \expandafter\forest@csvlist@getfirstrest@\expandafter{\forest@nodewalk@walklist@walked}\forest@temp\forest@nodewalk@historyforward
+ \edef\forest@nodewalk@historyback{\forest@temp,\forest@nodewalk@walklist@rest}%
+ \fi
+}
+\def\forest@nodewalk@forward@updatehistory{%
+ \let\forest@nodewalk@historyforward\forest@nodewalk@walklist@rest
+ \let\forest@nodewalk@historyback\forest@nodewalk@walklist@walked
+}
+\def\forest@go#1{%
+ \forest@configured@nodewalk{independent}{inherited}{inherited}{#1}{}%
+}
+\def\forest@csvlist@getfirst@#1{% assuming that the list is nonempty and finishes with a comma
+ \forest@csvlist@getfirst@@#1\forest@csvlist@getfirst@@}
+\def\forest@csvlist@getfirst@@#1,#2\forest@csvlist@getfirst@@{#1}
+\def\forest@csvlist@getrest@#1{% assuming that the list is nonempty and finishes with a comma
+ \forest@csvlist@getrest@@#1\forest@csvlist@getrest@@}
+\def\forest@csvlist@getrest@@#1,#2\forest@csvlist@getrest@@{#2}
+\def\forest@csvlist@getfirstrest@#1#2#3{% assuming that the list is nonempty and finishes with a comma
+ % #1 = list, #2 = cs receiving first, #3 = cs receiving rest
+ \forest@csvlist@getfirstrest@@#1\forest@csvlist@getfirstrest@@{#2}{#3}}
+\def\forest@csvlist@getfirstrest@@#1,#2\forest@csvlist@getfirstrest@@#3#4{%
+ \def#3{#1}%
+ \def#4{#2}%
+}
+\def\forest@nodewalk@stripfakesteps#1{%
+ % go to the last valid node if the walk contained any nodes, otherwise restore the current node
+ \edef\forest@marshal{%
+ \unexpanded{#1}%
+ \noexpand\ifnum\noexpand\forest@nodewalk@n=\forest@nodewalk@n\relax
+ \def\noexpand\forest@cn{\forest@cn}%
+ \noexpand\else
+ \unexpanded{%
+ \edef\forest@cn{%
+ \expandafter\forest@csvlist@getfirst@\expandafter{\forest@nodewalk@historyback}%
+ }%
+ }%
+ \noexpand\fi
+ }\forest@marshal
+}
+\def\forest@nodewalk@tolastvalid{%
+ \ifnum\forest@cn=0
+ \edef\forest@cn{\expandafter\forest@csvlist@getfirst@\expandafter{\forest@nodewalk@historyback}}%
+ \ifnum\forest@cn=0
+ \let\forest@cn\forest@nodewalk@origin
+ \fi
+ \fi
+}
+\def\forest@nodewalk@sortlist#1#2#3{%#1=list,#2=to,#3=asc/desc
+ \edef\forest@nodewalksort@list{#1}%
+ \expandafter\forest@nodewalk@sortlist@\expandafter{\number\numexpr#2}{#3}%
+}
+\def\forest@nodewalk@sortlist@#1#2{%#1=to,#2=asc/desc
+ \safeloop
+ \unless\ifnum\safeloopn>#1\relax
+ \expandafter\forest@csvlist@getfirstrest@\expandafter{\forest@nodewalksort@list}\forest@nodewalksort@cn\forest@nodewalksort@list
+ \csedef{forest@nodesort@\safeloopn}{\forest@nodewalksort@cn}%
+ \saferepeat
+ \forestrget{sort by}\forest@nodesort@sortkey
+ \forest@sort\forest@nodesort@cmpnodes\forest@nodesort@let#2{1}{#1}%
+ \def\forest@nodewalksort@sorted{}%
+ \safeloop
+ \unless\ifnum\safeloopn>#1\relax
+ \edef\forest@cn{\csname forest@nodesort@\safeloopn\endcsname}%
+ \forest@nodewalk@makestep
+ \saferepeat
+}
+% \end{macrocode}
+%
+% Find minimal/maximal node in a walk.
+% \begin{macrocode}
+\forestset{
+ define long step={min}{n args=1,@bare,make for}{% the first min in the argument nodewalk
+ \forest@nodewalk{#1,TeX={%
+ \global\let\forest@global@temp\forest@nodewalk@historyback
+ }}{}%
+ \forest@nodewalk@minmax{\forest@global@temp}{-1}{<}{\forest@nodewalk@minmax@node,}%
+ },
+ define long step={mins}{n args=1,@bare,make for}{% all mins in the argument nodewalk
+ \forest@nodewalk{#1,TeX={%
+ \global\let\forest@global@temp\forest@nodewalk@historyback
+ }}{}%
+ \forest@nodewalk@minmax{\forest@global@temp}{-1}{<}{\forest@nodewalk@minmax@nodes}%
+ },
+ define long step={walk and min}{n args=1,@bare}{%
+ \edef\forest@marshal{%
+ \noexpand\pgfkeysalso{\unexpanded{#1}}%
+ \noexpand\forest@nodewalk@minmax{\noexpand\forest@nodewalk@historyback}{\noexpand\forest@nodewalk@n-\forest@nodewalk@n}{<}{\noexpand\forest@nodewalk@minmax@node,}%%
+ }\forest@marshal
+ },
+ define long step={walk and mins}{n args=1,@bare}{%
+ \edef\forest@marshal{%
+ \noexpand\pgfkeysalso{\unexpanded{#1}}%
+ \noexpand\forest@nodewalk@minmax{\noexpand\forest@nodewalk@historyback}{\noexpand\forest@nodewalk@n-\forest@nodewalk@n}{<}{\noexpand\forest@nodewalk@minmax@nodes}%%
+ }\forest@marshal
+ },
+ define long step={min in nodewalk}{@bare}{% find the first min in the preceding nodewalk, step to it
+ \forest@nodewalk@minmax{\forest@nodewalk@historyback}{-1}{<}{\forest@nodewalk@minmax@node,}%
+ },
+ define long step={mins in nodewalk}{@bare}{% find mins in the preceding nodewalk, step to mins
+ \forest@nodewalk@minmax{\forest@nodewalk@historyback}{-1}{<}{\forest@nodewalk@minmax@nodes}%
+ },
+ define long step={min in nodewalk'}{@bare}{% find the first min in the preceding nodewalk, step to min in history
+ \forest@nodewalk@minmax{\forest@nodewalk@historyback}{-1}{<}{}%
+ },
+ %
+ define long step={max}{n args=1,@bare,make for}{% the first max in the argument nodewalk
+ \forest@nodewalk{#1,TeX={%
+ \global\let\forest@global@temp\forest@nodewalk@historyback
+ }}{}%
+ \forest@nodewalk@minmax{\forest@global@temp}{-1}{>}{\forest@nodewalk@minmax@node,}%
+ },
+ define long step={maxs}{n args=1,@bare,make for}{% all maxs in the argument nodewalk
+ \forest@nodewalk{#1,TeX={%
+ \global\let\forest@global@temp\forest@nodewalk@historyback
+ }}{}%
+ \forest@nodewalk@minmax{\forest@global@temp}{-1}{>}{\forest@nodewalk@minmax@nodes}%
+ },
+ define long step={walk and max}{n args=1,@bare}{%
+ \edef\forest@marshal{%
+ \noexpand\pgfkeysalso{\unexpanded{#1}}%
+ \noexpand\forest@nodewalk@minmax{\noexpand\forest@nodewalk@historyback}{\noexpand\forest@nodewalk@n-\forest@nodewalk@n}{>}{\noexpand\forest@nodewalk@minmax@node,}%%
+ }\forest@marshal
+ },
+ define long step={walk and maxs}{n args=1,@bare}{%
+ \edef\forest@marshal{%
+ \noexpand\pgfkeysalso{\unexpanded{#1}}%
+ \noexpand\forest@nodewalk@minmax{\noexpand\forest@nodewalk@historyback}{\noexpand\forest@nodewalk@n-\forest@nodewalk@n}{>}{\noexpand\forest@nodewalk@minmax@nodes}%%
+ }\forest@marshal
+ },
+ define long step={max in nodewalk}{@bare}{% find the first max in the preceding nodewalk, step to it
+ \forest@nodewalk@minmax{\forest@nodewalk@historyback}{-1}{>}{\forest@nodewalk@minmax@node,}%
+ },
+ define long step={maxs in nodewalk}{@bare}{% find maxs in the preceding nodewalk, step to maxs
+ \forest@nodewalk@minmax{\forest@nodewalk@historyback}{-1}{>}{\forest@nodewalk@minmax@nodes}%
+ },
+ define long step={max in nodewalk'}{@bare}{% find the first max in the preceding nodewalk, step to max in history
+ \forest@nodewalk@minmax{\forest@nodewalk@historyback}{-1}{>}{}%
+ },
+}
+
+\def\forest@nodewalk@minmax#1#2#3#4{%
+ % #1 = list of nodes
+ % #2 = max index in list (start with 1)
+ % #3 = min/max = ascending/descending = </>
+ % #4 = how many results? 1 = {\forest@nodewalk@minmax@node,}, all={\forest@nodewalk@minmax@nodes}, walk in history={}
+ \forestrget{sort by}\forest@nodesort@sortkey
+ \edef\forest@nodewalk@minmax@N{\number\numexpr#2}%
+ \edef\forest@nodewalk@minmax@n{}%
+ \edef\forest@nodewalk@minmax@list{#1}%
+ \def\forest@nodewalk@minmax@nodes{}%
+ \def\forest@nodewalk@minmax@node{}%
+ \ifdefempty{\forest@nodewalk@minmax@list}{%
+ }{%
+ \safeloop
+ \expandafter\forest@csvlist@getfirstrest@\expandafter{\forest@nodewalk@minmax@list}\forest@nodewalk@minmax@cn\forest@nodewalk@minmax@list
+ \ifnum\forest@nodewalk@minmax@cn=0 \else
+ \ifdefempty{\forest@nodewalk@minmax@node}{%
+ \edef\forest@nodewalk@minmax@node{\forest@nodewalk@minmax@cn}%
+ \edef\forest@nodewalk@minmax@nodes{\forest@nodewalk@minmax@cn,}%
+ \edef\forest@nodewalk@minmax@n{\safeloopn}%
+ }{%
+ \csedef{forest@nodesort@1}{\forest@nodewalk@minmax@node}%
+ \csedef{forest@nodesort@2}{\forest@nodewalk@minmax@cn}%
+ \forest@nodesort@cmpnodes{2}{1}%
+ \if=\forest@sort@cmp@result
+ \edef\forest@nodewalk@minmax@node{\forest@nodewalk@minmax@cn}%
+ \epreto\forest@nodewalk@minmax@nodes{\forest@nodewalk@minmax@cn,}%
+ \edef\forest@nodewalk@minmax@n{\safeloopn}%
+ \else
+ \if#3\forest@sort@cmp@result
+ \edef\forest@nodewalk@minmax@node{\forest@nodewalk@minmax@cn}%
+ \edef\forest@nodewalk@minmax@nodes{\forest@nodewalk@minmax@cn,}%
+ \edef\forest@nodewalk@minmax@n{\safeloopn}%
+ \fi
+ \fi
+ }%
+ \fi
+ \ifdefempty{\forest@nodewalk@minmax@list}{\forest@tempfalse}{\forest@temptrue}%
+ \ifnum\safeloopn=\forest@nodewalk@minmax@N\relax\forest@temptrue\fi
+ \ifforest@temp
+ \saferepeat
+ \edef\forest@nodewalk@minmax@list{#4}%
+ \ifdefempty\forest@nodewalk@minmax@list{%
+ \forestset{nodewalk/jump back=\forest@nodewalk@minmax@n-1}% CHECK
+ }{%
+ \safeloop
+ \expandafter\forest@csvlist@getfirstrest@\expandafter{\forest@nodewalk@minmax@list}\forest@cn\forest@nodewalk@minmax@list
+ \forest@nodewalk@makestep
+ \ifdefempty{\forest@nodewalk@minmax@list}{\forest@tempfalse}{\forest@temptrue}%
+ \ifforest@temp
+ \saferepeat
+ }%
+ }%
+}
+% \end{macrocode}
+%
+% The short-form step mechanism. The complication is that we want to be able to collect tikz and pgf options here, and it is impossible(?) to know in advance what keys are valid there. So we rather check whether the given keyname is a sequence of short steps; if not, we pass the key on.
+% \begin{macrocode}
+\newtoks\forest@nodewalk@shortsteps@resolution
+\newif\ifforest@nodewalk@areshortsteps
+\pgfqkeys{/forest/nodewalk}{
+ .unknown/.code={%
+ \forest@nodewalk@areshortstepsfalse
+ \ifx\pgfkeyscurrentvalue\pgfkeysnovalue@text % no value, so possibly short steps
+ \forest@nodewalk@shortsteps@resolution{}%
+ \forest@nodewalk@areshortstepstrue
+ \expandafter\forest@nodewalk@shortsteps\pgfkeyscurrentname==========,% "=" and "," cannot be short steps, so they are good as delimiters
+ \fi
+ \ifforest@nodewalk@areshortsteps
+ \@escapeif{\expandafter\pgfkeysalso\expandafter{\the\forest@nodewalk@shortsteps@resolution}}%
+ \else
+ \@escapeif{\pgfkeysalso{/forest/\pgfkeyscurrentname={#1}}}%
+ \fi
+ },
+}
+\def\forest@nodewalk@shortsteps{%
+ \futurelet\forest@nodewalk@nexttoken\forest@nodewalk@shortsteps@
+}
+\def\forest@nodewalk@shortsteps@{%
+ \ifx\forest@nodewalk@nexttoken=%
+ \let\forest@nodewalk@nextop\forest@nodewalk@shortsteps@end
+ \else
+ \ifx\forest@nodewalk@nexttoken\bgroup
+ \letcs\forest@nodewalk@nextop{forest@shortstep@group}%
+ \else
+ \let\forest@nodewalk@nextop\forest@nodewalk@shortsteps@@
+ \fi
+ \fi
+ \forest@nodewalk@nextop
+}
+\def\forest@nodewalk@shortsteps@@#1{%
+ \ifcsdef{forest@shortstep@#1}{%
+ \csname forest@shortstep@#1\endcsname
+ }{%
+ \forest@nodewalk@areshortstepsfalse
+ \forest@nodewalk@shortsteps@end
+ }%
+}
+% in the following definitions:
+% #1 = short step
+% #2 = (long) step, or a style in /forest/nodewalk (taking n args)
+\csdef{forest@nodewalk@defshortstep@0@args}#1#2{%
+ \csdef{forest@shortstep@#1}{%
+ \apptotoks\forest@nodewalk@shortsteps@resolution{,#2}%
+ \forest@nodewalk@shortsteps}}
+\csdef{forest@nodewalk@defshortstep@1@args}#1#2{%
+ \csdef{forest@shortstep@#1}##1{%
+ \edef\forest@marshal####1{#2}%
+ \eapptotoks\forest@nodewalk@shortsteps@resolution{,\forest@marshal{##1}}%
+ \forest@nodewalk@shortsteps}}
+\csdef{forest@nodewalk@defshortstep@2@args}#1#2{%
+ \csdef{forest@shortstep@#1}##1##2{%
+ \edef\forest@marshal####1####2{#2}%
+ \eapptotoks\forest@nodewalk@shortsteps@resolution{,\forest@marshal{##1}{##2}}%
+ \forest@nodewalk@shortsteps}}
+\csdef{forest@nodewalk@defshortstep@3@args}#1#2{%
+ \csdef{forest@shortstep@#1}##1##2##3{%
+ \edef\forest@marshal####1####2####3{#2}%
+ \eapptotoks\forest@nodewalk@shortsteps@resolution{,\forest@marshal{##1}{##2}{##3}}%
+ \forest@nodewalk@shortsteps}}
+\csdef{forest@nodewalk@defshortstep@4@args}#1#2{%
+ \csdef{forest@shortstep@#1}##1##2##3##4{%
+ \edef\forest@marshal####1####2####3####4{#2}%
+ \eapptotoks\forest@nodewalk@shortsteps@resolution{,\forest@marshal{##1}{##2}{##3}{##4}}%
+ \forest@nodewalk@shortsteps}}
+\csdef{forest@nodewalk@defshortstep@5@args}#1#2{%
+ \csdef{forest@shortstep@#1}##1##2##3##4##5{%
+ \edef\forest@marshal####1####2####3####4####5{#2}%
+ \eapptotoks\forest@nodewalk@shortsteps@resolution{,\forest@marshal{##1}{##2}{##3}{##4}{##5}}%
+ \forest@nodewalk@shortsteps}}
+\csdef{forest@nodewalk@defshortstep@6@args}#1#2{%
+ \csdef{forest@shortstep@#1}##1##2##3##4##5##6{%
+ \edef\forest@marshal####1####2####3####4####5####6{#2}%
+ \eapptotoks\forest@nodewalk@shortsteps@resolution{,\forest@marshal{##1}{##2}{##3}{##4}{##5}{##6}}%
+ \forest@nodewalk@shortsteps}}
+\csdef{forest@nodewalk@defshortstep@7@args}#1#2{%
+ \csdef{forest@shortstep@#1}##1##2##3##4##5##6##7{%
+ \edef\forest@marshal####1####2####3####4####5####6####7{#2}%
+ \eapptotoks\forest@nodewalk@shortsteps@resolution{,\forest@marshal{##1}{##2}{##3}{##4}{##5}{##6}{##7}}%
+ \forest@nodewalk@shortsteps}}
+\csdef{forest@nodewalk@defshortstep@8@args}#1#2{%
+ \csdef{forest@shortstep@#1}##1##2##3##4##5##6##7##8{%
+ \edef\forest@marshal####1####2####3####4####5####6####7####8{#2}%
+ \eapptotoks\forest@nodewalk@shortsteps@resolution{,\forest@marshal{##1}{##2}{##3}{##4}{##5}{##6}{##7}{##8}}%
+ \forest@nodewalk@shortsteps}}
+\csdef{forest@nodewalk@defshortstep@9@args}#1#2{%
+ \csdef{forest@shortstep@#1}##1##2##3##4##5##6##7##8##9{%
+ \edef\forest@marshal####1####2####3####4####5####6####7####8####9{#2}%
+ \eapptotoks\forest@nodewalk@shortsteps@resolution{,\forest@marshal{##1}{##2}{##3}{##4}{##5}{##6}{##7}{##8}{##9}}%
+ \forest@nodewalk@shortsteps}}
+\forestset{
+ define short step/.code n args=3{% #1 = short step, #2 = n args, #3 = long step
+ \csname forest@nodewalk@defshortstep@#2@args\endcsname{#1}{#3}%
+ },
+}
+\def\forest@nodewalk@shortsteps@end#1,{}
+% \end{macrocode}
+%
+% Define short-form steps.
+% \begin{macrocode}
+\forestset{
+ define short step={group}{1}{group={#1}}, % {braces} are special
+ define short step={p}{0}{previous},
+ define short step={n}{0}{next},
+ define short step={u}{0}{parent},
+ define short step={s}{0}{sibling},
+ define short step={c}{0}{current},
+ define short step={o}{0}{origin},
+ define short step={r}{0}{root},
+ define short step={R}{0}{root'},
+ define short step={P}{0}{previous leaf},
+ define short step={N}{0}{next leaf},
+ define short step={F}{0}{first leaf},
+ define short step={L}{0}{last leaf},
+ define short step={>}{0}{next on tier},
+ define short step={<}{0}{previous on tier},
+ define short step={1}{0}{n=1},
+ define short step={2}{0}{n=2},
+ define short step={3}{0}{n=3},
+ define short step={4}{0}{n=4},
+ define short step={5}{0}{n=5},
+ define short step={6}{0}{n=6},
+ define short step={7}{0}{n=7},
+ define short step={8}{0}{n=8},
+ define short step={9}{0}{n=9},
+ define short step={l}{0}{last},
+ define short step={b}{0}{back},
+ define short step={f}{0}{forward},
+ define short step={v}{0}{last valid},
+ define short step={*}{2}{repeat={#1}{#2}},
+ for 1/.style={for nodewalk={n=1}{#1}},
+ for 2/.style={for nodewalk={n=2}{#1}},
+ for 3/.style={for nodewalk={n=3}{#1}},
+ for 4/.style={for nodewalk={n=4}{#1}},
+ for 5/.style={for nodewalk={n=5}{#1}},
+ for 6/.style={for nodewalk={n=6}{#1}},
+ for 7/.style={for nodewalk={n=7}{#1}},
+ for 8/.style={for nodewalk={n=8}{#1}},
+ for 9/.style={for nodewalk={n=9}{#1}},
+ for -1/.style={for nodewalk={n'=1}{#1}},
+ for -2/.style={for nodewalk={n'=2}{#1}},
+ for -3/.style={for nodewalk={n'=3}{#1}},
+ for -4/.style={for nodewalk={n'=4}{#1}},
+ for -5/.style={for nodewalk={n'=5}{#1}},
+ for -6/.style={for nodewalk={n'=6}{#1}},
+ for -7/.style={for nodewalk={n'=7}{#1}},
+ for -8/.style={for nodewalk={n'=8}{#1}},
+ for -9/.style={for nodewalk={n'=9}{#1}},
+}
+% \end{macrocode}
+%
+% Define multiple-step walks.
+% \begin{macrocode}
+\forestset{
+ define long step={tree}{}{\forest@node@foreach{\forest@nodewalk@makestep}},
+ define long step={tree reversed}{}{\forest@node@foreach@reversed{\forest@nodewalk@makestep}},
+ define long step={tree children-first}{}{\forest@node@foreach@childrenfirst{\forest@nodewalk@makestep}},
+ define long step={tree children-first reversed}{}{\forest@node@foreach@childrenfirst@reversed{\forest@nodewalk@makestep}},
+ define long step={tree breadth-first}{}{\forest@node@foreach@breadthfirst{-1}{\forest@nodewalk@makestep}},
+ define long step={tree breadth-first reversed}{}{\forest@node@foreach@breadthfirst@reversed{-1}{\forest@nodewalk@makestep}},
+ define long step={descendants}{}{\forest@node@foreachdescendant{\forest@nodewalk@makestep}},
+ define long step={descendants reversed}{}{\forest@node@foreachdescendant@reversed{\forest@nodewalk@makestep}},
+ define long step={descendants children-first}{}{\forest@node@foreachdescendant@childrenfirst{\forest@nodewalk@makestep}},
+ define long step={descendants children-first reversed}{}{\forest@node@foreachdescendant@childrenfirst@reversed{\forest@nodewalk@makestep}},
+ define long step={descendants breadth-first}{}{\forest@node@foreach@breadthfirst{0}{\forest@nodewalk@makestep}},
+ define long step={descendants breadth-first reversed}{}{\forest@node@foreach@breadthfirst@reversed{0}{\forest@nodewalk@makestep}},
+ define long step={level}{n args=1}{%
+ \forestmathtruncatemacro\forest@temp{#1}%
+ \edef\forest@marshal{%
+ \noexpand\forest@node@foreach@breadthfirst
+ {\forest@temp}%
+ {\noexpand\ifnum\noexpand\forestove{level}=\forest@temp\relax\noexpand\forest@nodewalk@makestep\noexpand\fi}%
+ }\forest@marshal
+ },
+ define long step={level>}{n args=1}{%
+ \forestmathtruncatemacro\forest@temp{#1}%
+ \edef\forest@marshal{%
+ \noexpand\forest@node@foreach@breadthfirst
+ {-1}%
+ {\noexpand\ifnum\noexpand\forestove{level}<\forest@temp\relax\noexpand\else\noexpand\forest@nodewalk@makestep\noexpand\fi}%
+ }\forest@marshal
+ },
+ define long step={level<}{n args=1}{%
+ \forestmathtruncatemacro\forest@temp{(#1)-1}%
+ \ifnum\forest@temp=-1
+ % special case, as \forest@node@foreach@breadthfirst uses level<0 as a signal for unlimited max level
+ \ifnum\forestove{level}=0
+ \forest@nodewalk@makestep
+ \fi
+ \else
+ \edef\forest@marshal{%
+ \noexpand\forest@node@foreach@breadthfirst
+ {\forest@temp}%
+ {\noexpand\forest@nodewalk@makestep}%
+ }\forest@marshal
+ \fi
+ },
+ define long step={level reversed}{n args=1}{%
+ \forestmathtruncatemacro\forest@temp{#1}%
+ \edef\forest@marshal{%
+ \noexpand\forest@node@foreach@breadthfirst@reversed
+ {\forest@temp}%
+ {\noexpand\ifnum\noexpand\forestove{level}=\forest@temp\relax\noexpand\forest@nodewalk@makestep\noexpand\fi}%
+ }\forest@marshal
+ },
+ define long step={level reversed>}{n args=1}{%
+ \forestmathtruncatemacro\forest@temp{#1}%
+ \edef\forest@marshal{%
+ \noexpand\forest@node@foreach@breadthfirst@reversed
+ {-1}%
+ {\noexpand\ifnum\noexpand\forestove{level}<\forest@temp\relax\noexpand\else\noexpand\forest@nodewalk@makestep\noexpand\fi}%
+ }\forest@marshal
+ },
+ define long step={level reversed<}{n args=1}{%
+ \forestmathtruncatemacro\forest@temp{(#1)-1}%
+ \edef\forest@marshal{%
+ \noexpand\forest@node@foreach@breadthfirst@reversed
+ {\forest@temp}%
+ {\noexpand\forest@nodewalk@makestep}%
+ }\forest@marshal
+ },
+ %
+ define long step={relative level}{n args=1}{%
+ \forestmathtruncatemacro\forest@temp{(#1)+\forestove{level}}%
+ \edef\forest@marshal{%
+ \noexpand\forest@node@foreach@breadthfirst
+ {\forest@temp}%
+ {\noexpand\ifnum\noexpand\forestove{level}=\forest@temp\relax\noexpand\forest@nodewalk@makestep\noexpand\fi}%
+ }\forest@marshal
+ },
+ define long step={relative level>}{n args=1}{%
+ \forestmathtruncatemacro\forest@temp{(#1)+\forestove{level}}%
+ \edef\forest@marshal{%
+ \noexpand\forest@node@foreach@breadthfirst
+ {-1}%
+ {\noexpand\ifnum\noexpand\forestove{level}<\forest@temp\relax\noexpand\else\noexpand\forest@nodewalk@makestep\noexpand\fi}%
+ }\forest@marshal
+ },
+ define long step={relative level<}{n args=1}{%
+ \forestmathtruncatemacro\forest@temp{(#1)+\forestove{level}-1}%
+ \edef\forest@marshal{%
+ \noexpand\forest@node@foreach@breadthfirst
+ {\forest@temp}%
+ {\noexpand\forest@nodewalk@makestep}%
+ }\forest@marshal
+ },
+ define long step={relative level reversed}{n args=1}{%
+ \forestmathtruncatemacro\forest@temp{(#1)+\forestove{level}}%
+ \edef\forest@marshal{%
+ \noexpand\forest@node@foreach@breadthfirst@reversed
+ {\forest@temp}%
+ {\noexpand\ifnum\noexpand\forestove{level}=\forest@temp\relax\noexpand\forest@nodewalk@makestep\noexpand\fi}%
+ }\forest@marshal
+ },
+ define long step={relative level reversed>}{n args=1}{%
+ \forestmathtruncatemacro\forest@temp{(#1)+\forestove{level}}%
+ \edef\forest@marshal{%
+ \noexpand\forest@node@foreach@breadthfirst@reversed
+ {-1}%
+ {\noexpand\ifnum\noexpand\forestove{level}<\forest@temp\relax\noexpand\else\noexpand\forest@nodewalk@makestep\noexpand\fi}%
+ }\forest@marshal
+ },
+ define long step={relative level reversed<}{n args=1}{%
+ \forestmathtruncatemacro\forest@temp{(#1)+\forestove{level}-1}%
+ \edef\forest@marshal{%
+ \noexpand\forest@node@foreach@breadthfirst@reversed
+ {\forest@temp}%
+ {\noexpand\forest@nodewalk@makestep}%
+ }\forest@marshal
+ },
+ define long step={leaves}{}{%
+ \forest@node@foreach{%
+ \ifnum\forestove{n children}=0
+ \forest@nodewalk@makestep
+ \fi
+ }%
+ },
+ define long step={-level}{n args=1,style}{%
+ unique={branch={leaves,{group={repeat={#1}{parent}}}}}
+ },
+ define long step={-level'}{n args=1,style}{%
+ unique={on invalid={fake}{branch={leaves,{group={repeat={#1}{parent}}}}}}
+ },
+ define long step={children}{}{\forest@node@foreachchild{\forest@nodewalk@makestep}},
+ define long step={children reversed}{}{\forest@node@foreachchild@reversed{\forest@nodewalk@makestep}},
+ define long step={current and following siblings}{}{\forest@node@@forselfandfollowingsiblings{\forest@nodewalk@makestep}},
+ define long step={following siblings}{style}{if nodewalk valid={next}{fake=next,current and following siblings}{}},
+ define long step={current and preceding siblings}{}{\forest@node@@forselfandprecedingsiblings{\forest@nodewalk@makestep}},
+ define long step={preceding siblings}{style}{if nodewalk valid={previous}{fake=previous,current and preceding siblings}{}},
+ define long step={current and following siblings reversed}{}{\forest@node@@forselfandfollowingsiblings@reversed{\forest@nodewalk@makestep}},
+ define long step={following siblings reversed}{style}{fake=next,current and following siblings reversed},
+ define long step={current and preceding siblings reversed}{}{\forest@node@@forselfandprecedingsiblings@reversed{\forest@nodewalk@makestep}},
+ define long step={preceding siblings reversed}{style}{fake=previous,current and preceding siblings reversed},
+ define long step={siblings}{style}{for nodewalk'={preceding siblings},following siblings},
+ define long step={siblings reversed}{style}{for nodewalk'={following siblings reversed},preceding siblings reversed},
+ define long step={current and siblings}{style}{for nodewalk'={preceding siblings},current and following siblings},
+ define long step={current and siblings reversed}{style}{for nodewalk'={current and following siblings reversed},preceding siblings reversed},
+ define long step={ancestors}{style}{while={}{parent},last valid},
+ define long step={current and ancestors}{style}{current,ancestors},
+ define long step={following nodes}{style}{while={}{next node},last valid},
+ define long step={preceding nodes}{style}{while={}{previous node},last valid},
+ define long step={current and following nodes}{style}{current,following nodes},
+ define long step={current and preceding nodes}{style}{current,preceding nodes},
+}
+\let\forest@nodewalkstephandler@styletrueorfalse\forest@nodewalkstephandler@styletrue
+% \end{macrocode}
+%
+%
+% \subsection{Dynamic tree}
+% \label{sec:impl:dynamic}
+%
+% \begin{macrocode}
+\def\forest@last@node{0}
+\csdef{forest@nodewalk@saved@dynamic nodes}{}
+\def\forest@nodehandleby@name@nodewalk@or@bracket#1{%
+ \ifx\pgfkeysnovalue#1%
+ \edef\forest@last@node{\forest@node@Nametoid{forest@last@node}}%
+ \else
+ \forest@nodehandleby@nnb@checkfirst#1\forest@END
+ \fi
+}
+\def\forest@nodehandleby@nnb@checkfirst#1#2\forest@END{%
+ \ifx[#1%]
+ \forest@create@node{#1#2}%
+ \cseappto{forest@nodewalk@saved@dynamic nodes}{\forest@last@node,}%
+ \else
+ \forest@forthis{%
+ \forest@nameandgo{#1#2}%
+ \ifnum\forest@cn=0
+ \PackageError{forest}{Cannot use a dynamic key on the invalid node}{}%
+ \fi
+ \let\forest@last@node\forest@cn
+ }%
+ \fi
+}
+\def\forest@create@node#1{% #1=bracket representation
+ \bracketParse{\forest@create@collectafterthought}%
+ \forest@last@node=#1\forest@end@create@node
+}
+\def\forest@create@collectafterthought#1\forest@end@create@node{%
+ \forest@node@Foreach{\forest@last@node}{%
+ \forestoleto{delay}{given options}%
+ \forestoset{given options}{}%
+ }%
+ \forestOeappto{\forest@last@node}{delay}{,\unexpanded{#1}}%
+ \forestOset{\forest@last@node}{given options}{delay={}}%
+}
+\def\forest@create@node@and@process@given@options#1{% #1=bracket representation
+ \bracketParse{\forest@createandprocess@collectafterthought}%
+ \forest@last@node=#1\forest@end@create@node
+}
+\def\forest@createandprocess@collectafterthought#1\forest@end@create@node{%
+ \forest@node@Compute@numeric@ts@info{\forest@last@node}%
+ \forest@saveandrestoremacro\forest@root{%
+ \let\forest@root\forest@last@node
+ \forestset{process keylist=given options}%
+ }%
+}
+\def\forest@saveandrestoremacro#1#2{% #1 = the (zero-arg) macro to save before and restore after processing code in #2
+ \edef\forest@marshal{%
+ \unexpanded{#2}%
+ \noexpand\def\noexpand#1{\expandonce{#1}}%
+ }\forest@marshal
+}
+\def\forest@saveandrestoreifcs#1#2{% #1 = the if cs to save before and restore after processing code in #2
+ \edef\forest@marshal{%
+ \unexpanded{#2}%
+ \ifbool{#1}{\noexpand\setbool{#1}{true}}{\noexpand\setbool{#1}{false}}%
+ }\forest@marshal
+}
+\def\forest@globalsaveandrestoreifcs#1#2{% #1 = the if cs to save before and restore after processing code in #2
+ \edef\forest@marshal{%
+ \unexpanded{#2}%
+ \ifbool{#1}{\global\noexpand\setbool{#1}{true}}{\global\noexpand\setbool{#1}{false}}%
+ }\forest@marshal
+}
+\def\forest@saveandrestoretoks#1#2{% #1 = the toks to save before and restore after processing code in #2
+ \edef\forest@marshal{%
+ \unexpanded{#2}%
+ \noexpand#1{\the#1}%
+ }\forest@marshal
+}
+\def\forest@saveandrestoreregister#1#2{% #1 = the register to save before and restore after processing code in #2
+ \edef\forest@marshal{%
+ \unexpanded{#2}%
+ \noexpand\forestrset{#1}{\forestregister{#1}}%
+ }\forest@marshal
+}
+\forestset{
+ save and restore register/.code 2 args={%
+ \forest@saveandrestoreregister{#1}{%
+ \pgfkeysalso{#2}%
+ }%
+ },
+}
+\def\forest@remove@node#1{%
+ \ifforestdebugdynamics\forestdebug@dynamics{before removing #1}\fi
+ \forest@node@Remove{#1}%
+}
+\def\forest@append@node#1#2{%
+ \ifforestdebugdynamics\forestdebug@dynamics{before appending #2 to #1}\fi
+ \forest@dynamic@circularitytest{#2}{#1}{append}%
+ \forest@node@Remove{#2}%
+ \forest@node@Append{#1}{#2}%
+}
+\def\forest@prepend@node#1#2{%
+ \ifforestdebugdynamics\forestdebug@dynamics{before prepending #2 to #1}\fi
+ \forest@dynamic@circularitytest{#2}{#1}{prepend}%
+ \forest@node@Remove{#2}%
+ \forest@node@Prepend{#1}{#2}%
+}
+\def\forest@insertafter@node#1#2{%
+ \ifforestdebugdynamics\forestdebug@dynamics{before inserting #2 after #1}\fi
+ \forest@node@Remove{#2}%
+ \forest@node@Insertafter{\forestOve{#1}{@parent}}{#2}{#1}%
+}
+\def\forest@insertbefore@node#1#2{%
+ \ifforestdebugdynamics\forestdebug@dynamics{before inserting #2 before #1}\fi
+ \forest@node@Remove{#2}%
+ \forest@node@Insertbefore{\forestOve{#1}{@parent}}{#2}{#1}%
+}
+\def\forest@set@root#1#2{%
+ \ifforestdebugdynamics\forestdebug@dynamics{before setting #1 as root}\fi
+ \def\forest@root{#2}%
+}
+\def\forest@dynamic@circularitytest#1#2#3{%
+ % #1=potenitial ancestor,#2=potential descendant, #3=message prefix
+ \ifnum#1=#2
+ \forest@circularityerror{#1}{#2}{#3}%
+ \else
+ \forest@fornode{#1}{%
+ \forest@ifancestorof{#2}{\forest@circularityerror{#1}{#2}{#3}}{}%
+ }%
+ \fi
+}
+\def\forest@circularityerror#1#2#3{%
+ \forestdebug@typeouttrees{\forest@temp}%
+ \PackageError{forest}{#3ing node id=#1 to id=#2 would result in a circular tree\MessageBreak forest of ids: \forest@temp}{}%
+}%
+\def\forestdebug@dynamics#1{%
+ \forestdebug@typeouttrees\forest@temp
+ \typeout{#1: \forest@temp}%
+}
+\def\forest@appto@do@dynamics#1#2{%
+ \forest@nodehandleby@name@nodewalk@or@bracket{#2}%
+ \ifcase\forest@dynamics@copyhow\relax\or
+ \forest@tree@copy{\forest@last@node}\forest@last@node
+ \or
+ \forest@node@copy{\forest@last@node}\forest@last@node
+ \fi
+ \forest@node@Ifnamedefined{forest@last@node}{%
+ \forestOepreto{\forest@last@node}{delay}
+ {for id={\forest@node@Nametoid{forest@last@node}}{alias=forest@last@node},}%
+ }{}%
+ \edef\forest@marshal{%
+ \noexpand\apptotoks\noexpand\forest@do@dynamics{%
+ \noexpand#1{\forest@cn}{\forest@last@node}}%
+ }\forest@marshal
+}
+\forestset{%
+ create/.code={%
+ \forest@create@node{#1}%
+ \forest@fornode{\forest@last@node}{%
+ \forest@node@setalias{forest@last@node}%
+ \cseappto{forest@nodewalk@saved@dynamic nodes}{\forest@last@node,}%
+ }%
+ },
+ create'/.code={%
+ \forest@create@node@and@process@given@options{#1}%
+ \forest@fornode{\forest@last@node}{%
+ \forest@node@setalias{forest@last@node}%
+ \cseappto{forest@nodewalk@saved@dynamic nodes}{\forest@last@node,}%
+ }%
+ },
+ append/.code={\def\forest@dynamics@copyhow{0}\forest@appto@do@dynamics\forest@append@node{#1}},
+ prepend/.code={\def\forest@dynamics@copyhow{0}\forest@appto@do@dynamics\forest@prepend@node{#1}},
+ insert after/.code={\def\forest@dynamics@copyhow{0}\forest@appto@do@dynamics\forest@insertafter@node{#1}},
+ insert before/.code={\def\forest@dynamics@copyhow{0}\forest@appto@do@dynamics\forest@insertbefore@node{#1}},
+ append'/.code={\def\forest@dynamics@copyhow{1}\forest@appto@do@dynamics\forest@append@node{#1}},
+ prepend'/.code={\def\forest@dynamics@copyhow{1}\forest@appto@do@dynamics\forest@prepend@node{#1}},
+ insert after'/.code={\def\forest@dynamics@copyhow{1}\forest@appto@do@dynamics\forest@insertafter@node{#1}},
+ insert before'/.code={\def\forest@dynamics@copyhow{1}\forest@appto@do@dynamics\forest@insertbefore@node{#1}},
+ append''/.code={\def\forest@dynamics@copyhow{2}\forest@appto@do@dynamics\forest@append@node{#1}},
+ prepend''/.code={\def\forest@dynamics@copyhow{2}\forest@appto@do@dynamics\forest@prepend@node{#1}},
+ insert after''/.code={\def\forest@dynamics@copyhow{2}\forest@appto@do@dynamics\forest@insertafter@node{#1}},
+ insert before''/.code={\def\forest@dynamics@copyhow{2}\forest@appto@do@dynamics\forest@insertbefore@node{#1}},
+ remove/.code={%
+ \pgfkeysalso{alias=forest@last@node}%
+ \cseappto{forest@nodewalk@saved@dynamic nodes}{\forest@cn,}%
+ \expandafter\apptotoks\expandafter\forest@do@dynamics\expandafter{%
+ \expandafter\forest@remove@node\expandafter{\forest@cn}}%
+ },
+ set root/.code={%
+ \def\forest@dynamics@copyhow{0}%
+ \forest@appto@do@dynamics\forest@set@root{#1}%
+ },
+ replace by/.code={\forest@replaceby@code{#1}{insert after}},
+ replace by'/.code={\forest@replaceby@code{#1}{insert after'}},
+ replace by''/.code={\forest@replaceby@code{#1}{insert after''}},
+ sort/.code={%
+ \eapptotoks\forest@do@dynamics{%
+ \def\noexpand\forest@nodesort@sortkey{\forestrv{sort by}}%
+ \noexpand\forest@nodesort\noexpand\forest@sort@ascending{\forest@cn}
+ }%
+ },
+ sort'/.code={%
+ \eapptotoks\forest@do@dynamics{%
+ \def\noexpand\forest@nodesort@sortkey{\forestrv{sort by}}%
+ \noexpand\forest@nodesort\noexpand\forest@sort@descending{\forest@cn}
+ }%
+ },
+}
+\def\forest@replaceby@code#1#2{%#1=node spec,#2=insert after['][']
+ \ifnum\forestove{@parent}=0
+ \cseappto{forest@nodewalk@saved@dynamic nodes}{\forest@cn,}%
+ \pgfkeysalso{alias=forest@last@node,set root={#1}}%
+ \else
+ \cseappto{forest@nodewalk@saved@dynamic nodes}{\forest@cn,}%
+ \pgfkeysalso{alias=forest@last@node,#2={#1}}%
+ \eapptotoks\forest@do@dynamics{%
+ \noexpand\ifnum\noexpand\forestOve{\forest@cn}{@parent}=\forestove{@parent}
+ \noexpand\forest@remove@node{\forest@cn}%
+ \noexpand\fi
+ }%
+ \fi
+}
+\def\forest@nodesort#1#2{% #1 = direction, #2 = parent node
+ \ifforestdebugdynamics\forestdebug@dynamics{before sorting children of #2}\fi
+ \forest@fornode{#2}{\forest@nodesort@#1}%
+ \ifforestdebugdynamics\forestdebug@dynamics{after sorting children of #2}\fi
+}
+\def\forest@nodesort@#1{%
+ % prepare the array of child ids
+ \c@pgf@counta=0
+ \forestoget{@first}\forest@nodesort@id
+ \forest@loop
+ \ifnum\forest@nodesort@id>0
+ \advance\c@pgf@counta 1
+ \csedef{forest@nodesort@\the\c@pgf@counta}{\forest@nodesort@id}%
+ \forestOget{\forest@nodesort@id}{@next}\forest@nodesort@id
+ \forest@repeat
+ % sort
+ \forestoget{n children}\forest@nodesort@n
+ \forest@sort\forest@nodesort@cmpnodes\forest@nodesort@let#1{1}{\forest@nodesort@n}%
+ % remove all children
+ \forestoget{@first}\forest@nodesort@id
+ \forest@loop
+ \ifnum\forest@nodesort@id>0
+ \forest@node@Remove{\forest@nodesort@id}%
+ \forestoget{@first}\forest@nodesort@id
+ \forest@repeat
+ % insert the children in new order
+ \c@pgf@counta=0
+ \forest@loop
+ \ifnum\c@pgf@counta<\forest@nodesort@n\relax
+ \advance\c@pgf@counta 1
+ \forest@node@append{\csname forest@nodesort@\the\c@pgf@counta\endcsname}%
+ \forest@repeat
+}
+\def\forest@nodesort@cmpnodes#1#2{%
+ \expandafter\forest@nodesort@cmpnodes@\forest@nodesort@sortkey,\forest@END{#1}{#2}%
+}
+\def\forest@nodesort@cmpnodes@#1,#2\forest@END#3#4{%
+ % #1=process ins+arg for this dimension, #2=for next dimensions
+ % #3, #4 = node ids
+ {%
+ \forest@fornode{\csname forest@nodesort@#3\endcsname}{%
+ \forestmathsetmacro\forest@nodesort@resulta{#1}%
+ }%
+ \forest@fornode{\csname forest@nodesort@#4\endcsname}{%
+ \forestmathsetmacro\forest@nodesort@resultb{#1}%
+ }%
+ \ifx\forestmathresulttype\forestmathtype@generic
+ \forest@cmp@error{\forest@nodesort@resulta}{\forest@nodesort@resultb}%
+ \fi
+ \edef\forest@temp{%
+ \noexpand\forest@nodesort@cmp
+ {\expandonce{\forest@nodesort@resulta}}%
+ {\expandonce{\forest@nodesort@resultb}}%
+ }%
+ \xdef\forest@global@temp{\forest@temp}%
+ }%
+ \if=\forest@global@temp
+ \let\forest@next\forest@nodesort@cmpnodes@
+ \else
+ \let\forest@next\forest@nodesort@cmpnodes@finish
+ \fi
+ \ifstrempty{#2}{\let\forest@next\forest@nodesort@cmpnodes@finish}{}%
+ \forest@next#2\forest@END{#3}{#4}%
+}
+\def\forest@nodesort@cmpnodes@finish#1\forest@END#2#3{%
+ \let\forest@sort@cmp@result\forest@global@temp
+}
+% \end{macrocode}
+% Usage: |\forest@nodesort@cmp|\meta{first}\meta{second}. Fully expandable. Return |<|, |=| or |>|, as required by |\forest@sort|.
+% \begin{macrocode}
+\def\forest@nodesort@cmp{\csname fRsT@nsc@\forestmathresulttype\endcsname}
+\def\fRsT@nsc@#1{\csname fRsT@nsc@#1\endcsname}
+\def\fRsT@nsc@n#1#2{\ifnum#1<#2 <\else\ifnum#1=#2 =\else>\fi\fi}
+\def\fRsT@nsc@d#1#2{\ifdim#1<#2 <\else\ifdim#1=#2 =\else>\fi\fi}
+\def\fRsT@nsc@P#1#2{\ifdim#1pt<#2pt <\else\ifdim#1pt=#2pt =\else>\fi\fi}
+\def\fRsT@nsc@t#1#2{\csname fRsT@nsc@\pdfstrcmp{#1}{#2}\endcsname}
+\def\fRsT@nsc@T#1#2{\csname fRsT@nsc@\pdfstrcmp{#2}{#1}\endcsname}
+\csdef{fRsT@nsc@-1}{<}
+\csdef{fRsT@nsc@0}{=}
+\csdef{fRsT@nsc@1}{>}
+\def\forest@nodesort@let#1#2{%
+ \csletcs{forest@nodesort@#1}{forest@nodesort@#2}%
+}
+\forestset{
+ define long step={last dynamic node}{style,must start at valid node=false}{%
+ name=forest@last@node
+ }
+}
+% \end{macrocode}
+%
+% \section{Stages}
+%
+% \begin{macrocode}
+\def\forest@root{0}
+ %%% begin listing region: stages
+\forestset{
+ stages/.style={
+ for root'={
+ process keylist register=default preamble,
+ process keylist register=preamble
+ },
+ process keylist=given options,
+ process keylist=before typesetting nodes,
+ typeset nodes stage,
+ process keylist=before packing,
+ pack stage,
+ process keylist=before computing xy,
+ compute xy stage,
+ process keylist=before drawing tree,
+ draw tree stage
+ },
+ typeset nodes stage/.style={for root'=typeset nodes},
+ pack stage/.style={for root'=pack},
+ compute xy stage/.style={for root'=compute xy},
+ draw tree stage/.style={for root'=draw tree},
+}
+ %%% end listing region: stages
+\forestset{
+ process keylist/.code={%
+ \forest@process@hook@keylist{#1}{#1 processing order/.try,processing order/.lastretry}},
+ process keylist'/.code 2 args={\forest@process@hook@keylist@nodynamics{#1}{#2}},
+ process keylist''/.code 2 args={\forest@process@hook@keylist@{#1}{#2}},
+ process keylist register/.code={\forest@process@keylist@register{#1}},
+ process delayed/.code={%
+ \forest@havedelayedoptions{@delay}{#1}%
+ \ifforest@havedelayedoptions
+ \forest@process@hook@keylist@nodynamics{@delay}{#1}%
+ \fi
+ },
+ do dynamics/.code={%
+ \the\forest@do@dynamics
+ \forest@do@dynamics{}%
+ \forest@node@Compute@numeric@ts@info{\forest@root}%
+ },
+ declare keylist={given options}{},
+ declare keylist={before typesetting nodes}{},
+ declare keylist={before packing}{},
+ declare keylist={before packing node}{},
+ declare keylist={after packing node}{},
+ declare keylist={before computing xy}{},
+ declare keylist={before drawing tree}{},
+ declare keylist={delay}{},
+ delay n/.code 2 args={%
+ \forestmathsetcount\forest@temp@count{#1}%
+ \pgfkeysalso{delay n'={\forest@temp@count}{#2}}%
+ },
+ delay n'/.code 2 args={
+ \ifnum#1=0
+ \pgfkeysalso{#2}%
+ \else
+ \pgfkeysalso{delay={delay n'/.expand once=\expandafter{\number\numexpr#1-1\relax}{#2}}}%
+ \fi
+ },
+ if have delayed/.style 2 args={if have delayed'={processing order}{#1}{#2}},
+ if have delayed'/.code n args=3{%
+ \forest@havedelayedoptionsfalse
+ \forest@forthis{%
+ \forest@nodewalk{#1}{%
+ TeX={%
+ \forestoget{delay}\forest@temp@delayed
+ \ifdefempty\forest@temp@delayed{}{\forest@havedelayedoptionstrue}%
+ }%
+ }%
+ }%
+ \ifforest@havedelayedoptions\pgfkeysalso{#2}\else\pgfkeysalso{#3}\fi
+ },
+ typeset nodes/.code={%
+ \forest@drawtree@preservenodeboxes@false
+ \forest@nodewalk
+ {typeset nodes processing order/.try,processing order/.lastretry}%
+ {TeX={\forest@node@typeset}}%
+ },
+ typeset nodes'/.code={%
+ \forest@drawtree@preservenodeboxes@true
+ \forest@nodewalk
+ {typeset nodes processing order/.try,processing order/.lastretry}%
+ {TeX={\forest@node@typeset}}%
+ },
+ typeset node/.code={%
+ \forest@drawtree@preservenodeboxes@false
+ \forest@node@typeset
+ },
+ pack/.code={\forest@pack},
+ pack'/.code={\forest@pack@onlythisnode},
+ compute xy/.code={\forest@node@computeabsolutepositions},
+ draw tree box/.store in=\forest@drawtreebox,
+ draw tree box,
+ draw tree/.code={%
+ \forest@drawtree@preservenodeboxes@false
+ \forest@node@drawtree
+ },
+ draw tree'/.code={%
+ \forest@drawtree@preservenodeboxes@true
+ \forest@node@drawtree
+ },
+ %%% begin listing region: draw_tree_method
+ draw tree method/.style={
+ for nodewalk={
+ draw tree nodes processing order/.try,
+ draw tree processing order/.retry,
+ processing order/.lastretry
+ }{draw tree node},
+ for nodewalk={
+ draw tree edges processing order/.try,
+ draw tree processing order/.retry,
+ processing order/.lastretry
+ }{draw tree edge},
+ for nodewalk={
+ draw tree tikz processing order/.try,
+ draw tree processing order/.retry,
+ processing order/.lastretry
+ }{draw tree tikz}
+ },
+ %%% end listing region: draw_tree_method
+ draw tree node/.code={\forest@draw@node},
+ draw tree node'/.code={\forest@draw@node@},
+ if node drawn/.code n args={3}{%
+ \forest@forthis{%
+ \forest@configured@nodewalk{independent}{inherited}{fake}{#1}{}%
+ \ifnum\forest@cn=0
+ \forest@tempfalse
+ \else
+ \ifcsdef{forest@drawn@\forest@cn}{\forest@temptrue}{\forest@tempfalse}%
+ \fi
+ }%
+ \ifforest@temp\pgfkeysalso{#2}\else\pgfkeysalso{#3}\fi
+ },
+ draw tree edge/.code={\forest@draw@edge},
+ draw tree edge'/.code={\forest@draw@edge@},
+ draw tree tikz/.code={\forest@draw@tikz@}, % always!
+ draw tree tikz'/.code={\forest@draw@tikz@},
+ processing order/.nodewalk style={tree},
+ %given options processing order/.style={processing order},
+ %before typesetting nodes processing order/.style={processing order},
+ %before packing processing order/.style={processing order},
+ %before computing xy processing order/.style={processing order},
+ %before drawing tree processing order/.style={processing order},
+}
+\newtoks\forest@do@dynamics
+\newif\ifforest@havedelayedoptions
+\def\forest@process@hook@keylist#1#2{%,#1=keylist,#2=processing order nodewalk
+ \safeloop
+ \forest@fornode{\forest@root}{\forest@process@hook@keylist@{#1}{#2}}%
+ \expandafter\ifstrempty\expandafter{\the\forest@do@dynamics}{}{%
+ \the\forest@do@dynamics
+ \forest@do@dynamics={}%
+ \forest@node@Compute@numeric@ts@info{\forest@root}%
+ }%
+ \forest@fornode{\forest@root}{\forest@havedelayedoptions{#1}{#2}}%
+ \ifforest@havedelayedoptions
+ \saferepeat
+}
+\def\forest@process@hook@keylist@nodynamics#1#2{%#1=keylist,#2=processing order nodewalk
+ % note: this macro works on (nodewalk starting at) the current node
+ \safeloop
+ \forest@forthis{\forest@process@hook@keylist@{#1}{#2}}%
+ \forest@havedelayedoptions{#1}{#2}%
+ \ifforest@havedelayedoptions
+ \saferepeat
+}
+\def\forest@process@hook@keylist@#1#2{%#1=keylist,#2=processing order nodewalk
+ \forest@nodewalk{#2}{%
+ TeX={%
+ \forestoget{#1}\forest@temp@keys
+ \ifdefvoid\forest@temp@keys{}{%
+ \forestoset{#1}{}%
+ \expandafter\forestset\expandafter{\forest@temp@keys}%
+ }%
+ }%
+ }%
+}
+\def\forest@process@keylist@register#1{%
+ \edef\forest@marshal{%
+ \noexpand\forestset{\forestregister{#1}}%
+ }\forest@marshal
+}
+% \end{macrocode}
+% Clear the keylist, transfer delayed into it, and set |\ifforest@havedelayedoptions|.
+% \begin{macrocode}
+\def\forest@havedelayedoptions#1#2{%#1 = keylist, #2=nodewalk
+ \forest@havedelayedoptionsfalse
+ \forest@forthis{%
+ \forest@nodewalk{#2}{%
+ TeX={%
+ \forestoget{delay}\forest@temp@delayed
+ \ifdefempty\forest@temp@delayed{}{\forest@havedelayedoptionstrue}%
+ \forestolet{#1}\forest@temp@delayed
+ \forestoset{delay}{}%
+ }%
+ }%
+ }%
+}
+% \end{macrocode}
+%
+% \subsection{Typesetting nodes}
+%
+% \begin{macrocode}
+\def\forest@node@typeset{%
+ \let\forest@next\forest@node@typeset@
+ \forestoifdefined{@box}{%
+ \forestoget{@box}\forest@temp
+ \ifdefempty\forest@temp{%
+ \locbox\forest@temp@box
+ \forestolet{@box}\forest@temp@box
+ }{%
+ \ifforest@drawtree@preservenodeboxes@
+ \let\forest@next\relax
+ \fi
+ }%
+ }{%
+ \locbox\forest@temp@box
+ \forestolet{@box}\forest@temp@box
+ }%
+ \def\forest@node@typeset@restore{}%
+ \ifdefined\ifsa@tikz\forest@standalone@hack\fi
+ \forest@next
+ \forest@node@typeset@restore
+}
+\def\forest@standalone@hack{%
+ \ifsa@tikz
+ \let\forest@standalone@tikzpicture\tikzpicture
+ \let\forest@standalone@endtikzpicture\endtikzpicture
+ \let\tikzpicture\sa@orig@tikzpicture
+ \let\endtikzpicture\sa@orig@endtikzpicture
+ \def\forest@node@typeset@restore{%
+ \let\tikzpicture\forest@standalone@tikzpicture
+ \let\endtikzpicture\forest@standalone@endtikzpicture
+ }%
+ \fi
+}
+\newbox\forest@box
+\def\forest@pgf@notyetpositioned{not yet positionedPGFINTERNAL}
+\def\forest@node@typeset@{%
+ \forestanchortotikzanchor{anchor}\forest@temp
+ \edef\forest@marshal{%
+ \noexpand\forestolet{anchor}\noexpand\forest@temp
+ \noexpand\forest@node@typeset@@
+ \noexpand\forestoset{anchor}{\forestov{anchor}}%
+ }\forest@marshal
+}
+\def\forest@node@typeset@@{%
+ \forestoget{name}\forest@nodename
+ \edef\forest@temp@nodeformat{\forestove{node format}}%
+ \gdef\forest@smuggle{}%
+ \setbox0=\hbox{%
+ \begin{tikzpicture}[%
+ /forest/copy command key={/tikz/anchor}{/tikz/forest@orig@anchor},
+ anchor/.style={%
+ /forest/TeX={\forestanchortotikzanchor{##1}\forest@temp@anchor},
+ forest@orig@anchor/.expand once=\forest@temp@anchor
+ }]
+ \pgfpositionnodelater{\forest@positionnodelater@save}%
+ \forest@temp@nodeformat
+ \pgfinterruptpath
+ \pgfpointanchor{\forest@pgf@notyetpositioned\forest@nodename}{forestcomputenodeboundary}%
+ \endpgfinterruptpath
+ \end{tikzpicture}%
+ }%
+ \setbox\forestove{@box}=\box\forest@box % smuggle the box
+ \forestolet{@boundary}\forest@global@boundary
+ \forest@smuggle % ... and the rest
+}
+
+
+\forestset{
+ declare readonly dimen={min x}{0pt},
+ declare readonly dimen={min y}{0pt},
+ declare readonly dimen={max x}{0pt},
+ declare readonly dimen={max y}{0pt},
+}
+\def\forest@patch@enormouscoordinateboxbounds@plus#1{%
+ \expandafter\ifstrequal\expandafter{#1}{16000.0pt}{\edef#1{0.0\pgfmath@pt}}{}%
+}
+\def\forest@patch@enormouscoordinateboxbounds@minus#1{%
+ \expandafter\ifstrequal\expandafter{#1}{-16000.0pt}{\edef#1{0.0\pgfmath@pt}}{}%
+}
+\def\forest@positionnodelater@save{%
+ \global\setbox\forest@box=\box\pgfpositionnodelaterbox
+ \xappto\forest@smuggle{\noexpand\forestoset{later@name}{\pgfpositionnodelatername}}%
+ % a bug in pgf? ---well, here's a patch
+ \forest@patch@enormouscoordinateboxbounds@plus\pgfpositionnodelaterminx
+ \forest@patch@enormouscoordinateboxbounds@plus\pgfpositionnodelaterminy
+ \forest@patch@enormouscoordinateboxbounds@minus\pgfpositionnodelatermaxx
+ \forest@patch@enormouscoordinateboxbounds@minus\pgfpositionnodelatermaxy
+ % end of patch
+ % when shape=coordinate, pgf returns \pgfpositionnodelater... with wrong catcode of pt
+ \forest@pnn@addtosmuggle{min x}\pgfpositionnodelaterminx
+ \forest@pnn@addtosmuggle{max x}\pgfpositionnodelatermaxx
+ \forest@pnn@addtosmuggle{min y}\pgfpositionnodelaterminy
+ \forest@pnn@addtosmuggle{max y}\pgfpositionnodelatermaxy
+}
+\def\forest@pnn@addtosmuggle#1#2{%
+ {%
+ \pgfutil@tempdima=#2\relax
+ \xappto\forest@smuggle{\noexpand\forestoset{#1}{\the\pgfutil@tempdima}}%
+ }%
+}
+\def\forest@node@forest@positionnodelater@restore{%
+ \ifforest@drawtree@preservenodeboxes@
+ \let\forest@boxorcopy\copy
+ \else
+ \let\forest@boxorcopy\box
+ \fi
+ \forestoget{@box}\forest@temp
+ \setbox\pgfpositionnodelaterbox=\forest@boxorcopy\forest@temp
+ \edef\pgfpositionnodelatername{\forestove{later@name}}%
+ \edef\pgfpositionnodelaterminx{\forestove{min x}}%
+ \edef\pgfpositionnodelaterminy{\forestove{min y}}%
+ \edef\pgfpositionnodelatermaxx{\forestove{max x}}%
+ \edef\pgfpositionnodelatermaxy{\forestove{max y}}%
+ \ifforest@drawtree@preservenodeboxes@
+ \else
+ \forestoset{@box}{}%
+ \fi
+}
+% \end{macrocode}
+%
+% \subsection{Packing}
+% \label{imp:packing}
+%
+% Method |pack| should be called to calculate the positions of
+% descendant nodes; the positions are stored in attributes |l| and |s|
+% of these nodes, in a level/sibling coordinate system with origin at
+% the parent's anchor.
+% \begin{macrocode}
+\def\forest@pack{%
+ \pgfsyssoftpath@getcurrentpath\forest@pack@original@path
+ \forest@pack@computetiers
+ \forest@pack@computegrowthuniformity
+ \forest@@pack
+ \pgfsyssoftpath@setcurrentpath\forest@pack@original@path
+}
+\def\forest@@pack{%
+ \ifnum\forestove{uniform growth}>0
+ \ifnum\forestove{n children}>0
+ \forest@pack@level@uniform
+ \forest@pack@aligntiers@ofsubtree
+ \forest@pack@sibling@uniform@recursive
+ \fi
+ \else
+ \forest@node@foreachchild{\forest@@pack}%
+ \forest@process@hook@keylist@nodynamics{before packing node}{current}%
+ \ifnum\forestove{n children}>0
+ \forest@pack@level@nonuniform
+ \forest@pack@aligntiers
+ \forest@pack@sibling@uniform@applyreversed
+ \fi
+ \forestoget{after packing node}\forest@temp@keys
+ \forest@process@hook@keylist@nodynamics{after packing node}{current}%
+ \fi
+}
+% \forestset{recalculate tree boundary/.code={\forest@node@recalculate@edges}}
+% \def\forest@node@recalculate@edges{%
+% \edef\forest@marshal{%
+% \noexpand\forest@forthis{\noexpand\forest@node@getedges{\forestove{grow}}}%
+% }\forest@marshal
+% }
+\def\forest@pack@onlythisnode{%
+ \ifnum\forestove{n children}>0
+ \forest@pack@computetiers
+ \forest@pack@level@nonuniform
+ \forest@pack@aligntiers
+ \forest@node@foreachchild{\forestoset{s}{0\pgfmath@pt}}%
+ \forest@pack@sibling@uniform@applyreversed
+ \fi
+}
+% \end{macrocode}
+%
+% Compute growth uniformity for the subtree. A tree grows uniformly is all its branching nodes have
+% the same |grow|.
+% \begin{macrocode}
+\def\forest@pack@computegrowthuniformity{%
+ \forest@node@foreachchild{\forest@pack@computegrowthuniformity}%
+ \edef\forest@pack@cgu@uniformity{%
+ \ifnum\forestove{n children}=0
+ 2\else 1\fi
+ }%
+ \forestoget{grow}\forest@pack@cgu@parentgrow
+ \forest@node@foreachchild{%
+ \ifnum\forestove{uniform growth}=0
+ \def\forest@pack@cgu@uniformity{0}%
+ \else
+ \ifnum\forestove{uniform growth}=1
+ \ifnum\forestove{grow}=\forest@pack@cgu@parentgrow\relax\else
+ \def\forest@pack@cgu@uniformity{0}%
+ \fi
+ \fi
+ \fi
+ }%
+ \forestoget{before packing node}\forest@temp@a
+ \forestoget{after packing node}\forest@temp@b
+ \expandafter\expandafter\expandafter\ifstrempty\expandafter\expandafter\expandafter{\expandafter\forest@temp@a\forest@temp@b}{%
+ \forestolet{uniform growth}\forest@pack@cgu@uniformity
+ }{%
+ \forestoset{uniform growth}{0}%
+ }%
+}
+% \end{macrocode}
+%
+% Pack children in the level dimension in a uniform tree.
+% \begin{macrocode}
+\def\forest@pack@level@uniform{%
+ \let\forest@plu@minchildl\relax
+ \forestoget{grow}\forest@plu@grow
+ \forest@node@foreachchild{%
+ \forest@node@getboundingrectangle@ls{\forest@plu@grow}%
+ \advance\pgf@xa\forestove{l}\relax
+ \ifx\forest@plu@minchildl\relax
+ \edef\forest@plu@minchildl{\the\pgf@xa}%
+ \else
+ \ifdim\pgf@xa<\forest@plu@minchildl\relax
+ \edef\forest@plu@minchildl{\the\pgf@xa}%
+ \fi
+ \fi
+ }%
+ \forest@node@getboundingrectangle@ls{\forest@plu@grow}%
+ \pgfutil@tempdima=\pgf@xb\relax
+ \advance\pgfutil@tempdima -\forest@plu@minchildl\relax
+ \advance\pgfutil@tempdima \forestove{l sep}\relax
+ \ifdim\pgfutil@tempdima>0pt
+ \forest@node@foreachchild{%
+ \forestoeset{l}{\the\dimexpr\forestove{l}+\the\pgfutil@tempdima}%
+ }%
+ \fi
+ \forest@node@foreachchild{%
+ \ifnum\forestove{n children}>0
+ \forest@pack@level@uniform
+ \fi
+ }%
+}
+% \end{macrocode}
+%
+% Pack children in the level dimension in a non-uniform tree. (Expects
+% the children to be fully packed.)
+% \begin{macrocode}
+\def\forest@pack@level@nonuniform{%
+ \let\forest@plu@minchildl\relax
+ \forestoget{grow}\forest@plu@grow
+ \forest@node@foreachchild{%
+ \forest@node@getedge{negative}{\forest@plu@grow}{\forest@plnu@negativechildedge}%
+ \forest@node@getedge{positive}{\forest@plu@grow}{\forest@plnu@positivechildedge}%
+ \def\forest@plnu@childedge{\forest@plnu@negativechildedge\forest@plnu@positivechildedge}%
+ \forest@path@getboundingrectangle@ls\forest@plnu@childedge{\forest@plu@grow}%
+ \advance\pgf@xa\forestove{l}\relax
+ \ifx\forest@plu@minchildl\relax
+ \edef\forest@plu@minchildl{\the\pgf@xa}%
+ \else
+ \ifdim\pgf@xa<\forest@plu@minchildl\relax
+ \edef\forest@plu@minchildl{\the\pgf@xa}%
+ \fi
+ \fi
+ }%
+ \forest@node@getboundingrectangle@ls{\forest@plu@grow}%
+ \pgfutil@tempdima=\pgf@xb\relax
+ \advance\pgfutil@tempdima -\forest@plu@minchildl\relax
+ \advance\pgfutil@tempdima \forestove{l sep}\relax
+ \ifdim\pgfutil@tempdima>0pt
+ \forest@node@foreachchild{%
+ \forestoeset{l}{\the\dimexpr\the\pgfutil@tempdima+\forestove{l}}%
+ }%
+ \fi
+}
+% \end{macrocode}
+%
+% Align tiers.
+% \begin{macrocode}
+\def\forest@pack@aligntiers{%
+ \forestoget{grow}\forest@temp@parentgrow
+ \forestoget{@tiers}\forest@temp@tiers
+ \forlistloop\forest@pack@aligntier@\forest@temp@tiers
+}
+\def\forest@pack@aligntiers@ofsubtree{%
+ \forest@node@foreach{\forest@pack@aligntiers}%
+}
+\def\forest@pack@aligntiers@computeabsl{%
+ \forestoleto{abs@l}{l}%
+ \forest@node@foreachdescendant{\forest@pack@aligntiers@computeabsl@}%
+}
+\def\forest@pack@aligntiers@computeabsl@{%
+ \forestoeset{abs@l}{\the\dimexpr\forestove{l}+\forestOve{\forestove{@parent}}{abs@l}}%
+}
+\def\forest@pack@aligntier@#1{%
+ \forest@pack@aligntiers@computeabsl
+ \pgfutil@tempdima=-\maxdimen\relax
+ \def\forest@temp@currenttier{#1}%
+ \forest@node@foreach{%
+ \forestoget{tier}\forest@temp@tier
+ \ifx\forest@temp@currenttier\forest@temp@tier
+ \ifdim\pgfutil@tempdima<\forestove{abs@l}\relax
+ \pgfutil@tempdima=\forestove{abs@l}\relax
+ \fi
+ \fi
+ }%
+ \ifdim\pgfutil@tempdima=-\maxdimen\relax\else
+ \forest@node@foreach{%
+ \forestoget{tier}\forest@temp@tier
+ \ifx\forest@temp@currenttier\forest@temp@tier
+ \forestoeset{l}{\the\dimexpr\pgfutil@tempdima-\forestove{abs@l}+\forestove{l}}%
+ \fi
+ }%
+ \fi
+}
+% \end{macrocode}
+% Pack children in the sibling dimension in a uniform tree:
+% recursion.
+% \begin{macrocode}
+\def\forest@pack@sibling@uniform@recursive{%
+ \forest@node@foreachchild{\forest@pack@sibling@uniform@recursive}%
+ \forest@pack@sibling@uniform@applyreversed
+}
+% \end{macrocode}
+% Pack children in the sibling dimension in a uniform tree: applyreversed.
+% \begin{macrocode}
+\def\forest@pack@sibling@uniform@applyreversed{%
+ \ifnum\forestove{n children}>1
+ \ifnum\forestove{reversed}=0
+ \forest@pack@sibling@uniform@main{first}{last}{next}{previous}%
+ \else
+ \forest@pack@sibling@uniform@main{last}{first}{previous}{next}%
+ \fi
+ \else
+ \ifnum\forestove{n children}=1
+% \end{macrocode}
+% No need to run packing, but we still need to align the children.
+% \begin{macrocode}
+ \csname forest@calign@\forestove{calign}\endcsname
+ \fi
+ \fi
+}
+% \end{macrocode}
+% Pack children in the sibling dimension in a uniform tree: the main
+% routine.
+% \begin{macrocode}
+\def\forest@pack@sibling@uniform@main#1#2#3#4{%
+% \end{macrocode}
+% Loop through the children. At each iteration, we compute the
+% distance between the negative edge of the current child and the
+% positive edge of the block of the previous children, and then set
+% the |s| attribute of the current child accordingly.
+%
+% We start the loop with the second (to last) child, having
+% initialized the positive edge of the previous children to the
+% positive edge of the first child.
+% \begin{macrocode}
+ \forestoget{@#1}\forest@child
+ \edef\forest@marshal{%
+ \noexpand\forest@fornode{\forestove{@#1}}{%
+ \noexpand\forest@node@getedge
+ {positive}%
+ {\forestove{grow}}%
+ \noexpand\forest@temp@edge
+ }%
+ }\forest@marshal
+ \forest@pack@pgfpoint@childsposition\forest@child
+ \let\forest@previous@positive@edge\pgfutil@empty
+ \forest@extendpath\forest@previous@positive@edge\forest@temp@edge{}%
+ \forestOget{\forest@child}{@#3}\forest@child
+% \end{macrocode}
+% Loop until the current child is the null node.
+% \begin{macrocode}
+ \edef\forest@previous@child@s{0\pgfmath@pt}%
+ \safeloop
+ \unless\ifnum\forest@child=0
+% \end{macrocode}
+% Get the negative edge of the child.
+% \begin{macrocode}
+ \edef\forest@temp{%
+ \noexpand\forest@fornode{\forest@child}{%
+ \noexpand\forest@node@getedge
+ {negative}%
+ {\forestove{grow}}%
+ \noexpand\forest@temp@edge
+ }%
+ }\forest@temp
+% \end{macrocode}
+% Set |\pgf@x| and |\pgf@y| to the position of the child (in the
+% coordinate system of this node).
+% \begin{macrocode}
+ \forest@pack@pgfpoint@childsposition\forest@child
+% \end{macrocode}
+% Translate the edge of the child by the child's position.
+% \begin{macrocode}
+ \let\forest@child@negative@edge\pgfutil@empty
+ \forest@extendpath\forest@child@negative@edge\forest@temp@edge{}%
+% \end{macrocode}
+% Setup the grow line: the angle is given by this node's |grow|
+% attribute.
+% \begin{macrocode}
+ \forest@setupgrowline{\forestove{grow}}%
+% \end{macrocode}
+% Get the distance (wrt the grow line) between the positive edge of
+% the previous children and the negative edge of the current
+% child. (The distance can be negative!)
+% \begin{macrocode}
+ \forest@distance@between@edge@paths\forest@previous@positive@edge\forest@child@negative@edge\forest@csdistance
+% \end{macrocode}
+% If the distance is |\relax|, the projections of the edges onto the
+% grow line don't overlap: do nothing. Otherwise, shift the current child so that its distance to the block
+% of previous children is |s_sep|.
+% \begin{macrocode}
+ \ifx\forest@csdistance\relax
+ %\forestOeset{\forest@child}{s}{\forest@previous@child@s}%
+ \else
+ \advance\pgfutil@tempdimb-\forest@csdistance\relax
+ \advance\pgfutil@tempdimb\forestove{s sep}\relax
+ \forestOeset{\forest@child}{s}{\the\dimexpr\forestOve{\forest@child}{s}-\forest@csdistance+\forestove{s sep}}%
+ \fi
+% \end{macrocode}
+% Retain monotonicity (is this ok?). (This problem arises when the adjacent children's |l| are too
+% far apart.)
+% \begin{macrocode}
+ \ifdim\forestOve{\forest@child}{s}<\forest@previous@child@s\relax
+ \forestOeset{\forest@child}{s}{\forest@previous@child@s}%
+ \fi
+% \end{macrocode}
+% Prepare for the next iteration: add the current child's positive
+% edge to the positive edge of the previous children, and set up the
+% next current child.
+% \begin{macrocode}
+ \forestOget{\forest@child}{s}\forest@child@s
+ \edef\forest@previous@child@s{\forest@child@s}%
+ \edef\forest@temp{%
+ \noexpand\forest@fornode{\forest@child}{%
+ \noexpand\forest@node@getedge
+ {positive}%
+ {\forestove{grow}}%
+ \noexpand\forest@temp@edge
+ }%
+ }\forest@temp
+ \forest@pack@pgfpoint@childsposition\forest@child
+ \forest@extendpath\forest@previous@positive@edge\forest@temp@edge{}%
+ \forest@getpositivetightedgeofpath\forest@previous@positive@edge\forest@previous@positive@edge
+ \forestOget{\forest@child}{@#3}\forest@child
+ \saferepeat
+% \end{macrocode}
+% Shift the position of all children to achieve the desired alignment
+% of the parent and its children.
+% \begin{macrocode}
+ \csname forest@calign@\forestove{calign}\endcsname
+}
+% \end{macrocode}
+% Get the position of child |#1| in the current node, in node's l-s
+% coordinate system.
+% \begin{macrocode}
+\def\forest@pack@pgfpoint@childsposition#1{%
+ {%
+ \pgftransformreset
+ \forest@pgfqtransformrotate{\forestove{grow}}%
+ \forest@fornode{#1}{%
+ \pgfpointtransformed{\pgfqpoint{\forestove{l}}{\forestove{s}}}%
+ }%
+ }%
+}
+% \end{macrocode}
+% Get the position of the node in the grow (|#1|)-rotated coordinate
+% system.
+% \begin{macrocode}
+\def\forest@pack@pgfpoint@positioningrow#1{%
+ {%
+ \pgftransformreset
+ \forest@pgfqtransformrotate{#1}%
+ \pgfpointtransformed{\pgfqpoint{\forestove{l}}{\forestove{s}}}%
+ }%
+}
+% \end{macrocode}
+%
+% Child alignment.
+% \begin{macrocode}
+\def\forest@calign@s@shift#1{%
+ \pgfutil@tempdima=#1\relax
+ \forest@node@foreachchild{%
+ \forestoeset{s}{\the\dimexpr\forestove{s}+\pgfutil@tempdima}%
+ }%
+}
+\def\forest@calign@child{%
+ \forest@calign@s@shift{-\forestOve{\forest@node@nornbarthchildid{\forestove{calign primary child}}}{s}}%
+}
+\csdef{forest@calign@child edge}{%
+ {%
+ \edef\forest@temp@child{\forest@node@nornbarthchildid{\forestove{calign primary child}}}%
+ \pgftransformreset
+ \forest@pgfqtransformrotate{\forestove{grow}}%
+ \pgfpointtransformed{\pgfqpoint{\forestOve{\forest@temp@child}{l}}{\forestOve{\forest@temp@child}{s}}}%
+ \pgf@xa=\pgf@x\relax\pgf@ya=\pgf@y\relax
+ \forest@Pointanchor{\forest@temp@child}{child anchor}%
+ \advance\pgf@xa\pgf@x\relax\advance\pgf@ya\pgf@y\relax
+ \forest@pointanchor{parent anchor}%
+ \advance\pgf@xa-\pgf@x\relax\advance\pgf@ya-\pgf@y\relax
+ \edef\forest@marshal{%
+ \noexpand\pgftransformreset
+ \noexpand\forest@pgfqtransformrotate{-\forestove{grow}}%
+ \noexpand\pgfpointtransformed{\noexpand\pgfqpoint{\the\pgf@xa}{\the\pgf@ya}}%
+ }\forest@marshal
+ }%
+ \forest@calign@s@shift{\the\dimexpr-\the\pgf@y}%
+}
+\csdef{forest@calign@midpoint}{%
+ \forest@calign@s@shift{\the\dimexpr 0pt -%
+ (\forestOve{\forest@node@nornbarthchildid{\forestove{calign primary child}}}{s}%
+ +\forestOve{\forest@node@nornbarthchildid{\forestove{calign secondary child}}}{s}%
+ )/2\relax
+ }%
+}
+\csdef{forest@calign@edge midpoint}{%
+ {%
+ \edef\forest@temp@firstchild{\forest@node@nornbarthchildid{\forestove{calign primary child}}}%
+ \edef\forest@temp@secondchild{\forest@node@nornbarthchildid{\forestove{calign secondary child}}}%
+ \pgftransformreset
+ \forest@pgfqtransformrotate{\forestove{grow}}%
+ \pgfpointtransformed{\pgfqpoint{\forestOve{\forest@temp@firstchild}{l}}{\forestOve{\forest@temp@firstchild}{s}}}%
+ \pgf@xa=\pgf@x\relax\pgf@ya=\pgf@y\relax
+ \forest@Pointanchor{\forest@temp@firstchild}{child anchor}%
+ \advance\pgf@xa\pgf@x\relax\advance\pgf@ya\pgf@y\relax
+ \edef\forest@marshal{%
+ \noexpand\pgfpointtransformed{\noexpand\pgfqpoint{\forestOve{\forest@temp@secondchild}{l}}{\forestOve{\forest@temp@secondchild}{s}}}%
+ }\forest@marshal
+ \advance\pgf@xa\pgf@x\relax\advance\pgf@ya\pgf@y\relax
+ \forest@Pointanchor{\forest@temp@secondchild}{child anchor}%
+ \advance\pgf@xa\pgf@x\relax\advance\pgf@ya\pgf@y\relax
+ \divide\pgf@xa2 \divide\pgf@ya2
+ \forest@pointanchor{parent anchor}%
+ \advance\pgf@xa-\pgf@x\relax\advance\pgf@ya-\pgf@y\relax
+ \edef\forest@marshal{%
+ \noexpand\pgftransformreset
+ \noexpand\forest@pgfqtransformrotate{-\forestove{grow}}%
+ \noexpand\pgfpointtransformed{\noexpand\pgfqpoint{\the\pgf@xa}{\the\pgf@ya}}%
+ }\forest@marshal
+ }%
+ \forest@calign@s@shift{\the\dimexpr-\the\pgf@y}%
+}
+% \end{macrocode}
+% Aligns the children to the center of the angles given by the options
+% |calign_first_angle| and |calign_second_angle| and spreads them additionally if needed to fill the
+% whole
+% space determined by the option. The version |fixed_angles| calculates the
+% angles between node anchors; the version |fixes_edge_angles| calculates the angles between the
+% node edges.
+% \begin{macrocode}
+\def\forest@edef@strippt#1#2{%
+ \edef#1{#2}%
+ \edef#1{\expandafter\Pgf@geT#1}%
+}
+\csdef{forest@calign@fixed angles}{%
+ \ifnum\forestove{n children}>1
+ \edef\forest@ca@first@child{\forest@node@nornbarthchildid{\forestove{calign primary child}}}%
+ \edef\forest@ca@second@child{\forest@node@nornbarthchildid{\forestove{calign secondary child}}}%
+ \ifnum\forestove{reversed}=1
+ \let\forest@temp\forest@ca@first@child
+ \let\forest@ca@first@child\forest@ca@second@child
+ \let\forest@ca@second@child\forest@temp
+ \fi
+ \forestOget{\forest@ca@first@child}{l}\forest@ca@first@l
+ \edef\forest@ca@first@l{\expandafter\Pgf@geT\forest@ca@first@l}%
+ \forestOget{\forest@ca@second@child}{l}\forest@ca@second@l
+ \edef\forest@ca@second@l{\expandafter\Pgf@geT\forest@ca@second@l}%
+ \pgfmathtan@{\forestove{calign secondary angle}}%
+ \pgfmathmultiply@{\pgfmathresult}{\forest@ca@second@l}%
+ \let\forest@calign@temp\pgfmathresult
+ \pgfmathtan@{\forestove{calign primary angle}}%
+ \pgfmathmultiply@{\pgfmathresult}{\forest@ca@first@l}%
+ \edef\forest@ca@desired@s@distance{\the\dimexpr
+ \forest@calign@temp pt-\pgfmathresult pt}%
+ % \pgfmathsetlengthmacro\forest@ca@desired@s@distance{%
+ % tan(\forestove{calign secondary angle})*\forest@ca@second@l
+ % -tan(\forestove{calign primary angle})*\forest@ca@first@l
+ % }%
+ \forestOget{\forest@ca@first@child}{s}\forest@ca@first@s
+ \forestOget{\forest@ca@second@child}{s}\forest@ca@second@s
+ \edef\forest@ca@actual@s@distance{\the\dimexpr
+ \forest@ca@second@s-\forest@ca@first@s}%
+ %\pgfmathsetlengthmacro\forest@ca@actual@s@distance{%
+ % \forest@ca@second@s-\forest@ca@first@s}%
+ \ifdim\forest@ca@desired@s@distance>\forest@ca@actual@s@distance\relax
+ \ifdim\forest@ca@actual@s@distance=0pt
+ \pgfmathtan@{\forestove{calign primary angle}}%
+ \pgfmathmultiply@{\pgfmathresult}{\forest@ca@second@l}%
+ \pgfutil@tempdima=\pgfmathresult pt
+ % \pgfmathsetlength\pgfutil@tempdima{tan(\forestove{calign primary angle})*\forest@ca@second@l}%
+ \pgfutil@tempdimb=\dimexpr
+ \forest@ca@desired@s@distance/(\forestove{n children}-1)\relax%
+ %\pgfmathsetlength\pgfutil@tempdimb{\forest@ca@desired@s@distance/(\forestove{n children}-1)}%
+ \forest@node@foreachchild{%
+ \forestoeset{s}{\the\pgfutil@tempdima}%
+ \advance\pgfutil@tempdima\pgfutil@tempdimb
+ }%
+ \def\forest@calign@anchor{0pt}%
+ \else
+ \edef\forest@marshal{\noexpand\pgfmathdivide@
+ {\expandafter\Pgf@geT\forest@ca@desired@s@distance}%
+ {\expandafter\Pgf@geT\forest@ca@actual@s@distance}%
+ }\forest@marshal
+ \let\forest@ca@ratio\pgfmathresult
+ %\pgfmathsetmacro\forest@ca@ratio{%
+ % \forest@ca@desired@s@distance/\forest@ca@actual@s@distance}%
+ \forest@node@foreachchild{%
+ \forest@edef@strippt\forest@temp{\forestove{s}}%
+ \pgfmathmultiply@{\forest@ca@ratio}{\forest@temp}%
+ \forestoeset{s}{\the\dimexpr\pgfmathresult pt}%
+ %\pgfmathsetlengthmacro\forest@temp{\forest@ca@ratio*\forestove{s}}%
+ %\forestolet{s}\forest@temp
+ }%
+ \pgfmathtan@{\forestove{calign primary angle}}%
+ \pgfmathmultiply@{\pgfmathresult}{\forest@ca@first@l}%
+ \edef\forest@calign@anchor{\the\dimexpr-\pgfmathresult pt}%
+ %\pgfmathsetlengthmacro\forest@calign@anchor{%
+ % -tan(\forestove{calign primary angle})*\forest@ca@first@l}%
+ \fi
+ \else
+ \ifdim\forest@ca@desired@s@distance<\forest@ca@actual@s@distance\relax
+ \edef\forest@marshal{\noexpand\pgfmathdivide@
+ {\expandafter\Pgf@geT\forest@ca@actual@s@distance}%
+ {\expandafter\Pgf@geT\forest@ca@desired@s@distance}%
+ }\forest@marshal
+ \let\forest@ca@ratio\pgfmathresult
+ %\pgfmathsetlengthmacro\forest@ca@ratio{%
+ % \forest@ca@actual@s@distance/\forest@ca@desired@s@distance}%
+ \forest@node@foreachchild{%
+ \forest@edef@strippt\forest@temp{\forestove{l}}%
+ \pgfmathmultiply@{\forest@ca@ratio}{\forest@temp}%
+ \forestoeset{l}{\the\dimexpr\pgfmathresult pt}%
+ %\pgfmathsetlengthmacro\forest@temp{\forest@ca@ratio*\forestove{l}}%
+ %\forestolet{l}\forest@temp
+ }%
+ \forestOget{\forest@ca@first@child}{l}\forest@ca@first@l
+ \edef\forest@ca@first@l{\expandafter\Pgf@geT\forest@ca@first@l}%
+ \pgfmathtan@{\forestove{calign primary angle}}%
+ \pgfmathmultiply@{\pgfmathresult}{\forest@ca@first@l}%
+ \edef\forest@calign@anchor{\the\dimexpr-\pgfmathresult pt}%
+ %\pgfmathsetlengthmacro\forest@calign@anchor{%
+ % -tan(\forestove{calign primary angle})*\forest@ca@first@l}%
+ \fi
+ \fi
+ \forest@calign@s@shift{-\forest@calign@anchor}%
+ \fi
+}
+\csdef{forest@calign@fixed edge angles}{%
+ \ifnum\forestove{n children}>1
+ \edef\forest@ca@first@child{\forest@node@nornbarthchildid{\forestove{calign primary child}}}%
+ \edef\forest@ca@second@child{\forest@node@nornbarthchildid{\forestove{calign secondary child}}}%
+ \ifnum\forestove{reversed}=1
+ \let\forest@temp\forest@ca@first@child
+ \let\forest@ca@first@child\forest@ca@second@child
+ \let\forest@ca@second@child\forest@temp
+ \fi
+ \forestOget{\forest@ca@first@child}{l}\forest@ca@first@l
+ \forestOget{\forest@ca@second@child}{l}\forest@ca@second@l
+ \forest@pointanchor{parent anchor}%
+ \edef\forest@ca@parent@anchor@s{\the\pgf@x}%
+ \edef\forest@ca@parent@anchor@l{\the\pgf@y}%
+ \forest@Pointanchor{\forest@ca@first@child}{child anchor}%
+ \edef\forest@ca@first@child@anchor@s{\the\pgf@x}%
+ \edef\forest@ca@first@child@anchor@l{\the\pgf@y}%
+ \forest@Pointanchor{\forest@ca@second@child}{child anchor}%
+ \edef\forest@ca@second@child@anchor@s{\the\pgf@x}%
+ \edef\forest@ca@second@child@anchor@l{\the\pgf@y}%
+ \pgfmathtan@{\forestove{calign secondary angle}}%
+ \edef\forest@temp{\the\dimexpr
+ \forest@ca@second@l-\forest@ca@second@child@anchor@l+\forest@ca@parent@anchor@l}%
+ \pgfmathmultiply@{\pgfmathresult}{\expandafter\Pgf@geT\forest@temp}%
+ \edef\forest@ca@desired@second@edge@s{\the\dimexpr\pgfmathresult pt}%
+ %\pgfmathsetlengthmacro\forest@ca@desired@second@edge@s{%
+ % tan(\forestove{calign secondary angle})*%
+ % (\forest@ca@second@l-\forest@ca@second@child@anchor@l+\forest@ca@parent@anchor@l)}%
+ \pgfmathtan@{\forestove{calign primary angle}}%
+ \edef\forest@temp{\the\dimexpr
+ \forest@ca@first@l-\forest@ca@first@child@anchor@l+\forest@ca@parent@anchor@l}%
+ \pgfmathmultiply@{\pgfmathresult}{\expandafter\Pgf@geT\forest@temp}%
+ \edef\forest@ca@desired@first@edge@s{\the\dimexpr\pgfmathresult pt}%
+ %\pgfmathsetlengthmacro\forest@ca@desired@first@edge@s{%
+ % tan(\forestove{calign primary angle})*%
+ % (\forest@ca@first@l-\forest@ca@first@child@anchor@l+\forest@ca@parent@anchor@l)}%
+ \edef\forest@ca@desired@s@distance{\the\dimexpr
+ \forest@ca@desired@second@edge@s-\forest@ca@desired@first@edge@s}%
+ %\pgfmathsetlengthmacro\forest@ca@desired@s@distance{\forest@ca@desired@second@edge@s-\forest@ca@desired@first@edge@s}%
+ \forestOget{\forest@ca@first@child}{s}\forest@ca@first@s
+ \forestOget{\forest@ca@second@child}{s}\forest@ca@second@s
+ \edef\forest@ca@actual@s@distance{\the\dimexpr
+ \forest@ca@second@s+\forest@ca@second@child@anchor@s
+ -\forest@ca@first@s-\forest@ca@first@child@anchor@s}%
+ %\pgfmathsetlengthmacro\forest@ca@actual@s@distance{%
+ % \forest@ca@second@s+\forest@ca@second@child@anchor@s
+ % -\forest@ca@first@s-\forest@ca@first@child@anchor@s}%
+ \ifdim\forest@ca@desired@s@distance>\forest@ca@actual@s@distance\relax
+ \ifdim\forest@ca@actual@s@distance=0pt
+ \forestoget{n children}\forest@temp@n@children
+ \forest@node@foreachchild{%
+ \forest@pointanchor{child anchor}%
+ \edef\forest@temp@child@anchor@s{\the\pgf@x}%
+ \forestoeset{s}{\the\dimexpr
+ \forest@ca@desired@first@edge@s+\forest@ca@desired@s@distance*(\forestove{n}-1)/(\forest@temp@n@children-1)+\forest@ca@first@child@anchor@s-\forest@temp@child@anchor@s}%
+ %\pgfmathsetlengthmacro\forest@temp{%
+ % \forest@ca@desired@first@edge@s+(\forestove{n}-1)*\forest@ca@desired@s@distance/(\forest@temp@n@children-1)+\forest@ca@first@child@anchor@s-\forest@temp@child@anchor@s}%
+ %\forestolet{s}\forest@temp
+ }%
+ \def\forest@calign@anchor{0pt}%
+ \else
+ \edef\forest@marshal{\noexpand\pgfmathdivide@
+ {\expandafter\Pgf@geT\forest@ca@desired@s@distance}%
+ {\expandafter\Pgf@geT\forest@ca@actual@s@distance}%
+ }\forest@marshal
+ \let\forest@ca@ratio\pgfmathresult
+ %\pgfmathsetmacro\forest@ca@ratio{%
+ % \forest@ca@desired@s@distance/\forest@ca@actual@s@distance}%
+ \forest@node@foreachchild{%
+ \forest@pointanchor{child anchor}%
+ \edef\forest@temp@child@anchor@s{\the\pgf@x}%
+ \edef\forest@marshal{\noexpand\pgfmathmultiply@
+ {\forest@ca@ratio}%
+ {\expandafter\Pgf@geT\the\dimexpr
+ \forestove{s}-\forest@ca@first@s+%
+ \forest@temp@child@anchor@s-\forest@ca@first@child@anchor@s}%
+ }\forest@marshal
+ \forestoeset{s}{\the\dimexpr\pgfmathresult pt+\forest@ca@first@s
+ +\forest@ca@first@child@anchor@s-\forest@temp@child@anchor@s}%
+ % \pgfmathsetlengthmacro\forest@temp{%
+ % \forest@ca@ratio*(%
+ % \forestove{s}-\forest@ca@first@s
+ % +\forest@temp@child@anchor@s-\forest@ca@first@child@anchor@s)%
+ % +\forest@ca@first@s
+ % +\forest@ca@first@child@anchor@s-\forest@temp@child@anchor@s}%
+ % \forestolet{s}\forest@temp
+ }%
+ \pgfmathtan@{\forestove{calign primary angle}}%
+ \edef\forest@marshal{\noexpand\pgfmathmultiply@
+ {\pgfmathresult}%
+ {\expandafter\Pgf@geT\the\dimexpr
+ \forest@ca@first@l-\forest@ca@first@child@anchor@l+\forest@ca@parent@anchor@l}%
+ }\forest@marshal
+ \edef\forest@calign@anchor{\the\dimexpr
+ -\pgfmathresult pt+\forest@ca@first@child@anchor@s-\forest@ca@parent@anchor@s}%
+ % \pgfmathsetlengthmacro\forest@calign@anchor{%
+ % -tan(\forestove{calign primary angle})*(\forest@ca@first@l-\forest@ca@first@child@anchor@l+\forest@ca@parent@anchor@l)%
+ % +\forest@ca@first@child@anchor@s-\forest@ca@parent@anchor@s
+ % }%
+ \fi
+ \else
+ \ifdim\forest@ca@desired@s@distance<\forest@ca@actual@s@distance\relax
+ \edef\forest@marshal{\noexpand\pgfmathdivide@
+ {\expandafter\Pgf@geT\forest@ca@actual@s@distance}%
+ {\expandafter\Pgf@geT\forest@ca@desired@s@distance}%
+ }\forest@marshal
+ \let\forest@ca@ratio\pgfmathresult
+ %\pgfmathsetlengthmacro\forest@ca@ratio{%
+ % \forest@ca@actual@s@distance/\forest@ca@desired@s@distance}%
+ \forest@node@foreachchild{%
+ \forest@pointanchor{child anchor}%
+ \edef\forest@temp@child@anchor@l{\the\pgf@y}%
+ \edef\forest@marshal{\noexpand\pgfmathmultiply@
+ {\forest@ca@ratio}%
+ {\expandafter\Pgf@geT\the\dimexpr\forestove{l}+\forest@ca@parent@anchor@l-\forest@temp@child@anchor@l}%
+ }\forest@marshal
+ \forestoeset{l}{\the\dimexpr
+ \pgfmathresult pt-\forest@ca@parent@anchor@l+\forest@temp@child@anchor@l}%
+ % \pgfmathsetlengthmacro\forest@temp{%
+ % \forest@ca@ratio*(%
+ % \forestove{l}+\forest@ca@parent@anchor@l-\forest@temp@child@anchor@l)
+ % -\forest@ca@parent@anchor@l+\forest@temp@child@anchor@l}%
+ % \forestolet{l}\forest@temp
+ }%
+ \forestOget{\forest@ca@first@child}{l}\forest@ca@first@l
+ \pgfmathtan@{\forestove{calign primary angle}}%
+ \edef\forest@marshal{\noexpand\pgfmathmultiply@
+ {\pgfmathresult}%
+ {\expandafter\Pgf@geT\the\dimexpr
+ \forest@ca@first@l+\forest@ca@parent@anchor@l-\forest@temp@child@anchor@l}%
+ }\forest@marshal
+ \edef\forest@calign@anchor{\the\dimexpr
+ -\pgfmathresult pt+\forest@ca@first@child@anchor@s-\forest@ca@parent@anchor@s}%
+ % \pgfmathsetlengthmacro\forest@calign@anchor{%
+ % -tan(\forestove{calign primary angle})*(\forest@ca@first@l+\forest@ca@parent@anchor@l-\forest@temp@child@anchor@l)%
+ % +\forest@ca@first@child@anchor@s-\forest@ca@parent@anchor@s
+ % }%
+ \fi
+ \fi
+ \forest@calign@s@shift{-\forest@calign@anchor}%
+ \fi
+}
+% \end{macrocode}
+%
+% Get edge: |#1| = |positive|/|negative|, |#2| = grow (in degrees), |#3| = the control
+% sequence receiving the resulting path. The edge is taken from the
+% cache (attribute |#1@edge@#2|) if possible; otherwise, both
+% positive and negative edge are computed and stored in the cache.
+% \begin{macrocode}
+\def\forest@node@getedge#1#2#3{%
+ \forestoget{#1@edge@#2}#3%
+ \ifx#3\relax
+ \forest@node@foreachchild{%
+ \forest@node@getedge{#1}{#2}{\forest@temp@edge}%
+ }%
+ \forest@forthis{\forest@node@getedges{#2}}%
+ \forestoget{#1@edge@#2}#3%
+ \fi
+}
+% \end{macrocode}
+% Get edges. |#1| = grow (in degrees). The result is stored in
+% attributes |negative@edge@#1| and |positive@edge@#1|. This method
+% expects that the children's edges are already cached.
+% \begin{macrocode}
+\def\forest@node@getedges#1{%
+% \end{macrocode}
+% Run the computation in a \TeX\ group.
+% \begin{macrocode}
+ %{%
+% \end{macrocode}
+% Setup the grow line.
+% \begin{macrocode}
+ \forest@setupgrowline{#1}%
+% \end{macrocode}
+% Get the edge of the node itself.
+% \begin{macrocode}
+ \ifnum\forestove{ignore}=0
+ \forestoget{@boundary}\forest@node@boundary
+ \else
+ \def\forest@node@boundary{}%
+ \fi
+ \csname forest@getboth\forestove{fit}edgesofpath\endcsname
+ \forest@node@boundary\forest@negative@node@edge\forest@positive@node@edge
+ \forestolet{negative@edge@#1}\forest@negative@node@edge
+ \forestolet{positive@edge@#1}\forest@positive@node@edge
+% \end{macrocode}
+% Add the edges of the children.
+% \begin{macrocode}
+ \forest@get@edges@merge{negative}{#1}%
+ \forest@get@edges@merge{positive}{#1}%
+ %}%
+}
+% \end{macrocode}
+% Merge the |#1| (=|negative| or |positive|) edge of the node with
+% |#1| edges of the children. |#2| = grow angle.
+% \begin{macrocode}
+\def\forest@get@edges@merge#1#2{%
+ \ifnum\forestove{n children}>0
+ \forestoget{#1@edge@#2}\forest@node@edge
+% \end{macrocode}
+% Remember the node's |parent anchor| and add it to the path (for breaking).
+% \begin{macrocode}
+ \forest@pointanchor{parent anchor}%
+ \edef\forest@getedge@pa@l{\the\pgf@x}%
+ \edef\forest@getedge@pa@s{\the\pgf@y}%
+ \eappto\forest@node@edge{\noexpand\pgfsyssoftpath@movetotoken{\forest@getedge@pa@l}{\forest@getedge@pa@s}}%
+% \end{macrocode}
+% Switch to this node's |(l,s)| coordinate system (origin at the
+% node's anchor).
+% \begin{macrocode}
+ \pgfgettransform\forest@temp@transform
+ \pgftransformreset
+ \forest@pgfqtransformrotate{\forestove{grow}}%
+% \end{macrocode}
+% Get the child's (cached) edge, translate it by the child's position,
+% and add it to the path holding all edges. Also add the edge from parent to the child to the path.
+% This gets complicated when the child and/or parent anchor is empty, i.e.\ automatic border: we can
+% get self-intersecting paths. So we store all the parent--child edges to a safe place first,
+% compute all the possible breaking points (i.e.\ all the points in node@edge path), and break the
+% parent--child edges on these points.
+% \begin{macrocode}
+ \def\forest@all@edges{}%
+ \forest@node@foreachchild{%
+ \forestoget{#1@edge@#2}\forest@temp@edge
+ \pgfpointtransformed{\pgfqpoint{\forestove{l}}{\forestove{s}}}%
+ \forest@extendpath\forest@node@edge\forest@temp@edge{}%
+ \ifnum\forestove{ignore edge}=0
+ \pgfpointadd
+ {\pgfpointtransformed{\pgfqpoint{\forestove{l}}{\forestove{s}}}}%
+ {\forest@pointanchor{child anchor}}%
+ \pgfgetlastxy{\forest@getedge@ca@l}{\forest@getedge@ca@s}%
+ \eappto\forest@all@edges{%
+ \noexpand\pgfsyssoftpath@movetotoken{\forest@getedge@pa@l}{\forest@getedge@pa@s}%
+ \noexpand\pgfsyssoftpath@linetotoken{\forest@getedge@ca@l}{\forest@getedge@ca@s}%
+ }%
+ % this deals with potential overlap of the edges:
+ \eappto\forest@node@edge{\noexpand\pgfsyssoftpath@movetotoken{\forest@getedge@ca@l}{\forest@getedge@ca@s}}%
+ \fi
+ }%
+ \ifdefempty{\forest@all@edges}{}{%
+ \pgfintersectionofpaths{\pgfsetpath\forest@all@edges}{\pgfsetpath\forest@node@edge}%
+ \def\forest@edgenode@intersections{}%
+ \forest@merge@intersectionloop
+ \eappto\forest@node@edge{\expandonce{\forest@all@edges}\expandonce{\forest@edgenode@intersections}}%
+ }%
+ \pgfsettransform\forest@temp@transform
+% \end{macrocode}
+% Process the path into an edge and store the edge.
+% \begin{macrocode}
+ \csname forest@get#1\forestove{fit}edgeofpath\endcsname\forest@node@edge\forest@node@edge
+ \forestolet{#1@edge@#2}\forest@node@edge
+ \fi
+}
+%\newloop\forest@merge@loop
+\def\forest@merge@intersectionloop{%
+ \c@pgf@counta=0
+ \forest@loop
+ \ifnum\c@pgf@counta<\pgfintersectionsolutions\relax
+ \advance\c@pgf@counta1
+ \pgfpointintersectionsolution{\the\c@pgf@counta}%
+ \eappto\forest@edgenode@intersections{\noexpand\pgfsyssoftpath@movetotoken
+ {\the\pgf@x}{\the\pgf@y}}%
+ \forest@repeat
+}
+% \end{macrocode}
+%
+% Get the bounding rectangle of the node (without descendants). |#1| =
+% grow.
+% \begin{macrocode}
+\def\forest@node@getboundingrectangle@ls#1{%
+ \forestoget{@boundary}\forest@node@boundary
+ \forest@path@getboundingrectangle@ls\forest@node@boundary{#1}%
+}
+% \end{macrocode}
+%
+% Applies the current coordinate transformation to the points in the
+% path |#1|. Returns via the current path (so that the coordinate
+% transformation can be set up as local).
+% \begin{macrocode}
+\def\forest@pgfpathtransformed#1{%
+ \forest@save@pgfsyssoftpath@tokendefs
+ \let\pgfsyssoftpath@movetotoken\forest@pgfpathtransformed@moveto
+ \let\pgfsyssoftpath@linetotoken\forest@pgfpathtransformed@lineto
+ \pgfsyssoftpath@setcurrentpath\pgfutil@empty
+ #1%
+ \forest@restore@pgfsyssoftpath@tokendefs
+}
+\def\forest@pgfpathtransformed@moveto#1#2{%
+ \forest@pgfpathtransformed@op\pgfsyssoftpath@moveto{#1}{#2}%
+}
+\def\forest@pgfpathtransformed@lineto#1#2{%
+ \forest@pgfpathtransformed@op\pgfsyssoftpath@lineto{#1}{#2}%
+}
+\def\forest@pgfpathtransformed@op#1#2#3{%
+ \pgfpointtransformed{\pgfqpoint{#2}{#3}}%
+ \edef\forest@temp{%
+ \noexpand#1{\the\pgf@x}{\the\pgf@y}%
+ }%
+ \forest@temp
+}
+% \end{macrocode}
+%
+% \subsubsection{Tiers}
+%
+% Compute tiers to be aligned at a node. The result in saved in
+% attribute |@tiers|.
+% \begin{macrocode}
+\def\forest@pack@computetiers{%
+ {%
+ \forest@pack@tiers@getalltiersinsubtree
+ \forest@pack@tiers@computetierhierarchy
+ \forest@pack@tiers@findcontainers
+ \forest@pack@tiers@raisecontainers
+ \forest@pack@tiers@computeprocessingorder
+ \gdef\forest@smuggle{}%
+ \forest@pack@tiers@write
+ }%
+ \forest@node@foreach{\forestoset{@tiers}{}}%
+ \forest@smuggle
+}
+% \end{macrocode}
+% Puts all tiers contained in the subtree into attribute
+% |tiers|.
+% \begin{macrocode}
+\def\forest@pack@tiers@getalltiersinsubtree{%
+ \ifnum\forestove{n children}>0
+ \forest@node@foreachchild{\forest@pack@tiers@getalltiersinsubtree}%
+ \fi
+ \forestoget{tier}\forest@temp@mytier
+ \def\forest@temp@mytiers{}%
+ \ifdefempty\forest@temp@mytier{}{%
+ \listeadd\forest@temp@mytiers\forest@temp@mytier
+ }%
+ \ifnum\forestove{n children}>0
+ \forest@node@foreachchild{%
+ \forestoget{tiers}\forest@temp@tiers
+ \forlistloop\forest@pack@tiers@forhandlerA\forest@temp@tiers
+ }%
+ \fi
+ \forestolet{tiers}\forest@temp@mytiers
+}
+\def\forest@pack@tiers@forhandlerA#1{%
+ \ifinlist{#1}\forest@temp@mytiers{}{%
+ \listeadd\forest@temp@mytiers{#1}%
+ }%
+}
+% \end{macrocode}
+% Compute a set of higher and lower tiers for each tier. Tier A is
+% higher than tier B iff a node on tier A is an ancestor of a
+% node on tier B.
+% \begin{macrocode}
+\def\forest@pack@tiers@computetierhierarchy{%
+ \def\forest@tiers@ancestors{}%
+ \forestoget{tiers}\forest@temp@mytiers
+ \forlistloop\forest@pack@tiers@cth@init\forest@temp@mytiers
+ \forest@pack@tiers@computetierhierarchy@
+}
+\def\forest@pack@tiers@cth@init#1{%
+ \csdef{forest@tiers@higher@#1}{}%
+ \csdef{forest@tiers@lower@#1}{}%
+}
+\def\forest@pack@tiers@computetierhierarchy@{%
+ \forestoget{tier}\forest@temp@mytier
+ \ifdefempty\forest@temp@mytier{}{%
+ \forlistloop\forest@pack@tiers@forhandlerB\forest@tiers@ancestors
+ \listeadd\forest@tiers@ancestors\forest@temp@mytier
+ }%
+ \forest@node@foreachchild{%
+ \forest@pack@tiers@computetierhierarchy@
+ }%
+ \forestoget{tier}\forest@temp@mytier
+ \ifdefempty\forest@temp@mytier{}{%
+ \forest@listedel\forest@tiers@ancestors\forest@temp@mytier
+ }%
+}
+\def\forest@pack@tiers@forhandlerB#1{%
+ \def\forest@temp@tier{#1}%
+ \ifx\forest@temp@tier\forest@temp@mytier
+ \PackageError{forest}{Circular tier hierarchy (tier \forest@temp@mytier)}{}%
+ \fi
+ \ifinlistcs{#1}{forest@tiers@higher@\forest@temp@mytier}{}{%
+ \listcsadd{forest@tiers@higher@\forest@temp@mytier}{#1}}%
+ \xifinlistcs\forest@temp@mytier{forest@tiers@lower@#1}{}{%
+ \listcseadd{forest@tiers@lower@#1}{\forest@temp@mytier}}%
+}
+\def\forest@pack@tiers@findcontainers{%
+ \forestoget{tiers}\forest@temp@tiers
+ \forlistloop\forest@pack@tiers@findcontainer\forest@temp@tiers
+}
+\def\forest@pack@tiers@findcontainer#1{%
+ \def\forest@temp@tier{#1}%
+ \forestoget{tier}\forest@temp@mytier
+ \ifx\forest@temp@tier\forest@temp@mytier
+ \csedef{forest@tiers@container@#1}{\forest@cn}%
+ \else\@escapeif{%
+ \forest@pack@tiers@findcontainerA{#1}%
+ }\fi%
+}
+\def\forest@pack@tiers@findcontainerA#1{%
+ \c@pgf@counta=0
+ \forest@node@foreachchild{%
+ \forestoget{tiers}\forest@temp@tiers
+ \ifinlist{#1}\forest@temp@tiers{%
+ \advance\c@pgf@counta 1
+ \let\forest@temp@child\forest@cn
+ }{}%
+ }%
+ \ifnum\c@pgf@counta>1
+ \csedef{forest@tiers@container@#1}{\forest@cn}%
+ \else\@escapeif{% surely =1
+ \forest@fornode{\forest@temp@child}{%
+ \forest@pack@tiers@findcontainer{#1}%
+ }%
+ }\fi
+}
+\def\forest@pack@tiers@raisecontainers{%
+ \forestoget{tiers}\forest@temp@mytiers
+ \forlistloop\forest@pack@tiers@rc@forhandlerA\forest@temp@mytiers
+}
+\def\forest@pack@tiers@rc@forhandlerA#1{%
+ \edef\forest@tiers@temptier{#1}%
+ \letcs\forest@tiers@containernodeoftier{forest@tiers@container@#1}%
+ \letcs\forest@temp@lowertiers{forest@tiers@lower@#1}%
+ \forlistloop\forest@pack@tiers@rc@forhandlerB\forest@temp@lowertiers
+}
+\def\forest@pack@tiers@rc@forhandlerB#1{%
+ \letcs\forest@tiers@containernodeoflowertier{forest@tiers@container@#1}%
+ \forestOget{\forest@tiers@containernodeoflowertier}{content}\lowercontent
+ \forestOget{\forest@tiers@containernodeoftier}{content}\uppercontent
+ \forest@fornode{\forest@tiers@containernodeoflowertier}{%
+ \forest@ifancestorof
+ {\forest@tiers@containernodeoftier}
+ {\csletcs{forest@tiers@container@\forest@tiers@temptier}{forest@tiers@container@#1}}%
+ {}%
+ }%
+}
+\def\forest@pack@tiers@computeprocessingorder{%
+ \def\forest@tiers@processingorder{}%
+ \forestoget{tiers}\forest@tiers@cpo@tierstodo
+ \safeloop
+ \ifdefempty\forest@tiers@cpo@tierstodo{\forest@tempfalse}{\forest@temptrue}%
+ \ifforest@temp
+ \def\forest@tiers@cpo@tiersremaining{}%
+ \def\forest@tiers@cpo@tiersindependent{}%
+ \forlistloop\forest@pack@tiers@cpo@forhandlerA\forest@tiers@cpo@tierstodo
+ \ifdefempty\forest@tiers@cpo@tiersindependent{%
+ \PackageError{forest}{Circular tiers!}{}}{}%
+ \forlistloop\forest@pack@tiers@cpo@forhandlerB\forest@tiers@cpo@tiersremaining
+ \let\forest@tiers@cpo@tierstodo\forest@tiers@cpo@tiersremaining
+ \saferepeat
+}
+\def\forest@pack@tiers@cpo@forhandlerA#1{%
+ \ifcsempty{forest@tiers@higher@#1}{%
+ \listadd\forest@tiers@cpo@tiersindependent{#1}%
+ \listadd\forest@tiers@processingorder{#1}%
+ }{%
+ \listadd\forest@tiers@cpo@tiersremaining{#1}%
+ }%
+}
+\def\forest@pack@tiers@cpo@forhandlerB#1{%
+ \def\forest@pack@tiers@cpo@aremainingtier{#1}%
+ \forlistloop\forest@pack@tiers@cpo@forhandlerC\forest@tiers@cpo@tiersindependent
+}
+\def\forest@pack@tiers@cpo@forhandlerC#1{%
+ \ifinlistcs{#1}{forest@tiers@higher@\forest@pack@tiers@cpo@aremainingtier}{%
+ \forest@listcsdel{forest@tiers@higher@\forest@pack@tiers@cpo@aremainingtier}{#1}%
+ }{}%
+}
+\def\forest@pack@tiers@write{%
+ \forlistloop\forest@pack@tiers@write@forhandler\forest@tiers@processingorder
+}
+\def\forest@pack@tiers@write@forhandler#1{%
+ \forest@fornode{\csname forest@tiers@container@#1\endcsname}{%
+ \forest@pack@tiers@check{#1}%
+ }%
+ \xappto\forest@smuggle{%
+ \noexpand\listadd
+ \forestOm{\csname forest@tiers@container@#1\endcsname}{@tiers}%
+ {#1}%
+ }%
+}
+ % checks if the tier is compatible with growth changes and calign=node/edge angle
+\def\forest@pack@tiers@check#1{%
+ \def\forest@temp@currenttier{#1}%
+ \forest@node@foreachdescendant{%
+ \ifnum\forestove{grow}=\forestOve{\forestove{@parent}}{grow}
+ \else
+ \forest@pack@tiers@check@grow
+ \fi
+ \ifnum\forestove{n children}>1
+ \forestoget{calign}\forest@temp
+ \ifx\forest@temp\forest@pack@tiers@check@nodeangle
+ \forest@pack@tiers@check@calign
+ \fi
+ \ifx\forest@temp\forest@pack@tiers@check@edgeangle
+ \forest@pack@tiers@check@calign
+ \fi
+ \fi
+ }%
+}
+\def\forest@pack@tiers@check@nodeangle{node angle}%
+\def\forest@pack@tiers@check@edgeangle{edge angle}%
+\def\forest@pack@tiers@check@grow{%
+ \forestoget{content}\forest@temp@content
+ \let\forest@temp@currentnode\forest@cn
+ \forest@node@foreachdescendant{%
+ \forestoget{tier}\forest@temp
+ \ifx\forest@temp@currenttier\forest@temp
+ \forest@pack@tiers@check@grow@error
+ \fi
+ }%
+}
+\def\forest@pack@tiers@check@grow@error{%
+ \PackageError{forest}{Tree growth direction changes in node \forest@temp@currentnode\space
+ (content: \forest@temp@content), while tier '\forest@temp' is specified for nodes both
+ out- and inside the subtree rooted in node \forest@temp@currentnode. This will not work.}{}%
+}
+\def\forest@pack@tiers@check@calign{%
+ \forest@node@foreachchild{%
+ \forestoget{tier}\forest@temp
+ \ifx\forest@temp@currenttier\forest@temp
+ \forest@pack@tiers@check@calign@warning
+ \fi
+ }%
+}
+\def\forest@pack@tiers@check@calign@warning{%
+ \PackageWarning{forest}{Potential option conflict: node \forestove{@parent} (content:
+ '\forestOve{\forestove{@parent}}{content}') was given 'calign=\forestove{calign}', while its
+ child \forest@cn\space (content: '\forestove{content}') was given 'tier=\forestove{tier}'.
+ The parent's 'calign' will only work if the child was the lowest node on its tier before the
+ alignment.}%
+}
+% \end{macrocode}
+%
+%
+% \subsubsection{Node boundary}
+%
+% Compute the node boundary: it will be put in the pgf's current path. The computation is done
+% within a generic anchor so that the shape's saved anchors and macros are available.
+% \begin{macrocode}
+\pgfdeclaregenericanchor{forestcomputenodeboundary}{%
+ \letcs\forest@temp@boundary@macro{forest@compute@node@boundary@#1}%
+ \ifcsname forest@compute@node@boundary@#1\endcsname
+ \csname forest@compute@node@boundary@#1\endcsname
+ \else
+ \forest@compute@node@boundary@rectangle
+ \fi
+ \pgfsyssoftpath@getcurrentpath\forest@temp
+ \global\let\forest@global@boundary\forest@temp
+}
+\def\forest@mt#1{%
+ \expandafter\pgfpointanchor\expandafter{\pgfreferencednodename}{#1}%
+ \pgfsyssoftpath@moveto{\the\pgf@x}{\the\pgf@y}%
+}%
+\def\forest@lt#1{%
+ \expandafter\pgfpointanchor\expandafter{\pgfreferencednodename}{#1}%
+ \pgfsyssoftpath@lineto{\the\pgf@x}{\the\pgf@y}%
+}%
+\def\forest@compute@node@boundary@coordinate{%
+ \forest@mt{center}%
+}
+\def\forest@compute@node@boundary@circle{%
+ \forest@mt{east}%
+ \forest@lt{north east}%
+ \forest@lt{north}%
+ \forest@lt{north west}%
+ \forest@lt{west}%
+ \forest@lt{south west}%
+ \forest@lt{south}%
+ \forest@lt{south east}%
+ \forest@lt{east}%
+}
+\def\forest@compute@node@boundary@rectangle{%
+ \forest@mt{south west}%
+ \forest@lt{south east}%
+ \forest@lt{north east}%
+ \forest@lt{north west}%
+ \forest@lt{south west}%
+}
+\def\forest@compute@node@boundary@diamond{%
+ \forest@mt{east}%
+ \forest@lt{north}%
+ \forest@lt{west}%
+ \forest@lt{south}%
+ \forest@lt{east}%
+}
+\let\forest@compute@node@boundary@ellipse\forest@compute@node@boundary@circle
+\def\forest@compute@node@boundary@trapezium{%
+ \forest@mt{top right corner}%
+ \forest@lt{top left corner}%
+ \forest@lt{bottom left corner}%
+ \forest@lt{bottom right corner}%
+ \forest@lt{top right corner}%
+}
+\def\forest@compute@node@boundary@semicircle{%
+ \forest@mt{arc start}%
+ \forest@lt{north}%
+ \forest@lt{east}%
+ \forest@lt{north east}%
+ \forest@lt{apex}%
+ \forest@lt{north west}%
+ \forest@lt{west}%
+ \forest@lt{arc end}%
+ \forest@lt{arc start}%
+}
+%\newloop\forest@computenodeboundary@loop
+\csdef{forest@compute@node@boundary@regular polygon}{%
+ \forest@mt{corner 1}%
+ \c@pgf@counta=\sides\relax
+ \forest@loop
+ \ifnum\c@pgf@counta>0
+ \forest@lt{corner \the\c@pgf@counta}%
+ \advance\c@pgf@counta-1
+ \forest@repeat
+}%
+\def\forest@compute@node@boundary@star{%
+ \forest@mt{outer point 1}%
+ \c@pgf@counta=\totalstarpoints\relax
+ \divide\c@pgf@counta2
+ \forest@loop
+ \ifnum\c@pgf@counta>0
+ \forest@lt{inner point \the\c@pgf@counta}%
+ \forest@lt{outer point \the\c@pgf@counta}%
+ \advance\c@pgf@counta-1
+ \forest@repeat
+}%
+\csdef{forest@compute@node@boundary@isosceles triangle}{%
+ \forest@mt{apex}%
+ \forest@lt{left corner}%
+ \forest@lt{right corner}%
+ \forest@lt{apex}%
+}
+\def\forest@compute@node@boundary@kite{%
+ \forest@mt{upper vertex}%
+ \forest@lt{left vertex}%
+ \forest@lt{lower vertex}%
+ \forest@lt{right vertex}%
+ \forest@lt{upper vertex}%
+}
+\def\forest@compute@node@boundary@dart{%
+ \forest@mt{tip}%
+ \forest@lt{left tail}%
+ \forest@lt{tail center}%
+ \forest@lt{right tail}%
+ \forest@lt{tip}%
+}
+\csdef{forest@compute@node@boundary@circular sector}{%
+ \forest@mt{sector center}%
+ \forest@lt{arc start}%
+ \forest@lt{arc center}%
+ \forest@lt{arc end}%
+ \forest@lt{sector center}%
+}
+\def\forest@compute@node@boundary@cylinder{%
+ \forest@mt{top}%
+ \forest@lt{after top}%
+ \forest@lt{before bottom}%
+ \forest@lt{bottom}%
+ \forest@lt{after bottom}%
+ \forest@lt{before top}%
+ \forest@lt{top}%
+}
+\cslet{forest@compute@node@boundary@forbidden sign}\forest@compute@node@boundary@circle
+\cslet{forest@compute@node@boundary@magnifying glass}\forest@compute@node@boundary@circle
+\def\forest@compute@node@boundary@cloud{%
+ \getradii
+ \forest@mt{puff 1}%
+ \c@pgf@counta=\puffs\relax
+ \forest@loop
+ \ifnum\c@pgf@counta>0
+ \forest@lt{puff \the\c@pgf@counta}%
+ \advance\c@pgf@counta-1
+ \forest@repeat
+}
+\def\forest@compute@node@boundary@starburst{
+ \calculatestarburstpoints
+ \forest@mt{outer point 1}%
+ \c@pgf@counta=\totalpoints\relax
+ \divide\c@pgf@counta2
+ \forest@loop
+ \ifnum\c@pgf@counta>0
+ \forest@lt{inner point \the\c@pgf@counta}%
+ \forest@lt{outer point \the\c@pgf@counta}%
+ \advance\c@pgf@counta-1
+ \forest@repeat
+}%
+\def\forest@compute@node@boundary@signal{%
+ \forest@mt{east}%
+ \forest@lt{south east}%
+ \forest@lt{south west}%
+ \forest@lt{west}%
+ \forest@lt{north west}%
+ \forest@lt{north east}%
+ \forest@lt{east}%
+}
+\def\forest@compute@node@boundary@tape{%
+ \forest@mt{north east}%
+ \forest@lt{60}%
+ \forest@lt{north}%
+ \forest@lt{120}%
+ \forest@lt{north west}%
+ \forest@lt{south west}%
+ \forest@lt{240}%
+ \forest@lt{south}%
+ \forest@lt{310}%
+ \forest@lt{south east}%
+ \forest@lt{north east}%
+}
+\csdef{forest@compute@node@boundary@single arrow}{%
+ \forest@mt{tip}%
+ \forest@lt{after tip}%
+ \forest@lt{after head}%
+ \forest@lt{before tail}%
+ \forest@lt{after tail}%
+ \forest@lt{before head}%
+ \forest@lt{before tip}%
+ \forest@lt{tip}%
+}
+\csdef{forest@compute@node@boundary@double arrow}{%
+ \forest@mt{tip 1}%
+ \forest@lt{after tip 1}%
+ \forest@lt{after head 1}%
+ \forest@lt{before head 2}%
+ \forest@lt{before tip 2}%
+ \forest@mt{tip 2}%
+ \forest@lt{after tip 2}%
+ \forest@lt{after head 2}%
+ \forest@lt{before head 1}%
+ \forest@lt{before tip 1}%
+ \forest@lt{tip 1}%
+}
+\csdef{forest@compute@node@boundary@arrow box}{%
+ \forest@mt{before north arrow}%
+ \forest@lt{before north arrow head}%
+ \forest@lt{before north arrow tip}%
+ \forest@lt{north arrow tip}%
+ \forest@lt{after north arrow tip}%
+ \forest@lt{after north arrow head}%
+ \forest@lt{after north arrow}%
+ \forest@lt{north east}%
+ \forest@lt{before east arrow}%
+ \forest@lt{before east arrow head}%
+ \forest@lt{before east arrow tip}%
+ \forest@lt{east arrow tip}%
+ \forest@lt{after east arrow tip}%
+ \forest@lt{after east arrow head}%
+ \forest@lt{after east arrow}%
+ \forest@lt{south east}%
+ \forest@lt{before south arrow}%
+ \forest@lt{before south arrow head}%
+ \forest@lt{before south arrow tip}%
+ \forest@lt{south arrow tip}%
+ \forest@lt{after south arrow tip}%
+ \forest@lt{after south arrow head}%
+ \forest@lt{after south arrow}%
+ \forest@lt{south west}%
+ \forest@lt{before west arrow}%
+ \forest@lt{before west arrow head}%
+ \forest@lt{before west arrow tip}%
+ \forest@lt{west arrow tip}%
+ \forest@lt{after west arrow tip}%
+ \forest@lt{after west arrow head}%
+ \forest@lt{after west arrow}%
+ \forest@lt{north west}%
+ \forest@lt{before north arrow}%
+}
+\cslet{forest@compute@node@boundary@circle split}\forest@compute@node@boundary@circle
+\cslet{forest@compute@node@boundary@circle solidus}\forest@compute@node@boundary@circle
+\cslet{forest@compute@node@boundary@ellipse split}\forest@compute@node@boundary@ellipse
+\cslet{forest@compute@node@boundary@rectangle split}\forest@compute@node@boundary@rectangle
+\def\forest@compute@node@boundary@@callout{%
+ \beforecalloutpointer
+ \pgfsyssoftpath@moveto{\the\pgf@x}{\the\pgf@y}%
+ \calloutpointeranchor
+ \pgfsyssoftpath@lineto{\the\pgf@x}{\the\pgf@y}%
+ \aftercalloutpointer
+ \pgfsyssoftpath@lineto{\the\pgf@x}{\the\pgf@y}%
+}
+\csdef{forest@compute@node@boundary@rectangle callout}{%
+ \forest@compute@node@boundary@rectangle
+ \rectanglecalloutpoints
+ \forest@compute@node@boundary@@callout
+}
+\csdef{forest@compute@node@boundary@ellipse callout}{%
+ \forest@compute@node@boundary@ellipse
+ \ellipsecalloutpoints
+ \forest@compute@node@boundary@@callout
+}
+\csdef{forest@compute@node@boundary@cloud callout}{%
+ \forest@compute@node@boundary@cloud
+ % at least a first approx...
+ \forest@mt{center}%
+ \forest@lt{pointer}%
+}%
+\csdef{forest@compute@node@boundary@cross out}{%
+ \forest@mt{south east}%
+ \forest@lt{north west}%
+ \forest@mt{south west}%
+ \forest@lt{north east}%
+}%
+\csdef{forest@compute@node@boundary@strike out}{%
+ \forest@mt{north east}%
+ \forest@lt{south west}%
+}%
+\csdef{forest@compute@node@boundary@rounded rectangle}{%
+ \forest@mt{east}%
+ \forest@lt{north east}%
+ \forest@lt{north}%
+ \forest@lt{north west}%
+ \forest@lt{west}%
+ \forest@lt{south west}%
+ \forest@lt{south}%
+ \forest@lt{south east}%
+ \forest@lt{east}%
+}%
+\csdef{forest@compute@node@boundary@chamfered rectangle}{%
+ \forest@mt{before south west}%
+ \forest@mt{after south west}%
+ \forest@lt{before south east}%
+ \forest@lt{after south east}%
+ \forest@lt{before north east}%
+ \forest@lt{after north east}%
+ \forest@lt{before north west}%
+ \forest@lt{after north west}%
+ \forest@lt{before south west}%
+}%
+% \end{macrocode}
+%
+%
+%
+%
+% \subsection{Compute absolute positions}
+%
+% Computes absolute positions of descendants relative to this node.
+% Stores the results in attributes |x| and |y|.
+% \begin{macrocode}
+\def\forest@node@computeabsolutepositions{%
+ \edef\forest@marshal{%
+ \noexpand\forest@node@foreachchild{%
+ \noexpand\forest@node@computeabsolutepositions@{\forestove{x}}{\forestove{y}}{\forestove{grow}}%
+ }%
+ }\forest@marshal
+}
+\def\forest@node@computeabsolutepositions@#1#2#3{%
+ \pgfpointadd
+ {\pgfqpoint{#1}{#2}}%
+ {\pgfpointadd
+ {\pgfqpointpolar{#3}{\forestove{l}}}%
+ {\pgfqpointpolar{\numexpr 90+#3\relax}{\forestove{s}}}%
+ }%
+ \pgfgetlastxy\forest@temp@x\forest@temp@y
+ \forestolet{x}\forest@temp@x
+ \forestolet{y}\forest@temp@y
+ \edef\forest@marshal{%
+ \noexpand\forest@node@foreachchild{%
+ \noexpand\forest@node@computeabsolutepositions@{\forest@temp@x}{\forest@temp@y}{\forestove{grow}}%
+ }%
+ }\forest@marshal
+}
+% \end{macrocode}
+%
+%
+% \subsection{Drawing the tree}
+% \label{imp:drawing-the-tree}
+% \begin{macrocode}
+\newif\ifforest@drawtree@preservenodeboxes@
+\def\forest@node@drawtree{%
+ \expandafter\ifstrequal\expandafter{\forest@drawtreebox}{\pgfkeysnovalue}{%
+ \let\forest@drawtree@beginbox\relax
+ \let\forest@drawtree@endbox\relax
+ }{%
+ \edef\forest@drawtree@beginbox{\global\setbox\forest@drawtreebox=\hbox\bgroup}%
+ \let\forest@drawtree@endbox\egroup
+ }%
+ \ifforest@external@
+ \ifforest@externalize@tree@
+ \forest@temptrue
+ \else
+ \tikzifexternalizing{%
+ \ifforest@was@tikzexternalwasenable
+ \forest@temptrue
+ \pgfkeys{/tikz/external/optimize=false}%
+ \let\forest@drawtree@beginbox\relax
+ \let\forest@drawtree@endbox\relax
+ \else
+ \forest@tempfalse
+ \fi
+ }{%
+ \forest@tempfalse
+ }%
+ \fi
+ \ifforest@temp
+ \advance\forest@externalize@inner@n 1
+ \edef\forest@externalize@filename{%
+ \tikzexternalrealjob-forest-\forest@externalize@outer@n
+ \ifnum\forest@externalize@inner@n=0 \else.\the\forest@externalize@inner@n\fi}%
+ \expandafter\tikzsetnextfilename\expandafter{\forest@externalize@filename}%
+ \tikzexternalenable
+ \pgfkeysalso{/tikz/external/remake next,/tikz/external/export next}%
+ \fi
+ \ifforest@externalize@tree@
+ \typeout{forest: Invoking a recursive call to generate the external picture
+ '\forest@externalize@filename' for the following context+code:
+ '\expandafter\detokenize\expandafter{\forest@externalize@id}'}%
+ \fi
+ \fi
+ %
+ \ifforesttikzcshack
+ \let\forest@original@tikz@parse@node\tikz@parse@node
+ \let\tikz@parse@node\forest@tikz@parse@node
+ \fi
+ \pgfkeysgetvalue{/forest/begin draw/.@cmd}\forest@temp@begindraw
+ \pgfkeysgetvalue{/forest/end draw/.@cmd}\forest@temp@enddraw
+ \edef\forest@marshal{%
+ \noexpand\forest@drawtree@beginbox
+ \expandonce{\forest@temp@begindraw\pgfkeysnovalue\pgfeov}%
+ \noexpand\forest@node@drawtree@
+ \expandonce{\forest@temp@enddraw\pgfkeysnovalue\pgfeov}%
+ \noexpand\forest@drawtree@endbox
+ }\forest@marshal
+ \ifforesttikzcshack
+ \let\tikz@parse@node\forest@original@tikz@parse@node
+ \fi
+ %
+ \ifforest@external@
+ \ifforest@externalize@tree@
+ \tikzexternaldisable
+ \eappto\forest@externalize@checkimages{%
+ \noexpand\forest@includeexternal@check{\forest@externalize@filename}%
+ }%
+ \expandafter\ifstrequal\expandafter{\forest@drawtreebox}{\pgfkeysnovalue}{%
+ \eappto\forest@externalize@loadimages{%
+ \noexpand\forest@includeexternal{\forest@externalize@filename}%
+ }%
+ }{%
+ \eappto\forest@externalize@loadimages{%
+ \noexpand\forest@includeexternal@box\forest@drawtreebox{\forest@externalize@filename}%
+ }%
+ }%
+ \fi
+ \fi
+}
+\def\forest@drawtree@root{0}
+\def\forest@node@drawtree@{%
+ \def\forest@clear@drawn{}%
+ \forest@forthis{%
+ \forest@saveandrestoremacro\forest@drawtree@root{%
+ \edef\forest@drawtree@root{\forest@cn}%
+ \forestset{draw tree method}%
+ }%
+ }%
+ \forest@node@Ifnamedefined{forest@baseline@node}{%
+ \edef\forest@baseline@id{\forest@node@Nametoid{forest@baseline@node}}%
+ \ifnum\forest@baseline@id=0
+ \else
+ \ifcsdef{forest@drawn@\forest@baseline@id}{%
+ \edef\forest@marshal{%
+ \noexpand\pgfsetbaselinepointlater{%
+ \noexpand\pgfpointanchor
+ {\forestOve{\forest@baseline@id}{name}}%
+ {\forestOve{\forest@baseline@id}{anchor}}%
+ }%
+ }\forest@marshal
+ }{%
+ \PackageWarning{forest}{Baseline node (id=\forest@cn) was not drawn (most likely it's a phantom node)}%
+ }%
+ \fi
+ }%
+ \forest@clear@drawn
+}
+\def\forest@draw@node{%
+ \ifnum\forestove{phantom}=0
+ \forest@draw@node@
+ \fi
+}
+\def\forest@draw@node@{%
+ \forest@node@forest@positionnodelater@restore
+ \ifforest@drawtree@preservenodeboxes@
+ \pgfnodealias{forest@temp}{\forestove{later@name}}%
+ \fi
+ \pgfpositionnodenow{\pgfqpoint{\forestove{x}}{\forestove{y}}}%
+ \ifforest@drawtree@preservenodeboxes@
+ \pgfnodealias{\forestove{later@name}}{forest@temp}%
+ \fi
+ \csdef{forest@drawn@\forest@cn}{}%
+ \eappto\forest@clear@drawn{\noexpand\csundef{forest@drawn@\forest@cn}}%
+}
+\def\forest@draw@edge{%
+ \ifcsdef{forest@drawn@\forest@cn}{% was the current node drawn?
+ \ifnum\forestove{@parent}=0 % do we have a parent?
+ \else
+ \ifcsdef{forest@drawn@\forestove{@parent}}{% was the parent drawn?
+ \forest@draw@edge@
+ }{}%
+ \fi
+ }{}%
+}
+\def\forest@draw@edge@{%
+ \edef\forest@temp{\forestove{edge path}}\forest@temp
+}
+\def\forest@draw@tikz{%
+ \ifnum\forestove{phantom}=0
+ \forest@draw@tikz@
+ \fi
+}
+\def\forest@draw@tikz@{%
+ \forestove{tikz}%
+}
+% \end{macrocode}
+%
+% \section{Geometry}
+% \label{imp:geometry}
+%
+% A \emph{$\alpha$ grow line} is a line through the origin at angle
+% $\alpha$. The following macro sets up the grow line, which can then
+% be used by other code (the change is local to the \TeX\ group). More
+% precisely, two normalized vectors are set up: one $(x_g,y_g)$ on the
+% grow line, and one $(x_s,y_s)$ orthogonal to it---to get
+% $(x_s,y_s$), rotate $(x_g,y_g)$ 90$^\circ$ counter-clockwise.
+% \begin{macrocode}
+\newdimen\forest@xg
+\newdimen\forest@yg
+\newdimen\forest@xs
+\newdimen\forest@ys
+\def\forest@setupgrowline#1{%
+ \edef\forest@grow{#1}%
+ \pgfqpointpolar{\forest@grow}{1pt}%
+ \forest@xg=\pgf@x
+ \forest@yg=\pgf@y
+ \forest@xs=-\pgf@y
+ \forest@ys=\pgf@x
+}
+% \end{macrocode}
+%
+% \subsection{Projections}
+% \label{imp:projections}
+%
+% The following macro belongs to the |\pgfpoint...| family: it
+% projects point |#1| on the grow line. (The result is returned via
+% |\pgf@x| and |\pgf@y|.) The implementation is based on code from
+% |tikzlibrarycalc|, but optimized for projecting on grow lines, and
+% split to optimize serial usage in |\forest@projectpath|.
+% \begin{macrocode}
+\def\forest@pgfpointprojectiontogrowline#1{{%
+ \pgf@process{#1}%
+% \end{macrocode}
+% Calculate the scalar product of $(x,y)$ and $(x_g,y_g)$: that's the
+% distance of $(x,y)$ to the grow line.
+% \begin{macrocode}
+ \pgfutil@tempdima=\pgf@sys@tonumber{\pgf@x}\forest@xg%
+ \advance\pgfutil@tempdima by\pgf@sys@tonumber{\pgf@y}\forest@yg%
+% \end{macrocode}
+% The projection is $(x_g,y_g)$ scaled by the distance.
+% \begin{macrocode}
+ \global\pgf@x=\pgf@sys@tonumber{\pgfutil@tempdima}\forest@xg%
+ \global\pgf@y=\pgf@sys@tonumber{\pgfutil@tempdima}\forest@yg%
+}}
+% \end{macrocode}
+%
+% The following macro calculates the distance of point |#2| to the
+% grow line and stores the result in \TeX-dimension |#1|. The distance
+% is the scalar product of the point vector and the normalized vector
+% orthogonal to the grow line.
+% \begin{macrocode}
+\def\forest@distancetogrowline#1#2{%
+ \pgf@process{#2}%
+ #1=\pgf@sys@tonumber{\pgf@x}\forest@xs\relax
+ \advance#1 by\pgf@sys@tonumber{\pgf@y}\forest@ys\relax
+}
+% \end{macrocode}
+% Note that the distance to the grow line is positive for points on
+% one of its sides and negative for points on the other side. (It is
+% positive on the side which $(x_s,y_s)$ points to.) We thus say that
+% the grow line partitions the plane into a \emph{positive} and a
+% \emph{negative} side.
+%
+% The following macro projects all segment edges (``points'') of a
+% simple\footnote{A path is \emph{simple} if it consists of only
+% move-to and line-to operations.} path |#1| onto the grow line.
+% The result is an array of tuples (|xo|, |yo|, |xp|, |yp|), where
+% |xo| and |yo| stand for the \emph{o}riginal point, and |xp| and |yp|
+% stand for its \emph{p}rojection. The prefix of the array is given by
+% |#2|. If the array already exists, the new items are appended to
+% it. The array is not sorted: the order of original points in the
+% array is their order in the path. The computation does not destroy
+% the current path. All result-macros have local scope.
+%
+% The macro is just a wrapper for |\forest@projectpath@process|.
+% \begin{macrocode}
+\let\forest@pp@n\relax
+\def\forest@projectpathtogrowline#1#2{%
+ \edef\forest@pp@prefix{#2}%
+ \forest@save@pgfsyssoftpath@tokendefs
+ \let\pgfsyssoftpath@movetotoken\forest@projectpath@processpoint
+ \let\pgfsyssoftpath@linetotoken\forest@projectpath@processpoint
+ \c@pgf@counta=0
+ #1%
+ \csedef{#2n}{\the\c@pgf@counta}%
+ \forest@restore@pgfsyssoftpath@tokendefs
+}
+% \end{macrocode}
+% For each point, remember the point and its projection to grow line.
+% \begin{macrocode}
+\def\forest@projectpath@processpoint#1#2{%
+ \pgfqpoint{#1}{#2}%
+ \expandafter\edef\csname\forest@pp@prefix\the\c@pgf@counta xo\endcsname{\the\pgf@x}%
+ \expandafter\edef\csname\forest@pp@prefix\the\c@pgf@counta yo\endcsname{\the\pgf@y}%
+ \forest@pgfpointprojectiontogrowline{}%
+ \expandafter\edef\csname\forest@pp@prefix\the\c@pgf@counta xp\endcsname{\the\pgf@x}%
+ \expandafter\edef\csname\forest@pp@prefix\the\c@pgf@counta yp\endcsname{\the\pgf@y}%
+ \advance\c@pgf@counta 1\relax
+}
+% \end{macrocode}
+% Sort the array (prefix |#1|) produced by
+% |\forest@projectpathtogrowline| by |(xp,yp)|, in the ascending order.
+% \begin{macrocode}
+\def\forest@sortprojections#1{%
+ % todo: optimize in cases when we know that the array is actually a
+ % merger of sorted arrays; when does this happen? in
+ % distance_between_paths, and when merging the edges of the parent
+ % and its children in a uniform growth tree
+ \edef\forest@ppi@inputprefix{#1}%
+ \c@pgf@counta=\csname#1n\endcsname\relax
+ \advance\c@pgf@counta -1
+ \forest@sort\forest@ppiraw@cmp\forest@ppiraw@let\forest@sort@ascending{0}{\the\c@pgf@counta}%
+}
+% \end{macrocode}
+%
+% The following macro processes the data gathered by (possibly more
+% than one invocation of) |\forest@projectpathtogrowline| into array
+% with prefix |#1|. The resulting data is the following.
+% \begin{itemize}
+% \item Array of projections (prefix |#2|)
+% \begin{itemize}
+% \item its items are tuples |(x,y)| (the array is sorted by |x|
+% and |y|), and
+% \item an inner array of original points (prefix |#2N@|, where $N$
+% is the index of the item in array |#2|. The items of |#2N@|
+% are |x|, |y| and |d|: |x| and |y| are the coordinates of the
+% original point; |d| is its distance to the grow line. The inner
+% array is not sorted.
+% \end{itemize}
+% \item A ``dictionary'' |#3|: keys are the coordinates |(x,y)| of
+% the original points; a value is the index of the original point's
+% projection in array |#2|.\footnote{At first sight, this
+% information could be cached ``at the source'': by
+% forest@pgfpointprojectiontogrowline. However, due to imprecise
+% intersecting (in breakpath), we cheat and merge very adjacent
+% projection points, expecting that the points to project to the
+% merged projection point. All this depends on the given path, so a
+% generic cache is not feasible.} In v2.1.4, the ``dictionary'' was
+% reimplemented using a toks register, to prevent using up the string
+% pool; that's when |#3| was introduced.
+% \end{itemize}
+% \begin{macrocode}
+\def\forest@processprojectioninfo#1#2#3{%
+ \edef\forest@ppi@inputprefix{#1}%
+% \end{macrocode}
+% Loop (counter |\c@pgf@counta|) through the sorted array of raw data.
+% \begin{macrocode}
+ \c@pgf@counta=0
+ \c@pgf@countb=-1
+ \safeloop
+ \ifnum\c@pgf@counta<\csname#1n\endcsname\relax
+% \end{macrocode}
+% Check if the projection tuple in the current raw item equals the
+% current projection.
+% \begin{macrocode}
+ \letcs\forest@xo{#1\the\c@pgf@counta xo}%
+ \letcs\forest@yo{#1\the\c@pgf@counta yo}%
+ \letcs\forest@xp{#1\the\c@pgf@counta xp}%
+ \letcs\forest@yp{#1\the\c@pgf@counta yp}%
+ \ifnum\c@pgf@countb<0
+ \forest@equaltotolerancefalse
+ \else
+ \forest@equaltotolerance
+ {\pgfqpoint\forest@xp\forest@yp}%
+ {\pgfqpoint
+ {\csname#2\the\c@pgf@countb x\endcsname}%
+ {\csname#2\the\c@pgf@countb y\endcsname}%
+ }%
+ \fi
+ \ifforest@equaltotolerance\else
+% \end{macrocode}
+% It not, we will append a new item to the outer result array.
+% \begin{macrocode}
+ \advance\c@pgf@countb 1
+ \cslet{#2\the\c@pgf@countb x}\forest@xp
+ \cslet{#2\the\c@pgf@countb y}\forest@yp
+ \csdef{#2\the\c@pgf@countb @n}{0}%
+ \fi
+% \end{macrocode}
+% If the projection is actually a projection of one point in our path (it will not be when this macro is called from |\forest@distance@between@edge@paths|):
+% \begin{macrocode}
+ % todo: this is ugly!
+ \ifdefined\forest@xo\ifx\forest@xo\relax\else
+ \ifdefined\forest@yo\ifx\forest@yo\relax\else
+% \end{macrocode}
+% Append the point of the current raw item to the inner array of
+% points projecting to the current projection.
+% \begin{macrocode}
+ \forest@append@point@to@inner@array
+ \forest@xo\forest@yo
+ {#2\the\c@pgf@countb @}%
+% \end{macrocode}
+% Put a new item in the dictionary: key = the original point, value =
+% the projection index.
+% \begin{macrocode}
+ \eapptotoks#3{(\forest@xo,\forest@yo){\the\c@pgf@countb}}%
+ \fi\fi
+ \fi\fi
+% \end{macrocode}
+% Clean-up the raw array item.
+% \begin{macrocode}
+ % todo: is this really necessary? (yes: see the "ugly" thing above)
+ \cslet{#1\the\c@pgf@counta xo}\relax
+ \cslet{#1\the\c@pgf@counta yo}\relax
+ \cslet{#1\the\c@pgf@counta xp}\relax
+ \cslet{#1\the\c@pgf@counta yp}\relax
+ \advance\c@pgf@counta 1
+ \saferepeat
+% \end{macrocode}
+% Clean up the raw array length.
+% \begin{macrocode}
+ % todo: is this really necessary?
+ \cslet{#1n}\relax
+% \end{macrocode}
+% Store the length of the outer result array.
+% \begin{macrocode}
+ \advance\c@pgf@countb 1
+ \csedef{#2n}{\the\c@pgf@countb}%
+}
+% \end{macrocode}
+%
+% Item-exchange macro for sorting the raw projection data. (|#1|
+% is copied into |#2|.)
+% \begin{macrocode}
+\def\forest@ppiraw@let#1#2{%
+ \csletcs{\forest@ppi@inputprefix#1xo}{\forest@ppi@inputprefix#2xo}%
+ \csletcs{\forest@ppi@inputprefix#1yo}{\forest@ppi@inputprefix#2yo}%
+ \csletcs{\forest@ppi@inputprefix#1xp}{\forest@ppi@inputprefix#2xp}%
+ \csletcs{\forest@ppi@inputprefix#1yp}{\forest@ppi@inputprefix#2yp}%
+}
+% \end{macrocode}
+% Item comparision macro for sorting the raw projection data.
+% \begin{macrocode}
+\def\forest@ppiraw@cmp#1#2{%
+ \forest@sort@cmptwodimcs
+ {\forest@ppi@inputprefix#1xp}{\forest@ppi@inputprefix#1yp}%
+ {\forest@ppi@inputprefix#2xp}{\forest@ppi@inputprefix#2yp}%
+}
+% \end{macrocode}
+%
+% Append the point |(#1,#2)| to the (inner) array of points
+% (prefix |#3|).
+% \begin{macrocode}
+\def\forest@append@point@to@inner@array#1#2#3{%
+ \c@pgf@countc=\csname#3n\endcsname\relax
+ \csedef{#3\the\c@pgf@countc x}{#1}%
+ \csedef{#3\the\c@pgf@countc y}{#2}%
+ \forest@distancetogrowline\pgfutil@tempdima{\pgfqpoint#1#2}%
+ \csedef{#3\the\c@pgf@countc d}{\the\pgfutil@tempdima}%
+ \advance\c@pgf@countc 1
+ \csedef{#3n}{\the\c@pgf@countc}%
+}
+% \end{macrocode}
+%
+% \subsection{Break path}
+%
+% The following macro computes from the given path (|#1|) a ``broken''
+% path (|#4|) that contains the same points of the plane, but has
+% potentially more segments, so that, for every point from a given set
+% of points on the grow line, a line through this point perpendicular
+% to the grow line intersects the broken path only at its edge
+% segments (i.e.\ not between them).
+%
+% The macro works only for \emph{simple} paths, i.e.\ paths built
+% using only move-to and line-to operations. Furthermore,
+% |\forest@processprojectioninfo| must be called before calling
+% |\forest@breakpath|: we expect information in an array with prefix
+% |#2| (projections and (an inner array of) their original points)
+% and toks register |#3| (a ``dictionary'': for each original points,
+% the index of its projection in |#2|). The macro updates array |#2|.
+% (No need to update |#3|, as it is not used anymore.)
+% \begin{macrocode}
+\def\forest@breakpath#1#2#3#4{%
+% \end{macrocode}
+% Store the current path in a macro and empty it, then process the
+% stored path. The processing creates a new current path.
+% \begin{macrocode}
+ \edef\forest@bp@prefix{#2}%
+ \let\forest@breakpath@toks#3%
+ \forest@save@pgfsyssoftpath@tokendefs
+ \let\pgfsyssoftpath@movetotoken\forest@breakpath@processfirstpoint
+ \let\pgfsyssoftpath@linetotoken\forest@breakpath@processfirstpoint
+ %\pgfusepath{}% empty the current path. ok?
+ #1%
+ \forest@restore@pgfsyssoftpath@tokendefs
+ \pgfsyssoftpath@getcurrentpath#4%
+}
+% \end{macrocode}
+% The original and the broken path start in the same way. (This code
+% implicitely ``repairs'' a path that starts illegally, with a line-to
+% operation.)
+% \begin{macrocode}
+\def\forest@breakpath@processfirstpoint#1#2{%
+ \forest@breakpath@processmoveto{#1}{#2}%
+ \let\pgfsyssoftpath@movetotoken\forest@breakpath@processmoveto
+ \let\pgfsyssoftpath@linetotoken\forest@breakpath@processlineto
+}
+% \end{macrocode}
+% When a move-to operation is encountered, it is simply copied to the
+% broken path, starting a new subpath. Then we remember the last
+% point, its projection's index (the point dictionary is used here)
+% and the actual projection point.
+% \begin{macrocode}
+\def\forest@breakpath@processmoveto#1#2{%
+ \pgfsyssoftpath@moveto{#1}{#2}%
+ \def\forest@previous@x{#1}%
+ \def\forest@previous@y{#2}%
+ \forest@breakpath@getfromtoks\forest@breakpath@toks\forest@previous@i{#1}{#2}%
+ \expandafter\let\expandafter\forest@previous@px
+ \csname\forest@bp@prefix\forest@previous@i x\endcsname
+ \expandafter\let\expandafter\forest@previous@py
+ \csname\forest@bp@prefix\forest@previous@i y\endcsname
+}
+\def\forest@breakpath@getfromtoks#1#2#3#4{%
+ % #1=cache toks register, #2=receiving cs, (#3,#4)=point;
+ % we rely on the fact that the point we're looking up should always be present
+ \def\forest@breakpath@getfromtoks@##1(#3,#4)##2##3\forest@END{##2}%
+ \edef#2{\expandafter\forest@breakpath@getfromtoks@\the#1\forest@END}%
+}
+% \end{macrocode}
+%
+% This is the heart of the path-breaking procedure.
+% \begin{macrocode}
+\def\forest@breakpath@processlineto#1#2{%
+% \end{macrocode}
+% Usually, the broken path will continue with a line-to operation (to
+% the current point |(#1,#2)|).
+% \begin{macrocode}
+ \let\forest@breakpath@op\pgfsyssoftpath@lineto
+% \end{macrocode}
+% Get the index of the current point's projection and the projection
+% itself. (The point dictionary is used here.)
+% \begin{macrocode}
+ \forest@breakpath@getfromtoks\forest@breakpath@toks\forest@i{#1}{#2}%
+ \expandafter\let\expandafter\forest@px
+ \csname\forest@bp@prefix\forest@i x\endcsname
+ \expandafter\let\expandafter\forest@py
+ \csname\forest@bp@prefix\forest@i y\endcsname
+% \end{macrocode}
+% Test whether the projections of the previous and the current point
+% are the same.
+% \begin{macrocode}
+ \forest@equaltotolerance
+ {\pgfqpoint{\forest@previous@px}{\forest@previous@py}}%
+ {\pgfqpoint{\forest@px}{\forest@py}}%
+ \ifforest@equaltotolerance
+% \end{macrocode}
+% If so, we are dealing with a segment, perpendicular to the grow
+% line. This segment must be removed, so we change the operation to
+% move-to.
+% \begin{macrocode}
+ \let\forest@breakpath@op\pgfsyssoftpath@moveto
+ \else
+% \end{macrocode}
+% Figure out the ``direction'' of the segment: in the order of the
+% array of projections, or in the reversed order? Setup the loop step
+% and the test condition.
+% \begin{macrocode}
+ \forest@temp@count=\forest@previous@i\relax
+ \ifnum\forest@previous@i<\forest@i\relax
+ \def\forest@breakpath@step{1}%
+ \def\forest@breakpath@test{\forest@temp@count<\forest@i\relax}%
+ \else
+ \def\forest@breakpath@step{-1}%
+ \def\forest@breakpath@test{\forest@temp@count>\forest@i\relax}%
+ \fi
+% \end{macrocode}
+% Loop through all the projections between (in the (possibly reversed)
+% array order) the projections of the previous and the current point
+% (both exclusive).
+% \begin{macrocode}
+ \safeloop
+ \advance\forest@temp@count\forest@breakpath@step\relax
+ \expandafter\ifnum\forest@breakpath@test
+% \end{macrocode}
+% Intersect the current segment with the line through the current (in
+% the loop!) projection perpendicular to the grow line. (There
+% \emph{will} be an intersection.)
+% \begin{macrocode}
+ \pgfpointintersectionoflines
+ {\pgfqpoint
+ {\csname\forest@bp@prefix\the\forest@temp@count x\endcsname}%
+ {\csname\forest@bp@prefix\the\forest@temp@count y\endcsname}%
+ }%
+ {\pgfpointadd
+ {\pgfqpoint
+ {\csname\forest@bp@prefix\the\forest@temp@count x\endcsname}%
+ {\csname\forest@bp@prefix\the\forest@temp@count y\endcsname}%
+ }%
+ {\pgfqpoint{\forest@xs}{\forest@ys}}%
+ }%
+ {\pgfqpoint{\forest@previous@x}{\forest@previous@y}}%
+ {\pgfqpoint{#1}{#2}}%
+% \end{macrocode}
+% Break the segment at the intersection.
+% \begin{macrocode}
+ \pgfgetlastxy\forest@last@x\forest@last@y
+ \pgfsyssoftpath@lineto\forest@last@x\forest@last@y
+% \end{macrocode}
+% Append the breaking point to the inner array for the projection.
+% \begin{macrocode}
+ \forest@append@point@to@inner@array
+ \forest@last@x\forest@last@y
+ {\forest@bp@prefix\the\forest@temp@count @}%
+ \saferepeat
+ \fi
+% \end{macrocode}
+% Add the current point.
+% \begin{macrocode}
+ \forest@breakpath@op{#1}{#2}%
+% \end{macrocode}
+% Setup new ``previous'' info: the segment edge, its projection's
+% index, and the projection.
+% \begin{macrocode}
+ \def\forest@previous@x{#1}%
+ \def\forest@previous@y{#2}%
+ \let\forest@previous@i\forest@i
+ \let\forest@previous@px\forest@px
+ \let\forest@previous@py\forest@py
+}
+% \end{macrocode}
+% Patch for speed: no need to call |\pgfmathparse| here.
+% \begin{macrocode}
+\patchcmd{\pgfpointintersectionoflines}{\pgfpoint}{\pgfqpoint}{}{}
+% \end{macrocode}
+%
+% \subsection{Get tight edge of path}
+%
+% This is one of the central algorithms of the package. Given a simple
+% path and a grow line, this method computes its (negative and
+% positive) ``tight edge'', which we (informally) define as follows.
+%
+% Imagine an infinitely long light source parallel to the grow line,
+% on the grow line's negative/positive side.\footnote{For the
+% definition of negative/positive side, see {\tt\string\forest@distancetogrowline}
+% in \S\ref{imp:projections}} Furthermore imagine that the path is
+% opaque. Then the negative/positive tight edge of the path is the
+% part of the path that is illuminated.
+%
+% This macro takes three arguments: |#1| is the path; |#2| and |#3|
+% are macros which will receive the negative and the positive edge,
+% respectively. The edges are returned in the softpath format. Grow
+% line should be set before calling this macro.
+%
+% Enclose the computation in a \TeX\ group. This is actually quite
+% crucial: if there was no enclosure, the temporary data (the segment
+% dictionary, to be precise) computed by the prior invocations of the
+% macro could corrupt the computation in the current invocation.
+% \begin{macrocode}
+\def\forest@getnegativetightedgeofpath#1#2{%
+ \forest@get@onetightedgeofpath#1\forest@sort@ascending#2}
+\def\forest@getpositivetightedgeofpath#1#2{%
+ \forest@get@onetightedgeofpath#1\forest@sort@descending#2}
+\def\forest@get@onetightedgeofpath#1#2#3{%
+ {%
+ \forest@get@one@tightedgeofpath#1#2\forest@gep@edge
+ \global\let\forest@gep@global@edge\forest@gep@edge
+ }%
+ \let#3\forest@gep@global@edge
+}
+\newtoks\forest@pi@toks
+\newtoks\forest@segment@toks
+\def\forest@get@one@tightedgeofpath#1#2#3{%
+% \end{macrocode}
+% Project the path to the grow line and compile some useful information.
+% \begin{macrocode}
+ \forest@projectpathtogrowline#1{forest@pp@}%
+ \forest@sortprojections{forest@pp@}%
+ \forest@processprojectioninfo{forest@pp@}{forest@pi@}\forest@pi@toks
+% \end{macrocode}
+% Break the path.
+% \begin{macrocode}
+ \forest@breakpath#1{forest@pi@}\forest@pi@toks\forest@brokenpath
+% \end{macrocode}
+% Compile some more useful information.
+% \begin{macrocode}
+ \forest@sort@inner@arrays{forest@pi@}#2%
+ \forest@pathtodict\forest@brokenpath\forest@segment@toks
+% \end{macrocode}
+% The auxiliary data is set up: do the work!
+% \begin{macrocode}
+ \forest@gettightedgeofpath@getedge\forest@edge
+% \end{macrocode}
+% Where possible, merge line segments of the path into a single line
+% segment. This is an important optimization, since the edges of the
+% subtrees are computed recursively. Not simplifying the edge could
+% result in a wild growth of the length of the edge (in the sense of
+% the number of segments).
+% \begin{macrocode}
+ \forest@simplifypath\forest@edge#3%
+}
+% \end{macrocode}
+% Get both negative (stored in |#2|) and positive (stored in |#3|)
+% edge of the path |#1|.
+% \begin{macrocode}
+\def\forest@getbothtightedgesofpath#1#2#3{%
+ {%
+ \forest@get@one@tightedgeofpath#1\forest@sort@ascending\forest@gep@firstedge
+% \end{macrocode}
+% Reverse the order of items in the inner arrays.
+% \begin{macrocode}
+ \c@pgf@counta=0
+ \forest@loop
+ \ifnum\c@pgf@counta<\forest@pi@n\relax
+ \forest@ppi@deflet{forest@pi@\the\c@pgf@counta @}%
+ \forest@reversearray\forest@ppi@let
+ {0}%
+ {\csname forest@pi@\the\c@pgf@counta @n\endcsname}%
+ \advance\c@pgf@counta 1
+ \forest@repeat
+% \end{macrocode}
+% Calling |\forest@gettightedgeofpath@getedge| now will result in the
+% positive edge.
+% \begin{macrocode}
+ \forest@gettightedgeofpath@getedge\forest@edge
+ \forest@simplifypath\forest@edge\forest@gep@secondedge
+% \end{macrocode}
+% Smuggle the results out of the enclosing \TeX\ group.
+% \begin{macrocode}
+ \global\let\forest@gep@global@firstedge\forest@gep@firstedge
+ \global\let\forest@gep@global@secondedge\forest@gep@secondedge
+ }%
+ \let#2\forest@gep@global@firstedge
+ \let#3\forest@gep@global@secondedge
+}
+% \end{macrocode}
+%
+% Sort the inner arrays of original points wrt the distance to the
+% grow line. |#2| =
+% |\forest@sort@ascending|/|\forest@sort@descending|.
+% \begin{macrocode}
+\def\forest@sort@inner@arrays#1#2{%
+ \c@pgf@counta=0
+ \safeloop
+ \ifnum\c@pgf@counta<\csname#1n\endcsname
+ \c@pgf@countb=\csname#1\the\c@pgf@counta @n\endcsname\relax
+ \ifnum\c@pgf@countb>1
+ \advance\c@pgf@countb -1
+ \forest@ppi@deflet{#1\the\c@pgf@counta @}%
+ \forest@ppi@defcmp{#1\the\c@pgf@counta @}%
+ \forest@sort\forest@ppi@cmp\forest@ppi@let#2{0}{\the\c@pgf@countb}%
+ \fi
+ \advance\c@pgf@counta 1
+ \saferepeat
+}
+% \end{macrocode}
+%
+% A macro that will define the item exchange macro for quicksorting
+% the inner arrays of original points. It takes one argument: the
+% prefix of the inner array.
+% \begin{macrocode}
+\def\forest@ppi@deflet#1{%
+ \edef\forest@ppi@let##1##2{%
+ \noexpand\csletcs{#1##1x}{#1##2x}%
+ \noexpand\csletcs{#1##1y}{#1##2y}%
+ \noexpand\csletcs{#1##1d}{#1##2d}%
+ }%
+}
+% \end{macrocode}
+% A macro that will define the item-compare macro for quicksorting the
+% embedded arrays of original points. It takes one argument: the
+% prefix of the inner array.
+% \begin{macrocode}
+\def\forest@ppi@defcmp#1{%
+ \edef\forest@ppi@cmp##1##2{%
+ \noexpand\forest@sort@cmpdimcs{#1##1d}{#1##2d}%
+ }%
+}
+% \end{macrocode}
+%
+% Put path segments into a ``segment dictionary'': for each segment of
+% the pgf path (given in |#1|) from $(x_1,y_1)$ to $(x_2,y_2)$ we put
+% |(x1,y1)--(x2,y2)| into toks |#2|. (The ``dictionary'' was
+% reimplemented in v2.1.4. It's based on a toks register now, we search using
+% |\pgfutil@in@|.)
+% \begin{macrocode}
+\def\forest@pathtodict#1#2{%
+ \let\forest@pathtodict@toks#2%
+ \forest@save@pgfsyssoftpath@tokendefs
+ \let\pgfsyssoftpath@movetotoken\forest@pathtodict@movetoop
+ \let\pgfsyssoftpath@linetotoken\forest@pathtodict@linetoop
+ \def\forest@pathtodict@subpathstart{}%
+ #1%
+ \forest@restore@pgfsyssoftpath@tokendefs
+}
+% \end{macrocode}
+% When a move-to operation is encountered:
+% \begin{macrocode}
+\def\forest@pathtodict@movetoop#1#2{%
+ \apptotoks\forest@pathtodict@toks{(#1,#2)}%
+}
+% \end{macrocode}
+% When a line-to operation is encountered:
+% \begin{macrocode}
+\def\forest@pathtodict@linetoop#1#2{%
+ \apptotoks\forest@pathtodict@toks{--(#1,#2)}%
+}
+% \end{macrocode}
+%
+% In this macro, the edge is actually computed.
+% \begin{macrocode}
+\def\forest@gettightedgeofpath@getedge#1{% cs to store the edge into
+% \end{macrocode}
+% Clear the path and the last projection.
+% \begin{macrocode}
+ \pgfsyssoftpath@setcurrentpath\pgfutil@empty
+ \let\forest@last@x\relax
+ \let\forest@last@y\relax
+% \end{macrocode}
+% Loop through the (ordered) array of projections. (Since we will be
+% dealing with the current and the next projection in each iteration
+% of the loop, we loop the counter from the first to the
+% second-to-last projection.)
+% \begin{macrocode}
+ \c@pgf@counta=0
+ \forest@temp@count=\forest@pi@n\relax
+ \advance\forest@temp@count -1
+ \edef\forest@nminusone{\the\forest@temp@count}%
+ \safeloop
+ \ifnum\c@pgf@counta<\forest@nminusone\relax
+ \forest@gettightedgeofpath@getedge@loopa
+ \saferepeat
+% \end{macrocode}
+% A special case: the edge ends with a degenerate subpath (a
+% point).
+% \begin{macrocode}
+ \ifnum\forest@nminusone<\forest@n\relax\else
+ \ifnum\csname forest@pi@\forest@nminusone @n\endcsname>0
+ \forest@gettightedgeofpath@maybemoveto{\forest@nminusone}{0}%
+ \fi
+ \fi
+ \pgfsyssoftpath@getcurrentpath#1%
+ \pgfsyssoftpath@setcurrentpath\pgfutil@empty
+}
+% \end{macrocode}
+% The body of a loop containing an embedded loop must be put in a
+% separate macro because it contains the |\if...| of the embedded
+% |\forest@loop...| without the matching |\fi|: |\fi| is ``hiding'' in the
+% embedded |\forest@loop|, which has not been expanded yet.
+% \begin{macrocode}
+\def\forest@gettightedgeofpath@getedge@loopa{%
+ \ifnum\csname forest@pi@\the\c@pgf@counta @n\endcsname>0
+% \end{macrocode}
+% Degenerate case: a subpath of the edge is a point.
+% \begin{macrocode}
+ \forest@gettightedgeofpath@maybemoveto{\the\c@pgf@counta}{0}%
+% \end{macrocode}
+% Loop through points projecting to the current projection. The
+% preparations above guarantee that the points are ordered (either in
+% the ascending or the descending order) with respect to their
+% distance to the grow line.
+% \begin{macrocode}
+ \c@pgf@countb=0
+ \safeloop
+ \ifnum\c@pgf@countb<\csname forest@pi@\the\c@pgf@counta @n\endcsname\relax
+ \forest@gettightedgeofpath@getedge@loopb
+ \saferepeat
+ \fi
+ \advance\c@pgf@counta 1
+}
+% \end{macrocode}
+% Loop through points projecting to the next projection. Again, the
+% points are ordered.
+% \begin{macrocode}
+\def\forest@gettightedgeofpath@getedge@loopb{%
+ \c@pgf@countc=0
+ \advance\c@pgf@counta 1
+ \edef\forest@aplusone{\the\c@pgf@counta}%
+ \advance\c@pgf@counta -1
+ \safeloop
+ \ifnum\c@pgf@countc<\csname forest@pi@\forest@aplusone @n\endcsname\relax
+% \end{macrocode}
+% Test whether [the current point]--[the next point] or [the next
+% point]--[the current point] is a segment in the (broken) path. The
+% first segment found is the one with the minimal/maximal distance
+% (depending on the sort order of arrays of points projecting to the
+% same projection) to the grow line.
+%
+% Note that for this to work in all cases, the original path should
+% have been broken on its self-intersections. However, a careful
+% reader will probably remember that |\forest@breakpath| does
+% \emph{not} break the path at its self-intersections. This is
+% omitted for performance reasons. Given the intended use of the
+% algorithm (calculating edges of subtrees), self-intersecting paths
+% cannot arise anyway, if only the node boundaries are
+% non-self-intersecting. So, a warning: if you develop a new shape and
+% write a macro computing its boundary, make sure that the computed
+% boundary path is non-self-intersecting!
+% \begin{macrocode}
+ \edef\forest@temp{%
+ (\csname forest@pi@\the\c@pgf@counta @\the\c@pgf@countb x\endcsname,%
+ \csname forest@pi@\the\c@pgf@counta @\the\c@pgf@countb y\endcsname)--(%
+ \csname forest@pi@\forest@aplusone @\the\c@pgf@countc x\endcsname,%
+ \csname forest@pi@\forest@aplusone @\the\c@pgf@countc y\endcsname)%
+ }%
+ \expandafter\expandafter\expandafter\pgfutil@in@\expandafter\expandafter\expandafter
+ {\expandafter\forest@temp\expandafter}\expandafter
+ {\the\forest@segment@toks}%
+ \ifpgfutil@in@
+ \else
+ \edef\forest@temp{%
+ (\csname forest@pi@\forest@aplusone @\the\c@pgf@countc x\endcsname,%
+ \csname forest@pi@\forest@aplusone @\the\c@pgf@countc y\endcsname)--(%
+ \csname forest@pi@\the\c@pgf@counta @\the\c@pgf@countb x\endcsname,%
+ \csname forest@pi@\the\c@pgf@counta @\the\c@pgf@countb y\endcsname)%
+ }%
+ \expandafter\expandafter\expandafter\pgfutil@in@\expandafter\expandafter\expandafter
+ {\expandafter\forest@temp\expandafter}\expandafter
+ {\the\forest@segment@toks}%
+ \fi
+ \ifpgfutil@in@
+% \end{macrocode}
+% We have found the segment with the minimal/maximal distance to the
+% grow line. So let's add it to the edge path.
+%
+% First, deal with the
+% start point of the edge: check if the current point is the last
+% point. If that is the case (this happens if the current point was
+% the end point of the last segment added to the edge), nothing needs
+% to be done; otherwise (this happens if the current point will start
+% a new subpath of the edge), move to the current point, and update
+% the last-point macros.
+% \begin{macrocode}
+ \forest@gettightedgeofpath@maybemoveto{\the\c@pgf@counta}{\the\c@pgf@countb}%
+% \end{macrocode}
+% Second, create a line to the end point.
+% \begin{macrocode}
+ \edef\forest@last@x{%
+ \csname forest@pi@\forest@aplusone @\the\c@pgf@countc x\endcsname}%
+ \edef\forest@last@y{%
+ \csname forest@pi@\forest@aplusone @\the\c@pgf@countc y\endcsname}%
+ \pgfsyssoftpath@lineto\forest@last@x\forest@last@y
+% \end{macrocode}
+% Finally, ``break'' out of the innermost two loops.
+% \begin{macrocode}
+ \c@pgf@countc=\csname forest@pi@\forest@aplusone @n\endcsname
+ \c@pgf@countb=\csname forest@pi@\the\c@pgf@counta @n\endcsname
+ \fi
+ \advance\c@pgf@countc 1
+ \saferepeat
+ \advance\c@pgf@countb 1
+}
+% \end{macrocode}
+% |\forest@#1@| is an (ordered) array of points projecting to
+% projection with index |#1|. Check if |#2|th point of that array
+% equals the last point added to the edge: if not, add it.
+% \begin{macrocode}
+\def\forest@gettightedgeofpath@maybemoveto#1#2{%
+ \forest@temptrue
+ \ifx\forest@last@x\relax\else
+ \ifdim\forest@last@x=\csname forest@pi@#1@#2x\endcsname\relax
+ \ifdim\forest@last@y=\csname forest@pi@#1@#2y\endcsname\relax
+ \forest@tempfalse
+ \fi
+ \fi
+ \fi
+ \ifforest@temp
+ \edef\forest@last@x{\csname forest@pi@#1@#2x\endcsname}%
+ \edef\forest@last@y{\csname forest@pi@#1@#2y\endcsname}%
+ \pgfsyssoftpath@moveto\forest@last@x\forest@last@y
+ \fi
+}
+% \end{macrocode}
+%
+% Simplify the resulting path by ``unbreaking'' segments where
+% possible. (The macro itself is just a wrapper for path processing
+% macros below.)
+% \begin{macrocode}
+\def\forest@simplifypath#1#2{%
+ \pgfsyssoftpath@setcurrentpath\pgfutil@empty
+ \forest@save@pgfsyssoftpath@tokendefs
+ \let\pgfsyssoftpath@movetotoken\forest@simplifypath@moveto
+ \let\pgfsyssoftpath@linetotoken\forest@simplifypath@lineto
+ \let\forest@last@x\relax
+ \let\forest@last@y\relax
+ \let\forest@last@atan\relax
+ #1%
+ \ifx\forest@last@x\relax\else
+ \ifx\forest@last@atan\relax\else
+ \pgfsyssoftpath@lineto\forest@last@x\forest@last@y
+ \fi
+ \fi
+ \forest@restore@pgfsyssoftpath@tokendefs
+ \pgfsyssoftpath@getcurrentpath#2%
+ \pgfsyssoftpath@setcurrentpath\pgfutil@empty
+}
+% \end{macrocode}
+% When a move-to is encountered, we flush whatever segment we were
+% building, make the move, remember the last position, and set the
+% slope to unknown.
+% \begin{macrocode}
+\def\forest@simplifypath@moveto#1#2{%
+ \ifx\forest@last@x\relax\else
+ \pgfsyssoftpath@lineto\forest@last@x\forest@last@y
+ \fi
+ \pgfsyssoftpath@moveto{#1}{#2}%
+ \def\forest@last@x{#1}%
+ \def\forest@last@y{#2}%
+ \let\forest@last@atan\relax
+}
+% \end{macrocode}
+% How much may the segment slopes differ that we can still merge them?
+% (Ignore |pt|, these are degrees.) Also, how good is this number?
+% \begin{macrocode}
+\def\forest@getedgeofpath@precision{1pt}
+% \end{macrocode}
+% When a line-to is encountered\dots
+% \begin{macrocode}
+\def\forest@simplifypath@lineto#1#2{%
+ \ifx\forest@last@x\relax
+% \end{macrocode}
+% If we're not in the middle of a merger, we need to nothing but start
+% it.
+% \begin{macrocode}
+ \def\forest@last@x{#1}%
+ \def\forest@last@y{#2}%
+ \let\forest@last@atan\relax
+ \else
+% \end{macrocode}
+% Otherwise, we calculate the slope of the current segment (i.e.\ the
+% segment between the last and the current point), \dots
+% \begin{macrocode}
+ \pgfpointdiff{\pgfqpoint{#1}{#2}}{\pgfqpoint{\forest@last@x}{\forest@last@y}}%
+ \ifdim\pgf@x<\pgfintersectiontolerance
+ \ifdim-\pgf@x<\pgfintersectiontolerance
+ \pgf@x=0pt
+ \fi
+ \fi
+ \edef\forest@marshal{%
+ \noexpand\pgfmathatantwo@
+ {\expandafter\Pgf@geT\the\pgf@x}%
+ {\expandafter\Pgf@geT\the\pgf@y}%
+ }\forest@marshal
+ \let\forest@current@atan\pgfmathresult
+ \ifx\forest@last@atan\relax
+% \end{macrocode}
+% If this is the first segment in the current merger, simply remember
+% the slope and the last point.
+% \begin{macrocode}
+ \def\forest@last@x{#1}%
+ \def\forest@last@y{#2}%
+ \let\forest@last@atan\forest@current@atan
+ \else
+% \end{macrocode}
+% Otherwise, compare the first and the current slope.
+% \begin{macrocode}
+ \pgfutil@tempdima=\forest@current@atan pt
+ \advance\pgfutil@tempdima -\forest@last@atan pt
+ \ifdim\pgfutil@tempdima<0pt\relax
+ \multiply\pgfutil@tempdima -1
+ \fi
+ \ifdim\pgfutil@tempdima<\forest@getedgeofpath@precision\relax
+ \else
+% \end{macrocode}
+% If the slopes differ too much, flush the path up to the previous
+% segment, and set up a new first slope.
+% \begin{macrocode}
+ \pgfsyssoftpath@lineto\forest@last@x\forest@last@y
+ \let\forest@last@atan\forest@current@atan
+ \fi
+% \end{macrocode}
+% In any event, update the last point.
+% \begin{macrocode}
+ \def\forest@last@x{#1}%
+ \def\forest@last@y{#2}%
+ \fi
+ \fi
+}
+% \end{macrocode}
+%
+%
+% \subsection{Get rectangle/band edge}
+%
+% \begin{macrocode}
+\def\forest@getnegativerectangleedgeofpath#1#2{%
+ \forest@getnegativerectangleorbandedgeofpath{#1}{#2}{\the\pgf@xb}}
+\def\forest@getpositiverectangleedgeofpath#1#2{%
+ \forest@getpositiverectangleorbandedgeofpath{#1}{#2}{\the\pgf@xb}}
+\def\forest@getbothrectangleedgesofpath#1#2#3{%
+ \forest@getbothrectangleorbandedgesofpath{#1}{#2}{#3}{\the\pgf@xb}}
+\def\forest@bandlength{5000pt} % something large (ca. 180cm), but still manageable for TeX without producing `too large' errors
+\def\forest@getnegativebandedgeofpath#1#2{%
+ \forest@getnegativerectangleorbandedgeofpath{#1}{#2}{\forest@bandlength}}
+\def\forest@getpositivebandedgeofpath#1#2{%
+ \forest@getpositiverectangleorbandedgeofpath{#1}{#2}{\forest@bandlength}}
+\def\forest@getbothbandedgesofpath#1#2#3{%
+ \forest@getbothrectangleorbandedgesofpath{#1}{#2}{#3}{\forest@bandlength}}
+\def\forest@getnegativerectangleorbandedgeofpath#1#2#3{%
+ \forest@path@getboundingrectangle@ls#1{\forest@grow}%
+ \edef\forest@gre@path{%
+ \noexpand\pgfsyssoftpath@movetotoken{\the\pgf@xa}{\the\pgf@ya}%
+ \noexpand\pgfsyssoftpath@linetotoken{#3}{\the\pgf@ya}%
+ }%
+ {%
+ \pgftransformreset
+ \forest@pgfqtransformrotate{\forest@grow}%
+ \forest@pgfpathtransformed\forest@gre@path
+ }%
+ \pgfsyssoftpath@getcurrentpath#2%
+}
+\def\forest@getpositiverectangleorbandedgeofpath#1#2#3{%
+ \forest@path@getboundingrectangle@ls#1{\forest@grow}%
+ \edef\forest@gre@path{%
+ \noexpand\pgfsyssoftpath@movetotoken{\the\pgf@xa}{\the\pgf@yb}%
+ \noexpand\pgfsyssoftpath@linetotoken{#3}{\the\pgf@yb}%
+ }%
+ {%
+ \pgftransformreset
+ \forest@pgfqtransformrotate{\forest@grow}%
+ \forest@pgfpathtransformed\forest@gre@path
+ }%
+ \pgfsyssoftpath@getcurrentpath#2%
+}
+\def\forest@getbothrectangleorbandedgesofpath#1#2#3#4{%
+ \forest@path@getboundingrectangle@ls#1{\forest@grow}%
+ \edef\forest@gre@negpath{%
+ \noexpand\pgfsyssoftpath@movetotoken{\the\pgf@xa}{\the\pgf@ya}%
+ \noexpand\pgfsyssoftpath@linetotoken{#4}{\the\pgf@ya}%
+ }%
+ \edef\forest@gre@pospath{%
+ \noexpand\pgfsyssoftpath@movetotoken{\the\pgf@xa}{\the\pgf@yb}%
+ \noexpand\pgfsyssoftpath@linetotoken{#4}{\the\pgf@yb}%
+ }%
+ {%
+ \pgftransformreset
+ \forest@pgfqtransformrotate{\forest@grow}%
+ \forest@pgfpathtransformed\forest@gre@negpath
+ }%
+ \pgfsyssoftpath@getcurrentpath#2%
+ {%
+ \pgftransformreset
+ \forest@pgfqtransformrotate{\forest@grow}%
+ \forest@pgfpathtransformed\forest@gre@pospath
+ }%
+ \pgfsyssoftpath@getcurrentpath#3%
+}
+% \end{macrocode}
+%
+% \subsection{Distance between paths}
+% \label{imp:distance}
+%
+% Another crucial part of the package.
+%
+% \begin{macrocode}
+\newtoks\forest@PIi@toks
+\newtoks\forest@PIii@toks
+\def\forest@distance@between@edge@paths#1#2#3{%
+ \begingroup
+ % #1, #2 = (edge) paths
+ %
+ % project paths
+ \forest@projectpathtogrowline#1{forest@p1@}%
+ \forest@projectpathtogrowline#2{forest@p2@}%
+ % merge projections (the lists are sorted already, because edge
+ % paths are |sorted|)
+ \forest@dbep@mergeprojections
+ {forest@p1@}{forest@p2@}%
+ {forest@P1@}{forest@P2@}%
+ % process projections
+ \forest@processprojectioninfo{forest@P1@}{forest@PI1@}\forest@PIi@toks
+ \forest@processprojectioninfo{forest@P2@}{forest@PI2@}\forest@PIii@toks
+ % break paths
+ \forest@breakpath#1{forest@PI1@}\forest@PIi@toks\forest@broken@one
+ \forest@breakpath#2{forest@PI2@}\forest@PIii@toks\forest@broken@two
+ % sort inner arrays ---optimize: it's enough to find max and min
+ \forest@sort@inner@arrays{forest@PI1@}\forest@sort@descending
+ \forest@sort@inner@arrays{forest@PI2@}\forest@sort@ascending
+ % compute the distance
+ \let\forest@distance\relax
+ \c@pgf@countc=0
+ \forest@loop
+ \ifnum\c@pgf@countc<\csname forest@PI1@n\endcsname\relax
+ \ifnum\csname forest@PI1@\the\c@pgf@countc @n\endcsname=0 \else
+ \ifnum\csname forest@PI2@\the\c@pgf@countc @n\endcsname=0 \else
+ \pgfutil@tempdima=\csname forest@PI2@\the\c@pgf@countc @0d\endcsname\relax
+ \advance\pgfutil@tempdima -\csname forest@PI1@\the\c@pgf@countc @0d\endcsname\relax
+ \ifx\forest@distance\relax
+ \edef\forest@distance{\the\pgfutil@tempdima}%
+ \else
+ \ifdim\pgfutil@tempdima<\forest@distance\relax
+ \edef\forest@distance{\the\pgfutil@tempdima}%
+ \fi
+ \fi
+ \fi
+ \fi
+ \advance\c@pgf@countc 1
+ \forest@repeat
+ \global\let\forest@global@temp\forest@distance
+ \endgroup
+ \let#3\forest@global@temp
+}
+ % merge projections: we need two projection arrays, both containing
+ % projection points from both paths, but each with the original
+ % points from only one path
+\def\forest@dbep@mergeprojections#1#2#3#4{%
+ % TODO: optimize: v bistvu ni treba sortirat, ker je edge path že sortiran
+ \forest@sortprojections{#1}%
+ \forest@sortprojections{#2}%
+ \c@pgf@counta=0
+ \c@pgf@countb=0
+ \c@pgf@countc=0
+ \edef\forest@input@prefix@one{#1}%
+ \edef\forest@input@prefix@two{#2}%
+ \edef\forest@output@prefix@one{#3}%
+ \edef\forest@output@prefix@two{#4}%
+ \forest@dbep@mp@iterate
+ \csedef{#3n}{\the\c@pgf@countc}%
+ \csedef{#4n}{\the\c@pgf@countc}%
+}
+\def\forest@dbep@mp@iterate{%
+ \let\forest@dbep@mp@next\forest@dbep@mp@iterate
+ \ifnum\c@pgf@counta<\csname\forest@input@prefix@one n\endcsname\relax
+ \ifnum\c@pgf@countb<\csname\forest@input@prefix@two n\endcsname\relax
+ \let\forest@dbep@mp@next\forest@dbep@mp@do
+ \else
+ \let\forest@dbep@mp@next\forest@dbep@mp@iteratefirst
+ \fi
+ \else
+ \ifnum\c@pgf@countb<\csname\forest@input@prefix@two n\endcsname\relax
+ \let\forest@dbep@mp@next\forest@dbep@mp@iteratesecond
+ \else
+ \let\forest@dbep@mp@next\relax
+ \fi
+ \fi
+ \forest@dbep@mp@next
+}
+\def\forest@dbep@mp@do{%
+ \forest@sort@cmptwodimcs%
+ {\forest@input@prefix@one\the\c@pgf@counta xp}%
+ {\forest@input@prefix@one\the\c@pgf@counta yp}%
+ {\forest@input@prefix@two\the\c@pgf@countb xp}%
+ {\forest@input@prefix@two\the\c@pgf@countb yp}%
+ \if\forest@sort@cmp@result=%
+ \forest@dbep@mp@@store@p\forest@input@prefix@one\c@pgf@counta
+ \forest@dbep@mp@@store@o\forest@input@prefix@one
+ \c@pgf@counta\forest@output@prefix@one
+ \forest@dbep@mp@@store@o\forest@input@prefix@two
+ \c@pgf@countb\forest@output@prefix@two
+ \advance\c@pgf@counta 1
+ \advance\c@pgf@countb 1
+ \else
+ \if\forest@sort@cmp@result>%
+ \forest@dbep@mp@@store@p\forest@input@prefix@two\c@pgf@countb
+ \forest@dbep@mp@@store@o\forest@input@prefix@two
+ \c@pgf@countb\forest@output@prefix@two
+ \advance\c@pgf@countb 1
+ \else%<
+ \forest@dbep@mp@@store@p\forest@input@prefix@one\c@pgf@counta
+ \forest@dbep@mp@@store@o\forest@input@prefix@one
+ \c@pgf@counta\forest@output@prefix@one
+ \advance\c@pgf@counta 1
+ \fi
+ \fi
+ \advance\c@pgf@countc 1
+ \forest@dbep@mp@iterate
+}
+\def\forest@dbep@mp@@store@p#1#2{%
+ \csletcs
+ {\forest@output@prefix@one\the\c@pgf@countc xp}%
+ {#1\the#2xp}%
+ \csletcs
+ {\forest@output@prefix@one\the\c@pgf@countc yp}%
+ {#1\the#2yp}%
+ \csletcs
+ {\forest@output@prefix@two\the\c@pgf@countc xp}%
+ {#1\the#2xp}%
+ \csletcs
+ {\forest@output@prefix@two\the\c@pgf@countc yp}%
+ {#1\the#2yp}%
+}
+\def\forest@dbep@mp@@store@o#1#2#3{%
+ \csletcs{#3\the\c@pgf@countc xo}{#1\the#2xo}%
+ \csletcs{#3\the\c@pgf@countc yo}{#1\the#2yo}%
+}
+\def\forest@dbep@mp@iteratefirst{%
+ \forest@dbep@mp@iterateone\forest@input@prefix@one\c@pgf@counta\forest@output@prefix@one
+}
+\def\forest@dbep@mp@iteratesecond{%
+ \forest@dbep@mp@iterateone\forest@input@prefix@two\c@pgf@countb\forest@output@prefix@two
+}
+\def\forest@dbep@mp@iterateone#1#2#3{%
+ \forest@loop
+ \ifnum#2<\csname#1n\endcsname\relax
+ \forest@dbep@mp@@store@p#1#2%
+ \forest@dbep@mp@@store@o#1#2#3%
+ \advance\c@pgf@countc 1
+ \advance#21
+ \forest@repeat
+}
+% \end{macrocode}
+%
+% \subsection{Utilities}
+%
+% Equality test: points are considered equal if they differ less than
+% |\pgfintersectiontolerance| in each coordinate.
+% \begin{macrocode}
+\newif\ifforest@equaltotolerance
+\def\forest@equaltotolerance#1#2{{%
+ \pgfpointdiff{#1}{#2}%
+ \ifdim\pgf@x<0pt \multiply\pgf@x -1 \fi
+ \ifdim\pgf@y<0pt \multiply\pgf@y -1 \fi
+ \global\forest@equaltotolerancefalse
+ \ifdim\pgf@x<\pgfintersectiontolerance\relax
+ \ifdim\pgf@y<\pgfintersectiontolerance\relax
+ \global\forest@equaltotolerancetrue
+ \fi
+ \fi
+}}
+% \end{macrocode}
+%
+% Save/restore |pgf|s |\pgfsyssoftpath@...token| definitions.
+% \begin{macrocode}
+\def\forest@save@pgfsyssoftpath@tokendefs{%
+ \let\forest@origmovetotoken\pgfsyssoftpath@movetotoken
+ \let\forest@origlinetotoken\pgfsyssoftpath@linetotoken
+ \let\forest@origcurvetosupportatoken\pgfsyssoftpath@curvetosupportatoken
+ \let\forest@origcurvetosupportbtoken\pgfsyssoftpath@curvetosupportbtoken
+ \let\forest@origcurvetotoken\pgfsyssoftpath@curvetototoken
+ \let\forest@origrectcornertoken\pgfsyssoftpath@rectcornertoken
+ \let\forest@origrectsizetoken\pgfsyssoftpath@rectsizetoken
+ \let\forest@origclosepathtoken\pgfsyssoftpath@closepathtoken
+ \let\pgfsyssoftpath@movetotoken\forest@badtoken
+ \let\pgfsyssoftpath@linetotoken\forest@badtoken
+ \let\pgfsyssoftpath@curvetosupportatoken\forest@badtoken
+ \let\pgfsyssoftpath@curvetosupportbtoken\forest@badtoken
+ \let\pgfsyssoftpath@curvetototoken\forest@badtoken
+ \let\pgfsyssoftpath@rectcornertoken\forest@badtoken
+ \let\pgfsyssoftpath@rectsizetoken\forest@badtoken
+ \let\pgfsyssoftpath@closepathtoken\forest@badtoken
+}
+\def\forest@badtoken{%
+ \PackageError{forest}{This token should not be in this path}{}%
+}
+\def\forest@restore@pgfsyssoftpath@tokendefs{%
+ \let\pgfsyssoftpath@movetotoken\forest@origmovetotoken
+ \let\pgfsyssoftpath@linetotoken\forest@origlinetotoken
+ \let\pgfsyssoftpath@curvetosupportatoken\forest@origcurvetosupportatoken
+ \let\pgfsyssoftpath@curvetosupportbtoken\forest@origcurvetosupportbtoken
+ \let\pgfsyssoftpath@curvetototoken\forest@origcurvetotoken
+ \let\pgfsyssoftpath@rectcornertoken\forest@origrectcornertoken
+ \let\pgfsyssoftpath@rectsizetoken\forest@origrectsizetoken
+ \let\pgfsyssoftpath@closepathtoken\forest@origclosepathtoken
+}
+% \end{macrocode}
+%
+% Extend path |#1| with path |#2| translated by point |#3|.
+% \begin{macrocode}
+\def\forest@extendpath#1#2#3{%
+ \pgf@process{#3}%
+ \pgfsyssoftpath@setcurrentpath#1%
+ \forest@save@pgfsyssoftpath@tokendefs
+ \let\pgfsyssoftpath@movetotoken\forest@extendpath@moveto
+ \let\pgfsyssoftpath@linetotoken\forest@extendpath@lineto
+ #2%
+ \forest@restore@pgfsyssoftpath@tokendefs
+ \pgfsyssoftpath@getcurrentpath#1%
+}
+\def\forest@extendpath@moveto#1#2{%
+ \forest@extendpath@do{#1}{#2}\pgfsyssoftpath@moveto
+}
+\def\forest@extendpath@lineto#1#2{%
+ \forest@extendpath@do{#1}{#2}\pgfsyssoftpath@lineto
+}
+\def\forest@extendpath@do#1#2#3{%
+ {%
+ \advance\pgf@x #1
+ \advance\pgf@y #2
+ #3{\the\pgf@x}{\the\pgf@y}%
+ }%
+}
+% \end{macrocode}
+%
+% Get bounding rectangle of the path. |#1| = the path, |#2| = grow.
+% Returns (|\pgf@xa|=min x/l, |\pgf@ya|=max y/s, |\pgf@xb|=min x/l, |\pgf@yb|=max y/s). (If path |#1|
+% is empty, the result is undefined.)
+% \begin{macrocode}
+\def\forest@path@getboundingrectangle@ls#1#2{%
+ {%
+ \pgftransformreset
+ \forest@pgfqtransformrotate{-#2}%
+ \forest@pgfpathtransformed#1%
+ }%
+ \pgfsyssoftpath@getcurrentpath\forest@gbr@rotatedpath
+ \forest@path@getboundingrectangle@xy\forest@gbr@rotatedpath
+}
+\def\forest@path@getboundingrectangle@xy#1{%
+ \forest@save@pgfsyssoftpath@tokendefs
+ \let\pgfsyssoftpath@movetotoken\forest@gbr@firstpoint
+ \let\pgfsyssoftpath@linetotoken\forest@gbr@firstpoint
+ #1%
+ \forest@restore@pgfsyssoftpath@tokendefs
+}
+\def\forest@gbr@firstpoint#1#2{%
+ \pgf@xa=#1 \pgf@xb=#1 \pgf@ya=#2 \pgf@yb=#2
+ \let\pgfsyssoftpath@movetotoken\forest@gbr@point
+ \let\pgfsyssoftpath@linetotoken\forest@gbr@point
+}
+\def\forest@gbr@point#1#2{%
+ \ifdim#1<\pgf@xa\relax\pgf@xa=#1 \fi
+ \ifdim#1>\pgf@xb\relax\pgf@xb=#1 \fi
+ \ifdim#2<\pgf@ya\relax\pgf@ya=#2 \fi
+ \ifdim#2>\pgf@yb\relax\pgf@yb=#2 \fi
+}
+% \end{macrocode}
+% Hack: create our own version of |pgf|'s |\pgftransformrotate| which does not call |\pgfmathparse|. Nothing really bad happens if patch fails. We're just a bit slower.
+% \begin{macrocode}
+\let\forest@pgfqtransformrotate\pgftransformrotate
+\let\forest@pgftransformcm\pgftransformcm
+\let\forest@pgf@transformcm\pgf@transformcm
+\patchcmd{\forest@pgfqtransformrotate}{\pgfmathparse{#1}}{\edef\pgfmathresult{\number\numexpr#1}}{}{}
+\patchcmd{\forest@pgfqtransformrotate}{\pgftransformcm}{\forest@pgftransformcm}{}{}
+\patchcmd{\forest@pgftransformcm}{\pgf@transformcm}{\forest@pgf@transformcm}{}{}
+\patchcmd{\forest@pgf@transformcm}{\pgfmathsetlength}{\forest@pgf@transformcm@setlength}{}{} % 4x
+\patchcmd{\forest@pgf@transformcm}{\pgfmathsetlength}{\forest@pgf@transformcm@setlength}{}{} % 4x
+\patchcmd{\forest@pgf@transformcm}{\pgfmathsetlength}{\forest@pgf@transformcm@setlength}{}{} % 4x
+\patchcmd{\forest@pgf@transformcm}{\pgfmathsetlength}{\forest@pgf@transformcm@setlength}{}{} % 4x
+\def\forest@pgf@transformcm@setlength#1#2{#1=#2pt}
+% \end{macrocode}
+%
+% \section{The outer UI}
+%
+%
+% \subsection{Externalization}
+% \begin{macrocode}
+\pgfkeys{/forest/external/.cd,
+ %copy command/.initial={cp "\source" "\target"},
+ copy command/.initial={},
+ optimize/.is if=forest@external@optimize@,
+ context/.initial={%
+ \forestOve{\csname forest@id@of@standard node\endcsname}{environment@formula}},
+ depends on macro/.style={context/.append/.expanded={%
+ \expandafter\detokenize\expandafter{#1}}},
+}
+\def\forest@file@copy#1#2{%
+ \IfFileExists{#1}{%
+ \pgfkeysgetvalue{/forest/external/copy command}\forest@copy@command
+ \ifdefempty\forest@copy@command{%
+ \forest@file@copy@{#1}{#2}%
+ }{ % copy by external command
+ \def\source{#1}%
+ \def\target{#2}%
+ \immediate\write18{\forest@copy@command}%
+ }%
+ }{}%
+}
+\newread\forest@copy@in
+\newwrite\forest@copy@out
+\def\forest@file@copy@#1#2{%
+ \begingroup
+ \openin\forest@copy@in=#1
+ \immediate\openout\forest@copy@out#2
+ \endlinechar-1
+ \loop
+ \unless\ifeof\forest@copy@in
+ \readline\forest@copy@in to\forest@temp
+ \immediate\write\forest@copy@out{\forest@temp}%
+ \repeat
+ \immediate\closeout\forest@copy@out
+ \closein\forest@copy@in
+ \endgroup
+}
+\newif\ifforest@external@optimize@
+\forest@external@optimize@true
+\ifforest@install@keys@to@tikz@path@
+\tikzset{
+ fit to/.style={
+ /forest/for nodewalk=%
+ {TeX={\def\forest@fitto{}},#1}%
+ {TeX={\eappto\forest@fitto{(\forestove{name})}}},
+ fit/.expanded={\forest@fitto}
+ },
+}
+\fi
+\ifforest@external@
+ \ifdefined\tikzexternal@tikz@replacement\else
+ \usetikzlibrary{external}%
+ \fi
+ \pgfkeys{%
+ /tikz/external/failed ref warnings for={},
+ /pgf/images/aux in dpth=false,
+ }%
+ \tikzifexternalizing{}{%
+ \forest@file@copy{\jobname.aux}{\jobname.aux.copy}%
+ }%
+ \AtBeginDocument{%
+ \tikzifexternalizing{%
+ \IfFileExists{\tikzexternalrealjob.aux.copy}{%
+ \makeatletter
+ \input\tikzexternalrealjob.aux.copy\relax
+ \makeatother
+ }{}%
+ }{%
+ \newwrite\forest@auxout
+ \immediate\openout\forest@auxout=\tikzexternalrealjob.for.tmp
+ }%
+ \IfFileExists{\tikzexternalrealjob.for}{%
+ {%
+ \makehashother\makeatletter
+ \input\tikzexternalrealjob.for\relax
+ }%
+ }{}%
+ }%
+ \AtEndDocument{%
+ \tikzifexternalizing{}{%
+ \immediate\closeout\forest@auxout
+ \forest@file@copy{\jobname.for.tmp}{\jobname.for}%
+ }%
+ }%
+\fi
+% \end{macrocode}
+%
+% \subsection{The \texttt{forest} environment}
+% \label{imp:forest-environment}
+%
+% There are three ways to invoke \foRest;: the environment and the starless and the starred version
+% of the macro. The latter creates no group.
+%
+% Most of the code in this section deals with externalization.
+%
+% \begin{macrocode}
+\NewDocumentEnvironment{forest}{D(){}}{%
+ \forest@config{#1}%
+ \Collect@Body
+ \forest@env
+}{}
+\NewDocumentCommand{\Forest}{s D(){} m}{%
+ \forest@config{#2}%
+ \IfBooleanTF{#1}{\let\forest@next\forest@env}{\let\forest@next\forest@group@env}%
+ \forest@next{#3}%
+}
+\def\forest@config#1{%
+ \forest@defstages{stages}%
+ \forestset{@config/.cd,#1}%
+}
+\def\forest@defstages#1{%
+ \def\forest@stages{#1}%
+}
+\forestset{@config/.cd,
+ %stages/.store in=\forest@stages,
+ stages/.code={\forest@defstages{#1}},
+ .unknown/.code={\PackageError{forest}{Unknown config option for forest environment/command.}{In Forest v2.0.0 and v2.0.1, this (parenthesized) argument accepted the definition of style stages for the current forest environment/macro. Since v2.0.2, you should write "\string\begin{forest}(stages={...})...\string\end{forest}", or "\string\Forest(stages={...}){...}" instead.}}
+}
+\def\forest@group@env#1{{\forest@env{#1}}}
+\newif\ifforest@externalize@tree@
+\newif\ifforest@was@tikzexternalwasenable
+\newcommand\forest@env[1]{%
+ \let\forest@external@next\forest@begin
+ \forest@was@tikzexternalwasenablefalse
+ \ifdefined\tikzexternal@tikz@replacement
+ \ifx\tikz\tikzexternal@tikz@replacement
+ \forest@was@tikzexternalwasenabletrue
+ \tikzexternaldisable
+ \fi
+ \fi
+ \forest@externalize@tree@false
+ \ifforest@external@
+ \ifforest@was@tikzexternalwasenable
+ \forest@env@
+ \fi
+ \fi
+ \forest@standardnode@calibrate
+ \forest@external@next{#1}%
+}
+\def\forest@env@{%
+ \iftikzexternalexportnext
+ \tikzifexternalizing{%
+ \let\forest@external@next\forest@begin@externalizing
+ }{%
+ \let\forest@external@next\forest@begin@externalize
+ }%
+ \else
+ \tikzexternalexportnexttrue
+ \fi
+}
+% \end{macrocode}
+% We're externalizing, i.e.\ this code gets executed in the embedded call.
+% \begin{macrocode}
+\long\def\forest@begin@externalizing#1{%
+ \forest@external@setup{#1}%
+ \let\forest@external@next\forest@begin
+ \forest@externalize@inner@n=-1
+ \ifforest@external@optimize@\forest@externalizing@maybeoptimize\fi
+ \forest@external@next{#1}%
+ \tikzexternalenable
+}
+\def\forest@externalizing@maybeoptimize{%
+ \edef\forest@temp{\tikzexternalrealjob-forest-\forest@externalize@outer@n}%
+ \edef\forest@marshal{%
+ \noexpand\pgfutil@in@
+ {\expandafter\detokenize\expandafter{\forest@temp}.}
+ {\expandafter\detokenize\expandafter{\pgfactualjobname}.}%
+ }\forest@marshal
+ \ifpgfutil@in@
+ \else
+ \let\forest@external@next\@gobble
+ \fi
+}
+% \end{macrocode}
+% Externalization is enabled, we're in the outer process, deciding if the picture is up-to-date.
+% \begin{macrocode}
+\long\def\forest@begin@externalize#1{%
+ \forest@external@setup{#1}%
+ \iftikzexternal@file@isuptodate
+ \setbox0=\hbox{%
+ \csname forest@externalcheck@\forest@externalize@outer@n\endcsname
+ }%
+ \fi
+ \iftikzexternal@file@isuptodate
+ \csname forest@externalload@\forest@externalize@outer@n\endcsname
+ \else
+ \forest@externalize@tree@true
+ \forest@externalize@inner@n=-1
+ \forest@begin{#1}%
+ \ifcsdef{forest@externalize@@\forest@externalize@id}{}{%
+ \immediate\write\forest@auxout{%
+ \noexpand\forest@external
+ {\forest@externalize@outer@n}%
+ {\expandafter\detokenize\expandafter{\forest@externalize@id}}%
+ {\expandonce\forest@externalize@checkimages}%
+ {\expandonce\forest@externalize@loadimages}%
+ }%
+ }%
+ \fi
+ \tikzexternalenable
+}
+\def\forest@includeexternal@check#1{%
+ \tikzsetnextfilename{#1}%
+ \IfFileExists{\tikzexternal@filenameprefix/#1}{\tikzexternal@file@isuptodatetrue}{\tikzexternal@file@isuptodatefalse}%
+}
+\def\makehashother{\catcode`\#=12}%
+\long\def\forest@external@setup#1{%
+ % set up \forest@externalize@id and \forest@externalize@outer@n
+ % we need to deal with #s correctly (\write doubles them)
+ \setbox0=\hbox{\makehashother\makeatletter
+ \scantokens{\forest@temp@toks{#1}}\expandafter
+ }%
+ \expandafter\forest@temp@toks\expandafter{\the\forest@temp@toks}%
+ \edef\forest@temp{\pgfkeysvalueof{/forest/external/context}}%
+ \edef\forest@externalize@id{%
+ \expandafter\detokenize\expandafter{\forest@temp}%
+ @@%
+ \expandafter\detokenize\expandafter{\the\forest@temp@toks}%
+ }%
+ \letcs\forest@externalize@outer@n{forest@externalize@@\forest@externalize@id}%
+ \ifdefined\forest@externalize@outer@n
+ \global\tikzexternal@file@isuptodatetrue
+ \else
+ \global\advance\forest@externalize@max@outer@n 1
+ \edef\forest@externalize@outer@n{\the\forest@externalize@max@outer@n}%
+ \global\tikzexternal@file@isuptodatefalse
+ \fi
+ \def\forest@externalize@loadimages{}%
+ \def\forest@externalize@checkimages{}%
+}
+\newcount\forest@externalize@max@outer@n
+\global\forest@externalize@max@outer@n=0
+\newcount\forest@externalize@inner@n
+% \end{macrocode}
+% The \texttt{.for} file is a string of calls of this macro.
+% \begin{macrocode}
+\long\def\forest@external#1#2#3#4{% #1=n,#2=context+source code,#3=update check code, #4=load code
+ \ifnum\forest@externalize@max@outer@n<#1
+ \global\forest@externalize@max@outer@n=#1
+ \fi
+ \global\csdef{forest@externalize@@\detokenize{#2}}{#1}%
+ \global\csdef{forest@externalcheck@#1}{#3}%
+ \global\csdef{forest@externalload@#1}{#4}%
+ \tikzifexternalizing{}{%
+ \immediate\write\forest@auxout{%
+ \noexpand\forest@external{#1}%
+ {\expandafter\detokenize\expandafter{#2}}%
+ {\unexpanded{#3}}%
+ {\unexpanded{#4}}%
+ }%
+ }%
+}
+% \end{macrocode}
+% These two macros include the external picture.
+% \begin{macrocode}
+\def\forest@includeexternal#1{%
+ \edef\forest@temp{\pgfkeysvalueof{/forest/external/context}}%
+ %\typeout{forest: Including external picture '#1' for forest context+code: '\expandafter\detokenize\expandafter{\forest@externalize@id}'}%
+ {%
+ %\def\pgf@declaredraftimage##1##2{\def\pgf@image{\hbox{}}}%
+ \tikzsetnextfilename{#1}%
+ \tikzexternalenable
+ \tikz{}%
+ }%
+}
+\def\forest@includeexternal@box#1#2{%
+ \global\setbox#1=\hbox{\forest@includeexternal{#2}}%
+}
+% \end{macrocode}
+% This code runs the bracket parser and stage processing.
+% \begin{macrocode}
+\long\def\forest@begin#1{%
+ \iffalse{\fi\forest@parsebracket#1}%
+}
+\def\forest@parsebracket{%
+ \bracketParse{\forest@get@root@afterthought}\forest@root=%
+}
+\def\forest@get@root@afterthought{%
+ \expandafter\forest@get@root@afterthought@\expandafter{\iffalse}\fi
+}
+\long\def\forest@get@root@afterthought@#1{%
+ \ifblank{#1}{}{%
+ \forestOeappto{\forest@root}{given options}{,afterthought={\unexpanded{#1}}}%
+ }%
+ \forest@do
+}
+\def\forest@do{%
+ \forest@node@Compute@numeric@ts@info{\forest@root}%
+ \expandafter\forestset\expandafter{\forest@stages}%
+ \ifforest@was@tikzexternalwasenable
+ \tikzexternalenable
+ \fi
+}
+% \end{macrocode}
+%
+% \subsection{Standard node}
+% \label{impl:standard-node}
+%
+% The standard node should be calibrated when entering the forest env: ^^AAAAAAAAAAAAAAAAAAAAAAAA
+% ^^A|\forestNodeHandle{standard node}.calibrate()|. What the calibration does is defined in a call to
+% ^^A|\forestStandardNode|.
+% The standard node init does \emph{not} initialize options from a(nother) standard node!
+% \begin{macrocode}
+\def\forest@standardnode@new{%
+ \advance\forest@node@maxid1
+ \forest@fornode{\the\forest@node@maxid}{%
+ \forest@node@init
+ \forestoeset{id}{\forest@cn}%
+ \forest@node@setname@silent{standard node}%
+ }%
+}
+\def\forest@standardnode@calibrate{%
+ \forest@fornode{\forest@node@Nametoid{standard node}}{%
+ \edef\forest@environment{\forestove{environment@formula}}%
+ \forestoget{previous@environment}\forest@previous@environment
+ \ifx\forest@environment\forest@previous@environment\else
+ \forestolet{previous@environment}\forest@environment
+ \forest@node@typeset
+ \forestoget{calibration@procedure}\forest@temp
+ \expandafter\forestset\expandafter{\forest@temp}%
+ \fi
+ }%
+}
+% \end{macrocode}
+% Usage: |\forestStandardNode[#1]{#2}{#3}{#4}|. |#1| = standard node specification --- specify it
+% as any other node content (but without children, of course). |#2| = the environment fingerprint:
+% list the values of parameters that influence the standard node's height and depth; the standard
+% will be adjusted whenever any of these parameters changes. |#3| = the calibration procedure: a
+% list of usual forest options which should calculating the values of exported options. |#4| = a
+% comma-separated list of exported options: every newly created node receives the initial values of
+% exported options from the standard node. (The standard node definition is local to the \TeX\
+% group.)
+% \begin{macrocode}
+\def\forestStandardNode[#1]#2#3#4{%
+ \let\forest@standardnode@restoretikzexternal\relax
+ \ifdefined\tikzexternaldisable
+ \ifx\tikz\tikzexternal@tikz@replacement
+ \tikzexternaldisable
+ \let\forest@standardnode@restoretikzexternal\tikzexternalenable
+ \fi
+ \fi
+ \forest@standardnode@new
+ \forest@fornode{\forest@node@Nametoid{standard node}}{%
+ \forestset{content=#1}%
+ \forestoset{environment@formula}{#2}%
+ \edef\forest@temp{\unexpanded{#3}}%
+ \forestolet{calibration@procedure}\forest@temp
+ \def\forest@calibration@initializing@code{}%
+ \pgfqkeys{/forest/initializing@code}{#4}%
+ \forestolet{initializing@code}\forest@calibration@initializing@code
+ \forest@standardnode@restoretikzexternal
+ }
+}
+\forestset{initializing@code/.unknown/.code={%
+ \eappto\forest@calibration@initializing@code{%
+ \noexpand\forestOget{\forest@node@Nametoid{standard node}}{\pgfkeyscurrentname}\noexpand\forest@temp
+ \noexpand\forestolet{\pgfkeyscurrentname}\noexpand\forest@temp
+ }%
+ }
+}
+% \end{macrocode}
+% This macro is called from a new (non-standard) node's init.
+% \begin{macrocode}
+\def\forest@initializefromstandardnode{%
+ \forestOve{\forest@node@Nametoid{standard node}}{initializing@code}%
+}
+% \end{macrocode}
+% Define the default standard node. Standard content: dj --- in Computer Modern font, d is the
+% highest and j the deepest letter (not character!). Environment fingerprint: the height of the
+% strut and the values of inner and outer seps. Calibration procedure: (i) \keyname{l sep}
+% equals the height of the strut plus the value of \keyname{inner ysep}, implementing both font-size and
+% inner sep dependency; (ii) The effect of \keyname{l} on the standard node should be the same as the
+% effect of \keyname{l sep}, thus, we derive \keyname{l} from \keyname{l sep} by adding
+% to the latter the total height of the standard node (plus the double outer sep, one for the parent
+% and one for the child). (iii) s sep is straightforward: a double inner xsep. Exported options:
+% options, calculated in the calibration. (Tricks: to change the default anchor, set it in |#1| and
+% export it; to set a non-forest node option (such as \keyname{draw} or \keyname{blue}) as default, set it
+% in |#1| and export the (internal) option \keyname{node options}.)
+% \begin{macrocode}
+\forestStandardNode[dj]
+ {%
+ \forestOve{\forest@node@Nametoid{standard node}}{content},%
+ \the\ht\strutbox,\the\pgflinewidth,%
+ \pgfkeysvalueof{/pgf/inner ysep},\pgfkeysvalueof{/pgf/outer ysep},%
+ \pgfkeysvalueof{/pgf/inner xsep},\pgfkeysvalueof{/pgf/outer xsep}%
+ }
+ {
+ l sep'/.expanded={\the\dimexpr\the\ht\strutbox+\pgfkeysvalueof{/pgf/inner ysep}},
+ l={l_sep()+abs(max_y()-min_y())+2*\pgfkeysvalueof{/pgf/outer ysep}},
+ s sep'/.expanded={\the\dimexpr \pgfkeysvalueof{/pgf/inner xsep}*2}
+ }
+ {l sep,l,s sep}
+% \end{macrocode}
+%
+%
+% \subsection{\texttt{ls} coordinate system}
+% \label{imp:ls-coordinates}
+%
+% \begin{macrocode}
+\pgfqkeys{/forest/@cs}{%
+ name/.code={%
+ \edef\forest@cn{\forest@node@Nametoid{#1}}%
+ \forest@forestcs@resetxy},
+ id/.code={%
+ \edef\forest@cn{#1}%
+ \forest@forestcs@resetxy},
+ go/.code={%
+ \forest@go{#1}%
+ \forest@forestcs@resetxy},
+ anchor/.code={\forest@forestcs@anchor{#1}},
+ l/.code={%
+ \forestmathsetlengthmacro\forest@forestcs@l{#1}%
+ \forest@forestcs@ls
+ },
+ s/.code={%
+ \forestmathsetlengthmacro\forest@forestcs@s{#1}%
+ \forest@forestcs@ls
+ },
+ .unknown/.code={%
+ \expandafter\pgfutil@in@\expandafter.\expandafter{\pgfkeyscurrentname}%
+ \ifpgfutil@in@
+ \expandafter\forest@forestcs@namegoanchor\pgfkeyscurrentname\forest@end
+ \else
+ \expandafter\forest@nameandgo\expandafter{\pgfkeyscurrentname}%
+ \forest@forestcs@resetxy
+ \fi
+ }
+}
+\def\forest@forestcs@resetxy{%
+ \ifnum\forest@cn=0 \forest@cs@invalidnodeerror\fi
+ \global\pgf@x\forestove{x}\relax
+ \global\pgf@y\forestove{y}\relax
+}
+\def\forest@forestcs@ls{%
+ \ifdefined\forest@forestcs@l
+ \ifdefined\forest@forestcs@s
+ {%
+ \pgftransformreset
+ \forest@pgfqtransformrotate{\forestove{grow}}%
+ \pgfpointtransformed{\pgfqpoint{\forest@forestcs@l}{\forest@forestcs@s}}%
+ }%
+ \global\advance\pgf@x\forestove{x}%
+ \global\advance\pgf@y\forestove{y}%
+ \fi
+ \fi
+}
+\def\forest@forestcs@anchor#1{%
+ \edef\forest@marshal{%
+ \noexpand\forest@original@tikz@parse@node\relax
+ (\forestove{name}\ifx\relax#1\relax\else.\fi#1)%
+ }\forest@marshal
+}
+\def\forest@forestcs@namegoanchor#1.#2\forest@end{%
+ \forest@nameandgo{#1}%
+ \ifnum\forest@cn=0 \forest@cs@invalidnodeerror\fi
+ \forest@forestcs@anchor{#2}%
+}
+\def\forest@cs@invalidnodeerror{%
+ \PackageError{forest}{Attempt to refer to the invalid node by "forest cs"}{}%
+}
+\tikzdeclarecoordinatesystem{forest}{%
+ \forest@forthis{%
+ \forest@forestcs@resetxy
+ \ifdefined\forest@forestcs@l\undef\forest@forestcs@l\fi
+ \ifdefined\forest@forestcs@s\undef\forest@forestcs@s\fi
+ \pgfqkeys{/forest/@cs}{#1}%
+ }%
+}
+% \end{macrocode}
+%
+% \subsection{Relative node names in \TikZ;}
+% \label{sec:relative-node-names}
+%
+% A hack into \TikZ;'s coordinate parser: implements relative node names!
+% \begin{macrocode}
+\def\forest@tikz@parse@node#1(#2){%
+ \pgfutil@in@.{#2}%
+ \ifpgfutil@in@
+ \expandafter\forest@tikz@parse@node@checkiftikzname@withdot
+ \else%
+ \expandafter\forest@tikz@parse@node@checkiftikzname@withoutdot
+ \fi%
+ #1(#2)\forest@end
+}
+\def\forest@tikz@parse@node@checkiftikzname@withdot#1(#2.#3)\forest@end{%
+ \forest@tikz@parse@node@checkiftikzname#1{#2}{.#3}}
+\def\forest@tikz@parse@node@checkiftikzname@withoutdot#1(#2)\forest@end{%
+ \forest@tikz@parse@node@checkiftikzname#1{#2}{}}
+\def\forest@tikz@parse@node@checkiftikzname#1#2#3{%
+ \expandafter\ifx\csname pgf@sh@ns@#2\endcsname\relax
+ \forest@forthis{%
+ \forest@nameandgo{#2}%
+ \ifnum\forest@cn=0 \forest@cs@invalidnodeerror\fi
+ \edef\forest@temp@relativenodename{\forestove{name}}%
+ }%
+ \else
+ \def\forest@temp@relativenodename{#2}%
+ \fi
+ \expandafter\forest@original@tikz@parse@node\expandafter#1\expandafter(\forest@temp@relativenodename#3)%
+}
+\def\forest@nameandgo#1{%
+ \pgfutil@in@!{#1}%
+ \ifpgfutil@in@
+ \forest@nameandgo@(#1)%
+ \else
+ \ifstrempty{#1}{}{\edef\forest@cn{\forest@node@Nametoid{#1}}}%
+ \fi
+}
+\def\forest@nameandgo@(#1!#2){%
+ \ifstrempty{#1}{}{\edef\forest@cn{\forest@node@Nametoid{#1}}}%
+ \forest@go{#2}%
+}
+% \end{macrocode}
+%
+% \subsection{Anchors}
+% \label{sec:anchors}
+%
+% \FoRest; anchors are |(child/parent)_anchor| and growth anchors |parent/children_first/last|. The following code resolves them into \TikZ; anchors, based on the value of option |(child/parent)_anchor| and values of |grow| and |reversed|.
+%
+% We need to access |rotate| for the anchors below to work in general.
+% \begin{macrocode}
+\forestset{
+ declare count={rotate}{0},
+ autoforward'={rotate}{node options},
+}
+% \end{macrocode}
+% Variants of |parent/children_first/last| without |'| snap border anchors to the closest compass direction.
+% \begin{macrocode}
+\newif\ifforest@anchor@snapbordertocompass
+% \end{macrocode}
+% The code is used both in generic anchors (then, the result should be forwarded to \TikZ; for evaluation into coordinates) and in the UI macro |\forestanchortotikzanchor|.
+% \begin{macrocode}
+\newif\ifforest@anchor@forwardtotikz
+% \end{macrocode}
+% Growth-based anchors set this to true to signal that the result is a border anchor.
+% \begin{macrocode}
+\newif\ifforest@anchor@isborder
+% \end{macrocode}
+% The UI macro.
+% \begin{macrocode}
+\def\forestanchortotikzanchor#1#2{% #1 = forest anchor, #2 = macro to receive the tikz anchor
+ \forest@anchor@forwardtotikzfalse
+ \forest@anchor@do{}{#1}{\forest@cn}%
+ \let#2\forest@temp@anchor
+}
+% \end{macrocode}
+% Generic anchors.
+% \begin{macrocode}
+\pgfdeclaregenericanchor{child anchor}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{child anchor}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{parent anchor}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{parent anchor}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{anchor}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{anchor}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{children}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{children}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{-children}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{-children}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{children first}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{children first}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{-children first}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{-children first}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{first}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{first}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{parent first}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{parent first}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{-parent first}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{-parent first}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{parent}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{parent}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{-parent}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{-parent}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{parent last}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{parent last}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{-parent last}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{-parent last}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{last}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{last}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{children last}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{children last}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{-children last}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{-children last}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{children'}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{children'}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{-children'}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{-children'}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{children first'}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{children first'}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{-children first'}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{-children first'}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{first'}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{first'}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{parent first'}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{parent first'}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{-parent first'}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{-parent first'}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{parent'}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{parent'}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{-parent'}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{-parent'}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{parent last'}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{parent last'}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{-parent last'}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{-parent last'}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{last'}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{last'}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{children last'}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{children last'}{\forest@referencednodeid}%
+}
+\pgfdeclaregenericanchor{-children last'}{%
+ \forest@anchor@forwardtotikztrue
+ \forest@anchor@do{#1}{-children last'}{\forest@referencednodeid}%
+}
+% \end{macrocode}
+% The driver. The result is being passed around in |\forest@temp@anchor|.
+% \begin{macrocode}
+\def\forest@anchor@do#1#2#3{% #1 = shape name, #2 = (potentially) forest anchor, #3 = node id
+ \forest@fornode{#3}{%
+ \def\forest@temp@anchor{#2}%
+ \forest@anchor@snapbordertocompassfalse
+ \forest@anchor@isborderfalse
+ \forest@anchor@to@tikz@anchor
+ \forest@anchor@border@to@compass
+ \ifforest@anchor@forwardtotikz
+ \forest@anchor@forward{#1}%
+ \else
+ \fi
+ }%
+}
+% \end{macrocode}
+% This macro will loop (resolving the anchor) until the result is not a \FoRest; macro.
+% \begin{macrocode}
+\def\forest@anchor@to@tikz@anchor{%
+ \ifcsdef{forest@anchor@@\forest@temp@anchor}{%
+ \csuse{forest@anchor@@\forest@temp@anchor}%
+ \forest@anchor@to@tikz@anchor
+ }{}%
+}
+% \end{macrocode}
+% Actual computation.
+% \begin{macrocode}
+\csdef{forest@anchor@@parent anchor}{%
+ \forestoget{parent anchor}\forest@temp@anchor}
+\csdef{forest@anchor@@child anchor}{%
+ \forestoget{child anchor}\forest@temp@anchor}
+\csdef{forest@anchor@@anchor}{%
+ \forestoget{anchor}\forest@temp@anchor}
+\csdef{forest@anchor@@children'}{%
+ \forest@anchor@isbordertrue
+ \edef\forest@temp@anchor{\number\numexpr\forestove{grow}-\forestove{rotate}}%
+}
+\csdef{forest@anchor@@-children'}{%
+ \forest@anchor@isbordertrue
+ \edef\forest@temp@anchor{\number\numexpr 180+\forestove{grow}-\forestove{rotate}}%
+}
+\csdef{forest@anchor@@parent'}{%
+ \forest@anchor@isbordertrue
+ \edef\forest@temp@grow{\ifnum\forestove{@parent}=0 \forestove{grow}\else\forestOve{\forestove{@parent}}{grow}\fi}%
+ \edef\forest@temp@anchor{\number\numexpr\forest@temp@grow-\forestove{rotate}+180}%
+}
+\csdef{forest@anchor@@-parent'}{%
+ \forest@anchor@isbordertrue
+ \edef\forest@temp@grow{\ifnum\forestove{@parent}=0 \forestove{grow}\else\forestOve{\forestove{@parent}}{grow}\fi}%
+ \edef\forest@temp@anchor{\number\numexpr\forest@temp@grow-\forestove{rotate}}%
+}
+\csdef{forest@anchor@@first'}{%
+ \forest@anchor@isbordertrue
+ \edef\forest@temp@anchor{\number\numexpr\forestove{grow}-\forestove{rotate}\ifnum\forestove{reversed}=0 -\else+\fi90}%
+}
+\csdef{forest@anchor@@last'}{%
+ \forest@anchor@isbordertrue
+ \edef\forest@temp@anchor{\number\numexpr\forestove{grow}-\forestove{rotate}\ifnum\forestove{reversed}=0 +\else-\fi90}%
+}
+\csdef{forest@anchor@@parent first'}{%
+ \forest@anchor@isbordertrue
+ \edef\forest@temp@grow{\ifnum\forestove{@parent}=0 \forestove{grow}\else\forestOve{\forestove{@parent}}{grow}\fi}%
+ \edef\forest@temp@reversed{\ifnum\forestove{@parent}=0 \forestove{reversed}\else\forestOve{\forestove{@parent}}{reversed}\fi}%
+ \edef\forest@temp@anchor@parent{\number\numexpr\forest@temp@grow-\forestove{rotate}+180}%
+ \edef\forest@temp@anchor@first{\number\numexpr\forest@temp@grow-\forestove{rotate}\ifnum\forest@temp@reversed=0 -\else+\fi90}%
+ \forest@getaverageangle{\forest@temp@anchor@parent}{\forest@temp@anchor@first}\forest@temp@anchor
+}
+\csdef{forest@anchor@@-parent first'}{%
+ \forest@anchor@isbordertrue
+ \edef\forest@temp@grow{\ifnum\forestove{@parent}=0 \forestove{grow}\else\forestOve{\forestove{@parent}}{grow}\fi}%
+ \edef\forest@temp@reversed{\ifnum\forestove{@parent}=0 \forestove{reversed}\else\forestOve{\forestove{@parent}}{reversed}\fi}%
+ \edef\forest@temp@anchor@parent{\number\numexpr\forest@temp@grow-\forestove{rotate}}%
+ \edef\forest@temp@anchor@first{\number\numexpr\forest@temp@grow-\forestove{rotate}\ifnum\forest@temp@reversed=0 -\else+\fi90}%
+ \forest@getaverageangle{\forest@temp@anchor@parent}{\forest@temp@anchor@first}\forest@temp@anchor
+}
+\csdef{forest@anchor@@parent last'}{%
+ \forest@anchor@isbordertrue
+ \edef\forest@temp@grow{\ifnum\forestove{@parent}=0 \forestove{grow}\else\forestOve{\forestove{@parent}}{grow}\fi}%
+ \edef\forest@temp@reversed{\ifnum\forestove{@parent}=0 \forestove{reversed}\else\forestOve{\forestove{@parent}}{reversed}\fi}%
+ \edef\forest@temp@anchor@parent{\number\numexpr\forest@temp@grow-\forestove{rotate}+180}%
+ \edef\forest@temp@anchor@last{\number\numexpr\forest@temp@grow-\forestove{rotate}\ifnum\forest@temp@reversed=0 +\else-\fi90}%
+ \forest@getaverageangle{\forest@temp@anchor@parent}{\forest@temp@anchor@last}\forest@temp@anchor
+}
+\csdef{forest@anchor@@-parent last'}{%
+ \forest@anchor@isbordertrue
+ \edef\forest@temp@grow{\ifnum\forestove{@parent}=0 \forestove{grow}\else\forestOve{\forestove{@parent}}{grow}\fi}%
+ \edef\forest@temp@reversed{\ifnum\forestove{@parent}=0 \forestove{reversed}\else\forestOve{\forestove{@parent}}{reversed}\fi}%
+ \edef\forest@temp@anchor@parent{\number\numexpr\forest@temp@grow-\forestove{rotate}}%
+ \edef\forest@temp@anchor@last{\number\numexpr\forest@temp@grow-\forestove{rotate}\ifnum\forest@temp@reversed=0 +\else-\fi90}%
+ \forest@getaverageangle{\forest@temp@anchor@parent}{\forest@temp@anchor@last}\forest@temp@anchor
+}
+\csdef{forest@anchor@@children first'}{%
+ \forest@anchor@isbordertrue
+ \edef\forest@temp@anchor@first{\number\numexpr\forestove{grow}-\forestove{rotate}\ifnum\forestove{reversed}=0 -\else+\fi90}%
+ \forest@getaverageangle{\forestove{grow}-\forestove{rotate}}{\forest@temp@anchor@first}\forest@temp@anchor
+}
+\csdef{forest@anchor@@-children first'}{%
+ \forest@anchor@isbordertrue
+ \edef\forest@temp@anchor@first{\number\numexpr\forestove{grow}-\forestove{rotate}\ifnum\forestove{reversed}=0 -\else+\fi90}%
+ \forest@getaverageangle{180+\forestove{grow}-\forestove{rotate}}{\forest@temp@anchor@first}\forest@temp@anchor
+}
+\csdef{forest@anchor@@children last'}{%
+ \forest@anchor@isbordertrue
+ \edef\forest@temp@anchor@last{\number\numexpr\forestove{grow}-\forestove{rotate}\ifnum\forestove{reversed}=0 +\else-\fi90}%
+ \forest@getaverageangle{\forestove{grow}-\forestove{rotate}}{\forest@temp@anchor@last}\forest@temp@anchor
+}
+\csdef{forest@anchor@@-children last'}{%
+ \forest@anchor@isbordertrue
+ \edef\forest@temp@anchor@last{\number\numexpr\forestove{grow}-\forestove{rotate}\ifnum\forestove{reversed}=0 +\else-\fi90}%
+ \forest@getaverageangle{180+\forestove{grow}-\forestove{rotate}}{\forest@temp@anchor@last}\forest@temp@anchor
+}
+\csdef{forest@anchor@@children}{%
+ \forest@anchor@snapbordertocompasstrue
+ \csuse{forest@anchor@@children'}%
+}
+\csdef{forest@anchor@@-children}{%
+ \forest@anchor@snapbordertocompasstrue
+ \csuse{forest@anchor@@-children'}%
+}
+\csdef{forest@anchor@@parent}{%
+ \forest@anchor@snapbordertocompasstrue
+ \csuse{forest@anchor@@parent'}%
+}
+\csdef{forest@anchor@@-parent}{%
+ \forest@anchor@snapbordertocompasstrue
+ \csuse{forest@anchor@@-parent'}%
+}
+\csdef{forest@anchor@@first}{%
+ \forest@anchor@snapbordertocompasstrue
+ \csuse{forest@anchor@@first'}%
+}
+\csdef{forest@anchor@@last}{%
+ \forest@anchor@snapbordertocompasstrue
+ \csuse{forest@anchor@@last'}%
+}
+\csdef{forest@anchor@@parent first}{%
+ \forest@anchor@snapbordertocompasstrue
+ \csuse{forest@anchor@@parent first'}%
+}
+\csdef{forest@anchor@@-parent first}{%
+ \forest@anchor@snapbordertocompasstrue
+ \csuse{forest@anchor@@-parent first'}%
+}
+\csdef{forest@anchor@@parent last}{%
+ \forest@anchor@snapbordertocompasstrue
+ \csuse{forest@anchor@@parent last'}%
+}
+\csdef{forest@anchor@@-parent last}{%
+ \forest@anchor@snapbordertocompasstrue
+ \csuse{forest@anchor@@-parent last'}%
+}
+\csdef{forest@anchor@@children first}{%
+ \forest@anchor@snapbordertocompasstrue
+ \csuse{forest@anchor@@children first'}%
+}
+\csdef{forest@anchor@@-children first}{%
+ \forest@anchor@snapbordertocompasstrue
+ \csuse{forest@anchor@@-children first'}%
+}
+\csdef{forest@anchor@@children last}{%
+ \forest@anchor@snapbordertocompasstrue
+ \csuse{forest@anchor@@children last'}%
+}
+\csdef{forest@anchor@@-children last}{%
+ \forest@anchor@snapbordertocompasstrue
+ \csuse{forest@anchor@@-children last'}%
+}
+% \end{macrocode}
+% This macro computes the "average" angle of |#1| and |#2| and stores in into |#3|.
+% The angle computed is the geometrically "closer" one. The formula is
+% adapted from \url{http://stackoverflow.com/a/1159336/624872}.
+% \begin{macrocode}
+\def\forest@getaverageangle#1#2#3{%
+ \edef\forest@temp{\number\numexpr #1-#2+540}%
+ \expandafter\pgfmathMod@\expandafter{\forest@temp}{360}%
+ \forest@truncatepgfmathresult
+ \edef\forest@temp{\number\numexpr 360+#2+((\pgfmathresult-180)/2)}%
+ \expandafter\pgfmathMod@\expandafter{\forest@temp}{360}%
+ \forest@truncatepgfmathresult
+ \let#3\pgfmathresult
+}
+\def\forest@truncatepgfmathresult{%
+ \afterassignment\forest@gobbletoEND
+ \forest@temp@count=\pgfmathresult\forest@END
+ \def\pgfmathresult{\the\forest@temp@count}%
+}
+\def\forest@gobbletoEND#1\forest@END{}
+% \end{macrocode}
+% The first macro changes border anchor to compass anchor. The second one does this only if the node shape allows it.
+% \begin{macrocode}
+\def\forest@anchor@border@to@compass{%
+ \ifforest@anchor@isborder % snap to 45 deg, to range 0-360
+ \ifforest@anchor@snapbordertocompass
+ \forest@anchor@snap@border@to@compass
+ \else % to range 0-360
+ \pgfmathMod@{\forest@temp@anchor}{360}%
+ \forest@truncatepgfmathresult
+ \let\forest@temp@anchor\pgfmathresult
+ \fi
+ \ifforest@anchor@snapbordertocompass
+ \ifforest@anchor@forwardtotikz
+ \ifcsname pgf@anchor%
+ @\csname pgf@sh@ns@\pgfreferencednodename\endcsname
+ @\csname forest@compass@\forest@temp@anchor\endcsname
+ \endcsname
+ \letcs\forest@temp@anchor{forest@compass@\forest@temp@anchor}%
+ \fi
+ \else
+ \letcs\forest@temp@anchor{forest@compass@\forest@temp@anchor}%
+ \fi
+ \fi
+ \fi
+}
+\csdef{forest@compass@0}{east}
+\csdef{forest@compass@45}{north east}
+\csdef{forest@compass@90}{north}
+\csdef{forest@compass@135}{north west}
+\csdef{forest@compass@180}{west}
+\csdef{forest@compass@225}{south west}
+\csdef{forest@compass@270}{south}
+\csdef{forest@compass@315}{south east}
+\csdef{forest@compass@360}{east}
+% \end{macrocode}
+% This macro approximates an angle (stored in |\forest@temp@anchor|) with a compass direction (stores it in the same macro).
+% \begin{macrocode}
+\def\forest@anchor@snap@border@to@compass{%
+ \pgfmathMod@{\forest@temp@anchor}{360}%
+ \pgfmathdivide@{\pgfmathresult}{45}%
+ \pgfmathround@{\pgfmathresult}%
+ \pgfmathmultiply@{\pgfmathresult}{45}%
+ \forest@truncatepgfmathresult
+ \let\forest@temp@anchor\pgfmathresult
+}
+% \end{macrocode}
+% This macro forwards the resulting anchor to \TikZ;.
+% \begin{macrocode}
+\def\forest@anchor@forward#1{% #1 = shape name
+ \ifdefempty\forest@temp@anchor{%
+ \pgf@sh@reanchor{#1}{center}%
+ \xdef\forest@hack@tikzshapeborder{%
+ \noexpand\tikz@shapebordertrue
+ \def\noexpand\tikz@shapeborder@name{\pgfreferencednodename}%
+ }\aftergroup\forest@hack@tikzshapeborder
+ }{%
+ \pgf@sh@reanchor{#1}{\forest@temp@anchor}%
+ }%
+}
+% \end{macrocode}
+%
+% Expandably strip "not yet positionedPGFINTERNAL" from |\pgfreferencednodename| if it is there.
+% \begin{macrocode}
+\def\forest@referencednodeid{\forest@node@Nametoid{\forest@referencednodename}}%
+\def\forest@referencednodename{%
+ \expandafter\expandafter\expandafter\forest@referencednodename@\expandafter\pgfreferencednodename\forest@pgf@notyetpositioned\relax
+}
+\expandafter\def\expandafter\forest@referencednodename@\expandafter#\expandafter1\forest@pgf@notyetpositioned#2\relax{%
+ \if\relax#1\relax\forest@referencednodename@stripafter#2\relax\fi
+ \if\relax#2\relax#1\fi
+}
+\expandafter\def\expandafter\forest@referencednodename@stripafter\expandafter#\expandafter1\forest@pgf@notyetpositioned\relax{#1}
+% \end{macrocode}
+%
+% This macro sets up |\pgf@x| and |\pgf@y| to the given anchor's coordinates, within the node's coordinate system. It works even before the node was positioned. If the anchor is empty, i.e.\ if is the implicit border anchor, we return the coordinates for the center.
+% \begin{macrocode}
+\def\forest@pointanchor#1{% #1 = anchor
+ \forest@Pointanchor{\forest@cn}{#1}%
+}
+\def\forest@Pointanchor#1#2{% #1 = node id, #2 = anchor
+ \def\forest@pa@temp@name{name}%
+ \forestOifdefined{#1}{@box}{%
+ \forestOget{#1}{@box}\forest@temp
+ \ifdefempty\forest@temp{}{%
+ \def\forest@pa@temp@name{later@name}%
+ }%
+ }{}%
+ \setbox0\hbox{%
+ \begin{pgfpicture}%
+ \if\relax\forestOve{#1}{#2}\relax
+ \pgfpointanchor{\forestOve{#1}{\forest@pa@temp@name}}{center}%
+ \else
+ \pgfpointanchor{\forestOve{#1}{\forest@pa@temp@name}}{\forestOve{#1}{#2}}%
+ \fi
+ \xdef\forest@global@marshal{%
+ \noexpand\global\noexpand\pgf@x=\the\pgf@x\relax
+ \noexpand\global\noexpand\pgf@y=\the\pgf@y\relax\relax
+ }%
+ \end{pgfpicture}%
+ }%
+ \forest@global@marshal
+}
+% \end{macrocode}
+% Fill in the values of the invalid node. (It's now easy to test for |id=0|.)
+% \begin{macrocode}
+\forest@node@init
+% \end{macrocode}
+% \section{Compatibility with previous versions}
+% \begin{macrocode}
+\ifdefempty{\forest@compat}{}{%
+ \RequirePackage{forest-compat}
+}
+% \end{macrocode}
+%
+% \endinput
+%
+% Local Variables:
+% mode: doctex
+% fill-column: 100
+% TeX-command-default: "sty"
+% TeX-master: t
+% End:
diff --git a/graphics/pgf/contrib/forest/forest.ins b/graphics/pgf/contrib/forest/forest.ins
new file mode 100644
index 0000000000..4bbad239b9
--- /dev/null
+++ b/graphics/pgf/contrib/forest/forest.ins
@@ -0,0 +1,28 @@
+%% forest.ins
+%%
+%% Copyright (c) 2012-2017 Saso Zivanovic
+%% saso.zivanovic@guest.arnes.si
+%%
+%% This work may be distributed and/or modified under the
+%% conditions of the LaTeX Project Public License, either version 1.3
+%% of this license or (at your option) any later version.
+%% The latest version of this license is in
+%%
+%% http://www.latex-project.org/lppl.txt
+%%
+%% and version 1.3 or later is part of all distributions of LaTeX
+%% version 2005/12/01 or later.
+%%
+%% This file is a part of package `forest'. For the list of files
+%% constituting the package see main source file of the package,
+%% `forest.dtx', or the derived `forest.sty'.
+%%
+\input docstrip.tex
+\keepsilent
+\preamble
+\endpreamble
+\askforoverwritefalse
+\generate{\file{forest.sty}{\from{forest.dtx}{}}}
+\generate{\file{forest-lib-linguistics.sty}{\from{forest-libs.dtx}{linguistics}}}
+\generate{\file{forest-lib-edges.sty}{\from{forest-libs.dtx}{edges}}}
+\endbatchfile
diff --git a/graphics/pgf/contrib/forest/forest.pdf b/graphics/pgf/contrib/forest/forest.pdf
new file mode 100644
index 0000000000..34a1a3df39
--- /dev/null
+++ b/graphics/pgf/contrib/forest/forest.pdf
Binary files differ
diff --git a/graphics/pgf/contrib/forest/tex.bib b/graphics/pgf/contrib/forest/tex.bib
new file mode 100644
index 0000000000..0f0b8795c7
--- /dev/null
+++ b/graphics/pgf/contrib/forest/tex.bib
@@ -0,0 +1,20 @@
+@Manual{tikzpgf2.10,
+ title = {TikZ \& PGF, Manual for Version 2.10},
+ author = {Till Tantau},
+ year = 2007,
+ url = {http://sourceforge.net/projects/pgf}
+}
+
+@book{texbook,
+ author = "Donald E. Knuth",
+ title = "The {TeX}book",
+ publisher = "Addison-Wesley",
+ year = 1996,
+}
+
+@Manual{tikzpgf3.0.0,
+ title = {TikZ \& PGF, Manual for Version 3.0.0},
+ author = {Till Tantau},
+ year = 2013,
+ url = {http://sourceforge.net/projects/pgf}
+}