compose/0002755000175000017500000000000010635220574010651 5ustar oleolecompose/compose.hpp0000644000175000017500000002731610045517015013030 0ustar oleole/* Defines String::compose(fmt, arg...) for easy, i18n-friendly * composition of strings. * * Version 1.0. * * Copyright (c) 2002 Ole Laursen . * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 2.1 of * the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, but * WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 * USA. */ // // Basic usage is like // // std::cout << String::compose("This is a %1x%2 matrix.", rows, cols); // // See http://www.cs.aau.dk/~olau/compose/ or the included README.compose for // more details. // #ifndef STRING_COMPOSE_H #define STRING_COMPOSE_H #include #include #include #include // for multimap namespace StringPrivate { // the actual composition class - using string::compose is cleaner, so we // hide it here class Composition { public: // initialize and prepare format string on the form "text %1 text %2 etc." explicit Composition(std::string fmt); // supply an replacement argument starting from %1 template Composition &arg(const T &obj); // compose and return string std::string str() const; private: std::ostringstream os; int arg_no; // we store the output as a list - when the output string is requested, the // list is concatenated to a string; this way we can keep iterators into // the list instead of into a string where they're possibly invalidated on // inserting a specification string typedef std::list output_list; output_list output; // the initial parse of the format string fills in the specification map // with positions for each of the various %?s typedef std::multimap specification_map; specification_map specs; }; // helper for converting spec string numbers inline int char_to_int(char c) { switch (c) { case '0': return 0; case '1': return 1; case '2': return 2; case '3': return 3; case '4': return 4; case '5': return 5; case '6': return 6; case '7': return 7; case '8': return 8; case '9': return 9; default: return -1000; } } inline bool is_number(int n) { switch (n) { case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': return true; default: return false; } } // implementation of class Composition template inline Composition &Composition::arg(const T &obj) { os << obj; std::string rep = os.str(); if (!rep.empty()) { // manipulators don't produce output for (specification_map::const_iterator i = specs.lower_bound(arg_no), end = specs.upper_bound(arg_no); i != end; ++i) { output_list::iterator pos = i->second; ++pos; output.insert(pos, rep); } os.str(std::string()); //os.clear(); ++arg_no; } return *this; } inline Composition::Composition(std::string fmt) : arg_no(1) { std::string::size_type b = 0, i = 0; // fill in output with the strings between the %1 %2 %3 etc. and // fill in specs with the positions while (i < fmt.length()) { if (fmt[i] == '%' && i + 1 < fmt.length()) { if (fmt[i + 1] == '%') { // catch %% fmt.replace(i, 2, "%"); ++i; } else if (is_number(fmt[i + 1])) { // aha! a spec! // save string output.push_back(fmt.substr(b, i - b)); int n = 1; // number of digits int spec_no = 0; do { spec_no += char_to_int(fmt[i + n]); spec_no *= 10; ++n; } while (i + n < fmt.length() && is_number(fmt[i + n])); spec_no /= 10; output_list::iterator pos = output.end(); --pos; // safe since we have just inserted a string> specs.insert(specification_map::value_type(spec_no, pos)); // jump over spec string i += n; b = i; } else ++i; } else ++i; } if (i - b > 0) // add the rest of the string output.push_back(fmt.substr(b, i - b)); } inline std::string Composition::str() const { // assemble string std::string str; for (output_list::const_iterator i = output.begin(), end = output.end(); i != end; ++i) str += *i; return str; } } // now for the real thing(s) namespace String { // a series of functions which accept a format string on the form "text %1 // more %2 less %3" and a number of templated parameters and spits out the // composited string template inline std::string compose(const std::string &fmt, const T1 &o1) { StringPrivate::Composition c(fmt); c.arg(o1); return c.str(); } template inline std::string compose(const std::string &fmt, const T1 &o1, const T2 &o2) { StringPrivate::Composition c(fmt); c.arg(o1).arg(o2); return c.str(); } template inline std::string compose(const std::string &fmt, const T1 &o1, const T2 &o2, const T3 &o3) { StringPrivate::Composition c(fmt); c.arg(o1).arg(o2).arg(o3); return c.str(); } template inline std::string compose(const std::string &fmt, const T1 &o1, const T2 &o2, const T3 &o3, const T4 &o4) { StringPrivate::Composition c(fmt); c.arg(o1).arg(o2).arg(o3).arg(o4); return c.str(); } template inline std::string compose(const std::string &fmt, const T1 &o1, const T2 &o2, const T3 &o3, const T4 &o4, const T5 &o5) { StringPrivate::Composition c(fmt); c.arg(o1).arg(o2).arg(o3).arg(o4).arg(o5); return c.str(); } template inline std::string compose(const std::string &fmt, const T1 &o1, const T2 &o2, const T3 &o3, const T4 &o4, const T5 &o5, const T6 &o6) { StringPrivate::Composition c(fmt); c.arg(o1).arg(o2).arg(o3).arg(o4).arg(o5).arg(o6); return c.str(); } template inline std::string compose(const std::string &fmt, const T1 &o1, const T2 &o2, const T3 &o3, const T4 &o4, const T5 &o5, const T6 &o6, const T7 &o7) { StringPrivate::Composition c(fmt); c.arg(o1).arg(o2).arg(o3).arg(o4).arg(o5).arg(o6).arg(o7); return c.str(); } template inline std::string compose(const std::string &fmt, const T1 &o1, const T2 &o2, const T3 &o3, const T4 &o4, const T5 &o5, const T6 &o6, const T7 &o7, const T8 &o8) { StringPrivate::Composition c(fmt); c.arg(o1).arg(o2).arg(o3).arg(o4).arg(o5).arg(o6).arg(o7).arg(o8); return c.str(); } template inline std::string compose(const std::string &fmt, const T1 &o1, const T2 &o2, const T3 &o3, const T4 &o4, const T5 &o5, const T6 &o6, const T7 &o7, const T8 &o8, const T9 &o9) { StringPrivate::Composition c(fmt); c.arg(o1).arg(o2).arg(o3).arg(o4).arg(o5).arg(o6).arg(o7).arg(o8).arg(o9); return c.str(); } template inline std::string compose(const std::string &fmt, const T1 &o1, const T2 &o2, const T3 &o3, const T4 &o4, const T5 &o5, const T6 &o6, const T7 &o7, const T8 &o8, const T9 &o9, const T10 &o10) { StringPrivate::Composition c(fmt); c.arg(o1).arg(o2).arg(o3).arg(o4).arg(o5).arg(o6).arg(o7).arg(o8).arg(o9) .arg(o10); return c.str(); } template inline std::string compose(const std::string &fmt, const T1 &o1, const T2 &o2, const T3 &o3, const T4 &o4, const T5 &o5, const T6 &o6, const T7 &o7, const T8 &o8, const T9 &o9, const T10 &o10, const T11 &o11) { StringPrivate::Composition c(fmt); c.arg(o1).arg(o2).arg(o3).arg(o4).arg(o5).arg(o6).arg(o7).arg(o8).arg(o9) .arg(o10).arg(o11); return c.str(); } template inline std::string compose(const std::string &fmt, const T1 &o1, const T2 &o2, const T3 &o3, const T4 &o4, const T5 &o5, const T6 &o6, const T7 &o7, const T8 &o8, const T9 &o9, const T10 &o10, const T11 &o11, const T12 &o12) { StringPrivate::Composition c(fmt); c.arg(o1).arg(o2).arg(o3).arg(o4).arg(o5).arg(o6).arg(o7).arg(o8).arg(o9) .arg(o10).arg(o11).arg(o12); return c.str(); } template inline std::string compose(const std::string &fmt, const T1 &o1, const T2 &o2, const T3 &o3, const T4 &o4, const T5 &o5, const T6 &o6, const T7 &o7, const T8 &o8, const T9 &o9, const T10 &o10, const T11 &o11, const T12 &o12, const T13 &o13) { StringPrivate::Composition c(fmt); c.arg(o1).arg(o2).arg(o3).arg(o4).arg(o5).arg(o6).arg(o7).arg(o8).arg(o9) .arg(o10).arg(o11).arg(o12).arg(o13); return c.str(); } template inline std::string compose(const std::string &fmt, const T1 &o1, const T2 &o2, const T3 &o3, const T4 &o4, const T5 &o5, const T6 &o6, const T7 &o7, const T8 &o8, const T9 &o9, const T10 &o10, const T11 &o11, const T12 &o12, const T13 &o13, const T14 &o14) { StringPrivate::Composition c(fmt); c.arg(o1).arg(o2).arg(o3).arg(o4).arg(o5).arg(o6).arg(o7).arg(o8).arg(o9) .arg(o10).arg(o11).arg(o12).arg(o13).arg(o14); return c.str(); } template inline std::string compose(const std::string &fmt, const T1 &o1, const T2 &o2, const T3 &o3, const T4 &o4, const T5 &o5, const T6 &o6, const T7 &o7, const T8 &o8, const T9 &o9, const T10 &o10, const T11 &o11, const T12 &o12, const T13 &o13, const T14 &o14, const T15 &o15) { StringPrivate::Composition c(fmt); c.arg(o1).arg(o2).arg(o3).arg(o4).arg(o5).arg(o6).arg(o7).arg(o8).arg(o9) .arg(o10).arg(o11).arg(o12).arg(o13).arg(o14).arg(o15); return c.str(); } } #endif // STRING_COMPOSE_H compose/Makefile0000644000175000017500000000061710635220562012310 0ustar oleole# Makefile for compiling test example CC=$(CXX) CXXFLAGS=-Wall -g DISTDIR=.. .PHONY: all clean dist all: test test.o: test.cpp compose.hpp test: test.o dist: *.hpp README.compose TODO INSTALL ChangeLog -rm *.o test *~ cd .. && tar cvfz compose.tar.gz compose/ && \ mv compose.tar.gz $(DISTDIR)/ @echo "Delivered $(DISTDIR)/compose.tar.gz" clean: -rm *.o test compose/test.cpp0000644000175000017500000000261607717130324012337 0ustar oleole// small example program for showing some of the possibilities of // String::compose #include #include #include "compose.hpp" int main(int argc, char *argv[]) { // demonstrate basic usage std::cout << String::compose("There are %1 cows in them %2.", 15, "fields") << std::endl; using String::compose; // demonstrate argument repetition std::cout << compose("To %1, or not to %1... is actually not a question.", "be") << std::endl; // demonstrate leaving out arguments std::cout << compose("Primetime: %2 %3 %5 %7", 1, 2, 3, 4, 5, 6, 7) << std::endl; // demonstrate % escaping std::cout << compose("Using % before a %%1 causes the %1 to be escaped", "%1") << std::endl; std::cout << compose("Four percent in a row: %%%%%%%%", "") << std::endl; // demonstrate use of manipulators std::cout << compose("With lots of precision, %2 equals %1%!", std::setprecision(15), 1.0 / 3 * 100, "one third") << std::endl; // test % escaping at the string ends std::cout << compose("%% This is like a LaTeX comment %%", "") << std::endl; // test % specs at the string ends std::cout << compose("%1 %2", "Hello", "World!") << std::endl; // test a bunch of arguments std::cout << compose("%1 %2 %3 %4 %5 %6, %7 %8!", "May", "the", "Force", "be", "with", "you", "Woung", "Skytalker") << std::endl; } compose/COPYING.LIB0000644000175000017500000006364407525705017012330 0ustar oleole GNU LESSER GENERAL PUBLIC LICENSE Version 2.1, February 1999 Copyright (C) 1991, 1999 Free Software Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. [This is the first released version of the Lesser GPL. It also counts as the successor of the GNU Library Public License, version 2, hence the version number 2.1.] Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This license, the Lesser General Public License, applies to some specially designated software packages--typically libraries--of the Free Software Foundation and other authors who decide to use it. You can use it too, but we suggest you first think carefully about whether this license or the ordinary General Public License is the better strategy to use in any particular case, based on the explanations below. When we speak of free software, we are referring to freedom of use, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish); that you receive source code or can get it if you want it; that you can change the software and use pieces of it in new free programs; and that you are informed that you can do these things. To protect your rights, we need to make restrictions that forbid distributors to deny you these rights or to ask you to surrender these rights. These restrictions translate to certain responsibilities for you if you distribute copies of the library or if you modify it. For example, if you distribute copies of the library, whether gratis or for a fee, you must give the recipients all the rights that we gave you. You must make sure that they, too, receive or can get the source code. If you link other code with the library, you must provide complete object files to the recipients, so that they can relink them with the library after making changes to the library and recompiling it. And you must show them these terms so they know their rights. We protect your rights with a two-step method: (1) we copyright the library, and (2) we offer you this license, which gives you legal permission to copy, distribute and/or modify the library. To protect each distributor, we want to make it very clear that there is no warranty for the free library. Also, if the library is modified by someone else and passed on, the recipients should know that what they have is not the original version, so that the original author's reputation will not be affected by problems that might be introduced by others. ^L Finally, software patents pose a constant threat to the existence of any free program. We wish to make sure that a company cannot effectively restrict the users of a free program by obtaining a restrictive license from a patent holder. Therefore, we insist that any patent license obtained for a version of the library must be consistent with the full freedom of use specified in this license. Most GNU software, including some libraries, is covered by the ordinary GNU General Public License. This license, the GNU Lesser General Public License, applies to certain designated libraries, and is quite different from the ordinary General Public License. We use this license for certain libraries in order to permit linking those libraries into non-free programs. When a program is linked with a library, whether statically or using a shared library, the combination of the two is legally speaking a combined work, a derivative of the original library. The ordinary General Public License therefore permits such linking only if the entire combination fits its criteria of freedom. The Lesser General Public License permits more lax criteria for linking other code with the library. We call this license the "Lesser" General Public License because it does Less to protect the user's freedom than the ordinary General Public License. It also provides other free software developers Less of an advantage over competing non-free programs. These disadvantages are the reason we use the ordinary General Public License for many libraries. However, the Lesser license provides advantages in certain special circumstances. For example, on rare occasions, there may be a special need to encourage the widest possible use of a certain library, so that it becomes a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free software only, so we use the Lesser General Public License. In other cases, permission to use a particular library in non-free programs enables a greater number of people to use a large body of free software. For example, permission to use the GNU C Library in non-free programs enables many more people to use the whole GNU operating system, as well as its variant, the GNU/Linux operating system. Although the Lesser General Public License is Less protective of the users' freedom, it does ensure that the user of a program that is linked with the Library has the freedom and the wherewithal to run that program using a modified version of the Library. The precise terms and conditions for copying, distribution and modification follow. Pay close attention to the difference between a "work based on the library" and a "work that uses the library". The former contains code derived from the library, whereas the latter must be combined with the library in order to run. ^L GNU LESSER GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License Agreement applies to any software library or other program which contains a notice placed by the copyright holder or other authorized party saying it may be distributed under the terms of this Lesser General Public License (also called "this License"). Each licensee is addressed as "you". A "library" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables. The "Library", below, refers to any such software library or work which has been distributed under these terms. A "work based on the Library" means either the Library or any derivative work under copyright law: that is to say, a work containing the Library or a portion of it, either verbatim or with modifications and/or translated straightforwardly into another language. (Hereinafter, translation is included without limitation in the term "modification".) "Source code" for a work means the preferred form of the work for making modifications to it. For a library, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the library. Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does. 1. You may copy and distribute verbatim copies of the Library's complete source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and distribute a copy of this License along with the Library. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Library or any portion of it, thus forming a work based on the Library, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) The modified work must itself be a software library. b) You must cause the files modified to carry prominent notices stating that you changed the files and the date of any change. c) You must cause the whole of the work to be licensed at no charge to all third parties under the terms of this License. d) If a facility in the modified Library refers to a function or a table of data to be supplied by an application program that uses the facility, other than as an argument passed when the facility is invoked, then you must make a good faith effort to ensure that, in the event an application does not supply such function or table, the facility still operates, and performs whatever part of its purpose remains meaningful. (For example, a function in a library to compute square roots has a purpose that is entirely well-defined independent of the application. Therefore, Subsection 2d requires that any application-supplied function or table used by this function must be optional: if the application does not supply it, the square root function must still compute square roots.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Library, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Library, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Library. In addition, mere aggregation of another work not based on the Library with the Library (or with a work based on the Library) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may opt to apply the terms of the ordinary GNU General Public License instead of this License to a given copy of the Library. To do this, you must alter all the notices that refer to this License, so that they refer to the ordinary GNU General Public License, version 2, instead of to this License. (If a newer version than version 2 of the ordinary GNU General Public License has appeared, then you can specify that version instead if you wish.) Do not make any other change in these notices. ^L Once this change is made in a given copy, it is irreversible for that copy, so the ordinary GNU General Public License applies to all subsequent copies and derivative works made from that copy. This option is useful when you wish to copy part of the code of the Library into a program that is not a library. 4. You may copy and distribute the Library (or a portion or derivative of it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange. If distribution of object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place satisfies the requirement to distribute the source code, even though third parties are not compelled to copy the source along with the object code. 5. A program that contains no derivative of any portion of the Library, but is designed to work with the Library by being compiled or linked with it, is called a "work that uses the Library". Such a work, in isolation, is not a derivative work of the Library, and therefore falls outside the scope of this License. However, linking a "work that uses the Library" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a "work that uses the library". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables. When a "work that uses the Library" uses material from a header file that is part of the Library, the object code for the work may be a derivative work of the Library even though the source code is not. Whether this is true is especially significant if the work can be linked without the Library, or if the work is itself a library. The threshold for this to be true is not precisely defined by law. If such an object file uses only numerical parameters, data structure layouts and accessors, and small macros and small inline functions (ten lines or less in length), then the use of the object file is unrestricted, regardless of whether it is legally a derivative work. (Executables containing this object code plus portions of the Library will still fall under Section 6.) Otherwise, if the work is a derivative of the Library, you may distribute the object code for the work under the terms of Section 6. Any executables containing that work also fall under Section 6, whether or not they are linked directly with the Library itself. ^L 6. As an exception to the Sections above, you may also combine or link a "work that uses the Library" with the Library to produce a work containing portions of the Library, and distribute that work under terms of your choice, provided that the terms permit modification of the work for the customer's own use and reverse engineering for debugging such modifications. You must give prominent notice with each copy of the work that the Library is used in it and that the Library and its use are covered by this License. You must supply a copy of this License. If the work during execution displays copyright notices, you must include the copyright notice for the Library among them, as well as a reference directing the user to the copy of this License. Also, you must do one of these things: a) Accompany the work with the complete corresponding machine-readable source code for the Library including whatever changes were used in the work (which must be distributed under Sections 1 and 2 above); and, if the work is an executable linked with the Library, with the complete machine-readable "work that uses the Library", as object code and/or source code, so that the user can modify the Library and then relink to produce a modified executable containing the modified Library. (It is understood that the user who changes the contents of definitions files in the Library will not necessarily be able to recompile the application to use the modified definitions.) b) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (1) uses at run time a copy of the library already present on the user's computer system, rather than copying library functions into the executable, and (2) will operate properly with a modified version of the library, if the user installs one, as long as the modified version is interface-compatible with the version that the work was made with. c) Accompany the work with a written offer, valid for at least three years, to give the same user the materials specified in Subsection 6a, above, for a charge no more than the cost of performing this distribution. d) If distribution of the work is made by offering access to copy from a designated place, offer equivalent access to copy the above specified materials from the same place. e) Verify that the user has already received a copy of these materials or that you have already sent this user a copy. For an executable, the required form of the "work that uses the Library" must include any data and utility programs needed for reproducing the executable from it. However, as a special exception, the materials to be distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute. ^L 7. You may place library facilities that are a work based on the Library side-by-side in a single library together with other library facilities not covered by this License, and distribute such a combined library, provided that the separate distribution of the work based on the Library and of the other library facilities is otherwise permitted, and provided that you do these two things: a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities. This must be distributed under the terms of the Sections above. b) Give prominent notice with the combined library of the fact that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work. 8. You may not copy, modify, sublicense, link with, or distribute the Library except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense, link with, or distribute the Library is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 9. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Library or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Library (or any work based on the Library), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Library or works based on it. 10. Each time you redistribute the Library (or any work based on the Library), the recipient automatically receives a license from the original licensor to copy, distribute, link with or modify the Library subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties with this License. ^L 11. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Library at all. For example, if a patent license would not permit royalty-free redistribution of the Library by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Library. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply, and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 12. If the distribution and/or use of the Library is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Library under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 13. The Free Software Foundation may publish revised and/or new versions of the Lesser General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Library specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Library does not specify a license version number, you may choose any version ever published by the Free Software Foundation. ^L 14. If you wish to incorporate parts of the Library into other free programs whose distribution conditions are incompatible with these, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS ^L How to Apply These Terms to Your New Libraries If you develop a new library, and you want it to be of the greatest possible use to the public, we recommend making it free software that everyone can redistribute and change. You can do so by permitting redistribution under these terms (or, alternatively, under the terms of the ordinary General Public License). To apply these terms, attach the following notices to the library. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Also add information on how to contact you by electronic and paper mail. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the library `Frob' (a library for tweaking knobs) written by James Random Hacker. , 1 April 1990 Ty Coon, President of Vice That's all there is to it! compose/README.compose0000644000175000017500000003063310045517002013166 0ustar oleoleDocumentation for the compose library ------------------------------------- The file compose.hpp contains the source for a small C++ library for composition of strings from arbitrary objects convertible to strings (such as integers, floats etc.). This is the documentation for that library. The utility of the library is thought to be greatest for programmers needing translation of their programs, but in fact it can be used for its mere convenience. The file ucompose.hpp has a front-end that uses Glib::ustrings which come from the C++ GUI library Gtkmm (see www.gtkmm.org). Use ucompose.hpp and String::ucompose if you are using Gtkmm - else your ustrings will end up corrupted someday. The initiating problem - a prelude ---------------------------------- The basic problem this library solves is that of creating strings such as "Fact is that 10 gobbles are worth 100$ of troubles." where the two numbers, 10 and 100, are to be determined at runtime and may vary. C++ doesn't have a good solution for this problem - unless you use something like itoa() (which isn't really portable and doesn't work for arbitrary objects, say GobbliGobs, that define their own conversion routines by overloading "ostream & operator<<(ostream &, Object)"), the best option you have is to aggregate an ostringstream: std::ostringstream os; os << gobble_no; std::string gobble_no_as_string = os.str(); But even Bjarne Stroustrup thinks this is embarrassing for ordinary integer-to-string conversion. The Boost family of libraries (see www.boost.org) defines a lexical_cast() which one may use to conveniently compose a complex string (in fact it uses a stringstream internally): #include std::string s = "Fact is that " + boost::lexical_cast(gobble_no) + " gobbles are worth " + boost::lexical_cast(gobble_price) + "$ of troubles."; However, this is prone to subtle errors when written (one may easily forget a '+' or a space on one side of a converted object, both annoyingly requiring recompilation and attention), hard to read, and a real internationalisation killer. Imagine translating the strings "Fact is that " " gobbles are worth " "$ of troubles." not quite sure whether the strings actually form an entity and with only fragmented clues of what is inserted between them. What is worse, most languages do not order the different parts of sentences the same way English does. And by chopping up the string, we have more or less enforced a particular order (or at least made the changing of it most difficult for the translator). Also, one now has to mark up three strings in the program to get one string translated - another source of errors. Furthermore, the lexical cast of Boost doesn't allow us to control even simple formatting requests, such as increased (or, often more importantly, decreased) precision of floating point numbers. Interlude: The Solution that isn't really a Solution ---------------------------------------------------- So, one might think, isn't this string composition problem already solved? Does our inheritage from C not already provide us with the solution, the end to all these troubles? Upon thinking this, one probably has the dreaded printf, "print formatted", family in mind. Except from the type insecurity resulting from usage of such functions, a problem already partly solved by modern compiler warnings, suffice to say that they mix badly with ordinary C++ style of programming. For good reason, they don't return proper std::string's and usually even require one to worry about memory management. Needless worries. Finale: An end to the problem ----------------------------- So what we need really need is something like std::string s = compose("Fact is that %1 gobbles are worth %2$ of troubles.", gobble_no, gobble_price); This is what this library gives. Semantics in details (...and there was much rejoice) ---------------------------------------------------- Actually, what the library really gives is 15 overloaded template functions like template inline std::string compose(const std::string &fmt, const T1 &o1, const T2 &o2); declared in the namespace String - each allowing one extra parameter to join the composition - and some implementation details in the namespace StringPrivate (notably a class that defines a generic, unlimited parameter substitution mechanism). The first parameter is the format string containing percent specifications (%1, %2 etc.) and the following generically typed parameters are the objects to be inserted in the string. The 15 functions allow up to 15 parameters to be inserted. For instance: String::compose("%1 times %2 equals %3", 1.5, 2, 3); // "1.5 times 2 equals 3" A percent specification consists of a percent sign followed by an integer. The format string is parsed at first so any possible new percent specifications that may be constructed halfway through the composition by the inserted strings, aren't interpreted as such: String::compose("1st: %1 2nd: %2", "%2", 1234); // "1st: %2 2nd: 1234" Of course, this format allows one to easily swap the specification strings: String::compose("No. %2 is better than no. %1", 1, 2); // "No. 2 is better than no. 1" One may silently leave out a specification string: String::compose("%1, %3", "Hey", "hi", "ho"); // "Hey, ho" Or even an object (all percent specifications are always erased): String::compose("%1 %2: '%3'", "Twin", "geeks"); // "Twin geeks: ''" And specifications may be repeated: String::compose("I am feeling so %1, %1, %1!", "happy"); // "I am feeling so happy, happy, happy!" This gives potential translators of the strings considerable freedom. Conversion of objects, the art of ---------------------------------- Internally the template functions use an object that stores a stringstream for converting arguments. Thus adding an extra parameter to the compose function is very much like appending an extra "<< arg" to a stream output statement. This implies seamless support for manipulators and that user-supplied conversions are supported for free. To add output support for one of your own classes, simply add the appropriate operator<< overload, just as you would for std::cout: ostream &operator<<(ostream &, const MyType &my_obj) { // ... } The manipulator support imply that constructions like the following are possible: #include // ... double r = 1.0 / 6; String::compose("1/6 app. equals %1, %2, and %3", r, std::setprecision(10), r, std::setprecision(3), r); // "1/6 app. equals 0.166667, 0.1666666667, and 0.167" Note that within the same call of compose the stringstream is not cleared, so the same rules governs whether the settings are remembered as for ordinary ostreams (look up the rules in your favourite C++ standard iostream documentation): String::compose("1/6 app. equals %1, %2, and %3", r, std::setprecision(10), r, r); // "1/6 app. equals 0.166667, 0.1666666667, and 0.1666666667" Each call of compose constructs a new stringstream so settings are not preserved across these. Internally, the manipulator detection works by examining the output from the stringstream - if it is empty, then the parameter is not considered real output, and the specification number is not incremented. This behaviour is needed to give the above semantics, but it also implies that if your insert the empty string, "", the compose object will not consider it output; as a consequence the following example does not work as expected: String::compose("I'm a%1 alien at the age of %2.", happiness > 10 ? " happy" : "", 99800); // "I'm a happy alien at the age of 99800." // "I'm a99800 alien at the age of ." But read below for why you really should not do this anyway, and for the simple remedy. Escaping the parse ------------------ All double percent signs are replaced with a single sign; if the double signs appears in front of an integer, the resulting single percent sign followed by the integer isn't considered a specification. Thus, to get a percent specification: String::compose("This is a %1: %%1", "specification"); // "This is a specification: %1" Single percent signs are left untouched in case they aren't followed by a number: String::compose("%1% done", 0.98 * 100); // "98% done" To get two percent signs in a row: String::compose("%1 %2 signs: %%%%", 2, '%'); // "2 % signs: %%" A final advice against cleverness --------------------------------- Do not let the techniques this library offers tempt you into trying overly clever string compositions, or the translators of your program will curse you in eternity! For instance: String::compose("A%1 man", man.is_angry() ? "n angry" : " content"); // "An angry man" // "A happy man" The inherent problem with this approach is that it hardcodes the way the sentence is constructed; obviously this is only guaranteed to work for English. It also makes the code harder to read. Instead, fork the code on a slightly higher level and repeat the whole string: std::string description; if (man.is_angry()) description = String::compose("An angry man"); else description = String::compose("A content man"); Now the code is also much easier to read. This (slightly contrived, but realistic, I have seen it in real code) example is of course quite easy to spot, but in generel one needs to be very careful as soon as one substitute strings into ordinary text. One more example: String::compose("This is a %1", thing->got_wheels() ? "car" : "house"); Innocent looking, but absolutely wrong. Most languages will need to change the part "a " of the string too (e.g. in Danish it is "en bil" (a car) but "et hus" (a house)). Completely decoupled words should of course not cause any problems: String::compose("The XML error was caused by the element '%1'", element.name); In fact, factoring out the common part of such strings (e.g. putting it in a xml_error function) may be much of a convenience for the translators. Often, you would want to use constructions such as the above ones when some part of the string sometime needs to be in plural form: String::compose("There is a total of %1 %2.", n, n == 1 ? "hen" : "hens"); But do not do this - for some languages, a two-way branch isn't enough. Instead the translation system should have some means of solving this (for gettext, look up the function 'ngettext'). Practically speaking, the art of improvement -------------------------------------------- The latest, super-duper-improved (hah!) version of the library should always be available together with a small test example from http://www.cs.aau.dk/~olau/compose/ Note that the license of the library is GNU Lesser General Public License. For the uninitiated, this basically means that you may use the library freely in any way you want, but if you change any of the code of it and distribute it in binary form, you _must_ also release the source for the modified library under the LGPL. Thus you must share your improvements with the rest of the world, just like I shared my code with you. No big deal. If you have any comments, suggestions for improvements, critics, (good) jokes, portability fixes, interesting uses, or perhaps just a word of wisdom, let me know. Ole Laursen , 2003. A short historical anecdote - postlude -------------------------------------- One might think that the name of the namespace "String::" is pretty lame; and, indeed, I agree. However, the library was initially born because the Gtkmm family of libraries doesn't help with composition of strings and e.g. integers in a way so that the placement of the integers is decoupled from the conversion to strings; a procedure that is frequently badly needed in a GUI-intensitive program. So when I got the idea of using a stringstream together with a template member function, I promptly implemented the Composition class (defined in the StringPrivate namespace). But, alas, the functionality isn't conceived to be important enough for Gtkmm users to be put into Glibmm (a support library for Gtkmm that contains various helpers), so instead I'm placing it here. Unfortunately, this left me without a proper namespace (formerly "Glib::") to wrap the functionality in - thus the current "String::". My apologies. Maybe the situation will change one day. Suggestions are welcome. compose/INSTALL0000644000175000017500000000167707554505453011723 0ustar oleoleHow to install the compose library ---------------------------------- To make the library as easy to use as possible, there's only one header, "compose.hpp", which I suggest you copy to your source directory and include with the ordinary syntax #include "compose.hpp" in any file that needs the library. Remember to add the header to your sources list in Makefile.am if you're using Automake so it is distributed with the rest of your sources. If you're using Gtkmm, simply grab "ucompose.hpp" instead. Then the compose templates are available as String::compose(format_string, arg1, arg2, arg3, etc.) See the file README.compose for further details; "ucompose.hpp" defines ucompose(fmt, arg1, arg2, ...). It might be a good idea to copy the README to your source directory too so you don't forget the semantics. The file test.cpp contains a few examples and tests of usage; take a look. The supplied Makefile should build it if you type "make". compose/ChangeLog0000644000175000017500000000232710635220433012417 0ustar oleole2007-06-17 Ole Laursen * ucompose.hpp: Integrated patch from John Spray to catch 'char *' as well as 'const char *' to avoid sending strings from gettext through the stringstream conversion mill. 2004-06-21 Ole Laursen * ucompose.hpp: Use std::wostringstream instead of std::ostringstream since the latter is not wide enough to hold some characters, e.g. the thousands separator in some languages. This made Glibmm throw an error. 2003-04-23 Ole Laursen * ucompose.hpp: Changed so that the individual arguments to ucompose are converted back and forth instead of the whole resulting string. Added template specializations for Glib::ustring, std::string and char * to skip conversions. This fixes a serious bug and reduces the amount of conversion quite a lot. Also renamed StringPrivate to UStringPrivate so that it is possible to include both compose.hpp and ucompose.hpp. 2003-03-30 Ole Laursen * ucompose.hpp: Insert conditional to test for GCC > 3.x. ucompose should now finally work with both GCC 2.95 and 3.x. 2003-01-19 Ole Laursen * ucompose.hpp: Added #include . compose/ucompose.hpp0000644000175000017500000003140610635217115013213 0ustar oleole/* Defines String::ucompose(fmt, arg...) for easy, i18n-friendly * composition of strings with Gtkmm >= 1.3.* (see www.gtkmm.org). * Uses Glib::ustring instead of std::string which doesn't work with * Gtkmm due to character encoding troubles with stringstreams. * * Version 1.0.5. * * Copyright (c) 2002, 03, 04, 07 Ole Laursen . * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 2.1 of * the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, but * WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 * USA. */ // // Basic usage is like // // String::ucompose("This is a %1x%2 matrix.", rows, cols); // // See http://people.iola.dk/olau/compose/ or the included // README.compose for more details. // #ifndef STRING_UCOMPOSE_HPP #define STRING_UCOMPOSE_HPP #include #include #include #include #include #include // for multimap namespace UStringPrivate { // the actual composition class - using String::ucompose is cleaner, so we // hide it here class Composition { public: // initialize and prepare format string on the form "text %1 text %2 etc." explicit Composition(std::string fmt); // supply an replacement argument starting from %1 template Composition &arg(const T &obj); // compose and return string Glib::ustring str() const; private: std::wostringstream os; int arg_no; // we store the output as a list - when the output string is requested, the // list is concatenated to a string; this way we can keep iterators into // the list instead of into a string where they're possibly invalidated // when inserting a specification string typedef std::list output_list; output_list output; // the initial parse of the format string fills in the specification map // with positions for each of the various %?s typedef std::multimap specification_map; specification_map specs; template std::string stringify(T obj); }; // helper for converting spec string numbers inline int char_to_int(char c) { switch (c) { case '0': return 0; case '1': return 1; case '2': return 2; case '3': return 3; case '4': return 4; case '5': return 5; case '6': return 6; case '7': return 7; case '8': return 8; case '9': return 9; default: return -1000; } } inline bool is_number(int n) { switch (n) { case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': return true; default: return false; } } template inline std::string Composition::stringify(T obj) { os << obj; std::wstring str = os.str(); return Glib::convert(std::string(reinterpret_cast(str.data()), str.size() * sizeof(wchar_t)), "UTF-8", "WCHAR_T"); } // specialisations for the common string types template <> inline std::string Composition::stringify(std::string obj) { return obj; } template <> inline std::string Composition::stringify(Glib::ustring obj) { return obj; } template <> inline std::string Composition::stringify(const char *obj) { return obj; } template <> inline std::string Composition::stringify(char *obj) { return obj; } // implementation of class Composition template inline Composition &Composition::arg(const T &obj) { Glib::ustring rep = stringify(obj); if (!rep.empty()) { // manipulators don't produce output for (specification_map::const_iterator i = specs.lower_bound(arg_no), end = specs.upper_bound(arg_no); i != end; ++i) { output_list::iterator pos = i->second; ++pos; output.insert(pos, rep); } os.str(std::wstring()); //os.clear(); ++arg_no; } return *this; } inline Composition::Composition(std::string fmt) : arg_no(1) { #if __GNUC__ >= 3 os.imbue(std::locale("")); // use the user's locale for the stream #endif std::string::size_type b = 0, i = 0; // fill in output with the strings between the %1 %2 %3 etc. and // fill in specs with the positions while (i < fmt.length()) { if (fmt[i] == '%' && i + 1 < fmt.length()) { if (fmt[i + 1] == '%') { // catch %% fmt.replace(i, 2, "%"); ++i; } else if (is_number(fmt[i + 1])) { // aha! a spec! // save string output.push_back(fmt.substr(b, i - b)); int n = 1; // number of digits int spec_no = 0; do { spec_no += char_to_int(fmt[i + n]); spec_no *= 10; ++n; } while (i + n < fmt.length() && is_number(fmt[i + n])); spec_no /= 10; output_list::iterator pos = output.end(); --pos; // safe since we have just inserted a string specs.insert(specification_map::value_type(spec_no, pos)); // jump over spec string i += n; b = i; } else ++i; } else ++i; } if (i - b > 0) // add the rest of the string output.push_back(fmt.substr(b, i - b)); } inline Glib::ustring Composition::str() const { // assemble string std::string str; for (output_list::const_iterator i = output.begin(), end = output.end(); i != end; ++i) str += *i; return str; } } namespace String { // a series of functions which accept a format string on the form "text %1 // more %2 less %3" and a number of templated parameters and spits out the // composited string template inline Glib::ustring ucompose(const Glib::ustring &fmt, const T1 &o1) { UStringPrivate::Composition c(fmt); c.arg(o1); return c.str(); } template inline Glib::ustring ucompose(const Glib::ustring &fmt, const T1 &o1, const T2 &o2) { UStringPrivate::Composition c(fmt); c.arg(o1).arg(o2); return c.str(); } template inline Glib::ustring ucompose(const Glib::ustring &fmt, const T1 &o1, const T2 &o2, const T3 &o3) { UStringPrivate::Composition c(fmt); c.arg(o1).arg(o2).arg(o3); return c.str(); } template inline Glib::ustring ucompose(const Glib::ustring &fmt, const T1 &o1, const T2 &o2, const T3 &o3, const T4 &o4) { UStringPrivate::Composition c(fmt); c.arg(o1).arg(o2).arg(o3).arg(o4); return c.str(); } template inline Glib::ustring ucompose(const Glib::ustring &fmt, const T1 &o1, const T2 &o2, const T3 &o3, const T4 &o4, const T5 &o5) { UStringPrivate::Composition c(fmt); c.arg(o1).arg(o2).arg(o3).arg(o4).arg(o5); return c.str(); } template inline Glib::ustring ucompose(const Glib::ustring &fmt, const T1 &o1, const T2 &o2, const T3 &o3, const T4 &o4, const T5 &o5, const T6 &o6) { UStringPrivate::Composition c(fmt); c.arg(o1).arg(o2).arg(o3).arg(o4).arg(o5).arg(o6); return c.str(); } template inline Glib::ustring ucompose(const Glib::ustring &fmt, const T1 &o1, const T2 &o2, const T3 &o3, const T4 &o4, const T5 &o5, const T6 &o6, const T7 &o7) { UStringPrivate::Composition c(fmt); c.arg(o1).arg(o2).arg(o3).arg(o4).arg(o5).arg(o6).arg(o7); return c.str(); } template inline Glib::ustring ucompose(const Glib::ustring &fmt, const T1 &o1, const T2 &o2, const T3 &o3, const T4 &o4, const T5 &o5, const T6 &o6, const T7 &o7, const T8 &o8) { UStringPrivate::Composition c(fmt); c.arg(o1).arg(o2).arg(o3).arg(o4).arg(o5).arg(o6).arg(o7).arg(o8); return c.str(); } template inline Glib::ustring ucompose(const Glib::ustring &fmt, const T1 &o1, const T2 &o2, const T3 &o3, const T4 &o4, const T5 &o5, const T6 &o6, const T7 &o7, const T8 &o8, const T9 &o9) { UStringPrivate::Composition c(fmt); c.arg(o1).arg(o2).arg(o3).arg(o4).arg(o5).arg(o6).arg(o7).arg(o8).arg(o9); return c.str(); } template inline Glib::ustring ucompose(const Glib::ustring &fmt, const T1 &o1, const T2 &o2, const T3 &o3, const T4 &o4, const T5 &o5, const T6 &o6, const T7 &o7, const T8 &o8, const T9 &o9, const T10 &o10) { UStringPrivate::Composition c(fmt); c.arg(o1).arg(o2).arg(o3).arg(o4).arg(o5).arg(o6).arg(o7).arg(o8).arg(o9) .arg(o10); return c.str(); } template inline Glib::ustring ucompose(const Glib::ustring &fmt, const T1 &o1, const T2 &o2, const T3 &o3, const T4 &o4, const T5 &o5, const T6 &o6, const T7 &o7, const T8 &o8, const T9 &o9, const T10 &o10, const T11 &o11) { UStringPrivate::Composition c(fmt); c.arg(o1).arg(o2).arg(o3).arg(o4).arg(o5).arg(o6).arg(o7).arg(o8).arg(o9) .arg(o10).arg(o11); return c.str(); } template inline Glib::ustring ucompose(const Glib::ustring &fmt, const T1 &o1, const T2 &o2, const T3 &o3, const T4 &o4, const T5 &o5, const T6 &o6, const T7 &o7, const T8 &o8, const T9 &o9, const T10 &o10, const T11 &o11, const T12 &o12) { UStringPrivate::Composition c(fmt); c.arg(o1).arg(o2).arg(o3).arg(o4).arg(o5).arg(o6).arg(o7).arg(o8).arg(o9) .arg(o10).arg(o11).arg(o12); return c.str(); } template inline Glib::ustring ucompose(const Glib::ustring &fmt, const T1 &o1, const T2 &o2, const T3 &o3, const T4 &o4, const T5 &o5, const T6 &o6, const T7 &o7, const T8 &o8, const T9 &o9, const T10 &o10, const T11 &o11, const T12 &o12, const T13 &o13) { UStringPrivate::Composition c(fmt); c.arg(o1).arg(o2).arg(o3).arg(o4).arg(o5).arg(o6).arg(o7).arg(o8).arg(o9) .arg(o10).arg(o11).arg(o12).arg(o13); return c.str(); } template inline Glib::ustring ucompose(const Glib::ustring &fmt, const T1 &o1, const T2 &o2, const T3 &o3, const T4 &o4, const T5 &o5, const T6 &o6, const T7 &o7, const T8 &o8, const T9 &o9, const T10 &o10, const T11 &o11, const T12 &o12, const T13 &o13, const T14 &o14) { UStringPrivate::Composition c(fmt); c.arg(o1).arg(o2).arg(o3).arg(o4).arg(o5).arg(o6).arg(o7).arg(o8).arg(o9) .arg(o10).arg(o11).arg(o12).arg(o13).arg(o14); return c.str(); } template inline Glib::ustring ucompose(const Glib::ustring &fmt, const T1 &o1, const T2 &o2, const T3 &o3, const T4 &o4, const T5 &o5, const T6 &o6, const T7 &o7, const T8 &o8, const T9 &o9, const T10 &o10, const T11 &o11, const T12 &o12, const T13 &o13, const T14 &o14, const T15 &o15) { UStringPrivate::Composition c(fmt); c.arg(o1).arg(o2).arg(o3).arg(o4).arg(o5).arg(o6).arg(o7).arg(o8).arg(o9) .arg(o10).arg(o11).arg(o12).arg(o13).arg(o14).arg(o15); return c.str(); } } #endif // STRING_UCOMPOSE_HPP compose/TODO0000644000175000017500000000006407641603223011336 0ustar oleoleLong-term: * Use m4 macros to generate the headers