- Boost-users - lists.boost.org

Distribution guidelines
by Edward Diener 12 Feb '02

12 Feb '02

I didn't see any guidelines for distributing the Boost header files in an implementation. Are there any ? As an example I may use only a small number of the header files for my distribution, so I assume I am not constrained to deliver all the header files nor am I constrained to deliver the full Boost distribution for any given version. While I can query the end-user during installation about having a specific version of Boost, and not install Boost files if the user does have a specific version, it does not seem as if I have to install the entire distribution, or even the entire set of header files if I am installing locally to my own directory structure. It would be nice if Boost actually had an install in its distribution because then , under Windows where I work, there would be a registry entry which I could read during the installation of any product which uses Boost. Has anyone ever suggested this, or is it seen as outside the boundaries of Boost ?

1 0

Regex questions
by Edward Diener 12 Feb '02

12 Feb '02

1) Support for Borland's C++ Builder 3 was dropped in moving the Regex++ implementation to Boost. Was this dropped because BCB3 can not support Boost, or Regex++, or was it just too much work to get it working with the Boost Regex++ version ? 2) Configuring Regex++ builds. Do I use user.hpp to configure the build, or is this used at the point of usage, or both ? If so, how do I know if BOOST_REGEX_NO_TEMPLATE_SWITCH_MERGE applies to a given compiler, and what does BOOST_REGEX_NO_W32 actually do. Finally what do the locale defines actually do ? Does defining the CPP or C locales constrain the Boost classes to use those locales or is it just setting a default locale which I can switch when instantiating the template classes ?

1 0

Poll results for Boost-Users
by Boost-Users＠yahoogroups.com 12 Feb '02

12 Feb '02

The following Boost-Users poll is now closed. Here are the final results: POLL QUESTION: Yahoo! groups can be configured so that only the moderators can view membership list, or so that membership lists can be viewed by anyone (email addresses are always munged for non-moderators; my email address would appear as something like jim.hyslop@.le...) Do you want the membership list to be freely available to be viewed by anyone, or do you want the membership list kept private so only the moderators can view the list? CHOICES AND RESULTS - I want only the moderators to be able to view the membership list, 0 votes, 0.00% - I want anyone to be able to view the membership list, 0 votes, 0.00% For more information about this group, please visit http://groups.yahoo.com/group/Boost-Users For help with Yahoo! Groups, please visit http://help.yahoo.com/help/us/groups/

2 2

Possible interest in select_by_predicate?
by Jonathan Brownell 11 Feb '02

11 Feb '02

I work in doing programming involving quite a bit of data analysis, and lately I've gotten sick and tired of doing routine searches on vectors and other linear containers to pull out maximum/minimum values. I ended up sitting down and writing a unary function object that retains a value based on any predicate. An example is worth a thousand words: int array[10] = { 5, 4, 6, 3, 9, 0, 7, 2, 8, 1 }; int maximum = std::for_each(&array[0], &array[10], select_by_predicate<int, std::greater>()); int minimum = std::for_each(&array[0], &array[10], select_by_predicate<int, std::less>()); assert(maximum == 9 && minimum == 0); Another example, using select_by_predicate independently: select_by_predicate<int, std::greater> max_error(0); for(loop through data samples) { double error; ... analyze data sample error ... max_error.compare(error); // same as max_error(error) } std::cout << "Maximum error: " << max_error; Is select_by_predicate something that boost users would be interested in? It's been helpful to me in all kinds of contexts. -Jonathan

3 4

Any use of a Singleton<> template
by sixfurdk 08 Feb '02

08 Feb '02

I currently working on a Singleton<> template, which currently has these features. 1) Supports the same interface/concepts as auto_ptr<> 2) One Line option to create a working singleton 3) Possible to use different Singletons of same type using names (simultaneously) 4) Possible to store different Singleton Objects under the same name (not simultaneously) 5) Possible to Release By Reference (Optional, Not Default) 6) Automatic Cleanup at program termination (Optional, Default) It can be used in the following manner: class SingletonObject { void someFunction(); ... }; Singleton<SingletonObject> singleton; singleton->someFunction(); Is there any interrest in such a class? Peter Sixhøj

2 2

tokenizer compilation problem with gcc 3.0.3 and stlport
by fintaeph 07 Feb '02

07 Feb '02

Hi all, I have been having trouble getting the tokenizer examples to compile using gcc 3.0.3 and stlport. I am using the example code from http://www.boost.org/libs/tokenizer/escaped_list_separator.htm, with the following compiler output: test.cpp: In instantiation of `::boost::::boost::iterator_ada ptor<::boost::detail::::boost::detail::token_iterator_base<co nst char *>,::boost::detail::::boost::detail::tokenizer_polic y<::_STL::::_STL::basic_string<char,::_STL::::_STL::char_trai ts<char>,::_STL::::_STL::allocator<char> >,::boost::::boost:: escaped_list_separator<char,::_STL::::_STL::char_traits<char> > >,::_STL::::_STL::basic_string<char,::_STL::::_STL::char_t raits<char>,::_STL::::_STL::allocator<char> >,const ::_STL::: :_STL::basic_string<char,::_STL::::_STL::char_traits<char>,:: _STL::::_STL::allocator<char> > &,const ::_STL::::_STL::basic _string<char,::_STL::::_STL::char_traits<char>,::_STL::::_STL ::allocator<char> > *,::_STL::forward_iterator_tag,int>': test.cpp:11: instantiated from here test.cpp:11: `sizeof' applied to incomplete type `::boost:::: boost::STATIC_ASSERTION_FAILURE<false>' If anyone has encountered and solved this problem before, I would greatly appreciate knowing what I'm doing wrong. Thanks, Chris. P.S. I get similar results with all the tokenizer examples.

3 3

modifed boost::stringtok
by hicks 06 Feb '02

06 Feb '02

Hello, I have created a modifed version of boost::stringtok() (the template function in boost\pending) with the aim of proving a more convient programmer interface. (It is called stringtok_2() below, but the interface is identical to stringtok()). The present version expects a container of objects which can be assigned a std::string. The modifed version is designed to accept a container of objects which can be converted to from std::string, at present "int" and "float" in addition to "std::string". E.g. char ac[] = "1 2 3 4 5"; std::vector<int> vi; boost::stringtok_2(vi,ac); std::vector<float> vf; boost::stringtok_2(vf,ac); std::vector<std::string> vs; boost::stringtok_2(vs,ac); As you can see in the cases for "int" and "float", the programmer can avoid having to create a vector of std::string and then convert them to int (or float) after calling stringtok. The implementation is achieved through template specialization. Behind the interface is an overloaded stringtok_2, template<typename Container, class Cvt> stringtok_2(Container l, Cvt cvt, const std::string s, const std::string ws) which takes a functor argument cvt which does the string to type conversion. The hithertoe used interface template<typename Container> stringtok_2(Container l, const std::string s, const std::string ws) calls the overloaded stringtok_2 with a converting functor string_cvt_ftr<Container::value_type>. string_cvt_ftr has a default declaration and two specializations, one for "int" and one for "float". template <class T> struct string_cvt_ftr { T operator()(const std::string& s) { return s; } }; template <> struct string_cvt_ftr<int> { int operator()(const std::string& s) { return std::atoi(s.c_str()); } }; template <> struct string_cvt_ftr<float> { float operator()(const std::string& s) { return std::atof(s.c_str()); } }; That is the partial specialization. Note that a vector of std::string can still be passed as the container argument. Since the interface semantics of are a superset of boost::stringtok(), I wonder if this could be substituted as a version-up, and use the same name. However, judging from the mail I see on this list, it is possible that some compilers might not handle it, so maybe that wouldn't be a good idea. I am sending this to boost-users since I do not currently recieve plain boost mail. I include the full code (including test code) below. Craig Hicks Engineer, KGK Tokyo //////////////////////////////////////////////////////////////////// // stringtok_2.h //--------------------------------------------------------------------------- #ifndef stringtok_2H #define stringtok_2H //--------------------------------------------------------------------------- #include <string> #include <cstring> // for strchr /***************************************************************** // modified with partial template specialization for int, float containers 2002.2.6 // Craig Hicks /***************************************************************** * This is the only part of the implementation that I don't like. * It can probably be improved upon by the reader... */ namespace stringtok_2_ns { inline bool isws (char c, char const * const wstr) { using namespace std; return (strchr(wstr,c) != NULL); } } namespace boost { /***************************************************************** * Simplistic and quite Standard, but a bit slow. This should be * templatized on basic_string instead, or on a more generic StringT * that just happens to support ::size_type, .substr(), and so on. * I had hoped that "whitespace" would be a trait, but it isn't, so * the user must supply it. Enh, this lets them break up strings on * different things easier than traits would anyhow. */ template <typename Container, typename Cvt> void stringtok_2 ( Container &l, Cvt cvt, std::string const &s, char const * const ws = " \t\n" ) { using namespace stringtok_2_ns; typedef std::string::size_type size_type; const size_type S = s.size(); size_type i = 0; while (i < S) { // eat leading whitespace while ((i < S) && (isws(s[i],ws))) ++i; if (i == S) return; // nothing left but WS // find end of word size_type j = i+1; while ((j < S) && (!isws(s[j],ws))) ++j; // add word l.push_back(cvt(s.substr(i,j-i))); // set up for next loop i = j+1; } } template <class T> struct string_cvt_ftr { T operator()(const std::string& s) { return s; } }; template <> struct string_cvt_ftr<int> { int operator()(const std::string& s) { return std::atoi(s.c_str()); } }; template <> struct string_cvt_ftr<float> { float operator()(const std::string& s) { return std::atof(s.c_str()); } }; template <typename Container> void stringtok_2 ( Container &l, std::string const &s, char const * const ws = " \t\n" ) { string_cvt_ftr<Container::value_type> cvt; stringtok_2(l, cvt, s, ws); } } // namespace boost #endif /////////////////////////////////////////////////////////////////// // test code void test_stringtok_2(std::ostream& os) /* Expected output:: int 1, 2, 3, 4, 5, float 1, 2, 3, 4, 5, string 1, 2, 3, 4, 5, */ { char ac[] = "1 2 3 4 5"; os << "int" << std::endl; std::vector<int> vi; boost::stringtok_2(vi,ac); std::copy(vi.begin(), vi.end(), std::ostream_iterator<int,char>(os,", ")); os << std::endl; os << "float" << std::endl; std::vector<float> vf; boost::stringtok_2(vf,ac); std::copy(vf.begin(), vf.end(), std::ostream_iterator<float,char>(os,", ")); os << std::endl; os << "string" << std::endl; std::vector<std::string> vs; boost::stringtok_2(vs,ac); std::copy(vs.begin(), vs.end(), std::ostream_iterator<std::string,char>(os,", ")); os << std::endl; }

2 2

Tokenizer question
by Edward Diener 06 Feb '02

06 Feb '02

Two tokenizer questions 1) I do not understand the constructor parameters to the char_delimits_separator class which is the default TokenizerFunction model. I assume the constructor would enable one to specify the delimiters for each token. I assume that the "returnable" parameter is a string literal of delimiters which are also returned as tokens and that "nonreturnable" is a string literal of delimiters which are not returned as tokens. I assume that the intersection of these string literals consists of all the delimiters. Given these assumptions, what is the purpose of the bool "return_delims" first parameter ? If "returnable" specifies a non-empty string literal, then why shouldn't these be the delimiters returned as tokens irregardless of the setting of "return_delims". If "returnable" specifies an empty string literal, then no delimiters will be returned as tokens once again irregardless of the setting of "return_delims". Would someone please explain why "return_delims" exists as a parameter in conjunction with the meaning of the "returnable" parameter ? It seems utterly redundant and unnecessary. 2) How does one create one own's TokenizerFunction to be plugged into the tokenizer class template as the first template type ? The documentation on TokenizerFunction concept leaves me utterly confused on a practical level. I assume I am creating a template class here despite the name which suggests it is a function, but the documentation never explains what it is. Maybe someone from Boost or John Bandela should consider updating it.

2 2

Another Tokenizer question
by s1imshady86 06 Feb '02

06 Feb '02

How do you specify that a white space is a returnable delimiter? The obvious, char_delimiters_separator<char> func (true, " "); Doesnt work. I know it's rather newbish question, but please help. A little more documentaion on token_iterator and TokenizerFunction concept (and perhaps the three specialized ones) would help greatly! Thanks, Ray

1 0

[Fwd: Re: [Boost-Users] Four Questions on boost::shared_ptr]
by hicks 05 Feb '02

05 Feb '02

-------- Original Message -------- Subject: Re: [Boost-Users] Four Questions on boost::shared_ptr Date: Tue, 05 Feb 2002 10:08:25 +0900 From: hicks <hicks(a)kgk.co.jp> To: Boost-Users(a)yahoogroups.com, Duane Murphy <duanemurphy(a)mac.com> References: <B8838630.133F2%darin(a)bentspoon.com> <20020204170343.12718(a)mail.murphyslogic.com> Hi >>You should normally use std::vector unless you have some special reason to >>use boost:: scoped_array and boost::shared_array. Those classes are provided >>both for completeness, and because occasionally there are such special >>reasons. But not often. > >I consider user vector<> often. However there is a cost. For a fixed size >allocation of a buffer there is only the data allocated. If you use a >vector<> the vector also includes (for most implementations) the current >capacity, the current size, and the allocator. There is another sometimes very big overhead incurred by std::vector, and not incurred by by new T[]/ delete[]. Most implementions of std::vector will enter a loop and call a destructor on each element of the array, even if there is no machine code associated with that destructor. At least Borlands implemention of delete[] automatically detects this condition and does not insert a loop to call the destructors. This could be avoided if std::vector used a traits type to determine whether to enter a loop calling destructors. Craig Hicks KGK Tokyo Duane Murphy wrote: >--- At Mon, 4 Feb 2002 00:28:32 -0800, Darin Adler wrote: > >>On 2/3/02 11:54 PM, "Jon Wang" <webmaster(a)boost.100ok.com> <mailto:webmaster@boost.100ok.com> wrote: >> >>>1. Mr Stroustrup said that there wasn't a need for auto_array, for "a >>> >better > >>>solution is to use a vector". So, should we use vector or >>>scoped_array/shared_array? >>> >>You should normally use std::vector unless you have some special reason to >>use boost:: scoped_array and boost::shared_array. Those classes are provided >>both for completeness, and because occasionally there are such special >>reasons. But not often. >> > >I consider user vector<> often. However there is a cost. For a fixed size >allocation of a buffer there is only the data allocated. If you use a >vector<> the vector also includes (for most implementations) the current >capacity, the current size, and the allocator. > >I would be interested in finding a class that is somewhere between >allocating my own buffers and vector<>. Low overhead for simple >allocations; no resizing or growing. Even in this case, in order to >support iterator semantics the size is going to be needed. > >Sigh. > >I suppose a case like this might be when scoped_array would be used? > > ...Duane > > > > >Info: <http://www.boost.org> >Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> >Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > >Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/ > > > > >

1 0