System error
error:  Error in tempdir() using /tmp/jbovlaste_export/XXXXXXXXXX: Parent directory (/tmp/jbovlaste_export) does not exist at /srv/jbovlaste/current/lib/SimpleLaTeX.pm line 60. 

context: 


code stack: 
/usr/share/perl5/vendor_perl/Carp.pm:291 /usr/share/perl5/vendor_perl/File/Temp.pm:1704 /srv/jbovlaste/current/lib/SimpleLaTeX.pm:60 /srv/jbovlaste/current/lib/Wiki.pm:432 /srv/jbovlaste/current/dict/dhandler:317 /srv/jbovlaste/current/autohandler:4 
Error in tempdir() using /tmp/jbovlaste_export/XXXXXXXXXX: Parent directory (/tmp/jbovlaste_export) does not exist at /srv/jbovlaste/current/lib/SimpleLaTeX.pm line 60. Trace begun at /usr/share/perl5/vendor_perl/HTML/Mason/Exceptions.pm line 125 HTML::Mason::Exceptions::rethrow_exception('Error in tempdir() using /tmp/jbovlaste_export/XXXXXXXXXX: Parent directory (/tmp/jbovlaste_export) does not exist at /srv/jbovlaste/current/lib/SimpleLaTeX.pm line 60.^J') called at /usr/share/perl5/vendor_perl/Carp.pm line 291 Carp::croak('Error in tempdir() using /tmp/jbovlaste_export/XXXXXXXXXX: Parent directory (/tmp/jbovlaste_export) does not exist') called at /usr/share/perl5/vendor_perl/File/Temp.pm line 1704 File::Temp::tempdir('DIR', '/tmp/jbovlaste_export/', 'CLEANUP', 1) called at /srv/jbovlaste/current/lib/SimpleLaTeX.pm line 60 SimpleLaTeX::interpret('Such a graph is the essence of a biological family tree along (for example) the matrilineal line if one selects a special individual, reduces all other individuals in the tree according to their relation to the first while ignoring gender (so, the various other branches are folded along the ancestral line of the selected individual, which is taken to be the stem, and all overlapping nodes are made equivalent; in other words, all nonancestral or nonself nodes of the selected indivodual, are contracted via siblinghood (all siblings are counted the same) at the leaves and then similar contractions sequentially occur up the tree); in other words, all nonself siblings are the same, all nonself parents are the same, all nonself ith cousins jtimes removed are the same (for each i and j), all aunts and uncles are the same, all kthgreatgrandparents are the same (for each k>1), all nonself children are the same, all lthgreatgrandchildren are the same (for each l>1), etc. A quipyew tree graph (terminology invented by .krtisfranks.) is defined as follows: Define an ordered relation R on a collection of points (which will become $x_3$) such that R is ordered, nonreflexive for any point, nonsymmetric for any pair of points, nontransitive for any pair of ordered pairs of points (this requirement is guaranteed by the next condition), and generates a tree on the nodes (with the edges being ordered pairs of points which satisfy R). For any treegenerating ordered relation S: if x S y, then x is a parent of y and y is a child of x; if x S y and y S z, then x is an ancestor of z and z is a descendant of x; "x is a nonself parent of y" means that x S y and $x \neq y$, and likewise for the other relations just described when modified by the descriptor "nonself". A quipyew tree T is a directed tree graph generated by the reflexive closure of R, such that T is totally connected (in the symmetric closure of R), every node in the vertex set ($x_3$) of T has at most two nonself children and at most one nonself parent, and there exists exactly one special node $x_2$ (usually denoted "0") in the vertex set of T with the property that for any node n in the vertex set of T, n has two nonself children only if (but not necessarily if) n is a strict ancestor of $x_2$ according to the transitive closure of R. See also: {grafmseljimca}, {tseingu}, {takni}.') called at /srv/jbovlaste/current/lib/Wiki.pm line 432 Wiki::mini('Such a graph is the essence of a biological family tree along (for example) the matrilineal line if one selects a special individual, reduces all other individuals in the tree according to their relation to the first while ignoring gender (so, the various other branches are folded along the ancestral line of the selected individual, which is taken to be the stem, and all overlapping nodes are made equivalent; in other words, all nonancestral or nonself nodes of the selected indivodual, are contracted via siblinghood (all siblings are counted the same) at the leaves and then similar contractions sequentially occur up the tree); in other words, all nonself siblings are the same, all nonself parents are the same, all nonself ith cousins jtimes removed are the same (for each i and j), all aunts and uncles are the same, all kthgreatgrandparents are the same (for each k>1), all nonself children are the same, all lthgreatgrandchildren are the same (for each l>1), etc. A quipyew tree graph (terminology invented by .krtisfranks.) is defined as follows: Define an ordered relation R on a collection of points (which will become $x_3$) such that R is ordered, nonreflexive for any point, nonsymmetric for any pair of points, nontransitive for any pair of ordered pairs of points (this requirement is guaranteed by the next condition), and generates a tree on the nodes (with the edges being ordered pairs of points which satisfy R). For any treegenerating ordered relation S: if x S y, then x is a parent of y and y is a child of x; if x S y and y S z, then x is an ancestor of z and z is a descendant of x; "x is a nonself parent of y" means that x S y and $x \neq y$, and likewise for the other relations just described when modified by the descriptor "nonself". A quipyew tree T is a directed tree graph generated by the reflexive closure of R, such that T is totally connected (in the symmetric closure of R), every node in the vertex set ($x_3$) of T has at most two nonself children and at most one nonself parent, and there exists exactly one special node $x_2$ (usually denoted "0") in the vertex set of T with the property that for any node n in the vertex set of T, n has two nonself children only if (but not necessarily if) n is a strict ancestor of $x_2$ according to the transitive closure of R. See also: {grafmseljimca}, {tseingu}, {takni}.', 'en') called at /srv/jbovlaste/current/dict/dhandler line 317 HTML::Mason::Commands::__ANON__ at /usr/share/perl5/vendor_perl/HTML/Mason/Component.pm line 135 HTML::Mason::Component::run('HTML::Mason::Component::FileBased=HASH(0x7f0d58c758f8)') called at /usr/share/perl5/vendor_perl/HTML/Mason/Request.pm line 1302 eval {...} at /usr/share/perl5/vendor_perl/HTML/Mason/Request.pm line 1292 HTML::Mason::Request::comp(undef, undef, undef) called at /usr/share/perl5/vendor_perl/HTML/Mason/Request.pm line 1355 HTML::Mason::Request::scomp('HTML::Mason::Request::ApacheHandler=HASH(0x7f0d58c91b88)', 'HTML::Mason::Component::FileBased=HASH(0x7f0d58c758f8)') called at /srv/jbovlaste/current/autohandler line 4 HTML::Mason::Commands::__ANON__ at /usr/share/perl5/vendor_perl/HTML/Mason/Component.pm line 135 HTML::Mason::Component::run('HTML::Mason::Component::FileBased=HASH(0x7f0d58c91528)') called at /usr/share/perl5/vendor_perl/HTML/Mason/Request.pm line 1300 eval {...} at /usr/share/perl5/vendor_perl/HTML/Mason/Request.pm line 1292 HTML::Mason::Request::comp(undef, undef, undef) called at /usr/share/perl5/vendor_perl/HTML/Mason/Request.pm line 481 eval {...} at /usr/share/perl5/vendor_perl/HTML/Mason/Request.pm line 481 eval {...} at /usr/share/perl5/vendor_perl/HTML/Mason/Request.pm line 433 HTML::Mason::Request::exec('HTML::Mason::Request::ApacheHandler=HASH(0x7f0d58c91b88)') called at /usr/share/perl5/vendor_perl/HTML/Mason/ApacheHandler.pm line 168 HTML::Mason::Request::ApacheHandler::exec('HTML::Mason::Request::ApacheHandler=HASH(0x7f0d58c91b88)') called at /usr/share/perl5/vendor_perl/HTML/Mason/ApacheHandler.pm line 825 HTML::Mason::ApacheHandler::handle_request('HTML::Mason::ApacheHandler=HASH(0x7f0d5800d4c8)', 'Apache2::RequestRec=SCALAR(0x7f0d4c06ebf8)') called at (eval 28) line 8 HTML::Mason::ApacheHandler::handler('HTML::Mason::ApacheHandler', 'Apache2::RequestRec=SCALAR(0x7f0d4c06ebf8)') called at e line 0 eval {...} at e line 0