Which engines can compare strings expandably? – tex.stackexchange.com 02:40 Posted by Unknown No Comments The pdfTeX engine introduces the primitive \pdfstrcmp for expandable string comparison, with the input itself fully expanded, for example \edef\foo{\detokenize{foo}} \ifnum\pdfstrcmp{\foo}{foo}=0 % ... from Hot Questions - Stack Exchange OnStackOverflow via Blogspot Share this Google Facebook Twitter More Digg Linkedin Stumbleupon Delicious Tumblr BufferApp Pocket Evernote Unknown Artikel TerkaitWho vs Whom in an relative clause? – english.stackexchange.comSymbol for red dot in a circle inside an inverted triangle – tex.stackexchange.comExample of non-"propositional" local operators on a topos? – mathoverflow.netCould a space age alien civilization exist without the invention of the wheel? – worldbuilding.stackexchange.comWhich binds first, product or factorial? – math.stackexchange.comFile Permissions – codegolf.stackexchange.com
0 Comment to "Which engines can compare strings expandably? – tex.stackexchange.com"
Post a Comment