# Tag Info

3

The problem is that \gla splits its input at spaces before doing expansions. However, no number of \expandafter's can solve the problem, because TeX can't know where \exnull will appear. You can fully expand the line before the scanning for spaces happens, but this can have adverse effects: beware and remember to add \protect when necessary. ...

1

If I understand what do you need, you want to spare macro space and type only: \setsmartgreek \alpha\beta\gamma\delta\epsilon \relax instead to re-defining \alpha, then \beta, then \gamma etc. You can try this: \def\setsmartgreek{% \expandafter\ifx\csname deltaup\endcsname\relax \else \def\stgreekC##1##2;{##2up}\fi \expandafter\ifx\csname ...

1

The simplest way is using expl3 (fill in the missing names): \documentclass{article} \usepackage{amsmath} \usepackage{pxfonts} \usepackage{siunitx} %\usepackage{isomath} %\usepackage{upgreek} \usepackage[ISO]{pxgreeks} \usepackage{expl3} \ExplSyntaxOn \cs_if_exist:NTF \alphaup { \cs_new:Nn \thewaywewalk_greek:n { \int_compare:nTF { \fam = 0 } { ...

1

Here is a possibility. A bit painful, but now done. Notice that the code assumes the Greek letters have been set-up to be italic, nothing breaks if not, but defined macros \alphait, \Gammait will then not do what their names indicate. \documentclass{article} \usepackage[utf8x]{luainputenc} \usepackage[T1]{fontenc} \usepackage{pxfonts} \usepackage{siunitx} ...

2

Using lambda.sty (for fun) The lambda.sty package define fully expandables conditionnals and lists. In a similar way, the following macros define binary trees and a \BSTSort macro which can tree-sort a lambda list. It is not exactly quicksort, but is very similar. \documentclass{article} \usepackage{lambda} \makeatletter % Tree Data type (Similar to ...

Top 50 recent answers are included