3 * This file is part of LyX, the document processor.
4 * Licence details can be found in the file COPYING.
6 * \author Lars Gullik Bjønnes
7 * \author Jean-Marc Lasgouttes
10 * Full author contact details are available in file CREDITS.
15 #include "support/lstrings.h"
17 #include "support/convert.h"
18 #include "support/qstring_helpers.h"
19 #include "support/textutils.h"
21 #include <boost/tokenizer.hpp>
22 #include "support/lassert.h"
34 // Using this allows us to have docstring default arguments in headers
35 // without #include "support/docstring" there.
36 docstring const & empty_docstring()
42 // Using this allows us to have string default arguments in headers
43 // without #include <string>
44 string const & empty_string()
51 * Convert a QChar into a UCS4 character.
52 * This is a hack (it does only make sense for the common part of the UCS4
53 * and UTF16 encodings) and should not be used.
54 * This does only exist because of performance reasons (a real conversion
55 * using iconv is too slow on windows).
57 static inline char_type qchar_to_ucs4(QChar const & qchar)
59 LASSERT(is_utf16(static_cast<char_type>(qchar.unicode())), /**/);
60 return static_cast<char_type>(qchar.unicode());
65 * Convert a UCS4 character into a QChar.
66 * This is a hack (it does only make sense for the common part of the UCS4
67 * and UTF16 encodings) and should not be used.
68 * This does only exist because of performance reasons (a real conversion
69 * using iconv is too slow on windows).
71 static inline QChar const ucs4_to_qchar(char_type const ucs4)
73 LASSERT(is_utf16(ucs4), /**/);
74 return QChar(static_cast<unsigned short>(ucs4));
79 /// Maximum valid UCS4 code point
80 char_type const ucs4_max = 0x10ffff;
84 bool isLetterChar(char_type c)
88 // outside the UCS4 range
90 // assume that all non-utf16 characters are letters
93 return ucs4_to_qchar(c).isLetter();
97 bool isLower(char_type c)
101 return ucs4_to_qchar(c).isLower();
105 bool isAlphaASCII(char_type c)
107 return ('a' <= c && c <= 'z') || ('A' <= c && c <= 'Z');
111 bool isPrintable(char_type c)
115 // outside the UCS4 range
117 // assume that all non-utf16 characters are printable
120 return ucs4_to_qchar(c).isPrint();
124 bool isPrintableNonspace(char_type c)
128 // outside the UCS4 range
130 // assume that all non-utf16 characters are printable and
134 QChar const qc = ucs4_to_qchar(c);
135 return qc.isPrint() && !qc.isSpace();
139 bool isSpace(char_type c)
142 // assume that no non-utf16 character is a space
143 // c outside the UCS4 range is catched as well
146 QChar const qc = ucs4_to_qchar(c);
151 bool isDigit(char_type c)
154 // assume that no non-utf16 character is a digit
155 // c outside the UCS4 range is catched as well
157 return ucs4_to_qchar(c).isDigit();
161 bool isDigitASCII(char_type c)
163 return '0' <= c && c <= '9';
168 int compare_no_case(docstring const & s, docstring const & s2)
170 docstring::const_iterator p = s.begin();
171 docstring::const_iterator p2 = s2.begin();
173 while (p != s.end() && p2 != s2.end()) {
174 char_type const lc1 = lowercase(*p);
175 char_type const lc2 = lowercase(*p2);
177 return (lc1 < lc2) ? -1 : 1;
182 if (s.size() == s2.size())
184 if (s.size() < s2.size())
192 template<typename Char>
193 Char ascii_tolower(Char c) {
194 if (c >= 'A' && c <= 'Z')
195 return c - 'A' + 'a';
202 int compare_ascii_no_case(string const & s, string const & s2)
204 string::const_iterator p = s.begin();
205 string::const_iterator p2 = s2.begin();
207 while (p != s.end() && p2 != s2.end()) {
208 int const lc1 = ascii_tolower(*p);
209 int const lc2 = ascii_tolower(*p2);
211 return (lc1 < lc2) ? -1 : 1;
216 if (s.size() == s2.size())
218 if (s.size() < s2.size())
224 int compare_ascii_no_case(docstring const & s, docstring const & s2)
226 docstring::const_iterator p = s.begin();
227 docstring::const_iterator p2 = s2.begin();
229 while (p != s.end() && p2 != s2.end()) {
230 char_type const lc1 = ascii_tolower(*p);
231 char_type const lc2 = ascii_tolower(*p2);
233 return (lc1 < lc2) ? -1 : 1;
238 if (s.size() == s2.size())
240 if (s.size() < s2.size())
246 bool isStrInt(string const & str)
251 // Remove leading and trailing white space chars.
252 string const tmpstr = trim(str);
256 string::const_iterator cit = tmpstr.begin();
260 string::const_iterator end = tmpstr.end();
261 for (; cit != end; ++cit)
262 if (!isdigit((*cit)))
269 bool isStrUnsignedInt(string const & str)
274 // Remove leading and trailing white space chars.
275 string const tmpstr = trim(str);
279 string::const_iterator cit = tmpstr.begin();
280 string::const_iterator end = tmpstr.end();
281 for (; cit != end; ++cit)
282 if (!isdigit((*cit)))
289 bool isStrDbl(string const & str)
294 // Remove leading and trailing white space chars.
295 string const tmpstr = trim(str);
298 // if (tmpstr.count('.') > 1) return false;
300 string::const_iterator cit = tmpstr.begin();
301 bool found_dot = false;
304 string::const_iterator end = tmpstr.end();
305 for (; cit != end; ++cit) {
306 if (!isdigit(*cit) && *cit != '.')
318 bool hasDigit(docstring const & str)
323 docstring::const_iterator cit = str.begin();
324 docstring::const_iterator const end = str.end();
325 for (; cit != end; ++cit) {
335 static bool isHexChar(char_type c)
347 c == 'a' || c == 'A' ||
348 c == 'b' || c == 'B' ||
349 c == 'c' || c == 'C' ||
350 c == 'd' || c == 'D' ||
351 c == 'e' || c == 'E' ||
352 c == 'f' || c == 'F';
356 bool isHex(docstring const & str)
360 if (str.length() > 2 && str[0] == '0' &&
361 (str[1] == 'x' || str[1] == 'X'))
364 int const len = str.length();
366 for (; index < len; ++index) {
367 if (!isHexChar(str[index]))
374 int hexToInt(docstring const & str)
376 string s = to_ascii(str);
378 sscanf(s.c_str(), "%x", &h);
383 bool isAscii(docstring const & str)
385 int const len = str.length();
386 for (int i = 0; i < len; ++i)
393 bool isAscii(string const & str)
395 int const len = str.length();
396 for (int i = 0; i < len; ++i)
397 if (static_cast<unsigned char>(str[i]) >= 0x80)
403 char lowercase(char c)
405 LASSERT(static_cast<unsigned char>(c) < 0x80, /**/);
406 return char(tolower(c));
410 char uppercase(char c)
412 LASSERT(static_cast<unsigned char>(c) < 0x80, /**/);
413 return char(toupper(c));
417 char_type lowercase(char_type c)
420 // We don't know how to lowercase a non-utf16 char
422 return qchar_to_ucs4(ucs4_to_qchar(c).toLower());
426 char_type uppercase(char_type c)
429 // We don't know how to uppercase a non-utf16 char
431 return qchar_to_ucs4(ucs4_to_qchar(c).toUpper());
435 bool isLowerCase(char_type ch) {
436 return lowercase(ch) == ch;
440 bool isUpperCase(char_type ch) {
441 return uppercase(ch) == ch;
447 // since we cannot use tolower and toupper directly in the
448 // calls to transform yet, we use these helper clases. (Lgb)
450 struct local_lowercase {
451 char_type operator()(char_type c) const {
453 // We don't know how to lowercase a non-utf16 char
455 return qchar_to_ucs4(ucs4_to_qchar(c).toLower());
459 struct local_uppercase {
460 char_type operator()(char_type c) const {
462 // We don't know how to uppercase a non-utf16 char
464 return qchar_to_ucs4(ucs4_to_qchar(c).toUpper());
468 template<typename Char> struct local_ascii_lowercase {
469 Char operator()(Char c) const { return ascii_tolower(c); }
472 } // end of anon namespace
474 docstring const lowercase(docstring const & a)
477 transform(tmp.begin(), tmp.end(), tmp.begin(), local_lowercase());
482 docstring const uppercase(docstring const & a)
485 transform(tmp.begin(), tmp.end(), tmp.begin(), local_uppercase());
490 string const ascii_lowercase(string const & a)
493 transform(tmp.begin(), tmp.end(), tmp.begin(),
494 local_ascii_lowercase<char>());
499 docstring const ascii_lowercase(docstring const & a)
502 transform(tmp.begin(), tmp.end(), tmp.begin(),
503 local_ascii_lowercase<char_type>());
508 bool prefixIs(docstring const & a, char_type c)
516 bool prefixIs(string const & a, string const & pre)
518 size_t const prelen = pre.length();
519 size_t const alen = a.length();
520 return prelen <= alen && !a.empty() && a.compare(0, prelen, pre) == 0;
524 bool prefixIs(docstring const & a, docstring const & pre)
526 size_t const prelen = pre.length();
527 size_t const alen = a.length();
528 return prelen <= alen && !a.empty() && a.compare(0, prelen, pre) == 0;
532 bool suffixIs(string const & a, char c)
536 return a[a.length() - 1] == c;
540 bool suffixIs(docstring const & a, char_type c)
544 return a[a.length() - 1] == c;
548 bool suffixIs(string const & a, string const & suf)
550 size_t const suflen = suf.length();
551 size_t const alen = a.length();
552 return suflen <= alen && a.compare(alen - suflen, suflen, suf) == 0;
556 bool suffixIs(docstring const & a, docstring const & suf)
558 size_t const suflen = suf.length();
559 size_t const alen = a.length();
560 return suflen <= alen && a.compare(alen - suflen, suflen, suf) == 0;
564 bool containsOnly(string const & s, string const & cset)
566 return s.find_first_not_of(cset) == string::npos;
570 // ale970405+lasgoutt-970425
571 // rewritten to use new string (Lgb)
572 string const token(string const & a, char delim, int n)
580 // Find delimiter or end of string
582 if ((i = a.find(delim, i)) == string::npos)
588 // i is now the n'th delim (or string::npos)
589 if (i == string::npos)
592 k = a.find(delim, i);
593 // k is now the n'th + 1 delim (or string::npos)
595 return a.substr(i, k - i);
599 docstring const token(docstring const & a, char_type delim, int n)
607 // Find delimiter or end of string
609 if ((i = a.find(delim, i)) == docstring::npos)
615 // i is now the n'th delim (or string::npos)
616 if (i == docstring::npos)
619 k = a.find(delim, i);
620 // k is now the n'th + 1 delim (or string::npos)
622 return a.substr(i, k - i);
626 // this could probably be faster and/or cleaner, but it seems to work (JMarc)
627 // rewritten to use new string (Lgb)
628 int tokenPos(string const & a, char delim, string const & tok)
634 while (!str.empty()) {
635 str = split(str, tmptok, delim);
644 // this could probably be faster and/or cleaner, but it seems to work (JMarc)
645 // rewritten to use new string (Lgb)
646 int tokenPos(docstring const & a, char_type delim, docstring const & tok)
652 while (!str.empty()) {
653 str = split(str, tmptok, delim);
664 /// Substitute all \a oldchar with \a newchar
665 template<typename Ch> inline
666 basic_string<Ch> const subst_char(basic_string<Ch> const & a,
667 Ch oldchar, Ch newchar)
669 typedef basic_string<Ch> String;
671 typename String::iterator lit = tmp.begin();
672 typename String::iterator end = tmp.end();
673 for (; lit != end; ++lit)
674 if ((*lit) == oldchar)
680 /// Substitute all \a oldchar with \a newchar
681 docstring const subst_char(docstring const & a,
682 docstring::value_type oldchar, docstring::value_type newchar)
685 docstring::iterator lit = tmp.begin();
686 docstring::iterator end = tmp.end();
687 for (; lit != end; ++lit)
688 if ((*lit) == oldchar)
694 /// substitutes all instances of \a oldstr with \a newstr
695 template<typename String> inline
696 String const subst_string(String const & a,
697 String const & oldstr, String const & newstr)
699 LASSERT(!oldstr.empty(), /**/);
702 size_t const olen = oldstr.length();
703 while ((i = lstr.find(oldstr, i)) != string::npos) {
704 lstr.replace(i, olen, newstr);
705 i += newstr.length(); // We need to be sure that we dont
706 // use the same i over and over again.
712 docstring const subst_string(docstring const & a,
713 docstring const & oldstr, docstring const & newstr)
715 LASSERT(!oldstr.empty(), /**/);
718 size_t const olen = oldstr.length();
719 while ((i = lstr.find(oldstr, i)) != string::npos) {
720 lstr.replace(i, olen, newstr);
721 i += newstr.length(); // We need to be sure that we dont
722 // use the same i over and over again.
730 string const subst(string const & a, char oldchar, char newchar)
732 return subst_char(a, oldchar, newchar);
736 docstring const subst(docstring const & a,
737 char_type oldchar, char_type newchar)
739 return subst_char(a, oldchar, newchar);
743 string const subst(string const & a,
744 string const & oldstr, string const & newstr)
746 return subst_string(a, oldstr, newstr);
750 docstring const subst(docstring const & a,
751 docstring const & oldstr, docstring const & newstr)
753 return subst_string(a, oldstr, newstr);
757 /// Count all occurences of char \a chr inside \a str
758 int count_char(docstring const & str, docstring::value_type chr)
761 docstring::const_iterator lit = str.begin();
762 docstring::const_iterator end = str.end();
763 for (; lit != end; ++lit)
770 docstring const trim(docstring const & a, char const * p)
774 if (a.empty() || !*p)
777 docstring s = from_ascii(p);
778 size_t r = a.find_last_not_of(s);
779 size_t l = a.find_first_not_of(s);
781 // Is this the minimal test? (lgb)
782 if (r == docstring::npos && l == docstring::npos)
785 return a.substr(l, r - l + 1);
789 string const trim(string const & a, char const * p)
793 if (a.empty() || !*p)
796 size_t r = a.find_last_not_of(p);
797 size_t l = a.find_first_not_of(p);
799 // Is this the minimal test? (lgb)
800 if (r == string::npos && l == string::npos)
803 return a.substr(l, r - l + 1);
807 string const rtrim(string const & a, char const * p)
811 if (a.empty() || !*p)
814 size_t r = a.find_last_not_of(p);
816 // Is this test really needed? (Lgb)
817 if (r == string::npos)
820 return a.substr(0, r + 1);
824 docstring const rtrim(docstring const & a, char const * p)
828 if (a.empty() || !*p)
831 size_t r = a.find_last_not_of(from_ascii(p));
833 // Is this test really needed? (Lgb)
834 if (r == docstring::npos)
837 return a.substr(0, r + 1);
841 string const ltrim(string const & a, char const * p)
844 if (a.empty() || !*p)
846 size_t l = a.find_first_not_of(p);
847 if (l == string::npos)
849 return a.substr(l, string::npos);
853 docstring const ltrim(docstring const & a, char const * p)
856 if (a.empty() || !*p)
858 size_t l = a.find_first_not_of(from_ascii(p));
859 if (l == docstring::npos)
861 return a.substr(l, docstring::npos);
866 template<typename String, typename Char> inline
867 String const doSplit(String const & a, String & piece, Char delim)
870 size_t i = a.find(delim);
871 if (i == a.length() - 1) {
872 piece = a.substr(0, i);
873 } else if (i != String::npos) {
874 piece = a.substr(0, i);
875 tmp = a.substr(i + 1);
878 tmp = a.substr(i + 1);
885 template<typename Char> inline
886 docstring const doSplit(docstring const & a, docstring & piece, Char delim)
889 size_t i = a.find(delim);
890 if (i == a.length() - 1) {
891 piece = a.substr(0, i);
892 } else if (i != docstring::npos) {
893 piece = a.substr(0, i);
894 tmp = a.substr(i + 1);
897 tmp = a.substr(i + 1);
907 string const split(string const & a, string & piece, char delim)
909 return doSplit(a, piece, delim);
913 docstring const split(docstring const & a, docstring & piece, char_type delim)
915 return doSplit(a, piece, delim);
919 string const split(string const & a, char delim)
922 size_t i = a.find(delim);
923 if (i != string::npos) // found delim
924 tmp = a.substr(i + 1);
930 string const rsplit(string const & a, string & piece, char delim)
933 size_t i = a.rfind(delim);
934 if (i != string::npos) { // delimiter was found
935 piece = a.substr(0, i);
936 tmp = a.substr(i + 1);
937 } else { // delimiter was not found
944 docstring const rsplit(docstring const & a, char_type delim)
947 size_t i = a.rfind(delim);
948 if (i != string::npos)
949 tmp = a.substr(i + 1);
954 docstring const escape(docstring const & lab)
956 char_type hexdigit[16] = { '0', '1', '2', '3', '4', '5', '6', '7',
957 '8', '9', 'A', 'B', 'C', 'D', 'E', 'F' };
959 for (size_t i = 0; i < lab.length(); ++i) {
960 char_type c = lab[i];
961 if (c >= 128 || c == '=' || c == '%') {
962 // Although char_type is a 32 bit type we know that
963 // UCS4 occupies only 21 bits, so we don't need to
964 // encode bigger values. Test for 2^24 because we
965 // can encode that with the 6 hex digits that are
966 // needed for 21 bits anyway.
967 LASSERT(c < (1 << 24), /**/);
969 enc += hexdigit[(c>>20) & 15];
970 enc += hexdigit[(c>>16) & 15];
971 enc += hexdigit[(c>>12) & 15];
972 enc += hexdigit[(c>> 8) & 15];
973 enc += hexdigit[(c>> 4) & 15];
974 enc += hexdigit[ c & 15];
985 // this doesn't check whether str is empty, so do that first.
986 vector<docstring> wrapToVec(docstring const & str, int ind,
989 docstring s = trim(str);
991 return vector<docstring>();
995 indent.insert(0, -ind, ' ');
998 s.insert(0, ind, ' ');
1000 vector<docstring> retval;
1001 while (s.size() > width) {
1002 // find the last space within the first 'width' chars
1003 size_t const i = s.find_last_of(' ', width - 1);
1004 if (i == docstring::npos || i <= size_t(ind)) {
1006 s = s.substr(0, width - 3) + "...";
1009 retval.push_back(s.substr(0, i));
1010 s = indent + s.substr(i);
1011 ind = indent.size();
1014 retval.push_back(s);
1021 docstring wrap(docstring const & str, int const ind, size_t const width)
1023 docstring s = trim(str);
1027 vector<docstring> const svec = wrapToVec(str, ind, width);
1028 return getStringFromVector(svec, from_ascii("\n"));
1032 docstring wrapParas(docstring const & str, int const indent,
1033 size_t const width, size_t const maxlines)
1038 vector<docstring> const pars = getVectorFromString(str, from_ascii("\n"), true);
1039 vector<docstring> retval;
1041 vector<docstring>::const_iterator it = pars.begin();
1042 vector<docstring>::const_iterator const en = pars.end();
1043 for (; it != en; ++it) {
1044 vector<docstring> tmp = wrapToVec(*it, indent, width);
1045 size_t const nlines = tmp.size();
1048 size_t const curlines = retval.size();
1049 if (maxlines > 0 && curlines + nlines >= maxlines) {
1050 tmp.resize(maxlines - curlines - 1);
1051 tmp.push_back(from_ascii("..."));
1053 retval.insert(retval.end(), tmp.begin(), tmp.end());
1054 if (maxlines > 0 && retval.size() >= maxlines)
1057 return getStringFromVector(retval, from_ascii("\n"));
1063 template<typename String> vector<String> const
1064 getVectorFromStringT(String const & str, String const & delim, bool keepempty)
1066 // Lars would like this code to go, but for now his replacement (below)
1067 // doesn't fullfil the same function. I have, therefore, reactivated the
1068 // old code for now. Angus 11 Nov 2002.
1073 String keys = rtrim(str);
1075 size_t const idx = keys.find(delim);
1076 if (idx == String::npos) {
1077 vec.push_back(ltrim(keys));
1080 String const key = trim(keys.substr(0, idx));
1081 if (!key.empty() || keepempty)
1083 size_t const start = idx + delim.size();
1084 keys = keys.substr(start);
1088 typedef boost::char_separator<typename String::value_type> Separator;
1089 typedef boost::tokenizer<Separator, typename String::const_iterator, String> Tokenizer;
1090 Separator sep(delim.c_str());
1091 Tokenizer tokens(str, sep);
1092 return vector<String>(tokens.begin(), tokens.end());
1097 template<typename String> const String
1098 getStringFromVector(vector<String> const & vec, String const & delim)
1101 typename vector<String>::const_iterator it = vec.begin();
1102 typename vector<String>::const_iterator en = vec.end();
1103 for (; it != en; ++it) {
1104 String item = trim(*it);
1117 vector<string> const getVectorFromString(string const & str,
1118 string const & delim,
1121 return getVectorFromStringT<string>(str, delim, keepempty);
1125 vector<docstring> const getVectorFromString(docstring const & str,
1126 docstring const & delim,
1129 return getVectorFromStringT<docstring>(str, delim, keepempty);
1133 string const getStringFromVector(vector<string> const & vec,
1134 string const & delim)
1136 return getStringFromVector<string>(vec, delim);
1140 docstring const getStringFromVector(vector<docstring> const & vec,
1141 docstring const & delim)
1143 return getStringFromVector<docstring>(vec, delim);
1147 int findToken(char const * const str[], string const & search_token)
1151 while (str[i][0] && str[i] != search_token)
1160 docstring bformat(docstring const & fmt, int arg1)
1162 LASSERT(contains(fmt, from_ascii("%1$d")), /**/);
1163 docstring const str = subst(fmt, from_ascii("%1$d"), convert<docstring>(arg1));
1164 return subst(str, from_ascii("%%"), from_ascii("%"));
1169 docstring bformat(docstring const & fmt, long arg1)
1171 LASSERT(contains(fmt, from_ascii("%1$d")), /**/);
1172 docstring const str = subst(fmt, from_ascii("%1$d"), convert<docstring>(arg1));
1173 return subst(str, from_ascii("%%"), from_ascii("%"));
1178 docstring bformat(docstring const & fmt, unsigned int arg1)
1180 LASSERT(contains(fmt, from_ascii("%1$d")), /**/);
1181 docstring const str = subst(fmt, from_ascii("%1$d"), convert<docstring>(arg1));
1182 return subst(str, from_ascii("%%"), from_ascii("%"));
1187 docstring bformat(docstring const & fmt, docstring arg1)
1189 LASSERT(contains(fmt, from_ascii("%1$s")), /**/);
1190 docstring const str = subst(fmt, from_ascii("%1$s"), arg1);
1191 return subst(str, from_ascii("%%"), from_ascii("%"));
1196 docstring bformat(docstring const & fmt, char * arg1)
1198 LASSERT(contains(fmt, from_ascii("%1$s")), /**/);
1199 docstring const str = subst(fmt, from_ascii("%1$s"), from_ascii(arg1));
1200 return subst(str, from_ascii("%%"), from_ascii("%"));
1205 docstring bformat(docstring const & fmt, docstring arg1, docstring arg2)
1207 LASSERT(contains(fmt, from_ascii("%1$s")), /**/);
1208 LASSERT(contains(fmt, from_ascii("%2$s")), /**/);
1209 docstring str = subst(fmt, from_ascii("%1$s"), arg1);
1210 str = subst(str, from_ascii("%2$s"), arg2);
1211 return subst(str, from_ascii("%%"), from_ascii("%"));
1216 docstring bformat(docstring const & fmt, docstring arg1, int arg2)
1218 LASSERT(contains(fmt, from_ascii("%1$s")), /**/);
1219 LASSERT(contains(fmt, from_ascii("%2$d")), /**/);
1220 docstring str = subst(fmt, from_ascii("%1$s"), arg1);
1221 str = subst(str, from_ascii("%2$d"), convert<docstring>(arg2));
1222 return subst(str, from_ascii("%%"), from_ascii("%"));
1227 docstring bformat(docstring const & fmt, char const * arg1, docstring arg2)
1229 LASSERT(contains(fmt, from_ascii("%1$s")), /**/);
1230 LASSERT(contains(fmt, from_ascii("%2$s")), /**/);
1231 docstring str = subst(fmt, from_ascii("%1$s"), from_ascii(arg1));
1232 str = subst(fmt, from_ascii("%2$s"), arg2);
1233 return subst(str, from_ascii("%%"), from_ascii("%"));
1238 docstring bformat(docstring const & fmt, int arg1, int arg2)
1240 LASSERT(contains(fmt, from_ascii("%1$d")), /**/);
1241 LASSERT(contains(fmt, from_ascii("%2$d")), /**/);
1242 docstring str = subst(fmt, from_ascii("%1$d"), convert<docstring>(arg1));
1243 str = subst(str, from_ascii("%2$d"), convert<docstring>(arg2));
1244 return subst(str, from_ascii("%%"), from_ascii("%"));
1249 docstring bformat(docstring const & fmt, docstring arg1, docstring arg2, docstring arg3)
1251 LASSERT(contains(fmt, from_ascii("%1$s")), /**/);
1252 LASSERT(contains(fmt, from_ascii("%2$s")), /**/);
1253 LASSERT(contains(fmt, from_ascii("%3$s")), /**/);
1254 docstring str = subst(fmt, from_ascii("%1$s"), arg1);
1255 str = subst(str, from_ascii("%2$s"), arg2);
1256 str = subst(str, from_ascii("%3$s"), arg3);
1257 return subst(str, from_ascii("%%"), from_ascii("%"));
1262 docstring bformat(docstring const & fmt,
1263 docstring arg1, docstring arg2, docstring arg3, docstring arg4)
1265 LASSERT(contains(fmt, from_ascii("%1$s")), /**/);
1266 LASSERT(contains(fmt, from_ascii("%2$s")), /**/);
1267 LASSERT(contains(fmt, from_ascii("%3$s")), /**/);
1268 LASSERT(contains(fmt, from_ascii("%4$s")), /**/);
1269 docstring str = subst(fmt, from_ascii("%1$s"), arg1);
1270 str = subst(str, from_ascii("%2$s"), arg2);
1271 str = subst(str, from_ascii("%3$s"), arg3);
1272 str = subst(str, from_ascii("%4$s"), arg4);
1273 return subst(str, from_ascii("%%"), from_ascii("%"));
1276 } // namespace support