User-Agent: Mozilla/5.0 (Windows; U; Windows NT 6.1; en-GB; rv:1.9.2.8)
            Gecko/20100802 Thunderbird/3.1.2
MIME-Version: 1.0
References: <4C967C9B.5010706@gmx.de>                                 
            <71ED7A5B-DE11-45D9-9785-95A1DC795080@gmail.com>                   
            <4C9724B4.3010301@residenset.net>                                 
            <AA223041-D9B8-4EE4-BF8A-5782FAC2078A@gmail.com>                   
            <D6A512C4-5F40-4178-A72F-0D0612DC9A14@gmail.com>                   
            <19607.26705.947540.499705@morse.mittelbach-online.de>             
            <D8A49385-C6F5-4601-97B5-EC2E0501BEF8@gmail.com>                   
            <4C9840AB.4050805@gmx.de>           
            <732A7500-5414-4818-87E3-33CB14463288@gmail.com>
            <4C98435A.1050507@gmx.de>
Content-Type: text/plain; charset=windows-1252; format=flowed
Content-Transfer-Encoding: 7bit
Message-ID:  <4C989ACB.5060000@morningstar2.co.uk>
Date:         Tue, 21 Sep 2010 12:45:15 +0100
Reply-To: Mailing list for the LaTeX3 project
              <LATEX-L@listserv.uni-heidelberg.de>
Sender: Mailing list for the LaTeX3 project <LATEX-L@listserv.uni-heidelberg.de>
From: Joseph Wright <joseph.wright@MORNINGSTAR2.CO.UK>
Subject: Re: boolean expressions in ExplSyntaxNames
To: LATEX-L@listserv.uni-heidelberg.de
In-Reply-To:  <4C98435A.1050507@gmx.de>
Precedence: list
Status: R

On 21/09/2010 06:32, Arno Trautmann wrote:
>> Why not just use&&  in the first place?
>
> Because of possible catcode-troubles? ;)
> Or maybe such a list might be more useful for a xor operation.

How does the following look? The Boolean expressions are the most basic 
versions (NOT takes one argument, others take two), but nesting seems to 
work fine. There is definitely less code to this than the current 
implementation, so there would be a performance gain.

\documentclass{article}
\usepackage{expl3}
\ExplSyntaxOn
\cs_set_nopar:Npn \bool_if:nT #1 {
   \tex_ifodd:D \bool_if_p:n {#1}
     \tex_expandafter:D \use:n
   \tex_else:D
     \tex_expandafter:D \use_none:n
   \tex_fi:D
}
\cs_set_nopar:Npn \bool_if:nF #1 {
   \tex_ifodd:D \bool_if_p:n {#1}
     \tex_expandafter:D \use_none:n
   \tex_else:D
     \tex_expandafter:D \use:n
   \tex_fi:D
}
\cs_set_nopar:Npn \bool_if:nTF #1 {
   \tex_ifodd:D \bool_if_p:n {#1}
     \tex_expandafter:D \use_i:nn
   \tex_else:D
     \tex_expandafter:D \use_ii:nn
   \tex_fi:D
}
\cs_set_nopar:Npn \bool_if_p:n #1 {
   \tex_number:D #1 ~
}
\cs_set_nopar:Npn \bool_not_p:n #1 {
   \tex_ifnum:D \tex_number:D #1 = \c_true_bool
     \c_false_bool
   \tex_else:D
     \c_true_bool
   \tex_fi:D
}
\cs_set_nopar:Npn \bool_and_p:nn #1#2 {
   \tex_ifnum:D \tex_number:D #1 = \c_true_bool
     \tex_ifnum:D \tex_number:D #2 = \c_true_bool
       \c_true_bool
     \tex_else:D
       \c_false_bool
     \tex_fi:D
   \tex_else:D
     \c_false_bool
   \tex_fi:D
}
\cs_set_nopar:Npn \bool_or_p:nn #1#2 {
   \tex_ifnum:D \tex_number:D #1 = \c_true_bool
     \c_true_bool
   \tex_else:D
     \tex_ifnum:D \tex_number:D #2 = \c_true_bool
       \c_true_bool
     \tex_else:D
       \c_false_bool
     \tex_fi:D
   \tex_fi:D
}
\cs_set_nopar:Npn \bool_xor_p:nn #1#2 {
   \tex_ifnum:D \tex_number:D #1 = \c_true_bool
     \tex_ifnum:D \tex_number:D #2 = \c_true_bool
       \c_false_bool
     \tex_else:D
       \c_true_bool
     \tex_fi:D
   \tex_else:D
     \tex_ifnum:D \tex_number:D #2 = \c_true_bool
       \c_false_bool
     \tex_else:D
       \c_true_bool
     \tex_fi:D
   \tex_fi:D
}
\ExplSyntaxOff
\begin{document}

\ExplSyntaxOn

\bool_if:nTF { \c_true_bool } { TRUE } { FALSE } ~
\bool_if:nTF { \bool_not_p:n { \c_true_bool } } { TRUE } { FALSE } ~
\bool_if:nTF
   {
    \bool_and_p:nn { \c_true_bool }
    {
      \bool_not_p:n { \bool_or_p:nn { \c_true_bool } { \c_false_bool } }
    }
   } { TRUE } { FALSE } ~

\bool_if:nTF
   {
    \bool_and_p:nn { \c_true_bool }
    {
      \bool_not_p:n { \bool_or_p:nn { \c_true_bool } { \c_false_bool } }
    }
   } { TRUE } { FALSE } ~

\bool_if:nTF { % LAZY EVALUATION
  \bool_and_p:nn
    { \int_compare_p:nNn { 1 } = { 1 } }
    {
      \bool_and_p:nn
        {
           \bool_if_p:n
             {
               \bool_or_p:nn
                 { \intexpr_compare_p:nNn { 2 } = { 3 } }
                 {
                   \bool_or_p:nn
                     { \intexpr_compare_p:nNn { 4 } = { 4 } }
                     { \intexpr_compare_p:nNn { 1 } = { \ERROR } } % Skip
                 }
             }
         }
         { \int_compare_p:nNn { 2 } = { 2 } }
     }
} { TRUE } { FALSE } ~

\ExplSyntaxOff
\end{document}
-- 
Joseph Wright